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
227
228
229
230
231
232
233
234
235
236
237
238
239
|
#include "code_generator.h"
#include <compiler/parser/parser.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utils/memory/memory.h>
#include <utils/types.h>
#include "compiler/tree_parser/tree_parser.h"
const char *COMMAND_STRINGS[] = {
"COMMAND_NONE",
"COMMAND_CALL_FUNCTION",
"COMMAND_PUSH_STRING",
};
void printInstruction(Instruction instruction) {
printf("%s", COMMAND_STRINGS[instruction.command]);
switch (instruction.command) {
case COMMAND_NONE:
printf("\n");
return;
case COMMAND_CALL_FUNCTION:
case COMMAND_PUSH_STRING:
case COMMAND_POP_IDENTIFIER:
case COMMAND_PUSH_IDENTIFIER:
SizedString *sizedString = instruction.operand;
printf(" '%.*s'\n", (int)sizedString->size, sizedString->str);
return;
}
fprintf(stderr, "bad instruction %d\n", instruction.command);
}
void printInstructions(Instructions instructions) {
for (size_t i = 0; i < instructions.size; ++i) {
printInstruction(instructions.instructions[i]);
}
}
void deleteInstruction(Instruction instruction) {
switch (instruction.command) {
case COMMAND_NONE:
return;
case COMMAND_PUSH_STRING:
case COMMAND_CALL_FUNCTION:
case COMMAND_PUSH_IDENTIFIER:
case COMMAND_POP_IDENTIFIER:
SizedString *sizedString = instruction.operand;
free(sizedString->str);
free(sizedString);
return;
}
fprintf(stderr, "bad instruction %d\n", instruction.command);
}
void deleteInstructions(Instructions instructions) {
for (size_t i = 0; i < instructions.size; ++i) {
deleteInstruction(instructions.instructions[i]);
}
free(instructions.instructions);
}
Instructions codeGenerator(SourceCode *code) {
ParsedTree *root = treeParser(code);
if (root != NULL) {
Instructions instructions = _codeGenerator(root, code);
deleteParsedTree(root);
return instructions;
}
const Instructions error = {
.instructions = NULL,
.size = ERROR_SIZE,
};
return error;
}
Instructions codeGeneratorWithPrint(SourceCode *code) {
ParsedTree *root = treeParserWithPrint(code);
if (root != NULL) {
printf("----tree parsed:\n");
printParsedTreeNode(root);
Instructions instructions = _codeGenerator(root, code);
deleteParsedTree(root);
return instructions;
}
fprintf(stderr, "error in tree parser\n");
const Instructions error = {
.instructions = NULL,
.size = ERROR_SIZE,
};
return error;
}
Instructions _codeGenerator(ParsedTree *root, SourceCode *code) {
const TreeScopeMetadata *metadata = root->metadata;
size_t instructions_size = 10;
Instruction *instructions =
a404m_malloc(instructions_size * sizeof(*instructions));
size_t instructions_inserted = 0;
for (size_t i = 0; i < metadata->lines_size; ++i) {
ParsedTree *node = metadata->lines[i];
if (!nodeToInstruction(node, &instructions, &instructions_size,
&instructions_inserted, code)) {
goto RETURN_ERROR;
}
}
Instructions result = {
.instructions = a404m_realloc(
instructions, instructions_inserted * sizeof(*instructions)),
.size = instructions_inserted,
};
return result;
RETURN_ERROR:
free(instructions);
const Instructions error = {
.instructions = NULL,
.size = ERROR_SIZE,
};
return error;
}
bool nodeToInstruction(ParsedTree *tree, Instruction **instructions,
size_t *instructions_size, size_t *instructions_inserted,
SourceCode *code) {
/*printf("Parsing token = %s\n", TREE_TOKEN_STRINGS[tree->token]);*/
switch (tree->token) {
case TREE_TOKEN_FUNCTION_CALL: {
const TreeFunctionCallMetadata *tree_metadata = tree->metadata;
for (size_t i = 0; i < tree_metadata->values_size; ++i) {
if (!nodeToInstruction(tree_metadata->values[i], instructions,
instructions_size, instructions_inserted,
code)) {
return false;
}
}
CommandCallFunctionOperand *operand = a404m_malloc(sizeof(*operand));
operand->size =
tree_metadata->function->nameEnd - tree_metadata->function->nameBegin;
operand->str = a404m_malloc((operand->size + 1) * sizeof(char));
strncpy(operand->str, tree_metadata->function->nameBegin, operand->size);
const Instruction instruction = {
.command = COMMAND_CALL_FUNCTION,
.operand = operand,
};
insertInstruction(instruction, instructions, instructions_size,
instructions_inserted);
return true;
}
case TREE_TOKEN_IDENTIFIER: {
const TreeIdentifierMetadata *tree_metadata = tree->metadata;
CommandPushIdentifierOperand *operand = a404m_malloc(sizeof(*operand));
operand->size =
tree_metadata->variable->nameEnd - tree_metadata->variable->nameBegin;
operand->str = a404m_malloc((operand->size + 1) * sizeof(char));
strncpy(operand->str, tree_metadata->variable->nameBegin,
operand->size * sizeof(char));
const Instruction instruction = {
.command = COMMAND_PUSH_IDENTIFIER,
.operand = operand,
};
insertInstruction(instruction, instructions, instructions_size,
instructions_inserted);
return true;
}
case TREE_TOKEN_VALUE_STRING: {
const TreeStringValueMetadata *tree_metadata = tree->metadata;
CommandPushStringOperand *operand = a404m_malloc(sizeof(*operand));
operand->size = tree_metadata->size;
operand->str = a404m_malloc((operand->size + 1) * sizeof(char));
memcpy(operand->str, tree_metadata->str,
(operand->size + 1) * sizeof(char));
const Instruction instruction = {
.command = COMMAND_PUSH_STRING,
.operand = operand,
};
insertInstruction(instruction, instructions, instructions_size,
instructions_inserted);
return true;
}
case TREE_TOKEN_DEFINE_VARIABLE: {
const TreeDefineVariableMetadata *tree_metadata = tree->metadata;
if (tree_metadata->value == NULL) {
return true;
} else if (!nodeToInstruction(tree_metadata->value, instructions,
instructions_size, instructions_inserted,
code)) {
return false;
}
CommandPopIdentifierOperand *operand = a404m_malloc(sizeof(*operand));
operand->size = tree_metadata->nameEnd - tree_metadata->nameBegin;
operand->str = a404m_malloc((operand->size + 1) * sizeof(char));
strncpy(operand->str, tree_metadata->nameBegin, operand->size);
const Instruction instruction = {
.command = COMMAND_POP_IDENTIFIER,
.operand = operand,
};
insertInstruction(instruction, instructions, instructions_size,
instructions_inserted);
return true;
}
case TREE_TOKEN_DEFINE_CONSTANT:
return true;
case TREE_TOKEN_GLOBAL_SCOPE:
case TREE_TOKEN_LOCAL_SCOPE:
case TREE_TOKEN_STRUCT:
case TREE_TOKEN_FUNCTION:
case TREE_TOKEN_NONE:
case TREE_TOKEN_ROOT:
}
printError("Unhandled token %s\n", code, tree->strBegin, tree->strEnd,
TREE_TOKEN_STRINGS[tree->token]);
return false;
}
void insertInstruction(const Instruction instruction,
Instruction **restrict instructions,
size_t *restrict instructions_size,
size_t *restrict instructions_inserted) {
if (*instructions_inserted == *instructions_size) {
*instructions_size += *instructions_size / 2 + 1;
*instructions =
a404m_realloc(*instructions, *instructions_size * sizeof(Instruction));
}
(*instructions)[*instructions_inserted] = instruction;
++*instructions_inserted;
}
|
