Parse mathematic expression to tree then RPN

Hi:


    I am hand writing a library to parse mathematic expression
such as


    Z = sin(A + B) + 33 * tan(C) + sqrt(D)


Converting this expression to tree would take a lots of backtracking
and consideration. Once it is stored in tree, using deep-first
travesal, RPN expression can be created very easily.


Could someone provides me information or resources to convert the
expression to tree format?


Thank you very much
Hor Meng
[Parsing an expression is the first example in just about every
compiler text. You can use a simple operator precedence parser
to parse it with no backtracking and to create RPN in one pass. -John]

Return to the comp.compilers page.
Search the comp.compilers archives again.