4 Course Notes & Lecture Slides

4.1 Course Notes

Course notes are provided as a reference.

Click here to download the notes.

4.2 Sylvie’s slides (Section 002)

• Lecture 1 (Course Intro, Data Representations)

• Lecture 2 (Representing Programs in Machine Language)

• Lecture 3 (Scanning & Regular Languages: Part 1)

• Lecture 4 (Scanning & Regular Languages: Part 2)

• Lecture 5 (Writing an Assembler: Part 1)

• Lecture 6 (MIPS Assembly Programming: Part 1)

• Lecture 7 (Writing an Assembler: Part 2 & MIPS Assembly Programming: Part 2)

• Lecture 8 (MIPS Assembly Procedures)

• Lecture 9 (Runtime Support: Loading & Linking)

• Lecture 10 (Nondeterministic Finite Automata)

• Lecture 11 (From Regular Languages to Finite Automata)

• Lecture 12 (High-Level Languages, Context-Free Grammars)

• Lecture 13 (Parse Trees & Ambiguity, Intro to Top-Down Parsing)

• Lecture 14 (Top-Down Parsing: Implementation)

• Lecture 15 (Limitations of LL(1), Intro to Bottom-Up Parsing)

• Lecture 16 (Bottom-Up Parsing: LR(0) Algorithm)

• Lecture 17 (Bottom-Up Parsing: SLR(1) & LR(1), Intro to Semantic Analysis)

• Lecture 18 (Semantic Analysis: Implementation)

• Lecture 19 (Code Generation: Variables & Expressions)

• Lecture 20 (Code Generation: More Expressions & Statements)

• Lecture 21 (Code Generation: Procedures)

• Lecture 22 (Memory Management)

• Lecture 23 (Compiler Optimizations)

• Lecture 24 (Course Review)

4.3 Tutorial notes

• Tutorial 1

• Tutorial 2

• Tutorial 3

• Tutorial 4

• Tutorial 5

• Tutorial 6

• Tutorial 7

• Tutorial 8

• Tutorial 9

• Tutorial 10