On Apr 12, 2011, at 7:01 AM, Dale Schumacher wrote: > As your paper notes, in modifying PEGs to support left recursion "In > essence, the parser turns from (recursive) top-down in normal > operation to (iterative) bottom-up when left-recursion is detected." > This mixed-model of parsing strategy can lead to very confusing > behavior. In your conclusion, you pose the question, "are PEGs really > suited to allowing left-recursion?" > > My answer to that question is "NO".
Agreed. Per previous post, I transform left-recur grammars of interest to straight peg/predicated-LL(*). > There is probably a theoretical > argument to be made regarding the composability of PEGs, but I don't > have the academic inclination to pursue that angle. Rather, I appeal > to the inherent ability for non-experts to reason about the behavior > of PEGs. That is the secret sauce. Ter _______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
