66 lines
1.5 KiB
C
66 lines
1.5 KiB
C
#include "ctx.h"
|
|
#include "ivy/status.h"
|
|
#include "node.h"
|
|
|
|
#include <blue/object/string.h>
|
|
#include <ivy/lang/lex.h>
|
|
|
|
struct msgh_parser_state {
|
|
struct parser_state s_base;
|
|
bool s_oneline;
|
|
|
|
unsigned int s_i;
|
|
unsigned int s_prev;
|
|
};
|
|
|
|
static struct token_parse_result parse_expr(
|
|
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) {
|
|
return PARSE_RESULT(IVY_ERR_BAD_SYNTAX, 0);
|
|
}
|
|
|
|
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_msgh_node *msgh = (struct ivy_ast_msgh_node *)parent;
|
|
|
|
if (child->n_type == IVY_AST_SELECTOR && !msgh->n_sel) {
|
|
msgh->n_sel = (struct ivy_ast_selector_node *)child;
|
|
return IVY_OK;
|
|
}
|
|
|
|
b_queue_push_back(&msgh->n_body, &child->n_entry);
|
|
return IVY_OK;
|
|
}
|
|
|
|
static void init_state(struct ivy_parser *ctx, struct parser_state *sp)
|
|
{
|
|
struct msgh_parser_state *state = (struct msgh_parser_state *)sp;
|
|
state->s_oneline = false;
|
|
state->s_i = 0;
|
|
state->s_prev = IVY_SYM_HYPHEN;
|
|
|
|
parser_push_state(ctx, IVY_AST_SELECTOR);
|
|
}
|
|
|
|
struct ast_node_type msgh_node_ops = {
|
|
.n_add_child = add_child,
|
|
.n_init_state = init_state,
|
|
.n_state_size = sizeof(struct msgh_parser_state),
|
|
.n_node_size = sizeof(struct ivy_ast_msgh_node),
|
|
.n_expr_parser = {
|
|
.expr_begin = parse_expr,
|
|
}
|
|
};
|