By not cloning code for recursion directly into the processing
buffer and by not copying as many strings and by not doing
string->int conversions all the time, it's significantly faster.
Specifically, it's about 5.5x slower than Python.
The idea I have is that I'll translate/compile JavaScript
into a rudimentary Forth like language. This sketch forms
the basis for that language's engine.
