有穷自动机与正规文法转换编译原理源代码

#include

using namespace std;

int main()

{int n, m;

//n为自动机状态的总数目

//m为自动机终结符的数目

int n_midd_stat, n_final_stat;

//n_midd_stat为中间状态的数目

//n_final_stat为终态的数目

cout << "请输入自动机共有的状态数目："; cin >> n;

char* stat = new char[n];

cout << "请输入开始状态：";

cin >> stat[0];

cout << "请输入中间状态的个数：";

cin >> n_midd_stat;

cout << "请输入分别中间状态：" << endl; for(int i1 = 0; i1 < n_midd_stat; i1++) {cin >> stat[i1 + 1];

}

n_final_stat = n - n_midd_stat - 1;

cout << "最后分别输入终态：" << endl;

for(int i2 = 0; i2 < n_final_stat; i2++)

{cin >> stat[n_midd_stat + 1 + i2];

}

cout << "请输入终结符的数目：";

cin >> m;

char* terminal = new char[m];

cout << "请分别输入终结符：" << endl;

for(int i3 = 0; i3 < m; i3++)

{

cin >> terminal[i3];

}

cout << endl;

//构造自动机

int i, j,k;

char** f = new char*[n];

for(k=0;k

{

f[k]=new char[n];

}

cout << "构造自动机：" << endl;

for(i = 0; i < n; i++)

{for(j = 0; j < n; j++)

{cout << "状态" << stat[i] << "能否直接推出状态"

<< stat[j];

if((i == 0) && (j == 0))

{

cout << "? (若能则输入相应的终结符，否则输入\"0\")";

}

else

{

cout << "?";

}

cin >> f[i][j];

}

}

cout << endl;

//转换成对应的文法

cout << "由此自动机转换成的对应的文法为：" << endl;

cout << "G=({";//<< stat[0];

for(int i4 = 0; i4 < n; i4++)

{

if(i4 != 0)

{

cout << ",";

}

cout << stat[i4];

}

cout << "},";

cout << "{";

for(int i5 = 0; i5 < m; i5++)

{

if(i5 != 0)

{

cout << ",";

}

cout <

}

cout << "},";

cout << "P,";

cout << stat[0] << "),";

cout << "其中P为：" << endl;

for(i = 0; i < n; i++)

{

for(j = 0; j < n; j++)

{

if(f[i][j] != '0')

{

cout << stat[i] << "->" << f[i][j] << stat[j] <

}

}

}

//输出可接受状态增加的产生式，例如A->ε

for(int i6 = 0; i6 < n_final_stat; i6++)

{

cout << stat[n_midd_stat + 1 + i6] << "->ε" << endl;

}

return 0;

}