Compiler Design

Subject : Compiler Design

INTRODUCTION TO COMPILERS
LEXICAL ANALYSIS
SYNTAX ANALYSIS
SYNTAX DIRECTED TRANSLATION & RUN TIME
ENVIRONMENT
CODE OPTIMIZATION AND CODE GENERATION
LEXICAL ANALYSIS
1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)

SYNTAX ANALYSIS and RUN TIME ENVIRONMENTS

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
 7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)

INTERMEDIATE CODE GENERATION

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)

CODE GENERATION
1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)

CODE OPTIMIZATION
1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)
43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
 48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)

Compilers Principles Techniques and Tools by Alfred V Aho

Monica S Lam Ravi Sethi Jeffrey D Ullman
Chapter 1 Introduction
1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
 27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)
43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)
53. Compilers - Principles, Techniques, & Tools - Answer (click here)
54. Language Processors - Answer (click here)
55. The Structure of a Compiler - Answer (click here)
56. The Evolution of Programming Languages - Answer (click here)
57. The Science of Building a Compiler - Answer (click here)
58. Applications of Compiler Technology - Answer (click here)
59. Programming Language Basics - Answer (click here)

Chapter 2 Simple Syntax Directed Translator

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
 2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
 39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)
43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)
53. Compilers - Principles, Techniques, & Tools - Answer (click here)
54. Language Processors - Answer (click here)
55. The Structure of a Compiler - Answer (click here)
56. The Evolution of Programming Languages - Answer (click here)
57. The Science of Building a Compiler - Answer (click here)
58. Applications of Compiler Technology - Answer (click here)
59. Programming Language Basics - Answer (click here)
60. A Simple Syntax-Directed Translator - Answer (click here)
61. Syntax Definition - Answer (click here)
62. Syntax-Directed Translation - Answer (click here)
63. Parsing - Answer (click here)
64. A Translator for Simple Expressions - Answer (click here)
65. Lexical Analysis - Answer (click here)
66. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
67. Intermediate Code Generation - Answer (click here)

Chapter 3 Lexical Analysis

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
 7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)
 43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)
53. Compilers - Principles, Techniques, & Tools - Answer (click here)
54. Language Processors - Answer (click here)
55. The Structure of a Compiler - Answer (click here)
56. The Evolution of Programming Languages - Answer (click here)
57. The Science of Building a Compiler - Answer (click here)
58. Applications of Compiler Technology - Answer (click here)
59. Programming Language Basics - Answer (click here)
60. A Simple Syntax-Directed Translator - Answer (click here)
61. Syntax Definition - Answer (click here)
62. Syntax-Directed Translation - Answer (click here)
63. Parsing - Answer (click here)
64. A Translator for Simple Expressions - Answer (click here)
65. Lexical Analysis - Answer (click here)
66. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
67. Intermediate Code Generation - Answer (click here)
68. Lexical Analysis - Answer (click here)
69. The Role of the Lexical Analyzer - Answer (click here)
70. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
71. Specification of Tokens - Answer (click here)
72. Recognition of Tokens - Answer (click here)
73. The Lexical-Analyzer Generator Lex - Answer (click here)
74. Finite Automata - Answer (click here)
75. From Regular Expressions to Automata - Answer (click here)
76. Design of a Lexical-Analyzer Generator - Answer (click here)
77. Optimization of DFA-Based Pattern Matchers - Answer (click here)

Chapter 4 Syntax Analysis

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
 2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)
43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)
53. Compilers - Principles, Techniques, & Tools - Answer (click here)
54. Language Processors - Answer (click here)
55. The Structure of a Compiler - Answer (click here)
56. The Evolution of Programming Languages - Answer (click here)
57. The Science of Building a Compiler - Answer (click here)
58. Applications of Compiler Technology - Answer (click here)
59. Programming Language Basics - Answer (click here)
60. A Simple Syntax-Directed Translator - Answer (click here)
61. Syntax Definition - Answer (click here)
62. Syntax-Directed Translation - Answer (click here)
63. Parsing - Answer (click here)
64. A Translator for Simple Expressions - Answer (click here)
65. Lexical Analysis - Answer (click here)
66. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
67. Intermediate Code Generation - Answer (click here)
68. Lexical Analysis - Answer (click here)
69. The Role of the Lexical Analyzer - Answer (click here)
70. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
71. Specification of Tokens - Answer (click here)
72. Recognition of Tokens - Answer (click here)
73. The Lexical-Analyzer Generator Lex - Answer (click here)
74. Finite Automata - Answer (click here)
75. From Regular Expressions to Automata - Answer (click here)
76. Design of a Lexical-Analyzer Generator - Answer (click here)
 77. Optimization of DFA-Based Pattern Matchers - Answer (click here)
78. Syntax Analysis - Answer (click here)
79. Context-Free Grammars - Answer (click here)
80. Writing a Grammar - Answer (click here)
81. Top-Down Parsing - Answer (click here)
82. Bottom-Up Parsing - Answer (click here)
83. Introduction to LR Parsing: Simple LR - Answer (click here)
84. More Powerful LR Parsers - Answer (click here)
85. Using Ambiguous Grammars - Answer (click here)
86. Parser Generators - Answer (click here)

