Compilers
Undergraduate · CS / Programming
Syllabus focus
Standard syllabus · Theoretical / proof-based
Pricing calculator
Choose materials, tutoring, or both — or book a single session as needed. Customize your plan on the subscribe page.
Billed in 15-minute increments (15-minute minimum, up to 4 hours). No subscription required.
$60.00 · 60 min · Undergraduate · Online ($60/hr)
Book through intake or schedule a session.
Topics typically covered
Standard syllabus
Front end
- Compiler phases and intermediate representations
- Regular expressions, NFAs/DFAs, and lexical analyzers
- Context-free grammars and parse trees
- Top-down and bottom-up parsing (LL, LR intro)
- Syntax-directed translation and attribute grammars
Middle and back end
- Type checking and symbol tables
- Intermediate code: three-address code, SSA (intro)
- Runtime environments: stacks, heaps, activation records
- Code generation for a simple RISC-like target
- Register allocation and instruction selection (intro)
Theoretical / proof-based
Formal foundations
- Ambiguity and grammar transformations
- LR parser table construction proofs (intro)
- Dataflow analysis framework: gen/kill, fixed points
- Correctness of live-variable and reaching-definitions analyses
- SSA construction and dominance frontiers (intro)
Optimization theory
- Peephole and local optimizations
- Global optimizations: constant propagation, DCE
- Loop optimizations: LICM, strength reduction (intro)
- Interprocedural analysis challenges
- Writing proofs for optimization safety (intro)
Notes
Often includes a substantial course project implementing a compiler for a small language.