| Instructor: Bruce Mielke | Course:Compiler Theory |
| Office Hours: M,W 2-3 T,R 10-11 other times by appointment |
Office:ES-323G |
| Class Times: T,R 8:00-9:15 | Phone:465-2315 |
Grading: There will be a Mid-term exam worth 100 points and four assignments worth 100 points( Lab 1 (lexical 20 points), (parser 20 points), (table generator 30 points). Lab2 30 points) .
Text:Introduction to Compiler Construction by Thomas W. Parsons
To see output from the second lab click here .
Weekly Schedule | |||
| Week | Lab | Readings | Topics |
| 1 | 1,2.1-2.3 | overview of compiling, Finite-State Automata . | |
| 2 | 2.4-2.5 | DFA and NFA | |
| 3 | 2.6,2.7, 2.9 | Regular expressions and lexical analysis | |
| 4 | Lab 1 (lexical part) | 3.1 | Grammar |
| 5 | 3.2-3.3 | Top-down parsing and Recursive Descent | |
| 6 | Lab 1(parser) | 3.4 | Predictive Parsers |
| 7 | 4.1-4.2 | Bottom-up parsers, Operator precedence grammars. | |
| 8 | 4.3 | LR parsers, MIDTERM | |
| 9 | Lab 1(table generator) | 4.3 | LR parsers |
| 10 | 4.3 | LR parsers and compiler compilers. | |
| 11 | 5.1-5.2 | Semantic actions intermediate code generation | |
| 12 | Lab 2(parser) | 5.3 | Bottom-up translation |
| 13 | 6.1 | Machine independent code optimization | |
| 14 | 6.2-6.3 | Use DAGs to remove redundant code data-flow diagrams | |
| 15 | Lab 2(code generator) | 6.4-6.6 | Non-local and machine dependent optimization |