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
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 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 “((5+2) ∗ (8−3))/4” is “5 2 + 8 3 − ∗ 4 /”. Describe a non recursive way of evaluating an expression in postfix notation.
Step by Step Solution
3.41 Rating (160 Votes )
There are 3 Steps involved in it
To evaluate an expression in postfix notation we need to use a stack We scan the expression from lef... View full answer
Get step-by-step solutions from verified subject matter experts
