附算术表达式的语法分析(算符优先法)源程序.docVIP

附：算术表达式的语法分析（算符优先法）源程序#includestring.h#includeconio.h#define MAX_EXP_LEN???????128#define MAX_NOTATION_NUM??32????/* 一个表达式中的最大算符个数 */#define?????MAX_NOTATION_LEN??20????????/* 表达式中一个算符的最大字串长度 */typedef struct??stack {?????????????????/* 表达式计算堆栈 */????double??OpdStack[MAX_NOTATION_NUM]; /* 操作数堆栈 */????char????OpStack[MAX_NOTATION_NUM];??/* 运算符堆栈 */????int?????OpdStackTop,????????????????/* 操作数堆栈顶指针 */????????????OpStackTop;?????????????????/* 运算符堆栈顶指针 */} ExpressionCalculateStack;#define OPND D#define OPTR R#define??CONTINUE_READ_NEXT_NOTATION C#define??STOP_READ_NEXT_NOTATION?????Sdouble??Expression(char??*exp);void????InfixtoPostExp(char??*infixexp, char *postfixexp);double??GetValueOfPostfixExp(char??*postfixexp);????????????/*???后缀表达式计算函数，输入：后缀表达式字串 */void GetNextNotationOfPostfixEpx (char *notation,char *postfixexp);void PutPostfixExp(char *notation,char *postfixexp);void push( char , char, double , ExpressionCalculateStack *);double??pop(char , ExpressionCalculateStack *);double calculate(double opnd1,char op,double opnd2 );void GetNextNotation (char *notation,char *exp);char GetTypeOfNotation( char *notation );int CompareOpPrior(char op2, char op1);void f1(char *str, ...);void main(void){double fx;char???str[128],postfixexp[128];????while(1)????{/*??strcpy(str,1+2*(5-3)-2/2);*/????printf(\nexp=);????scanf(%s,str);/*??fx=Expression(str);????printf(\nstr=%s****************fx=%f\n\n,str,fx);*/????InfixtoPostExp(str,postfixexp);????fx=GetValueOfPostfixExp(postfixexp);????printf(\nstr=%s,post=%s,value=%f,str,postfixexp,fx);????getch();????}}void??InfixtoPostExp(char??*infixexp, char *postfixexp)?????????/* 表达式计算函数，输入：表达式字串 */{char??notation[MAX_NOTATION_LEN],????/*存放：当前符号扫描读入的符号 */??????op1,op2,exp[MAX_EXP_LEN],op1str[2];char??flag=CONTINUE_READ_NEXT_NOTATION;int???prior;????????????????????/* 存放：算符优先级别比较结果:????????????????????????????????????op2op1:1,????????????????????????????????????op2=op1:0?