Category Archives: compiler writing systems

Jeni’s “Grouper” (or how to specify and parse additional rules to a grammar) is just a minor task for LBNF

Posted on March 16, 2008 by

In her recent post "RELAX NG for matching" Jeni Tennison said:   The “grouper” is the most interesting and difficult of these. It needs to act like a tokeniser, except use regular expressions over markup rather than over text. For … Continue reading →

Posted in compiler writing systems | Leave a comment