CS 143: Compilers

Stanford course with 15 lecture notes.

Lecture Timeline

• 2025-04-01 — SU-CS143 APR012025
• 2025-04-03 — SU-CS143 APR032025
• 2025-04-08 — SU-CS143 APR082025
• 2025-04-10 — SU-CS143 APR102025
• 2025-04-15 — SU-CS143 APR152025
• 2025-04-17 — SU-CS143 APR172025
• 2025-04-24 — SU-CS143 APR242025
• 2025-04-29 — SU-CS143 APR292025
• 2025-05-06 — SU-CS143 MAY062025
• 2025-05-08 — SU-CS143 MAY082025
• 2025-05-15 — SU-CS143 MAY152025
• 2025-05-20 — SU-CS143 MAY202025
• 2025-05-22 — SU-CS143 MAY222025
• 2025-05-27 — SU-CS143 MAY272025
• 2025-05-29 — SU-CS143 MAY292025

Key Topics Referenced

• Abstract Syntax Tree
• Alphabet
• Axiomatic Semantics
• Building A Parser
• Context Free Grammars
• Deterministic Finite Automata
• Nondeterministic Finite Automata
• Programmatically Compiling Regex To Dfa
• Register Allocation
• Regular Expression Complexity
• Regular Language