高手，看一下哪里出错啦？

0041667 · 发表于 2005-11-18 07:16:55

<

>#include<stdio.h> #include<malloc.h>
<

>#define null 0 #define stack_size 100 typedef struct{ int *base; int *top; int stacksize; }stack; void init(stack *s){ s->base=(int*)malloc(stack_size*sizeof(int)); s->top=s->base; s->stacksize=stack_size; }
<

>char gettop(stack *s){ char e; e=*(s->top-1); return e; } void push(stack *s,char e){ *s->top++=e; } char pop(stack *s){ char e; e=*--s->top;return e;} int compare(char e){ char op[7]={'(',')','*','/','-','+','#'}; int i=0; while(op!=e)i++; if(i>6)return 0; else return 1; }
int trust(char x){ int a; switch(x){ case '#': a=0;break; case '(': a=1;break;
 case '+': a=2;break;
 case '-': a=2;break;
 case '*': a=3;break;
 case '/': a=3;break;
 case ')': a=4;break;
 } return a; } char precede(char a,char b){ int x,y; x=trust(a); y=trust(b); if(x==0&&y==0)return '='; if(x==1&&y==4)return '='; else if(x>y||x==y) return '>'; else return '<'; } char operate(char a,char theta,char b){ char r; switch(theta){ case '+':r=a+b-'0';break; case '-':r=a+'0'-b;break; case '*':r=(a-'0')*(b-'0')+'0';break; case '/':r=(a-'0')/(b-'0')+'0';break; } return r; } char way(){ stack *ch,*nb;char c,x,y,k,theta,a,b,l; ch=null;nb=null; 
 init(ch);push(ch,'#'); init(nb); printf("请输入算术表达式，#表示结束\n"); scanf("%c",&c);k=gettop(ch); while(c!='#'||k!='#'){ if(compare(c)==0){push(nb,c);scanf("%c",&c);} else{ l=precede(k,c); switch(l){ case '<':push(ch,c);scanf("%c",&c);k=gettop(ch);break; case '=':pop(ch);scanf("%c",&c);k=gettop(ch);break; case '>':theta=pop(ch);b=pop(nb);a=pop(nb); x=operate(a,theta,b);push(nb,x);k=gettop(ch);break; } }getchar(); }
 y=gettop(nb); return y; } 
 
main(){ char c; c=way(); printf("算术表达式结果为: %c",c); }

		自动登录	找回密码
密码			注-册-帐-号