CJT^jL rafting Cm ompiler

Transcription

1 CJT^jL rafting Cm ompiler ij CHARLES N. FISCHER Computer Sciences University of Wisconsin Madison RON K. CYTRON Computer Science and Engineering Washington University RICHARD J. LeBLANC, Jr. Computer Science and Software Engineering Seattle University f ^ TECHNISCHE INFORMATION SB IBLIOTHEK UNIVERSITATSBIBLIOTHEK HANNOVER V J TIB/UB Hannover Boston Columbus Indianapolis New York San Francisco Upper SaddK Amsterdam Cape Town Dubai London Madrid Milan Munich Paris Montreal Toronto Delhi Mexico City Sao Paulo Sydney Hong Kong Seoul Singapore Taipei Tokyo

2 Contents 1 Overview History of Compilation What Compilers Do Machine Code Generated by Compilers Target Code Formats Interpreters Syntax and Semantics Static Semantics Runtime Semantics Organization of a Compiler The Scanner The Parser The Type Checker (Semantic Analysis) Translator (Program Synthesis) Symbol Tables The Optimizer The Code Generator Compiler Writing Tools Programming Language and Compiler Design Computer Architecture and Compiler Design Compiler Design Considerations Debugging (Development) Compilers Optimizing Compilers Retargetable Compilers Integrated Development Environments 52 Exercises 54 17

3 18 Contents 2 Design of a Simple Compiler An Informal Definition of the ac Language Formal Definition of ac Syntax Specification Token Specification Phases of a Simple Compiler Scanning Parsing Predicting a Parsing Procedure Implementing the Production Abstract Syntax Trees Semantic Analysis Symbol Tables Type Checking Code Generation 79 Exercises 82 3 Theory and Practice of Scanning Overview of a Scanner Regular Expressions Examples Finite Automata and Scanners Deterministic Finite Automata The Lex Scanner Generator Defining Tokens in Lex The Character Class Using Regular Expressions to Define Tokens Character Processing Using Lex Other Scanner Generators Practical Considerations of Building Scanners Processing Identifiers and Literals 108

4 Contents Using Compiler Directives and Listing Source Lines.. Ill Terminating the Scanner Multicharacter Lookahead Performance Considerations Lexical Error Recovery Regular Expressions and Finite Automata Transforming a Regular Expression into an NFA Creating the DFA Optimizing Finite Automata Translating Finite Automata into Regular Expressions Summary 131 Exercises Formal Grammars and Parsing Context-Free Grammars Leftmost Derivations Rightmost Derivations Parse Trees Other Types of Grammars Properties of CFGs Reduced Grammars Ambiguity Faulty Language Definition Transforming Extended Grammars Parsers and Recognizers Grammar Analysis Algorithms Grammar Representation Deriving the Empty String First Sets Follow Sets 164 Exercises 168

5 20 Contents 5 Top-Down Parsing Overview LL(fc) Grammars Recursive-Descent LL(1) Parsers Table-Driven LL(1) Parsers Obtaining LL(1) Grammars Common Prefixes Left Recursion A Non-LL(1) Language Properties of LL(1) Parsers Parse Table Representation Compaction Compression Syntactic Error Recovery and Repair Error Recovery Error Repair Error Detection in LL(1) Parsers Error Recovery in LL(1) Parsers 203 Exercises Bottom-Up Parsing Overview Shift-Reduce Parsers LR Parsers and Rightmost Derivations LR Parsing as Knitting LR Parsing Engine The LR Parse Table LR(Jfc) Parsing LR(0) Table Construction Conflict Diagnosis Ambiguous Grammars 231

