正规文法-正规式.docVIP

由正规文法构造正规式 年级＿＿＿＿＿＿＿ 专业＿＿＿＿＿＿＿＿ 学号＿＿＿＿＿＿＿＿ 姓名＿＿＿＿＿＿＿＿＿＿ 一、实验实验…/9，由非终结符数字所产生的字符串集合与正则表达式0/1/2/…/9所定义的字符串集合是相同的。正则集Φ，它对应一个不包含任何句子的语言，引进的目的主要是为了理论上的完备性。 三、实验代码： #include stdio.h #include string #include vector #includeiostream using namespace std; struct Rule { string left; //规则左部,因为输入的为2型文法, string right; //规则右部 }; struct RuleData { string left; vector string right; }; class Grammar { private: vectorRule grammar; //文法 Rule rule; //规则 vectorstring Dleft; RuleData ruledata; public: Grammar(){} ~Grammar(){} void ChangeInput (string input); //输入分析 void Show(); // void DataChange (int C); //存储结构转换 vectorRuleData grammardata; }; void Grammar::ChangeInput (string input) //扫描字符串,遇到-停止, { //并跳两格 int help1 = 0; rule.left.erase(); rule.right.erase(); for (int i = 0; i int (input.size()); i++) { if (input[i] == -) { help1 = i; break; } rule.left += input[i]; } if (help1 != 1) { cout不符合要求!!; exit(0); } help1 = help1 + 2; for (int j = help1; j int ( input.size()); j++) { rule.right += input[j]; } grammar.push_back(rule); } void Grammar::DataChange (int C) { int i,j; if (C == 0) //简单-复杂 { int l = 0; grammardata.clear(); ruledata.left.erase(); ruledata.right.clear(); ruledata.left = grammar[0].left; ruledata.right.push_back (grammar[0].right); grammardata.push_back (ruledata); for (i = 1; i int (grammar.size()); i++) //存储转换 { for (j = 0; j int (grammardata.size()); j++) { if (grammar[i].left == grammardata[j].left) { grammardata[j].right.push_back (grammar[i].right); l = 1; break; } } if (l == 0) { ruledata.left.erase(); ruledata.right.clear(); ruledata.left = grammar[i].left; ruledata.right.push_back (grammar[i].right); grammardata.push_back (ruledata); } l = 0; } } if (C == 1) //复杂-简单 { grammar.clear(); for (i = 0; i int (grammardata.size());