Package evaler implements a simple fp arithmetic expression evaluator.

Evaler uses Dijkstra's Shunting Yard algorithm [1] to convert an infix expression to postfix/RPN format [2], then evaluates the RPN expression. The implementation is adapted from a Java implementation at [3].

This is release 1.0.

result, err := evaler.Eval("1+2")

The operators supported are:

+ - * / ** () < >

< (less than) and > (greater than) will get lowest precedence, all other precedence is as expected (BODMAS [4]).

< and > tests will evaluate to 0.0 for false and 1.0 for true, allowing expressions like:

3 * (1 < 2) # returns 3.0
3 * (1 > 2) # returns 0.0

Sonia Hamilton

http://www.snowfrog.net

[email protected]

[1] http://en.wikipedia.org/wiki/Shunting-yard_algorithm

[2] http://en.wikipedia.org/wiki/Reverse_Polish_notation

[3] http://willcode4beer.com/design.jsp?set=evalInfix

[4] http://www.mathsisfun.com/operation-order-bodmas.html