wash/ivy
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

lang: ast: implement ast iteration

Browse Source 
iteration is implementing without recursion, instead using type-specific callbacks to construct a queue of nodes to iterate through. ast priting is implemented using this functionality.
This commit is contained in:
max 🍓
2024-11-24 20:50:12 +00:00
parent 5622073252
commit 1e7e73db21
7 changed files with 188 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
lang/ast/unit.c
View File

@@ -2,6 +2,7 @@
#include "ctx.h"
#include "node.h"
#include "unit-package.h"
#include "iterate.h"
static enum ivy_status parse_package_keyword(
struct ivy_parser *ctx, struct ivy_token *tok)
@@ -18,13 +19,19 @@ static enum ivy_status add_child(
return IVY_OK;
}
static void print(struct ivy_ast_node *node)
static void collect_children(struct ivy_ast_node *node, struct ivy_ast_node_iterator *iterator)
{
struct ivy_ast_unit_node *unit = (struct ivy_ast_unit_node *)node;
b_queue_iterator it = {0};
b_queue_foreach (&it, &unit->n_children) {
struct ivy_ast_node *child = b_unbox(struct ivy_ast_node, it.entry, n_entry);
ast_node_iterator_enqueue_node(iterator, node, child);
}
}
struct ast_node_type unit_node_ops = {
.n_add_child = add_child,
.n_print = print,
.n_collect_children = collect_children,
.n_state_size = sizeof(struct parser_state),
.n_node_size = sizeof(struct ivy_ast_unit_node),
.n_keyword_parsers = {