Torben./Egidius Mogensen. Introduction. to Compiler Design. ^ Springer

Transcription

1 Torben./Egidius Mogensen Introduction to Compiler Design ^ Springer

2 Contents 1 Lexical Analysis Regular Expressions Shorthands Examples Nondeterministic Finite Automata Converting a Regular Expression to an NFA Optimisations Deterministic Finite Automata Converting an NFA to a DFA Solving Set Equations The Subset Construction Size Versus Speed Minimisation of DFAs Example Dead States Lexers and Lexer Generators Lexer Generators Properties of Regular Languages Relative Expressive Power Limits to Expressive Power Closure Properties Further Reading Exercises 33 References 37 2 Syntax Analysis Context-Free Grammars How to Write Context Free Grammars Derivation Syntax Trees and Ambiguity Operator Precedence 47 xiii

3 xiv Contents Rewriting Ambiguous Expression Grammars Other Sources of Ambiguity Syntax Analysis Predictive Parsing Nullable and FIRST 2.8 Predictive Parsing Revisited 2.9 FOLLOW 2.10 A Larger Example LL(1) Parsing Recursive Descent Table-Driven LL(1) Parsing Conflicts 2.12 Rewriting a Grammar for LL(1) Parsing Eliminating Left-Recursion Left-Factorisation Construction of LL(1) Parsers Summarized SLR Parsing Constructing SLR Parse Tables Conflicts in SLR Parse-Tables 2.15 Using Precedence Rules in LR Parse Tables Using LR-Parser Generators Declarations and Actions Abstract Syntax } Conflict Handling in Parser Generators Properties of Context-Free Languages Further Reading Exercises 85 References 90 3 Scopes and Symbol Tables Symbol Tables Implementation of Symbol Tables Simple Persistent Symbol Tables A Simple Imperative Symbol Table Efficiency Issues Shared or Separate/Name Spaces Further Reading Exercises References 4 Interpretation 4.1 The Structure of an Interpreter A Small Example Language An Interpreter for the Example Language Evaluating Expressions Interpreting Function Calls 102

4 Contents xv Interpreting a Program Advantages and Disadvantages of Interpretation Further Reading Exercises 105 References Type Checking The Design Space of Types Attributes Environments for Type Checking Type Checking Expressions Type Checking of Function Declarations Type Checking a Program Advanced Type Checking Further Reading Exercises 116 References Intermediate-Code Generation Choosing an Intermediate Language The Intermediate Language Syntax-Directed Translation Generating Code from Expressions Examples of Translation Translating Statements Logical Operators Sequential Logical Operators Advanced Control Statements Translating Structured Data Floating-Point Values Arrays Strings Records/Structs and Unions Translating Declarations Simple Local Declarations Translation of Function Declarations Further Reading Exercises 143 References Machine-Code Generation Conditional Jumps Constants Exploiting Complex Instructions Two-Address Instructions Optimisations Further Reading 155

5 xvj Contents 7.6 Exercises 155 References Register Allocation Liveness Liveness Analysis Interference Register Allocation by Graph Colouring Spilling Heuristics Removing Redundant Moves Using Explicit Register Numbers Further Reading Exercises 172 References 174.., Functions The Call Stack Activation Records Prologues, Epilogues and Call-Sequences Letting the Callee Save Registers Caller-Saves Versus Callee-Saves Using Registers to Pass Parameters Interaction with the Register Allocator Local Variables Accessing Non-local Variables Global Variables Call-by-Reference Parameters Functions as Parameters Variants Variable-Sized Frames Variable Number of Parameters Direction of Stack-Growth and Position of FP Register Stacks Further Reading 9.13 Exercises 190 References 192 Appendix Set Notation and Concepts 193 A.l Basic Concepts and Notation 193 A. 1.1 Operations and Predicates 193 A. 1.2 Properties of Set Operations 194 A.2 Set-Builder Notation 195 A.3 Sets of Sets 196 A.4 Set Equations 196

6 Contents xvii A.4.1 Monotonic Set Functions 197 A.4.2 Distributive Functions 198 A.4.3 Simultaneous Equations 199 Exercises 199 Index 201