Talk:Recursive ascent parser

Example section
The lengthy code-snippet in the example section is provided without any reference, and I do not think it is sufficiently obvious that it is a recursive ascent parser to meet the requirement that it be a "simple and direct deduction" from referenced information. (Also, a shorter example would be much better; perhaps use a smaller grammar such as $$E\to E~\textrm{'}\texttt{+}\textrm{'}~\textrm{'}\texttt{x}\textrm{'}$$?) — Schwerdf (talk) 20:52, 6 October 2009 (UTC)


 * I'm the original author of the snippet in question. The structure of the snippet was drawn directly from the linked Boyland and Spiewak paper on Recursive Ascent/Descent, modified slightly to be purely-functional.  The tool ScalaBison generates code very similar to this (except that it uses   and global mutable state).  I do agree that a shorter example might be more understandable though.  We'd have to do something a bit more involved than   though, given that the grammar is degenerate.  :-)  I originally drew my example from the LR parser page. Daniel Spiewak (talk) 18:58, 30 May 2010 (UTC)

I don't think the grammar complexity is too bad, but Scala has a lot of syntactic clutter that gets in the way of the algorithm and isn't as widely known as, say, Python, or as bare as C. Given the original paper was using assembler, it would be nice to see a more stripped back implementation that promoted the method. -- Ralph Corderoy (talk) 13:31, 18 November 2016 (UTC)