Re:Proving that C++'s grammar is undecidable
by banachtarski on Tuesday April 28, 2020 @09:27PM
(#23014253)
Turing completeness and undecidable parsing grammars are completely orthogonal concepts.
[ Parent
| on HN ]
There are no comments on this comment yet.