预测分析法编译原理实验.docx

实验代码：#include#include#include#includechar *pro6= Te, ,Te, , , ,+Te, , ,$,$, Ft, ,Ft, , , ,$,*Ft,$,$, i, ,(E), , ;#define maxsize 50typedef char DateType;typedef struct DateType datamaxsize; int top;SeqStack;/定义栈int i,now=0;DateType e,string1maxsize;void InitSt(SeqStack* L)/初始化 L-top=0;char push(SeqStack* L,DateType e)/入栈 if(L-top=maxsize) printf(nttt栈已满!); return 0; L-dataL-top=e; L-top+; return 1;char pop(SeqStack* L)/出栈 i=L-top; e=L-datai-1; if(L-top=0) printf(nttt栈为空!); return 0; L-top-; return 1;DateType getTop(SeqStack* L)/取栈顶元素 DateType x; i=L-top; if(L-top=0) printf(nttt栈为空!); else i-; x=L-datai; return x;void display(SeqStack* L)/显示元素 if(L-top=0) printf(nttt栈为空!); else for(i=0;itop;i+) printf(%c,L-datai); void display1() int j; for(j=now;) printf(%c,string1j); j+; if(string1j= 0) break; int row(DateType x) /列匹配 switch(x) casei:return 0;break; case+:return 1;break; case*:return 2;break; case(:return 3;break; case):return 4;break; case#:return 5;break; default:return -1; int col(DateType x)/行匹配 switch(x) caseE:return 0;break; casee:return 1;break; caseT:return 2;break; caset:return 3;break; caseF:return 4;break; default:return -1; void production1(DateType b,DateType t) int x,y; x=col(b); y=row(t); printf(%c - %s ,b,proxy); void match(SeqStack* L) char ch; ch =getTop(L); printf(%c 匹配,ch); pop(L);void tuidao(SeqStack *L) DateType stackbot,*p; stackbot =getTop(L); p=&string1now; if( *p =stackbot) match(L); else production1(stackbot,*p); int main() int time,x,y,b; DateType X,a,str5; SeqStack L; time = 0; char c= ; InitSt(&L);/初始化栈 push(&L,#); push(&L,E); printf(请输入字符串：); gets(string1);one: X =getTop(&L); a =string1now; b = row(X); if( b =0 |b=1 | b=2 | b=3 | b=4 ) goto two; else goto three;two: if ( X = a) time+; printf(%dt,time); display(&L); putchar(t); display1(); putchar(t); tuidao(&L); putchar(10); now+; goto one; else goto error1;three: if(X = #) if(X!= a) goto error1; else goto five; else goto fou;fou: x = col(X); y = row(a); if(strcmp(proxy,c)=0) goto error1; else time+; printf(%dt,time); display(&L); putchar(t); display1(); putchar(t); tuidao(&L); putchar(10); strcpy(str,proxy); pop(&L); int n; for(n=strlen(str);n0;n-) push(&L,strn-1); if(getTop(&L)= $) pop(&L); goto one; five: time+; printf(%dt,time); disp