Dynamic functions

[Poul-Erik Andreasen <poulerik@pea.dk>]

How is the best way to make a representation of a
function/algorithm wich can bee setup at runtime in Ada.

Let say i have for instans a function/algorithm looking like this

F(x,y,z) = (3x+25**y)/z

This will ofcource require a parser to do the setup, that I can handle.
But what will bee the best structure for such generalised function.

I am thinking about some base functions and a tree struture with some
access to function variables. Anyone with a better idea?

Due to peformance consideration i cannot let the parser calculate the 
result imidialty.

Any hints will bee very appreciated


Poul-Erik Andreasen