Well, for one thing, it really shortens the discussion if you take advantage of it. For all languages that require arbitrary code execution in that language at compile time in order to be parsed, parsing therefore is Turing complete and therefore has all properties of Turing completeness, including undecidability. QED.