Problem Statement - 03E
Convert the following Infix expression to its equivalent Postfix expression, showing the stack contents for each step of conversion.
P/(QR)*S+T
Solution
P/(QR) * S+T = (P / (QR) * S + T)
Element |
Stack of Operators |
Postfix Expression |
( |
( |
|
P |
( |
P |
/ |
(/ |
P |
( |
(/( |
P |
Q |
(/( |
PQ |
– |
(/(- |
PQ |
R |
(/(- |
PQR |
) |
(/ |
PQR- |
* |
(* |
PQR-/ |
S |
(* |
PQR-/S |
+ |
(+ |
PQR-/S* |
T |
(+ |
PQR-/S*T |
) |
|
PQR-/S*T+ |
= PQR/S*T+
OR
P/(QR)*S+T = (((P / (QR))* S) + T)
Element |
Stack of Operators |
Postfix Expression |
( |
|
|
( |
|
|
( |
|
|
P |
|
P |
/ |
/ |
|
( |
|
|
Q |
( |
PQ |
– |
/- |
|
R |
|
PQR |
) |
/ |
PQR- |
) |
/ |
PQR- |
) |
|
PQR-/ |
* |
* |
|
S |
|
PQR-/S |
) |
|
PQR-/S* |
+ |
+ |
|
T |
|
PQR-/S*T |
) |
|
PQR-/S*T+ |
= PQR/S*T+
OR
Any other method for converting the given infix expression to its equivalent postfix expression showing stack contents.
CSKC| Created: 1-Jan-2019 | Updated: 25-Feb-2019|CBSE12A-2016
Post Views:
706