DSA-1/Assignment8.cpp at master · MEHUL25/DSA-1 · 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
#include<iostream>
#include<string.h>
using namespace std;
#define MAX 50

class StClass
{

	struct stknode
	{
		char stack[MAX];
		int top;
	}st;

public:
	StClass()
	{
		st.top=-1;
	}
	void push(char);
	char pop();
	int check(char exp[MAX]);
	 int match(char a, char b);
};

int StClass:: check(char exp[])
{
	int i;
	char temp;
	int n= strlen(exp);
	for(i=0;i<n;i++)
	{
		if(exp[i]=='(' || exp[i]=='{' || exp[i]=='[')
		push(exp[i]);
		if(exp[i]==')' || exp[i]=='}' || exp[i]==']')
		if(st.top==-1)
		return 0;
		else
		{
			temp=pop();
			if(!match(temp,exp[i]))
			return 0;
		}
	}
	if(st.top==-1)
	return 1;
	else
	return 0;
}

int StClass::match(char a, char b)
{
	if(a=='[' && b==']')
	return 1;
	if(a=='{' && b=='}')
	return 1;
	if(a=='(' && b==')')
	return 1;
	return 0;
}

void StClass::push(char item)
{
	if(st.top==(MAX-1))
	{
		cout<<"Stack Overflow \n";
		return;
	}
	st.top=st.top+1;
	st.stack[st.top]=item;
}

char StClass::pop()
{
	if(st.top==-1)
	{
		cout<<"stack Underflow \n";
	}
	return(st.stack[st.top--]);
}

int main()
{
	char exp[MAX];
	int status;
	StClass obj;
	cout<<"Enter a parenthesized expression: ";
	cin>>exp;
	status= obj.check(exp);
	if(status==1)
		cout<<"The expression is well paranthesized \n";
	else
		cout<<"The expression is not well paranthesized \n";
	return 0;
}