Expression Evaluation Program Using Stacks JAVA PROGRAMMING

Expression Evaluation Program Using Stacks, write a program that accepts input from the console, and converts an infix expression to a postfix expression. Postfix is also known as Reverse Polish Notation. For example, the program should convert the infix expression;

Infix postfix

Expression Expression

Example #1: ( 1 + 2 ) * 3 ------- 1 2 + 3 *

Example #2: 2 * ( 1 + 3 ) ------- 2 1 3 + *

The valid operators are { +, -, *, and / } . Your program should have a method called EvaluateExpression() which will also evaluate the expression and produce a result.

Test your program with the following expressions;

17 + ( 2 * 7) 6

22 / 2 + (3 * 8)

13 + ( 19 10) / 3