It seems that recursive-descent parsers are not only the simplest to explain, but also the simplest to design and maintain. They aren\'t limited to LALR(1) grammars, and the cod