编译原理实验--递归子素材.docx

编译原理实验姓名：尹莉学号：业：13级网络工程语法分析器1实现方法描述所给文法为G【E】； E-TE’ E’-+TE’|空 T-FT’ T’-*FT’|空 F-i|(E)递归子程序法：首先计算出五个非终结符的first集合follow集，然后根据五个产生式定义了五个函数。定义字符数组vocabulary来存储输入的句子，字符指针ch指向vocabulary。从非终结符E函数出发，如果首字符属于E的first集，则依次进入T函数和E’函数，开始递归调用。在每个函数中，都要判断指针所指字符是否属于该非终结符的first集，属于则根据产生式进入下一个函数进行调用，若first集中有空字符，还要判断是否属于该非终结符的follow集。以分号作为结束符。实现代码头文件 shiyan3.h#includeiostream#includecstdio#includestringusing namespace std;#define num 100char vocabulary[num];char *ch;void judge_E();void judge_EE();void judge_T();void judge_TT();void judge_F();源文件#includeshiyan3.hvoid judge_E(){if(*ch==;){cout该句子符合此文法！endl;int a=0;cout按1结束程序endl;cina;if(a==1)exit(0);}elseif(*ch==(||*ch==i){judge_T(); judge_EE(); }else {cout该句子不匹配此文法！endl; int a=0; cout按1结束程序endl; cina; if(a==1)exit(0); }}void judge_EE(){if(*ch==;){cout该句子符合此文法！endl;int a=0;cout按1结束程序endl;cina;if(a==1)exit(0);}if(*ch==+){ch++;judge_T();judge_EE();}elseif(*ch==#||*ch==))return;else{cout该句子不匹配此文法！endl; int a=0; cout按1结束程序endl; cina; if(a==1)exit(0);}}void judge_T(){if(*ch==;){cout该句子符合此文法！endl;int a=0;cout按1结束程序endl;cina;if(a==1)exit(0);}if(*ch==(||*ch==i){judge_F();judge_TT();}else{cout该句子不匹配此文法！endl;int a=0;cout按1结束程序endl;cina;if(a==1) exit(0);}}void judge_TT(){if(*ch==;){cout该句子符合此文法！endl;int a=0;cout按1结束程序endl;cina;if(a==1)exit(0);}if(*ch==*){ch++;judge_F();judge_TT();}else if(*ch==)||*ch==+||*ch==#)return;else{cout该句子不匹配此文法！endl; int a=0; cout按1结束程序endl; cina; if(a==1)exit(0);}}void judge_F(){if(*ch==;){cout该句子符合此文法！endl;int a=0;cout按1结束程序endl;cina;if(a==1)exit(0);}if(*ch==(){ch++;judge_E();if(*ch==)){ch++;}else{cout该句子不匹配此文法！endl; int a=0; cout按1结束程序endl; cina; if(a==1)exit(0);}}elseif(*ch==i){ch++;//cout*ch;}else {cout该句子不匹配此文法！endl; int a=0; cout按1结束程序endl; cina; if(a==1)exit(0);}}void main(){//char *ch;cout**********************欢迎使用语法分析器************************endl;cout请输入一个句子：endl;cin.getline(vocabulary,15);ch=vocabulary;judge_