Postfix notation is an unambiguous way of writing an arithmetic expression witho

Question

Postfix notation is an unambiguous way of writing an arithmetic expression without parenthesis.It is defined so that if (exp 1) op (exp 2) is normally fully parenthesized 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 vesrion of a single number or variable is just that number or variable. So,for example,the postfix version of "((5+2)*(8-3))/4" is "5 2 + 8 3 - *4.Describe a non - recursive way of evaluating an expression in postfix notation.

Explanation / Answer

1. Tokenize the expression into numbers and operators.

2. Iterate though the tokens in order. If it is a number, push it onto a stack. If it is an operator, pop 2 operands off the stack, and push the result onto the stack.

3. The answer is the only number on the stack after evaluating the entire expression.

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.