Write a JAVA program that will take a string, parse it, and then calculate the v
ID: 3665098 • Letter: W
Question
Write a JAVA program that will take a string, parse it, and then calculate the value in post-fix (reverse polish) notation. To understand this mostly every expression you’ve seen in math is called in-fix notation.
In-fix Example:
3 + 2
However in post-fix notation the operator is at the end of the expression.
Post-fix Example:
3 2 +
A stack is used to calculate values in post-fix notation. Numbers are pushed onto the stack, and when an operator is reached it pops off the last two numbers and then pushes the resulting value back on the stack.
This program must:
Calculate values using the algorithm mentioned above and in the slides for addition, subtraction, multiplication, and division (+,-,*,/)
Error message if the user tries to divide by zero
Take in a string and process each digit and operator one at a time assuming white space delimits each
Make sure to check if there’s at least two items on the stack before when an operator is encountered or else it’s not a properly formatted post-fix expression
Finish when the program reaches the end of the string and it has only one value left on the stack, then that value is popped off and returned. Otherwise it was not properly formatted
Use your own created stack and not java’s built in stack
You may use any implementation so either an array or a linked structure.
HINTS! First when you’re processing the inputted string you can use a Scanner and call the method next() to get each token. From there you can evaluate if that token is an operator, numeric value, or an error. If it’s a numeric value then you may parse that string using Integer.parseInt() to get the integer value. You may also call Integer.parseInt() in a try-catch block. If the token is not an integer an exception will be raised and should be immediately halted.
Example Dialog:
Enter a reverse polish expression or "quit" to quit
3 2 +
5
Enter a reverse polish expression or "quit" to quit
5 1 2 + 4 * + 3 -
14
Enter a reverse polish expression or "quit" to quit
2 3 4 +
This was not properly formatted
0
Enter a reverse polish expression or "quit" to quit
quit
Goodbye
Explanation / Answer
Program:
import java.io.*;
import java.util.Scanner;
class Stack
{
private int[] a;
private int top,m;
public Stack(int max)
{
m=max;
a=new int[m];
top=-1;
}
public void push(int key)
{
a[++top]=key;
}
public int pop()
{
return(a[top--]);
}
}
class Evaluation{
public int calculate(String s)
{
int n,r=0;
n=s.length();
Stack a=new Stack(n);
for(int i=0;i<n;i++)
{
char ch=s.charAt(i);
if(ch>='0'&&ch<='9')
a.push((int)(ch-'0'));
else
{
int x=a.pop();
int y=a.pop();
switch(ch)
{
case '+':r=x+y;
break;
case '-':r=y-x;
break;
case '*':r=x*y;
break;
case '/':r=y/x;
break;
default:r=0;
}
a.push(r);
}
}
r=a.pop();
return(r);
}
}
class PostfixEvaluation
{
private static Scanner sca;
private static int oprand;
private static int operator;
public static void main(String[] args)throws IOException
{
String input;
while(true)
{
System.out.println("Enter a reverse polish expression or "quit" to quit");
input=getString();
if(input.equals("quit"))
{
System.out.println("Goodbye");
break;
}
else if(input.equals("no"))
{
System.out.println("0");
}
else
{
Evaluation e=new Evaluation();
System.out.println(e.calculate(input));
}
}
}
public static String getString()throws IOException
{
sca = new Scanner(System.in);
String s=sca.nextLine();
operator = 0;
oprand = 0;
for(int i=0;i<s.length();i++)
{
if(s.charAt(i)=='+' || s.charAt(i)=='-' || s.charAt(i)=='*'|| s.charAt(i)=='/' )
operator++;
else
oprand++;
}
if(s.equals("quit"))
return s;
else if(operator!=(oprand-1))
{
System.out.println("This was not properly formatted");
return "no";
}
return s;
}
}
Result:
Enter a reverse polish expression or "quit" to quit
32+
5
Enter a reverse polish expression or "quit" to quit
512+4*+3-
14
Enter a reverse polish expression or "quit" to quit
234+
This was not properly formatted
0
Enter a reverse polish expression or "quit" to quit
quit
Goodbye