-
Notifications
You must be signed in to change notification settings - Fork 0
/
ast.c
221 lines (191 loc) · 5.53 KB
/
ast.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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "ast.h"
ast_t *ast_new_unary(ast_unary_e op, ast_t *operand) {
if (!operand) {
fprintf(stderr, "Invalid operand\n");
return NULL;
}
// Allocate memory for the new AST node
ast_t *node = (ast_t *)malloc(sizeof(ast_t));
if (!node) {
fprintf(stderr, "Memory allocation failed\n");
exit(EXIT_FAILURE);
}
// Initialize the node
node->type = AST_UNARY;
node->unary.op = op;
node->unary.operand = operand;
return node;
}
ast_t *ast_new_binary(ast_binary_e op, ast_t *left, ast_t *right) {
// Allocate memory for the new AST node
ast_t *node = (ast_t *)malloc(sizeof(ast_t));
if (!node) {
fprintf(stderr, "Memory allocation failed\n");
exit(EXIT_FAILURE);
}
// Initialize the node
node->type = AST_BINARY;
node->binary.op = op;
node->binary.left = left;
node->binary.right = right;
return node;
}
// Function to create a new variable AST node
ast_t *ast_new_variable(char *name, var_type_e type) {
// Allocate memory for the new AST node
ast_t *node = (ast_t *)malloc(sizeof(ast_t));
if (!node) {
fprintf(stderr, "Memory allocation failed\n");
exit(EXIT_FAILURE);
}
// Initialize the node type
node->type = AST_VARIABLE;
// Allocate and copy the variable name
node->var.name = (char *)malloc(strlen(name) + 1);
if (!node->var.name) {
fprintf(stderr, "Memory allocation failed\n");
free(node);
exit(EXIT_FAILURE);
}
strcpy(node->var.name, name);
// Set the variable type
node->var.type = type;
return node;
}
ast_t *ast_new_function(char *name, var_type_e return_type, ast_list_t *params, ast_list_t *stmts) {
// Allocate memory for the new AST node
ast_t *node = (ast_t *)malloc(sizeof(ast_t));
if (!node) {
fprintf(stderr, "Memory allocation failed\n");
exit(EXIT_FAILURE);
}
// Initialize the node
node->type = AST_FUNCTION;
node->function.name = strdup(name);
if (!node->function.name) {
fprintf(stderr, "Memory allocation failed\n");
free(node);
exit(EXIT_FAILURE);
}
node->function.return_type = return_type;
node->function.params = params;
node->function.stmts = stmts;
return node;
}
ast_t *ast_new_fncall(char *name, ast_list_t *args) {
ast_t *node = (ast_t *)malloc(sizeof(ast_t));
if (!node) {
fprintf(stderr, "Memory allocation failed\n");
exit(EXIT_FAILURE);
}
node->type = AST_FNCALL;
node->call.name = strdup(name);
if (!node->call.name) {
fprintf(stderr, "Memory allocation failed\n");
free(node);
exit(EXIT_FAILURE);
}
node->call.args = args;
return node;
}
ast_t *ast_new_comp_stmt(ast_list_t *stmts) {
ast_t *node = (ast_t *)malloc(sizeof(ast_t));
if (!node) {
fprintf(stderr, "Memory allocation failed\n");
exit(EXIT_FAILURE);
}
node->type = AST_COMPOUND_STATEMENT;
node->compound_stmt.stmts = stmts;
return node;
}
ast_t *ast_new_integer(long val) {
ast_t *node = (ast_t *)malloc(sizeof(ast_t));
if (!node) {
fprintf(stderr, "Memory allocation failed\n");
exit(EXIT_FAILURE);
}
node->type = AST_INTEGER;
node->integer = val;
return node;
}
ast_t *ast_new_assignment(ast_t *lvalue, ast_t *rvalue) {
if (!lvalue || !rvalue) {
fprintf(stderr, "Invalid lvalue or rvalue\n");
return NULL;
}
// Allocate memory for the new AST node
ast_t *node = (ast_t *)malloc(sizeof(ast_t));
if (!node) {
fprintf(stderr, "Memory allocation failed\n");
return NULL;
}
// Initialize the node
node->type = AST_ASSIGNMENT;
node->assignment.lvalue = lvalue;
node->assignment.rvalue = rvalue;
return node;
}
ast_t *ast_new_loop(ast_t *condition, ast_t *stmt) {
ast_t *node = (ast_t *)malloc(sizeof(ast_t));
if (!node) {
fprintf(stderr, "Memory allocation failed\n");
exit(EXIT_FAILURE);
}
node->type = AST_LOOP;
node->loop.condition = condition;
node->loop.stmt = stmt;
return node;
}
ast_t *ast_new_return(ast_t *expr) {
ast_t *node = (ast_t *)malloc(sizeof(ast_t));
if (!node) {
fprintf(stderr, "Memory allocation failed\n");
exit(EXIT_FAILURE);
}
node->type = AST_RETURN;
node->ret.expr = expr;
return node;
}
ast_t *ast_new_declaration(ast_t *lvalue, ast_t *rvalue) {
if (!lvalue || !rvalue) {
fprintf(stderr, "Invalid lvalue or rvalue\n");
return NULL;
}
// Allocate memory for the new AST node
ast_t *node = (ast_t *)malloc(sizeof(ast_t));
if (!node) {
fprintf(stderr, "Memory allocation failed\n");
return NULL;
}
// Initialize the node
node->type = AST_DECLARATION;
node->assignment.lvalue = lvalue;
node->assignment.rvalue = rvalue;
return node;
}
ast_list_t *ast_list_new_node(ast_t *elem) {
ast_list_t *node = (ast_list_t *)malloc(sizeof(ast_list_t));
if (!node) {
fprintf(stderr, "Memory allocation failed\n");
exit(EXIT_FAILURE);
}
node->elem = elem;
node->next = NULL;
return node;
}
ast_list_t *ast_list_add(ast_list_t **list, ast_t *elem) {
ast_list_t *node = ast_list_new_node(elem);
if (!*list) {
*list = node;
} else {
ast_list_t *current = *list;
while (current->next) {
current = current->next;
}
current->next = node;
}
return node;
}