#include <iostream>
#include <string.h>
#include <stdlib.h>
#define ERROR 0
#define OK 1
#define OVERFLOW -1
#define MAXSIZE 100
#define scale 7
using namespace std;
char sum[scale]={'+','-','*','/','(',')','#'}; //合法标识符
char Prior[8][8] =
{ // 运算符优先级表
// '+' '-' '*' '/' '(' ')' '#' '^'
/*'+'*/'>','>','<','<','<','>','>','<',
/*'-'*/'>','>','<','<','<','>','>','<',
/*'*'*/'>','>','>','>','<','>','>','<',
/*'/'*/'>','>','>','>','<','>','>','<',
/*'('*/'<','<','<','<','<','=',' ','<',
/*')'*/'>','>','>','>',' ','>','>','>',
/*'#'*/'<','<','<','<','<',' ','=','<',
/*'^'*/'>','>','>','>','<','>','>','>'
};
typedef int Status;
typedef char SElemType;
typedef struct //顺序栈的存储结构
{
SElemType *base; //栈底指针
SElemType *top; //栈顶指针
int stacksize; //栈的最大容量
}SqStack;
Status InitStack(SqStack &S) //顺序栈的初始化
{
S.base=new SElemType[MAXSIZE];
if(!S.base)
exit(OVERFLOW);
S.top=S.base;
S.stacksize=MAXSIZE;
return OK;
}
Status Push(SqStack &S,SElemType e) //入栈
{
if(S.top-S.base==S.stacksize)
return ERROR; //栈满
*S.top++=e; //将e压入栈顶,栈顶指针加1
return OK;
}
Status Pop(SqStack &S,SElemType &e) //出栈
{
if(S.top==S.base)
return ERROR;//栈空
e=*--S.top;
return OK;
}
SElemType GetTop(SqStack S) //取栈顶元素
{
if(S.top!=S.base) //栈非空
return *(S.top-1); //返回栈顶元素的值,栈顶指针不变
}
Status In(SElemType c,SElemType *Test)//判断c是否是运算符
{
int flag=ERROR;
for (int i=0; i<scale; i++)
{
if(c == Test[i]) //Test为待判断的运算符
flag=OK;
}
return flag;
}
Status Returnoptr(SElemType op,SElemType *Test) //判断输入的运算符是哪个运算符
{
for(int i=0; i<scale; i++) //若Test为运算符,则返回此运算符在数组中的下标
{
if (op==Test[i]) //op为输入的运算符
return i;
}
}
Status Precede(char t1, char t2) //判断栈顶元素与读入的运算符之间的优先级
{ //根据运算符优先级表返回Aop与Bop之间的优先级
return Prior[Returnoptr(t1,sum)][Returnoptr(t2,sum)];
}
SElemType Operate(SElemType a,SElemType theta,SElemType b)//计算a,b操作后的数值
{
SElemType c;
a=a-48;b=b-48;
switch(theta)
{
case '+':c=a+b+48;break;
case '-':c=a-b+48;break;
case '*':c=a*b+48;break;
case '/':c=a/b+48;break;
}
return c;
}
int EvaluateExpression()
{//设OPTR,OPND分别为运算符栈和操作栈
SqStack OPTR,OPND;
char ch,a,b,x,theta;
InitStack(OPTR);
InitStack(OPND);//初始化
Push(OPTR,'#');//起始符#压入栈
while(ch!='#'||GetTop(OPTR)!='#')//表达式没有扫描完毕或OPTR栈顶元素不为#
{
if(!In(ch,sum))
{
Push(OPND,ch); //操作数进栈
cin>>ch;
}
else
{
switch(Precede(GetTop(OPTR),ch))//比较OPTR的栈顶元素和ch的优先级
{
case '<':
Push(OPTR,ch);
cin>>ch;
break;
case '>':
Pop(OPTR,theta); //弹出栈顶元素 运算符
Pop(OPND,b);
Pop(OPND,a);
Push(OPND,Operate(a,theta,b));
break;
case '=':
Pop(OPTR,x);
cin>>ch;
break;
}
}
}
return GetTop(OPND)-'0';
}
int main()
{
cout<<"请输入算法表达式,并以#结尾:";
cout<<"表达式的结果是:"<<EvaluateExpression()<<endl;
return 0;
}
#include <string.h>
#include <stdlib.h>
#define ERROR 0
#define OK 1
#define OVERFLOW -1
#define MAXSIZE 100
#define scale 7
using namespace std;
char sum[scale]={'+','-','*','/','(',')','#'}; //合法标识符
char Prior[8][8] =
{ // 运算符优先级表
// '+' '-' '*' '/' '(' ')' '#' '^'
/*'+'*/'>','>','<','<','<','>','>','<',
/*'-'*/'>','>','<','<','<','>','>','<',
/*'*'*/'>','>','>','>','<','>','>','<',
/*'/'*/'>','>','>','>','<','>','>','<',
/*'('*/'<','<','<','<','<','=',' ','<',
/*')'*/'>','>','>','>',' ','>','>','>',
/*'#'*/'<','<','<','<','<',' ','=','<',
/*'^'*/'>','>','>','>','<','>','>','>'
};
typedef int Status;
typedef char SElemType;
typedef struct //顺序栈的存储结构
{
SElemType *base; //栈底指针
SElemType *top; //栈顶指针
int stacksize; //栈的最大容量
}SqStack;
Status InitStack(SqStack &S) //顺序栈的初始化
{
S.base=new SElemType[MAXSIZE];
if(!S.base)
exit(OVERFLOW);
S.top=S.base;
S.stacksize=MAXSIZE;
return OK;
}
Status Push(SqStack &S,SElemType e) //入栈
{
if(S.top-S.base==S.stacksize)
return ERROR; //栈满
*S.top++=e; //将e压入栈顶,栈顶指针加1
return OK;
}
Status Pop(SqStack &S,SElemType &e) //出栈
{
if(S.top==S.base)
return ERROR;//栈空
e=*--S.top;
return OK;
}
SElemType GetTop(SqStack S) //取栈顶元素
{
if(S.top!=S.base) //栈非空
return *(S.top-1); //返回栈顶元素的值,栈顶指针不变
}
Status In(SElemType c,SElemType *Test)//判断c是否是运算符
{
int flag=ERROR;
for (int i=0; i<scale; i++)
{
if(c == Test[i]) //Test为待判断的运算符
flag=OK;
}
return flag;
}
Status Returnoptr(SElemType op,SElemType *Test) //判断输入的运算符是哪个运算符
{
for(int i=0; i<scale; i++) //若Test为运算符,则返回此运算符在数组中的下标
{
if (op==Test[i]) //op为输入的运算符
return i;
}
}
Status Precede(char t1, char t2) //判断栈顶元素与读入的运算符之间的优先级
{ //根据运算符优先级表返回Aop与Bop之间的优先级
return Prior[Returnoptr(t1,sum)][Returnoptr(t2,sum)];
}
SElemType Operate(SElemType a,SElemType theta,SElemType b)//计算a,b操作后的数值
{
SElemType c;
a=a-48;b=b-48;
switch(theta)
{
case '+':c=a+b+48;break;
case '-':c=a-b+48;break;
case '*':c=a*b+48;break;
case '/':c=a/b+48;break;
}
return c;
}
int EvaluateExpression()
{//设OPTR,OPND分别为运算符栈和操作栈
SqStack OPTR,OPND;
char ch,a,b,x,theta;
InitStack(OPTR);
InitStack(OPND);//初始化
Push(OPTR,'#');//起始符#压入栈
while(ch!='#'||GetTop(OPTR)!='#')//表达式没有扫描完毕或OPTR栈顶元素不为#
{
if(!In(ch,sum))
{
Push(OPND,ch); //操作数进栈
cin>>ch;
}
else
{
switch(Precede(GetTop(OPTR),ch))//比较OPTR的栈顶元素和ch的优先级
{
case '<':
Push(OPTR,ch);
cin>>ch;
break;
case '>':
Pop(OPTR,theta); //弹出栈顶元素 运算符
Pop(OPND,b);
Pop(OPND,a);
Push(OPND,Operate(a,theta,b));
break;
case '=':
Pop(OPTR,x);
cin>>ch;
break;
}
}
}
return GetTop(OPND)-'0';
}
int main()
{
cout<<"请输入算法表达式,并以#结尾:";
cout<<"表达式的结果是:"<<EvaluateExpression()<<endl;
return 0;
}