-
Notifications
You must be signed in to change notification settings - Fork 0
/
tree.c
160 lines (145 loc) · 4.43 KB
/
tree.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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
/*
ID: 2020A7PS1214P Name: Darshan Abhaykumar
ID: 2020A7PS0970P Name: Debjit Kar
ID:2020A7PS0986P Name: Nidhish Parekh
*/
#include "treeDef.h"
#include "lexer.h"
#include "grammar.h"
#include <stdlib.h>
TREENODE initTree()
{
TREENODE temp = (TREENODE) malloc(sizeof(struct TreeNode));
temp->firstChild = NULL;
temp->nextSibling = NULL;
temp->parent = NULL;
temp->tnt = 1;
temp->line_no = -1;
temp->val.nt_val = program;
temp->rule_no = 0;
return temp;
}
TREENODE createEmptyNode()
{
TREENODE temp = (TREENODE) malloc(sizeof(struct TreeNode));
temp->firstChild = NULL;
temp->nextSibling = NULL;
temp->parent = NULL;
temp->tnt = -1; // CHECK
temp->rule_no = -1;
temp->line_no = -1;
return temp;
}
void leftmostDerive(NODE deriv, TREENODE t1, int line_no, int rule_no)
{
TREENODE curr = t1;
TREENODE parent = curr->parent;
TREENODE parents;
if(deriv != NULL)
{
while(curr->firstChild != NULL) // LOOP WHILE CHILD EXISTS
{
parent = curr;
curr = curr->firstChild;
}
if(curr->tnt == 0) // LAST CHILD IS TERMINAL
{
while(curr->nextSibling != NULL && curr->tnt == 0) // LOOP WHILE SIBLING IS TERMINAL AND NOT THE END
{
curr = curr->nextSibling;
}
if(curr->tnt == 0)
{
while(parent->nextSibling == NULL) parent = parent->parent;
leftmostDerive(deriv, parent->nextSibling, line_no, rule_no); // LAST CHILD IS TERMINAL THEN LOOK AT UNCLE
return;
}
else
{
leftmostDerive(deriv, curr, line_no, rule_no); // RECURSIVELY ADD DERIVATION TO CURR
return;
}
}
else
{
curr->rule_no = rule_no;
parents = curr;
TREENODE temp = createEmptyNode();
temp->parent = curr;
temp->line_no = line_no;
temp->tnt = deriv->tnt;
if(temp->tnt == 0) temp->val.t_val = deriv->val.t_val;
else temp->val.nt_val = deriv->val.nt_val;
curr->firstChild = temp;
curr = curr->firstChild;
deriv = deriv->next;
}
}
while(deriv!=NULL)
{
TREENODE temp = createEmptyNode();
temp->parent = parents;
temp->tnt = deriv->tnt;
temp->line_no = line_no;
if(temp->tnt == 0) temp->val.t_val = deriv->val.t_val;
else temp->val.nt_val = deriv->val.nt_val;
curr->nextSibling = temp;
curr = curr->nextSibling;
deriv = deriv->next;
}
}
void printTree(TREENODE node, int level)
{
while (node != NULL)
{
for (int i = 0; i < level; i++) printf(" ");
printf("Level %d Node -> ", level);
if(node->tnt == 0) printT(node->val.t_val);
else
{
printNT(node->val.nt_val);
printf(" Rule: %d", node->rule_no);
}
printf("\n");
if (node->firstChild != NULL)
{
for (int i = 0; i < level; i++) printf(" ");
printf("Children: \n");
printTree(node->firstChild, level + 1);
}
node = node->nextSibling;
}
}
void runTree(void)
{
// TREENODE t1 = initTree();
// RULE temp = createNewRule(program, 0);
// addTermToRule(temp, 0, 0, 1);
// addTermToRule(temp, 0, 0, 0);
// addTermToRule(temp, 0, 1, 1);
// RULE temp2 = createNewRule(moduleDeclarations, 1);
// addTermToRule(temp2, 0, 0, 1);
// addTermToRule(temp2, 0, 0, 0);
// addTermToRule(temp2, 0, 0, 0);
// RULE temp3 = createNewRule(moduleDeclaration, 2);
// addTermToRule(temp3, 0, 0, 0);
// addTermToRule(temp3, 0, 0, 0);
// addTermToRule(temp3, 0, 0, 0);
// leftmostDerive(temp->head->next, t1);
// leftmostDerive(temp2->head->next, t1);
// leftmostDerive(temp3->head->next, t1);
// printTree(t1, 0);
}
void freeTree(TREENODE node)
{
if(node->tnt == 0) free(node);
else {
if (node->firstChild != NULL){
freeTree(node->firstChild);
}
if(node->nextSibling != NULL){
freeTree(node->nextSibling);
}
free(node);
}
}