> ... an algorithm that converts every CFG into a PEG. I'm not optimistic about the > prospects of this approach ...
this CFG is just the regular language "odd number of x's" S ← 'x' S 'x' | 'x' an equivalent PEG: S <- 'x' 'xx'* or S <- 'xx'* 'x' 'xx'* i guess smarter people than us have tried to find a way to convert CFGs to PEGs... "It is an open problem to give a concrete example of a context-free language which cannot be recognized by a parsing expression grammar.[1] <https://en.wikipedia.org/wiki/Parsing_expression_grammar#cite_note-For04-1> "
_______________________________________________ PEG mailing list PEG@lists.csail.mit.edu https://lists.csail.mit.edu/mailman/listinfo/peg
