Compilers Principles, Techniques, & Tools

Subject : Compilers Principles, Techniques, & Tools

Chapter 1 Introduction
1. Compilers - Principles, Techniques, & Tools - Answer (click here)
2. Language Processors - Answer (click here)
3. The Structure of a Compiler - Answer (click here)
4. The Evolution of Programming Languages - Answer (click here)
5. The Science of Building a Compiler - Answer (click here)
6. Applications of Compiler Technology - Answer (click here)
7. Programming Language Basics - Answer (click here)

Chapter 2 Simple Syntax Directed Translator

1. Compilers - Principles, Techniques, & Tools - Answer (click here)
2. Language Processors - Answer (click here)
3. The Structure of a Compiler - Answer (click here)
4. The Evolution of Programming Languages - Answer (click here)
5. The Science of Building a Compiler - Answer (click here)
6. Applications of Compiler Technology - Answer (click here)
7. Programming Language Basics - Answer (click here)
8. A Simple Syntax-Directed Translator - Answer (click here)
9. Syntax Definition - Answer (click here)
10. Syntax-Directed Translation - Answer (click here)
11. Parsing - Answer (click here)
12. A Translator for Simple Expressions - Answer (click here)
13. Lexical Analysis - Answer (click here)
14. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
15. Intermediate Code Generation - Answer (click here)

Chapter 3 Lexical Analysis

1. Compilers - Principles, Techniques, & Tools - Answer (click here)
2. Language Processors - Answer (click here)
3. The Structure of a Compiler - Answer (click here)
4. The Evolution of Programming Languages - Answer (click here)
5. The Science of Building a Compiler - Answer (click here)
6. Applications of Compiler Technology - Answer (click here)
 7. Programming Language Basics - Answer (click here)
8. A Simple Syntax-Directed Translator - Answer (click here)
9. Syntax Definition - Answer (click here)
10. Syntax-Directed Translation - Answer (click here)
11. Parsing - Answer (click here)
12. A Translator for Simple Expressions - Answer (click here)
13. Lexical Analysis - Answer (click here)
14. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
15. Intermediate Code Generation - Answer (click here)
16. Lexical Analysis - Answer (click here)
17. The Role of the Lexical Analyzer - Answer (click here)
18. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
19. Specification of Tokens - Answer (click here)
20. Recognition of Tokens - Answer (click here)
21. The Lexical-Analyzer Generator Lex - Answer (click here)
22. Finite Automata - Answer (click here)
23. From Regular Expressions to Automata - Answer (click here)
24. Design of a Lexical-Analyzer Generator - Answer (click here)
25. Optimization of DFA-Based Pattern Matchers - Answer (click here)

Chapter 4 Syntax Analysis

1. Compilers - Principles, Techniques, & Tools - Answer (click here)
2. Language Processors - Answer (click here)
3. The Structure of a Compiler - Answer (click here)
4. The Evolution of Programming Languages - Answer (click here)
5. The Science of Building a Compiler - Answer (click here)
6. Applications of Compiler Technology - Answer (click here)
7. Programming Language Basics - Answer (click here)
8. A Simple Syntax-Directed Translator - Answer (click here)
9. Syntax Definition - Answer (click here)
10. Syntax-Directed Translation - Answer (click here)
11. Parsing - Answer (click here)
12. A Translator for Simple Expressions - Answer (click here)
13. Lexical Analysis - Answer (click here)
14. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
15. Intermediate Code Generation - Answer (click here)
16. Lexical Analysis - Answer (click here)
17. The Role of the Lexical Analyzer - Answer (click here)
18. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
19. Specification of Tokens - Answer (click here)
 20. Recognition of Tokens - Answer (click here)
21. The Lexical-Analyzer Generator Lex - Answer (click here)
22. Finite Automata - Answer (click here)
23. From Regular Expressions to Automata - Answer (click here)
24. Design of a Lexical-Analyzer Generator - Answer (click here)
25. Optimization of DFA-Based Pattern Matchers - Answer (click here)
26. Syntax Analysis - Answer (click here)
27. Context-Free Grammars - Answer (click here)
28. Writing a Grammar - Answer (click here)
29. Top-Down Parsing - Answer (click here)
30. Bottom-Up Parsing - Answer (click here)
31. Introduction to LR Parsing: Simple LR - Answer (click here)
32. More Powerful LR Parsers - Answer (click here)
33. Using Ambiguous Grammars - Answer (click here)
34. Parser Generators - Answer (click here)

Chapter 5 Syntax Directed Translation

