| Week | Date | Slide set | Topic | Remarks |
| 2 | 07.01 | 01,02 | Introduction, Determinisitc Finite Automata (DFA) | |
| 10.01 | 03 | Non-deterministic Finite Automata (NFA) and Regular Expressions | |
| 3 | 14.01 | 04,05 | NFA-DFA conversion, state minimization, lexical analysis summary | flex examples |
| 17.01 | 06 | Context-Free Grammars | |
| 4 | 21.01 | 07,08 | Top-down and bottom-up parsing, LL(1) parser construction | |
| 24.01 | 09 | Bottom-up parsing, LR(0) parser construction | |
| 5 | 28.01 | 10,11 | LR(0), SLR, LALR and LR(1) parsing tables | |
| 31.01 | 12 | Syntax-directed definition | |
| 6 | 04.02 | own | Operational semantics | (Extracurricular) |
| 07.02 | 13 | Type judgments | |
| 7 | 11.02 | 14,15 | Type checking, derived types | |
| 14.02 | 16 | Three-address code (TAC) | |
| 8 | 18.02 | 17,18 | Run time stack, function calls and stack frames | |
| 21.02 | 19 | Simple objects | |
| 9 | 25.02 | 20,21 | Basics of x86_64 instruction set architecture | |
| 28.02 | 22 | Introduction to optimizations | |
| 10 | 04.03 | 23,24 | Control flow graphs and liveness analysis | |
| 07.03 | 25 | Dataflow analysis framework | |
| 11 | 11.03 | | | Cancelled |
| 14.03 | | | Cancelled |
| 12 | 18.03 | 26,27 | Dataflow analysis instances | |
| 21.03 | 28 | Dataflow analysis summary | |
| 13 | 25.03 | 29,30 | Control flow and loop detection, instruction selection | |
| 28.03 | 31 | Register allocation | |
| 14 | 01.04 | Summary | | |
| 04.04 | Summary | | |
| 15 | 08.04 | | Denotational semantics | (Extracurricular) Excursion week, 3rd year |
| 11.04 | | Fixed points | (Extracurricular) Excursion week, 3rd year |
| 16 | 08.04 | | Easter | |
| 11.04 | | Easter | |
| 17 | 24.04 | | | Teaching ends |