Skip to content

Language Design and Theory of Computation

andychu edited this page Jan 22, 2017 · 25 revisions

Parsing Bash is Undecidable -- Bash, Perl, and Make can't be statically parsed because they interleave parsing and execution. C++ can't be statically parsed because it has two Turing complete computation mechanisms -- the templates at compile times and normal code at runtime -- and parsing sits in between them.

Accidentally Turing Complete

Clone this wiki locally