Reference no: EM133116064

Instruction

(Infix to Postfix) Write a program that converts an infix expression into an equivalent postfix expression. The rules to convert an infix expression into an equivalent postfix expression are as follows:

Suppose inf x represents the infix expression and pf x represents the postfix expression. The rules to convert int x into pf x are as follows:
1. Initialize pf x to an empty expression and also initialize the stack.
2. Get the next symbol. sym . from inf x .
• If sym is an operand. append sym to pf x .
• If sym is (. push sym into the stack.
• If sym is ). pop and append all of the symbols from the stack until the most recent left parentheses. Pop and discard the left parentheses.
• If sym is an operator:
• Pop and append all of the operators from the stack to pf x that are above the most recent left parentheses and have precedence greater than or equal to sym
• Push sym onto the stack.

Attachment:- infix expression.zip