Chapter 5 Syntax Directed Translation

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)
43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)
53. Compilers - Principles, Techniques, & Tools - Answer (click here)
54. Language Processors - Answer (click here)
55. The Structure of a Compiler - Answer (click here)
56. The Evolution of Programming Languages - Answer (click here)
57. The Science of Building a Compiler - Answer (click here)
58. Applications of Compiler Technology - Answer (click here)
59. Programming Language Basics - Answer (click here)
60. A Simple Syntax-Directed Translator - Answer (click here)
61. Syntax Definition - Answer (click here)
62. Syntax-Directed Translation - Answer (click here)
63. Parsing - Answer (click here)
64. A Translator for Simple Expressions - Answer (click here)
65. Lexical Analysis - Answer (click here)
66. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
67. Intermediate Code Generation - Answer (click here)
68. Lexical Analysis - Answer (click here)
69. The Role of the Lexical Analyzer - Answer (click here)
70. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
71. Specification of Tokens - Answer (click here)
72. Recognition of Tokens - Answer (click here)
73. The Lexical-Analyzer Generator Lex - Answer (click here)
74. Finite Automata - Answer (click here)
75. From Regular Expressions to Automata - Answer (click here)
76. Design of a Lexical-Analyzer Generator - Answer (click here)
77. Optimization of DFA-Based Pattern Matchers - Answer (click here)
78. Syntax Analysis - Answer (click here)
79. Context-Free Grammars - Answer (click here)
80. Writing a Grammar - Answer (click here)
81. Top-Down Parsing - Answer (click here)
82. Bottom-Up Parsing - Answer (click here)
83. Introduction to LR Parsing: Simple LR - Answer (click here)
84. More Powerful LR Parsers - Answer (click here)
85. Using Ambiguous Grammars - Answer (click here)
86. Parser Generators - Answer (click here)
87. Syntax-Directed Translation - Answer (click here)
88. Syntax-Directed Definitions - Answer (click here)
89. Evaluation Orders for SDD's - Answer (click here)
90. Applications of Syntax-Directed Translation - Answer (click here)
91. Syntax-Directed Translation Schemes - Answer (click here)
92. Implementing L-Attributed SDD's - Answer (click here)

Chapter 6 Intermediate Code Generation

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)
43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)
53. Compilers - Principles, Techniques, & Tools - Answer (click here)
54. Language Processors - Answer (click here)
55. The Structure of a Compiler - Answer (click here)
56. The Evolution of Programming Languages - Answer (click here)
57. The Science of Building a Compiler - Answer (click here)
58. Applications of Compiler Technology - Answer (click here)
59. Programming Language Basics - Answer (click here)
60. A Simple Syntax-Directed Translator - Answer (click here)
61. Syntax Definition - Answer (click here)
62. Syntax-Directed Translation - Answer (click here)
63. Parsing - Answer (click here)
64. A Translator for Simple Expressions - Answer (click here)
65. Lexical Analysis - Answer (click here)
66. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
67. Intermediate Code Generation - Answer (click here)
68. Lexical Analysis - Answer (click here)
69. The Role of the Lexical Analyzer - Answer (click here)
70. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
71. Specification of Tokens - Answer (click here)
72. Recognition of Tokens - Answer (click here)
73. The Lexical-Analyzer Generator Lex - Answer (click here)
74. Finite Automata - Answer (click here)
75. From Regular Expressions to Automata - Answer (click here)
76. Design of a Lexical-Analyzer Generator - Answer (click here)
77. Optimization of DFA-Based Pattern Matchers - Answer (click here)
78. Syntax Analysis - Answer (click here)
79. Context-Free Grammars - Answer (click here)
80. Writing a Grammar - Answer (click here)
81. Top-Down Parsing - Answer (click here)
82. Bottom-Up Parsing - Answer (click here)
83. Introduction to LR Parsing: Simple LR - Answer (click here)
84. More Powerful LR Parsers - Answer (click here)
 85. Using Ambiguous Grammars - Answer (click here)
86. Parser Generators - Answer (click here)
87. Syntax-Directed Translation - Answer (click here)
88. Syntax-Directed Definitions - Answer (click here)
89. Evaluation Orders for SDD's - Answer (click here)
90. Applications of Syntax-Directed Translation - Answer (click here)
91. Syntax-Directed Translation Schemes - Answer (click here)
92. Implementing L-Attributed SDD's - Answer (click here)
93. Intermediate-Code Generation - Answer (click here)
94. Variants of Syntax Trees - Answer (click here)
95. Three-Address Code - Answer (click here)
96. Types and Declarations - Answer (click here)
97. Translation of Expressions - Answer (click here)
98. Type Checking - Answer (click here)
99. Control Flow - Answer (click here)
100. Backpatching - Answer (click here)
101. Switch-Statements - Answer (click here)
102. Intermediate Code for Procedures - Answer (click here)

