Advertisements
Advertisements
प्रश्न
Convert the following infix notations to postfix notations, showing stack and string contents at following step.
A * ((C + D)/E)
संक्षेप में उत्तर
उत्तर
Infix Expression is : A * ((C + D)/E)
Scanning from Left to Right
| Symbol | Action | Stack, Initially Stack is Empty [ ] | Postfix Expressions |
| A | Append to Postfix Expression | [ ] | A |
| * | PUSH ‘*’ | * | A |
| ( | PUSH ‘(‘ | * ( | A |
| ( | PUSH ‘(‘ | * ( ( – | A |
| C | Append to Postfix Expression | -* ( ( | A C |
| + | PUSH ‘+’ | – * ( ( + | A C |
| D | Append to Postfix Expression | – * ( ( + | A C D |
| ) | POP till one opening bracket is popped, add popped operator to expression | – * ( | A C D + |
| / | PUSH ‘/’ | – * ( / | A C D + |
| E | Append to Postfix Expression | – * ( / | A C D + E |
| ) | POP till one opening bracket is popped, add popped operator to expression | – * | A C D + E / |
| End of Expression | POP all and add to Postfix Expression | [ ] | A C D + E / * – |
shaalaa.com
Conversion from Infix to Postfix Notation
क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
APPEARS IN
संबंधित प्रश्न
Convert (6+4)*7-(8*9) into postfix.
An algorithm is implemented to find if a sequence of parentheses in ((()(())(())) is balanced. What would be the max number of parentheses that can appear on the stack at any one time?
In infix to postfix conversion algorithm, the operators are associated from:
Convert (x+y)/(z*8) into postfix expression.
Postfix expression xyz+qr/*- when converted to infix will look like:
Convert the following infix notations to postfix notations, showing stack and string contents at following step.
A + B - C * D
