ivy/lang/ast/block.c

#include "block.h"

#include "ctx.h"
#include "expr/expr.h"
#include "iterate.h"
#include "node.h"

#include <blue/object/string.h>
#include <ivy/lang/lex.h>

static struct token_parse_result parse_end(
	struct ivy_parser *ctx, struct ivy_token *tok)
{
	struct block_parser_state *state
		= parser_get_state(ctx, struct block_parser_state);

	struct ivy_ast_block_node *node
		= (struct ivy_ast_block_node *)(state->s_base.s_node);

	int flags = 0;
	if (state->s_terminator == IVY_KW_END) {
		flags = PARSE_REPEAT_TOKEN;
	}

	parser_pop_state(ctx, STATE_ADD_NODE_TO_PARENT);
	return PARSE_RESULT(IVY_OK, flags);
}

static struct token_parse_result parse_else(
	struct ivy_parser *ctx, struct ivy_token *tok)
{
	struct block_parser_state *state
		= parser_get_state(ctx, struct block_parser_state);

	struct ivy_ast_block_node *node
		= (struct ivy_ast_block_node *)(state->s_base.s_node);

	parser_pop_state(ctx, STATE_ADD_NODE_TO_PARENT);
	return PARSE_RESULT(IVY_OK, PARSE_REPEAT_TOKEN);
}

static struct token_parse_result parse_symbol(
	struct ivy_parser *ctx, struct ivy_token *tok)
{
	struct block_parser_state *state
		= parser_get_state(ctx, struct block_parser_state);

	struct ivy_ast_block_node *node
		= (struct ivy_ast_block_node *)(state->s_base.s_node);

	if (state->s_terminator == tok->t_symbol) {
		parser_pop_state(ctx, STATE_ADD_NODE_TO_PARENT);
		return PARSE_RESULT(IVY_OK, PARSE_REPEAT_TOKEN);
	}

	return PARSE_RESULT(IVY_ERR_BAD_SYNTAX, 0);
}

static struct token_parse_result parse_expr_begin(
	struct ivy_parser *ctx, struct ivy_token *tok)
{
	struct block_parser_state *state
		= parser_get_state(ctx, struct block_parser_state);

	struct ivy_ast_block_node *node
		= (struct ivy_ast_block_node *)(state->s_base.s_node);

	struct expr_parser_state *expr
		= (struct expr_parser_state *)parser_push_state(
			ctx, IVY_AST_EXPR, 0);
	expr->s_terminator = state->s_terminator;
	return PARSE_RESULT(IVY_OK, PARSE_REPEAT_TOKEN);
}

static enum ivy_status add_child(
	struct parser_state *parent, struct ivy_ast_node *child)
{
	struct ivy_ast_block_node *block
		= (struct ivy_ast_block_node *)parent->s_node;

	b_queue_push_back(&block->n_expr, &child->n_entry);

	return IVY_OK;
}

static void collect_children(
	struct ivy_ast_node *node, struct ivy_ast_node_iterator *iterator)
{
	struct ivy_ast_block_node *block = (struct ivy_ast_block_node *)node;
	b_queue_iterator it = {0};
	b_queue_foreach (&it, &block->n_expr) {
		struct ivy_ast_node *expr
			= b_unbox(struct ivy_ast_node, it.entry, n_entry);
		ast_node_iterator_enqueue_node(iterator, node, expr);
	}
}

struct ast_node_type block_node_ops = {
	.n_add_child = add_child,
	.n_collect_children = collect_children,
	.n_state_size = sizeof(struct block_parser_state),
	.n_node_size = sizeof(struct ivy_ast_block_node),
	.n_keyword_parsers = {
		KW_PARSER(END, parse_end),
		KW_PARSER(ELSE, parse_else),
	},
	.n_symbol_parsers = {
		SYM_PARSER_FALLBACK(parse_symbol),
	},
	.n_expr_parser = {
		.expr_begin = parse_expr_begin,
	},
};