Chapter 7 Run Time Environments

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)
43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)
53. Compilers - Principles, Techniques, & Tools - Answer (click here)
54. Language Processors - Answer (click here)
55. The Structure of a Compiler - Answer (click here)
56. The Evolution of Programming Languages - Answer (click here)
57. The Science of Building a Compiler - Answer (click here)
58. Applications of Compiler Technology - Answer (click here)
59. Programming Language Basics - Answer (click here)
60. A Simple Syntax-Directed Translator - Answer (click here)
61. Syntax Definition - Answer (click here)
62. Syntax-Directed Translation - Answer (click here)
63. Parsing - Answer (click here)
64. A Translator for Simple Expressions - Answer (click here)
65. Lexical Analysis - Answer (click here)
66. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
67. Intermediate Code Generation - Answer (click here)
68. Lexical Analysis - Answer (click here)
69. The Role of the Lexical Analyzer - Answer (click here)
70. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
71. Specification of Tokens - Answer (click here)
72. Recognition of Tokens - Answer (click here)
73. The Lexical-Analyzer Generator Lex - Answer (click here)
74. Finite Automata - Answer (click here)
75. From Regular Expressions to Automata - Answer (click here)
76. Design of a Lexical-Analyzer Generator - Answer (click here)
77. Optimization of DFA-Based Pattern Matchers - Answer (click here)
78. Syntax Analysis - Answer (click here)
79. Context-Free Grammars - Answer (click here)
80. Writing a Grammar - Answer (click here)
81. Top-Down Parsing - Answer (click here)
82. Bottom-Up Parsing - Answer (click here)
83. Introduction to LR Parsing: Simple LR - Answer (click here)
84. More Powerful LR Parsers - Answer (click here)
85. Using Ambiguous Grammars - Answer (click here)
86. Parser Generators - Answer (click here)
87. Syntax-Directed Translation - Answer (click here)
88. Syntax-Directed Definitions - Answer (click here)
89. Evaluation Orders for SDD's - Answer (click here)
90. Applications of Syntax-Directed Translation - Answer (click here)
91. Syntax-Directed Translation Schemes - Answer (click here)
92. Implementing L-Attributed SDD's - Answer (click here)
93. Intermediate-Code Generation - Answer (click here)
94. Variants of Syntax Trees - Answer (click here)
95. Three-Address Code - Answer (click here)
 96. Types and Declarations - Answer (click here)
97. Translation of Expressions - Answer (click here)
98. Type Checking - Answer (click here)
99. Control Flow - Answer (click here)
100. Backpatching - Answer (click here)
101. Switch-Statements - Answer (click here)
102. Intermediate Code for Procedures - Answer (click here)
103. Run-Time Environments - Answer (click here)
104. Storage Organization - Answer (click here)
105. Stack Allocation of Space - Answer (click here)
106. Access to Nonlocal Data on the Stack - Answer (click here)
107. Heap Management - Answer (click here)
108. Introduction to Garbage Collection - Answer (click here)
109. Introduction to Trace-Based Collection - Answer (click here)
110. Short-Pause Garbage Collection - Answer (click here)
111. Advanced Topics in Garbage Collection - Answer (click here)

Chapter 8 Code Generation

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)
43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)
53. Compilers - Principles, Techniques, & Tools - Answer (click here)
54. Language Processors - Answer (click here)
55. The Structure of a Compiler - Answer (click here)
56. The Evolution of Programming Languages - Answer (click here)
57. The Science of Building a Compiler - Answer (click here)
58. Applications of Compiler Technology - Answer (click here)
59. Programming Language Basics - Answer (click here)
60. A Simple Syntax-Directed Translator - Answer (click here)
61. Syntax Definition - Answer (click here)
62. Syntax-Directed Translation - Answer (click here)
63. Parsing - Answer (click here)
64. A Translator for Simple Expressions - Answer (click here)
65. Lexical Analysis - Answer (click here)
66. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
67. Intermediate Code Generation - Answer (click here)
68. Lexical Analysis - Answer (click here)
69. The Role of the Lexical Analyzer - Answer (click here)
70. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
71. Specification of Tokens - Answer (click here)
72. Recognition of Tokens - Answer (click here)
73. The Lexical-Analyzer Generator Lex - Answer (click here)
74. Finite Automata - Answer (click here)
75. From Regular Expressions to Automata - Answer (click here)
76. Design of a Lexical-Analyzer Generator - Answer (click here)
77. Optimization of DFA-Based Pattern Matchers - Answer (click here)
78. Syntax Analysis - Answer (click here)
79. Context-Free Grammars - Answer (click here)
80. Writing a Grammar - Answer (click here)
81. Top-Down Parsing - Answer (click here)
82. Bottom-Up Parsing - Answer (click here)
83. Introduction to LR Parsing: Simple LR - Answer (click here)
84. More Powerful LR Parsers - Answer (click here)
85. Using Ambiguous Grammars - Answer (click here)
86. Parser Generators - Answer (click here)
87. Syntax-Directed Translation - Answer (click here)
88. Syntax-Directed Definitions - Answer (click here)
89. Evaluation Orders for SDD's - Answer (click here)
90. Applications of Syntax-Directed Translation - Answer (click here)
91. Syntax-Directed Translation Schemes - Answer (click here)
92. Implementing L-Attributed SDD's - Answer (click here)
93. Intermediate-Code Generation - Answer (click here)
94. Variants of Syntax Trees - Answer (click here)
95. Three-Address Code - Answer (click here)
96. Types and Declarations - Answer (click here)
97. Translation of Expressions - Answer (click here)
 98. Type Checking - Answer (click here)