1. Compilers - Principles, Techniques, & Tools - Answer (click here)
2. Language Processors - Answer (click here)
3. The Structure of a Compiler - Answer (click here)
4. The Evolution of Programming Languages - Answer (click here)
5. The Science of Building a Compiler - Answer (click here)
6. Applications of Compiler Technology - Answer (click here)
7. Programming Language Basics - Answer (click here)
8. A Simple Syntax-Directed Translator - Answer (click here)
9. Syntax Definition - Answer (click here)
10. Syntax-Directed Translation - Answer (click here)
11. Parsing - Answer (click here)
12. A Translator for Simple Expressions - Answer (click here)
13. Lexical Analysis - Answer (click here)
14. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
15. Intermediate Code Generation - Answer (click here)
16. Lexical Analysis - Answer (click here)
17. The Role of the Lexical Analyzer - Answer (click here)
18. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
19. Specification of Tokens - Answer (click here)
20. Recognition of Tokens - Answer (click here)
21. The Lexical-Analyzer Generator Lex - Answer (click here)
22. Finite Automata - Answer (click here)
23. From Regular Expressions to Automata - Answer (click here)
24. Design of a Lexical-Analyzer Generator - Answer (click here)
25. Optimization of DFA-Based Pattern Matchers - Answer (click here)
26. Syntax Analysis - Answer (click here)
27. Context-Free Grammars - Answer (click here)
28. Writing a Grammar - Answer (click here)
29. Top-Down Parsing - Answer (click here)
30. Bottom-Up Parsing - Answer (click here)
31. Introduction to LR Parsing: Simple LR - Answer (click here)
32. More Powerful LR Parsers - Answer (click here)
33. Using Ambiguous Grammars - Answer (click here)
34. Parser Generators - Answer (click here)
35. Syntax-Directed Translation - Answer (click here)
36. Syntax-Directed Definitions - Answer (click here)
37. Evaluation Orders for SDD's - Answer (click here)
38. Applications of Syntax-Directed Translation - Answer (click here)
39. Syntax-Directed Translation Schemes - Answer (click here)
40. Implementing L-Attributed SDD's - Answer (click here)

Chapter 6 Intermediate Code Generation

1. Compilers - Principles, Techniques, & Tools - Answer (click here)
2. Language Processors - Answer (click here)
3. The Structure of a Compiler - Answer (click here)
4. The Evolution of Programming Languages - Answer (click here)
5. The Science of Building a Compiler - Answer (click here)
6. Applications of Compiler Technology - Answer (click here)
7. Programming Language Basics - Answer (click here)
8. A Simple Syntax-Directed Translator - Answer (click here)
9. Syntax Definition - Answer (click here)
10. Syntax-Directed Translation - Answer (click here)
11. Parsing - Answer (click here)
12. A Translator for Simple Expressions - Answer (click here)
13. Lexical Analysis - Answer (click here)
14. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
15. Intermediate Code Generation - Answer (click here)
16. Lexical Analysis - Answer (click here)
17. The Role of the Lexical Analyzer - Answer (click here)
18. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
19. Specification of Tokens - Answer (click here)
20. Recognition of Tokens - Answer (click here)
21. The Lexical-Analyzer Generator Lex - Answer (click here)
22. Finite Automata - Answer (click here)
23. From Regular Expressions to Automata - Answer (click here)
24. Design of a Lexical-Analyzer Generator - Answer (click here)
25. Optimization of DFA-Based Pattern Matchers - Answer (click here)
26. Syntax Analysis - Answer (click here)
27. Context-Free Grammars - Answer (click here)
28. Writing a Grammar - Answer (click here)
29. Top-Down Parsing - Answer (click here)
30. Bottom-Up Parsing - Answer (click here)
31. Introduction to LR Parsing: Simple LR - Answer (click here)
32. More Powerful LR Parsers - Answer (click here)
33. Using Ambiguous Grammars - Answer (click here)
34. Parser Generators - Answer (click here)
35. Syntax-Directed Translation - Answer (click here)
36. Syntax-Directed Definitions - Answer (click here)
37. Evaluation Orders for SDD's - Answer (click here)
38. Applications of Syntax-Directed Translation - Answer (click here)
39. Syntax-Directed Translation Schemes - Answer (click here)
40. Implementing L-Attributed SDD's - Answer (click here)
41. Intermediate-Code Generation - Answer (click here)
42. Variants of Syntax Trees - Answer (click here)
43. Three-Address Code - Answer (click here)
44. Types and Declarations - Answer (click here)
45. Translation of Expressions - Answer (click here)
46. Type Checking - Answer (click here)
47. Control Flow - Answer (click here)
48. Backpatching - Answer (click here)
49. Switch-Statements - Answer (click here)
50. Intermediate Code for Procedures - Answer (click here)

