Against Query Based Compilers
matklad.github.io · 1,469 words · saved by 1 readers
Query based compilers are all the rage these days, so it feels only appropriate to chart some treacherous shoals in those waters.
Query based compilers are all the rage these days, so it feels only appropriate to chart some treacherous shoals in those waters. A query-based compiler is a straightforward application of the idea of incremental computations to, you guessed it, compiling. A compiler is just a simple text transformation program, implemented as a lot of functions. You could visualize a run of a compiler on a particular input source code as a graph of function calls: Here, schematically, squares are inputs like file text or compiler’s command line arguments, g is an intermediate function (e.g, type checking), wh
saved by
related reading
- Treat Agent Output Like Compiler Output | Skipskiplabs.io
- What can we learn from how compilers are designed?tedinski.com
- Everything I know about good system designseangoedecke.com
- Against SQLscattered-thoughts.net
- A friendly introduction to machine learning compilers and optimizershuyenchip.com
- What to learndanluu.com
- What even is compiler correctness?williamjbowman.com
- Compiler Optimizations Are Hard Because They Forget - Faultlorefaultlore.com
- How Compiler Explorer Works in 2025 — Matt Godbolt’s blogxania.org
- Thinking like Transformersrush.github.io
- Building data-centric apps with a reactive relational databaseriffle.systems
- Writing a C compiler in 500 lines of Pythonvgel.me