99. Control Flow - Answer (click here)
100. Backpatching - Answer (click here)
101. Switch-Statements - Answer (click here)
102. Intermediate Code for Procedures - Answer (click here)
103. Run-Time Environments - Answer (click here)
104. Storage Organization - Answer (click here)
105. Stack Allocation of Space - Answer (click here)
106. Access to Nonlocal Data on the Stack - Answer (click here)
107. Heap Management - Answer (click here)
108. Introduction to Garbage Collection - Answer (click here)
109. Introduction to Trace-Based Collection - Answer (click here)
110. Short-Pause Garbage Collection - Answer (click here)
111. Advanced Topics in Garbage Collection - Answer (click here)
112. Code Generation - Answer (click here)
113. Issues in the Design of a Code Generator - Answer (click here)
114. The Target Language - Answer (click here)
115. Addresses in the Target Code - Answer (click here)
116. Basic Blocks and Flow Graphs - Answer (click here)
117. Optimization of Basic Blocks - Answer (click here)
118. A Simple Code Generator - Answer (click here)
119. Peephole Optimization - Answer (click here)
120. Register Allocation and Assignment - Answer (click here)
121. Instruction Selection by Tree Rewriting - Answer (click here)
122. Optimal Code Generation for Expressions - Answer (click here)
123. Dynamic Programming Code-Generation - Answer (click here)

Chapter 9 Machine Independent Optimizations

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)
43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)
53. Compilers - Principles, Techniques, & Tools - Answer (click here)
54. Language Processors - Answer (click here)
55. The Structure of a Compiler - Answer (click here)
56. The Evolution of Programming Languages - Answer (click here)
57. The Science of Building a Compiler - Answer (click here)
58. Applications of Compiler Technology - Answer (click here)
59. Programming Language Basics - Answer (click here)
60. A Simple Syntax-Directed Translator - Answer (click here)
61. Syntax Definition - Answer (click here)
62. Syntax-Directed Translation - Answer (click here)
63. Parsing - Answer (click here)
64. A Translator for Simple Expressions - Answer (click here)
65. Lexical Analysis - Answer (click here)
66. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
67. Intermediate Code Generation - Answer (click here)
68. Lexical Analysis - Answer (click here)
69. The Role of the Lexical Analyzer - Answer (click here)
70. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
71. Specification of Tokens - Answer (click here)
72. Recognition of Tokens - Answer (click here)
73. The Lexical-Analyzer Generator Lex - Answer (click here)
74. Finite Automata - Answer (click here)
75. From Regular Expressions to Automata - Answer (click here)
76. Design of a Lexical-Analyzer Generator - Answer (click here)
77. Optimization of DFA-Based Pattern Matchers - Answer (click here)
78. Syntax Analysis - Answer (click here)
79. Context-Free Grammars - Answer (click here)
80. Writing a Grammar - Answer (click here)
81. Top-Down Parsing - Answer (click here)
82. Bottom-Up Parsing - Answer (click here)
83. Introduction to LR Parsing: Simple LR - Answer (click here)
84. More Powerful LR Parsers - Answer (click here)
85. Using Ambiguous Grammars - Answer (click here)
86. Parser Generators - Answer (click here)
87. Syntax-Directed Translation - Answer (click here)
 88. Syntax-Directed Definitions - Answer (click here)
89. Evaluation Orders for SDD's - Answer (click here)
90. Applications of Syntax-Directed Translation - Answer (click here)
91. Syntax-Directed Translation Schemes - Answer (click here)
92. Implementing L-Attributed SDD's - Answer (click here)
93. Intermediate-Code Generation - Answer (click here)
94. Variants of Syntax Trees - Answer (click here)
95. Three-Address Code - Answer (click here)
96. Types and Declarations - Answer (click here)
97. Translation of Expressions - Answer (click here)
98. Type Checking - Answer (click here)
99. Control Flow - Answer (click here)
100. Backpatching - Answer (click here)
101. Switch-Statements - Answer (click here)
102. Intermediate Code for Procedures - Answer (click here)
103. Run-Time Environments - Answer (click here)
104. Storage Organization - Answer (click here)
105. Stack Allocation of Space - Answer (click here)
106. Access to Nonlocal Data on the Stack - Answer (click here)
107. Heap Management - Answer (click here)
108. Introduction to Garbage Collection - Answer (click here)
109. Introduction to Trace-Based Collection - Answer (click here)
110. Short-Pause Garbage Collection - Answer (click here)
111. Advanced Topics in Garbage Collection - Answer (click here)
112. Code Generation - Answer (click here)
113. Issues in the Design of a Code Generator - Answer (click here)
114. The Target Language - Answer (click here)
115. Addresses in the Target Code - Answer (click here)
116. Basic Blocks and Flow Graphs - Answer (click here)
117. Optimization of Basic Blocks - Answer (click here)
118. A Simple Code Generator - Answer (click here)
119. Peephole Optimization - Answer (click here)
120. Register Allocation and Assignment - Answer (click here)
121. Instruction Selection by Tree Rewriting - Answer (click here)
122. Optimal Code Generation for Expressions - Answer (click here)
123. Dynamic Programming Code-Generation - Answer (click here)
124. Machine-Independent Optimizations - Answer (click here)
125. The Principal Sources of Optimization - Answer (click here)
126. Introduction to Data-Flow Analysis - Answer (click here)
127. Foundations of Data-Flow Analysis - Answer (click here)
128. Constant Propagation - Answer (click here)
129. Partial-Redundancy Elimination - Answer (click here)
130. Loops in Flow Graphs - Answer (click here)
131. Region-Based Analysis - Answer (click here)
132. Symbolic Analysis - Answer (click here)