Chapter 7 Run Time Environments

1. Compilers - Principles, Techniques, & Tools - Answer (click here)
2. Language Processors - Answer (click here)
3. The Structure of a Compiler - Answer (click here)
4. The Evolution of Programming Languages - Answer (click here)
5. The Science of Building a Compiler - Answer (click here)
6. Applications of Compiler Technology - Answer (click here)
7. Programming Language Basics - Answer (click here)
8. A Simple Syntax-Directed Translator - Answer (click here)
9. Syntax Definition - Answer (click here)
10. Syntax-Directed Translation - Answer (click here)
11. Parsing - Answer (click here)
12. A Translator for Simple Expressions - Answer (click here)
13. Lexical Analysis - Answer (click here)
14. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
15. Intermediate Code Generation - Answer (click here)
16. Lexical Analysis - Answer (click here)
17. The Role of the Lexical Analyzer - Answer (click here)
18. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
19. Specification of Tokens - Answer (click here)
20. Recognition of Tokens - Answer (click here)
21. The Lexical-Analyzer Generator Lex - Answer (click here)
22. Finite Automata - Answer (click here)
23. From Regular Expressions to Automata - Answer (click here)
24. Design of a Lexical-Analyzer Generator - Answer (click here)
25. Optimization of DFA-Based Pattern Matchers - Answer (click here)
26. Syntax Analysis - Answer (click here)
27. Context-Free Grammars - Answer (click here)
28. Writing a Grammar - Answer (click here)
29. Top-Down Parsing - Answer (click here)
30. Bottom-Up Parsing - Answer (click here)
31. Introduction to LR Parsing: Simple LR - Answer (click here)
32. More Powerful LR Parsers - Answer (click here)
33. Using Ambiguous Grammars - Answer (click here)
34. Parser Generators - Answer (click here)
35. Syntax-Directed Translation - Answer (click here)
36. Syntax-Directed Definitions - Answer (click here)
37. Evaluation Orders for SDD's - Answer (click here)
38. Applications of Syntax-Directed Translation - Answer (click here)
39. Syntax-Directed Translation Schemes - Answer (click here)
40. Implementing L-Attributed SDD's - Answer (click here)
41. Intermediate-Code Generation - Answer (click here)
42. Variants of Syntax Trees - Answer (click here)
43. Three-Address Code - Answer (click here)
44. Types and Declarations - Answer (click here)
45. Translation of Expressions - Answer (click here)
46. Type Checking - Answer (click here)
47. Control Flow - Answer (click here)
48. Backpatching - Answer (click here)
49. Switch-Statements - Answer (click here)
50. Intermediate Code for Procedures - Answer (click here)
51. Run-Time Environments - Answer (click here)
52. Storage Organization - Answer (click here)
53. Stack Allocation of Space - Answer (click here)
54. Access to Nonlocal Data on the Stack - Answer (click here)
55. Heap Management - Answer (click here)
56. Introduction to Garbage Collection - Answer (click here)
57. Introduction to Trace-Based Collection - Answer (click here)
58. Short-Pause Garbage Collection - Answer (click here)
59. Advanced Topics in Garbage Collection - Answer (click here)

Chapter 8 Code Generation

