search

jipuwang / FunctionApproximator

This project focuses on approximating given functions with simpler ones (e.g. polynomials) and quantitatively characterizes the errors introduced thereby.
Apache License 2.0
0 stars 0 forks source link

Math Expression Parser #1

Open jipuwang opened 8 years ago

jipuwang commented 8 years ago

The first thing we need is to generate a math expression parser. Third party libraries (e.g. ExprTk) are welcome. However, a native parser is a nice-to-have even being less powerful. At least it should be able to handle functions like exponential and sine function.

The unit test on this will include two tests one being f(x)=Exp[x], and the other being f(x)=Sin[x]. UnitTest++ is suggested for managing the tests.

Definition of Resolution of this Issue is: Passing these two unit tests.

jipuwang commented 8 years ago

Reference pages: http://stackoverflow.com/questions/114586/smart-design-of-a-math-parser https://fastmathparser.codeplex.com/ http://partow.net/programming/exprtk/index.html

ArashPartow commented 7 years ago

@jipuwang If ExprTk is more than what you need there are simple and smaller alternatives, a more detailed listing can be found here:

https://github.com/ArashPartow/math-parser-benchmark-project