Conversion To Postfix EXAMPLE: A+(B*C-(D/E-F)*G)*H
Stack Input Output
Empty A+(B*C-(D/E-F)*G)*H -
Empty +(B*C-(D/E-F)*G)*H A
+ (B*C-(D/E-F)*G)*H A
+ ( B*C-(D/E-F)*G)*H A
+ (*C-(D/E-F)*G)*H AB
+ (* C-(D/E-F)*G)*H AB
+ (* -(D/E-F)*G)*H ABC
+ (-(D/E-F)*G)*H ABC*
+ (-(D/E-F)*G)*H ABC*
+ (-(/E-F)*G)*H ABC*D
+ (-(/E-F)*G)*H ABC*D
+ (-(/-F)*G)*H ABC*DE
+ (-(- F)*G)*H ABC*DE/
+ (-(- F)*G)*H ABC*DE/
+ (-(-)*G)*H ABC*DE/F
+ (- *G)*H ABC*DE/F-
+ (-*G)*H ABC*DE/F-
+ (-* )*H ABC*DE/F-G
+ *H ABC*DE/F-G*-
+* H ABC*DE/F-G*-
+* End ABC*DE/F-G*-H
Empty End ABC*DE/F-G*-H*+
Convert the following Infix Expression to Postfix, Using the above sample solution
The infix expression. x^y/(5*z)+2
A + B * C + D
(A + B) * (C + D)
A * B + C * D
A + B + C + D
6. 4 + 3 * (6 * 3 - 12)
7. (A + B - C) * (E / F) – (G – H / J)
8. 4 / (3 + 6) + 59
9. (A + B) * C + D / (E + F * G) – H
10. A + ((B - C * D) / E ) + F - G / H
11. (A * B + C) / D - E / (F + G)
12. A - B - C * (D + E / F - G) – H
13. (A + B) - C * D / (E - F / G)
14. A * B / C + (D + E - (F * (G / H)))