Contents
1.3 Typical Language Processing System
1.4.2 Intermediate Code Generator
1.4.5 Symbol Table Manager and Error Handler
1.7.2 Advantages of Bootstrapping
1.9 Modern Compilers—Design Need for Compilers
1.10 Application of Compiler Design Principles
Key for Objective Question Bank
2.2 Advantages of Separating Lexical Analysis from Syntax Analysis
2.3 Secondary Tasks of a Lexical Analyzer
2.4 Error Recovery in Lexical Analysis
2.6 Strategies for Implementing a Lexical Analyzer
2.10.2 Properties of the Transition Function “δ”
2.10.6 Finite Automation Is of Two Types
2.10.7 Deterministic Finite Dutomaton (DFA)
2.10.8 Nondeterministic Finite Automaton (NFA)
2.10.9 Equivalence of DFAs and NFAs
2.10.10 Converting NFA (MN) to DFA (MD)—Subset Construction
2.10.11 NFA with Epsilon (ε)-Transitions
2.10.12 Epsilon Closure (ε-closure)
2.10.13 Eliminating ε- Transitions
2.10.14 Converting NFA with ε-Transition to NFA Without ε-Transition
2.10.15 Converting NFA with ε-Transition to DFA
2.10.16 Comparison Method for Testing Equivalence of Two FAs
2.10.17 Reduction of the Number of States in FA
2.10.19 Minimization of DFA Using the Myhill Nerode Theorem
2.11 Lex Tool: Lexical Analyzer Generator
Key for Objective Question Bank
3. Syntax Definition – Grammars
3.2 Types of Grammars—Chomsky Hierarchy
3.6 Language Defined by Grammars
3.6.1 Leftmost and Rightmost Derivation
3.6.3 Equivalence of Parse Trees and Derivations
3.12 Non-context Free Language Constructs
3.13 Simplification of Grammars
Key for Objective Question Bank
4. Syntax Analysis—Top-Down Parsers
4.2.1 Panic Mode Error Recovery
4.5.1 Recursive Descent Parser
4.5.2 Nonrecursive Descent Parser—LL(1) Parser
4.5.3 Algorithm for LL(1) Parsing
4.5.4 First(α), Where α Is Any String of Grammar Symbols
4.5.5 Follow (A) Where ‘A’ is a Nonterminal
4.6 Construction of Predictive Parsing Tables
4.8 Error Recovery in Predictive Parsing
Key for Objective Question Bank
5.4 Types of Bottom-Up Parsers
5.5 Operator Precedence Parsing
5.5.3 Parsing Algorithm for Operator Precedence Parser
5.5.4 Construction of the Precedence Relation Table
5.5.5 Mechanical Method of Constructing Operator Precedence Table
5.5.6 Calculating Operator Precedence Relation <· ·> =
5.5.7 Error Recovery in Operator Precedence Parser
5.5.8 Procedure for Converting Precedence Relation Table to Precedence Function Table
5.8.1 Task of LR Parser: Detect Handle and Reduce Handle
5.9 Construction of the LR Parsing Table
5.9.5 Creating Canonical Collection “C” of LR(O) Items
5.9.6 Construction of DFA with a Set of Items
5.10.1 Advantages of the LR(0) Parser
5.10.2 Disadvantages of the LR(0) Parser
5.10.4 Conflicts in Shift-Reduce Parsing
5.12 Canonical LR(1) Parsers CLR(1)/LR(1)
5.12.1 Closure (I) Where I Is a Set of LR(l) Items
5.12.3 Creating Canonical Collection “C” of LR(1) Items
5.12.4 Constructing CLR(1) Parsing Table
5.14 Comparison of Parsers: Top-Down Parser vs. Bottom-Up Parser
5.15 Error Recovery in LR Parsing
5.16 Parser Construction with Ambiguous Grammars
Key for Objective Question Bank
6. Syntax-Directed Translation
6.2 Attributes for Grammar Symbols
6.3 Writing Syntax-Directed Translation
6.4 Bottom-Up Evaluation of SDT
6.5 Creation of the Syntax Tree
6.6 Directed Acyclic Graph (DAG)
6.9 Top-Down Evaluation of S-Attributed Grammar
6.11 Converting L-Attributed to S-Attributed Definition
Key for Objective Question Bank
7.4 Design of Simple Type Checker
7.5 Type Checking of Expressions
7.6 Type Checking of Statements
7.7 Type Checking of Functions
7.8 Equivalence of Type Expressions
7.8.2 Encoding of Type Expressions
7.10 Overloading of Functions and Operators
Key for Objective Question Bank
8. Intermediate Code Generation
8.2.2 Directed Acyclic Graph (DAG)
8.3 Types of Three Address Statements
8.4 Representation of Three Address Code
8.4.4 Comparison of Representations
8.5 Syntax-Directed Translation into Three Address Code
8.5.2 Addressing Array Elements
Key for Objective Question Bank
9.3 Operations on the Symbol Table
9.5 Non-block Structured Language
9.5.1 Linear List in Non-block Structured Language
9.5.2 Linked List or Self-organizing Tables
9.6.2 Stack-Implemented Tree-structured Symbol Tables
9.6.3 Stack-Implemented Hash-structured Symbol Table
Key for Objective Question Bank
10.2 Where and How to Optimize
10.3 Procedure to Identify the Basic Blocks
10.5 DAG Representation of Basic Block
10.6.1 Algorithm for Construction of DAG
10.7 Principle Source of Optimization
10.8 Function-Preserving Transformations
10.8.1 Common Sub-expression Elimination
10.9.1 A Loop Invariant Computation
10.10.4 Live Variable Analysis
10.10.6 Data Flow Analysis of Structured Programs
10.10.7 Representation of Sets
10.10.8 Iterative Algorithm for Reaching Definition
10.11 Machine-Dependent Optimization
10.11.1 Redundant Loads and Stores
10.11.2 Algebraic Simplification
10.11.4 Flow-of-Control Optimization
Key for Objective Question Bank
11.2 Issues in the Design of a Code Generator
11.2.1 Input to the Code Generator
11.2.6 Choice of Evaluation Order
11.3 Approach to Code Generation
11.3.1 Algorithm for Code Generation Using Three Address Code
11.5 Register Allocation and Assignment
11.5.2 Global Register Allocation
11.5.4 Register Assignment for Outer Loop
11.5.5 Graph Coloring for Register Assignment
11.6 Code Generation Using DAG