-
Notifications
You must be signed in to change notification settings - Fork 0
/
lab5.cpp
126 lines (107 loc) · 2.31 KB
/
lab5.cpp
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
#include <bits/stdc++.h>
using namespace std;
long long int i,j,k,l,n,m=0,t;
string s[100],st,str="";
char nt,ft;
vector<string>ss;
vector<char>sy;
long long int firstfollow(int v,char ch)
{
int fm=0;
while(v<=n)
{
st=s[v];
if(st[0]==ch)
{
cout<<"Get"<<st[0]<<endl;
ft=st[0];
for(j=0;j<st.length();j++)
{
if(st[j]=='=')
{
l=j;
break;
}
}
for(j=l+1;j<st.length();j++)
{
str="";
if((st[j]=='+' || st[j]=='*' ||st[j]=='/' ||st[j]=='-' || st[j]=='(') || (st[j]>='a' && st[j]<='z'))
{
m=1;
str=str+st[j];
//cout<<str<<endl;
break;
}
else
{
m=0;
nt=st[j];
//cout<<"Nt"<<nt<<endl;
break;
}
}
if(m==1)
{
ss.push_back(str);
}
else
{
i=i+1;
if(i>n)
{
break;
}
firstfollow(i,nt);
}
}
else
{
i=i+1;
if(i>n)
{
break;
}
firstfollow(i,nt);
}
v++;
}
}
int main()
{
long long int fl=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>s[i];
}
i=1;
st=s[1];
nt=st[0];
//cout<<nt<<endl;
for(t=1;t<=n;t++)
{
st=s[t];
nt=st[0];
ft=st[0];
for(k=0;k<sy.size();k++)
{
if(ft==sy[k])
{
fl=1;
break;
}
}
if(fl==0)
{
sy.push_back(ft);
firstfollow(t,nt);
}
}
for(i=0;i<ss.size();i++)
{
//cout<<sy[i]<<"=";
cout<<ss[i]<<endl;
}
return 0;
}