编译原理 非递归预测分析法.doc

《编译原理 非递归预测分析法.doc》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、附：代码#include#include#include#includeusingnamespacestd;#definestacksize10#definestringsize20typedefstructsqst//定义分析栈{intdata[stacksize];inttop;//栈顶指针}sqstack;stringword1[]={"prgm","prgm'","expr","term","expr'","factor","term'","system_goal"};stringwor

2、d2[]={"#",";","+","*","(",")","NUM"};intmain(){voidout(sqstackst,stringstr,intsp,intk);//输出函数voidinit(intYy_pushtab[13][4],intYy_d[264][7]);//初始化分析栈Yy_d[]与Yy_pushtab[]voidstr_to_st1(stringstr,intst1[]);//对输入字符串的转换voidForeparser(sqstackst,intYy_pushtab[13][4],intYy_d[264][7],intst1[],st

3、ringstr);//预测分析法intYy_pushtab[13][4],Yy_d[264][7];intst1[stringsize];stringstr;sqstackst;st.top=-1;//分析栈的初始化st.top++;st.data[st.top]=263;//分析栈初始化"#"cout<<"请输入字符串:";cin>>str;cout<<"栈(符号)"<<"栈(数值)"<<"输入串"<<"What_to_do"<

4、tab,Yy_d,st1,str);return0;}voidout(sqstackst,stringstr,intsp,intk)//输出函数{intn,m=0;for(inti=0;i<=sp;i++)//输出栈(符号){if(st.data[i]<7){cout<

5、)cout<<"";for(i=0;i<=sp;i++)//输出栈(数字)cout<

6、初始化分析栈Yy_d[]与Yy_pushtab[]{inti,j;ifstreaminfile1("1.txt",ios::in);ifstreaminfile2("2.txt",ios::in);for(i=0;i<13;i++){for(j=0;j<4;j++){infile1>>Yy_pushtab[i][j];//cout<>Yy_d[i][j];//cout<

7、//cout<