Talk:Tail recursive 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

???

This article has not yet received a rating on Wikipedia's content assessment scale.

???

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}}

I can find very little web information on this subject, I hope someone finds it useful. I find it to be an interesting parsing method that is not discussed as much. I used it for a science fair project, and the result turned out quite nice, and pretty simple.

Okay, I changed this page to be a little less overly complex. Thanks to ard on #dhell of dynamichell.org for helping me with the sentences.

Merge into recursive descent parser

I don't see any reason for this to be it's own article. This is a common optimization that the dragon book doesn't bother to give a distinct name. Even the recursive descent parser article's implementation uses this technique. I don't see anything interesting in the Dr. Dobb's article that isn't already covered in the dragon book. 15.227.137.69 21:50, 16 February 2007 (UTC)[reply]

This is a common technique

Which is the reason for the repetition in the EBNF notation in the first place.

Stupid and ambiguous grammar

The grammar is a) stupid and b) ambiguous. Either you do normal left-recursion for such operator-expressions:

 F → F + I | I

or you use the LL(k)-compatible workaround:

 F → I (+ I)*

But the example does not make sense… Could you explain it?

--Chricho (talk) 13:06, 11 September 2010 (UTC)[reply]