List of Examples


Chapter 4: Top-Down Parsing

Table 4.1: Production Selections for Parsing Derivations
Table 4.2: Production Selections for Parsing Derivations
Table 4.3: Steps Involved in Parsing the String acdb
Table 4.4: Production Selections for String ab Parsing Derivations
Table 4.5: Production Selections for Parsing Derivations for the String adb
Table 4.6: Production Selections for Example 4.3 Parsing Derivations
Table 4.7: Production Selections for Example 4.5 Parsing Derivations
Table 4.8: Production Selections for Example 4.6 Parsing Derivations
Table 4.9: Production Selections for Example 4.7 Parsing Derivations
Table 4.10: Production Selections for Example 4.8 Parsing Derivations

Chapter 5: Bottom-up Parsing

Table 5.1: Sentential Form Handles
Table 5.2: Sentential Form Handles
Table 5.3: Steps in Parsing the String id + id * id
Table 5.4: ActionGOTO SLR Parsing Table
Table 5.5: SLR Parsing Table
Table 5.6: Action GOTO SLR Parsing Table
Table 5.7: CLR/LR Parsing Action GOTO Table
Table 5.8: LALR Parsing Table for a DFA Using a Reduced Collection
Table 5.9: SLR Parsing Table for Augmented Grammar
Table 5.10: SLR Parsing Table Reflects Higher Precedence and Left-Associativity
Table 5.11: SLR(1) Parsing Table
Table 5.12: SLR Parsing Table for Example 5.4
Table 5.13: Parsing Table for Example 5.5
Table 5.14: LALR(1) Parsing Table for Example 5.5
Table 5.15: LALR(1) Parsing Table for Example 5.6

Chapter 6: Syntax-Directed Definitions and Translations

Table 6.1: Quadruple Representation of x = ( a + b ) * ˆ c/d
Table 6.2: Triple Representation of x = ( a + b ) * ˆ c/d
Table 6.3: Indirect Triple Representation of x = ( a + b ) * ˆ c/d

Chapter 7: Symbol Table Management

Table 7.1: Symbol Table Contents Using a Nesting Depth Approach

Chapter 9: Error Handling

Table 9.1: Parsing Table for E E + E E * E id
Table 9.2: Higher Precedent * and Left-Associativity
Table 9.3: Parsing Table with Error Routines
Table 9.4: LR Parsing Table
Table 9.5: Phrase Level Error-Recovery Implementation

Chapter 10: Code Optimization

Table 10.1: GEN and KILL sets for Figure 10.4 Flow Graph
Table 10.2: IN and OUT Computation for Figure 10.5
Table 10.3: First Iteration for the IN and OUT Values
Table 10.4: Second Iteration for the IN and OUT Values
Table 10.5: Third Iteration for the IN and OUT Values
Table 10.6: Fourth Iteration for the IN and OUT Values

Chapter 11: Code Generation

Table 11.1: Six-Bit Registers for the Instruction MOV R0, R1
Table 11.2: Six-Bit Registers for the Instruction MOV R0, R2
Table 11.3: Six-Bit Registers for the Instruction MOV M1, M2
Table 11.4: Computation for the Expression x = ( a + b ) ˆ (( c + d ) ˆ e )
Table 11.5: Generated Code with Only Two Available Registers, R0 and R1
Table 11.6: Generated Code with Rearranged Computations
Table 11.7: Recursive Gencode Calls



Algorithms for Compiler Design
Algorithms for Compiler Design (Electrical and Computer Engineering Series)
ISBN: 1584501006
EAN: 2147483647
Year: 2005
Pages: 108
Authors: O G Kakde

flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net