Objective: Write a program that will take a string, parse it, and then calculate the value in post-fix (reverse polish) notation.
To understand this mostly every expression you've seen in math is called in-fix notation. In-fix Example: 3 + 2 However in post-fix notation the operator is at the end of the expression.
Post-fix Example: 3 2 + A stack is used to calculate values in post-fix notation. Numbers are pushed onto the stack, and when an operator is reached it pops off the last two numbers and then pushes the resulting value back on the stack.