40 lines
1.1 KiB
C
40 lines
1.1 KiB
C
#include <ivy/lang/ast.h>
|
|
#include "ctx.h"
|
|
#include "node.h"
|
|
#include "iterate.h"
|
|
|
|
static enum ivy_status parse_package_keyword(
|
|
struct ivy_parser *ctx, struct ivy_token *tok)
|
|
{
|
|
parser_push_state(ctx, IVY_AST_UNIT_PACKAGE);
|
|
return IVY_OK;
|
|
}
|
|
|
|
static enum ivy_status add_child(
|
|
struct ivy_ast_node *parent, struct ivy_ast_node *child)
|
|
{
|
|
struct ivy_ast_unit_node *unit = (struct ivy_ast_unit_node *)parent;
|
|
b_queue_push_back(&unit->n_children, &child->n_entry);
|
|
return IVY_OK;
|
|
}
|
|
|
|
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_collect_children = collect_children,
|
|
.n_state_size = sizeof(struct parser_state),
|
|
.n_node_size = sizeof(struct ivy_ast_unit_node),
|
|
.n_keyword_parsers = {
|
|
[IVY_KW_PACKAGE] = parse_package_keyword,
|
|
},
|
|
};
|