Data-Structure-Programs/parenthesis_matching.cpp at master · akshay2742/Data-Structure-Programs · 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
123
124
#include<iostream>
#include<string>
using namespace std;
template <class T>
class Stack{
public:

     T *S;
     int tos;
     /*contructor of stack class*/
     Stack()
     {
         tos=0;

         S=new T[100];
     }

     bool isfull()
     {
         if(tos==(100))
         {

             return true;
         }
         else
         {

             return false;
         }
     }
     bool isempty()
     {
         if(tos==0)
         {

             return true;
         }
         else
         {

             return false;
         }
     }
     bool push(T element)
     {

        if(!isfull())
         {

             S[tos]=element;
             tos++;
             return true;
         }
        else
        {
            return false;
        }
     }
     bool pop()
     {
         if(!isempty())
         {
             tos--;
             return true;
         }
         else
         {
             return false;
         }
     }
     int topel()
     {

       if(!isempty())
       {
           return S[tos-1];

       }
       else
       {
         return 0;
       }

     }
};


bool ArePair(char opening,char closing)
{
	if(opening == '(' && closing == ')') return true;
	else if(opening == '{' && closing == '}') return true;
	else if(opening == '[' && closing == ']') return true;
	return false;
}
bool ParanthesesBalanced(string exp)
{
	Stack <char> st;
	for(int i =0;i<exp.length();i++)
	{
		if(exp[i] == '(' || exp[i] == '{' || exp[i] == '[')
			st.push(exp[i]);
		else if(exp[i] == ')' || exp[i] == '}' || exp[i] == ']')
		{
			if(st.isempty() || !ArePair(st.topel(),exp[i]))
				return false;
			else
				st.pop();
		}
	}
	return st.isempty() ? true:false;
}

int main()
{
	/*Code to test the function AreParanthesesBalanced*/
	string expression;
	cout<<"Enter an expression:  ";
	cin>>expression;
	if(ParanthesesBalanced(expression))
		cout<<"Balanced\n";
	else
		cout<<"Not Balanced\n";
}