Write a java program using Stack to convert the infix notation to postfix. Your program will ask user to input the infix notation and will print out the equivalent postfix notation. Following are the algorithmic steps to convert infix to postfix: 1) When an operand is read, it is immediately placed onto the output. 2) Operators and ( are not immediately output, so they must be saved on to the stack. 3) If we see a ), then we pop the stack, writing symbols until we encounter a (corresponding) (, which is popped but not output. 4) If we see any other symbol +, *, (, then we pop entries from the stack until we find an entry of lower priority. One exception is that we never remove a (from the stack except when processing a ). For the purposes of this operation, + has lowest priority and (highest. 5) When the popping is done, we push the operator onto the stack. 6) Finally, if we read the end of input, we pop the stack until it is empty, writing symbols onto the output.
Write a java program using Stack to convert the infix notation to postfix. Your program will ask user to input the infix notation and will print out the equivalent postfix notation. Following are the algorithmic steps to convert infix to postfix: 1) When an operand is read, it is immediately placed onto the output. 2) Operators and ( are not immediately output, so they must be saved on to the stack. 3) If we see a ), then we pop the stack, writing symbols until we encounter a (corresponding) (, which is popped but not output. 4) If we see any other symbol +, *, (, then we pop entries from the stack until we find an entry of lower priority. One exception is that we never remove a (from the stack except when processing a ). For the purposes of this operation, + has lowest priority and (highest. 5) When the popping is done, we push the operator onto the stack. 6) Finally, if we read the end of input, we pop the stack until it is empty, writing symbols onto the output.
Related questions
Question
Transcribed Image Text:Write a java program using Stack to convert the infix notation to postfix. Your program will ask
user to input the infix notation and will print out the equivalent postfix notation.
Following are the algorithmic steps to convert infix to postfix:
1) When an operand is read, it is immediately placed onto the output.
2) Operators and ( are not immediately output, so they must be saved on to the stack.
3) If we see a ), then we pop the stack, writing symbols until we encounter a
(corresponding) (, which is popped but not output.
4) If we see any other symbol +, *, (, then we pop entries from the stack until we find an
entry of lower priority. One exception is that we never remove a (from the stack
except when processing a ). For the purposes of this operation, + has lowest priority
and (highest.
5) When the popping is done, we push the operator onto the stack.
6)
Finally, if we read the end of input, we pop the stack until it is empty, writing symbols
onto the
output.
Note: You must use your own implementation of Stack (Array or LinkedList implementation).
Do not use the Java libraries (java.util.Stack)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 2 images