Chapter 10 Instruction Level Parallelism

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)
43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)
53. Compilers - Principles, Techniques, & Tools - Answer (click here)
54. Language Processors - Answer (click here)
55. The Structure of a Compiler - Answer (click here)
56. The Evolution of Programming Languages - Answer (click here)
57. The Science of Building a Compiler - Answer (click here)
58. Applications of Compiler Technology - Answer (click here)
59. Programming Language Basics - Answer (click here)
60. A Simple Syntax-Directed Translator - Answer (click here)
61. Syntax Definition - Answer (click here)
62. Syntax-Directed Translation - Answer (click here)
63. Parsing - Answer (click here)
64. A Translator for Simple Expressions - Answer (click here)
65. Lexical Analysis - Answer (click here)
66. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
67. Intermediate Code Generation - Answer (click here)
68. Lexical Analysis - Answer (click here)
 69. The Role of the Lexical Analyzer - Answer (click here)
70. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
71. Specification of Tokens - Answer (click here)
72. Recognition of Tokens - Answer (click here)
73. The Lexical-Analyzer Generator Lex - Answer (click here)
74. Finite Automata - Answer (click here)
75. From Regular Expressions to Automata - Answer (click here)
76. Design of a Lexical-Analyzer Generator - Answer (click here)
77. Optimization of DFA-Based Pattern Matchers - Answer (click here)
78. Syntax Analysis - Answer (click here)
79. Context-Free Grammars - Answer (click here)
80. Writing a Grammar - Answer (click here)
81. Top-Down Parsing - Answer (click here)
82. Bottom-Up Parsing - Answer (click here)
83. Introduction to LR Parsing: Simple LR - Answer (click here)
84. More Powerful LR Parsers - Answer (click here)
85. Using Ambiguous Grammars - Answer (click here)
86. Parser Generators - Answer (click here)
87. Syntax-Directed Translation - Answer (click here)
88. Syntax-Directed Definitions - Answer (click here)
89. Evaluation Orders for SDD's - Answer (click here)
90. Applications of Syntax-Directed Translation - Answer (click here)
91. Syntax-Directed Translation Schemes - Answer (click here)
92. Implementing L-Attributed SDD's - Answer (click here)
93. Intermediate-Code Generation - Answer (click here)
94. Variants of Syntax Trees - Answer (click here)
95. Three-Address Code - Answer (click here)
96. Types and Declarations - Answer (click here)
97. Translation of Expressions - Answer (click here)
98. Type Checking - Answer (click here)
99. Control Flow - Answer (click here)
100. Backpatching - Answer (click here)
101. Switch-Statements - Answer (click here)
102. Intermediate Code for Procedures - Answer (click here)
103. Run-Time Environments - Answer (click here)
104. Storage Organization - Answer (click here)
105. Stack Allocation of Space - Answer (click here)
106. Access to Nonlocal Data on the Stack - Answer (click here)
107. Heap Management - Answer (click here)
108. Introduction to Garbage Collection - Answer (click here)
109. Introduction to Trace-Based Collection - Answer (click here)
110. Short-Pause Garbage Collection - Answer (click here)
111. Advanced Topics in Garbage Collection - Answer (click here)
112. Code Generation - Answer (click here)
113. Issues in the Design of a Code Generator - Answer (click here)
114. The Target Language - Answer (click here)
115. Addresses in the Target Code - Answer (click here)
116. Basic Blocks and Flow Graphs - Answer (click here)
117. Optimization of Basic Blocks - Answer (click here)
118. A Simple Code Generator - Answer (click here)
119. Peephole Optimization - Answer (click here)
120. Register Allocation and Assignment - Answer (click here)
121. Instruction Selection by Tree Rewriting - Answer (click here)
122. Optimal Code Generation for Expressions - Answer (click here)
123. Dynamic Programming Code-Generation - Answer (click here)
124. Machine-Independent Optimizations - Answer (click here)
125. The Principal Sources of Optimization - Answer (click here)
126. Introduction to Data-Flow Analysis - Answer (click here)
127. Foundations of Data-Flow Analysis - Answer (click here)
128. Constant Propagation - Answer (click here)
129. Partial-Redundancy Elimination - Answer (click here)
130. Loops in Flow Graphs - Answer (click here)
131. Region-Based Analysis - Answer (click here)
132. Symbolic Analysis - Answer (click here)
133. Instruction-Level Parallelism - Answer (click here)
134. Processor Architectures - Answer (click here)
135. Code-Scheduling Constraints - Answer (click here)
136. Basic-Block Scheduling - Answer (click here)
137. Global Code Scheduling - Answer (click here)
138. Software Pipelining Algorithm - Answer (click here)
139. Scheduling Acyclic Data-Dependence and Cyclic Dependence Graphs -
Answer (click here)
140. Improvements to the Pipelining Algorithms - Answer (click here)

