According to Orlando Llanes:
What I'm working on learning now is breaking down an AlgabraicEquation (did I get the right term?) and arranging it so that it's in an order ready to be translated into the byte codes. I think this step is called converting Postfix to Infix. I saw some code in Pascal that parses an equation and translates it by using loops and arrays rather than recursing. What it does is juggle variable names, I don't know how capable it is for processing real numbers or others. It only handles * / + and - but it can be modified to handle Boolean operations, etc. I got the code out of the Pascal SWAG. I'll upload the code where Peter moved Hans' upload.
Now the trouble begins: Is this program another candidate for that archive of tools? While it compiled straightforwardly with GPC, it is less general than a Pascal `lex' or `yacc', and it is in the SWAG.
What are the licensing conditions of that Program?
Peter -- Peter Gerwinski, Essen, Germany, free physicist and programmer Maintainer GNU Pascal - http://home.pages.de/~GNU-Pascal/ - 1 Oct 1997 PGP key fingerprint: AC 6C 94 45 BE 28 A4 96 0E CC E9 12 47 25 82 75 Fight the SPAM! - http://maps.vix.com/