From: | Andreas Kochenburger <akk@privat.de> |
Newsgroups: | comp.compilers |
Date: | 13 Nov 2006 16:29:37 -0500 |
Organization: | Arcor |
References: | 06-11-052 |
Keywords: | interpreter, forth |
Posted-Date: | 13 Nov 2006 16:29:37 EST |
PAolo schrieb:
> I am writing a piece of software that accept in input the definition
> of a mathematical function and a list of points in which evaluate the
> function and puts the result in output. The main feature of the progam
> is that once the function definition is read, the program evaluates
> the function very fast [Well this isn't done already...]. I was
> thinking to build a pair of stacks, one containig the operands
> (floats) and the other containig the operators (function pointers).
Don't reinvent Forth. Have also look at Noble's Formula Translator:
http://galileo.phys.virginia.edu/classes/551.jvn.fall01/programs.htm
Try it with modern fast Forths like SwiftForth, VFX or the free
Win32Forth. Their code efficiency is in the range of Assembler!
Andreas
Return to the
comp.compilers page.
Search the
comp.compilers archives again.