表达式求值 son bin.docVIP

#include stdio.h #includeiostream.h //定义全局变量------------------------------------------------------------ int x; //定义栈放操作数和操作符-------------------------------------------------- typedef struct { char a[100]; int b[100]; int top; }stack; //初始化栈----------------------------------------------------------------- void initstack(stack s,char ) { s.top =0;s.a[0]=#; } void initstack(stack s,int ) { s.top =0;s.b[0]=0; } //--------进栈------------------------------------------------------------- void push(stack s,char y) { if (s.top ==99) coutstack overflow; else { s.top =s.top +1; s.a[s.top]=y; } } void push(stack s,int x) { if (s.top ==99) coutstack overflow; else { s.top =s.top +1; s.b[s.top]=x; } } //退栈------------------------------------------------------------------------ int shupop(stack s) { if(s.top ==-1) coutstack underflow; else return s.b [s.top --]; } char prtpop(stack s) { if(s.top ==-1) coutstack underflow\n; else return s.a [s.top --]; } //运算---------------------------------------------------------------------- int operite(int a,char b,int c) { switch (b) { case -:return -(a-c); //为什么要加负号？ case +:return (a+c); case *:return (a*c); case /:return (c/a); //为什么是c/a而不是a/c？ }; } //把字符变为int------------------------------------------------------------- int change( char c) { return x=x*10+(int)c-48; } //操作符的定位------------------------------------------------------------- int priority(char op) { switch(op){ case +:return 1; case -:return 2; case *:return 3; case /:return 4; case#:return 0; } } //操作符的比较------------------------------------------------------------- bool compare(char a,char b) {if(priority(a)priority(b))return 1; return 0; } //应用栈顶元素------------------------------------------------------------- char gettop(stack prt,char=e) {return prt.a [prt.top ];} int gettop(stack shu,int=7) {return shu.b[shu.top ];} //接收表达式---------------------------------------------