Chapter 11 Optimizing for Parallelism and Locality

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
5. Cousins of Compiler - Answer (click here)
 6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
 Generation - Answer (click here)
43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)
53. Compilers - Principles, Techniques, & Tools - Answer (click here)
54. Language Processors - Answer (click here)
55. The Structure of a Compiler - Answer (click here)
56. The Evolution of Programming Languages - Answer (click here)
57. The Science of Building a Compiler - Answer (click here)
58. Applications of Compiler Technology - Answer (click here)
59. Programming Language Basics - Answer (click here)
60. A Simple Syntax-Directed Translator - Answer (click here)
61. Syntax Definition - Answer (click here)
62. Syntax-Directed Translation - Answer (click here)
63. Parsing - Answer (click here)
64. A Translator for Simple Expressions - Answer (click here)
65. Lexical Analysis - Answer (click here)
66. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
67. Intermediate Code Generation - Answer (click here)
68. Lexical Analysis - Answer (click here)
69. The Role of the Lexical Analyzer - Answer (click here)
70. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
71. Specification of Tokens - Answer (click here)
72. Recognition of Tokens - Answer (click here)
73. The Lexical-Analyzer Generator Lex - Answer (click here)
74. Finite Automata - Answer (click here)
75. From Regular Expressions to Automata - Answer (click here)
76. Design of a Lexical-Analyzer Generator - Answer (click here)
77. Optimization of DFA-Based Pattern Matchers - Answer (click here)
78. Syntax Analysis - Answer (click here)
79. Context-Free Grammars - Answer (click here)
80. Writing a Grammar - Answer (click here)
 81. Top-Down Parsing - Answer (click here)
82. Bottom-Up Parsing - Answer (click here)
83. Introduction to LR Parsing: Simple LR - Answer (click here)
84. More Powerful LR Parsers - Answer (click here)
85. Using Ambiguous Grammars - Answer (click here)
86. Parser Generators - Answer (click here)
87. Syntax-Directed Translation - Answer (click here)
88. Syntax-Directed Definitions - Answer (click here)
89. Evaluation Orders for SDD's - Answer (click here)
90. Applications of Syntax-Directed Translation - Answer (click here)
91. Syntax-Directed Translation Schemes - Answer (click here)
92. Implementing L-Attributed SDD's - Answer (click here)
93. Intermediate-Code Generation - Answer (click here)
94. Variants of Syntax Trees - Answer (click here)
95. Three-Address Code - Answer (click here)
96. Types and Declarations - Answer (click here)
97. Translation of Expressions - Answer (click here)
98. Type Checking - Answer (click here)
99. Control Flow - Answer (click here)
100. Backpatching - Answer (click here)
101. Switch-Statements - Answer (click here)
102. Intermediate Code for Procedures - Answer (click here)
103. Run-Time Environments - Answer (click here)
104. Storage Organization - Answer (click here)
105. Stack Allocation of Space - Answer (click here)
106. Access to Nonlocal Data on the Stack - Answer (click here)
107. Heap Management - Answer (click here)
108. Introduction to Garbage Collection - Answer (click here)
109. Introduction to Trace-Based Collection - Answer (click here)
110. Short-Pause Garbage Collection - Answer (click here)
111. Advanced Topics in Garbage Collection - Answer (click here)
112. Code Generation - Answer (click here)
113. Issues in the Design of a Code Generator - Answer (click here)
114. The Target Language - Answer (click here)
115. Addresses in the Target Code - Answer (click here)
116. Basic Blocks and Flow Graphs - Answer (click here)
117. Optimization of Basic Blocks - Answer (click here)
118. A Simple Code Generator - Answer (click here)
119. Peephole Optimization - Answer (click here)
120. Register Allocation and Assignment - Answer (click here)
121. Instruction Selection by Tree Rewriting - Answer (click here)
122. Optimal Code Generation for Expressions - Answer (click here)
123. Dynamic Programming Code-Generation - Answer (click here)
124. Machine-Independent Optimizations - Answer (click here)
125. The Principal Sources of Optimization - Answer (click here)
126. Introduction to Data-Flow Analysis - Answer (click here)
127. Foundations of Data-Flow Analysis - Answer (click here)
128. Constant Propagation - Answer (click here)
129. Partial-Redundancy Elimination - Answer (click here)
130. Loops in Flow Graphs - Answer (click here)
131. Region-Based Analysis - Answer (click here)
132. Symbolic Analysis - Answer (click here)
133. Instruction-Level Parallelism - Answer (click here)
134. Processor Architectures - Answer (click here)
135. Code-Scheduling Constraints - Answer (click here)
136. Basic-Block Scheduling - Answer (click here)
137. Global Code Scheduling - Answer (click here)
138. Software Pipelining Algorithm - Answer (click here)
139. Scheduling Acyclic Data-Dependence and Cyclic Dependence Graphs -
Answer (click here)
140. Improvements to the Pipelining Algorithms - Answer (click here)
141. Optimizing for Parallelism and Locality - Answer (click here)
142. Basic Concepts of Optimizing for Parallelism and Locality - Answer (click
here)
143. Matrix Multiply: An In-Depth Example - Answer (click here)
144. Iteration Spaces - Answer (click here)
145. Affine Array Indexes - Answer (click here)
146. Data Reuse - Answer (click here)
147. Array Data-Dependence Analysis - Answer (click here)
148. Finding Synchronization-Free Parallelism - Answer (click here)
149. Synchronization Between Parallel Loops - Answer (click here)
150. Pipelining - Answer (click here)
151. Locality Optimizations - Answer (click here)
152. Other Uses of Affine Transforms - Answer (click here)