1. Compilers - Principles, Techniques, & Tools - Answer (click here)
2. Language Processors - Answer (click here)
3. The Structure of a Compiler - Answer (click here)
4. The Evolution of Programming Languages - Answer (click here)
5. The Science of Building a Compiler - Answer (click here)
6. Applications of Compiler Technology - Answer (click here)
7. Programming Language Basics - Answer (click here)
8. A Simple Syntax-Directed Translator - Answer (click here)
9. Syntax Definition - Answer (click here)
10. Syntax-Directed Translation - Answer (click here)
11. Parsing - Answer (click here)
12. A Translator for Simple Expressions - Answer (click here)
13. Lexical Analysis - Answer (click here)
14. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
15. Intermediate Code Generation - Answer (click here)
16. Lexical Analysis - Answer (click here)
17. The Role of the Lexical Analyzer - Answer (click here)
18. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
19. Specification of Tokens - Answer (click here)
20. Recognition of Tokens - Answer (click here)
21. The Lexical-Analyzer Generator Lex - Answer (click here)
22. Finite Automata - Answer (click here)
23. From Regular Expressions to Automata - Answer (click here)
24. Design of a Lexical-Analyzer Generator - Answer (click here)
25. Optimization of DFA-Based Pattern Matchers - Answer (click here)
26. Syntax Analysis - Answer (click here)
27. Context-Free Grammars - Answer (click here)
28. Writing a Grammar - Answer (click here)
29. Top-Down Parsing - Answer (click here)
30. Bottom-Up Parsing - Answer (click here)
31. Introduction to LR Parsing: Simple LR - Answer (click here)
32. More Powerful LR Parsers - Answer (click here)
33. Using Ambiguous Grammars - Answer (click here)
34. Parser Generators - Answer (click here)
35. Syntax-Directed Translation - Answer (click here)
36. Syntax-Directed Definitions - Answer (click here)
37. Evaluation Orders for SDD's - Answer (click here)
38. Applications of Syntax-Directed Translation - Answer (click here)
39. Syntax-Directed Translation Schemes - Answer (click here)
40. Implementing L-Attributed SDD's - Answer (click here)
41. Intermediate-Code Generation - Answer (click here)
42. Variants of Syntax Trees - Answer (click here)
43. Three-Address Code - Answer (click here)
44. Types and Declarations - Answer (click here)
45. Translation of Expressions - Answer (click here)
46. Type Checking - Answer (click here)
47. Control Flow - Answer (click here)
48. Backpatching - Answer (click here)
49. Switch-Statements - Answer (click here)
50. Intermediate Code for Procedures - Answer (click here)
51. Run-Time Environments - Answer (click here)
52. Storage Organization - Answer (click here)
53. Stack Allocation of Space - Answer (click here)
54. Access to Nonlocal Data on the Stack - Answer (click here)
55. Heap Management - Answer (click here)
56. Introduction to Garbage Collection - Answer (click here)
57. Introduction to Trace-Based Collection - Answer (click here)
58. Short-Pause Garbage Collection - Answer (click here)
59. Advanced Topics in Garbage Collection - Answer (click here)
60. Code Generation - Answer (click here)
61. Issues in the Design of a Code Generator - Answer (click here)
62. The Target Language - Answer (click here)
63. Addresses in the Target Code - Answer (click here)
64. Basic Blocks and Flow Graphs - Answer (click here)
65. Optimization of Basic Blocks - Answer (click here)
66. A Simple Code Generator - Answer (click here)
67. Peephole Optimization - Answer (click here)
68. Register Allocation and Assignment - Answer (click here)
69. Instruction Selection by Tree Rewriting - Answer (click here)
70. Optimal Code Generation for Expressions - Answer (click here)
71. Dynamic Programming Code-Generation - Answer (click here)

Chapter 9 Machine Independent Optimizations

1. Compilers - Principles, Techniques, & Tools - Answer (click here)
2. Language Processors - Answer (click here)
3. The Structure of a Compiler - Answer (click here)
4. The Evolution of Programming Languages - Answer (click here)
5. The Science of Building a Compiler - Answer (click here)
6. Applications of Compiler Technology - Answer (click here)
7. Programming Language Basics - Answer (click here)
8. A Simple Syntax-Directed Translator - Answer (click here)
9. Syntax Definition - Answer (click here)
10. Syntax-Directed Translation - Answer (click here)
11. Parsing - Answer (click here)
12. A Translator for Simple Expressions - Answer (click here)
13. Lexical Analysis - Answer (click here)
14. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
15. Intermediate Code Generation - Answer (click here)
16. Lexical Analysis - Answer (click here)
17. The Role of the Lexical Analyzer - Answer (click here)
18. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
19. Specification of Tokens - Answer (click here)
20. Recognition of Tokens - Answer (click here)
21. The Lexical-Analyzer Generator Lex - Answer (click here)
22. Finite Automata - Answer (click here)
23. From Regular Expressions to Automata - Answer (click here)
24. Design of a Lexical-Analyzer Generator - Answer (click here)
25. Optimization of DFA-Based Pattern Matchers - Answer (click here)
26. Syntax Analysis - Answer (click here)
27. Context-Free Grammars - Answer (click here)
28. Writing a Grammar - Answer (click here)
29. Top-Down Parsing - Answer (click here)
30. Bottom-Up Parsing - Answer (click here)
31. Introduction to LR Parsing: Simple LR - Answer (click here)
32. More Powerful LR Parsers - Answer (click here)
33. Using Ambiguous Grammars - Answer (click here)
34. Parser Generators - Answer (click here)
35. Syntax-Directed Translation - Answer (click here)
36. Syntax-Directed Definitions - Answer (click here)
37. Evaluation Orders for SDD's - Answer (click here)
38. Applications of Syntax-Directed Translation - Answer (click here)
39. Syntax-Directed Translation Schemes - Answer (click here)
40. Implementing L-Attributed SDD's - Answer (click here)
41. Intermediate-Code Generation - Answer (click here)
42. Variants of Syntax Trees - Answer (click here)
43. Three-Address Code - Answer (click here)
44. Types and Declarations - Answer (click here)
45. Translation of Expressions - Answer (click here)
46. Type Checking - Answer (click here)
47. Control Flow - Answer (click here)
48. Backpatching - Answer (click here)
49. Switch-Statements - Answer (click here)
50. Intermediate Code for Procedures - Answer (click here)
51. Run-Time Environments - Answer (click here)
52. Storage Organization - Answer (click here)
53. Stack Allocation of Space - Answer (click here)
54. Access to Nonlocal Data on the Stack - Answer (click here)
55. Heap Management - Answer (click here)
56. Introduction to Garbage Collection - Answer (click here)
57. Introduction to Trace-Based Collection - Answer (click here)
58. Short-Pause Garbage Collection - Answer (click here)
59. Advanced Topics in Garbage Collection - Answer (click here)
60. Code Generation - Answer (click here)
61. Issues in the Design of a Code Generator - Answer (click here)
62. The Target Language - Answer (click here)
63. Addresses in the Target Code - Answer (click here)
64. Basic Blocks and Flow Graphs - Answer (click here)
65. Optimization of Basic Blocks - Answer (click here)
66. A Simple Code Generator - Answer (click here)
67. Peephole Optimization - Answer (click here)
68. Register Allocation and Assignment - Answer (click here)
69. Instruction Selection by Tree Rewriting - Answer (click here)
70. Optimal Code Generation for Expressions - Answer (click here)
71. Dynamic Programming Code-Generation - Answer (click here)
72. Machine-Independent Optimizations - Answer (click here)
73. The Principal Sources of Optimization - Answer (click here)
74. Introduction to Data-Flow Analysis - Answer (click here)
75. Foundations of Data-Flow Analysis - Answer (click here)
 76. Constant Propagation - Answer (click here)
