Theoretical / proof-based
Compilers · Undergraduate · CS / Programming
Topics
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)
Analysis and correctness arguments
- Proving scanner/regex equivalence sketches
- Soundness of type systems for a core language (intro)
- Lattice theory for dataflow analyses
- Dominance, loops, and natural loop nesting
- Safety vs liveness properties of optimizations
- Writing machine-checked intuition without full formalization
Pricing calculator
Choose materials, tutoring, or both — or book a single session as needed. Customize your plan on the subscribe page.
$1,162 · Compilers · 18 tutoring hrs
Study guides, worksheets, reviews, practice tests, and answer keys for 1 class. 18 tutoring hours (1 hr / week · semester). Bundle discount applied vs buying separately. Pay in full via Zelle.