Breaking News: Grepper is joining You.com. Read the official announcement!

LL(1) parser code

Dmytro Skorobahat'ko answered on October 23, 2023 Popularity 5/10 Helpfulness 2/10

answer LL(1) parser code

LL(1) parser code

Comment

#include<iostream.h>
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<string.h>


int main()
     {
       char tmp[15];
       char str[15], csf[15]={"E"};
       int ssm=0, i, j, v, k, pos=0, a;
       clrscr();

       char pt[6][5][4]={"" , "i" , "+" , "*" , "/",
             "E", "TX", "n" , "n" , "n",
             "X", "n" , "TX", "n" , "" ,
             "T", "VY", "n" , "n" , "n",
             "Y", "n" , ""  , "VY", "" ,
             "V", "i" , "n" , "n" , "n"};
     cout<<"\n Enter An Expression: "<<endl;
     cin>>str;

     while(str[ssm]!='/')
    {
      pos=0;
      while(csf[pos]!='E' &&
        csf[pos]!='X' &&
        csf[pos]!='T' &&
        csf[pos]!='Y' &&
        csf[pos]!='V' && csf[pos]!='\0')
        pos++;
    if (csf[pos]=='\0')
       break;

    for(i=1; i<6; i++)
      {
        if(csf[pos]==pt[i][0][0])
           break;
      }
       for(j=1; j<5; j++)
      {
         if(str[ssm]==pt[0][j][0])
        break;
      }
       if(strcmp(pt[i][j], "n")==0)
       {
          cout<<"\n Null Value: "<<endl;
          cout<<pt[i][j];
          exit;
       }

       for(k=0; k<pos; k++)
       tmp[k]=csf[k];
       tmp[k]='\0';
       strcat(tmp, pt[i][j]);

       int l= strlen(tmp);
       k=l;

       for(a=pos+1; csf[a]!='\0'; a++, k++)
       tmp[k]=csf[a];
       strcpy(csf, tmp);
    }


       strcat(csf, "/");
     if(strcmp(csf, str)==0)
         {
         cout<<"\t csf"<<csf;

         cout<<"\tstr"<<str;

         cout<<"\n Valid Expression: "<<endl;


         }

     else
         {
          cout<<"\n Invalid Expression:"<<endl;

         }


      getch();
      return 0;
}

Popularity 5/10 Helpfulness 2/10 Language cpp

Source: cplusplus.com

Tags: c++

Link to this answer
Share Copy Link

Contributed on Oct 23 2023

Dmytro Skorobahat'ko

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

LL(1) parser code

Contents

More Related Answers

LL(1) parser code

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.