77. Partial-Redundancy Elimination - Answer (click here)
78. Loops in Flow Graphs - Answer (click here)
79. Region-Based Analysis - Answer (click here)
80. Symbolic Analysis - Answer (click here)

Chapter 10 Instruction Level Parallelism

1. Compilers - Principles, Techniques, & Tools - Answer (click here)
2. Language Processors - Answer (click here)
3. The Structure of a Compiler - Answer (click here)
4. The Evolution of Programming Languages - Answer (click here)
5. The Science of Building a Compiler - Answer (click here)
6. Applications of Compiler Technology - Answer (click here)
7. Programming Language Basics - Answer (click here)
8. A Simple Syntax-Directed Translator - Answer (click here)
9. Syntax Definition - Answer (click here)
10. Syntax-Directed Translation - Answer (click here)
11. Parsing - Answer (click here)
12. A Translator for Simple Expressions - Answer (click here)
13. Lexical Analysis - Answer (click here)
14. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
15. Intermediate Code Generation - Answer (click here)
16. Lexical Analysis - Answer (click here)
17. The Role of the Lexical Analyzer - Answer (click here)
18. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
19. Specification of Tokens - Answer (click here)
20. Recognition of Tokens - Answer (click here)
21. The Lexical-Analyzer Generator Lex - Answer (click here)
22. Finite Automata - Answer (click here)
23. From Regular Expressions to Automata - Answer (click here)
24. Design of a Lexical-Analyzer Generator - Answer (click here)
25. Optimization of DFA-Based Pattern Matchers - Answer (click here)
26. Syntax Analysis - Answer (click here)
27. Context-Free Grammars - Answer (click here)
28. Writing a Grammar - Answer (click here)
29. Top-Down Parsing - Answer (click here)
30. Bottom-Up Parsing - Answer (click here)
31. Introduction to LR Parsing: Simple LR - Answer (click here)
32. More Powerful LR Parsers - Answer (click here)
33. Using Ambiguous Grammars - Answer (click here)
34. Parser Generators - Answer (click here)
35. Syntax-Directed Translation - Answer (click here)
36. Syntax-Directed Definitions - Answer (click here)
37. Evaluation Orders for SDD's - Answer (click here)
38. Applications of Syntax-Directed Translation - Answer (click here)
39. Syntax-Directed Translation Schemes - Answer (click here)
40. Implementing L-Attributed SDD's - Answer (click here)
41. Intermediate-Code Generation - Answer (click here)
42. Variants of Syntax Trees - Answer (click here)
43. Three-Address Code - Answer (click here)
44. Types and Declarations - Answer (click here)
45. Translation of Expressions - Answer (click here)
46. Type Checking - Answer (click here)
47. Control Flow - Answer (click here)
48. Backpatching - Answer (click here)
49. Switch-Statements - Answer (click here)
50. Intermediate Code for Procedures - Answer (click here)
51. Run-Time Environments - Answer (click here)
52. Storage Organization - Answer (click here)
53. Stack Allocation of Space - Answer (click here)
54. Access to Nonlocal Data on the Stack - Answer (click here)
55. Heap Management - Answer (click here)
56. Introduction to Garbage Collection - Answer (click here)
57. Introduction to Trace-Based Collection - Answer (click here)
58. Short-Pause Garbage Collection - Answer (click here)
59. Advanced Topics in Garbage Collection - Answer (click here)
60. Code Generation - Answer (click here)
61. Issues in the Design of a Code Generator - Answer (click here)
62. The Target Language - Answer (click here)
63. Addresses in the Target Code - Answer (click here)
64. Basic Blocks and Flow Graphs - Answer (click here)
65. Optimization of Basic Blocks - Answer (click here)
66. A Simple Code Generator - Answer (click here)
67. Peephole Optimization - Answer (click here)
68. Register Allocation and Assignment - Answer (click here)
69. Instruction Selection by Tree Rewriting - Answer (click here)
70. Optimal Code Generation for Expressions - Answer (click here)
71. Dynamic Programming Code-Generation - Answer (click here)
72. Machine-Independent Optimizations - Answer (click here)
73. The Principal Sources of Optimization - Answer (click here)
 74. Introduction to Data-Flow Analysis - Answer (click here)
