This little function checks a (finite) Brainfuck string for validity. It check\'s whether the [ and ] are balanced. The code is very straightforward and written to be tail-recursive:
For the uninitiated, Brainfuck is a Turing-complete language with only 8 commands, all of which have literal equivalents in C:
Stay Vs 走李伟菘伤心李伟菘开发者_开发百科 -《Stay Vs 走》作曲：李伟菘作词：黄伟文编曲：黄铭源要是留下惹人讨厌 勇往直前不必眷恋要是回望我便心软 勇往直前不可气短回头望其实待我不算过分亲厚只得我不遗余力日
I\'ve been looking around for a way to anti-alias lines in OpenGL, but none of them seem to work... here\'s some example code:
I want to build a Brainfuck (Damn that name) interpreter in my freshly created programming language to prove it\'s turing-completeness.
I got into an argument over on SuperUser.com about useless answers and found myself challenging the other poster to answer the question in brainfuck.He didn\'t take me up on it, but now I\'m curious.
加载中,请稍侯......