A Retargetable C Compiler: Design and Implementation (Hardcover)

David R. Hanson, Christopher W. Fraser

  • 出版商: Addison-Wesley Professional
  • 出版日期: 1995-02-10
  • 定價: USD $69.99
  • 售價: $780
  • 貴賓價: 9.8$764
  • 語言: 英文
  • 頁數: 592
  • 裝訂: Paperback
  • ISBN: 0805316701
  • ISBN-13: 9780805316704

無法訂購

買這商品的人也買了...

商品描述


Description

Designed as a self-study guide, the book describes the real-world tradeoffs encountered in building a production-quality, platform-retargetable compiler. The authors examine the implementation of lcc, a production-quality, research-oriented retargetable compiler, designed at AT&T Bell Laboratories for the ANSI C programming language. The authors' innovative approach-a "literate program" that intermingles the text with the source code-uses a line-by-line explanation of the code to demonstrate how lcc is built.

Back to Top


Table Of Contents

Preface.
1. Introduction.
Literate Programs.
How to Read This Book.
Overview.
Design.
Common Declarations.
Syntax Specifications.
Errors.

2. Storage Management.
Memory Management Interface.
Arena Representation.
Allocating Space.
Deallocating Space.
Strings.

3. Types.
Representing Symbols.
Representing Symbol Tables.
Changing Scope.
Finding and Installing Identifiers.
Labels.
Constants.
Generated Variables.

4. Code Generation Interface.
Representing Types.
Type Management.
Type Predicates.
Type Constructors.
Function Types.
Structure and Enumeration Types.
Type-Checking Functions.
Type Mapping.

5. Lexical Analysis.
Type Metrics.
Interface Records.
Symbols.
Types.
Dag Operators.
Interface Flags.
Initialization.
Definitions.
Constants.
Functions.
Interface Binding.
Upcalls.

6. Parsing.
Input.
Recognizing Tokens.
Recognizing Keywords.
Recognizing Identifiers.
Recognizing Numbers.
Recognizing Character Constants and Strings.

7. Expressions.
Languages and Grammars.
Ambiguity and Parse Trees.
Top-Down Parsing.
FIRST and FOLLOW Sets.
Writing Parsing Functions.
Handling Syntax Errors.

8. Expression Semantics.
Representing Expressions.
Parsing Expressions.
Parsing C Expressions.
Assignment Expressions.
Conditional Expressions.
Binary Expressions.
Unary and Postfix Expressions.
Primary Expressions.

9. Expression Semantics.
Conversions.
Unary and Postfix Operators.
Function Calls.
Binary Operators.
Assignments.
Conditionals.
Constant Folding.

10. Statements.
Representing Code.
Execution Points.
Recognizing Statements.
If Statements.
Labels and Gotos.
Loops.
Switch Statements.
Return Statements.
Managing Labels and Jumps.

11. Declarations.
Translation Units.
Declarations.
Declarators.
Function Declarators.
Structure Specifiers.
Function Definitions.
Compound Statements.
Finalization.
The Main Program.

12. Generating Immediate Code.
Eliminating Common Subexpressions.
Building Nodes.
Flow of Control.
Assignments.
Function Calls.
Enforcing Evaluation Order.
Driving Code Generation.
Eliminating Multiply Referenced Nodes.

13. Structuring the Code Generator.
Organization of the Code Generator.
Interface Extensions.
Upcalls.
Node Extensions.
Symbol Extensions.
Frame Layout.
Generating Code to Copy Blocks.
Initialization.

14. Selecting and Emitting instructions.
Specifications.
Labelling the Tree.
Reducing the Tree.
Cost Functions.
Debugging.
The Emitter.
Register Targeting.
Coordinating Instruction Selection.
Shared Rules.

15. Register Allocation.
Organization.
Tracking the Register State.
Allocating Registers.
Spilling.

16. Generating MIPS R3000 Code.
Registers.
Selecting Instructions.
Implementing Functions.
Defining Data.
Segments.
Copying Blocks.

17. Generating SPARC Code.
Registers.
Selecting Instructions.
Implementing Functions.
Defining Data.
Copying Blocks.

18. Generating X86 Code.
Registers.
Selecting Instructions.
Implementing Functions.
Defining Data.

19. Retrospective.
Data Structures.
Interface.
Syntactic and Semantic Analyses.
Code Generation and Optimization.
Testing and Validation.

Bibliography.
Index.
How to Obtain ICC. 0805316701T04062001


Back to Top