Scribd
Upload
18 views1 page

Infix To Postfix Algo

The document outlines an algorithm for converting infix expressions to postfix notation. It involves using a stack to manage operators and parentheses while scanning the expression. The algorithm systematically processes operands, operators, and parentheses to produce the equivalent postfix expression.

Uploaded by

yegom47911
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views1 page

Infix To Postfix Algo

The document outlines an algorithm for converting infix expressions to postfix notation. It involves using a stack to manage operators and parentheses while scanning the expression. The algorithm systematically processes operands, operators, and parentheses to produce the equivalent postfix expression.

Uploaded by

yegom47911
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Algorithm to convert Infix To Postfix

Let, X is an arithmetic expression written in infix notation.


This algorithm finds the equivalent postfix expression Y.
1. Push “(“onto Stack, and add “)” to the end of X.
2. Scan X from left to right and repeat Step 3 to 6 for each
element of X until the Stack is empty.
3. If an operand is encountered, add it to Y.
4. If a left parenthesis is encountered, push it onto Stack.
5. If an operator is encountered ,then:
1. Repeatedly pop from Stack and add to Y each
operator (on the top of Stack) which has the same
precedence as or higher precedence than operator.
2. Add operator to Stack.
[End of If]
6. If a right parenthesis is encountered ,then:
1. Repeatedly pop from Stack and add to Y each
operator (on the top of Stack) until a left parenthesis
is encountered.
2. Remove the left Parenthesis.
[End of If]
[End of If]
7. END.

You might also like