2018-02-10 13:52:33 -08:00
|
|
|
#include "lexer.h"
|
2018-02-10 17:09:35 -08:00
|
|
|
#include "ll.h"
|
2018-02-11 22:32:42 -08:00
|
|
|
#include "util.h"
|
2018-02-10 17:09:35 -08:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <ctype.h>
|
2018-02-10 14:21:04 -08:00
|
|
|
|
2018-02-11 21:09:41 -08:00
|
|
|
libab_result libab_lexer_init(libab_lexer* lexer) {
|
2018-02-10 14:21:04 -08:00
|
|
|
size_t i;
|
|
|
|
libab_result result = LIBAB_SUCCESS;
|
|
|
|
const char* words[] = {
|
|
|
|
".",
|
|
|
|
"[a-zA-Z][a-zA-Z0-9_]*",
|
2018-02-17 13:32:55 -08:00
|
|
|
"[0-9]+(\\.[0-9]*)?"
|
2018-02-10 14:21:04 -08:00
|
|
|
};
|
2018-02-11 21:09:41 -08:00
|
|
|
libab_lexer_token tokens[] = {
|
2018-02-10 14:21:04 -08:00
|
|
|
TOKEN_CHAR,
|
|
|
|
TOKEN_ID,
|
|
|
|
TOKEN_NUM,
|
|
|
|
};
|
2018-02-11 21:09:41 -08:00
|
|
|
const size_t count = sizeof(tokens)/sizeof(libab_lexer_token);
|
2018-02-10 14:21:04 -08:00
|
|
|
|
|
|
|
eval_config_init(&lexer->config);
|
|
|
|
for(i = 0; i < count && result == LIBAB_SUCCESS; i++) {
|
2018-02-11 21:09:41 -08:00
|
|
|
result = libab_convert_lex_result(
|
2018-02-10 16:02:22 -08:00
|
|
|
eval_config_add(&lexer->config, words[i], tokens[i]));
|
2018-02-10 14:21:04 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
2018-02-10 17:09:35 -08:00
|
|
|
|
|
|
|
struct lexer_state {
|
|
|
|
size_t line;
|
|
|
|
size_t line_from;
|
|
|
|
const char* source;
|
|
|
|
ll* matches;
|
|
|
|
};
|
|
|
|
int _lexer_foreach_convert_match(void* data, va_list args) {
|
|
|
|
libab_result result = LIBAB_SUCCESS;
|
2018-02-11 21:09:41 -08:00
|
|
|
libab_lexer_match* new_match;
|
2018-02-10 17:09:35 -08:00
|
|
|
match* match = data;
|
|
|
|
struct lexer_state* state = va_arg(args, struct lexer_state*);
|
|
|
|
char first_char = state->source[match->from];
|
|
|
|
if(isspace(first_char)) {
|
|
|
|
// Skip
|
|
|
|
} else if(first_char == '\n') {
|
|
|
|
state->line++;
|
|
|
|
state->line_from = match->to;
|
|
|
|
} if((new_match = malloc(sizeof(*new_match)))) {
|
2018-02-10 17:21:32 -08:00
|
|
|
new_match->type = match->pattern;
|
2018-02-10 17:09:35 -08:00
|
|
|
new_match->from = match->from;
|
|
|
|
new_match->to = match->to;
|
|
|
|
new_match->line_from = state->line_from;
|
|
|
|
new_match->line = state->line;
|
2018-02-11 21:09:41 -08:00
|
|
|
result = libab_convert_ds_result(ll_append(state->matches, new_match));
|
2018-02-10 17:09:35 -08:00
|
|
|
if(result != LIBAB_SUCCESS) {
|
|
|
|
free(new_match);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
result = LIBAB_MALLOC;
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2018-02-11 21:09:41 -08:00
|
|
|
libab_result libab_lexer_lex(libab_lexer* lexer, const char* string, ll* lex_into) {
|
2018-02-10 17:09:35 -08:00
|
|
|
libab_result result;
|
|
|
|
ll raw_matches;
|
|
|
|
struct lexer_state state;
|
|
|
|
|
|
|
|
ll_init(&raw_matches);
|
|
|
|
|
|
|
|
state.line = 0;
|
|
|
|
state.line_from = 0;
|
|
|
|
state.matches = lex_into;
|
|
|
|
state.source = string;
|
|
|
|
|
2018-02-11 21:09:41 -08:00
|
|
|
result = libab_convert_lex_result(
|
2018-02-10 17:09:35 -08:00
|
|
|
eval_all(string, 0, &lexer->config, &raw_matches));
|
|
|
|
|
|
|
|
if(result == LIBAB_SUCCESS) {
|
2018-02-10 17:21:45 -08:00
|
|
|
result = (libab_result) ll_foreach(&raw_matches, NULL, compare_always,
|
|
|
|
_lexer_foreach_convert_match, &state);
|
2018-02-10 17:09:35 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
if(result != LIBAB_SUCCESS) {
|
2018-02-11 21:09:41 -08:00
|
|
|
ll_foreach(lex_into, NULL, compare_always, libab_lexer_foreach_match_free);
|
2018-02-10 17:09:35 -08:00
|
|
|
}
|
|
|
|
|
|
|
|
ll_foreach(&raw_matches, NULL, compare_always, eval_foreach_match_free);
|
|
|
|
ll_free(&raw_matches);
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
2018-02-11 21:09:41 -08:00
|
|
|
libab_result libab_lexer_free(libab_lexer* lexer) {
|
|
|
|
return libab_convert_lex_result(eval_config_free(&lexer->config));
|
2018-02-10 14:21:04 -08:00
|
|
|
}
|
2018-02-11 21:09:41 -08:00
|
|
|
int libab_lexer_foreach_match_free(void* data, va_list args) {
|
|
|
|
free((libab_lexer_match*) data);
|
2018-02-10 17:09:35 -08:00
|
|
|
return 0;
|
|
|
|
}
|