Please provide complete Java class code with main() function. P-6.35: Implement

Question

Please provide complete Java class code with main() function.

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

C-6.19: Postfix notation is an unambiguous way of writing an arithmetic expression without parentheses. It is defined so that if “(exp1)op(exp2)” is a normal fully parenthesized expression whose operation is op, 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 “((5 + 2) (8 3))/4” is “5 2 + 8 3 4 /”. Describe a nonrecursive way of evaluating an expression in postfix notation.

Explanation / Answer

import java.io.IOException; public class InToPost { private Stack theStack; private String input; private String output = ""; public InToPost(String in) { input = in; int stackSize = input.length(); theStack = new Stack(stackSize); } public String doTrans() { for (int j = 0; j

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

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