75. Foundations of Data-Flow Analysis - Answer (click here)
76. Constant Propagation - Answer (click here)
77. Partial-Redundancy Elimination - Answer (click here)
78. Loops in Flow Graphs - Answer (click here)
79. Region-Based Analysis - Answer (click here)
80. Symbolic Analysis - Answer (click here)
81. Instruction-Level Parallelism - Answer (click here)
82. Processor Architectures - Answer (click here)
83. Code-Scheduling Constraints - Answer (click here)
84. Basic-Block Scheduling - Answer (click here)
85. Global Code Scheduling - Answer (click here)
86. Software Pipelining Algorithm - Answer (click here)
87. Scheduling Acyclic Data-Dependence and Cyclic Dependence Graphs -
Answer (click here)
88. Improvements to the Pipelining Algorithms - Answer (click here)

Chapter 11 Optimizing for Parallelism and Locality

1. Compilers - Principles, Techniques, & Tools - Answer (click here)
2. Language Processors - Answer (click here)
3. The Structure of a Compiler - Answer (click here)
4. The Evolution of Programming Languages - Answer (click here)
5. The Science of Building a Compiler - Answer (click here)
6. Applications of Compiler Technology - Answer (click here)
7. Programming Language Basics - Answer (click here)
8. A Simple Syntax-Directed Translator - Answer (click here)
9. Syntax Definition - Answer (click here)
10. Syntax-Directed Translation - Answer (click here)
11. Parsing - Answer (click here)
12. A Translator for Simple Expressions - Answer (click here)
13. Lexical Analysis - Answer (click here)
14. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
15. Intermediate Code Generation - Answer (click here)
16. Lexical Analysis - Answer (click here)
17. The Role of the Lexical Analyzer - Answer (click here)
18. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
19. Specification of Tokens - Answer (click here)
20. Recognition of Tokens - Answer (click here)
21. The Lexical-Analyzer Generator Lex - Answer (click here)
22. Finite Automata - Answer (click here)
23. From Regular Expressions to Automata - Answer (click here)
24. Design of a Lexical-Analyzer Generator - Answer (click here)
25. Optimization of DFA-Based Pattern Matchers - Answer (click here)
26. Syntax Analysis - Answer (click here)
27. Context-Free Grammars - Answer (click here)
28. Writing a Grammar - Answer (click here)
29. Top-Down Parsing - Answer (click here)
30. Bottom-Up Parsing - Answer (click here)
31. Introduction to LR Parsing: Simple LR - Answer (click here)
32. More Powerful LR Parsers - Answer (click here)
33. Using Ambiguous Grammars - Answer (click here)
34. Parser Generators - Answer (click here)
35. Syntax-Directed Translation - Answer (click here)
36. Syntax-Directed Definitions - Answer (click here)
37. Evaluation Orders for SDD's - Answer (click here)
38. Applications of Syntax-Directed Translation - Answer (click here)
39. Syntax-Directed Translation Schemes - Answer (click here)
40. Implementing L-Attributed SDD's - Answer (click here)
41. Intermediate-Code Generation - Answer (click here)
42. Variants of Syntax Trees - Answer (click here)
43. Three-Address Code - Answer (click here)
44. Types and Declarations - Answer (click here)
45. Translation of Expressions - Answer (click here)
46. Type Checking - Answer (click here)
47. Control Flow - Answer (click here)
48. Backpatching - Answer (click here)
49. Switch-Statements - Answer (click here)
50. Intermediate Code for Procedures - Answer (click here)
51. Run-Time Environments - Answer (click here)
52. Storage Organization - Answer (click here)
53. Stack Allocation of Space - Answer (click here)
54. Access to Nonlocal Data on the Stack - Answer (click here)
55. Heap Management - Answer (click here)
56. Introduction to Garbage Collection - Answer (click here)
57. Introduction to Trace-Based Collection - Answer (click here)
58. Short-Pause Garbage Collection - Answer (click here)
59. Advanced Topics in Garbage Collection - Answer (click here)
60. Code Generation - Answer (click here)
61. Issues in the Design of a Code Generator - Answer (click here)
62. The Target Language - Answer (click here)
 63. Addresses in the Target Code - Answer (click here)
