Elements of Compiler Design Book

Preface     ix
Acknowledgement     xi
About the Author     xiii
Introduction     1
Mathematical Preliminaries     1
Compilation     8
Rewriting Systems     15
Exercises     16
Lexical Analysis     21
Models     21
Methods     32
Theory     42
Transformation of Regular Expressions to Finite Automata     42
Simplification of Finite Automata     49
Non-Regular Lexical Constructs     56
Decidable problems     65
Exercises     68
Syntax Analysis     75
Models     75
Methods     89
Theory     103
Power of Parsing Models     103
Verification of the Grammatical Syntax Specification     104
Simplification of Grammars     106
Grammatical Normal Forms and Parsing Based on Them     116
Syntax that Grammars cannot Specify     121
Decidable Problems     128
Exercises     129
Deterministic Top-Down Parsing     139
Predictive Sets and LL Grammars     139
Predictive Parsing     145
Exercises     154
Deterministic Bottom-Up Parsing     159
Precedence Parsing     159
LR Parsing     168
Exercises     180
Syntax-Directed Translation and Intermediate Code Generation     185
Bottom-Up Syntax-Directed Translation and Intermediate Code Generation     186
Syntax Trees     187
Three-Address Code     193
Polish Notation     195
Top-Down Syntax-Directed Translation     196
Semantic Analysis     199
Symbol Table     200
Software Tools for Syntax-Directed Translation     204
Exercises     208
Optimization and Target Code Generation     213
Tracking the Use of Variables     213
Optimization of Intermediate Code     221
Optimization and Generation of Target Code     225
Exercises     229
Conclusion     233
Implementation     239
Concept     239
Code     242
Bibliography     255
Indices     277
Index to the Case Study     277
Index to Algorithms     279
Subject Index     281