Past exam question: 2074 Bhadra (Regular), Q2
Open in the Padhaiko appQuestion
Convert A + B - C * (D - E + F/G) / H expression into postfix expression using stack.
Solution
Precedence and Associativity Rules:
*,/: higher precedence, left-associative.+,-: lower precedence, left-associative.- Parentheses
(...)override precedence.
Tabular Stack Trace:
| Symbol | Stack (Bottom Top) | Postfix Output | Action |
|---|---|---|---|
A | (empty) | A | Append A |
+ | + | A | Push + |
B | + | A B | Append B |
- | - | A B + | Pop + (equal prec), push - |
C | - | A B + C | Append C |
* | - * | A B + C | Push * |
( | - * ( | A B + C | Push ( |
D | - * ( | A B + C D | Append D |
- | - * ( - | A B + C D | Push - |
E | - * ( - | A B + C D E | Append E |
+ | - * ( + | A B + C D E - | Pop - (equal prec), push + |
F | - * ( + | A B + C D E - F | Append F |
/ | - * ( + / | A B + C D E - F | Push / |
G | - * ( + / | A B + C D E - F G | Append G |
) | - * | A B + C D E - F G / + | Pop /, +, discard ( |
/ | - / | A B + C D E - F G / + * | Pop * (equal prec), push / |
H | - / | A B + C D E - F G / + * H | Append H |
| (end) | (empty) | A B + C D E - F G / + * H / - | Pop /, - |
Answer:
Converted postfix expression:
(AB+CDE-FG/+*H/-).