Go to the first, previous, next, last section, table of contents.
These routines implement the semantics associated with syntactic elements.
Nested If-then-else statements are handled by a branch stack that tracks the latest goto. When the destination address is found, the address of the goto is popped of the stack, and the goto operation is patched to point to the correct destination. Data structure utilities for rule based model.
John Carter - June 1995 Interpreter for ecosystem rule based model.
Expressions are evaluate on a stack of doubles, (id "stack"), which is implemented here as a libtree Vector. If this program ever needs a burst of speed, one can just implement this as a largish array, (say 200), of double and a pointer to double. In theory if the program is working you don't need even to check bounds on the stack.
Define PALLOCING if you are using palloc.
Go to the first, previous, next, last section, table of contents.