libabacus/src/libabacus.c

58 lines
1.5 KiB
C
Raw Normal View History

#include "libabacus.h"
#include <stdlib.h>
libab_result libab_init(libab* ab) {
libab_table_init(&ab->table);
2018-02-11 22:23:02 -08:00
libab_parser_init(&ab->parser, &ab->table);
return libab_lexer_init(&ab->lexer);
}
libab_result libab_register_operator(libab* ab, const char* op, int precedence, libab_function_ptr func) {
libab_result result = LIBAB_SUCCESS;
libab_table_entry* new_entry;
if((new_entry = malloc(sizeof(*new_entry)))) {
new_entry->variant = ENTRY_OPERATOR;
new_entry->data_u.op.function = func;
new_entry->data_u.op.precedence = precedence;
} else {
result = LIBAB_MALLOC;
}
if(result == LIBAB_SUCCESS) {
result = libab_table_put(&ab->table, op, new_entry);
}
if(result != LIBAB_SUCCESS) {
free(new_entry);
}
return result;
}
libab_result libab_register_function(libab* ab, const char* name, libab_function_ptr func) {
libab_result result = LIBAB_SUCCESS;
libab_table_entry* new_entry;
if((new_entry = malloc(sizeof(*new_entry)))) {
new_entry->variant = ENTRY_FUNCTION;
new_entry->data_u.function.function = func;
} else {
result = LIBAB_MALLOC;
}
if(result == LIBAB_SUCCESS) {
result = libab_table_put(&ab->table, name, new_entry);
}
if(result != LIBAB_SUCCESS) {
free(new_entry);
}
return result;
}
libab_result libab_free(libab* ab) {
libab_table_free(&ab->table);
2018-02-11 22:23:02 -08:00
libab_parser_free(&ab->parser);
return libab_lexer_free(&ab->lexer);
}