In this project, you will implement a calculator that evaluates mathematical expressions.
Mathematical expressions are normally written in infix notation. With infix notation, operators are inserted between operands, e.g., 5 + 9; with postfix notation, however, operators are written after the operands, e.g., 5 9 +. Calculators use postfix notation to evaluate a mathematical expression.
Your task is to evaluate an expression given in infix notation. First, you must validate it for unbalanced parentheses and invalid characters. Next, you must translate the infix expression to postfix notation. Lastly, you must evaluate the postfix expression.
One of the purposes of this project is to learn how to use stacks. Stacks will be used in three places: checking the expression for unbalanced parentheses, converting infix notation to postfix notation, and evaluating the postfix expression. You may create your own Stack Class You may not use the stack class in the C++ Standard Template Library (STL).
The project is described in Programming Project [login to view URL] which is attached
Hello,
I am a C++ engineer and also used to teach C++ to engineers in large companies; and now, I teach students up to PhD level.
Can I be of assitance?
I am sr software engineer with experience in c++ and C , I have great knowledge of Automata , infix and postfix expressions , I can develop the calculator . I assure you 100% completion of the requirements.