Postfix notation is an unambiguous way of writing an arithmetic expression without paren-theses. It is defined so that if \(exp1) op (exp2)" is a normal fully parenthesised expression whose operation is op, then the postfix version of this is \pexp1 pexp2 op", where pexp1 is the postfix version of exp1 and pexp2 is the postfix version of exp2.
The postfix version of a single number or variable is just that number or variable. So, for example, the postfix version of the fully parenthesized expression
(((5 - 1) * (8 - 3)) / 4) is 5 2 + 8 3 - * 4 /
Describe an algorithm
(a) for converting a fully parenthesized expression into its corresponding postfix notation.
(b) evaluating an expression in postfix notation.