tree 361dc8b08d9fa1f78a0bd70d02d425a4a468fa2b
parent c703c8d13456d4a6fdc83c9b39b370af3df12d00
author Travis Cross <tc@traviscross.com> 1747321256 +0000
committer Travis Cross <tc@traviscross.com> 1747380454 +0000

Parse grammar without regexes

We'd been parsing the grammar with a combination of recursive descent
and regular expression matchers.  This combination has its merits, and
it's done tastefully here, but it seems maybe more straightforward to
do the parsing entirely with recursive descent.  Among other things,
doing it this way allows us to provide more precise error reporting on
malformed inputs.

The cost, in terms of lines of code, of doing this is rather modest,
and the result seems at least as clear -- there's some mental cost to
code switching between the two worlds.  So let's make the switch and
parse the grammar without regular expressions.

We verified that the rendered output of the Reference is byte
identical before and after this change.