On Tue, Apr 12, 2011 at 08:47:42AM -0700, Terence Parr wrote: Dear Terence,
> Only limitation is immediate-left-recur handled only. In my experience, > that's good enough :) No point in some complicated algorithm when this > covers any grammar I'd care about. A quick question: is any type of direct left recursion handled? I'm probably being an idiot here (it's my normal mode), but your wiki post suggests that this relies on the grammar being built in an "expression" sort-of way, but the above post suggested there might be a bit more flexibility? Yours, Laurie -- http://tratt.net/laurie/ -- Personal http://fetegeo.org/ -- Free text geocoding http://convergepl.org/ -- The Converge programming language _______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
