forked from Coder-forfun/Hactoberfest-accepted
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathParenthesischeck.cpp
232 lines (199 loc) · 3.31 KB
/
Parenthesischeck.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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
/**/
#include<iostream>
#include<string.h>
//#define DEBUG 6
using namespace std;
class stack
{
private:
int i,n,count=0,flag=0;
int top = -1;
char x[50],k;
public:
stack* s;
void push(char);
char pop();
void check();
int gettop();
void randomcheck()
{
cout << "You pushed " << k << endl;
cout << "Count Became " << count << endl;
cout << "Flag Became " << flag << endl;
cout << "Top Became " <<gettop()<< endl;
}
public:
stack();
~stack();
};
stack::stack()
{
//s = NULL;
cout << "Enter a expression" << endl;
cin.getline(x, 50);
cout << x << endl;
n = strlen(x);
}
stack::~stack()
{
}
int stack::gettop()
{
return top;
}
void stack::push(char df)
{
top++;
x[top] = df;
}
char stack::pop()
{
char m;
m = x[top];
//delete (x);
top--;
return m;
}
void stack::check()
{
#ifdef DEBUG
cout << "Top = " << gettop() << endl;
for (int j = 0; j < n; j++)
{
push(x[j]);
cout << "Top = " << gettop() << endl;
}
#endif // DEBUG
#ifdef DEBUG
cout << "Your entered infix expression is" << endl;
for (int j = 0; j < n; j++)
{
k = pop();
cout << k;
cout << "Top = " << gettop() << endl;
}
#endif // DEBUG
if (x[0] == '}' || x[0] == ')' || x[0] == ']')
{
cout << "The entered expression is not well parenthesized" << endl;
}
else {
for (i=0; i < n; i++)
{
if (x[i] == '{' || x[i] == '(' || x[i] == '[')
{
push(x[i]);
k = x[i];
count++;
#ifdef DEBUG
randomcheck();
#endif // DEBUG
}
else if (x[i] == '}' || x[i] == ']' || x[i] == ')')
{
if (x[i] == '}')
{
k = pop();
if (k == '{')
{
flag++;
#ifdef DEBUG
cout << "Entered if loop of " << k << endl;
randomcheck();
#endif // DEBUG
}
else
{
push(k);
#ifdef DEBUG
cout << "Entered if loop of " << k << endl;
randomcheck();
#endif // DEBUG
}
}
else if (x[i] == ']')
{
k = pop();
if (k == '[')
{
flag++;
#ifdef DEBUG
cout << "Entered if loop of " << k << endl;
randomcheck();
#endif // DEBUG
}
else
{
push(k);
#ifdef DEBUG
cout << "Entered if loop of " << k << endl;
randomcheck();
#endif // DEBUG
}
}
else if (x[i] == ')')
{
k = pop();
if (k == '(')
{
flag++;
#ifdef DEBUG
cout << "Entered if loop of " << k << endl;
randomcheck();
#endif // DEBUG
}
else
{
push(k);
#ifdef DEBUG
cout << "Entered if loop of " << k << endl;
randomcheck();
#endif // DEBUG
}
}
else if (x[i] != '}' && x[i] != ')' && x[i] != ']')
{
cout << "HI" << endl;
k = x[i];
push(k);
count++;
#ifdef DEBUG
cout << "Entered if loop of " << k << endl;
randomcheck();
#endif // DEBUG
}
}
else
{
#ifdef DEBUG
cout << "Entered ELSE part because k = " << k << " . Hence no change in stack." << endl;
#endif // DEBUG
count++;
flag++;
}
}
if (flag == count)
cout << "The expression is well parenthesized" << endl;
else
cout << "The given expression is not well parenthesized" << endl;
}
}
int main()
{
stack A;
A.check();
return 0;
}
/*
OUTPUT:
TESTCASE !:
Enter a expression
([)]
([)]
The given expression is not well parenthesized
TESTCASE 2:
Enter a expression
([[]]{}{({})})
([[]]{}{({})})
The expression is well parenthesized
*/