From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: 103376,53a571639ed0bc5a,start
X-Google-Attributes: gid103376,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news3.google.com!proxad.net!feeder1-2.proxad.net!news.tele.dk!news.tele.dk!small.news.tele.dk!feed118.news.tele.dk!not-for-mail
Date: Thu, 09 Aug 2007 18:06:23 +0200
From: Poul-Erik Andreasen <poulerik@pea.dk>
User-Agent: Icedove 1.5.0.12 (X11/20070607)
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Dynamic functions
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Message-ID: <46bb3919$0$19890$edfadb0f@dread11.news.tele.dk>
Organization: TDC Totalloesninger
NNTP-Posting-Host: 80.166.145.174
X-Trace: 1186674969 dread11.news.tele.dk 19890 80.166.145.174:61163
X-Complaints-To: abuse@post.tele.dk
Xref: g2news2.google.com comp.lang.ada:1379
Date: 2007-08-09T18:06:23+02:00
List-Id: <comp.lang.ada>


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