R
Ricky
thanks for the replysir.
i have made this code so far in declaring the NFA. In fact i do know what am
i supposed to do , i just cant get it right.
please have a look at the following code and tell me am i in the right way,
or can i do the covertion from this structure, and if possible (not trying
to bother you) one kind of solution.
thanks much
struct TLink
{
int linkNode;
int stringMax;
int string[5];
};
struct Node
{
int isFinalState;
int max_links;
TLink Link[5];
} NFA[5];
struct DLink
{
int meCilinLidhet;
int stringNo;
int node[5];
};
struct NodeD
{
int stringNode;
int isFinalState;
int max_links;
DLink Link[5];
} DFA[5];
int max_states;
int maxNode;
void NFA_input()
{
int i, j, k, f;
cout<<"\nHow MAny states does the NFA has =";
cin>>max_states;
for (i=0; i<max_states; i++)
{
cout<<"\nIs State q["<<i<<"] final State ? (yes=1, No=0)";
cin>>NFA.isFinalState;
cout<<"\nHow many transitions does this State have ?";
cin>>NFA.max_links;
for (j=0; j<NFA.max_links; j++)
{
cout<<"\nThe "<<j+1<<" transition is linking state q["<<i<<"] with
state =";
cin>>NFA.Link[j].linkNode;
cout<<"\nHow many strings make this transition=";
cin>>NFA.Link[j].stringMax;
for (k = 0; k < NFA.Link[j].stringMax; k++)
{
cout<<"\nEnter those strings=\n";
cout<<"delta["<<k+1<<"]= ";
cin>>NFA.Link[j].string[k];
}
}
}
}
void print_NFA()
{
int i, j, k ;
for (i=0; i<max_states; i++)
{
cout<<"\nState q["<<i<<"]";
for (j=0; j<NFA.max_links; j++)
{
cout<<"\n is linked with state q["<<NFA.Link[j].linkNode<<"]";
cout<<" with string";
for (k = 0; k < NFA.Link[j].stringMax; k++)
cout<<" " <<NFA.Link[j].string[k];
}
cout<<"\n";
}
cout<<"\nInitial State of the automata is:q[0]\n ";
cout<<"\nFinal States of the automata are: ";
for (i=0; i<max_states; i++)
{
if (NFA.isFinalState == 1)
cout<<"\n q["<<i<<"] \t";
}
}
int main()
{
clrscr();
char line[80]="-------------------------------------------------";
NFA_input();
cout<<"\nTranitions of the NFA are: \n";
cout<<line;
print_NFA();
cout<<"\n"<<line;
cin.get(); cin.ignore();
return 0;
}
i have made this code so far in declaring the NFA. In fact i do know what am
i supposed to do , i just cant get it right.
please have a look at the following code and tell me am i in the right way,
or can i do the covertion from this structure, and if possible (not trying
to bother you) one kind of solution.
thanks much
struct TLink
{
int linkNode;
int stringMax;
int string[5];
};
struct Node
{
int isFinalState;
int max_links;
TLink Link[5];
} NFA[5];
struct DLink
{
int meCilinLidhet;
int stringNo;
int node[5];
};
struct NodeD
{
int stringNode;
int isFinalState;
int max_links;
DLink Link[5];
} DFA[5];
int max_states;
int maxNode;
void NFA_input()
{
int i, j, k, f;
cout<<"\nHow MAny states does the NFA has =";
cin>>max_states;
for (i=0; i<max_states; i++)
{
cout<<"\nIs State q["<<i<<"] final State ? (yes=1, No=0)";
cin>>NFA.isFinalState;
cout<<"\nHow many transitions does this State have ?";
cin>>NFA.max_links;
for (j=0; j<NFA.max_links; j++)
{
cout<<"\nThe "<<j+1<<" transition is linking state q["<<i<<"] with
state =";
cin>>NFA.Link[j].linkNode;
cout<<"\nHow many strings make this transition=";
cin>>NFA.Link[j].stringMax;
for (k = 0; k < NFA.Link[j].stringMax; k++)
{
cout<<"\nEnter those strings=\n";
cout<<"delta["<<k+1<<"]= ";
cin>>NFA.Link[j].string[k];
}
}
}
}
void print_NFA()
{
int i, j, k ;
for (i=0; i<max_states; i++)
{
cout<<"\nState q["<<i<<"]";
for (j=0; j<NFA.max_links; j++)
{
cout<<"\n is linked with state q["<<NFA.Link[j].linkNode<<"]";
cout<<" with string";
for (k = 0; k < NFA.Link[j].stringMax; k++)
cout<<" " <<NFA.Link[j].string[k];
}
cout<<"\n";
}
cout<<"\nInitial State of the automata is:q[0]\n ";
cout<<"\nFinal States of the automata are: ";
for (i=0; i<max_states; i++)
{
if (NFA.isFinalState == 1)
cout<<"\n q["<<i<<"] \t";
}
}
int main()
{
clrscr();
char line[80]="-------------------------------------------------";
NFA_input();
cout<<"\nTranitions of the NFA are: \n";
cout<<line;
print_NFA();
cout<<"\n"<<line;
cin.get(); cin.ignore();
return 0;
}