Revise and test the postfix expression evaluator program as specified here. A) U

Question

Revise and test the postfix expression evaluator program as specified here. A) Use ArrayListStack class instead of the ArrayStack class.

B) Catch and handle the divide by zero situation that was assumed not to happen. For example, if the input expression is 5 3 3 - /, the result would be the message "illegal divide by zero." C) Support a new operation indicated by "^" that returns the larger of its operands. For example, 5 7 ^ = 7. D) Keep track of statistics about the numbers pushed into the stack during the evaluation of an expression. The program should output the largest and the smallest numbers pushed, the total numbers pushed, and the average value of pushed numbers.

Explanation / Answer

class BufferUnderflowException extends NoSuchElementException {
    
    /** The root cause throwable */
    private final Throwable throwable;

    /**
     * Constructs a new <code>BufferUnderflowException</code>.
     */
    public BufferUnderflowException() {
        super();
        throwable = null;
    }

    /**
     * Construct a new <code>BufferUnderflowException</code>.
     *
     * @param message  the detail message for this exception
     */
    public BufferUnderflowException(String message) {
        this(message, null);
    }

    /**
     * Construct a new <code>BufferUnderflowException</code>.
     *
     * @param message  the detail message for this exception
     * @param exception  the root cause of the exception
     */
    public BufferUnderflowException(String message, Throwable exception) {
        super(message);
        throwable = exception;
    }

    /**
     * Gets the root cause of the exception.
     *
     * @return the root cause
     */
    public final Throwable getCause() {
        return throwable;
    }
    
}

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

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