Previous slide Next slide Back to the first slide View text version


Notes:

Our implementation platform was the IP Transformation System. IP offered an excellent background for this project since it is easily extendible and can relieve the generator programmer from many low-level obligations (parsing, program representation, error reporting etc.).

In IP we can handle code using tree primitives. Consider the analogy with the LISP language where we handle code fragments as lists. The first member of the list is the operator of a functional expression and the following members are its operands. In IP expressions are handled as syntax trees: the root of a tree is the operator of the expression it represents. Similarly, the subtrees of the root are its operand expressions.