Compilers
How source code becomes something a machine can run: parsing expressions into an AST with correct operator precedence, and an optimization pass that folds constant subexpressions -- grounded in how TypeScript and LLVM do the same jobs.
4 exercises
Start with "Recursive-Descent Expression Parser"Tap the menu button in the corner to browse all exercises.