Consider simple infix expressions that consist of single-digit operands; the operators +, -, *, %, and/;...

 

Transcribed Image Text:

Consider simple infix expressions that consist of single-digit operands; the operators +, -, *, %, and/; and parentheses. Assume that unary operators are illegal and that the expression contains no embedded spaces. Design and implement a class for an infix calculator. Use the algorithms given in your textbook to convert the infix expression to postfix form and to evaluate the resulting postfix expression. Note that if the methods evaluate and getPostfix are called before the convertPostfix method, then the exception IllegalStateException should be thrown by these methods. class Calculator { public Calculator(String exp) // initializes infix expression public String toString() // returns infix expression private boolean convertPostfix() // creates postfix expression // returns true if successful // The following methods should throw IllegalStateException if // they are called before convertPostfix // returns the resulting postfix expression public String getPostfix() throws IllegalStateException // evaluates the expression public int evaluate() throws IllegalStateException } //end Calculator Question 2: Queue Application (50 marks) Write a Java program that reads integer values from a file that is attached here, then stores all negative values in one queue and all positive values in another queue. Then display all positive values and negative values separately. You can implement it by both ways: array-based and reference-based. Consider simple infix expressions that consist of single-digit operands; the operators +, -, *, %, and/; and parentheses. Assume that unary operators are illegal and that the expression contains no embedded spaces. Design and implement a class for an infix calculator. Use the algorithms given in your textbook to convert the infix expression to postfix form and to evaluate the resulting postfix expression. Note that if the methods evaluate and getPostfix are called before the convertPostfix method, then the exception IllegalStateException should be thrown by these methods. class Calculator { public Calculator(String exp) // initializes infix expression public String toString() // returns infix expression private boolean convertPostfix() // creates postfix expression // returns true if successful // The following methods should throw IllegalStateException if // they are called before convertPostfix // returns the resulting postfix expression public String getPostfix() throws IllegalStateException // evaluates the expression public int evaluate() throws IllegalStateException } //end Calculator Question 2: Queue Application (50 marks) Write a Java program that reads integer values from a file that is attached here, then stores all negative values in one queue and all positive values in another queue. Then display all positive values and negative values separately. You can implement it by both ways: array-based and reference-based.

Answer rating: 100% (QA)

Heres a Java implementation for the Calculator class incorporating error handling and best practices ... View the full answer