正在加载图片...
ops[top]=(int)(ch) /*操作符弹栈 t return((char)(ops [top+1])) /*比较两个算符sym1,sym2的优先关系 char relation(syml, sym2) char chl[2] int ind [2] char re[7][7={{>,>,’<’,’<,<,’>’,”〉}, ”>,’〉’,〉’,’〉,’<,”〉,”》}, (”>,”〉’,”〉’,〉’,’<’,”〉,”〉}, ”,,, <’,’<,”<,<,<, chl[oj=syml for(i=0;i<=1;i++) switch(chl[il) case '+: ind[i]=0; break ind[i]=l: break case '*t: ind[i]=2; break; case/: ind[i]=3: break case(: ind[i]=4; break case#: ind[i]6: break default: printf ("error\n"): return(0')ops[top]=(int)(ch); } } /*操作符弹栈 float pop_ops() { top=top-1; return((char)(ops[top+1])); } /*比较两个算符 sym1,sym2 的优先关系 char relation(sym1,sym2) char sym1,sym2; { int i; char chl[2]; int ind[2]; char re[7][7]={ {'>','>','<','<','<','>','>'}, {'>','>','<','<','<','>','>'}, {'>','>','>','>','<','>','>'}, {'>','>','>','>','<','>','>'}, {'<','<','<','<','<','=',' '}, {'>','>','>','>',' ','>','>'}, {'<','<','<','<','<',' ','='}}; chl[0]=sym1; chl[1]=sym2; for (i=0;i<=1;i++) { switch(chl[i]) { case '+': ind[i]=0;break; case '-': ind[i]=1;break; case '*': ind[i]=2;break; case '/': ind[i]=3;break; case '(': ind[i]=4;break; case ')': ind[i]=5;break; case '#': ind[i]=6;break; default:printf("error\n");return('0'); }
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有