自顶向下及语法分析递归下降法.docVIP

实验二：自顶向下的语法分析：递归下降法 1、实验目的：编制一个递归下降分析程序，实现对词法分析程序所提供的单词序列的语法检查和结构分析。 2、实验要求： 文法（教材199页） （1）把词法分析作为语法分析的子程序实现（5分） （2）独立的语法分析程序（4分） （3）输入串以‘#’结束，输出成功（success）或出错（error）、指出出错位置（行、列以及错误类型） #include iostream #include fstream #include string #include stdlib.h #define MAX 1024 using namespace std; string DataType[] = {int, bool, char, void}; string KeyWords[] = {if, else, do, while, for, break, in, continue, goto, switch, case, default, foreach, try, catch, finally, throw, return}; string Operator[] = {+, -, *, /, %, , ||, , , =, =, ==, !=, ^, , |, ~, , , =, +=, -=, *=, /=, %=, =, |=, ^=, =, =}; char Seperator[] = { , ., (, ), [, ], ;, {, }, ,, ?, :}; struct Identity { string value; int type; }; ifstream inFile(D:\\output.txt); int row = 1; Identity ID[10000]; int nWord = 0; void Expression() { string word; int syn; inFile word syn; if(syn == 71) { string tmp1; int tmp2; inFile tmp1 tmp2; if(tmp2 != 199) { if(tmp2 = 30 tmp2 71) { inFile tmp1 tmp2; if(tmp2 == 71) { inFile tmp1 tmp2; if(tmp2 != 199) cout error occurs in row row , miss \;\! endl; } else cout error occurs in row row , miss identity! endl; } else cout error occurs in row row , miss operator! endl; } } } int look(string value) { int i; for(i=0; inWord; i++) if(ID[i].value == value) return i; return -1; } void GrammerAnalyse() { string word; int syn; int i; while(!inFile.eof()) { i = 0; inFile word syn; if(word == #) row++; else { if(syn 0 syn 10) { string tmp1; int tmp2; inFile tmp1 tmp2; if(tmp2 == 71) { int index = look(tmp1); //ID[index].type = syn; inFile tmp1 tmp2; if(tmp2 != 199) { if(tmp1 == =) { Expression(); } else cout error occurs in row row , miss \;\! endl; } } else cout error occurs in row row , miss identity! endl; } else if(sy