Talk:Recursive ascent parser

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

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)[reply]

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 Iterator[Char] 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 E ::= E '+' 'x' 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)[reply]

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)[reply]

References

I have no time fix it, but the references are not written as they should. An article by Leermakers, Augusteijn and Kruseman Aretz, in that order, is represented by "Kruseman Aretz". Sperber and Thiemann (http://portal.acm.org/citation.cfm?id=349219&dl=GUIDE&coll=GUIDE&CFID=56087236&CFTOKEN=74111863) deserve to be mentioned. —Preceding unsigned comment added by Goeie (talk • contribs) 11:36, 12 October 2009 (UTC) Done.[reply]

How does on edit the references? If I click edit, an empty box appears... —Preceding unsigned comment added by 77.126.44.25 (talk) 14:24, 13 October 2009 (UTC) Done.[reply]