Hi,
I was wondering what the semantics of your PEG+leftrec implementation
is, and whether it matches that of the paper by Medeiros, Mascarenhas &
Ierusalimschy (https://arxiv.org/abs/1207.0443)? In that paper, they
extend the operational semantics of PEG with left recursion by
iteratively increasing bounds on the recursion depth of left recursive
rules until a match is found.
I found it hard to wrap my head around that definition, and it didn't
seem very natural to me, so I was wondering if you have a simpler, or at
least different, approach?
Cheers,
Ulrik
_______________________________________________
PEG mailing list
PEG@lists.csail.mit.edu
https://lists.csail.mit.edu/mailman/listinfo/peg
