NO2表达式求值问.docVIP

表达式求值问题 #includestdio.h #includemalloc.h typedef struct cstack { char *top; char *base; int csize; }*charstack,cstack; typedef struct istack { int *top; int *base; int isize; }*intstack,istack; charstack initcharstack()//初始化 { charstack s; s=(charstack)malloc(sizeof(cstack)); s-base=s-top=(char*)malloc(100*sizeof(char)); s-csize=100; return s; } intstack initintstack() { intstack s; s=(intstack)malloc(sizeof(istack)); s-base=s-top=(int*)malloc(100*sizeof(int)); *(s-top)=-1; s-isize=100; return s; } void push1(charstack s,char c)//入栈 { if((s-top-s-base)=s-csize) { s-base =(char*)realloc(s-base,(s-csize +10)*sizeof(char)); s-top=s-base+s-csize ; s-csize +=10; } *s-top++=c; } void push2(intstack s,int a) { if((s-top-s-base)=s-isize) { s-base =(int*)realloc(s-base,(s-isize +10)*sizeof(int)); s-top=s-base+s-isize ; s-isize +=10; } *s-top++=a; } char pop1(charstack s)//出栈 { char c; c=*(s-top-1); s-top--; return c; } int pop2(intstack s) { int a; a=*(s-top-1); s-top--; return a; } char gettop1(charstack s)//取栈顶 { return *(s-top-1); } int gettop2(intstack s) { return *(s-top-1); } int charstackempty(charstack s)//置空 { if(s-base==s-top) return 1; return 0; } int In(char c)//判断是运算符还是数 { char s[7]={+,-,*,/,(,),#}; int i; for(i=0;i7;i++) if(s[i]==c) return 1; return 0; } int operate(int a,char c,int b)//加减乘除运算 { switch(c) { case +:return (a+b); case -:return (a-b); case *:return (a*b); case /:return (a/b); default :return 0.0; } } char Precede(char c1,char c2)//判断运算符的优先级 { char s[7]={+,-,*,/,(,),#}; char str[7][7]={,,,,,,, ,,,,,,, ,,,,,,, ,,,,,,, ,,,,,=, , ,,,, ,,, ,,,,, ,=}; int i=0,j=0; while(s[i]!=c1) i++; while(s[j]!=c2) j++; return str[i][j]; } int EvaluateExpression(charstack OPTR,intstack OPND,char *str)//表达式求值算法 { char c; int a,b; int i=0; while(str[i]!=#||gettop1(OPTR)!=#) { if(!In(str[i]