(盐城工学院数据结构课程设计)栈的应用表达式求值

}

if (!PrintError){ answer = FTop(Operands); FPop(Operands); if (FIsEmpty(Operands) != 1){ fprintf(Change,\ /*如果还有操作数*/ PrintError = 0; } else fprintf(Change,\ }

else{ fprintf(Change,\ PrintError = 0; }

FMakeEmpty(Operands); free(Operands);