Hi:
Thanks to everyone for all the left-recursion discussions, I have
been most interested.
I had played with a very similar approach, but had not sorted out
indirect recursions, so thanks Orlando and I'd be most interested in
anything more you have on this.
One nagging worry: my working definition of a deterministic grammar/
parse is that there can only be one match for any rule from any given
position... which fits with PEG and pack-rat memos.. but left
recursion breaks this definition... Any suggestions?
Thanks again,
Peter Cashin.
_______________________________________________
PEG mailing list
PEG@lists.csail.mit.edu
https://lists.csail.mit.edu/mailman/listinfo/peg
