算法课件 第二章 递归[精选].ppt

double eval(char tag, double left, double right) { switch(tag) { case 3 : return left + right; //加 case 4 : return left - right;//减 case 1 : return left * right; //乘 case 2 : if (fabs(right) = Epsilon) { printf(除 0 出错！\n); exit(1); } return left/right; // 除 } return 0; //数的内部代码为0 } int c = ; #define RADIX 10 int getToken(double *nump, char *op) { double dradix, num; int i; while (c == || c == \t) c = getchar(); /*掠过空白符*/ if(!(c = 0 c = 9)) { for(i=0; opchTbl[i].code != -1opchTbl[i].op != c; i++); if (opchTbl[i].code == -1) {synError(); return -1;} *op = c; if (c != \n) c = getchar(); /* c 中存储下一个字符*/ return opchTbl[i].code; /*返回运算符的内部码*/ } num = 0.0; /*遇到数字，翻译数*/ while (c = 0 c = 9) { num = RADIX * num + c - 0; c = getchar(); } if (c == .) { dradix = 1.0 / RADIX; c = getchar(); while (c = 0 c = 9) { num = num + (c - 0) * dradix; dradix /= RADIX; c = getchar(); } } *nump = num; return 0; } void main() { char op; int type, code, n , m; double res, d1, d2; char ans; do { printf(请输入表达式！\n); optop = opstack; numtop = num; error = n = m = 0; c = ; *optop++ = 5; /*预先让左括号进栈*/ while (error == 0) { if ((type = getToken(res, op)) 0) break; if (type == 0) { if (m) {synError(); break;} m = 1; /*运算分量比运算符多1个*/ *numtop++ = res; } else { if(type = 4 type 0) { /*运算符 */ if(m != 1){synError(); break;} m = 0; /*运算符与运算分量一样多 */ } if(type == 5) n++; /*左括号计数增1 */ if(type == 6) {if(n == 0){synError(); break;} n--; /*又配对一对圆括号*/ }