-
So far I have not seen a need for left recursion, particularly because **pe** emits values in a flat list. But some people seem to really care about it, so this issue is for tracking its implementatio…
-
@XzuluX
Direct-left recursion is handled by Antlr, but I suspect that it is inefficient to use. I updated trgen/trperf to create a heat map of LT() along with a pop-up containing all the call stac…
-
nom can recognize left recursive grammars, but at the price of losing some information. Something like `res
-
It is probably best to rewrite the left recursive grammar, and then perform tree-rewriting for the same effect.
https://en.wikipedia.org/wiki/Left_recursion#Removing_left_recursion
-
A known limitation with packrat parsers is the potential to crash the stack bu creatging rules that are Left Recursive. For example:
```
EXAMPLE
-
Very cool.
Does this implementation support indirect left recursion? There is a paper on implementing indirect left recursion in a packrat parser at:
http://citeseerx.ist.psu.edu/viewdoc/download?do…
-
I believe that Pegmatite uses the OMeta parsing algorithm to support left recursion, but in fact it looks like some cases aren't supported, as shown in:
https://github.com/fabriquer/Pegmatite/blob/…
-
I was trying to run some basic grammar that had some left recursion and realized that the parser doesn't seem to support that. Is there a reason for that/would it be possible for the parser to support…
-
For indirect left-recursion in packrat parsing, one rule in the grammar's graph must be declared as "leading", so that subsequent, even left-recursive parselets are considered as not left-recursive.
…
-
The Julius documentation has always said that only left recursion can be used in grammars and I have always used it that way.. Yet now when I submit a grammar like this:
```
S: NS_B NOUNP NS_E
NOU…