Question: JAVA - Using the following pseudocode.... Algorithm evaluatePostfix(postfix) // Evaluates a postfix expression. valueStack = a new empty stack while (postfix has characters left to
JAVA - Using the following pseudocode....
Algorithm evaluatePostfix(postfix) // Evaluates a postfix expression. valueStack = a new empty stack while (postfix has characters left to parse) { nextCharacter = next nonblank character of postfix switch (nextCharacter) { case variable: valueStack.push(value of the variable nextCharacter) break case '+' : case '-' : case '*' : case '/' : case '^' : operandTwo = valueStack.pop() operandOne = valueStack.pop() result = the result of the operation in nextCharacter and its operands operandOne and operandTwo valueStack.push(result) break default: break } } return valueStack.peek()
Create an appropriate Java Infix calculator class (Carrano & Henry, 2015, p. 177). Your program should accept at least five elements (data1, data2, data3, data4, data5) and will perform an appropriate infix operation given the following scenarios:
data1 data2 + data3 * data4
data1 data2 * data3 * data1 / data4 data5* +
Use the following values for each input:
data1 = 1; data2 = 2; data3 = 4 data4 = 5 data5 = 3
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
