program to convert infinix to postfix using stack

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…

Draw a diagram of the runtime stack when function A has just been called. For each frame, show the static and dynamic links. Output the program prints: 8, 4, 2, 3

Use the C++ Standard Template Library's stack class to write a program for processing a file of postfix expressions. Recall that in a postfix expression, a binary operator comes after its two operands. Thus the infix expression (w + x) * (y – z) becomes w x + y z * in postfix. A postfix expression can be efficiently evaluated using a stack as follows. 1. Read the expression from the left to the right. 2. When an operand is encountered, push it on the stack. 3. When an operator is encountered, pop the top two elements from the stack, perform the operation, and then push the result. 4. There should be exactly one element on the stack at the end and this element is the value of the expression. For example, if the expression 20 5 – 3 * is entered, the evaluation should proceed as follows. Symbol read 20 Actions taken Push 20 5 Push 5 Pop 5, Pop 20, Push 20 – 5 Push 3 Pop 3, Pop 15, Push 15 * 3 The result of 45 should then be output. Your program should ask the user for the name of an input…