正规文法转换成正规式(c++).docVIP

#include iostream #include set #include map #include string #include algorithm using namespace std; multimapchar, string production; setchar unFinal; setchar final; char S; void Input() { char ch; string str; cout非终结符（以 0 结尾）： ; while(cinch ch!=0) unFinal.insert(ch); cout终结符 （以 F 结尾）： ; while(cinch ch!=F) final.insert(ch); cout开始符: ; cinS; cout产生式 (以 0 0 结尾):endl; while(cinchstr ch!=0) production.insert(make_pair(ch, str)); } string solve(char ch) { string str((); string re(); string ch_1[8]; string str1[8],str2[8]; int len,i,j,flag=10,strlen,sslen,lslen,num=0; multimapchar, string::iterator iter = production.find(ch); int n = production.count(ch); for(i=0; in; i++, ++iter) { len=iter-second.size(); str1[i].append(iter-second); str2[i]=str1[i]; str2[i].replace(1,1,|); ch_1[i]=iter-second.substr(len-1); } for(i=0; in; i++) if(ch_1[i]=Ach_1[i]=Z) { for( j=i+1;jn;j++) if(ch_1[i]==ch_1[j]) { flag=i; str.push_back((); str.append(str2[i].substr(0)); str.append(str2[j].substr(0)); for( ;jn;j++) { str1[j].assign(str1[j+1]); ch_1[j].assign(ch_1[j+1]); } } if(i==flag) { strlen=str.size(); str.replace(strlen-1,1,)); str.append(ch_1[i]); str.push_back(|); } else { str.append(str1[i].substr(0)); if(n=2)//相同左部产生式个数大于等于2个时，才输出| str.push_back(|); } } sslen=str.size(); for(i=0; in; i++) if(ch_1[i]A||ch_1[i]Z) num++; if(num=2) str.push_back((); for(i=0; in; i++) if(ch_1[i]A||ch_1[i]Z) { str.append(ch_1[i]); if(i!=n-1) str.push_back(|); } if(num=2) str.push_back()); lslen=str.size(); for(int i=0; istr.size(); i++) { if(unFinal.find(str[i])!=unFinal.end()) //str[i]是非终结符 if(str[i] != ch) { //是其他非终结符 re = solve(str[i]); str.replace(i, 1, re); i += re.size()-1;