Well, this was certainly a strange project. For a long time, I’ve been wanting to build some kind of interpreter using Coda and CFL. Not sure why, just had an itch. I had a project going with a pack to emulate the Apollo Guidance Computer, but that kind of felt like cheating… everything was being done thru TypeScript rather than pure CFL. Also turns out emulating an entire machine is kind of hard? (who would’ve thought?). Where better to turn for such a project than, err… Brainfart. I’m sure you can figure out what esoteric language this interpreter is for.
A special thanks to Coda buttons for their imperative behavior. This probably would not have been possible in CFL without them.
Christoph Böhmwalder’s sample is preloaded into the interpreter. Just click “Run Steps” and watch it go! If you want to write your own code, simply clear the “Program” row in the State table, write your code, click “Load Program”, and thanks to a neat recursion trick taught to me by @Rickard_Abraham , your program will finish to execution without needing to manually input your amount of steps. SImply hit “Run”!
NOTE that this interpreter is limited to 256 memory cells (wanted to keep it relatively simple) and that I forgot to implement line break support (<- stupid). Will be done soon.