News for hackers. Stuff that matters.
Re:Proving that C++'s grammar is undecidable by zelly on Tuesday April 28, 2020 @11:54PM (#23015164)
By this logic, any language with metaprogramming is undecidable because you can write undecidable programs as a metaprogram. Execution is not the same as parsing.
Re:Proving that C++'s grammar is undecidable by Kranar on Wednesday April 29, 2020 @11:27AM (#23020373)
If that metaprogramming is Turing complete then yes. The point of this article is to show that metaprogramming in C++ is Turing complete. It had already been widely known but this article presents an explicit demonstration of it.
Re:Proving that C++'s grammar is undecidable by zelly on Wednesday April 29, 2020 @03:28PM (#23023145)
god knows there are easier ways to make a C++ compiler vomit on you
Re:Proving that C++'s grammar is undecidable by saagarjha on Wednesday April 29, 2020 @05:24AM (#23017151)
The execution is necessary for the parse to complete, as until then it’s unknown what the identifier is as it’s dependent on the result of the undecidable expression.