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
222
223
224
225
226
|
#include "ast-tree.h"
#include "compiler/parser.h"
#include "utils/log.h"
#include "utils/memory.h"
#include <stdio.h>
#include <stdlib.h>
const char *AST_TREE_TOKEN_STRINGS[] = {
"AST_TREE_TOKEN_FUNCTION",
"AST_TREE_TOKEN_KEYWORD_PRINT",
"AST_TREE_TOKEN_NONE",
};
void astTreePrint(const AstTree *tree, int indent) {
for (int i = 0; i < indent; ++i)
printf(" ");
printf("{token=\"%s\"", AST_TREE_TOKEN_STRINGS[tree->token]);
switch (tree->token) {
case AST_TREE_TOKEN_FUNCTION:
AstTreeScope *metadata = tree->metadata;
printf(",\n");
for (int i = 0; i < indent; ++i)
printf(" ");
printf("expressions=[\n");
for (size_t i = 0; i < metadata->expressions_size; ++i) {
astTreePrint(&metadata->expressions[i], indent + 1);
printf(",\n");
}
for (int i = 0; i < indent; ++i)
printf(" ");
printf("]");
case AST_TREE_TOKEN_KEYWORD_PRINT:
goto RETURN_SUCCESS;
case AST_TREE_TOKEN_NONE:
}
printLog("Bad token '%d'", tree->token);
exit(1);
RETURN_SUCCESS:
printf("}");
}
void astTreeRootPrint(const AstTreeRoot *root) {
for (size_t i = 0; i < root->variables.size; ++i) {
const AstTreeVariable *variable = root->variables.data[i];
printf("{\nname=\"%.*s\",\nvalue=\n",
(int)(variable->name_end - variable->name_begin),
variable->name_begin);
astTreePrint(variable->value, 1);
printf("\n},\n");
}
}
void astTreeDestroy(AstTree tree) {
switch (tree.token) {
case AST_TREE_TOKEN_FUNCTION:
AstTreeScope *metadata = tree.metadata;
for (size_t i = 0; i < metadata->expressions_size; ++i) {
astTreeDestroy(metadata->expressions[i]);
}
case AST_TREE_TOKEN_KEYWORD_PRINT:
return;
case AST_TREE_TOKEN_NONE:
}
printLog("Bad token '%d'", tree.token);
exit(1);
}
void astTreeDelete(AstTree *tree) {
astTreeDestroy(*tree);
free(tree);
}
void astTreeRootDelete(AstTreeRoot *root) {
for (size_t i = 0; i < root->variables.size; ++i) {
astTreeDelete(root->variables.data[i]->value);
}
free(root->variables.data);
free(root);
}
AstTree *newAstTree(AstTreeToken token, void *metadata) {
AstTree *result = a404m_malloc(sizeof(*result));
result->token = token;
result->metadata = metadata;
return result;
}
AstTreeRoot *makeAstTree(ParserNode *parsedRoot) {
if (parsedRoot->token != PARSER_TOKEN_ROOT) {
return NULL;
}
ParserNodeArray *nodes = parsedRoot->metadata;
AstTreeRoot *root = a404m_malloc(sizeof(*root));
size_t variables_size = nodes->size;
root->variables.data =
a404m_malloc(variables_size * sizeof(*root->variables.data));
root->variables.size = 0;
for (size_t i = 0; i < nodes->size; ++i) {
ParserNode *eol = nodes->data[i];
if (eol->token != PARSER_TOKEN_SYMBOL_EOL) {
printLog("Unexpected %s", PARSER_TOKEN_STRINGS[eol->token]);
goto RETURN_ERROR;
}
ParserNode *node = (ParserNodeEOLMetadata *)eol->metadata;
if (node->token != PARSER_TOKEN_CONSTANT) {
printLog("Unexpected %s", PARSER_TOKEN_STRINGS[node->token]);
goto RETURN_ERROR;
}
ParserNodeVariableMetadata *node_metadata = node->metadata;
AstTreeVariable *variable = a404m_malloc(sizeof(*variable));
variable->name_begin = node_metadata->name->str_begin;
variable->name_end = node_metadata->name->str_end;
pushVariable(&root->variables, &variables_size, variable);
}
for (size_t i = 0; i < nodes->size; ++i) {
ParserNode *node = (ParserNodeEOLMetadata *)nodes->data[i]->metadata;
ParserNodeVariableMetadata *node_metadata = node->metadata;
// TODO: check type
AstTree *tree = astTreeParse(node_metadata->value, &root->variables, 1);
if (tree == NULL) {
goto RETURN_ERROR;
}
root->variables.data[i]->value = tree;
}
return root;
RETURN_ERROR:
free(root->variables.data);
free(root);
return NULL;
}
void pushVariable(AstTreeVariables *variables, size_t *variables_size,
AstTreeVariable *variable) {
if (*variables_size == variables->size) {
*variables_size += *variables_size / 2 + 1;
variables->data = a404m_realloc(variables->data,
*variables_size * sizeof(*variables->data));
}
variables->data[variables->size] = variable;
variables->size += 1;
}
AstTree *astTreeParse(ParserNode *parserNode, AstTreeVariables *variables,
size_t variables_size) {
switch (parserNode->token) {
case PARSER_TOKEN_KEYWORD_PRINT:
return newAstTree(AST_TREE_TOKEN_KEYWORD_PRINT, NULL);
case PARSER_TOKEN_FUNCTION_DEFINITION:
return astTreeParseFunction(parserNode, variables, variables_size);
case PARSER_TOKEN_SYMBOL_EOL:
case PARSER_TOKEN_SYMBOL_PARENTHESIS:
case PARSER_TOKEN_SYMBOL_CURLY_BRACKET:
case PARSER_TOKEN_CONSTANT:
case PARSER_TOKEN_IDENTIFIER:
case PARSER_TOKEN_TYPE_VOID:
case PARSER_TOKEN_TYPE_FUNCTION:
case PARSER_TOKEN_NONE:
case PARSER_TOKEN_ROOT:
}
printLog("Bad token %d", parserNode->token);
return NULL;
}
AstTree *astTreeParseFunction(ParserNode *parserNode,
AstTreeVariables *variables,
size_t variables_size) {
ParserNodeFunctionDefnitionMetadata *node_metadata = parserNode->metadata;
ParserNodeArray *body = node_metadata->body->metadata;
AstTreeScope *scope = a404m_malloc(sizeof(*scope));
size_t expressions_size = 0;
scope->expressions =
a404m_malloc(expressions_size * sizeof(*scope->expressions));
scope->expressions_size = 0;
for (size_t i = 0; i < body->size; ++i) {
ParserNode *eol = body->data[i];
if (eol->token != PARSER_TOKEN_SYMBOL_EOL) {
printLog("Unexpected %s", PARSER_TOKEN_STRINGS[eol->token]);
goto RETURN_ERROR;
}
ParserNode *node = (ParserNodeEOLMetadata *)eol->metadata;
AstTree *tree = astTreeParse(node, variables, variables_size);
if (tree == NULL) {
goto RETURN_ERROR;
}
if (expressions_size == scope->expressions_size) {
expressions_size += expressions_size / 2 + 1;
scope->expressions = a404m_realloc(
scope->expressions, expressions_size * sizeof(*scope->expressions));
}
scope->expressions[scope->expressions_size] = *tree;
scope->expressions_size += 1;
free(tree);
}
scope->expressions =
a404m_realloc(scope->expressions,
scope->expressions_size * sizeof(*scope->expressions));
AstTree *result = newAstTree(AST_TREE_TOKEN_FUNCTION, scope);
return result;
RETURN_ERROR:
free(scope->expressions);
free(scope);
return NULL;
}
|
