Implement a program that can input an expression in postfix notation (see Exercise C-5.8) and output its

Question:

Implement a program that can input an expression in postfix notation (see Exercise C-5.8) and output its value.


Data from in Exercise C-5.8

Postfix notation is an unambiguous way of writing an arithmetic expression without parentheses. It is defined so that if “(exp1) ◦ (exp2)” is a normal fully parenthesized expression whose operation is “◦”, then the postfix version of this is “pexp1 pexp2◦”, where pexp1 is the postfix version of expand 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 “((5+2) ∗ (8−3))/4” is “5 2 + 8 3 − ∗ 4 /”. Describe a non recursive way of evaluating an expression in postfix notation.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Data Structures And Algorithms In C++

ISBN: 9780470383278

2nd Edition

Authors: Michael T. Goodrich, Roberto Tamassia, David M. Mount

Question Posted: