-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathP2_Stack_b.c
124 lines (114 loc) · 2.14 KB
/
P2_Stack_b.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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
// Aniket Raut
// B-22
#include <stdio.h>
#define MAX 20
// Define a stack using structure
struct stack
{
char arr[MAX];
int tos;
};
// method to initilize stack
void initilize(struct stack *stk)
{
stk->tos = -1;
}
// method to push element in stack
void push(struct stack *stk, char val)
{
if (stk->tos == MAX - 1)
{ // checking for overflow condition
printf("Stack overflow!!\n");
return;
}
stk->tos++;
stk->arr[stk->tos] = val;
}
// method to display stack
void display(struct stack *stk)
{
for (int i = stk->tos; i >= 0; i--)
{
printf("%c ", stk->arr[i]);
}
printf("\n");
}
// method to pop element in stack
void pop(struct stack *stk)
{
if (stk->tos == -1)
{
printf("Stack Underflow!!\n");
return;
}
stk->tos--;
}
char tos(struct stack *stk)
{
if (stk->tos != -1)
{
return stk->arr[stk->tos];
}
}
void main()
{
struct stack stk;
initilize(&stk);
char expression[100];
printf("Enter any Exprression");
scanf("%s", expression);
int isValid = 1;
int i = 0;
while (expression[i] != '\0')
{
if (expression[i] == '[' || expression[i] == '(' || expression[i] == '{')
{
push(&stk, expression[i]);
}
if (expression[i] == ']')
{
if (tos(&stk) == '[')
{
pop(&stk);
}
else
{
isValid = 0;
break;
}
}
else if (expression[i] == '}')
{
if (tos(&stk) == '{')
{
pop(&stk);
}
else
{
isValid = 0;
break;
}
}
else if (expression[i] == ')')
{
if (tos(&stk) == '(')
{
pop(&stk);
}
else
{
isValid = 0;
break;
}
}
i++;
}
if (isValid)
{
printf("Expression is valid \n");
}
else
{
printf("Expression is not valid \n");
}
}