lang: ast: re-factor parser into multiple files
This commit is contained in:
112
lang/ast/ctx.c
Normal file
112
lang/ast/ctx.c
Normal file
@@ -0,0 +1,112 @@
|
||||
#include "ctx.h"
|
||||
|
||||
#include "node.h"
|
||||
#include "parse.h"
|
||||
|
||||
#include <blue/core/queue.h>
|
||||
#include <ivy/lang/ast.h>
|
||||
#include <stddef.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
enum ivy_status ivy_parser_create(struct ivy_parser **parser)
|
||||
{
|
||||
struct ivy_parser *out = malloc(sizeof *out);
|
||||
if (!out) {
|
||||
return IVY_ERR_NO_MEMORY;
|
||||
}
|
||||
|
||||
memset(out, 0x0, sizeof *out);
|
||||
|
||||
parser_push_state(
|
||||
out, IVY_AST_UNIT, struct ivy_ast_unit_node, struct parser_state);
|
||||
|
||||
*parser = out;
|
||||
return IVY_OK;
|
||||
}
|
||||
|
||||
void ivy_parser_destroy(struct ivy_parser *parser)
|
||||
{
|
||||
free(parser);
|
||||
}
|
||||
|
||||
enum ivy_status ivy_parser_get_status(struct ivy_parser *parser)
|
||||
{
|
||||
return parser->p_status;
|
||||
}
|
||||
|
||||
enum ivy_status ivy_parser_push_token(
|
||||
struct ivy_parser *parser, struct ivy_token *tok)
|
||||
{
|
||||
struct parser_state *state = parser_get_state_generic(parser);
|
||||
if (!state) {
|
||||
parser->p_status = IVY_ERR_INTERNAL_FAILURE;
|
||||
return IVY_ERR_INTERNAL_FAILURE;
|
||||
}
|
||||
|
||||
token_parse_function func = get_token_parser(state->s_node, tok);
|
||||
if (!func) {
|
||||
parser->p_status = IVY_ERR_BAD_SYNTAX;
|
||||
return IVY_ERR_BAD_SYNTAX;
|
||||
}
|
||||
|
||||
parser->p_status = func(parser, tok);
|
||||
return parser->p_status;
|
||||
}
|
||||
|
||||
struct parser_state *parser_get_state_generic(struct ivy_parser *parser)
|
||||
{
|
||||
b_queue_entry *entry = b_queue_last(&parser->p_state);
|
||||
if (!entry) {
|
||||
return NULL;
|
||||
}
|
||||
|
||||
struct parser_state *state = b_unbox(struct parser_state, entry, s_entry);
|
||||
return state;
|
||||
}
|
||||
|
||||
struct parser_state *parser_push_state_generic(
|
||||
struct ivy_parser *parser, enum ivy_ast_node_type type,
|
||||
size_t node_size, size_t state_size)
|
||||
{
|
||||
struct parser_state *state = malloc(state_size);
|
||||
if (!state) {
|
||||
return NULL;
|
||||
}
|
||||
|
||||
memset(state, 0x0, state_size);
|
||||
|
||||
b_queue_entry *current_state_entry = b_queue_last(&parser->p_state);
|
||||
if (current_state_entry) {
|
||||
struct parser_state *current_state = b_unbox(
|
||||
struct parser_state, current_state_entry, s_entry);
|
||||
state->s_parent = current_state->s_node;
|
||||
}
|
||||
|
||||
state->s_node = ast_node_create_with_size(type, node_size);
|
||||
|
||||
const struct ast_node_type *node_type = get_ast_node_type(type);
|
||||
if (node_type && node_type->n_init_state) {
|
||||
node_type->n_init_state(state);
|
||||
}
|
||||
|
||||
b_queue_push_back(&parser->p_state, &state->s_entry);
|
||||
return state;
|
||||
}
|
||||
|
||||
void parser_pop_state(struct ivy_parser *parser, enum pop_state_flags flags)
|
||||
{
|
||||
if (parser->p_state.q_first == parser->p_state.q_last) {
|
||||
return;
|
||||
}
|
||||
|
||||
b_queue_entry *entry = b_queue_last(&parser->p_state);
|
||||
struct parser_state *state = b_unbox(struct parser_state, entry, s_entry);
|
||||
b_queue_pop_back(&parser->p_state);
|
||||
|
||||
if (flags & STATE_ADD_NODE_TO_PARENT) {
|
||||
ast_node_add_child(state->s_parent, state->s_node);
|
||||
}
|
||||
|
||||
free(state);
|
||||
}
|
||||
37
lang/ast/ctx.h
Normal file
37
lang/ast/ctx.h
Normal file
@@ -0,0 +1,37 @@
|
||||
#ifndef _AST_CTX_H_
|
||||
#define _AST_CTX_H_
|
||||
|
||||
#include <blue/core/queue.h>
|
||||
#include <ivy/lang/ast.h>
|
||||
#include <ivy/status.h>
|
||||
|
||||
#define parser_push_state(parser, node_id, node_type, state_type) \
|
||||
((state_type *)parser_push_state_generic( \
|
||||
parser, node_id, sizeof(node_type), sizeof(state_type)))
|
||||
#define parser_get_state(parser, state_type) \
|
||||
((state_type *)parser_get_state_generic(parser))
|
||||
|
||||
struct parser_state {
|
||||
b_queue_entry s_entry;
|
||||
struct ivy_ast_node *s_parent;
|
||||
struct ivy_ast_node *s_node;
|
||||
};
|
||||
|
||||
struct ivy_parser {
|
||||
enum ivy_status p_status;
|
||||
b_queue p_state;
|
||||
b_queue p_token_queue;
|
||||
b_queue p_node_queue;
|
||||
};
|
||||
|
||||
enum pop_state_flags {
|
||||
STATE_ADD_NODE_TO_PARENT = 0x01u,
|
||||
};
|
||||
|
||||
extern struct parser_state *parser_push_state_generic(
|
||||
struct ivy_parser *parser, enum ivy_ast_node_type node_type,
|
||||
size_t node_size, size_t state_size);
|
||||
extern void parser_pop_state(struct ivy_parser *parser, enum pop_state_flags flags);
|
||||
extern struct parser_state *parser_get_state_generic(struct ivy_parser *parser);
|
||||
|
||||
#endif
|
||||
80
lang/ast/node.c
Normal file
80
lang/ast/node.c
Normal file
@@ -0,0 +1,80 @@
|
||||
#include "node.h"
|
||||
|
||||
#include <ivy/lang/ast.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
extern struct ast_node_type unit_node_ops;
|
||||
extern struct ast_node_type unit_package_node_ops;
|
||||
|
||||
static const struct ast_node_type *node_ops[] = {
|
||||
[IVY_AST_UNIT] = &unit_node_ops,
|
||||
[IVY_AST_UNIT_PACKAGE] = &unit_package_node_ops,
|
||||
};
|
||||
static const size_t nr_node_ops = sizeof node_ops / sizeof node_ops[0];
|
||||
|
||||
const struct ast_node_type *get_ast_node_type(enum ivy_ast_node_type type)
|
||||
{
|
||||
if (type >= nr_node_ops) {
|
||||
return NULL;
|
||||
}
|
||||
|
||||
return node_ops[type];
|
||||
}
|
||||
|
||||
token_parse_function get_token_parser(
|
||||
struct ivy_ast_node *context, struct ivy_token *tok)
|
||||
{
|
||||
const struct ast_node_type *type = get_ast_node_type(context->n_type);
|
||||
if (!type) {
|
||||
return NULL;
|
||||
}
|
||||
token_parse_function generic_parser = type->n_token_parsers[tok->t_type];
|
||||
token_parse_function better_parser = NULL;
|
||||
|
||||
switch (tok->t_type) {
|
||||
case IVY_TOK_KEYWORD:
|
||||
better_parser = type->n_keyword_parsers[tok->t_keyword];
|
||||
break;
|
||||
case IVY_TOK_SYMBOL:
|
||||
better_parser = type->n_symbol_parsers[tok->t_symbol];
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
|
||||
return better_parser ? better_parser : generic_parser;
|
||||
}
|
||||
|
||||
struct ivy_ast_node *ast_node_create_with_size(
|
||||
enum ivy_ast_node_type type, size_t size)
|
||||
{
|
||||
struct ivy_ast_node *node = malloc(size);
|
||||
if (!node) {
|
||||
return NULL;
|
||||
}
|
||||
|
||||
memset(node, 0x0, size);
|
||||
|
||||
node->n_type = type;
|
||||
|
||||
return node;
|
||||
}
|
||||
|
||||
enum ivy_status ast_node_add_child(
|
||||
struct ivy_ast_node *parent, struct ivy_ast_node *child)
|
||||
{
|
||||
const struct ast_node_type *ops = get_ast_node_type(parent->n_type);
|
||||
if (!ops) {
|
||||
return IVY_ERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
enum ivy_status (*add_child)(struct ivy_ast_node *, struct ivy_ast_node *)
|
||||
= ops->n_add_child;
|
||||
|
||||
if (!add_child) {
|
||||
return IVY_ERR_NOT_SUPPORTED;
|
||||
}
|
||||
|
||||
return add_child(parent, child);
|
||||
}
|
||||
35
lang/ast/node.h
Normal file
35
lang/ast/node.h
Normal file
@@ -0,0 +1,35 @@
|
||||
#ifndef _AST_NODE_H_
|
||||
#define _AST_NODE_H_
|
||||
|
||||
#include <ivy/lang/ast.h>
|
||||
#include <ivy/lang/lex.h>
|
||||
|
||||
#define ast_node_create(type_id, type_struct) \
|
||||
((type_struct *)ast_node_create_with_size(type_id, sizeof(type_struct)))
|
||||
|
||||
struct parser_state;
|
||||
|
||||
typedef enum ivy_status (*token_parse_function)(
|
||||
struct ivy_parser *, struct ivy_token *);
|
||||
|
||||
struct ast_node_type {
|
||||
enum ivy_status (*n_add_child)(
|
||||
struct ivy_ast_node *, struct ivy_ast_node *);
|
||||
void (*n_print)(struct ivy_ast_node *);
|
||||
void (*n_init_state)(struct parser_state *);
|
||||
|
||||
token_parse_function n_token_parsers[IVY_TOK_TYPE_COUNT];
|
||||
token_parse_function n_keyword_parsers[IVY_KW_TYPE_COUNT];
|
||||
token_parse_function n_symbol_parsers[IVY_SYM_TYPE_COUNT];
|
||||
};
|
||||
|
||||
extern const struct ast_node_type *get_ast_node_type(enum ivy_ast_node_type type);
|
||||
extern token_parse_function get_token_parser(
|
||||
struct ivy_ast_node *context, struct ivy_token *tok);
|
||||
|
||||
extern struct ivy_ast_node *ast_node_create_with_size(
|
||||
enum ivy_ast_node_type type, size_t size);
|
||||
extern enum ivy_status ast_node_add_child(
|
||||
struct ivy_ast_node *parent, struct ivy_ast_node *child);
|
||||
|
||||
#endif
|
||||
22
lang/ast/parse.c
Normal file
22
lang/ast/parse.c
Normal file
@@ -0,0 +1,22 @@
|
||||
#include "parse.h"
|
||||
|
||||
#include <ivy/lang/ast.h>
|
||||
#include <ivy/lang/lex.h>
|
||||
|
||||
static token_parse_function token_parsers[IVY_AST_TYPE_COUNT][IVY_TOK_TYPE_COUNT] = {
|
||||
[IVY_AST_UNIT] = {
|
||||
[IVY_TOK_KEYWORD] = NULL,
|
||||
},
|
||||
};
|
||||
|
||||
static token_parse_function keyword_parsers[IVY_AST_TYPE_COUNT][IVY_KW_TYPE_COUNT] = {
|
||||
[IVY_AST_UNIT] = {
|
||||
[IVY_KW_PACKAGE] = NULL,
|
||||
},
|
||||
};
|
||||
|
||||
static token_parse_function symbol_parsers[IVY_AST_TYPE_COUNT][IVY_SYM_TYPE_COUNT] = {
|
||||
[IVY_AST_UNIT] = {
|
||||
[IVY_SYM_NONE] = NULL,
|
||||
},
|
||||
};
|
||||
16
lang/ast/parse.h
Normal file
16
lang/ast/parse.h
Normal file
@@ -0,0 +1,16 @@
|
||||
#ifndef _AST_PARSE_H_
|
||||
#define _AST_PARSE_H_
|
||||
|
||||
#include <ivy/status.h>
|
||||
|
||||
struct ivy_parser;
|
||||
struct ivy_ast_node;
|
||||
struct ivy_token;
|
||||
|
||||
typedef enum ivy_status (*token_parse_function)(
|
||||
struct ivy_parser *, struct ivy_token *);
|
||||
|
||||
extern token_parse_function get_token_parser(
|
||||
struct ivy_ast_node *context, struct ivy_token *tok);
|
||||
|
||||
#endif
|
||||
73
lang/ast/unit-package.c
Normal file
73
lang/ast/unit-package.c
Normal file
@@ -0,0 +1,73 @@
|
||||
#include "unit-package.h"
|
||||
|
||||
#include "ctx.h"
|
||||
#include "node.h"
|
||||
|
||||
static enum ivy_status parse_dot(struct ivy_parser *ctx, struct ivy_token *tok)
|
||||
{
|
||||
struct unit_package_parser_state *state
|
||||
= parser_get_state(ctx, struct unit_package_parser_state);
|
||||
|
||||
if (state->s_prev_token != IVY_TOK_IDENT) {
|
||||
return IVY_ERR_BAD_SYNTAX;
|
||||
}
|
||||
|
||||
state->s_prev_token = IVY_SYM_DOT;
|
||||
return IVY_OK;
|
||||
}
|
||||
|
||||
static enum ivy_status parse_ident(struct ivy_parser *ctx, struct ivy_token *tok)
|
||||
{
|
||||
struct unit_package_parser_state *state
|
||||
= parser_get_state(ctx, struct unit_package_parser_state);
|
||||
|
||||
if (state->s_prev_token == IVY_TOK_IDENT) {
|
||||
return IVY_ERR_BAD_SYNTAX;
|
||||
}
|
||||
|
||||
state->s_prev_token = IVY_TOK_IDENT;
|
||||
return IVY_OK;
|
||||
}
|
||||
|
||||
static enum ivy_status parse_linefeed(struct ivy_parser *ctx, struct ivy_token *tok)
|
||||
{
|
||||
struct unit_package_parser_state *state
|
||||
= parser_get_state(ctx, struct unit_package_parser_state);
|
||||
|
||||
if (state->s_prev_token != IVY_TOK_IDENT) {
|
||||
return IVY_ERR_BAD_SYNTAX;
|
||||
}
|
||||
|
||||
return IVY_ERR_IO_FAILURE;
|
||||
}
|
||||
|
||||
static enum ivy_status add_child(
|
||||
struct ivy_ast_node *parent, struct ivy_ast_node *child)
|
||||
{
|
||||
return IVY_OK;
|
||||
}
|
||||
|
||||
static void print(struct ivy_ast_node *node)
|
||||
{
|
||||
}
|
||||
|
||||
static void init_state(struct parser_state *sp)
|
||||
{
|
||||
struct unit_package_parser_state *state
|
||||
= (struct unit_package_parser_state *)sp;
|
||||
state->s_prev_token = IVY_KW_PACKAGE;
|
||||
}
|
||||
|
||||
struct ast_node_type unit_package_node_ops = {
|
||||
.n_add_child = add_child,
|
||||
.n_print = print,
|
||||
.n_init_state = init_state,
|
||||
.n_symbol_parsers = {
|
||||
[IVY_SYM_DOT] = parse_dot,
|
||||
},
|
||||
.n_token_parsers = {
|
||||
[IVY_TOK_IDENT] = parse_ident,
|
||||
[IVY_TOK_LINEFEED] = parse_linefeed,
|
||||
}
|
||||
|
||||
};
|
||||
13
lang/ast/unit-package.h
Normal file
13
lang/ast/unit-package.h
Normal file
@@ -0,0 +1,13 @@
|
||||
#ifndef _AST_UNIT_PACKAGE_H_
|
||||
#define _AST_UNIT_PACKAGE_H_
|
||||
|
||||
#include "ctx.h"
|
||||
|
||||
#include <ivy/lang/lex.h>
|
||||
|
||||
struct unit_package_parser_state {
|
||||
struct parser_state s_base;
|
||||
int s_prev_token;
|
||||
};
|
||||
|
||||
#endif
|
||||
30
lang/ast/unit.c
Normal file
30
lang/ast/unit.c
Normal file
@@ -0,0 +1,30 @@
|
||||
#include "ctx.h"
|
||||
#include "node.h"
|
||||
#include "unit-package.h"
|
||||
|
||||
static enum ivy_status parse_package_keyword(
|
||||
struct ivy_parser *ctx, struct ivy_token *tok)
|
||||
{
|
||||
parser_push_state(
|
||||
ctx, IVY_AST_UNIT_PACKAGE, struct ivy_ast_unit_package_node,
|
||||
struct unit_package_parser_state);
|
||||
return IVY_OK;
|
||||
}
|
||||
|
||||
static enum ivy_status add_child(
|
||||
struct ivy_ast_node *parent, struct ivy_ast_node *child)
|
||||
{
|
||||
return IVY_OK;
|
||||
}
|
||||
|
||||
static void print(struct ivy_ast_node *node)
|
||||
{
|
||||
}
|
||||
|
||||
struct ast_node_type unit_node_ops = {
|
||||
.n_add_child = add_child,
|
||||
.n_print = print,
|
||||
.n_keyword_parsers = {
|
||||
[IVY_KW_PACKAGE] = parse_package_keyword,
|
||||
},
|
||||
};
|
||||
Reference in New Issue
Block a user