-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathbracket_error.c
100 lines (89 loc) · 1.56 KB
/
bracket_error.c
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
#include <stdio.h>
#include <stdlib.h>
struct Node
{
int size;
int top;
char *arr;
};
int empty(struct Node *ptr)
{
if (ptr->top == -1)
{
return 1;
}
else
{
return 0;
}
}
int full(struct Node *ptr)
{
if (ptr->top == ptr->size - 1)
{
return 1;
}
else
{
return 0;
}
}
void push(struct Node *ptr, char val){
if (full(ptr)){
printf("Stack si Full");
}
else{
ptr->top++;
ptr->arr[ptr->top] = val;
}
}
int pop(struct Node *ptr)
{
if (empty(ptr))
{
printf("Stack is underflow");
}
else
{
int val = ptr->arr[ptr->top];
ptr->top--;
return val;
}
}
int parenthesisMatch(char * exp){
struct Node* sp;
sp->size = 100;
sp->top = -1;
sp->arr = (char *)malloc(sp->size * sizeof(char));
for (int i = 0; exp[i]!='\0'; i++)
{
if(exp[i]=='('){
push(sp, '(');
}
else if(exp[i]==')'){
if(empty(sp)){
return 0;
}
pop(sp);
}
}
if(empty(sp)){
return 1;
}
else{
return 0;
}
}
int main(){
// char n[100],p;
// printf("Enter exp : ");
// scanf("%c",&n);
char * exp = "((8*9)+(7+4)";
if(parenthesisMatch(exp)){
printf("The parenthesis is matching");
}
else{
printf("The parenthesis is not matching");
}
return 0;
}