6 Contents Grammars that are not LR(fc) Conflict Resolution and Table Construction SLR(fc) Table Construction LALR(fc) Table Construction LALR Propagation Graph LR(fc) Table Construction 251 Exercises Syntax-Directed Compilation Overview Semantic Actions and Values Synthesized and Inherited Attributes Bottom-Up Syntax-Directed Translation Example Rule Cloning Forcing Semantic Actions Aggressive Grammar Restructuring Top-Down Syntax-Directed Translation Abstract Syntax Trees Concrete and Abstract Trees An Efficient AST Data Structure Infrastructure for Creating ASTs AST Design and Construction Design Construction AST Structures for Left and Right Values Design Patterns for ASTs Node Class Hierarchy Visitor Pattern Reflective Visitor Pattern 300 Exercises 304

7 22 Contents 8 Declaration Processing and Symbol Tables Constructing a Symbol Table Static Scoping A Symbol Table Interface Block-Structured Languages and Scopes Handling Scopes One Symbol Table or Many? Basic Implementation Techniques Entering and Finding Names The Name Space An Efficient Symbol Table Implementation Advanced Features Records and Typenames Overloading and Type Hierarchies Implicit Declarations Export and Import Directives Altered Search Rules Declaration Processing Fundamentals Attributes in the Symbol Table Type Descriptor Structures Type Checking Using an Abstract Syntax Tree Variable and Type Declarations Simple Variable Declarations Handling Type Names Type Declarations Variable Declarations Revisited Static Array Types Struct and Record Types Enumeration Types Class and Method Declarations Processing Class Declarations Processing Method Declarations An Introduction to Type Checking Simple Identifiers and Literals 359

8 Contents Assignment Statements Checking Expressions Checking Complex Names Summary 366 Exercises Semantic Analysis Semantic Analysis for Control Structures Reachability and Termination Analysis If Statements While, Do, and Repeat Loops For Loops Break, Continue, Return, and Goto Statements Switch and Case Statements Exception Handling Semantic Analysis of Calls Summary 416 Exercises Intermediate Representations Overview Examples The Middle-End Java Virtual Machine Introduction and Design Principles Contents of a Class File JVM Instructions Static Single Assignment Form Renaming and ^-functions 443 Exercises 446

9 24 Contents 11 Code Synthesis for Virtual Machines Visitors for Code Generation Class and Method Declarations Class Declarations Method Declarations The MethodBodyVisitor Constants References to Local Storage Static References Expressions Assignment Method Calls Field References Array References Conditional Execution Loops The LHSVisitor Local References Static References Field References Array References 471 Exercises Runtime Support Static Allocation Stack Allocation Field Access in Classes and Structs Accessing Frames at Runtime Handling Classes and Objects Handling Multiple Scopes Block-Level Allocation 487

10 Contents More About Frames Arrays Static One-Dimensional Arrays Multidimensional Arrays Heap Management Allocation Mechanisms Deallocation Mechanisms Automatic Garbage Collection Region-Based Memory Management 511 Exercises Target Code Generation Translating Bytecodes Allocating memory addresses Allocating Arrays and Objects Method Calls Example of Bytecode Translation Translating Expression Trees Register Allocation On-the-Fly Register Allocation Register Allocation Using Graph Coloring Priority-Based Register Allocation Interprocedural Register Allocation Code Scheduling Improving Code Scheduling Global and Dynamic Code Scheduling Automatic Instruction Selection Instruction Selection Using BURS Instruction Selection Using Twig Other Approaches Peephole Optimization Levels of Peephole Optimization Automatic Generation of Peephole Optimizers 568 Exercises 570

11 26 Contents 14 Program Analysis and Optimization Overview Why Optimize? Control Flow Analysis Control Flow Graphs Program and Control Flow Structure Direct Procedure Call Graphs Depth-First Spanning Tree Dominance Simple Dominance Algorithm Fast Dominance Algorithm Dominance Frontiers Intervals Introduction to Data Flow Analysis Available Expressions Live Variables Data Flow Frameworks Data Flow Evaluation Graph Meet Lattice Transfer Functions Evaluation Iteration Initialization Termination and Rapid Frameworks Distributive Frameworks Constant Propagation SSA Form Placing ^-Functions Renaming 663 Exercises 668

12 Contents 27 Bibliography 683 Abbreviations 693 Pseudocode Guide 695 Index 699