Module
Undergraduate Compilers
Sign in to add this module to your path and practice.
About
A complete undergrad path from source text to optimized machine code: lexing, parsing, ASTs, semantic analysis, IR, simple optimizations, and code generation. Designed for UCLA CS students after CS 32/33/35L and discrete math.
Goal
Implement (or fully specify and walk through) a multi-pass compiler frontend + simple backend for a small imperative language, producing correct assembly or bytecode and applying basic optimizations.
Prerequisites
Tutor
Ask questions about this module.
Hi — I'm your tutor for Undergraduate Compilers. Ask about the concepts, goal, or where you're stuck.