棧的應(yīng)用之表達(dá)式求值

1、棧的應(yīng)用之表達(dá)式求值程序代碼如下：#includestdio.h#includestdlib.h#define MAXSIZE 100#define ERROR 0#define OK 1#define OVERFLOW -1typedef struct /棧的定義char *base;char *top;int stacksize;SqStack;int InitStack(SqStack &S) /棧的初始化 S.base=new charMAXSIZE; if(!S.base)exit(OVERFLOW); S.top=S.base;S.stacksize=MAXSIZE;return

2、OK;char Push(SqStack &S,char e) /入棧 if(S.top-S.base=S.stacksize) return ERROR;*S.top+=e;return OK;char Pop(SqStack &S,char &e) /出棧 if(S.top=S.base)return ERROR;e=*-S.top;return OK;int GetTop(SqStack S) /取棧頂元素 if(S.top!=S.base)return *(S.top-1);char In(char c) /判斷讀入字符是否為運(yùn)算符 if(0=c&c, , , , ,0, ,0,=;

3、switch(c1)case+: i=0;break;case-: i=1;break;case*: i=2;break;case/: i=3;break;case(: i=4;break;case): i=5;break;case#: i=6;break;switch(c2)case+: j=0;break;case-: j=1;break;case*: j=2;break;case/: j=3;break;case(: j=4;break;case): j=5;break;case#: j=6;break;return preij;char Operate(char a,char thet

4、a,char b) /運(yùn)算函數(shù) int result;switch(theta)case+:result=(a-48)+(b-48);break; case-:result=(a-48)-(b-48);break; case*:result=(a-48)*(b-48);break; case/:result=(a-48)/(b-48);break; return result+0;char EvaluateExpression()SqStack OPTR;SqStack OPND;InitStack(OPTR);InitStack(OPND);Push(OPTR,#);char x,w,theta,a,b;w=getchar();while(w!=#|GetTop(OPTR)!=#)if(!In(w)Push(OPND,w);w=getchar();elseswitch(Precede(GetTop(OPTR),w)case:Pop(OPTR,theta);Pop(OPND,b);Pop(OPND,a); /a是第一運(yùn)算數(shù)，b是第二運(yùn)算數(shù) Push(OPND,Operate(a,theta,b);break;return(GetTop(OPND);void main()int c;printf(Please input one expression:n);c=Evaluat