We report on a one-semester compiler construction course based on the idea of implementing a small self-contained compiler for a small model language from scratch, not using other compiler construction frameworks. The course is built around an evolving family of languages with increasing expressiveness and complexity, which finally is crowned by a language with first-class functions, S-expressions, pattern matching, and garbage collection. The code generation technique is based on the idea of symbolic interpreters, which allows to implement a robust albeit not a very efficient native code generator. We give the motivation for the course, describe its structure, and report some results of teaching based on students' post-course surveys.
@article{arxiv.2207.12698,
title = {Reimplementing the Wheel: Teaching Compilers with a Small Self-Contained One},
author = {Daniil Berezun and Dmitry Boulytchev},
journal= {arXiv preprint arXiv:2207.12698},
year = {2022}
}