Expression Parser is an algebraic expression parser. The parser takes an input string expression and an input map of terms to parse & construct an expression tree for evaluation. The expression is parsed with recursive std::regex evaluations and the expression tree is constructed with std::shared_ptr polymorphic nodes that represent various mathematical objects (constants, variables, matrices, tensors, operations, functions, etc.)
Built on Ubuntu 20.04.1 LTS compiled with GCC 9.3.0.
To build "AWSExpressionParser", "Examples", and "Tests":
mkdir build && cd build
cmake -DBUILD_EXAMPLES=ON -DBUILD_TESTS=ON .. && make
To run the examples:
cd Examples/MatrixExample && ./MatrixExample
cd Examples/GaussianExample && ./GaussianExample
cd Examples/SimplifyExample && ./SimplifyExample