栈实现简易计算器

计算数学表达式的值。 输入数学表达式，输出表达式的计算结果。数学表达式由单个数字和运算符+、-、、/、(、)构成，
例如 2+3(4+5)–6/4。

#include<iostream>
#include<iomanip>
#include<string>
#include<cstdio>
using namespace std;
double result;
int tag;
template<class T>
class arrayStack
{
   public:
       arrayStack();
       ~arrayStack() {delete [] stack;}
       bool empty() const {return stackTop == -1;}
       int size() const
          {return stackTop + 1;}
       T& top(){return stack[stackTop];}
       void pop(){stack[stackTop--].~T();}  // T的析构 
       void push(const T& theElement){stack[++stackTop] = theElement;}
      
   private:
      int stackTop;         // 当前栈顶 
      int arrayLength;      // 栈容量
      T *stack;           // 元素数组 
};

template<class T>//构造函数 
arrayStack<T>::arrayStack()
{
   arrayLength = 2000;
   stack = new T[2000];
   stackTop = -1;
}
arrayStack<double> num;//数字 
arrayStack<char> sign;//运算符

int priority(char a)
{
 if(a=='(')
    return 0;
 else if(a == '+')
    return 1;
 else if(a =='-')
  return 2;
 else if(a == '*')
  return 3;
 else if(a == '/')
  return 3;
 return 0;
}

bool judge(char e)//判断是运算符还是数字 
{
 bool judge=false; 
 if(e>='0' && e<='9')//不能用'0'<=e<='9' 
 {
  judge=true;
 }
 return judge;
}

void pop_caculate()
{
 double l=0,r=0,w=0;
 char ssign=sign.top();
 r=num.top();
 num.pop();
 l=num.top();
 num.pop();
 sign.pop();
 if(ssign == '+') w=l+r;
 else if(ssign == '-') w=l-r;
 else if(ssign == '*') w=l*r;
 else if(ssign == '/') w=l/r;
 num.push(w);
}

void caculate(string expr)//计算函数 
{
 double n=0;
 string::size_type size=0;
 for(string::size_type i=0;i<expr.size();)
 { 
  if(tag==0 && judge(expr[i])==true)
  {
  n=(double)(expr[i]-48);
  if(sign.top()=='-')
  {
   n=(-1.00)*n;
   sign.pop();
   sign.push('+');
  }
  num.push(n);
  i++;
  tag=1;
  } 
  else{
   tag=0;
   if(sign.empty())
   {sign.push(expr[i]);}
   else if(expr[i]=='(')
   {sign.push(expr[i]);}
   else if(expr[i]==')')
   {
    while(sign.top()!='(')
    {
     pop_caculate();
    }
    sign.pop();
    if(sign.top()=='-')
    {
     num.top()=(-1.00)*num.top();
     sign.pop();
     sign.push('+');
    }   
   }
   else if(priority(expr[i])<=priority(sign.top()))
   {
    pop_caculate();
    sign.push(expr[i]);
   }
   else  sign.push(expr[i]);
   ++i;
  }
 }
 while(!sign.empty())
 {
  pop_caculate();
 }
 result=num.top();
 //cout.setf(ios::fixed,ios::floatfield);
 //cout<<result<<endl;
 printf("%.2f",result);
 cout<<endl;
}

int main()
{
 //freopen("a.txt","r",stdin);
 int n;
 cin>>n;
 for(int i=0;i<n;i++)
 {
  string x;
  cin>>x;
  tag=0;
  caculate(x);
 }
}