Building a Karel parser as a compiler front end
A walkthrough of a Java lexer, LL(1) recursive-descent parser, and scope checker for a small Karel-style language.
Notes
Field notes on building software: the debugging, architecture and algorithm decisions behind the work, written to be legible.
-
-
Why bank reconciliation becomes an NP-hard search problem
A rigorous model for reconciliation as bipartite matching plus constrained set packing, and the hybrid heuristic that makes it practical.