Chapter 12 Interprocedural Analysis

1. Algorithms for Solving Nonlinear Equations - Answer (click here)
2. Introduction to Compiling Compilers - Answer (click here)
3. Analysis of the source program - Answer (click here)
4. The Phases of a Compiler - Answer (click here)
 5. Cousins of Compiler - Answer (click here)
6. Grouping of the Phases - Answer (click here)
7. Compiler Construction Tools - Answer (click here)
8. Lexical Analysis - Answer (click here)
9. Input Buffering - Answer (click here)
10. Specification of Tokens - Answer (click here)
11. Recognition of Tokens - Answer (click here)
12. A Language For Specifying Lexical Analyzer - Answer (click here)
13. Important Short Questions and Answers : Principles of Compiler Design
- Lexical Analysis - Answer (click here)
14. Syntax Analysis - Answer (click here)
15. The Role of Parser - Answer (click here)
16. Context-Free Grammars - Answer (click here)
17. Writing a Grammar - Answer (click here)
18. Top down parsing and Bottom up Parsing - Answer (click here)
19. Constructing SLR(1) Parsing Table - Answer (click here)
20. Type Checking - Answer (click here)
21. Specification of a Simple Type Checker - Answer (click here)
22. Run-Time Environments - Source Language Issues - Answer (click here)
23. Storage Organization - Answer (click here)
24. Storage Allocation Strategies - Answer (click here)
25. Important Short Questions and Answers: Syntax Analysis and Run-Time
Environments - Answer (click here)
26. Intermediate Languages - Answer (click here)
27. Declarations - Answer (click here)
28. Assignment Statements - Answer (click here)
29. Boolean Expressions - Answer (click here)
30. Case Statements - Answer (click here)
31. Backpatching - Answer (click here)
32. Procedure Calls - Answer (click here)
33. Important Short Questions and Answers: Principles of Compiler Design
- Intermediate Code Generation - Answer (click here)
34. Issues in the design of a code generator - Answer (click here)
35. Target Machine - Answer (click here)
36. Run-Time Storage Management - Answer (click here)
37. Basic Blocks and Flow Graphs of Code Generation - Answer (click here)
38. A Simple Code Generator - Answer (click here)
39. Register Allocation and Assignment - Answer (click here)
40. The Dag Representation For Basic Blocks - Answer (click here)
41. Generating Code From DAGs - Answer (click here)
42. Important Short Questions and Answers: Compiler Design - Code
Generation - Answer (click here)
43. Code Optimization - Answer (click here)
44. Principal Sources of Optimisation - Answer (click here)
45. Peephole Optimization - Answer (click here)
46. Optimization of Basic Blocks - Answer (click here)
47. Loops in Flow Graph - Answer (click here)
48. Introduction to Global Dataflow Analysis - Answer (click here)
49. Code Improvig Transformations - Answer (click here)
50. Glossary - Principles of Compiler Design - Answer (click here)
51. Tutorial problems and worked out examples - Principles of Compiler
Design - Answer (click here)
52. Important Short Questions and Answers: Code optimization - Answer
(click here)
53. Compilers - Principles, Techniques, & Tools - Answer (click here)
54. Language Processors - Answer (click here)
55. The Structure of a Compiler - Answer (click here)
56. The Evolution of Programming Languages - Answer (click here)
57. The Science of Building a Compiler - Answer (click here)
58. Applications of Compiler Technology - Answer (click here)
59. Programming Language Basics - Answer (click here)
60. A Simple Syntax-Directed Translator - Answer (click here)
61. Syntax Definition - Answer (click here)
62. Syntax-Directed Translation - Answer (click here)
63. Parsing - Answer (click here)
64. A Translator for Simple Expressions - Answer (click here)
65. Lexical Analysis - Answer (click here)
66. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
67. Intermediate Code Generation - Answer (click here)
68. Lexical Analysis - Answer (click here)
69. The Role of the Lexical Analyzer - Answer (click here)
70. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
71. Specification of Tokens - Answer (click here)
72. Recognition of Tokens - Answer (click here)
73. The Lexical-Analyzer Generator Lex - Answer (click here)
74. Finite Automata - Answer (click here)
75. From Regular Expressions to Automata - Answer (click here)
76. Design of a Lexical-Analyzer Generator - Answer (click here)
77. Optimization of DFA-Based Pattern Matchers - Answer (click here)
78. Syntax Analysis - Answer (click here)
79. Context-Free Grammars - Answer (click here)
 80. Writing a Grammar - Answer (click here)
