利用栈计算中缀表达式

#include

using namespace std;
#define MIN 0.00000001
#include<math.h>
int caltwonums(float opnd1,float opnd2,char op,float &result)
{
if(op==’+’){result=opnd1+opnd2;}
if(op==’-’){result=opnd1-opnd2;}
if(op==’’){result=opnd1opnd2;}
if(op==’/’)
{
if(fabs(opnd2)<MIN)
{

        return 0;
    }
    else
    {
        result=opnd1/opnd2;
    }
}
return 1;

}
int caltwostacknum(float s1[],char s2[],int &top1,int &top2)//s1为操作数栈，s2为操作符栈
{
float opnd1,opnd2,result;
opnd2=s1[top1];
top1–;
opnd1=s1[top1];
top1–;
char op;
op=s2[top2];
top2–;
int flag=caltwonums(opnd1,opnd2,op,result);
if(flag0)
{
std::cout << “error” << std::endl;
}
top1++;
s1[top1]=result;
return flag;
}
int getpriority(char op)
{
if(op’+’||op==’-’)
{
return 0;
}
else
{
return 1;
}
}
int calinfix(char infix[])
{
int top1,top2;
float s1[100];
char s2[100];
top1=-1;
top2=-1;
int i=0;
while(infix[i]!=’\0’)
{
if(infix[i]>‘0’&&infix[i]<‘9’)
{
top1++;
s1[top1]=infix[i]-‘0’;
i++;
}
else if(infix[i]’(’)
{
top2++;
s2[top2]=infix[i];
i++;
}
else if(infix[i]’+’||
infix[i]’-’||
infix[i]’*’||
infix[i]’/’)
{
if(s2[top2]’(’||top2==-1||getpriority(infix[i])>getpriority(s2[top2]))
{
top2++;
s2[top2]=infix[i];
i++;
}
else
{
int flag=caltwostacknum(s1,s2,top1,top2);
if(flag0)
{
return 0;
}
}
}
else if(infix[i]’)’)
{
while(s2[top2]!=’(’)
{
int flag=caltwostacknum(s1,s2,top1,top2);
if(flag==0)
{
return 0;
}

        }
        top2--;
        i++;
    }
}
while(top2!=-1)
{
    int flag=caltwostacknum(s1,s2,top1,top2);
    if(flag=0)
    {
        return 0;
    }
}
return s1[top1];

}

int main()
{
char infix[100]={‘2’,’*’,‘3’,’-’,‘5’};
int result=calinfix(infix);
std::cout << result << std::endl;
}