A C++-based expression tree solution to an arithmetic parser
A C++-based expression tree solution to an arithmetic parser.
Goal: To create and evaluate an arithmetic parser without use of Shunting Yard algorithm.
Solution: Implement object-oriented-heavy approach using Composite, Interpreter, Builder, Visitor, and Fascade design patterns.
perhaps consolidate the expression and builder composites
arithmetic_calculator.cpp [expression]
or use loop when run w/o any c-line args.
Only acceptable input for expression is * + ( ) [0-9]+
max 9999 per literal, all else is undefined.