-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathmain.c
More file actions
123 lines (113 loc) · 2 KB
/
main.c
File metadata and controls
123 lines (113 loc) · 2 KB
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
#include <stdio.h>
#include <stdlib.h>
struct stack
{
int size;
int top;
char *arr;
};
int isEmpty(struct stack *a)
{
if (a->top == -1)
{
return 1;
}
return 0;
}
int isFull(struct stack *a)
{
if (a->top == a->size - 1)
{
return 1;
}
return 0;
}
void push(struct stack *a, char value)
{
if (isFull(a))
{
printf("Stack is overflow!!!");
}
else
{
a->top++;
a->arr[a->top] = value;
}
}
char pop(struct stack *a)
{
if (isEmpty(a))
{
printf("Stack is underflow!!!");
return -1;
}
else
{
char val = a->arr[a->top];
a->top--;
return val;
}
}
int match(char a, char b)
{
if (a == '(' && b == ')')
{
return 1;
}
if (a == '{' && b == '}')
{
return 1;
}
if (a == '[' && b == ']')
{
return 1;
}
return 0;
}
int parenthesis_matching(char *exp)
{
struct stack *a;
a->size = 100;
a->top = -1;
a->arr = (char *)malloc(a->size * sizeof(char));
for (int i = 0; exp[i] != '\0'; i++)
{
if (exp[i] == '(' || exp[i] == '{' || exp[i] == '[')
{
push(a, exp[i]);
}
else if (exp[i] == ')' || exp[i] == '}' || exp[i] == ']')
{
if (isEmpty(a))
{
return 0;
}
else
{
char pop_ch = pop(a);
if (!match(pop_ch, exp[i]))
{
return 0;
}
}
}
}
if (isEmpty(a))
{
return 1;
}
return 0;
}
int main()
{
char *exp = "[(81++)]({(--84**)})";
if (parenthesis_matching(exp))
{
printf("\nThe parenthesis is balanced\n");
}
else
{
printf("\nThe parenthesis is not balanced\n");
}
return 0;
}