A PEG parser generator will produce a recursive descent parser, which should be exactly what the author was looking for. That pesky operator precedence thing is

A PEG parser generator will produce a recursive descent parser, which should be exactly what the author was looking for. That pesky operator precedence thing is solved (as it is in most BNF-like grammars) with rules nested in precedence order. Rats! is a PEG parser generator for Java. http://www.cs.nyu.edu/~rgrimm/xtc/rats.html http://www.cs.nyu.edu/~rgrimm/xtc/rats.html If the author would like more links, he should google "PEG parser generator".