stackprocess.java

此计算器是我们期末的实习作业

class StackProcess {
  int top=0; Union[] stack=new Union[100];
  static class Union{
  int type;
  char value;
  double valuekkk;}
void push(Union u){stack[top]=u;top++;}
Union pop(){System.out.println("````````"+top);top--;return stack[top];}
boolean empty(){if(top==0)return true;else return false;}
}