/
stack.c
133 lines (121 loc) · 1.69 KB
/
stack.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
125
126
127
128
129
130
131
132
133
#include <stdio.h>
#include <stdlib.h>
#include "stack.h"
Stack createStack()
{
Stack s;
s.top = NULL;
s.size = 0;
return s;
}
Link createStackNode(sym s)
{
Link newNode;
newNode = (Link)malloc(sizeof(stackNode));
if(newNode==NULL)
{
printf("Error : Insufficient Memory.\n");
exit(0);
}
newNode->s.type = s.type;
if(s.type==0)
newNode->s.nonterminal=s.nonterminal;
else if(s.type==1)
newNode->s.terminal=s.terminal;
newNode->next = NULL;
return newNode;
}
int isEmptyStack(Stack s)
{
if(s.top==NULL)
return 1;
else
return 0;
}
sym getTop(Stack s)
{
return (s.top->s);
}
Stack push(Stack s,sym s1)
{
Link newNode;
newNode = createStackNode(s1);
if(s.top==NULL)
{
s.top = newNode;
s.size++;
}
else
{
newNode->next = s.top;
s.top = newNode;
s.size++;
}
return s;
}
Stack pop(Stack s)
{
Link temp;
temp = s.top;
s.top = s.top->next;
s.size--;
free(temp);
return s;
}
rule_stack createRuleStack()
{
rule_stack s;
s.top = NULL;
s.size = 0;
return s;
}
nxt createRuleNode(int n)
{
nxt newNode;
newNode = (nxt)malloc(sizeof(ruleNode));
if(newNode==NULL)
{
printf("Error : Insufficient Memory.\n");
exit(0);
}
newNode->rule_no = n;
newNode->next = NULL;
return newNode;
}
int isEmptyRuleStack(rule_stack s)
{
if(s.top==NULL)
return 1;
else
return 0;
}
int getTopRule(rule_stack s)
{
return (s.top->rule_no);
}
rule_stack pushRule(rule_stack s,int n)
{
nxt newNode;
newNode = createRuleNode(n);
if(s.top==NULL)
{
s.top = newNode;
s.size++;
}
else
{
newNode->next = s.top;
s.top = newNode;
s.size++;
}
return s;
}
rule_stack popRule(rule_stack s)
{
nxt temp;
temp = s.top;
s.top = s.top->next;
s.size--;
free(temp);
return s;
}