c語言實現(xiàn)算符優(yōu)先語法分析

1、#includechar prog100,zhongjian100,shu500;char ch,zh;int syn,p,q,a,b,c,d; /p指向prog，q指向zhongjianint table88= 1,1,-1,-1,-1,1,-1,1, 1,1,-1,-1,-1,1,-1,1, 1,1,1,1,-1,1,-1,1, 1,1,1,1,-1,1,-1,1, -1,-1,-1,-1,-1,-1,-1,0, 1,1,1,1,0,1,0,1, 1,1,1,1,0,1,0,1, -1,-1,-1,-1,-1,0,-1,-1;/存儲算符優(yōu)先關系表，大于為1，小于或等于為-1，其它為0表示出

2、錯char zhan100;/數(shù)組棧int z,j;/z為棧頂指針,j為zhongjian數(shù)組指針void push(char ch)/入棧zhanz+=ch;void pop()/出棧z-;void putzhan()/打印棧內字符for(int i=0;i=j;m-)shuc+=zhongjianm;for(int i=z-1;i0;i-)shuc+=zhani;zh=ding2();if(zh=i) /當前比較為i,出棧一次pop(); else /當前比較不為i,出棧三次pop(); pop(); pop(); push(E); /歸約到E printf(歸約n);shuc+= ;sh

3、uc+=;shuc+=-;shuc+= ;elsesyn=-1;break;zh=ding();ch=zhongjianj;void loadch()/讀入所有字符串int i=0; printf(請輸入要進行算符優(yōu)先分析的字符串:n); do ch=getchar(); progi+=ch; while(ch!=#);void scaner()syn=1; ch=progp+; while(ch= |ch=n) ch=progp+; switch(ch) case+:zhongjianq+=+;break;case-:zhongjianq+=-;break; case*:zhongjianq

4、+=*;break; case/:zhongjianq+=/;break;case(:zhongjianq+=(;break; case):zhongjianq+=);break;casei:zhongjianq+=i;break; case#:zhongjianq+=#;syn=0;break; default: syn=-1;break; void saomiao()p=0;q=0; do scaner();if(syn=-1)printf(輸入符號有誤!n);break; while(syn!=0);void main()loadch();saomiao();if(syn=0)chu();analyse();printf(#Et#t結束n);if (syn=0)printf(該字符串可被文法識別n);printf(E);for(