Scribd
Upload
3 views

Compiler Lab Experiment 8 Program

The document contains a C program that calculates the epsilon closure of a Non-deterministic Finite Automaton (NFA). It prompts the user for the number of alphabets, states, and transitions, and then computes the epsilon closure for each state based on the provided transitions. The output displays the epsilon closure for each state in the format e-closure(qn):{...}.

Uploaded by

abhishek21032004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Compiler Lab Experiment 8 Program

The document contains a C program that calculates the epsilon closure of a Non-deterministic Finite Automaton (NFA). It prompts the user for the number of alphabets, states, and transitions, and then computes the epsilon closure for each state based on the provided transitions. The output displays the epsilon closure for each state in the format e-closure(qn):{...}.

Uploaded by

abhishek21032004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

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, char, int);
int findalpha(char);
void print_e_closure(int);
static 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};
void main()
{
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->link;
}
}
}
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=transition[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("}");
}

Output
Enter the number of alphabets?
3
NOTE:-[use letter e as epsilon]
NOTE:-[e must be last character, if it is present]
Enter alphabets?
01e
Enter the number of states?
3
Enter no of transition?
5
NOTE:-[Transition is in the form_>qno alphabet qno]
NOTE:-[State number must be greater than zero]
Enter transition?
101
1e2
212
2e3
313
e-closure of states...
--------------
e-closure(q1):{q1q2q3}
e-closure(q2):{q2q3}
e-closure(q3):{q3}

You might also like