数据结构第3章.pptVIP

if (!IsEmpty(*s)){ StackTop(*s,op2); Pop(s); /* 弹出栈顶操作数op2 */ } else{ result=FALSE; printf(\n Missing operand!); } if(result) switch (c){ /* 执行运算op2 c op1，并将运算结果进栈 */ case +: Push(s,op2+op1); break; case -: Push(s,op2-op1); break; case *: Push(s,op2*op1); break; case /: if (op1==0.0){ printf(\nDivide by 0!); Clear(s); } else Push(s,op2/op1); break; } else Clear(s); } void Eval(char exp[]) { char c;int op;int i; Stack s; CreateStack(s,Size); for(i=0,c=exp[i];c!=#;i