Hello, If indeed unbounded left recursion in PEG grammars is solved, it could be possible analyze the relationship between the PEG+LEFT and CFG sets by proving something like that there's a PEG+LEFT grammar that parses the same language as any given CFG.
Right? -- Juancarlo *Añez*
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
