An HPPL compiler question...

[cyrille de brébisson]

Hello,

Nope, not that complex.
PPL programs are transformed into a tree representation of the program/expressions, with a program being a list of user functions, user functions being themselves lists of expressions or objects (like lists numbers, matrices...), expression having a standard tree structure.

The execution of a program is the sequential execution of these lists and expression trees.

The code is non-recursive (even if the program is), to allow deep recursive program execution (like a factorial).

It is not very memory efficient, but it is quite fast and relatively simple to implement.

Cyrille