python作业表达式求值_数据结构作业之表达式求值

#include#include#includeusingnamespacestd;#defineMax_Stack_Size 1000constcharIsFirst[7][7]={

{'>','>','','>'},

{'>','>','','>'},

{'>','>','>','>','','>'},

{'>','>','>','>','','>'},

{'

{'>','>','>','>','>','>','>'},

{'

} ;structStackT1{charStack[Max_Stack_Size];intTop;voidClearStack(){ Top=1; }charGetTop(){returnStack[Top-1]; }voidPush(charc){ Stack[Top++]=c; }voidPop(char&c){ c=Stack[--Top]; }

} OPTR;//运算符栈structStackT2{intStack[Max_Stack_Size];intTop;voidClearStack(){ Top=1; }intGetTop(){returnStack[Top-1]; }voidPush(intc){ Stack[Top++]=c; }voidPop(int&c){ c=Stack[--Top]; }

} OPND;//操作数栈boolIsNum(charc){//cout <='0'&&c<='9');

}intOperate(inta,charOP,intb){intc;//cout <

}returnc;

}intChange(charc){intret;switch(c) {case'+': ret=0;break;case'-': ret=1;break;case'*': ret=2;break;case'/': ret=3;break;case'(': ret=4;break;case')': ret=5;break;case'#': ret=6;break;

}returnret;

}charPrecede(chara,charb){//cout <

}voidEvaluateExpression(void){

OPTR.ClearStack(), OPND.ClearStack();

OPTR.Push('#');charChNow=getchar();while(ChNow!='#'||OPTR.GetTop()!='#'){if(IsNum(ChNow)) {intNowNum=ChNow-'0';

ChNow=getchar();while(IsNum(ChNow)){

NowNum=ChNow-'0'+NowNum*10;

ChNow=getchar();

}

OPND.Push(NowNum);/*for (int i = 0; i 

cout <

cout <

OPTR.Push(ChNow); ChNow=getchar();break;case'=':charx; OPTR.Pop(x); ChNow=getchar();break;case'>':chartheta; OPTR.Pop(theta);inta, b; OPND.Pop(b); OPND.Pop(a);

OPND.Push(Operate(a, theta, b));break;

}

}

}

cout<

}intmain(){

EvaluateExpression();return0;

}