A program to find FIRST of non-terminals of the given grammar

#include<stdio.h>
#include<conio.h>
char array[10][20],temp[10];
int c,n;
void fun(int,int[]);
int fun2(int i,int j,int p[],int );
void main()
{
   int p[2],i,j;
   printf("Enter the no. of productions :");
   scanf("%d",&n);
   printf("Enter the productions :\n");
   for(i=0;i<n;i++)
   scanf("%s",array[i]);
   for(i=0;i<n;i++)
   {
    c=-1,p[0]=-1,p[1]=-1;
    fun(i,p);
    printf("First(%c) : [ ",array[i][0]);
    for(j=0;j<=c;j++)
    printf("%c,",temp[j]);
    printf("\b ].\n");
    getch();
   }
}
int fun2(int i,int j,int p[],int key)
{
  int k;
  if(!key)
  {
    for(k=0;k<n;k++)
    if(array[i][j]==array[k][0])
    break;
    p[0]=i;p[1]=j+1;
    fun(k,p);
    return 0;
  }
  else
  {
    for(k=0;k<=c;k++)
    {
    if(array[i][j]==temp[k])
    break;
    }
    if(k>c)return 1;
    else return 0;
  }
}
 void fun(int i,int p[])
 {
 int j,k,key;
 for(j=2;array[i][j] != NULL; j++)
 {
 if(array[i][j-1]=='/')
 {
 if(array[i][j]>= 'A' && array[i][j]<='Z')
 {
 key=0;
 fun2(i,j,p,key);
 }
 else
 {
 key = 1;
 if(fun2(i,j,p,key))
 temp[++c] = array[i][j];
 if(array[i][j]== '@'&& p[0]!=-1) //taking '@' as null symbol
 {
 if(array[p[0]][p[1]]>='A' && array[p[0]][p[1]] <='Z')
 {
 key=0;
 fun2(p[0],p[1],p,key);
 }
 else
 if(array[p[0]][p[1]] != '/'&& array[p[0]][p[1]]!=NULL)
 {
 if(fun2(p[0],p[1],p,key))
 temp[++c]=array[p[0]][p[1]];
 }
 }
 }
 }
 }
 }

Comments

Post a Comment

Popular posts from this blog

Lex program for counting keyword and identifier

%{ #include<stdio.h> }% %{ int keywords=0; int identifiers=0; %} %% (int|float|char) {keywords++; printf("%s is keyword",yytext);} [_a-zA-Z]([a-z|[0-9])* {identifiers++; printf("%s is identifier",yytext);} %% int main() { yylex(); printf("No of keywords is %d \n no of identifiers is %d",keywords,identifiers); return(0); }
Read more

There are two kangaroos on an x-axis ready to jump in the positive direction (i.e, toward positive infinity). The first kangaroo starts at location x1 and moves at a rate of v1 meters per jump. The second kangaroo starts at location x2 and moves at a rate of v2 meters per jump. Given the starting locations and movement rates for each kangaroo, can you determine if they'll ever land at the same location at the same time?

Image
#include <iostream> using namespace std; int main(){     int x1, v1, x2, v2;     cin >> x1 >> v1 >> x2 >> v2;     // If one kangaroo is behind the other AND moving slower,     //    he/she will never catch up to the other one     if ((x1 < x2) && (v1 < v2)) cout << "NO";     else if ((x2 < x1) && (v2 < v1)) cout << "NO";     // Otherwise, move each kangaroo one jump at a time until     //     the one behind is no longer behind.     else {         if (x1 < x2) {             while (x1 < x2) {                 x1 += v1;                 x2 += v2;             }         } else {             while (x2 < x1) {                 x1 += v1;                 x2 += v2;             }         }         // Once he/she is no longer behind the other, check to see         //    if he/she is in the same position, or if he/she has passed         if (x1 == x2) cout << "YES&
Read more