预测分析算法的设计与实现

预测分析算法的设计与实现删除预测分析算法的设计与实现程序代码:#include#includeefineefineefineefineefineefineMaxRuleNum8MaxVnNum5MaxVtNum5MaxStackDepth20MaxPLength20MaxStLength50{pRNode/*产生式右部结构*/rCursor;pRNodenext;{pNoderLength;/*右部长度*/structpRNode*rHead;/*右部结点头指针*//*非终结符集*/+Vn/*非终结符集*/+vnNum/*终结符集*/+Vt/*终结符集*/+vtNumpNodeP[MaxRuleNum];PNum;buffer[MaxPLength+1];charch;charst[MaxStLength];/*要分析的符号串*/{oidoiddcollectNodenVt;ShowAT();/*输出分析表*/Identify(char*st);ShowStack();Pop();Push(intr);{main()todo,ch;InputVn();InputVt();InputPgetchar();FirstFollow();ShowCollect(first);printf("所得followShowCollect(follow);CreateAT();ShowAT();todo=while('y'printf("\ntodo=while('y'==todo)getchar();!=todo&&{printf("\n(y/n)");todo=getchar();}/n):");if('y'==todo){inti;printf("请输入符号串(以#结束):");ch=getchar();i=0;while('#'!=ch&&i<MaxStLength){st[i]=ch;}}}getchar();}void{vnNum===for(i=0;i<=MaxVnNum;i++)Vn[i]='\0';for(i=0;i<=MaxVtNum;i++)Vt[i]='\0';for(i=0;i<MaxRuleNum;i++){P[i].lCursorP[i].rHeadP[i].rLength===NULL;NULL;}PNum=0;for(i=0;i<=MaxPLength;i++)}-1;}intIndexCh(charch){intn;n=0;/*isVn*/while(ch!=Vn[n]&&'\0'returnnreturnn=while(chreturnreturn0;+n;*isVt[n]Vt[n])Vt*/&&}/*输出Vn或Vt的内容*/ShowChArray(charShowChArray(char*collect){intk=0;while('\0'!=collect[k]){printf("%c",collect[k++]);}printf("\n");}/*输入非终结符*/voidInputVn(){{Vn[n++]='\0';}n=0;while(('#'!=ch)&&(n{if(''!=ch&&'\n'1==IndexCh(ch)){<Vn[n])Vt[n])MaxVnNum))ch&&-Vn[n++]=ch;vnNum++;}ch=getchar();}Vn[n]='#';/*以"#"标志结束用于判断长度是否合法*/k=n;if('#'!=ch){if('#'!=(ch=getchar())){while('#'!=(ch=getchar()));ninErr=1;continue;}{}scanf("%c",&ch);}if('n'==ch){inErr=1;}{inErr=0;}}}/*输入终结符*/{tVt==n,k;charch;while(inErr){printf("以#号结束:\n");n=='/*初始化数组*/while(n<MaxVtNum){Vt[n++]='\0';}n=0;while(('#'!=ch)&&(n<MaxVtNum)){if(''!=ch&&'\n'!=ch&&-1==IndexCh(ch)){Vt[n++]=ch;vtNum++;}ch=getchar();}Vt[n]='#';k=n;if('#'!=ch){if('#'!=(ch=getchar())){while('#'!=(ch=getchar()));ninErr=1;continue;}}Vt[k]='\0';ShowChArray(Vt);ch='';while('y'{{&&'n'!=ch)}scanf("%c",&ch);}if('n'==ch){inErr=1;}{inErr=0;}}}/*产生式输入*/voidInputP(){charch;inti=0,n,num;scanf("%d",&num);PNum=num;getchar();/*消除回车符*/printf("\n请输入文法的%d个产生式,并以回车分隔每个产生式：",num);printf("\n");while(i<num){/*初始化*/for(n=0;n<MaxPLength;n++)buffer[n]='\0';/*输入产生式串*/ch='';n=0;while('\n'!=(ch=getchar())&&n<MaxPLeng{if(''!=ch)buffer[n++]=ch;}buffer[n]='\0';kPbuffer{pRNode*pt,*qt;P[i].lCursor=IndexCh(buffer[0]);pt=(pRNode*)malloc(sizeof(pRNode));pt->rCursor=IndexCh(buffer[3]);pt->next=NULL;P[i].rHead=pt;n=4;while('\0'!=buffer[n]){qt=(pRNode*)malloc(sizeof(pRNode));qt->rCursor=IndexCh(buffer[n]);qt->next=NULL;pt->next=qt;pt=qt;n;}P[i].rLength=n-3;}}}/*判断产生式正确性*/boolCheckP(char*st){intn;if(100>IndexCh(st[0]))returnreturnreturn{if(-1return}return}!=st[1])!=st[2])=3;'\0'!===IndexCh(st[n]))n++)voidFirst(intU){inti,j;for(i=0;i<PNum;i++){if(P[i].lCursor==U){structpRNode*pt;pt=P[i].rHead;j=0;while(j<P[i].rLength){if(100>pt->rCursor){AddFirst(U,pt->rCursor);break;}{if(NULL==first[pt->rCursor-100]){First(pt->rCursor);}AddFirst(U,pt->rCursor);if!HaveEmpty(pt->rCursor)){break;}{}}}=pt->next;P[i].rLength)/*当产生式右部都能推出空时*/AddFirst(U,-1);}}/*加入id{t{first集*/AddFirst(intU,intnCh)collectNode*pt,*qt;ch;/*用于处理Vn*/=NULL;=NULL;<100)=first[U-100];while(NULL{ifptnVtbreak;{====}}{==t====tpt->next;==pt)(structcollectNode*)malloc(sizeof(structcollectNodept->nVtpt->nextif(NULL{}{qt->nextpt=}}{pt=while(NULLch=if(-1=nCh;=NULL;==first[U-100])-100]=pt;=pt;/*qt指向first集的最后一个元素*/pt->next;first[nCh-100];!=pt)pt->nVt;!=ch){AddFirst(U,ch);}pt=pt->next;}}}bool{HaveEmpty(intnVn)return<100)collectNodept;pt=first[nVn-100];while(NULL!=pt){if(-1==pt->nVt)returntrue;pt=pt->next;}returnfalse;}d{Follow(intpRNodeV;if(100==V)/*当为初始符时*/AddFollow(V,-1,0);for(i=0;i<PNum;i++){pt=P[i].rHead;while(NULL!=pt&&pt->rCursor!=V)pt=pt->next;if(NULL!=pt){pt=pt->next;if(NULL==pt){if(NULL==follow[P[i].lCursor-100]&&P[i].lCursor!=V){Follow(P[i].lCursor);}AddFollow(V,P[i].lCursor,0);}{while(NULL!=pt&&HaveEmpty(pt->rCursor)){AddFollow(V,pt->rCursor,1);pt=pt->next;}if(NULL==pt){if(NULL==follow[P[i].lCursor-100]&&P[i].lCursor!=V){Follow(P[i].lCursor);}AddFollow(V,}{AddFollow(V,}}}}}P[i].lCursor,0);pt->rCursor,1);voidAddFollow(intV,intnCh,intkind){structcollectNode*pt,*qt;{===while(NULL{ifptnVtbreak;{====}}{pt=pt->nVtpt->nextNULL;NULL;100)/*为终结符时*/follow[V-100];!=pt)==nCh)tpt->next;==pt)(structcollectNode*)malloc(sizeof(structcollectNode=nCh;=NULL;==follow[V-100]){follow[V}{qt->next-=t=pt;/*qt指向follow集的最后一个元素*/}pt=pt->next;}}{if(0==kind){pt=follow[nCh-100];while(NULL!=pt){ch=pt->nVt;AddFollow(V,ch,pt=pt->next;}}{pt=first[nCh-100];while(NULL!=pt){ch=pt->nVt;if(-1!=ch){AddFollow(V,ch,1);}pt=pt->next;}}}}/*输出first或follow集*/void{ShowCollect(structcollectNode**collect)inti;structcollectNode*pt;i=0;while(NULL!=collect[i]){pt=collect[i];printf("\n%c:\t",Vn[i]);while(NULL!=pt){if(-1!=pt->nVt){printf("%c",Vt[pt->nVt]);}printf("#");pt=pt->next;}}printf("\n");/*计算oid{ifirst和follow*/FirstFollow()=0;while('\0'{First(100}i=while('\0'{==+==Vn[i])first[i])Vn[i])follow[i]){Follow(100+i);}}/*构造预测分析表*/{{CreateAT()pRNode*pt;collectNode*ct;=0;i<=P[i].rHead;while(NULL!=pt&&{ct=first[pt->rCursorwhile(NULL!=ct){if(-1!=ct->nVt)analyseTable[P[i].lCursor-ct=ct->next;}pt=pt->next;}if(NULL==pt){ct=follow[P[i].lCursorwhile(NULL!=ct){if(-1!=ct->nVt)analyseTable[P[i].lCursor-analyseTable[P[i].lCursor-ct=ct->next;}}PNum;i++)HaveEmpty(pt->rCursor))--100][ct->nVt]=i;--100][ct->nVt]=i;100][vtNum]=i;if(100<=pt->rCursor)/*不含空的非终结符*/{ct=first[pt->rCursor-100];while(NULL!=ct){analyseTable[P[i].lCursor-100][ct->nVt]=i;ct=ct->next;}}else/*终结符或者空*/{if(-1==pt->rCursor){ct=follow[P[i].lCursor-100];while(NULL!=ct){if(-1!=ct->nVt)analyseTable[P[i].lCursorelse/*当含有#号时*/analyseTable[P[i].lCursorct=ct->next;}}else/*为终结符*/{analyseTable[P[i].lCursor}}}}}/*输出分析表*/ShowAT()ShowAT()printf("\t|\t");for(i=0;i<=-=-=-Num=--100][pt->rCursor]=i;vtNum;i++){printf("%c\t",}printf("#\t\n");Vt[i]);printf("---\t|---\t");for(i=0;i<=vtNum;i++)printf("---\t");printf("\n");for(i=0;i<vnNum;i++){printf("%c\t|\t",Vn[i]);for(j=0;j<=vtNum;j++){if(-1!=analyseTable[i][j])printf("R(%d)\t",analyseTable[i][j]);printf("error\t");}printf("\n");}}voidIdentify(char*st){intcurrent,step,r;/*r表使用的产生式的序号*/snstprintf("步骤\t分析符号栈\t当前指示字符\t使用产生式序号\n");step=0;current=0;printf("%d\t",step);ShowStack();printf("\t\t%c\t\t--\n",st[current]);while('#'{!=st[current])>analyseStack[topAnalyse]){if(analyseStack[topAnalyse]==IndexCh(st[current])){Pop();current++;printf("%d\t",ShowStack();printf("\t\t%c\t\t}n,rent{talyseStacktreturn;}}{r/*当为非终结符时*/=analyseTable[analyseStack[topAnalyse]-][IndexCh(st[current])];if(-1!=r){Push(r);printf("%d\t",step);ShowStack();printf("\t\t%c\t\t%d\n",st[current],}{return;}}}if('#'==st[current]){if(0==topAnalyse&&'#'{==st[current])printf