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
|
/*
* Copyright (C) 2023 Johnny Richard
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "ast.h"
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
ast_node_t *
ast_node_new()
{
ast_node_t *node = (ast_node_t *)malloc(sizeof(ast_node_t));
if (node == NULL) {
printf("OOO: could no allocate a node");
exit(EXIT_FAILURE);
}
node->kind = AST_UNKOWN_NODE;
return node;
}
static void
ast_node_destroy_vector(vector_t *vector)
{
for (size_t i = 0; i < vector->size; i++) {
ast_node_destroy(vector_at(vector, i));
}
vector_destroy(vector);
}
void
ast_node_destroy(ast_node_t *node)
{
switch (node->kind) {
case AST_FUNCTION_DECLARATION:
ast_node_destroy_vector(node->data.function.body);
break;
case AST_BINARY_OPERATION:
ast_node_destroy(node->data.binary_operation.left);
ast_node_destroy(node->data.binary_operation.right);
break;
case AST_VARIABLE_DECLARATION:
ast_node_destroy(node->data.variable.value);
break;
case AST_LITERAL:
break;
case AST_RETURN_STMT:
ast_node_destroy(node->data.return_stmt.argument);
break;
case AST_IDENTIFIER:
break;
case AST_UNKOWN_NODE:
break;
default:
assert(false && "unmapped free strategy");
}
free(node);
}
void
ast_node_init_return_stmt(ast_node_t *node, ast_node_t *argument)
{
node->kind = AST_RETURN_STMT;
node->data.return_stmt = (ast_return_stmt_t){ .argument = argument };
}
void
ast_node_init_function_declaration(ast_node_t *node, string_view_t function_name, type_t return_type, vector_t *body)
{
node->kind = AST_FUNCTION_DECLARATION;
node->data = (ast_node_data_t){
.function = { .identifier = { .name = function_name }, .return_type = return_type, .body = body }
};
}
void
ast_literal_integer_create(ast_node_t *node, uint32_t number)
{
node->kind = AST_LITERAL;
node->data.literal = (ast_literal_t){ .kind = AST_LITERAL_INTEGER, .value = { .integer = number } };
}
void
ast_node_init_binary_operation(ast_node_t *node, ast_binary_operation_kind_t kind, ast_node_t *left, ast_node_t *right)
{
node->kind = AST_BINARY_OPERATION;
node->data = (ast_node_data_t){ .binary_operation = { .kind = kind, .left = left, .right = right } };
}
void
ast_node_init_variable_declaration(ast_node_t *node, string_view_t variable_name, type_t type, ast_node_t *value)
{
node->kind = AST_VARIABLE_DECLARATION;
node->data =
(ast_node_data_t){ .variable = { .identifier = { .name = variable_name }, .type = type, .value = value } };
}
void
ast_node_init_identifier(ast_node_t *node, string_view_t name)
{
node->kind = AST_IDENTIFIER;
node->data.identifier = (ast_identifier_t){ .name = name };
}
|
