-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnodes.cpp
179 lines (159 loc) · 4.22 KB
/
nodes.cpp
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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
#include "nodes.h"
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
Node *allocateNodeMemory(NodeTag node_tag) {
Node *new_node;
switch (node_tag) {
case T_ASSIGN:
new_node = (Node*)malloc(sizeof(AssignNode));
break;
case T_EXPR:
new_node = (Node*)malloc(sizeof(ExprNode));
break;
case T_IDENT:
new_node = (Node*)malloc(sizeof(IdentNode));
break;
case T_FLT_CONST:
new_node = (Node*)malloc(sizeof(FltNode));
break;
case T_INT_CONST:
new_node = (Node*)malloc(sizeof(IntNode));
break;
case T_SYNTAX_ERROR:
new_node = (Node*)malloc(sizeof(SyntaxErrNode));
break;
}
new_node->type = node_tag;
return new_node;
}
void freeNodeMemory(void **node_ptr) {
if (node_ptr != NULL && *node_ptr != NULL) {
free(*node_ptr);
*node_ptr = NULL;
}
}
IntNode *makeIntNode(const char* value) {
IntNode *int_node = (IntNode*)allocateNodeMemory(T_INT_CONST);
int_node->value = atoi(value);
return int_node;
}
FltNode *makeFltNode(const char* value) {
FltNode *flt_node = (FltNode*)allocateNodeMemory(T_FLT_CONST);
flt_node->value = atof(value);
return flt_node;
}
IdentNode *makeIdentNode(const char* ident) {
IdentNode *id_node = (IdentNode*)allocateNodeMemory(T_IDENT);
int ident_len = strlen(ident) + 1;
id_node->identifier = (char*)malloc(ident_len);
strncpy(id_node->identifier, ident, ident_len);
id_node->declaration = NULL;
return id_node;
}
void deleteIdentNode(IdentNode *node) {
free(node->identifier);
freeNodeMemory((void**)&node);
}
ExprNode *makeExprNode(char op, Node* oprnd1, Node* oprnd2) {
ExprNode *expr_node = (ExprNode*)allocateNodeMemory(T_EXPR);
expr_node->left = oprnd1;
expr_node->right = oprnd2;
expr_node->opcode = op;
return expr_node;
}
void deleteExprNode(ExprNode *node) {
deleteNode(node->left);
deleteNode(node->right);
freeNodeMemory((void**)&node);
}
AssignNode *makeAssignNode(IdentNode* id, Node* val) {
AssignNode *assign_node = (AssignNode*)allocateNodeMemory(T_ASSIGN);
assign_node->target = id;
assign_node->value = val;
assign_node->resolved_value = NULL;
return assign_node;
}
void deleteAssignNode(AssignNode *node) {
if (node != NULL) {
if (node->resolved_value != NULL) {
free (node->resolved_value);
}
if (node->value != NULL) {
deleteNode(node->value);
}
if (node->target != NULL) {
deleteIdentNode(node->target);
}
freeNodeMemory((void**)&node);
}
}
SyntaxErrNode *makeSyntaxErrNode(const char *error) {
SyntaxErrNode *syntax_error = (SyntaxErrNode*)allocateNodeMemory(T_SYNTAX_ERROR);
int msg_len = strlen(error) + 1;
syntax_error->error_message = (char*)malloc(msg_len);
strncpy(syntax_error->error_message, error, msg_len);
return syntax_error;
}
void deleteSyntaxErrNode(SyntaxErrNode *node) {
free(node->error_message);
freeNodeMemory((void**)&node);
}
void deleteNode(Node *node) {
switch (node->type) {
case T_ASSIGN:
deleteAssignNode((AssignNode*)node); break;
case T_IDENT:
deleteIdentNode((IdentNode*)node); break;
case T_EXPR:
deleteExprNode((ExprNode*)node); break;
case T_SYNTAX_ERROR:
deleteSyntaxErrNode((SyntaxErrNode*)node); break;
default:
freeNodeMemory((void**)&node); break;
}
}
bool genericDeleteNode(void *node) {
deleteNode((Node*)node);
return true;
}
// TODO Figure out best way to visit nodes
// Does this need to be a recursive function?
void displayNode(Node *node) {
switch (node->type) {
case T_ASSIGN:
displayAssignNode((AssignNode*)node);
break;
case T_EXPR:
displayExprNode((ExprNode*)node);
break;
case T_IDENT:
displayIdentNode((IdentNode*)node);
break;
case T_FLT_CONST:
displayFltNode((FltNode*)node);
break;
case T_INT_CONST:
displayIntNode((IntNode*)node);
break;
}
}
void displayIntNode(IntNode* node) {
printf(" [T_INT_CONST:%d] ", node->value);
}
void displayFltNode(FltNode* node) {
printf(" [T_FLT_CONST:%f] ", node->value);
}
void displayIdentNode(IdentNode* node) {
printf(" [T_IDENT:%s] ", node->identifier);
}
void displayExprNode(ExprNode* node) {
displayNode(node->left);
displayNode(node->right);
printf(" [T_EXPR:%c] ", node->opcode);
}
void displayAssignNode(AssignNode* node) {
displayIdentNode(node->target);
printf(" [T_ASSIGN] ");
displayNode(node->value);
}