-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathParanthesis.cpp
139 lines (137 loc) · 2.57 KB
/
Paranthesis.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
// SCAN FROMLEFT TO RIGHT
// IF OPENING SYMBOL ADD TO LIST
// IF CLOSING SYMBOL, REMOVE LAST OPENING SYMBOL IN LIST
#include <iostream>
#include <string.h>
using namespace std;
#define MAX 100
class STACK
{
int top;
public:
char a[MAX];
STACK() { top = -1; }
bool push(char g);
char pop();
char peek();
bool isEmpty();
} s;
bool STACK ::push(char g)
{
if (top >= (MAX - 1))
{
cout << "Stack overflow";
return false;
}
else
{
a[++top] = g;
cout << g << " pushed into stack!" << endl;
}
}
char STACK ::pop()
{
if (top < 0)
{
cout << "\nStack Underflow!" << endl;
return 0;
}
else
{
char x = a[top--];
return x;
}
}
char STACK ::peek()
{
if (top < 0)
{
cout << "\nThe stack is empty!" << endl;
}
else
{
int x = a[top];
return x;
}
}
bool STACK ::isEmpty()
{
return (top < 0);
}
bool paranthesis(char t[])
{
int i = 0;
while (t[i] != '\0')
{
if (t[i] == '(' || t[i] == '[' || t[i] == '{')
{
s.push(t[i]);
i++;
}
else if (t[i] == ')' || t[i] == '}' || t[i] == ']')
{
switch (t[i])
{
case ')':
{
char c = '(';
char x = s.pop();
if (c == x)
{
i++;
}
else
{
return false;
}
break;
}
case '}':
{
char c = '{';
char x = s.pop();
if (c == x)
{
i++;
}
else
{
return false;
}
break;
}
case ']':
{
char c = '[';
char x = s.pop();
if (c == x)
{
i++;
}
break;
}
}
}
else
{
i++;
}
}
return true;
}
int main()
{
char str[30];
cout << "Enter your string:" << endl;
cin >> str;
paranthesis(str);
if (s.isEmpty())
{
cout << "\nBalanced!" << endl;
}
else
{
cout << "Unbalanced!" << endl;
}
return 0;
}