/
stack.cpp
133 lines (122 loc) · 1.49 KB
/
stack.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
#include<iostream>
#include<stdlib.h>
using namespace std;
//#define n 50;
class stack
{
char s[20];
int top;
public:
stack()
{
top=-1;
}
void push(char);
int pop();
bool empty();
bool full();
void insert();
};
bool stack::full()
{
if(top==20)
return 1;
else
return 0;
}
bool stack::empty()
{
if(top==-1)
return 1;
else
return 0;
}
void stack::push(char a)
{
char b=a;
if(full())
{
cout<<"OVERFLOW";
exit(1);
}
else
{
//top++;
s[++top]=b;
}
}
int stack::pop()
{
if(empty())
{
cout<<"\nUNDERFLOW";
exit(1);
}
else
{
//cout<<"\nTOP ELEMENT:"<<s[top];
return s[top];
top--;
}
}
void stack::insert()
{
char ch,ch1;
while(1)
{
cout<<"ENTER THE CHARACTER:";
cout<<"'[','{','(',')','}',']'\n";
cin>>ch;
if(ch=='{'||ch=='('||ch=='[')
push(ch);
if(ch=='}')
{
ch1=pop();
if(ch1=='{')
return(1);
else
{
cout<<"ERROR:'{' NOT FOUND";
break;
}
}
if(ch==')')
{
ch1=pop();
if(ch1=='(')
return(1);
else
{
cout<<"ERROR:'(' NOT FOUND";
break;
}
}
if(ch==']')
{
ch1=pop();
if(ch1=='[')
return(1);
else
{
cout<<"ERROR:'[' NOT FOUND";
break;
}
}
}
}
int main()
{
stack q;
char ch;
int n;
cout<<"\nENTER NO OF CHARACTER IN THE STRING:";
cin>>n;
cout<<"\nENTER A STRING:";
for(int i=0;i<n;i++)
{
cin>>ch;
q.push(ch);
}
q.insert();
return 0;
}