But to be fair, this is a really tiny subset. It's really more correct to call it an augmented infix expression parser. There's no symbol table -- there are 26 fixed variables named 'a' through 'z', and no arrays/pointers nor other way of doing indirection, so 26 values is all you get. And there are no functions, so no recursion. So it's not even turing complete.

It is, however, a pretty neat hack if you're interested in the essence of how a parser and code generator works. This kind of thing isn't nearly as complicated as a lot of people assume, and this is a fun existence proof of that fact.