Hey /prog/

improve my virtual machine

git clone https://code.google.com/p/gpvm/

Forgive my lack of documentation. This will be remidied shortly. Also, some instructions remain unimplemented, as I haven't found a use for them yet.

Also, note the absolute lack of references (int &a = b). Haskell has created the idea in my head they are not needed, but I can see them being useful and I will almost undoubtedly implement them at some point.

I look forward to sorting through your abuse to see if anyone says anything constructive.

>>93
Because he's (I hope) a troll. No way could someone code that badly that it runs out of memory after 28 Fibonacci numbers unless they malloc(100000000) for each integer, even with ``memory leaks''. No way could someone take 48 seconds to calculate the first 30 numbers in the Fibonacci sequence unless they added sleep(1) for each level of recursion. These are 32-bit integers, not bignums.
>>40
Yesterday, it would run for 1:3x then be killed due to excessive memory usage (It leaked, which is now fixed), and would usually make it to about the 28th number in the sequence.
For reference: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811
What machine are you running this interpreter on? Hopefully it's something like a Commodore 64, but even an interpreter written in C64 BASIC would be faster than this VM.
Also, IHBT.