2 ms·
The last one is a little misleading. While the equivalence problem for two such parsers is undecidable, this just means that some pair of parsers are identical
by alexbecker 11y ago
The last one is a little misleading. While the equivalence problem for two such parsers is undecidable, this just means that some pair of parsers are identical but cannot be proven such--for many pairs such a proof exists.