feature-AST-using-arena #8

Merged
laentropia merged 2 commits from feature-AST-using-arena into main 2026-04-23 12:34:30 -06:00
7 changed files with 52 additions and 36 deletions
Showing only changes of commit 7ad4eba123 - Show all commits

View File

@@ -2,8 +2,10 @@
#define EVALUATOR_H
#include "lexer.h"
#include "parser.h"
#include <stdint.h>
int64_t evaluate(ASTNode *tree);
int64_t evaluate(ParseResult context);
int64_t evaluate_tree(ASTNode *tree);
#endif // !EVALUATOR_H

View File

@@ -15,8 +15,8 @@ typedef struct {
} ASTNodeSlice;
typedef struct {
Arena *arena;
AST tree;
Arena arena;
ASTNode *tree;
} ParseResult;
ASTNode ASTNodeSlice_peek(ASTNodeSlice *slice);

View File

@@ -1,9 +1,11 @@
#include "evaluator.h"
#include "arena.h"
#include "lexer.h"
#include "parser.h"
#include <stdint.h>
int64_t evaluate(ASTNode *tree) {
int64_t evaluate_tree(ASTNode *tree) {
if (tree->type == NODE_BINARY_OP) {
Operator op = tree->data.binary.op;
ASTNode *left = tree->data.binary.left;
@@ -11,18 +13,24 @@ int64_t evaluate(ASTNode *tree) {
switch (op) {
case OP_ADD:
return evaluate(left) + evaluate(right);
return evaluate_tree(left) + evaluate_tree(right);
case OP_SUB:
return evaluate(left) - evaluate(right);
return evaluate_tree(left) - evaluate_tree(right);
case OP_MUL:
return evaluate(left) * evaluate(right);
return evaluate_tree(left) * evaluate_tree(right);
case OP_DIV:
return evaluate(left) / evaluate(right);
return evaluate_tree(left) / evaluate_tree(right);
}
} else {
int64_t return_val = tree->data.integer;
return return_val;
}
int64_t return_val = tree->data.integer;
return return_val;
}
int64_t evaluate(ParseResult context) {
int64_t result = evaluate_tree(context.tree);
arena_destroy(&context.arena);
return result;
}

View File

@@ -23,9 +23,7 @@ int main(void) {
tokenize(buf, &context);
ParseResult par = parse(&context);
AST tree = par.tree;
int64_t result = evaluate(tree.head);
arena_destroy(par.arena);
int64_t result = evaluate(par);
printf("El resultado es: %" PRIi64 "\n", result);

View File

@@ -63,15 +63,15 @@ bool ASTNodeSlice_is_valid(ASTNodeSlice *slice) {
}
ParseResult parse(ASTNodeArray *arr) {
AST tree;
ASTNodeSlice context = {
.arr = arr,
.pos = 0,
};
Arena arena = arena_init(sizeof(ASTNode) * arr->len).arena;
tree.head = parse_expr(&context, &arena, 0);
return (ParseResult) {.arena = &arena, .tree = tree};
return (ParseResult) {
.arena = arena,
.tree = parse_expr(&context, &arena, 0)};
}
ASTNode *parse_expr(ASTNodeSlice *slice, Arena *arena, uint8_t min_bp) {
@@ -107,7 +107,17 @@ ASTNode *parse_expr(ASTNodeSlice *slice, Arena *arena, uint8_t min_bp) {
ASTNodeSlice_next(slice);
ASTNode *right_side = parse_expr(slice, arena, rbp);
ASTNode *new_node = malloc(sizeof(ASTNode));
arena_ensure_capacity(
arena,
sizeof(ASTNode),
alignof(ASTNode));
ASTNode *new_node = arena_unwrap_pointer(
arena_alloc(
arena,
sizeof(ASTNode),
alignof(ASTNode)
)
);
*new_node = operator;
new_node->data.binary.left = left_side;

View File

@@ -17,8 +17,7 @@ static void test_basic_evaluation(void** state) {
tokenize(expr, &context);
ParseResult result = parse(&context);
AST tree = result.tree;
uint64_t value = evaluate(tree.head);
int64_t value = evaluate(result);
assert_int_equal(value, 82);
}

View File

@@ -19,58 +19,57 @@ static void test_parsing_basic_expression(void **state) {
assert_int_equal(tokens.len, 7);
ParseResult result = parse(&tokens);
AST tree = result.tree;
// Assert head is +
assert_int_equal(tree.head->type, NODE_BINARY_OP);
assert_int_equal(tree.head->data.binary.op, OP_ADD);
assert_int_equal(result.tree->type, NODE_BINARY_OP);
assert_int_equal(result.tree->data.binary.op, OP_ADD);
assert_int_equal(tree.head->data.binary.left->type, NODE_INTEGER);
assert_int_equal(tree.head->data.binary.left->data.integer, 2);
assert_int_equal(result.tree->data.binary.left->type, NODE_INTEGER);
assert_int_equal(result.tree->data.binary.left->data.integer, 2);
assert_int_equal(
tree.head->data.binary.right->type,
result.tree->data.binary.right->type,
NODE_BINARY_OP
);
assert_int_equal(
tree.head->data.binary.right->data.binary.op,
result.tree->data.binary.right->data.binary.op,
OP_MUL
);
assert_int_equal(
tree.head->data.binary.right->data.binary.right->type,
result.tree->data.binary.right->data.binary.right->type,
NODE_INTEGER);
assert_int_equal(
tree.head->data.binary.right->data.binary.right->data.integer,
result.tree->data.binary.right->data.binary.right->data.integer,
789);
assert_int_equal(
tree.head->data.binary.right->data.binary.left->type,
result.tree->data.binary.right->data.binary.left->type,
NODE_BINARY_OP
);
assert_int_equal(
tree.head->data.binary.right->data.binary.left->data.binary.op,
result.tree->data.binary.right->data.binary.left->data.binary.op,
OP_DIV
);
assert_int_equal(
tree.head->data.binary.right->data.binary.left->data.binary.right->type,
result.tree->data.binary.right->data.binary.left->data.binary.right->type,
NODE_INTEGER
);
assert_int_equal(
tree.head->data.binary.right->data.binary.left->data.binary.right->data.integer,
result.tree->data.binary.right->data.binary.left->data.binary.right->data.integer,
66
);
assert_int_equal(
tree.head->data.binary.right->data.binary.left->data.binary.left->type,
result.tree->data.binary.right->data.binary.left->data.binary.left->type,
NODE_INTEGER
);
assert_int_equal(
tree.head->data.binary.right->data.binary.left->data.binary.left->data.integer,
result.tree->data.binary.right->data.binary.left->data.binary.left->data.integer,
3
);
arena_destroy(result.arena);
arena_destroy(&result.arena);
}
int main(void) {