Hello, This paper describes subset of left-recursive PEGs which can safely work that can work with Warth's algorithms.
It's the kind of answers I'm seeking for Grako: Rules for how to reject left-recursive grammars that will produce unintuitive results under a given algorithm, and how to construct grammars that don't. Cheers, -- Juancarlo *Añez*
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
