Wirth Niklaus - Compiler Construction [1996/2005/2017, PDF, ENG]

Preface
Contents
1. Introduction
2. Language and Syntax
    2.1. Exercises
3. Regular languages
    3.1. Exercise
4. Analysis of Context-free Languages
    4.1. The method of recursive descent
    4.2. Table-driven top-down parsing
    4.3. Bottom-up parsing
    4.4. Exercises
5. Attributed Grammars and Semantics
    5.1. Type rules
    5.2. Evaluation rules
    5.3. Translation rules
    5.4. Exercise
6. The Programming Language Oberon-0
    6.1. Exercise
7. A Parser for Oberon-0
    7.1. The scanner
    7.2. The parser
    7.3. Coping with syntactic errors
    7.4. Exercises
8. Consideration of Context Specified by Declarations
    8.1. Declarations
    8.2. Entries for data types
    8.3. Data representation at run time
    8.4. Exercises
9. A RISC Architecture as Target
10. Expressions and Assignments
    10.1. Straight code generation according to the stack principle
    10.2. Delayed code generation
    10.3. Indexed variables and record fields
    10.4. Exercises
11. Conditional and Repeated Statements and Boolean Expressions
    11.1. Comparisons and jumps
    11.2. Conditional and repeated statements
    11.3. Boolean operations
    11.4. Assignments to Boolean variables
    11.5. Exercises
12. Procedures and the Concept of Locality
    12.1. Run-time organization of the store
    12.2. Addressing variables
    12.3. Parameters
    12.4. Procedure declarations and calls
    12.5. Standard procedures
    12.6. Function procedures
    12.7. Exercises
13. Elementary Data Types
    13.1. The types REAL and LONGREAL
    13.2. Compatibility between numeric data types
    13.3. The data type SET
    13.4. Exercises
14. Open Arrays, Pointers and Procedure Types
    14.1. Open arrays
    14.2. Dynamic data structures and pointers
    14.3. Procedure types
    14.4. Exercises
15. Modules and Separate Compilation
    15.1. The principle of information hiding
    15.2. Separate compilation
    15.3. Implementation of symbol files
    15.4. Addressing external objects
    15.5. Checking configuration consistency
    15.6. Exercises
16. Code Optimization and the Frontend/Backend Structure
    16.1. General considerations
    16.2. Simple optimizations
    16.3. Avoiding repeated evaluation
    16.4. Register allocation
    16.5. The fronend/backend compiler structure
    16.6. Exercises
A. Syntax
    A.1. Oberon-0
    A.2. Oberon
    A.3. Symbol files
B. The ASCII character set
C. The Oberon-0 compiler
    C.1. The scanner
    C.2. The parser
    C.3. The code generator
References

1. Wirth N. Systematic Programming: An Introduction. — Prentice-Hall, 1973. • 𝐑𝐔
   
2. Jensen K., Wirth N. Pascal: User Manual and Report. — Springer-Verlag, 1974. • 4th ed. • 𝐑𝐔
   
3. Wirth N. Algorithms + Data Structures = Programs. — Prentice-Hall, 1976. • 𝐑𝐔
   
4. Wirth N. Programming in Modula-2. — Springer-Verlag, 1982. • 2nd ed. • 3rd ed. • 𝐑𝐔
   
5. Wirth. N. Algorithms & Data Structures. — Prentice-Hall, 1986. • 𝐑𝐔
   
6. Reiser M., Wirth N. Programming in Oberon: Steps Beyond Pascal and Modula. — Addison-Wesley, 1992.
   
7. Wirth N., Gutknecht J. Project Oberon. — Addison-Wesley, 1992. • 𝐑𝐔
   
8. Wirth N. Digital Circuit Design for Computer Science Students. — Springer, 1995.
   
9. Wirth N. Compiler Construction. — Addison-Wesley, 1996. • 𝐑𝐔
   
10. Wirth N. Programming in Oberon. — Самиздат, 2004. (Это Programming in Modula-2, переписанная с Модулы на Оберон.)