News for hackers. Stuff that matters.
Re:Ohm: Parsing Made Easy by panic on Tuesday October 17, 2017 @12:29PM (#15492289)
Pointing out ambiguities in a context-free grammar is an undecidable problem (http://www.cis.upenn.edu/~jean/gbooks/PCPh04.pdf).
Re:Ohm: Parsing Made Easy by zzzcpan on Tuesday October 17, 2017 @12:41PM (#15492405)
No, that's not what your link proves and not what we are talking about.
Re:Ohm: Parsing Made Easy by panic on Tuesday October 17, 2017 @01:58PM (#15493095)
Theorem 6.8.2 in the PDF: It is undecidable whether a context-free grammar is ambiguous.

PEGs are unambiguous by construction, so I assumed we were talking about grammars which would be ambiguous as CFGs (replacing every ordered choice with a nondeterministic choice). What kind of ambiguity were you thinking about?

Re:Ohm: Parsing Made Easy by zzzcpan on Tuesday October 17, 2017 @02:25PM (#15493394)
Any ambiguity that manifests itself as unreachable alternatives in PEGs can be detected for example. Doesn't matter if it's undecidable whether the whole grammar is ambiguous.