Introduction to Compiler Design

Descripción

The 1rst chapters of the book describes the methods and tools required to read program text and convert it into a form suitable for computer manipulation. This process is made in two stages: A lexical analysis stage that basically divides the input text into a list of “words”. This is followed by a syntax analysis (or parsing) stage that analyses the way these words form structures and converts the text into a data structure that reflects the textual structure. Lexical analysis is covered in Chap. 1 and syntactical analysis in Chap. 2. The remainder of the book (Chaps. 3–9) covers the middle part and back-end of interpreters and compilers. Chapter 3 covers how definitions and uses of names (identifiers) are connected through symbol tables. Chapter 4 shows how you can implement a simple programming language by writing an interpreter and notes that this gives a considerable overhead that can be reduced by doing more things before executing the program, which leads to the following chapters about static type checking (Chap. 5) and compilation (Chaps. 6–9. In Chap. 6, it is shown how expressions and statements can be compiled into an intermediate language, a language that is close to machine language but hides machine-specific details. In Chap. 7,it is discussed how the intermediate language can be converted into “real” machine code. Doing this well requires that the registers in the processor are used to store thevalues of variables, which is achieved by a register allocation process, as described in Chap. 8. Up to this point, a “program” has been what corresponds to the body of a single procedure. Procedure calls add some issues, which are discussed in Chap. 9. The book uses standard set notation and equations over sets. Appendix contains a short summary of these, which may be helpful to those that need these concepts refreshed.

Detalles

Otros Libros de "Computing General"