3 ms·
By this logic, any language with metaprogramming is undecidable because you can write undecidable programs as a metaprogram. Execution is not the same as parsin
by zelly 7y ago
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.
- saagarjha 7y agoThe 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.
- Kranar 7y agoIf 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.
- zelly 7y agogod knows there are easier ways to make a C++ compiler vomit on you