Compiler-Design-CS1036/shift.cpp at master · Ayushverma8/Compiler-Design-CS1036 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include<conio.h>
#include<iostream>
#include<string.h>

using namespace std;

struct grammer{
    char p[20];
    char prod[20];
}g[10];

int main()
{
    int i,stpos,j,k,l,m,o,p,f,r;
    int np,tspos,cr;

    cout<<"\nEnter Number of productions:";
    cin>>np;

    char sc,ts[10];

    cout<<"\nEnter productions:\n";
    for(i=0;i<np;i++)
    {
        cin>>ts;
        strncpy(g[i].p,ts,1);
        strcpy(g[i].prod,&ts[3]);
    }

    char ip[10];

    cout<<"\nEnter Input:";
    cin>>ip;

    int lip=strlen(ip);

    char stack[10];

    stpos=0;
    i=0;

    //moving input
    sc=ip[i];
    stack[stpos]=sc;
    i++;stpos++;

    cout<<"\n\nStack\tInput\tAction";
    do
    {
        r=1;
        while(r!=0)
        {
            cout<<"\n";
            for(p=0;p<stpos;p++)
            {
                cout<<stack[p];
            }
            cout<<"\t";
            for(p=i;p<lip;p++)
            {
                cout<<ip[p];
            }

            if(r==2)
            {
                cout<<"\tReduced";
            }
            else
            {
                cout<<"\tShifted";
            }
            r=0;

            //try reducing
            getch();
            for(k=0;k<stpos;k++)
            {
                f=0;

                for(l=0;l<10;l++)
                {
                    ts[l]='\0';
                }

                tspos=0;
                for(l=k;l<stpos;l++) //removing first caharcter
                {
                    ts[tspos]=stack[l];
                    tspos++;
                }

                //now compare each possibility with production
                for(m=0;m<np;m++)
                {
                    cr = strcmp(ts,g[m].prod);

                    //if cr is zero then match is found
                    if(cr==0)
                    {
                        for(l=k;l<10;l++) //removing matched part from stack
                        {
                            stack[l]='\0';
                            stpos--;
                        }

                        stpos=k;

                        //concatinate the string
                        strcat(stack,g[m].p);
                        stpos++;
                        r=2;
                    }
                }
            }
        }

        //moving input
        sc=ip[i];
        stack[stpos]=sc;
        i++;stpos++;

    }while(strlen(stack)!=1 && stpos!=lip);

    if(strlen(stack)==1)
    {
        cout<<"\n String Accepted";
    }

    getch();
}