diff --git a/include/evaluator.h b/include/evaluator.h index d176bd2..7b34e2b 100644 --- a/include/evaluator.h +++ b/include/evaluator.h @@ -2,9 +2,10 @@ #define EVALUATOR_H #include "lexer.h" -#include "arena.h" +#include "parser.h" #include -int64_t evaluate(ASTNode *tree); +int64_t evaluate(ParseResult context); +int64_t evaluate_tree(ASTNode *tree); #endif // !EVALUATOR_H diff --git a/include/parser.h b/include/parser.h index 03d5443..7c2fa4f 100644 --- a/include/parser.h +++ b/include/parser.h @@ -14,6 +14,11 @@ typedef struct { size_t pos; } ASTNodeSlice; +typedef struct { + Arena arena; + ASTNode *tree; +} ParseResult; + ASTNode ASTNodeSlice_peek(ASTNodeSlice *slice); ASTNode ASTNodeSlice_next(ASTNodeSlice *slice); bool ASTNodeSlice_is_valid(ASTNodeSlice *slice); @@ -24,7 +29,7 @@ ASTNode *led(ASTNodeSlice *slice, size_t right_precedence); uint8_t node_lbp(ASTNode node); uint8_t node_rbp(ASTNode node); -AST parse(ASTNodeArray *arr); -ASTNode *parse_expr(ASTNodeSlice *slice, uint8_t min_bp); +ParseResult parse(ASTNodeArray *arr); +ASTNode *parse_expr(ASTNodeSlice *slice, Arena *arena, uint8_t min_bp); #endif // !PARSER_H diff --git a/src/evaluator.c b/src/evaluator.c index 219f854..36d9fb1 100644 --- a/src/evaluator.c +++ b/src/evaluator.c @@ -1,31 +1,36 @@ #include "evaluator.h" +#include "arena.h" #include "lexer.h" +#include "parser.h" #include -#include -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; ASTNode *right = tree->data.binary.right; - free(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; - free(tree); - 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; +} diff --git a/src/main.c b/src/main.c index 26053e9..9cc1240 100644 --- a/src/main.c +++ b/src/main.c @@ -1,3 +1,4 @@ +#include "arena.h" #include "evaluator.h" #include "lexer.h" #include "parser.h" @@ -21,8 +22,8 @@ int main(void) { ASTNodeArray context; tokenize(buf, &context); - AST tree = parse(&context); - int64_t result = evaluate(tree.head); + ParseResult par = parse(&context); + int64_t result = evaluate(par); printf("El resultado es: %" PRIi64 "\n", result); diff --git a/src/parser.c b/src/parser.c index 6803508..2e417c5 100644 --- a/src/parser.c +++ b/src/parser.c @@ -1,6 +1,7 @@ #include "parser.h" #include "lexer.h" #include "arena.h" +#include #include #include #include @@ -61,19 +62,33 @@ bool ASTNodeSlice_is_valid(ASTNodeSlice *slice) { return true; } -AST parse(ASTNodeArray *arr) { - AST tree; +ParseResult parse(ASTNodeArray *arr) { ASTNodeSlice context = { .arr = arr, .pos = 0, }; + Arena arena = arena_init(sizeof(ASTNode) * arr->len).arena; - tree.head = parse_expr(&context, 0); - return tree; + return (ParseResult) { + .arena = arena, + .tree = parse_expr(&context, &arena, 0)}; } -ASTNode *parse_expr(ASTNodeSlice *slice, uint8_t min_bp) { - ASTNode *left_side = malloc(sizeof(ASTNode)); +ASTNode *parse_expr(ASTNodeSlice *slice, Arena *arena, uint8_t min_bp) { + arena_ensure_capacity( + arena, + sizeof(ASTNode), + alignof(ASTNode) + ); + + ASTNode *left_side = arena_unwrap_pointer( + arena_alloc( + arena, + sizeof(ASTNode), + alignof(ASTNode) + ) + ); + *left_side = ASTNodeSlice_next(slice); while (true) { @@ -90,9 +105,19 @@ ASTNode *parse_expr(ASTNodeSlice *slice, uint8_t min_bp) { } ASTNodeSlice_next(slice); - ASTNode *right_side = parse_expr(slice, rbp); + 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; diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt index 62e14d1..b48356f 100644 --- a/test/CMakeLists.txt +++ b/test/CMakeLists.txt @@ -3,6 +3,7 @@ find_package(cmocka REQUIRED) add_executable(test_nodeArray test_ASTNodeArray.c) add_executable(test_lexer test_lexer.c) add_executable(test_parser test_parser.c) +add_executable(test_evaluator test_evaluator.c) target_link_libraries(test_nodeArray calculator_lib @@ -19,6 +20,12 @@ target_link_libraries(test_parser cmocka::cmocka ) +target_link_libraries(test_evaluator + calculator_lib + cmocka::cmocka +) + add_test(NAME nodeArray_tests COMMAND test_nodeArray) add_test(NAME lexer_tests COMMAND test_lexer) add_test(NAME parser_tests COMMAND test_parser) +add_test(NAME evaluator_tests COMMAND test_evaluator) diff --git a/test/test_evaluator.c b/test/test_evaluator.c index cf97930..a8f5bd1 100644 --- a/test/test_evaluator.c +++ b/test/test_evaluator.c @@ -16,8 +16,8 @@ static void test_basic_evaluation(void** state) { ASTNodeArray context; tokenize(expr, &context); - AST tree = parse(&context); - uint64_t value = evaluate(tree.head); + ParseResult result = parse(&context); + int64_t value = evaluate(result); assert_int_equal(value, 82); } diff --git a/test/test_parser.c b/test/test_parser.c index 83a6592..0fe3c20 100644 --- a/test/test_parser.c +++ b/test/test_parser.c @@ -1,3 +1,4 @@ +#include "arena.h" #include "lexer.h" #include "parser.h" #include @@ -17,57 +18,58 @@ static void test_parsing_basic_expression(void **state) { assert_int_equal(tokenize(expr, &tokens), LEXER_OK); assert_int_equal(tokens.len, 7); - AST tree = parse(&tokens); + ParseResult result = parse(&tokens); // 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); } int main(void) {