64. Basic Blocks and Flow Graphs - Answer (click here)
65. Optimization of Basic Blocks - Answer (click here)
66. A Simple Code Generator - Answer (click here)
67. Peephole Optimization - Answer (click here)
68. Register Allocation and Assignment - Answer (click here)
69. Instruction Selection by Tree Rewriting - Answer (click here)
70. Optimal Code Generation for Expressions - Answer (click here)
71. Dynamic Programming Code-Generation - Answer (click here)
72. Machine-Independent Optimizations - Answer (click here)
73. The Principal Sources of Optimization - Answer (click here)
74. Introduction to Data-Flow Analysis - Answer (click here)
75. Foundations of Data-Flow Analysis - Answer (click here)
76. Constant Propagation - Answer (click here)
77. Partial-Redundancy Elimination - Answer (click here)
78. Loops in Flow Graphs - Answer (click here)
79. Region-Based Analysis - Answer (click here)
80. Symbolic Analysis - Answer (click here)
81. Instruction-Level Parallelism - Answer (click here)
82. Processor Architectures - Answer (click here)
83. Code-Scheduling Constraints - Answer (click here)
84. Basic-Block Scheduling - Answer (click here)
85. Global Code Scheduling - Answer (click here)
86. Software Pipelining Algorithm - Answer (click here)
87. Scheduling Acyclic Data-Dependence and Cyclic Dependence Graphs -
Answer (click here)
88. Improvements to the Pipelining Algorithms - Answer (click here)
89. Optimizing for Parallelism and Locality - Answer (click here)
90. Basic Concepts of Optimizing for Parallelism and Locality - Answer (click
here)
91. Matrix Multiply: An In-Depth Example - Answer (click here)
92. Iteration Spaces - Answer (click here)
93. Affine Array Indexes - Answer (click here)
94. Data Reuse - Answer (click here)
95. Array Data-Dependence Analysis - Answer (click here)
96. Finding Synchronization-Free Parallelism - Answer (click here)
97. Synchronization Between Parallel Loops - Answer (click here)
98. Pipelining - Answer (click here)
99. Locality Optimizations - Answer (click here)
100. Other Uses of Affine Transforms - Answer (click here)
Chapter 12 Interprocedural Analysis
1. Compilers - Principles, Techniques, & Tools - Answer (click here)
2. Language Processors - Answer (click here)
3. The Structure of a Compiler - Answer (click here)
4. The Evolution of Programming Languages - Answer (click here)
5. The Science of Building a Compiler - Answer (click here)
6. Applications of Compiler Technology - Answer (click here)
7. Programming Language Basics - Answer (click here)
8. A Simple Syntax-Directed Translator - Answer (click here)
9. Syntax Definition - Answer (click here)
10. Syntax-Directed Translation - Answer (click here)
11. Parsing - Answer (click here)
12. A Translator for Simple Expressions - Answer (click here)
13. Lexical Analysis - Answer (click here)
14. Symbol Table Per Scope and Use of Symbol Tables - Answer (click here)
15. Intermediate Code Generation - Answer (click here)
16. Lexical Analysis - Answer (click here)
17. The Role of the Lexical Analyzer - Answer (click here)
18. Input Buffering: Buffer Pairs, Sentinels - Answer (click here)
19. Specification of Tokens - Answer (click here)
20. Recognition of Tokens - Answer (click here)
21. The Lexical-Analyzer Generator Lex - Answer (click here)
22. Finite Automata - Answer (click here)
23. From Regular Expressions to Automata - Answer (click here)
24. Design of a Lexical-Analyzer Generator - Answer (click here)
25. Optimization of DFA-Based Pattern Matchers - Answer (click here)
26. Syntax Analysis - Answer (click here)
27. Context-Free Grammars - Answer (click here)
28. Writing a Grammar - Answer (click here)
29. Top-Down Parsing - Answer (click here)
30. Bottom-Up Parsing - Answer (click here)
31. Introduction to LR Parsing: Simple LR - Answer (click here)
32. More Powerful LR Parsers - Answer (click here)
33. Using Ambiguous Grammars - Answer (click here)
34. Parser Generators - Answer (click here)
35. Syntax-Directed Translation - Answer (click here)
36. Syntax-Directed Definitions - Answer (click here)
37. Evaluation Orders for SDD's - Answer (click here)
38. Applications of Syntax-Directed Translation - Answer (click here)
39. Syntax-Directed Translation Schemes - Answer (click here)
40. Implementing L-Attributed SDD's - Answer (click here)
41. Intermediate-Code Generation - Answer (click here)
42. Variants of Syntax Trees - Answer (click here)
43. Three-Address Code - Answer (click here)
44. Types and Declarations - Answer (click here)
45. Translation of Expressions - Answer (click here)
46. Type Checking - Answer (click here)
47. Control Flow - Answer (click here)
48. Backpatching - Answer (click here)
49. Switch-Statements - Answer (click here)
50. Intermediate Code for Procedures - Answer (click here)
51. Run-Time Environments - Answer (click here)
52. Storage Organization - Answer (click here)
53. Stack Allocation of Space - Answer (click here)
54. Access to Nonlocal Data on the Stack - Answer (click here)
55. Heap Management - Answer (click here)
56. Introduction to Garbage Collection - Answer (click here)
57. Introduction to Trace-Based Collection - Answer (click here)
58. Short-Pause Garbage Collection - Answer (click here)
59. Advanced Topics in Garbage Collection - Answer (click here)
60. Code Generation - Answer (click here)
61. Issues in the Design of a Code Generator - Answer (click here)
62. The Target Language - Answer (click here)
63. Addresses in the Target Code - Answer (click here)
64. Basic Blocks and Flow Graphs - Answer (click here)
65. Optimization of Basic Blocks - Answer (click here)
66. A Simple Code Generator - Answer (click here)
67. Peephole Optimization - Answer (click here)
68. Register Allocation and Assignment - Answer (click here)
69. Instruction Selection by Tree Rewriting - Answer (click here)
70. Optimal Code Generation for Expressions - Answer (click here)
71. Dynamic Programming Code-Generation - Answer (click here)
72. Machine-Independent Optimizations - Answer (click here)
73. The Principal Sources of Optimization - Answer (click here)
74. Introduction to Data-Flow Analysis - Answer (click here)
75. Foundations of Data-Flow Analysis - Answer (click here)
76. Constant Propagation - Answer (click here)
77. Partial-Redundancy Elimination - Answer (click here)
78. Loops in Flow Graphs - Answer (click here)
79. Region-Based Analysis - Answer (click here)
 80. Symbolic Analysis - Answer (click here)
