Pointing out ambiguities in a context-free grammar is an undecidable problem (http://www.cis.upenn.edu/~jean/gbooks/PCPh04.pdf).
No, that's not what your link proves and not what we are talking about.
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?
But I don't think the world of context-free grammars even matters that much.