Question: Write a java code to implement the infix to postfix algorithm as described below: Algorithm convertToPostfix(infix) Converts an infix expression to an equivalent postfix expression
Write a java code to implement the infix to postfix algorithm as described below:

Algorithm convertToPostfix(infix) Converts an infix expression to an equivalent postfix expression operatorStack a new empty stack postfix-a new empty string while (infix has characters left to parse) nextCharacter next nonblank character of infix switch (nextCharacter case variable: Append nextCharacter to postfix break case 'A. operatorStack.push(nextCharacter) break case "+' : case "-' : case ' : case '/" : while CloperatorStack.isEmpty and precedence of nextCharacter precedence of operatorStack.peek O) Append operatorStack.peek O to postfix operatorStack.pop operatorStack.push(nextCharacter) break case': operatorStack.push (nextCharacter) break case' 1/ Stack is not empty if infix expression is valid topOperator operatorStack.popO while (topOperatorC Append topOperator to postfix topOperator operatorStack.popO break default: break // Ignore unexpected characters while CloperatorStack.isEmptyO) topOperator operatorStack.pop O Append topOperator to postfix return postfix
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
