编译原理实验.doc

实验报告一一、实验名称 递归下降分析法二、实验目的1、 掌握递归下降分析法的基本原理2、 掌握递归下降分析程序的构造方法三、实验要求3、 理解递归下降语法分析方法的主要原理4、 理解递归下降分析法对文法的要求5、 熟练掌握文法变换算法四、 程序代码#include stdafx.h#include #include#include#includechar a50 ,b50,d200,e10; char ch;int n1,i1=0,flag=1,n=5;int E(); int E1(); int T(); int G(); int S(); int F();void input();void input1();void output();void main() int f,p,j=0; char x; d0=E; d1=; d2=; d3=T; d4=G; d5=#; printf(请输入字符串(长度TGt); flag=1; input(); input1(); f=T(); if (f=0) return(0); t=G(); if (t=0) return(0); else return(1); int E() int f,t; printf(E-TGt); e0=E;e1=;e2=;e3=T;e4=G;e5=#; output(); flag=1; input(); input1(); f=T(); if (f=0) return(0); t=G(); if (t=0) return(0); else return(1); int T() int f,t; printf(T-FSt); e0=T;e1=;e2=;e3=F;e4=S;e5=#; output(); flag=1; input(); input1(); f=F(); if (f=0) return(0); t=S(); if (t=0) return(0); else return(1); int G() int f; if(ch=+) bi1=ch; printf(G-+TGt); e0=G;e1=;e2=;e3=+;e4=T;e5=G;e6=#; output(); flag=0; input();input1(); ch=a+i1; f=T(); if (f=0) return(0); G(); return(1); printf(G-t); e0=G;e1=;e2=;e3=;e4=#; output(); flag=1; input();input1(); return(1);int S() int f,t; if(ch=*) bi1=ch;printf(S-*FSt); e0=S;e1=;e2=;e3=*;e4=F;e5=S;e6=#; output(); flag=0; input();input1(); ch=a+i1; f=F(); if (f=0) return(0); t=S(); if (t=0) return(0); else return(1); printf(S-t); e0=S;e1=;e2=;e3=;e4=#; output(); flag=1; ai1=ch; input();input1(); return(1);int F() int f; if(ch=() bi1=ch;printf(F-(E)t); e0=F;e1=;e2=;e3=(;e4=E;e5=);e6=#; output(); flag=0; input();input1(); ch=a+i1; f=E(); if (f=0) return(0); if(ch=) bi1=ch;printf(F-(E)t); flag=0;input();input1(); ch=a+i1; else printf(errorn); return(0); else if(ch=i) bi1=ch;printf(F-it); e0=F;e1=;e2=;e3=i;e4=#; output(); flag=0;input();input1(); ch=a+i1; else printf(errorn);return(0); return(1);void input() int j=0; for (;j=i1-flag;j+) printf(%c,bj); printf(tt); printf(%ctt,ch); void input1() int j; for (j=i1+1-flag;j;dn+2=#;n=n+2;i=n; i=i-2; while(di!=&i!=0) i=i-1; i=i+1; while(di!=e0) i=i+1; q=i; m=q;k=q; while(dm!=) m=m-1; m=m+1; while(m!=q) dn=dm;m=m+1;n=n+1; dn=#; for(j=3;ej!=#;j+) dn=ej; n=n+1; k=k+1; while(dk!=) dn=dk;n=n+1;k=k+1; dn=#;五、 实验结果实验报告二一、实验名称 LL1文法分析器二、实验内容#include#include#include#include#include#define M 22#define N 30using namespace std;using std:string;/产生式的数据结构struct generatypechar str100;int length;int left;struct generatype tableMN;/堆栈的数据结构struct stacktypestring content200;int top;struct stacktype STACK;/编码表的数据结构struct symboltypestring symbol;int id;struct symboltype bianma100;int toknum=0,fnum=0;/token表及符号表长度int tokc100,tokn100;/token表中的内容string vt30,vn22;/终结符及非终结符数组string inputs657;void init()FILE *fp1;int s=0,p=0;fp1=fopen(ftok.txt,r);while(!feof(fp1)fscanf(fp1,%d%d,&tokctoknum,&tokntoknum);toknum+;toknum=toknum-2;/初始化终结符vt0=id;vt1=;vt2=;vt3=while;vt4=if;vt5=int;vt6=func;vt7=else;vt8=,;vt9=true;vt10=(;vt11=);vt12=!;vt13=&;vt14=|;vt15=;vt16=;vt17=;vt18=;vt19=const;vt20=+;vt21=*;vt22=false;vt23=then;vt24=do;vt25=;vt26=;vt27=;vt28=;vt29=$;/$为开始符号/初始化编码表bianma0.symbol=func;bianma0.id=1;bianma1.symbol=while;bianma1.id=2;bianma2.symbol=do;bianma2.id=3;bianma3.symbol=if;bianma3.id=4;bianma4.symbol=then; bianma4.id=5;bianma5.symbol=else; bianma5.id=6;bianma6.symbol=true; bianma6.id=7;bianma7.symbol=false; bianma7.id=8;bianma8.symbol=const; bianma8.id=9;bianma9.symbol=id;bianma9.id=10;bianma10.symbol=;bianma10.id=11;bianma11.symbol=;bianma11.id=12;bianma12.symbol=;bianma12.id=13;bianma13.symbol=,;bianma13.id=14;bianma14.symbol=;bianma14.id=15;bianma15.symbol=!;bianma15.id=16;bianma16.symbol=&;bianma16.id=17;bianma17.symbol=|;bianma17.id=18;bianma18.symbol=;bianma19.id=20;bianma20.symbol=;bianma21.id=22;bianma22.symbol=;bianma22.id=23;bianma23.symbol=;bianma23.id=24;bianma24.symbol=+;bianma24.id=25;bianma25.symbol=*;bianma25.id=26;bianma26.symbol=(;bianma26.id=27;bianma27.symbol=);bianma27.id=28;bianma28.symbol=int;bianma28.id=29;/初始化非终结符vn0=K;vn1=L;vn2=A;vn3=S;vn4=U;vn5=W;vn6=C;vn7=F;vn8=T;vn9=D;vn10=G;vn11=B;vn12=H;vn13=I;vn14=J;vn15=M;vn16=N;vn17=E;vn18=P;vn19=Q;vn20=R;vn21=V;/初始化预测分析表for(s=0;sM;s+)for(p=0;pN;p+)tablesp.left=0;strcpy(tablesp.str,err);strcpy(table06.str,func id L);strcpy(table10.str,SA);strcpy(table11.str,SA);strcpy(table13.str,SA);strcpy(table14.str,SA);strcpy(table15.str,SA);strcpy(table20.str,SA);strcpy(table21.str,SA);strcpy(table22.str,#);strcpy(table23.str,SA);strcpy(table24.str,SA);strcpy(table25.str,SA);strcpy(table30.str,id =E;);strcpy(table31.str,L);strcpy(table33.str,US);strcpy(table34.str,CSF);strcpy(table35.str,TD;);strcpy(table43.str,WBdo);strcpy(table53.str,while);strcpy(table64.str,ifBthen);strcpy(table77.str,elseS);strcpy(table85.str,int);strcpy(table90.str,idG);strcpy(table108.str, idG);strcpy(table1025.str,#);strcpy(table110.str,IH);strcpy(table119.str,IH);strcpy(table1110.str,IH);strcpy(table1112.str,IH);strcpy(table1122.str,IH);strcpy(table1211.str,#);strcpy(table1214.str,|IH);strcpy(table1223.str,#);strcpy(table1224.str,#);strcpy(table130.str,MJ);strcpy(table139.str,MJ);strcpy(table1310.str,MJ);strcpy(table1312.str,MJ);strcpy(table1322.str,MJ);strcpy(table1411.str,#);strcpy(table1413.str,&MJ);strcpy(table1414.str,#);strcpy(table1423.str,#);strcpy(table1424.str,#);strcpy(table150.str,idNE);strcpy(table159.str,true);strcpy(table1510.str,(B);strcpy(table1512.str,!B);strcpy(table1522.str,false);strcpy(table1615.str,);strcpy(table1616.str,=);strcpy(table1617.str,=);strcpy(table1618.str,);strcpy(table1626.str,=);strcpy(table1627.str,=);strcpy(table1628.str,);strcpy(table170.str,QP);strcpy(table1710.str,QP);strcpy(table1719.str,QP);strcpy(table1811.str,#);strcpy(table1813.str,#);strcpy(table1814.str,#);strcpy(table1820.str,+QP);strcpy(table1823.str,#);strcpy(table1824.str,#);strcpy(table1825.str,#);strcpy(table190.str,VR);strcpy(table1910.str,VR);strcpy(table1919.str,VR);strcpy(table2011.str,#);strcpy(table2013.str,#);strcpy(table2014.str,#);strcpy(table2020.str,#);strcpy(table2021.str,*VR);strcpy(table2023.str,#);strcpy(table2024.str,#);strcpy(table2025.str,#);strcpy(table210.str,id);strcpy(table2110.str,(E);strcpy(table2119.str,const);for(s=0;sM;s+)for(p=0;pN;p+)tablesp.length=strlen(tablesp.str);fclose(fp1);return;/进栈void push(stacktype & sta,string s)sta.contentsta.top=s;sta.top+;return;/出栈void pop(stacktype & sta)sta.contentsta.top - 1=;sta.top-;return;/判断是否为非终结符int ISvn(string s)int i=0;for(i=0;iM;i+)if(s=vni)return i;return -1;/判断是否为终结符int ISvt(string s)int i=0;for(i=0;iN;i+)if(s=vti)return i;return -1;/token表中的内容存进输入数组void input()int a,b;for(a=0;a=toknum;a+)if(tokca=10)inputsa=id;elsefor(b=0;b=28;b+)if(tokca=bianmab.id)inputsa=bianmab.symbol;break;inputstoknum + 1 = $;/分析表中的内容进栈void puts(int m,int n)int i=tablemn.length;/生成式长度char str10,temp10;int j=0,num=9,t;string s = ;i=i-1;if(strcmp(tablemn.str,#)=0)cout vnm#=0)num = 9;if(isupper(tablemn.stri)s = ;s.append(tablemn.str,i,1);push(STACK, s);i-;else if(tablemn.stri = )num = 9;i-;else dostrnum=tablemn.stri;i-;num-;while(tablemn.stri!= &!isupper(tablemn.stri) & i =0);num+;j = 0;t = num;strcpy(temp,);while(t=9)tempj=strt;j+;t+;s = ;s.append(temp,0,j);push(STACK,s);cout vnmtablemn.strendl;/语法分析void analyse(void)int first=0;int k,t;string x,a;push(STACK,$);/$进栈push(STACK,K);/开始符号进栈input(); /输入字符串a=inputsfirst;/当前输入字符x=STACK.contentSTACK.top-1;/栈顶k=ISvn(x);/行值t=ISvt(a);/列值while(x!=$)/栈顶为终结符if(ISvt(x)!=-1)if(x=a)pop(STACK);x=STACK.contentSTACK.top-1;first+;a=inputsfirst;/栈顶为非终结符elsek=ISvn(x);/分析表行值t=ISvt(a);/分析表列值pop(STACK);/释放栈顶puts(k,t);/生成式进栈x=STACK.contentSTACK.top-1;return;void main(void)init();analyse();return; 1 -1 10 1 11 -1 4 -1 10 2 19 -1 10 3 18 -1 8 -1 5 -1 10 2 15 -1 10 3 25 -1 10 2 13 -1 6 -1 10 2 15 -1 10 2 26 -1 10 3 13 -1 12 -1三、实验结果实验报告三一、 实验名称 LR文法分析器二、 实验内容#include stdafx.h#include #include #include #include using namespace std ;struct code_valchar code;char val20;const char *p= /产生式SE,EE+T,ET,TT*F,TF,F(E),Fi ;const char TNT =+*()i#ETF; /LR分析表列的字符const int M9 = /LR分析表数字化，列字符+*()i#ETF用数字标识。 0, 0, 4, 0, 5,0, 1, 2, 3, /0表示出错，s4用表示。 6, 0, 0, 0, 0,99, /Acc用表示-2, 7, 0,-2, 0,-2, /r2用-2表示-4,-4, 0,-4, 0,-4, 0, 0, 4, 0, 5, 0, 8, 2, 3,-6,-6, 0,-6, 0,-6, 0, 0, 4, 0, 5, 0, 0, 9, 3, 0, 0, 4, 0, 5, 0, 0, 0,10, 6, 0, 0,11,-1, 7, 0,-1, 0,-1,-3,-3, 0,-3, 0,-3,-5,-5, 0,-5, 0,-5;int col(char); /列定位函数原型void calculat(int n ,int top );int num_val1000 = 0;char ori_val1000 = - ; /这 wvalvoid main()int state50=0; /状态栈初值char symbol50=#; /符号栈初值int top=0; /栈顶指针初值/ ofstream cout(par_r.txt); /语法分析结果输出至文件par_r.txtifstream cin(lex_r.txt); / lex_r.txt存放词法分析结果，语法分析器从该文件输入数据。struct code_val t; /结构变量，存放单词二元式。cint.codet.val; /读一单词int action;int i,j=0; /输出时使用的计数器，并非必要。coutstept状态栈t符号栈t输入符号t;coutwvaltt.valendl;/输出标题并非必要。do coutj+)t; /输出step，并非必要。 for(i=0;i=top;i+)coutstatei;coutt;/输出状态栈内容，并非必要。 for(i=0;i=top;i+)coutsymboli; /输出符号栈内容，并非必要。 couttt.codet;coutt; for(i=0;i=top;i+) coutori_vali ; /输出当前输入符号（单词种别），并非必要。 couttt; for(i=0;i=top;i+) if(num_vali