This program will combine string manipulation, classes, and stacks. Using the stack class, write a program that evaluates an expression written in postfix notation. By definition to process postfix notation every time you reach an operator you perform that operation on the 2 previous operands. so: start processing your input string. If it is an operand push it into the stack. If it is an operator pop the last 2 items in the stack. Perform the operation and push the results into the stack. example 53+4/6* push 5 push 3 read + pop 3 pop 5 3+5=8 push 8 puch 4 read / pop 4 pop 8 8/4=2 push 2 push 6 read * pop 6 pop 2 6*2=12 push 12 read blank pop answer
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased.