Crafting a Compiler With C (Hardcover)
Charles N. Fischer, Richard J. LeBlanc Jr.
- 出版商: Benjamin Cummins
- 出版日期: 1991-07-11
- 售價: $4,780
- 貴賓價: 9.5 折 $4,541
- 語言: 英文
- 頁數: 832
- 裝訂: Paperback
- ISBN: 0805321667
- ISBN-13: 9780805321661
-
相關分類:
C 程式語言、Compiler 編譯器
-
其他版本:
Crafting a Compiler With C (IE-Paperback)
下單後立即進貨 (約2~4週)
買這商品的人也買了...
-
$1,050$998 -
$1,200$1,176 -
$680$578 -
$2,200$2,090 -
$990$970 -
$1,150$1,127 -
$600$510 -
$880$695 -
$1,300$1,235 -
$1,050$998 -
$860$731 -
$1,030$1,009 -
$650$553 -
$1,650$1,568 -
$780$741 -
$760$646 -
$590$466 -
$690$538 -
$650$618 -
$780$663 -
$720$612 -
$750$638 -
$560$476 -
$390$304 -
$880$695
相關主題
商品描述
Table Of Contents
(Each chapter contains "Exercises".)
Introduction.
What Do Compilers Do?
The Structure of a Compiler.
The Syntax and Semantics of Programming Languages.
Compiler Design and Programming Language Design.
Compiler Classifications.
Influences On Computer Design.
Exercises.
A Simple Compiler.
A Micro Scanner.
The Syntax of Micro.
Recursive Descent Parsing.
Translating Micro.
Exercises.
Scanning--Theory and Practice.
Regular Expressions.
Finite Automata and Scanners.
Using a Scanner Generator.
Practical Considerations.
Translating Regular Expressions Into Finite Automata.
Exercises.
Grammars and Parsing.
Errors in Context-Free Grammars.
Transforming Extended Bnf Grammars.
Parsers and Recognizers.
Grammar Analysis Algorithms.
Exercises.
Ll(1) Grammars and Parsers.
The Ll(1) Parse Table.
Building Recursive Descent Parsers From Ll(1) Tables.
An Ll(1) Parser Driver.
Ll(1) Action Symbols.
Making Grammars Ll(1) / The If-Then-Else Problem in Ll(1) Parsing.
The Llgen Parser Generator.
Properties of Ll(1) Parsers.
Ll(K) Parsing.
Exercises.
Lr Parsing.
Lr Parsers.
Lr(1) Parsing.
Slr(1) Parsing.
Lalr(1).
Calling Semantic Routines in Shift-Reduce Parsers.
Using a Parser Generator.
Optimizing Parse Tables.
Practical Lr(1) Parsers.
Properties of Lr Parsers.
Ll(1) Or Lalr(1), That Is The Question.
Other Shift-Reduce Techniques.
Exercises.
Semantic Processing.
Semantic Processing Techniques.
Intermediate Representations and Code Generation.
Exercises.
Symbol Tables.
Basic Implementation Techniques.
Block-Structured Symbol Tables.
Extensions to Block-Structured Symbol Tables.
Implicit Declarations.
Overloading.
Forward References.
Summary.
Exercises.
Run-Time Storage Organization.
Stack Allocation.
Heap Allocation.
Program Layout in Memory.
Static and Dynamic Chains.
Formal Procedures.
Exercises.
Processing Declarations.
Action Routines for Simple Declarations.
Action Routines for Advanced Features.
Exercises.
Processing Expressions and Data Structure References.
Action Routines for Simple Names, Expressions, and Data Structures.
Action Routines for Advanced Features.
Exercises.
Translating Control Structures.
Loops.
Compiling Exits.
The Case Statement.
Compiling Goto Statements.
Exception Handling.
Short-Circuit Boolean Expressions.
Exercises.
Translating Procedures and Functions.
Passing Parameters to Subprograms.
Processing Subprogram Calls and Parameter Lists.
Subprogram Invocation.
Label Parameters.
Name Parameters.
Exercises.
Attribute Grammars and Multipass Translation.
Tree-Structured Intermediate Representations.
Exercises.
Code Generation and Local Code Optimization.
Register and Temporary Management.
A Simple Code Generator.
Interpretive Code Generation.
Peephole Optimization.
Generating Code From Trees.
Generating Code From Dags.
Code Generator Generators.
Exercises.
Global Optimization.
Optimizing Subprogram Calls.
Loop Optimization.
Global Data Flow Analysis.
Putting it All Together.
Exercises.
Parsing in The Real World.
Syntactic Error Recovery and Repair.
Exercises.
Appendices.
B. Scangen.
C. Llgen User Manual.
D. Lalrgen User Manual.
E. Error-Repair Features of Llgen and Lalrgen.
F. Compiler Development Utilities.
Bibliography.
Supplements
Instructor Supplements
For more information about any of the supplements listed below, use our Rep. Locator to contact your Addison Wesley representative.
- Instructor's Guide / 0-8053-2167-5