forked from SarthakShah001/Compiler2K23
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsetADT.c
More file actions
78 lines (68 loc) · 1.62 KB
/
setADT.c
File metadata and controls
78 lines (68 loc) · 1.62 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
/*
***** Group No. - 9 *****
Name : Sarthak Shah ID : 2020A7PS0092P
Name : Siddharth Khandelwal ID : 2020A7PS0098P
Name : Archaj Jain ID : 2020A7PS0072P
Name : BhanuPratap Singh Rathore ID : 2020A7PS1675P
Name : Rishi Rakesh Shrivastava ID : 2020A7PS0108P
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include "parserDef.h"
#include "setADT.h"
setNode initSet()
{
setNode set = (setNode)malloc(sizeof(struct SETNODE));
for (int i = 0; i < num_terminals; i++)
{
set->arr[i] = false;
}
set->is_filled = false;
}
void insertElement(setNode set, terminal t)
{
set->arr[t] = true;
}
void deleteElement(setNode set, terminal t)
{
set->arr[t] = false;
}
bool findInSet(setNode set, terminal t)
{
return set->arr[t];
}
void setUnion(setNode s1, setNode s2, setNode dest)
{
for (int i = 0; i < num_terminals; i++)
{
dest->arr[i] = (s1->arr[i] || s2->arr[i]);
}
}
void setIntersection(setNode s1, setNode s2, setNode dest)
{
for (int i = 0; i < num_terminals; i++)
{
dest->arr[i] = (s1->arr[i] && s2->arr[i]);
}
}
bool isSuperset(setNode s1, setNode s2)
{
for (int i = 0; i < num_terminals; i++)
{
if (s1->arr[i] == true && s2->arr[i] == false)
{
return false;
}
}
return true;
}
setNode compute_synchro_set(nonterminal nt)
{
setNode s = initSet();
setUnion(s, follow_set[nt], s);
s->arr[TK_SEMICOLON] = true;
s->arr[TK_END] = true;
s->arr[TK_ENDDEF] = true;
return s;
}