java.math.expression.parser is a maven project that let you parse math expressions.

This algorithm does not use a decision tree. It is a recursive algorithm.

This algorithm is faster than JEP math expresion parser!!! If you compare java.math.expression.parse and JEP, this algorithm only need 25% of the time to parse the same expression as JEP.

Here you can see an example:

    String f_xs = " 2*(-(((z*3)*sqrt(x^(2)))+3))";
    
    final Point xo = new Point("x", new Double(2));
    final Point zo = new Point("z", new Double(1));

    double result = Parser.Eval(f_xs, xo, zo);

In the test package you can see more examples.

This version is compiled for Java 1.6

Enjoy it!!