81. Instruction-Level Parallelism - Answer (click here)
82. Processor Architectures - Answer (click here)
83. Code-Scheduling Constraints - Answer (click here)
84. Basic-Block Scheduling - Answer (click here)
85. Global Code Scheduling - Answer (click here)
86. Software Pipelining Algorithm - Answer (click here)
87. Scheduling Acyclic Data-Dependence and Cyclic Dependence Graphs -
Answer (click here)
88. Improvements to the Pipelining Algorithms - Answer (click here)
89. Optimizing for Parallelism and Locality - Answer (click here)
90. Basic Concepts of Optimizing for Parallelism and Locality - Answer (click
here)
91. Matrix Multiply: An In-Depth Example - Answer (click here)
92. Iteration Spaces - Answer (click here)
93. Affine Array Indexes - Answer (click here)
94. Data Reuse - Answer (click here)
95. Array Data-Dependence Analysis - Answer (click here)
96. Finding Synchronization-Free Parallelism - Answer (click here)
97. Synchronization Between Parallel Loops - Answer (click here)
98. Pipelining - Answer (click here)
99. Locality Optimizations - Answer (click here)
100. Other Uses of Affine Transforms - Answer (click here)
101. Interprocedural Analysis - Answer (click here)
102. Basic Concepts of Interprocedural Analysis - Answer (click here)
103. Why Interprocedural Analysis? - Answer (click here)
104. A Logical Representation of Data Flow - Answer (click here)
105. A Simple Pointer-Analysis Algorithm - Answer (click here)
106. Context-Insensitive Interprocedural Analysis - Answer (click here)
107. Context-Sensitive Pointer Analysis - Answer (click here)
108. Datalog Implementation by BDD's - Answer (click here)