lang: ast: add a BLOCK ast node to hold lists of expressions

This commit is contained in:
2024-11-28 10:26:53 +00:00
parent 7f9894d8f9
commit 811d3787c4
6 changed files with 103 additions and 10 deletions

66
lang/ast/block.c Normal file
View File

@@ -0,0 +1,66 @@
#include "ctx.h"
#include "node.h"
#include <blue/object/string.h>
#include <ivy/lang/lex.h>
#include <stdio.h>
struct block_parser_state {
struct parser_state s_base;
bool s_single_expr;
unsigned int s_terminator;
};
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 class_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, 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 class_parser_state);
struct ivy_ast_block_node *node
= (struct ivy_ast_block_node *)(state->s_base.s_node);
parser_push_state(ctx, IVY_AST_EXPR);
return PARSE_RESULT(IVY_OK, PARSE_REPEAT_TOKEN);
}
static enum ivy_status add_child(
struct ivy_ast_node *parent, struct ivy_ast_node *child)
{
struct ivy_ast_block_node *block = (struct ivy_ast_block_node *)parent;
b_queue_push_back(&block->n_expr, &child->n_entry);
return IVY_OK;
}
static void init_state(struct ivy_parser *ctx, struct parser_state *sp)
{
struct class_parser_state *state = (struct class_parser_state *)sp;
}
struct ast_node_type block_node_ops = {
.n_add_child = add_child,
.n_init_state = init_state,
.n_state_size = sizeof(struct block_parser_state),
.n_node_size = sizeof(struct ivy_ast_block_node),
.n_keyword_parsers = {
[IVY_KW_END] = parse_end,
},
.n_expr_parser = {
.expr_begin = parse_expr_begin,
},
};

View File

@@ -118,6 +118,7 @@ static enum ivy_status finalise_expr(struct expr_parser_state *state)
}
printf("\n");
printf("%zu\n", sizeof(struct ast_node_type));
return IVY_OK;
}

View File

@@ -30,6 +30,24 @@ static struct token_parse_result parse_expr(
return PARSE_RESULT(IVY_OK, PARSE_REPEAT_TOKEN);
}
static struct token_parse_result parse_bang(
struct ivy_parser *ctx, struct ivy_token *tok)
{
struct msgh_parser_state *state
= parser_get_state(ctx, struct msgh_parser_state);
struct ivy_ast_msgh_node *msgh
= (struct ivy_ast_msgh_node *)state->s_base.s_node;
if (!msgh->n_sel || state->s_oneline) {
return PARSE_RESULT(IVY_ERR_BAD_SYNTAX, 0);
}
parser_pop_state(ctx, STATE_ADD_NODE_TO_PARENT);
return PARSE_RESULT(IVY_OK, 0);
}
static enum ivy_status add_child(
struct ivy_ast_node *parent, struct ivy_ast_node *child)
{
@@ -40,7 +58,11 @@ static enum ivy_status add_child(
return IVY_OK;
}
b_queue_push_back(&msgh->n_body, &child->n_entry);
if (child->n_type == IVY_AST_BLOCK && !msgh->n_body) {
msgh->n_body = child;
return IVY_OK;
}
return IVY_OK;
}
@@ -61,5 +83,8 @@ struct ast_node_type msgh_node_ops = {
.n_node_size = sizeof(struct ivy_ast_msgh_node),
.n_expr_parser = {
.expr_begin = parse_expr,
}
},
.n_symbol_parsers = {
[IVY_SYM_BANG] = parse_bang,
},
};

View File

@@ -243,7 +243,7 @@ const char *ivy_ast_node_type_to_string(enum ivy_ast_node_type v)
ENUM_STR(IVY_AST_COND_GROUP);
ENUM_STR(IVY_AST_COND);
ENUM_STR(IVY_AST_TUPLE);
ENUM_STR(IVY_AST_DO);
ENUM_STR(IVY_AST_BLOCK);
ENUM_STR(IVY_AST_TYPE_COUNT);
default:
return "";

View File

@@ -12,6 +12,7 @@ struct parser_state;
#define PARSE_RESULT(status, flags) \
((struct token_parse_result) {.r_status = (status), .r_flags = (flags)})
enum token_parse_flags {
PARSE_REPEAT_TOKEN = 0x01u,
};