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)))

Respuesta :

Answer:

Please find the attachment for the Conversion To Postfix solution:

Explanation:

The solution can be defined as follows:

for question 1: [tex]x y\^ \ 5 z * / 2 +[/tex]

for question 2:[tex]A B C * + D +[/tex]

for question 3: [tex]A B + C D + *[/tex]

for question 4: [tex]A B * C D * +[/tex]

for question 5: [tex]A B + C + D +[/tex]

for question 6: [tex]4 3 6 3 * 12 - * +[/tex]

for question 7:[tex]A B + C - E F / G H J / *[/tex]

for question 8: [tex]4 3 6 + / 59 +[/tex]

for question 9: [tex]A B + C * D E F G * + H / +[/tex]

for question 10: [tex]A B C D * - E / + F + G H / -[/tex]

for question 11: [tex]A B * C + D / E F G + / -[/tex]

for question 12: [tex]A B - C D E F / + G - H * -[/tex]

for question 13:[tex]A B + C D * E F G / - / -[/tex]

for question 14: [tex]A B * C / D E + F G H / * - +[/tex]

similarly, we solve all queries.

Ver imagen codiepienagoya
Ver imagen codiepienagoya
Ver imagen codiepienagoya
Ver imagen codiepienagoya
Ver imagen codiepienagoya