Postfix notation Program plan: Import the required packages into the program. In the Exercise20_14 class, In the main() method, Check length of the argument. If yes, display the error message. Declare the variable. The for loop executes until the length of arguments. If yes, evaluate the expression. In try block, call evaluateExpression() method by passing the input expression. In catch, block, catch the exception. In the evaluateExpression() method. Create an object for Stack. Extract operands and operators. The while loop executes until token to scan the expression. If yes, Extract an expression. Check whether the length of expression is equal to 0. If yes, continue the code. Otherwise, check the expression. If yes, call processAnOperator() method. Otherwise, Call push() method to push an operand into stack. Return the result. In the processAnOperator() method. Check whether operator. If yes, perform the addition operation and push the result to stack. Otherwise, check whether operator. If yes, perform the subtraction operation and push the result to stack. Otherwise, check whether operator. If yes, perform the multiplication operation and push the result to stack. Otherwise, check whether operator. If yes, perform the division operation and push the result to stack.

Question

Want to see the full answer?

Answer 1

Question

Chapter 20, Problem 20.14PE

Program Plan Intro

Postfix notation

Program plan:

Import the required packages into the program.

In the Exercise20_14 class,

In the main() method,

Check length of the argument. If yes, display the error message.

Declare the variable.

The for loop executes until the length of arguments. If yes, evaluate the expression.

In try block, call evaluateExpression() method by passing the input expression.

In catch, block, catch the exception.

In the evaluateExpression() method.

Create an object for Stack.

Extract operands and operators.

The while loop executes until token to scan the expression. If yes,

Extract an expression.

Check whether the length of expression is equal to 0. If yes, continue the code.

Otherwise, check the expression. If yes, call processAnOperator() method.

Otherwise, Call push() method to push an operand into stack.

Return the result.

In the processAnOperator() method.

Check whether operator. If yes, perform the addition operation and push the result to stack.

Otherwise, check whether operator. If yes, perform the subtraction operation and push the result to stack.

Otherwise, check whether operator. If yes, perform the multiplication operation and push the result to stack.

Otherwise, check whether operator. If yes, perform the division operation and push the result to stack.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

What are the major threats of using the internet? How do you use it? How do children use it? How canwe secure it? Provide four references with your answer. Two of the refernces can be from an article and the other two from websites.

Assume that a string of name & surname is saved in S. The alphabetical characters in S can be in lowercase and/or uppercase letters. Name and surname are assumed to be separated by a space character and the string ends with a full stop "." character. Write an assembly language program that will copy the name to NAME in lowercase and the surname to SNAME in uppercase letters. Assume that name and/or surname cannot exceed 20 characters. The program should be general and work with every possible string with name & surname. However, you can consider the data segment definition given below in your program. .DATA S DB 'Mahmoud Obaid." NAME DB 20 DUP(?) SNAME DB 20 DUP(?) Hint: Uppercase characters are ordered between 'A' (41H) and 'Z' (5AH) and lowercase characters are ordered between 'a' (61H) and 'z' (7AH) in the in the ASCII Code table. For lowercase letters, bit 5 (d5) of the ASCII code is 1 where for uppercase letters it is 0. For example, Letter 'h' Binary ASCII 01101000 68H 'H'…

What did you find most interesting or surprising about the scientist Lavoiser?