-
Notifications
You must be signed in to change notification settings - Fork 2
/
stack_parenthesis
119 lines (114 loc) · 1.53 KB
/
stack_parenthesis
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
//do while is not working
#include <iostream>
#include<string>
using namespace std;
class stack
{
public:
int top;
char* array;
int size;
stack()
{
top = -1;
}
bool isMatching(char *exp);
void push(int n);
bool isempty();
void pop();
};
bool stack::isempty()
{
if (top == -1)
{
return true;
}
else
{
return false;
}
}
void stack::pop()
{
int temp;
if (top != -1)
{
temp = array[top--];
}
}
bool stack::isMatching(char *exp)
{
/*char exp[1000];
cout << "Enter expression" << endl;
cin.getline(exp, 1000);
int l = strlen(exp);
size = l;
array = new char[l];*/
for (int i = 0; exp[i] != '\0'; i++)
{
if (exp[i] == '(' || exp[i]=='{' || exp[i]=='[')
{
push(exp[i]);
cout << "Pushed" << endl;
}
else if (exp[i] == ')' || exp[i] == '}' || exp[i] == ']')
{
bool x = isempty();
if (x == false)
{
pop();
cout << "Popped" << endl;
}
else
{
return false;
}
}
}
bool y = isempty();
if (y == true)
{
return true;
}
else
{
return false;
}
}
void stack::push(int n)
{
if (top == size - 1)
{
cout << "Full Stack" << endl;
}
else
{
array[++top] = n;
}
}
int main()
{
int n;
stack st;
do
{
char exp[1000];
cout << "Enter expression" << endl;
cin.getline(exp, 1000);
int l = strlen(exp);
st.size = l;
st.array = new char[l];
bool dec = st.isMatching(exp);
if (dec == true)
{
cout << "Parenthesis Match" << endl;
}
else
{
cout << "No match" << endl;
}
cout << "Enter 0 to exit" << endl;
cin >> n;
} while (n != 0);
return 0;
}