Equation (expression) parser with precedence?

Question

I\'ve developed an equation parser using a simple stack algorithm that will handle binary (+, -, |, &, *, /, etc) operators, unary (!) operators, and parenthesis.

<

Answer 1

http://www.engr.mun.ca/~theo/Misc/exp_parsing.htm

Very good explanation of different approaches:

• Recursive-descent recognition
• The shunting yard algorithm
• The classic solution
• Precedence climbing

Written in simple language and pseudo-code.

I like 'precedence climbing' one.