81. Top-Down Parsing - Answer (click here)
82. Bottom-Up Parsing - Answer (click here)
83. Introduction to LR Parsing: Simple LR - Answer (click here)
84. More Powerful LR Parsers - Answer (click here)
85. Using Ambiguous Grammars - Answer (click here)
86. Parser Generators - Answer (click here)
87. Syntax-Directed Translation - Answer (click here)
88. Syntax-Directed Definitions - Answer (click here)
89. Evaluation Orders for SDD's - Answer (click here)
90. Applications of Syntax-Directed Translation - Answer (click here)
91. Syntax-Directed Translation Schemes - Answer (click here)
92. Implementing L-Attributed SDD's - Answer (click here)
93. Intermediate-Code Generation - Answer (click here)
94. Variants of Syntax Trees - Answer (click here)
95. Three-Address Code - Answer (click here)
96. Types and Declarations - Answer (click here)
97. Translation of Expressions - Answer (click here)
98. Type Checking - Answer (click here)
99. Control Flow - Answer (click here)
100. Backpatching - Answer (click here)
101. Switch-Statements - Answer (click here)
102. Intermediate Code for Procedures - Answer (click here)
103. Run-Time Environments - Answer (click here)
104. Storage Organization - Answer (click here)
105. Stack Allocation of Space - Answer (click here)
106. Access to Nonlocal Data on the Stack - Answer (click here)
107. Heap Management - Answer (click here)
108. Introduction to Garbage Collection - Answer (click here)
109. Introduction to Trace-Based Collection - Answer (click here)
110. Short-Pause Garbage Collection - Answer (click here)
111. Advanced Topics in Garbage Collection - Answer (click here)
112. Code Generation - Answer (click here)
113. Issues in the Design of a Code Generator - Answer (click here)
114. The Target Language - Answer (click here)
115. Addresses in the Target Code - Answer (click here)
116. Basic Blocks and Flow Graphs - Answer (click here)
117. Optimization of Basic Blocks - Answer (click here)
118. A Simple Code Generator - Answer (click here)
119. Peephole Optimization - Answer (click here)
120. Register Allocation and Assignment - Answer (click here)
121. Instruction Selection by Tree Rewriting - Answer (click here)
122. Optimal Code Generation for Expressions - Answer (click here)
123. Dynamic Programming Code-Generation - Answer (click here)
124. Machine-Independent Optimizations - Answer (click here)
125. The Principal Sources of Optimization - Answer (click here)
126. Introduction to Data-Flow Analysis - Answer (click here)
127. Foundations of Data-Flow Analysis - Answer (click here)
128. Constant Propagation - Answer (click here)
129. Partial-Redundancy Elimination - Answer (click here)
130. Loops in Flow Graphs - Answer (click here)
131. Region-Based Analysis - Answer (click here)
132. Symbolic Analysis - Answer (click here)
133. Instruction-Level Parallelism - Answer (click here)
134. Processor Architectures - Answer (click here)
135. Code-Scheduling Constraints - Answer (click here)
136. Basic-Block Scheduling - Answer (click here)
137. Global Code Scheduling - Answer (click here)
138. Software Pipelining Algorithm - Answer (click here)
139. Scheduling Acyclic Data-Dependence and Cyclic Dependence Graphs -
Answer (click here)
140. Improvements to the Pipelining Algorithms - Answer (click here)
141. Optimizing for Parallelism and Locality - Answer (click here)
142. Basic Concepts of Optimizing for Parallelism and Locality - Answer (click
here)
143. Matrix Multiply: An In-Depth Example - Answer (click here)
144. Iteration Spaces - Answer (click here)
145. Affine Array Indexes - Answer (click here)
146. Data Reuse - Answer (click here)
147. Array Data-Dependence Analysis - Answer (click here)
148. Finding Synchronization-Free Parallelism - Answer (click here)
149. Synchronization Between Parallel Loops - Answer (click here)
150. Pipelining - Answer (click here)
151. Locality Optimizations - Answer (click here)
152. Other Uses of Affine Transforms - Answer (click here)
153. Interprocedural Analysis - Answer (click here)
154. Basic Concepts of Interprocedural Analysis - Answer (click here)
155. Why Interprocedural Analysis? - Answer (click here)
156. A Logical Representation of Data Flow - Answer (click here)
157. A Simple Pointer-Analysis Algorithm - Answer (click here)
158. Context-Insensitive Interprocedural Analysis - Answer (click here)
159. Context-Sensitive Pointer Analysis - Answer (click here)
160. Datalog Implementation by BDD's - Answer (click here)