Question

Given that A, B, C, and D are operands; and *, +, and - are operators Use Step 3 of the Reverse Polish Notation algorithm to convert the following postfix expression to infix expression:

A B + C D - *

Show your working.

Answer 1

ALGORITHM 9 2 1. While there are imput syssebous present read the next symbol from the input 2. If symbol ú an operand (A, B7) Push it into stack. 3. eluse if symbol is an operator pop the top 2 values from stack Put the operator within these values & form a string Push this string back to stack of these ů only one value in the stack That value is the desired infix stang 4. POSTPIX: А B + TE A Push into stack TAL B - Push more wack B А fa & Pop 2 elements At BPI A+B ste → Push into stack ATB Dy Push into stack D A+B

Page No. Date: 1 Pop a elements A+B * Pop elements (A + 8)* [C-DJ y ens 1(A+B)# CC-03) - only one element in the stack