Re:Proving that C++'s grammar is undecidable
by mehrdadn on Tuesday April 28, 2020 @09:28PM
(#23014254)
No -- the Turing completeness of templates that people refer to just talks about the fact that templates are powerful enough to compute anything. It's a different issue from parsing the template syntax in the first place, which is the problem they talk about here.
[ Parent
| on HN ]
There are no comments on this comment yet.