1、栈实现算数表达式求值#include using namespace std; #define STACK_INIT_SIZE 100 #define STACKINCREASE 10 #define OK 1 #define ERROR 0 #define TRUE 1 #define FALSE 0 typedef char SElemType; typedef int status; typedef struct SElemType *top; SElemType *base; int stacksize; SqStack; status Init_Stack(SqStack &s) s
2、.base=(SElemType*)malloc(sizeof(SElemType)*STACK_INIT_SIZE); s.top=s.base; s.stacksize=STACK_INIT_SIZE; if(s.base!=NULL) return OK; return ERROR; status Destroy(SqStack &s) free(s.base); return OK; status ClearStack(SqStack &s) s.top=s.base; return OK; status StackEmpty(SqStack s) if(s.base=s.top) r
3、eturn TRUE; return FALSE; int StackLength(SqStack s) return s.top-s.base; status GetTop(SqStack s,SElemType &e) if(StackEmpty(s) cout栈为空endl; return ERROR; e=*-s.top; return OK; status Push(SqStack &s,SElemType e) if(StackLength(s)=s.stacksize) s.base=(SElemType*)realloc(s.base,sizeof(SElemType)*(s.
4、stacksize+STACKINCREASE); if(!s.base) cout增加储存单元失败endl; return ERROR; s.top=s.base+s.stacksize; s.stacksize+=STACKINCREASE; *s.top=e; s.top+; return OK; status Pop(SqStack &s,SElemType &e) if(StackEmpty(s)return ERROR; e=*-s.top; return OK; /*数制转化函数*/ /* void Convertion(int n) SqStack s; Init_Stack(
5、s); int e; while(n) Push(s,n%2); n/=2; while(!StackEmpty(s) Pop(s,e); coute; coutendl; */ /*判断括号是否匹配*/ /* int main() SqStack s; Init_Stack(s); char ch,e; ch=getchar(); while(ch!=n) switch(ch) case(:Push(s,ch);break; case): if(StackEmpty(s) cout括号不匹配endl; return 0; Pop(s,e);break; default: cout非法输入en
6、dl; return 0;break; ch=ge#include using namespace std; #define STACK_INIT_SIZE 100 #define STACKINCREASE 10 #define OK 1 #define ERROR 0 #define TRUE 1 #define FALSE 0 typedef char SElemType; typedef int status; typedef int OperateType; typedef struct SElemType *top; SElemType *base; int stacksize;
7、SqStack; status Init_Stack(SqStack &s) s.base=(SElemType*)malloc(sizeof(SElemType)*STACK_INIT_SIZE); s.top=s.base; s.stacksize=STACK_INIT_SIZE; if(s.base!=NULL) return OK; return ERROR; status Destroy(SqStack &s) free(s.base); return OK; status ClearStack(SqStack &s) s.top=s.base; return OK; status
8、StackEmpty(SqStack s) if(s.base=s.top) return TRUE; return FALSE; int StackLength(SqStack s) return s.top-s.base; SElemType GetTop(SqStack s) if(StackEmpty(s) cout栈为空endl; return ERROR; return *-s.top; status Push(SqStack &s,SElemType e) if(StackLength(s)=s.stacksize) s.base=(SElemType*)realloc(s.ba
9、se,sizeof(SElemType)*(s.stacksize+STACKINCREASE); if(!s.base) cout增加储存单元失败;break; case-:return;break; case*:return;break; case/:return;break; case(:return;break; case#:return;break; case-: switch(c2) case+:return;break; case-:return;break; case*:return;break; case/:return;break; case(:return;break;
10、case#:return;break; case*: switch(c2) case+:return;break; case-:return;break; case*:return;break; case/:return;break; case(:return;break; case#:return;break; case/: switch(c2) case+:return;break; case-:return;break; case*:return;break; case/:return;break; case(:return;break; case#:return;break; case
11、(: switch(c2) case+:return;break; case-:return;break; case*:return;break; case/:return;break; case(:return;break; case):return=;break; case#: cout括号不匹配endl; exit(0); break; case#: switch(c2) case+:return;break; case-:return;break; case*:return;break; case/:return;break; case(:return;break; case): co
12、ut括号不匹配=0&c=9) return TRUE; return FALSE; /*算数表达式求值*/ char Operate(char a,char b,char theta) int x; switch(theta) case+:x=(a-0)+(b-0);break; case-:x=(a-0)-(b-0);break; case*:x=(a-0)*(b-0);break; case/:x=(a-0)/(b-0);break; return x+0; int main() SqStack OPTR,OPND; Init_Stack(OPND); Init_Stack(OPTR);P
13、ush(OPTR,#); char ch,userless; cout请输入表达式,并以#结尾:; ch=getchar(); while(ch!=#|GetTop(OPTR)!=#) if(isOPND(ch) Push(OPND,ch); ch=getchar(); else if(isOPTR(ch)=0) cout非法字符输入endl; exit(0); else switch(Precede(GetTop(OPTR),ch) case : char a,b; char theta; Pop(OPND,b); Pop(OPND,a); Pop(OPTR,theta); Push(OPND,Operate(a,b,theta); break; coutGetTop(OPND)endl; return 0; tchar(); if(StackEmpty(s) cout括号匹配endl; else cout括号不匹配endl; Destroy(s); return 0; */
