dsl/stack.cpp at main · saqib-7/dsl · GitHub

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
#include<iostream>
using namespace std;
const int MAX=20;
class Stack
{
	char str[MAX];
	int top;
	public:
		Stack()
		{
			top=-1;
		}
		void push(char ch);
		char pop();
		bool isEmpty();
		bool isFull();
		void display();
		void checkParenthesis();
};
bool Stack::isEmpty()
{
	if(top==-1)
	{
		return 1;
	}
	else
	{
		return 0;
	}
}
bool Stack::isFull()
{
	if(top==MAX-1)
	{
		return 1;
	}
	else
	{
		return 0;
	}
}
void Stack :: display()
{
	if(isEmpty()==1)
	{
		cout<<"\nStack is empty";
	}
	else
	{
		for(int i=0;i<=top;i++)
		{
			cout<<" "<<str[i];
		}
	}
}
void Stack::push(char ch)
{
	if(!isFull())
	{
		top++;
		str[top]=ch;
	}
}
char Stack::pop()
{
	if(!isEmpty())
	{
		char ch=str[top];
		top--;
		return ch;
	}
	else
	{
		return '\0';
	}
}
void Stack::checkParenthesis()
{
	cout<<"\nEnter # as a deliminator after expression(At the end)\n";
	cout<<"\nEnter Expression: ";
	cin.getline(str,MAX,'#');
	char ch;
	bool flag=0;
	for(int i=0;str[i]!='\0';i++)
	{
		if(str[i]=='(' || str[i]=='[' || str[i]=='{')
		{
			push(str[i]);
		}
		if(str[i]==')'||str[i]==']'||str[i]=='}')
		{
			ch=pop();
			if((str[i]==')'&& ch!='(') ||(str[i]==']'&& ch!='[')||(str[i]=='}'&& ch!='{'))
			{
				cout<<"\nNot parenthesized At "<<i<<" = "<<str[i];
				flag=1;
				break;
			}
		}
	}
	if(isEmpty()==1 && flag==0)
	{
		cout<<"\nExpression is Well Parenthesized.";
	}
	else
	{
		cout<<"\nExpression is not Well Parenthesized.";
	}
}
int main()
{
	int choice;
	do
	{
		Stack s;
		s.checkParenthesis();
		cout<<"\nDo you want to continue?\n(Press 1 for Yes, 0 for No)";
		cin>>choice;
	}
	while(choice!=0);
	return 0;
}