4 ms·
From Wikipedia... > Unlike CFGs, PEGs cannot be ambiguous; if a string parses, it has exactly one valid parse tree. It is conjectured that there exist context-
by jchook 7y ago
From Wikipedia...
> Unlike CFGs, PEGs cannot be ambiguous; if a string parses, it has exactly one valid parse tree. It is conjectured that there exist context-free languages that cannot be recognized by a PEG, but this is not yet proven.
Does this mean that PEG grammars are a form of regular grammar?
- curryhoward 7y agoNo. One can come up with a PEG for a language consisting only of strings with balanced parentheses. That language cannot be described by a regular grammar.