RuiLoureiro,
just for personal interest: how do you store the parsed expressions? As tree?
regards
Hi qWord,
i store parsed expressions in tables one after another. The length of
each line is a constante (2^N). It is saved from top to bottom
and removed from bottom to top (it is like push, push, push and pop, pop, pop).
In some cases i store the function itself to be solved later. So
i have one table for derivatives and another for functions.
I have one table of basic functions (Fnc1, Fnc2,...,FncN) and tables
of basic derivatives (Drv1,Drv2,...,DrvN): for argument X, for -X, 1/X, ...
The first step is to solve functions. The last is to solve something
like 1+x-x^2+x^-5+e^x, etc. (expressions without brackets).
Could you post an expression to be solved ?
Thanks
regards :t