Recursive ascent is used only for left-recursive expressions.
The rest is regular PEG.
Roman
On 2020-01-17 13:07, Orlando Hill wrote:
Hi Roman,
Well done, and thank you for the write up of your approach. It sounds
similar to what I described in 2007 and 2010.
Do you use recursive descent too, or is it purely recursive ascent
when a grammar has left-recursion?
For parsers based on context-free grammars, there is a technique
called recursive ascent-descent. Perhaps that name should be applied
to PEG-based parsers that use ascent and descent too.
Orlando
On Fri, Jan 3, 2020, 13:15 Roman Redz <ro...@redz.se
<mailto:ro...@redz.se>> wrote:
My "Mouse" (http://mousepeg.sourceforge.net) has just received
some ability to process left-recursive grammars.
It uses an experimental technique of "recursive ascent" outlined
in http://www.romanredz.se/Mouse/RecursiveAscent.pdf.
A precise theoretical analysis is still waiting.
Roman
_______________________________________________
PEG mailing list
PEG@lists.csail.mit.edu <mailto:PEG@lists.csail.mit.edu>
https://lists.csail.mit.edu/mailman/listinfo/peg
_______________________________________________
PEG mailing list
PEG@lists.csail.mit.edu
https://lists.csail.mit.edu/mailman/listinfo/peg
