SimpleParser

... is a simple parser for resolving mathematical terms.

The term is parsed by generating a binary expression tree using the Shunting-Yard algorithm. The implementation itself does not use any external libraries and relies fully on the features provided by the C++ language and the standard library.

Current features:

• Calculating terms with basic operators while respecting the priority of each operator
• Support for parentheses
• Support for alphabetic constants
• Export of the expression tree as Graphviz dot for visualization

Requirements:

• C++ compiler with support for C++14
• GoogleTest for tests