Principles of Programming Language Translators
summary
Thesis: abstractions and algorithms turn compiler design from craft to engineering by giving precise models, tools and fast implementations. Examples: regular‑expression matchers move from exponential hacks to linear‑time algorithms (Thompson NFA and lazy DFA); LEX/flex produces lexers, YACC/bison produces parsers; LLVM uses a common LLVM-IR so front ends and back ends interoperate. Evidence: dragon books grow from 600 to 1,000 pages; earliest compiler cost 18 staff‑years versus new languages built in weeks; quantum toolchain includes Q# and ~100‑qubit machines while Shor needs ~1M qubits.
AI-written summary · about
chapters (7)
- 0:00Computational thinking
- 2:08Abstractions and algorithms
- 7:57Compiler phases and tools
- 16:18Optimization and dragon books
- 21:42Academic impact and practice
- 25:14Quantum programming languages
- 40:46Q&A and closing remarks
related talks
34mYour Program as a Transpiler: Applying Compiler Design to Everyday Programming
54mProgramming Language Design and Implementation for the Machine Learning Era: A Personal(…)
40mYour Program as a Transpiler: Applying Compiler Design to Everyday Programming
57mWhy Programming Languages Matter
54mProgramming Language Design and Implementation for the Machine Learning Era: A Personal(…)
49mWhat Counts as a Programming Language?
01h 31m"Thoughts on language evolution"
44mLet's talk about transpilers