On 2014-05-25 7:19 PM, 罗勇刚(Yonggang Luo) wrote:
Do you deal with left-recursive properly?
Yes; left recursion causes the naive recursive algorithm to go into an infinite loop, my algorithm instead detects it and inserts an "infinite loop" failure expression which resolves to "not a match".
Given this ability to detect left recursion without crashing the program, I'd like to investigate ways to give it useful semantics at some point in the future, but I've got a lot of other things I'd like to do with this work first.
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
