Allow tree-based function implementations.

This commit is contained in:
Danila Fedorin 2018-04-20 00:25:31 -07:00
parent 576f805bd7
commit 8214aa8344
3 changed files with 37 additions and 2 deletions

View File

@ -19,15 +19,43 @@ enum libab_operator_variant_e {
OPERATOR_POSTFIX
};
/**
* The variant of the implementation of a behavior.
*/
enum libab_behavior_variant_e {
BIMPL_INTERNAL,
BIMPL_TREE
};
/**
* A struct that represents the implementation of a behavior.
*/
struct libab_behavior_impl_s {
/**
* The variant of this implementation.
*/
enum libab_behavior_variant_e variant;
union {
/**
* The internal function used for an internal implementation.
*/
libab_function_ptr internal;
/**
* The tree-based implementation.
*/
libab_ref tree;
} data_u;
};
/**
* The common information
* that both operators and functions shared.
*/
struct libab_behavior_s {
/**
* The function that handles the parameters.
* The implementation of this behavior.
*/
libab_function_ptr function;
struct libab_behavior_impl_s impl;
/**
* The type of the function.
*/
@ -72,6 +100,8 @@ struct libab_function_s {
};
typedef enum libab_operator_variant_e libab_operator_variant;
typedef enum libab_behavior_variant_e libab_behavior_variant;
typedef struct libab_behavior_impl_s libab_behavior_impl;
typedef struct libab_behavior_s libab_behavior;
typedef struct libab_operator_s libab_operator;
typedef struct libab_function_s libab_function;

View File

@ -2,6 +2,9 @@
void libab_behavior_free(libab_behavior* behavior) {
libab_ref_free(&behavior->type);
if(behavior->impl.variant == BIMPL_TREE) {
libab_ref_free(&behavior->impl.data_u.tree);
}
}
void libab_operator_free(libab_operator* op) {

View File

@ -38,6 +38,8 @@ libab_result _initialize_behavior(libab* ab, libab_behavior* behavior,
ll_init(&tokens);
behavior->impl.variant = BIMPL_INTERNAL;
behavior->impl.data_u.internal = func;
result = libab_lexer_lex(&ab->lexer, type, &tokens);
if(result == LIBAB_SUCCESS) {
result = libab_parser_parse_type(&ab->parser, &tokens, type, &behavior->type);