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)
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.