Hi all, I'm still new to PEG, but I'm occasionally running into left recursions when building syntax highlighters for my code editor. For me left recursions are ambiguous and clearly a definition error. For instance in pure CFG semantics you could cycle random times through the endless recursion and then decide to take the next choice. You end up with different syntax trees, which are all valid productions. Because PEG is always choosing the first choice it produces the undecided case, which possibly can be described as an infinite production tree (correct me if I'm wrong).
Regards, Frank. _______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
