| Lectures, Exams, and Assignments, Fall 2002 | ||||
| Week | Dates | Topic | Assignment / Exam | Text |
| 1 | Aug 26, 28 | Introduction, overview, cross compilers, lexical analysis | 1, 11, 12, 3.1 | |
| 2 | Sept 4 (Sept 2: Labor day) |
Lexical Analysis (cont), practicalities | Scanner , due Sept 16 | 3.4 |
| 3 | Sept 9, 11 | Grammars, syntax analysis, ambiguity | 2.2, 4.1, 4.2, 4.3 | |
| 4 | Sept 16, 18 | Parsing: top-down recursive descent | Automata Homework, due Sept 30 | 2.4, 4.4 |
| 5 | Sept 23, 25 | Syntax-directed translation | 2.3, 5.1, 5.2 | |
| 6 | Sept 30, Oct 2 | The TinyTM language | Notes | |
| 7 | Oct 7, 9 | Semantics of Tiny, formal methods for semantics | Notes | |
| 8 | Oct 14, 16 | Run-time Storage Management | Grammar Homework, due Oct 14 | 7 |
| 9 | Oct 21, 23 (Oct 25: Last drop) |
Finite Automata | Recursive-descent parser, due Oct 21 | |
| 10 | Oct 28, 30 | Regular Expressions | Translating Assignments, due Oct 30 | 3.7 |
| 11 | Nov 4, 6 | Automata Theory | 3 | |
| 12 | Nov 11, 13 | LR Parsing | while, if, relational, logical, due Nov 13 | 4.7 |
| 13 | Nov 18, 20 | More Formal Semantics | Notes | |
| 14 | Nov 25, 27 (Nov 28: Thanksg. ) |
Code Optimization | Functions, due Dec 2 | 10 |
| 15 | Dec 2, 4
(Dec 5, 6: Study) |
Code Optimization | 10 | |
| Dec 10 (Tues) | Final Exam (Review) | |||
Late Penalties:
No Team Programming:
Details about Exams: Exams appear in red in the table above.
Textbook:
Compilers: Principles, Techniques,
and Tools
By Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman,
Addison-Wesley, 1986