Voice of the PPL

After some really hard thinking (ouch it hurts), I finally found a nice way to simplify the interpreter internals and to speed up the execution speed. I don’t have any benchmarks yet but it should be noticeable at the very least.

As an example, a 89 opcodes test code turns out to be 66 opcodes in length. So we get better speed and smaller bytecode files.

As a nice surprise, there is a new function called PushList() in PPL that pushes each element of a list to the stack. As an example check the following:

func Test:3
list(l$);
Add(10, 20, 30);
return(PushList(l$));
end;

This can prove to be very useful in some cases. There are many uses for such a function too. I hope you will appreciate (I am sure you are) all the hard work I am putting into PPL 2.