算术表达式求值的运算符优先算法C语言完整代码.docx

#include#include#include#define STACK_INIT_SIZE 100#define STACKINCREMENT 10# define TRUE 1# define FALSE 0typedef int Status;typedef char SElemType;typedef struct SElemType *base;SElemType *top;int stacksize;StackChar; /sequence序列typedef struct float *base;float *top;int stacksize;StackFloat; /sequence序列Status InitStack(StackChar *S)/初始化空桟*S=(StackChar *)malloc(sizeof(StackChar);(*S)-base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType);if(!(*S)-base) exit(OVERFLOW);(*S)-top=(*S)-base; (*S)-stacksize=STACK_INIT_SIZE;return OK;/InitStack(&S);Status initStack(StackFloat *S)/初始化空桟*S=(StackFloat *)malloc(sizeof(StackFloat);(*S)-base=(float *)malloc(STACK_INIT_SIZE*sizeof(float);if(!(*S)-base) exit(OVERFLOW);(*S)-top=(*S)-base; (*S)-stacksize=STACK_INIT_SIZE;return OK;/initStack(&S);Status Pop(StackChar *S,SElemType *a)if(*S)-top=(*S)-base) printf(ERROR!n); return ERROR; *a=*(-(*S)-top);return OK;/Pop(&S,&e);Status pop(StackFloat *S,float *a)if(*S)-top=(*S)-base) printf(ERROR!n); return ERROR; *a=*(-(*S)-top);return OK;/Pop(&S,&e);Status Push(StackChar *S,SElemType e)*S-top+=e; return OK;/Push(S,e);Status push(StackFloat *S,float e)*S-top+=e; return OK;/push(S,e);SElemType GetTop(StackChar S)SElemType e;e=*(S.top-1); return e;/GetTop(*S,&e);float getTop(StackFloat S)float e;e=*(S.top-1); return e;/GetTop(*S,&e);int InOP(char c)/判断c是否为运算符，是返回TRUE，否则返回FALSEswitch (c) case +: return TRUE; case -: return TRUE; case *: return TRUE;case /: return TRUE;case (: return TRUE;case ): return TRUE;case #: return TRUE; default: return FALSE;/InOP(b2)char precede(SElemType e,char c)/判断e和c的优先级，若e的优先权小于c 返回;char OP7=+,-,*,/,(,),#;switch (e) case +: if (c=+|c=-|c= )|c=#) return ;else return ;else return ;else return ;else return ;case (: if (c=#) printf(-#:FALSEn);break;else if (c=+|c=-|c=*|c=/|c=() return ;case #: if (c=) printf(#-):FALSEn);break;else if (c=#) return =;else return ;float Operate(float a,unsigned char theta, float b) switch(theta) case +: return a+b; case -: return a-b; case *: return a*b; case /: return a/b; default : return 0; void EvaluateExpression()/只能算0-9的数之间的运算int i; StackChar *OPTR,o; / 运算符栈，字符元素 StackFloat *OPND,P; / 运算数栈，实数元素 char TempData20; float Data,a,b; char oprtr,*c,x,Dr2;char MyExpression=6,*,7,+,(,7,/,8,*,(,8,-,9,),-,6,),#;/35.125/char MyExpression=6,*,7,+,(,7,/,8,*,(,8,-,9,),-,16,),#;/还是35.125，因为16作为char型只保留了一位/char MyExpression=2,*,0.5,+,8,#;for( i=0;MyExpressioni!=#;i+) /输出表达式printf(%c,MyExpressioni); c=MyExpression;OPTR=&o;InitStack(&OPTR); Push(OPTR,#);/初始化OPTR 栈底为#OPND=&P;initStack(&OPND);/初始化OPNDstrcpy(TempData,0);while (*c!= #|GetTop(*OPTR) != #) / if (!InOP(*c) Dr0=*c; Dr1=0; strcat(TempData,Dr); c+; if(InOP(*c) Data=(float)atof(TempData);push(OPND,Data); strcpy(TempData,0); else switch (precede(GetTop(*OPTR), *c) case : / 退栈并将运算结果入栈 Pop(&OPTR, &oprtr); pop(&OPND, &b); pop