How can you use stack to convert an infix expression to postfix? Convert infix expression (A + B)*(C – D) to postfix using stack.

Question

How can you use stack to convert an infix expression to postfix? Convert infix expression (A + B)*(C &#8211; D) to postfix using stack.

Suresh Chand · Accepted Answer

Algorithm to convert infix to postfix expression using stack is given below: Scan the infix string from left to right. Initialize an empty stack. If the scanned character is an operand, add it to postfix sting If the scanned character is an operator, PUSH the character to stack. If the top operator in stack has equal or higher precedence than scanned operator then POP the operator present in stack and add it to postfix string else PUSH the scanned character to stack. If the scanned character is a left parenthesis ‘(‘, PUSH it to stack. If the scanned character is a right parenthesis ‘)’, POP and add to postfix string from stack until an ‘(‘ is encountered. Ignore both '(' and ')'. Repeat step 3-7 till all the characters are scanned. After all character are scanned POP the characters and add to postfix string from the stack until it is not empty. Given, Infix expression = (A + B)*(C - D) Converting to postfix: Characters stack Postfix expression ( (   A ( A + (+ A B (+ AB )   AB+ * * AB+ ( *( AB+ C *( AB+C - *(- AB+C D *(- AB+CD ) * AB+CD-     AB+CD-* Postfix expression of given infix is A B + C D - *

How can you use stack to convert an infix expression to postfix? Convert infix expression (A + B)*(C – D) to postfix using stack.

Leave your Answer:

Hits Counter

Question

How can you use stack to convert an infix expression to postfix? Convert infix expression (A + B)*(C – D) to postfix using stack.

Leave your Answer: