News for hackers. Stuff that matters.
Re:Langsec explained in a few slogans by alexbecker on Sunday November 22, 2015 @03:39AM (#10609483)
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.

There are no comments on this comment yet.