Brainfuck interpreter written in the C preprocessor

<i>"There has been much speculation on the turing completeness of the C Preprocessor, but I believe this is the first demonstrative proof that the C preprocessor is turing complete. This uses no GCC extensions and other than the rules for macro evaluation the only 'features' it takes advantage of are token pasting and variable argument macros."</i><p>Can anyone confirm that this is really the first demonstrative proof of this kind?

Now all you need to do is implement COBOL in it, and the gate to hell will open.

He said it doesn't use any gcc extensions, but this still doesn't seem to work with llvm-gcc or clang. :(

If there's a recursion limit, can you not write a program that fails to terminate?

Impressive. Massively impressive. Does this count towards your thesis in any way? I'd hate the kind of effort this required to go to waste when PhDs sucks the life out of your for 6-8 years (at least in the US.)

Has anybody checked out [<a href="http://www.ioccc.org/2001/herrmann1.hint" rel="nofollow">http://www.ioccc.org/2001/herrmann1.hint</a>