Study Abroad Education Loan College News Placement Book Shops E - Books Engg-Admission Edu-Classifieds Students-Forum
Easy Studies
 « NS2  Projects »

Home Conversion Of Infix Expression To Postfix Expression▼

## Conversion Of Infix Expression To Postfix Expression:

Infix Expression:

Notation in which the operator separates its operands. Eg (a + b) * c. Infix notation requires the use of brackets to specify the order of evaluation.

Postfix Expression:

Reverse Polish Notation or Suffix Notation in which the operator follows its operands. Eg a + b * c represented as abc*+.

Algorithm steps:

1. Scan the Infix string from left to right.
2. Initialize an empty stack.
3. If the scanned character is an operand, add it to the Postfix string. If the scanned character is an operator and if the stack is empty push the character to stack.
4. If the scanned character is an Operator and the stack is not empty, compare the precedence of the character with the element on top of the stack (top Stack). If top Stack has higher precedence over the scanned character pop the stack else push the scanned character to stack. Repeat this step as long as stack is not empty and top Stack has precedence over the character.

5. Repeat this step till all the characters are scanned.
6. After all characters are scanned, we have to add any character that the stack may have to the Postfix string. If stack is not empty add top Stack to Postfix string and Pop the stack. Repeat this step as long as stack is not empty.

C Program To Convert Infix Expression To Postfix Expression

⇓ Student Projects ⇓
⇑ Student Projects ⇑