Question

C program to find epsilon closure of all states of any given nfa with epsilon transition

Answer 1

C Program to find epsilon closure of NFA

#include<stdio.h>

#include<stdlib.h>

struct node

{ int st;

struct node *link;

};

void findclosure(int,int);

void insert_trantbl(int, cha, int);

int findalpha(char);

void print_e_closure(int);

staic int set[20],nostate, noalpha, s, notransition, c,r,buffer[20];

char alphabet[20];

static int e_closure[20][20]={0};

struct node * transition[20][20]={NULL};

voidmain()

{

int i,j,k,m,t,n;

struct node *temp;

printf("Enter the number of alphabets?\n")

scanf("%d",&noalpha);

getchar();

printf("NOTE:-[use letter e as epsilon]\n");

printf("NOTE:-[e must be last character, if it is present]\n");

printf("\nEnter alphabets?\n");

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

{

alphabet[i]=getchar();

getchar();

}

printf("\nEnter the number of states?\n");

scanf("%d",&nostate);

printf("\nEnter no of transition?\n");

scanf("%d",&notransition);

printf("NOTE:-[Transition is in the form_>qno alphabet qno]\n",notransition);

printf("NOTE:-[State number must be greater than zero]\n");

printf("\nEnter transition?\n");

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

{

scanf("%d %c %d",&r,&c,&s);

insert_trantbl(r,c,s);

}

printf("\n")

printf("e-closure of states...\n");

printf("--------------\n");

for(i=1;i<=nostate;i++)

{

c=0;

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

{

buffer[j]=0;

e_closure[i][j]=0;

}

findclosure(i.i);

printf("\ne-closure(q%d):"i);

print_e_closure(i);

}

}

void findclosure(int x,int sta)

{

struct node *temp;

int i;

if(buffer[x])

return;

e_closure[sta][c++]=x;

buffer[x]=1;

if(alphabet[noalpha-1]=='e'&&transition[x][noalpha-1]!=NULL)

}

temp=transition[x][noalpha-1];

while(temp!=NULL)

{

findclosure(temp_>st.sta);

temp=temp_>;

}

}

}

void insert_trantbl(int r,char c,int s)

{

int j;

struct node *temp;

j=findalpha(c);

if(j==999)

{

printf("error\n");

exit(0);

}

temp=(struct node *)malloc(sizeof(struct node));

temp_>st=s;

temp_>link=trabsition[r][j];

transition[r][j]=temp;

}

int findalpha( char c)

{

int i;

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

if(alphabet[i]==c)

return i;

return(999);

}

void print_e_closure(int i)

{

int j;

printf("{");

for(j=0;e_closure[i][j]!=0;j++)

printf("q%d",e_closure[i][j[);

printf("}");

}

To Learn More...

• brainly.in/question/10107815