Fixed comp error
This commit is contained in:
parent
62a4f377a1
commit
a77ced5fb7
2 changed files with 124 additions and 117 deletions
|
|
@ -21,13 +21,15 @@ typedef struct s_error_status t_error_status;
|
||||||
typedef enum e_error_comparison t_error_comparison;
|
typedef enum e_error_comparison t_error_comparison;
|
||||||
typedef struct s_string_input t_string_input;
|
typedef struct s_string_input t_string_input;
|
||||||
|
|
||||||
|
void ts_lexer__mark_end(TSLexer *_self);
|
||||||
|
|
||||||
struct TSParser
|
struct TSParser
|
||||||
{
|
{
|
||||||
t_lexer lexer;
|
t_lexer lexer;
|
||||||
t_stack *stack;
|
t_stack *stack;
|
||||||
const TSLanguage *language;
|
const TSLanguage *language;
|
||||||
ReduceActionSet reduce_actions;
|
ReduceActionSet reduce_actions;
|
||||||
t_subtree finished_tree;
|
t_subtree finished_tree;
|
||||||
SubtreeArray trailing_extras;
|
SubtreeArray trailing_extras;
|
||||||
SubtreeArray trailing_extras2;
|
SubtreeArray trailing_extras2;
|
||||||
SubtreeArray scratch_trees;
|
SubtreeArray scratch_trees;
|
||||||
|
|
@ -98,8 +100,8 @@ static bool ts_parser__breakdown_top_of_stack(TSParser *self, t_stack_version ve
|
||||||
for (t_u32 i = 0; i < pop.size; i++)
|
for (t_u32 i = 0; i < pop.size; i++)
|
||||||
{
|
{
|
||||||
t_stack_slice slice = pop.contents[i];
|
t_stack_slice slice = pop.contents[i];
|
||||||
TSStateId state = ts_stack_state(self->stack, slice.version);
|
TSStateId state = ts_stack_state(self->stack, slice.version);
|
||||||
t_subtree parent = *array_front(&slice.subtrees);
|
t_subtree parent = *array_front(&slice.subtrees);
|
||||||
|
|
||||||
for (t_u32 j = 0, n = ts_subtree_child_count(parent); j < n; j++)
|
for (t_u32 j = 0, n = ts_subtree_child_count(parent); j < n; j++)
|
||||||
{
|
{
|
||||||
|
|
@ -306,7 +308,7 @@ static t_subtree ts_parser__lex(TSParser *self, t_stack_version version, TSState
|
||||||
if (lex_mode.lex_state == (t_u16)-1)
|
if (lex_mode.lex_state == (t_u16)-1)
|
||||||
return NULL;
|
return NULL;
|
||||||
|
|
||||||
const Length start_position = ts_stack_position(self->stack, version);
|
const Length start_position = ts_stack_position(self->stack, version);
|
||||||
const t_subtree external_token = ts_stack_last_external_token(self->stack, version);
|
const t_subtree external_token = ts_stack_last_external_token(self->stack, version);
|
||||||
|
|
||||||
bool found_external_token = false;
|
bool found_external_token = false;
|
||||||
|
|
@ -518,7 +520,7 @@ static bool ts_parser__select_children(TSParser *self, t_subtree left, const Sub
|
||||||
|
|
||||||
static void ts_parser__shift(TSParser *self, t_stack_version version, TSStateId state, t_subtree lookahead, bool extra)
|
static void ts_parser__shift(TSParser *self, t_stack_version version, TSStateId state, t_subtree lookahead, bool extra)
|
||||||
{
|
{
|
||||||
bool is_leaf = ts_subtree_child_count(lookahead) == 0;
|
bool is_leaf = ts_subtree_child_count(lookahead) == 0;
|
||||||
t_subtree subtree_to_push = lookahead;
|
t_subtree subtree_to_push = lookahead;
|
||||||
if (extra != ts_subtree_extra(lookahead) && is_leaf)
|
if (extra != ts_subtree_extra(lookahead) && is_leaf)
|
||||||
{
|
{
|
||||||
|
|
@ -535,7 +537,7 @@ static void ts_parser__shift(TSParser *self, t_stack_version version, TSStateId
|
||||||
}
|
}
|
||||||
|
|
||||||
static t_stack_version ts_parser__reduce(TSParser *self, t_stack_version version, TSSymbol symbol, t_u32 count, int dynamic_precedence,
|
static t_stack_version ts_parser__reduce(TSParser *self, t_stack_version version, TSSymbol symbol, t_u32 count, int dynamic_precedence,
|
||||||
t_u16 production_id, bool is_fragile, bool end_of_non_terminal_extra)
|
t_u16 production_id, bool is_fragile, bool end_of_non_terminal_extra)
|
||||||
{
|
{
|
||||||
t_u32 initial_version_count = ts_stack_version_count(self->stack);
|
t_u32 initial_version_count = ts_stack_version_count(self->stack);
|
||||||
|
|
||||||
|
|
@ -545,10 +547,10 @@ static t_stack_version ts_parser__reduce(TSParser *self, t_stack_version version
|
||||||
// contain the popped children, and push it onto the stack in place of the
|
// contain the popped children, and push it onto the stack in place of the
|
||||||
// children.
|
// children.
|
||||||
t_stack_slice_array pop = ts_stack_pop_count(self->stack, version, count);
|
t_stack_slice_array pop = ts_stack_pop_count(self->stack, version, count);
|
||||||
t_u32 removed_version_count = 0;
|
t_u32 removed_version_count = 0;
|
||||||
for (t_u32 i = 0; i < pop.size; i++)
|
for (t_u32 i = 0; i < pop.size; i++)
|
||||||
{
|
{
|
||||||
t_stack_slice slice = pop.contents[i];
|
t_stack_slice slice = pop.contents[i];
|
||||||
t_stack_version slice_version = slice.version - removed_version_count;
|
t_stack_version slice_version = slice.version - removed_version_count;
|
||||||
|
|
||||||
// This is where new versions are added to the parse stack. The versions
|
// This is where new versions are added to the parse stack. The versions
|
||||||
|
|
@ -665,7 +667,7 @@ static void ts_parser__accept(TSParser *self, t_stack_version version, t_subtree
|
||||||
t_subtree tree = trees.contents[j];
|
t_subtree tree = trees.contents[j];
|
||||||
if (!ts_subtree_extra(tree))
|
if (!ts_subtree_extra(tree))
|
||||||
{
|
{
|
||||||
t_u32 child_count = ts_subtree_child_count(tree);
|
t_u32 child_count = ts_subtree_child_count(tree);
|
||||||
const t_subtree *children = ts_subtree_children(tree);
|
const t_subtree *children = ts_subtree_children(tree);
|
||||||
for (t_u32 k = 0; k < child_count; k++)
|
for (t_u32 k = 0; k < child_count; k++)
|
||||||
{
|
{
|
||||||
|
|
@ -707,7 +709,7 @@ static bool ts_parser__do_all_potential_reductions(TSParser *self, t_stack_versi
|
||||||
{
|
{
|
||||||
t_u32 initial_version_count = ts_stack_version_count(self->stack);
|
t_u32 initial_version_count = ts_stack_version_count(self->stack);
|
||||||
|
|
||||||
bool can_shift_lookahead_symbol = false;
|
bool can_shift_lookahead_symbol = false;
|
||||||
t_stack_version version = starting_version;
|
t_stack_version version = starting_version;
|
||||||
for (t_u32 i = 0; true; i++)
|
for (t_u32 i = 0; true; i++)
|
||||||
{
|
{
|
||||||
|
|
@ -811,7 +813,7 @@ static bool ts_parser__do_all_potential_reductions(TSParser *self, t_stack_versi
|
||||||
static bool ts_parser__recover_to_state(TSParser *self, t_stack_version version, t_u32 depth, TSStateId goal_state)
|
static bool ts_parser__recover_to_state(TSParser *self, t_stack_version version, t_u32 depth, TSStateId goal_state)
|
||||||
{
|
{
|
||||||
t_stack_slice_array pop = ts_stack_pop_count(self->stack, version, depth);
|
t_stack_slice_array pop = ts_stack_pop_count(self->stack, version, depth);
|
||||||
t_stack_version previous_version = STACK_VERSION_NONE;
|
t_stack_version previous_version = STACK_VERSION_NONE;
|
||||||
|
|
||||||
for (t_u32 i = 0; i < pop.size; i++)
|
for (t_u32 i = 0; i < pop.size; i++)
|
||||||
{
|
{
|
||||||
|
|
@ -837,7 +839,7 @@ static bool ts_parser__recover_to_state(TSParser *self, t_stack_version version,
|
||||||
{
|
{
|
||||||
assert(error_trees.size == 1);
|
assert(error_trees.size == 1);
|
||||||
t_subtree error_tree = error_trees.contents[0];
|
t_subtree error_tree = error_trees.contents[0];
|
||||||
t_u32 error_child_count = ts_subtree_child_count(error_tree);
|
t_u32 error_child_count = ts_subtree_child_count(error_tree);
|
||||||
if (error_child_count > 0)
|
if (error_child_count > 0)
|
||||||
{
|
{
|
||||||
array_splice(&slice.subtrees, 0, 0, error_child_count, ts_subtree_children(error_tree));
|
array_splice(&slice.subtrees, 0, 0, error_child_count, ts_subtree_children(error_tree));
|
||||||
|
|
@ -875,12 +877,12 @@ static bool ts_parser__recover_to_state(TSParser *self, t_stack_version version,
|
||||||
|
|
||||||
static void ts_parser__recover(TSParser *self, t_stack_version version, t_subtree lookahead)
|
static void ts_parser__recover(TSParser *self, t_stack_version version, t_subtree lookahead)
|
||||||
{
|
{
|
||||||
bool did_recover = false;
|
bool did_recover = false;
|
||||||
t_u32 previous_version_count = ts_stack_version_count(self->stack);
|
t_u32 previous_version_count = ts_stack_version_count(self->stack);
|
||||||
Length position = ts_stack_position(self->stack, version);
|
Length position = ts_stack_position(self->stack, version);
|
||||||
t_stack_summary *summary = ts_stack_get_summary(self->stack, version);
|
t_stack_summary *summary = ts_stack_get_summary(self->stack, version);
|
||||||
t_u32 node_count_since_error = ts_stack_node_count_since_error(self->stack, version);
|
t_u32 node_count_since_error = ts_stack_node_count_since_error(self->stack, version);
|
||||||
t_u32 current_error_cost = ts_stack_error_cost(self->stack, version);
|
t_u32 current_error_cost = ts_stack_error_cost(self->stack, version);
|
||||||
|
|
||||||
// When the parser is in the error state, there are two strategies for recovering with a
|
// When the parser is in the error state, there are two strategies for recovering with a
|
||||||
// given lookahead token:
|
// given lookahead token:
|
||||||
|
|
@ -975,7 +977,7 @@ static void ts_parser__recover(TSParser *self, t_stack_version version, t_subtre
|
||||||
if (ts_subtree_is_eof(lookahead))
|
if (ts_subtree_is_eof(lookahead))
|
||||||
{
|
{
|
||||||
SubtreeArray children = array_new();
|
SubtreeArray children = array_new();
|
||||||
t_subtree parent = ts_subtree_new_error_node(&children, false, self->language);
|
t_subtree parent = ts_subtree_new_error_node(&children, false, self->language);
|
||||||
ts_stack_push(self->stack, version, parent, false, 1);
|
ts_stack_push(self->stack, version, parent, false, 1);
|
||||||
ts_parser__accept(self, version, lookahead);
|
ts_parser__accept(self, version, lookahead);
|
||||||
return;
|
return;
|
||||||
|
|
@ -1077,12 +1079,12 @@ static void ts_parser__handle_error(TSParser *self, t_stack_version version, t_s
|
||||||
// snap to the beginning of the next included range. The missing token's padding
|
// snap to the beginning of the next included range. The missing token's padding
|
||||||
// must be assigned to position it within the next included range.
|
// must be assigned to position it within the next included range.
|
||||||
ts_lexer_reset(&self->lexer, position);
|
ts_lexer_reset(&self->lexer, position);
|
||||||
ts_lexer_mark_end(&self->lexer);
|
ts_lexer__mark_end((void *)&self->lexer);
|
||||||
Length padding = length_sub(self->lexer.token_end_position, position);
|
Length padding = length_sub(self->lexer.token_end_position, position);
|
||||||
t_u32 lookahead_bytes = ts_subtree_total_bytes(lookahead) + ts_subtree_lookahead_bytes(lookahead);
|
t_u32 lookahead_bytes = ts_subtree_total_bytes(lookahead) + ts_subtree_lookahead_bytes(lookahead);
|
||||||
|
|
||||||
t_stack_version version_with_missing_tree = ts_stack_copy_version(self->stack, v);
|
t_stack_version version_with_missing_tree = ts_stack_copy_version(self->stack, v);
|
||||||
t_subtree missing_tree =
|
t_subtree missing_tree =
|
||||||
ts_subtree_new_missing_leaf(/*&self->tree_pool,*/ missing_symbol, padding, lookahead_bytes, self->language);
|
ts_subtree_new_missing_leaf(/*&self->tree_pool,*/ missing_symbol, padding, lookahead_bytes, self->language);
|
||||||
ts_stack_push(self->stack, version_with_missing_tree, missing_tree, false, state_after_missing_symbol);
|
ts_stack_push(self->stack, version_with_missing_tree, missing_tree, false, state_after_missing_symbol);
|
||||||
|
|
||||||
|
|
@ -1121,7 +1123,7 @@ static bool ts_parser__advance(TSParser *self, t_stack_version version, bool all
|
||||||
(void)(allow_node_reuse);
|
(void)(allow_node_reuse);
|
||||||
TSStateId state = ts_stack_state(self->stack, version);
|
TSStateId state = ts_stack_state(self->stack, version);
|
||||||
|
|
||||||
t_subtree lookahead = NULL;
|
t_subtree lookahead = NULL;
|
||||||
TableEntry table_entry = {.action_count = 0};
|
TableEntry table_entry = {.action_count = 0};
|
||||||
|
|
||||||
bool needs_lex = true;
|
bool needs_lex = true;
|
||||||
|
|
@ -1183,8 +1185,8 @@ static bool ts_parser__advance(TSParser *self, t_stack_version version, bool all
|
||||||
}
|
}
|
||||||
|
|
||||||
case TSParseActionTypeReduce: {
|
case TSParseActionTypeReduce: {
|
||||||
bool is_fragile = table_entry.action_count > 1;
|
bool is_fragile = table_entry.action_count > 1;
|
||||||
bool end_of_non_terminal_extra = lookahead == NULL;
|
bool end_of_non_terminal_extra = lookahead == NULL;
|
||||||
t_stack_version reduction_version =
|
t_stack_version reduction_version =
|
||||||
ts_parser__reduce(self, version, action.reduce.symbol, action.reduce.child_count, action.reduce.dynamic_precedence,
|
ts_parser__reduce(self, version, action.reduce.symbol, action.reduce.child_count, action.reduce.dynamic_precedence,
|
||||||
action.reduce.production_id, is_fragile, end_of_non_terminal_extra);
|
action.reduce.production_id, is_fragile, end_of_non_terminal_extra);
|
||||||
|
|
|
||||||
|
|
@ -1,9 +1,21 @@
|
||||||
|
/* ************************************************************************** */
|
||||||
|
/* */
|
||||||
|
/* ::: :::::::: */
|
||||||
|
/* scanner.c :+: :+: :+: */
|
||||||
|
/* +:+ +:+ +:+ */
|
||||||
|
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
|
||||||
|
/* +#+#+#+#+#+ +#+ */
|
||||||
|
/* Created: 2024/09/01 14:17:17 by maiboyer #+# #+# */
|
||||||
|
/* Updated: 2024/09/01 14:22:35 by maiboyer ### ########.fr */
|
||||||
|
/* */
|
||||||
|
/* ************************************************************************** */
|
||||||
|
|
||||||
|
#include "me/char/char.h"
|
||||||
|
#include "me/types.h"
|
||||||
#include "parser/array.h"
|
#include "parser/array.h"
|
||||||
#include "parser/parser.h"
|
#include "parser/parser.h"
|
||||||
#include "me/types.h"
|
|
||||||
#include <assert.h>
|
#include <assert.h>
|
||||||
#include <string.h>
|
#include <string.h>
|
||||||
#include <wctype.h>
|
|
||||||
|
|
||||||
enum TokenType
|
enum TokenType
|
||||||
{
|
{
|
||||||
|
|
@ -31,31 +43,29 @@ enum TokenType
|
||||||
|
|
||||||
typedef Array(char) String;
|
typedef Array(char) String;
|
||||||
|
|
||||||
typedef struct Heredoc
|
typedef struct s_heredoc t_heredoc;
|
||||||
|
struct s_heredoc
|
||||||
{
|
{
|
||||||
bool is_raw;
|
bool is_raw;
|
||||||
bool started;
|
bool started;
|
||||||
bool allows_indent;
|
bool allows_indent;
|
||||||
String delimiter;
|
String delimiter;
|
||||||
String current_leading_word;
|
String current_leading_word;
|
||||||
} Heredoc;
|
};
|
||||||
|
typedef struct s_scanner t_scanner;
|
||||||
#define heredoc_new() \
|
struct s_scanner
|
||||||
{ \
|
|
||||||
.is_raw = false, \
|
|
||||||
.started = false, \
|
|
||||||
.allows_indent = false, \
|
|
||||||
.delimiter = array_new(), \
|
|
||||||
.current_leading_word = array_new(), \
|
|
||||||
};
|
|
||||||
|
|
||||||
typedef struct Scanner
|
|
||||||
{
|
{
|
||||||
t_u8 last_glob_paren_depth;
|
t_u8 last_glob_paren_depth;
|
||||||
bool ext_was_in_double_quote;
|
bool ext_was_in_double_quote;
|
||||||
bool ext_saw_outside_quote;
|
bool ext_saw_outside_quote;
|
||||||
Array(Heredoc) heredocs;
|
Array(t_heredoc) heredocs;
|
||||||
} Scanner;
|
};
|
||||||
|
|
||||||
|
t_heredoc heredoc_new(void)
|
||||||
|
{
|
||||||
|
return ((t_heredoc){
|
||||||
|
.is_raw = false, .started = false, .allows_indent = false, .delimiter = array_new(), .current_leading_word = array_new()});
|
||||||
|
}
|
||||||
|
|
||||||
static inline void advance(TSLexer *lexer)
|
static inline void advance(TSLexer *lexer)
|
||||||
{
|
{
|
||||||
|
|
@ -81,7 +91,7 @@ static inline void reset_string(String *string)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
static inline void reset_heredoc(Heredoc *heredoc)
|
static inline void reset_heredoc(t_heredoc *heredoc)
|
||||||
{
|
{
|
||||||
heredoc->is_raw = false;
|
heredoc->is_raw = false;
|
||||||
heredoc->started = false;
|
heredoc->started = false;
|
||||||
|
|
@ -89,30 +99,30 @@ static inline void reset_heredoc(Heredoc *heredoc)
|
||||||
reset_string(&heredoc->delimiter);
|
reset_string(&heredoc->delimiter);
|
||||||
}
|
}
|
||||||
|
|
||||||
static inline void reset(Scanner *scanner)
|
static inline void reset(t_scanner *scanner)
|
||||||
{
|
{
|
||||||
for (t_u32 i = 0; i < scanner->heredocs.size; i++)
|
for (t_u32 i = 0; i < scanner->heredocs.size; i++)
|
||||||
{
|
|
||||||
reset_heredoc(array_get(&scanner->heredocs, i));
|
reset_heredoc(array_get(&scanner->heredocs, i));
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
static t_u32 serialize(Scanner *scanner, t_u8 *buffer)
|
static t_u32 serialize(t_scanner *scanner, t_u8 *buffer)
|
||||||
{
|
{
|
||||||
t_u32 size = 0;
|
t_u32 size;
|
||||||
|
t_usize i;
|
||||||
|
t_heredoc *heredoc;
|
||||||
|
|
||||||
|
size = 0;
|
||||||
buffer[size++] = (char)scanner->last_glob_paren_depth;
|
buffer[size++] = (char)scanner->last_glob_paren_depth;
|
||||||
buffer[size++] = (char)scanner->ext_was_in_double_quote;
|
buffer[size++] = (char)scanner->ext_was_in_double_quote;
|
||||||
buffer[size++] = (char)scanner->ext_saw_outside_quote;
|
buffer[size++] = (char)scanner->ext_saw_outside_quote;
|
||||||
buffer[size++] = (char)scanner->heredocs.size;
|
buffer[size++] = (char)scanner->heredocs.size;
|
||||||
|
|
||||||
for (t_u32 i = 0; i < scanner->heredocs.size; i++)
|
i = 0;
|
||||||
|
while (i < scanner->heredocs.size)
|
||||||
{
|
{
|
||||||
Heredoc *heredoc = array_get(&scanner->heredocs, i);
|
heredoc = array_get(&scanner->heredocs, i);
|
||||||
if (heredoc->delimiter.size + 3 + size >= TREE_SITTER_SERIALIZATION_BUFFER_SIZE)
|
if (heredoc->delimiter.size + 3 + size >= TREE_SITTER_SERIALIZATION_BUFFER_SIZE)
|
||||||
{
|
return (0);
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
buffer[size++] = (char)heredoc->is_raw;
|
buffer[size++] = (char)heredoc->is_raw;
|
||||||
buffer[size++] = (char)heredoc->started;
|
buffer[size++] = (char)heredoc->started;
|
||||||
|
|
@ -125,16 +135,15 @@ static t_u32 serialize(Scanner *scanner, t_u8 *buffer)
|
||||||
mem_copy(&buffer[size], heredoc->delimiter.contents, heredoc->delimiter.size);
|
mem_copy(&buffer[size], heredoc->delimiter.contents, heredoc->delimiter.size);
|
||||||
size += heredoc->delimiter.size;
|
size += heredoc->delimiter.size;
|
||||||
}
|
}
|
||||||
|
i++;
|
||||||
}
|
}
|
||||||
return size;
|
return size;
|
||||||
}
|
}
|
||||||
|
|
||||||
static void deserialize(Scanner *scanner, const t_u8 *buffer, t_u32 length)
|
static void deserialize(t_scanner *scanner, const t_u8 *buffer, t_u32 length)
|
||||||
{
|
{
|
||||||
if (length == 0)
|
if (length == 0)
|
||||||
{
|
|
||||||
reset(scanner);
|
reset(scanner);
|
||||||
}
|
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
t_u32 size = 0;
|
t_u32 size = 0;
|
||||||
|
|
@ -144,14 +153,14 @@ static void deserialize(Scanner *scanner, const t_u8 *buffer, t_u32 length)
|
||||||
t_u32 heredoc_count = (t_u8)buffer[size++];
|
t_u32 heredoc_count = (t_u8)buffer[size++];
|
||||||
for (t_u32 i = 0; i < heredoc_count; i++)
|
for (t_u32 i = 0; i < heredoc_count; i++)
|
||||||
{
|
{
|
||||||
Heredoc *heredoc = NULL;
|
t_heredoc *heredoc = NULL;
|
||||||
if (i < scanner->heredocs.size)
|
if (i < scanner->heredocs.size)
|
||||||
{
|
{
|
||||||
heredoc = array_get(&scanner->heredocs, i);
|
heredoc = array_get(&scanner->heredocs, i);
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
Heredoc new_heredoc = heredoc_new();
|
t_heredoc new_heredoc = heredoc_new();
|
||||||
array_push(&scanner->heredocs, new_heredoc);
|
array_push(&scanner->heredocs, new_heredoc);
|
||||||
heredoc = array_back(&scanner->heredocs);
|
heredoc = array_back(&scanner->heredocs);
|
||||||
}
|
}
|
||||||
|
|
@ -193,7 +202,7 @@ static bool advance_word(TSLexer *lexer, String *unquoted_word)
|
||||||
}
|
}
|
||||||
|
|
||||||
while (lexer->lookahead &&
|
while (lexer->lookahead &&
|
||||||
!(quote ? lexer->lookahead == quote || lexer->lookahead == '\r' || lexer->lookahead == '\n' : iswspace(lexer->lookahead)))
|
!(quote ? lexer->lookahead == quote || lexer->lookahead == '\r' || lexer->lookahead == '\n' : me_isspace(lexer->lookahead)))
|
||||||
{
|
{
|
||||||
if (lexer->lookahead == '\\')
|
if (lexer->lookahead == '\\')
|
||||||
{
|
{
|
||||||
|
|
@ -215,7 +224,7 @@ static bool advance_word(TSLexer *lexer, String *unquoted_word)
|
||||||
|
|
||||||
static inline bool scan_bare_dollar(TSLexer *lexer)
|
static inline bool scan_bare_dollar(TSLexer *lexer)
|
||||||
{
|
{
|
||||||
while (iswspace(lexer->lookahead) && lexer->lookahead != '\n' && !lexer->eof(lexer))
|
while (me_isspace(lexer->lookahead) && lexer->lookahead != '\n' && !lexer->eof(lexer))
|
||||||
skip(lexer);
|
skip(lexer);
|
||||||
|
|
||||||
if (lexer->lookahead == '$')
|
if (lexer->lookahead == '$')
|
||||||
|
|
@ -223,15 +232,15 @@ static inline bool scan_bare_dollar(TSLexer *lexer)
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
lexer->result_symbol = BARE_DOLLAR;
|
lexer->result_symbol = BARE_DOLLAR;
|
||||||
lexer->mark_end(lexer);
|
lexer->mark_end(lexer);
|
||||||
return (iswspace(lexer->lookahead) || lexer->eof(lexer) || lexer->lookahead == '\"');
|
return (me_isspace(lexer->lookahead) || lexer->eof(lexer) || lexer->lookahead == '\"');
|
||||||
}
|
}
|
||||||
|
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
static bool scan_heredoc_start(Heredoc *heredoc, TSLexer *lexer)
|
static bool scan_heredoc_start(t_heredoc *heredoc, TSLexer *lexer)
|
||||||
{
|
{
|
||||||
while (iswspace(lexer->lookahead))
|
while (me_isspace(lexer->lookahead))
|
||||||
{
|
{
|
||||||
skip(lexer);
|
skip(lexer);
|
||||||
}
|
}
|
||||||
|
|
@ -248,12 +257,12 @@ static bool scan_heredoc_start(Heredoc *heredoc, TSLexer *lexer)
|
||||||
return found_delimiter;
|
return found_delimiter;
|
||||||
}
|
}
|
||||||
|
|
||||||
static bool scan_heredoc_end_identifier(Heredoc *heredoc, TSLexer *lexer)
|
static bool scan_heredoc_end_identifier(t_heredoc *heredoc, TSLexer *lexer)
|
||||||
{
|
{
|
||||||
|
t_i32 size;
|
||||||
|
|
||||||
|
size = 0;
|
||||||
reset_string(&heredoc->current_leading_word);
|
reset_string(&heredoc->current_leading_word);
|
||||||
// Scan the first 'n' characters on this line, to see if they match the
|
|
||||||
// heredoc delimiter
|
|
||||||
t_i32 size = 0;
|
|
||||||
if (heredoc->delimiter.size > 0)
|
if (heredoc->delimiter.size > 0)
|
||||||
{
|
{
|
||||||
while (lexer->lookahead != '\0' && lexer->lookahead != '\n' && (t_i32)*array_get(&heredoc->delimiter, size) == lexer->lookahead &&
|
while (lexer->lookahead != '\0' && lexer->lookahead != '\n' && (t_i32)*array_get(&heredoc->delimiter, size) == lexer->lookahead &&
|
||||||
|
|
@ -268,10 +277,10 @@ static bool scan_heredoc_end_identifier(Heredoc *heredoc, TSLexer *lexer)
|
||||||
return heredoc->delimiter.size == 0 ? false : strcmp(heredoc->current_leading_word.contents, heredoc->delimiter.contents) == 0;
|
return heredoc->delimiter.size == 0 ? false : strcmp(heredoc->current_leading_word.contents, heredoc->delimiter.contents) == 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
static bool scan_heredoc_content(Scanner *scanner, TSLexer *lexer, enum TokenType middle_type, enum TokenType end_type)
|
static bool scan_heredoc_content(t_scanner *scanner, TSLexer *lexer, enum TokenType middle_type, enum TokenType end_type)
|
||||||
{
|
{
|
||||||
bool did_advance = false;
|
bool did_advance = false;
|
||||||
Heredoc *heredoc = array_back(&scanner->heredocs);
|
t_heredoc *heredoc = array_back(&scanner->heredocs);
|
||||||
|
|
||||||
for (;;)
|
for (;;)
|
||||||
{
|
{
|
||||||
|
|
@ -307,7 +316,7 @@ static bool scan_heredoc_content(Scanner *scanner, TSLexer *lexer, enum TokenTyp
|
||||||
lexer->result_symbol = middle_type;
|
lexer->result_symbol = middle_type;
|
||||||
heredoc->started = true;
|
heredoc->started = true;
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
if (iswalpha(lexer->lookahead) || lexer->lookahead == '{' || lexer->lookahead == '(')
|
if (me_isalpha(lexer->lookahead) || lexer->lookahead == '{' || lexer->lookahead == '(')
|
||||||
{
|
{
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
@ -334,10 +343,8 @@ static bool scan_heredoc_content(Scanner *scanner, TSLexer *lexer, enum TokenTyp
|
||||||
did_advance = true;
|
did_advance = true;
|
||||||
if (heredoc->allows_indent)
|
if (heredoc->allows_indent)
|
||||||
{
|
{
|
||||||
while (iswspace(lexer->lookahead))
|
while (me_isspace(lexer->lookahead))
|
||||||
{
|
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
}
|
|
||||||
}
|
}
|
||||||
lexer->result_symbol = heredoc->started ? middle_type : end_type;
|
lexer->result_symbol = heredoc->started ? middle_type : end_type;
|
||||||
lexer->mark_end(lexer);
|
lexer->mark_end(lexer);
|
||||||
|
|
@ -357,7 +364,7 @@ static bool scan_heredoc_content(Scanner *scanner, TSLexer *lexer, enum TokenTyp
|
||||||
{
|
{
|
||||||
// an alternative is to check the starting column of the
|
// an alternative is to check the starting column of the
|
||||||
// heredoc body and track that statefully
|
// heredoc body and track that statefully
|
||||||
while (iswspace(lexer->lookahead))
|
while (me_isspace(lexer->lookahead))
|
||||||
{
|
{
|
||||||
if (did_advance)
|
if (did_advance)
|
||||||
{
|
{
|
||||||
|
|
@ -394,11 +401,11 @@ static bool scan_heredoc_content(Scanner *scanner, TSLexer *lexer, enum TokenTyp
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
static bool scan(Scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
static bool scan(t_scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
||||||
{
|
{
|
||||||
if (valid_symbols[CONCAT] && !in_error_recovery(valid_symbols))
|
if (valid_symbols[CONCAT] && !in_error_recovery(valid_symbols))
|
||||||
{
|
{
|
||||||
if (!(lexer->lookahead == 0 || iswspace(lexer->lookahead) || lexer->lookahead == '>' || lexer->lookahead == '<' ||
|
if (!(lexer->lookahead == 0 || me_isspace(lexer->lookahead) || lexer->lookahead == '>' || lexer->lookahead == '<' ||
|
||||||
lexer->lookahead == ')' || lexer->lookahead == '(' || lexer->lookahead == ';' || lexer->lookahead == '&' ||
|
lexer->lookahead == ')' || lexer->lookahead == '(' || lexer->lookahead == ';' || lexer->lookahead == '&' ||
|
||||||
lexer->lookahead == '|' || lexer->lookahead == '{' || lexer->lookahead == '}'))
|
lexer->lookahead == '|' || lexer->lookahead == '{' || lexer->lookahead == '}'))
|
||||||
{
|
{
|
||||||
|
|
@ -422,7 +429,7 @@ static bool scan(Scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
||||||
{
|
{
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
}
|
}
|
||||||
return iswspace(lexer->lookahead) || lexer->eof(lexer);
|
return me_isspace(lexer->lookahead) || lexer->eof(lexer);
|
||||||
}
|
}
|
||||||
// strings w/ expansions that contains escaped quotes or
|
// strings w/ expansions that contains escaped quotes or
|
||||||
// backslashes need this to return a concat
|
// backslashes need this to return a concat
|
||||||
|
|
@ -468,7 +475,7 @@ static bool scan(Scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
||||||
|
|
||||||
if (valid_symbols[EMPTY_VALUE])
|
if (valid_symbols[EMPTY_VALUE])
|
||||||
{
|
{
|
||||||
if (iswspace(lexer->lookahead) || lexer->eof(lexer) || lexer->lookahead == ';' || lexer->lookahead == '&')
|
if (me_isspace(lexer->lookahead) || lexer->eof(lexer) || lexer->lookahead == ';' || lexer->lookahead == '&')
|
||||||
{
|
{
|
||||||
lexer->result_symbol = EMPTY_VALUE;
|
lexer->result_symbol = EMPTY_VALUE;
|
||||||
return true;
|
return true;
|
||||||
|
|
@ -483,7 +490,7 @@ static bool scan(Scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
||||||
|
|
||||||
if (valid_symbols[HEREDOC_END] && scanner->heredocs.size > 0)
|
if (valid_symbols[HEREDOC_END] && scanner->heredocs.size > 0)
|
||||||
{
|
{
|
||||||
Heredoc *heredoc = array_back(&scanner->heredocs);
|
t_heredoc *heredoc = array_back(&scanner->heredocs);
|
||||||
if (scan_heredoc_end_identifier(heredoc, lexer))
|
if (scan_heredoc_end_identifier(heredoc, lexer))
|
||||||
{
|
{
|
||||||
array_delete(&heredoc->current_leading_word);
|
array_delete(&heredoc->current_leading_word);
|
||||||
|
|
@ -561,7 +568,7 @@ static bool scan(Scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
||||||
{
|
{
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
if (valid_symbols[EXTGLOB_PATTERN] && iswspace(lexer->lookahead))
|
if (valid_symbols[EXTGLOB_PATTERN] && me_isspace(lexer->lookahead))
|
||||||
{
|
{
|
||||||
lexer->mark_end(lexer);
|
lexer->mark_end(lexer);
|
||||||
lexer->result_symbol = EXTGLOB_PATTERN;
|
lexer->result_symbol = EXTGLOB_PATTERN;
|
||||||
|
|
@ -578,7 +585,7 @@ static bool scan(Scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
||||||
if (lexer->lookahead == '-')
|
if (lexer->lookahead == '-')
|
||||||
{
|
{
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
Heredoc heredoc = heredoc_new();
|
t_heredoc heredoc = heredoc_new();
|
||||||
heredoc.allows_indent = true;
|
heredoc.allows_indent = true;
|
||||||
array_push(&scanner->heredocs, heredoc);
|
array_push(&scanner->heredocs, heredoc);
|
||||||
lexer->result_symbol = HEREDOC_ARROW_DASH;
|
lexer->result_symbol = HEREDOC_ARROW_DASH;
|
||||||
|
|
@ -589,7 +596,7 @@ static bool scan(Scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
||||||
// }
|
// }
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
Heredoc heredoc = heredoc_new();
|
t_heredoc heredoc = heredoc_new();
|
||||||
array_push(&scanner->heredocs, heredoc);
|
array_push(&scanner->heredocs, heredoc);
|
||||||
lexer->result_symbol = HEREDOC_ARROW;
|
lexer->result_symbol = HEREDOC_ARROW;
|
||||||
}
|
}
|
||||||
|
|
@ -599,11 +606,9 @@ static bool scan(Scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
||||||
}
|
}
|
||||||
|
|
||||||
bool is_number = true;
|
bool is_number = true;
|
||||||
if (iswdigit(lexer->lookahead))
|
if (me_isdigit(lexer->lookahead))
|
||||||
{
|
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
}
|
else if (me_isalpha(lexer->lookahead) || lexer->lookahead == '_')
|
||||||
else if (iswalpha(lexer->lookahead) || lexer->lookahead == '_')
|
|
||||||
{
|
{
|
||||||
is_number = false;
|
is_number = false;
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
|
|
@ -627,11 +632,11 @@ static bool scan(Scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
||||||
|
|
||||||
for (;;)
|
for (;;)
|
||||||
{
|
{
|
||||||
if (iswdigit(lexer->lookahead))
|
if (me_isdigit(lexer->lookahead))
|
||||||
{
|
{
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
}
|
}
|
||||||
else if (iswalpha(lexer->lookahead) || lexer->lookahead == '_')
|
else if (me_isalpha(lexer->lookahead) || lexer->lookahead == '_')
|
||||||
{
|
{
|
||||||
is_number = false;
|
is_number = false;
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
|
|
@ -682,7 +687,7 @@ static bool scan(Scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
||||||
lexer->mark_end(lexer);
|
lexer->mark_end(lexer);
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
lexer->result_symbol = VARIABLE_NAME;
|
lexer->result_symbol = VARIABLE_NAME;
|
||||||
return iswalpha(lexer->lookahead);
|
return me_isalpha(lexer->lookahead);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
@ -698,7 +703,7 @@ static bool scan(Scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
||||||
{
|
{
|
||||||
if (valid_symbols[REGEX])
|
if (valid_symbols[REGEX])
|
||||||
{
|
{
|
||||||
while (iswspace(lexer->lookahead))
|
while (me_isspace(lexer->lookahead))
|
||||||
{
|
{
|
||||||
skip(lexer);
|
skip(lexer);
|
||||||
}
|
}
|
||||||
|
|
@ -797,7 +802,7 @@ static bool scan(Scanner *scanner, TSLexer *lexer, const bool *valid_symbols)
|
||||||
{
|
{
|
||||||
if (valid_symbols[REGEX])
|
if (valid_symbols[REGEX])
|
||||||
{
|
{
|
||||||
bool was_space = !state.in_single_quote && iswspace(lexer->lookahead);
|
bool was_space = !state.in_single_quote && me_isspace(lexer->lookahead);
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
state.advanced_once = true;
|
state.advanced_once = true;
|
||||||
if (!was_space || state.paren_depth > 0)
|
if (!was_space || state.paren_depth > 0)
|
||||||
|
|
@ -821,19 +826,19 @@ extglob_pattern:
|
||||||
if (valid_symbols[EXTGLOB_PATTERN] && !in_error_recovery(valid_symbols))
|
if (valid_symbols[EXTGLOB_PATTERN] && !in_error_recovery(valid_symbols))
|
||||||
{
|
{
|
||||||
// first skip ws, then check for ? * + @ !
|
// first skip ws, then check for ? * + @ !
|
||||||
while (iswspace(lexer->lookahead))
|
while (me_isspace(lexer->lookahead))
|
||||||
{
|
{
|
||||||
skip(lexer);
|
skip(lexer);
|
||||||
}
|
}
|
||||||
|
|
||||||
if (lexer->lookahead == '?' || lexer->lookahead == '*' || lexer->lookahead == '+' || lexer->lookahead == '@' ||
|
if (lexer->lookahead == '?' || lexer->lookahead == '*' || lexer->lookahead == '+' || lexer->lookahead == '@' ||
|
||||||
lexer->lookahead == '!' || lexer->lookahead == '-' || lexer->lookahead == ')' || lexer->lookahead == '\\' ||
|
lexer->lookahead == '!' || lexer->lookahead == '-' || lexer->lookahead == ')' || lexer->lookahead == '\\' ||
|
||||||
lexer->lookahead == '.' || lexer->lookahead == '[' || (iswalpha(lexer->lookahead)))
|
lexer->lookahead == '.' || lexer->lookahead == '[' || (me_isalpha(lexer->lookahead)))
|
||||||
{
|
{
|
||||||
if (lexer->lookahead == '\\')
|
if (lexer->lookahead == '\\')
|
||||||
{
|
{
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
if ((iswspace(lexer->lookahead) || lexer->lookahead == '"') && lexer->lookahead != '\r' && lexer->lookahead != '\n')
|
if ((me_isspace(lexer->lookahead) || lexer->lookahead == '"') && lexer->lookahead != '\r' && lexer->lookahead != '\n')
|
||||||
{
|
{
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
}
|
}
|
||||||
|
|
@ -848,14 +853,14 @@ extglob_pattern:
|
||||||
lexer->mark_end(lexer);
|
lexer->mark_end(lexer);
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
|
|
||||||
if (iswspace(lexer->lookahead))
|
if (me_isspace(lexer->lookahead))
|
||||||
{
|
{
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
lexer->mark_end(lexer);
|
lexer->mark_end(lexer);
|
||||||
bool was_non_alpha = !iswalpha(lexer->lookahead);
|
bool was_non_alpha = !me_isalpha(lexer->lookahead);
|
||||||
if (lexer->lookahead != '[')
|
if (lexer->lookahead != '[')
|
||||||
{
|
{
|
||||||
// no esac
|
// no esac
|
||||||
|
|
@ -872,7 +877,7 @@ extglob_pattern:
|
||||||
if (lexer->lookahead == 'c')
|
if (lexer->lookahead == 'c')
|
||||||
{
|
{
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
if (iswspace(lexer->lookahead))
|
if (me_isspace(lexer->lookahead))
|
||||||
{
|
{
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
@ -891,7 +896,7 @@ extglob_pattern:
|
||||||
{
|
{
|
||||||
lexer->mark_end(lexer);
|
lexer->mark_end(lexer);
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
while (iswalnum(lexer->lookahead))
|
while (me_isalnum(lexer->lookahead))
|
||||||
{
|
{
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
}
|
}
|
||||||
|
|
@ -908,14 +913,14 @@ extglob_pattern:
|
||||||
{
|
{
|
||||||
lexer->mark_end(lexer);
|
lexer->mark_end(lexer);
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
if (iswspace(lexer->lookahead))
|
if (me_isspace(lexer->lookahead))
|
||||||
{
|
{
|
||||||
lexer->result_symbol = EXTGLOB_PATTERN;
|
lexer->result_symbol = EXTGLOB_PATTERN;
|
||||||
return was_non_alpha;
|
return was_non_alpha;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if (iswspace(lexer->lookahead))
|
if (me_isspace(lexer->lookahead))
|
||||||
{
|
{
|
||||||
lexer->mark_end(lexer);
|
lexer->mark_end(lexer);
|
||||||
lexer->result_symbol = EXTGLOB_PATTERN;
|
lexer->result_symbol = EXTGLOB_PATTERN;
|
||||||
|
|
@ -942,7 +947,7 @@ extglob_pattern:
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (!iswalnum(lexer->lookahead) && lexer->lookahead != '(' && lexer->lookahead != '"' && lexer->lookahead != '[' &&
|
if (!me_isalnum(lexer->lookahead) && lexer->lookahead != '(' && lexer->lookahead != '"' && lexer->lookahead != '[' &&
|
||||||
lexer->lookahead != '?' && lexer->lookahead != '/' && lexer->lookahead != '\\' && lexer->lookahead != '_' &&
|
lexer->lookahead != '?' && lexer->lookahead != '/' && lexer->lookahead != '\\' && lexer->lookahead != '_' &&
|
||||||
lexer->lookahead != '*')
|
lexer->lookahead != '*')
|
||||||
{
|
{
|
||||||
|
|
@ -1010,11 +1015,11 @@ extglob_pattern:
|
||||||
|
|
||||||
if (!state.done)
|
if (!state.done)
|
||||||
{
|
{
|
||||||
bool was_space = iswspace(lexer->lookahead);
|
bool was_space = me_isspace(lexer->lookahead);
|
||||||
if (lexer->lookahead == '$')
|
if (lexer->lookahead == '$')
|
||||||
{
|
{
|
||||||
lexer->mark_end(lexer);
|
lexer->mark_end(lexer);
|
||||||
if (!iswalpha(lexer->lookahead) && lexer->lookahead != '.' && lexer->lookahead != '\\')
|
if (!me_isalpha(lexer->lookahead) && lexer->lookahead != '.' && lexer->lookahead != '\\')
|
||||||
{
|
{
|
||||||
state.saw_non_alphadot = true;
|
state.saw_non_alphadot = true;
|
||||||
}
|
}
|
||||||
|
|
@ -1042,19 +1047,19 @@ extglob_pattern:
|
||||||
}
|
}
|
||||||
if (lexer->lookahead == '\\')
|
if (lexer->lookahead == '\\')
|
||||||
{
|
{
|
||||||
if (!iswalpha(lexer->lookahead) && lexer->lookahead != '.' && lexer->lookahead != '\\')
|
if (!me_isalpha(lexer->lookahead) && lexer->lookahead != '.' && lexer->lookahead != '\\')
|
||||||
{
|
{
|
||||||
state.saw_non_alphadot = true;
|
state.saw_non_alphadot = true;
|
||||||
}
|
}
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
if (iswspace(lexer->lookahead) || lexer->lookahead == '"')
|
if (me_isspace(lexer->lookahead) || lexer->lookahead == '"')
|
||||||
{
|
{
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
if (!iswalpha(lexer->lookahead) && lexer->lookahead != '.' && lexer->lookahead != '\\')
|
if (!me_isalpha(lexer->lookahead) && lexer->lookahead != '.' && lexer->lookahead != '\\')
|
||||||
{
|
{
|
||||||
state.saw_non_alphadot = true;
|
state.saw_non_alphadot = true;
|
||||||
}
|
}
|
||||||
|
|
@ -1089,7 +1094,7 @@ expansion_word:
|
||||||
{
|
{
|
||||||
lexer->mark_end(lexer);
|
lexer->mark_end(lexer);
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
if (lexer->lookahead == '{' || lexer->lookahead == '(' || lexer->lookahead == '\'' || iswalnum(lexer->lookahead))
|
if (lexer->lookahead == '{' || lexer->lookahead == '(' || lexer->lookahead == '\'' || me_isalnum(lexer->lookahead))
|
||||||
{
|
{
|
||||||
lexer->result_symbol = EXPANSION_WORD;
|
lexer->result_symbol = EXPANSION_WORD;
|
||||||
return advanced_once;
|
return advanced_once;
|
||||||
|
|
@ -1118,7 +1123,7 @@ expansion_word:
|
||||||
{
|
{
|
||||||
lexer->mark_end(lexer);
|
lexer->mark_end(lexer);
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
if (lexer->lookahead == '{' || lexer->lookahead == '(' || lexer->lookahead == '\'' || iswalnum(lexer->lookahead))
|
if (lexer->lookahead == '{' || lexer->lookahead == '(' || lexer->lookahead == '\'' || me_isalnum(lexer->lookahead))
|
||||||
{
|
{
|
||||||
lexer->result_symbol = EXPANSION_WORD;
|
lexer->result_symbol = EXPANSION_WORD;
|
||||||
return advanced_once;
|
return advanced_once;
|
||||||
|
|
@ -1127,8 +1132,8 @@ expansion_word:
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
advanced_once = advanced_once || !iswspace(lexer->lookahead);
|
advanced_once = advanced_once || !me_isspace(lexer->lookahead);
|
||||||
advance_once_space = advance_once_space || iswspace(lexer->lookahead);
|
advance_once_space = advance_once_space || me_isspace(lexer->lookahead);
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
@ -1149,8 +1154,8 @@ expansion_word:
|
||||||
return false;
|
return false;
|
||||||
if (lexer->eof(lexer))
|
if (lexer->eof(lexer))
|
||||||
return false;
|
return false;
|
||||||
advanced_once = advanced_once || !iswspace(lexer->lookahead);
|
advanced_once = advanced_once || !me_isspace(lexer->lookahead);
|
||||||
advance_once_space = advance_once_space || iswspace(lexer->lookahead);
|
advance_once_space = advance_once_space || me_isspace(lexer->lookahead);
|
||||||
advance(lexer);
|
advance(lexer);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
@ -1161,35 +1166,35 @@ brace_start:
|
||||||
|
|
||||||
void *tree_sitter_sh_external_scanner_create()
|
void *tree_sitter_sh_external_scanner_create()
|
||||||
{
|
{
|
||||||
Scanner *scanner = mem_alloc(sizeof(Scanner));
|
t_scanner *scanner = mem_alloc(sizeof(t_scanner));
|
||||||
array_init(&scanner->heredocs);
|
array_init(&scanner->heredocs);
|
||||||
return scanner;
|
return scanner;
|
||||||
}
|
}
|
||||||
|
|
||||||
bool tree_sitter_sh_external_scanner_scan(void *payload, TSLexer *lexer, const bool *valid_symbols)
|
bool tree_sitter_sh_external_scanner_scan(void *payload, TSLexer *lexer, const bool *valid_symbols)
|
||||||
{
|
{
|
||||||
Scanner *scanner = (Scanner *)payload;
|
t_scanner *scanner = (t_scanner *)payload;
|
||||||
return scan(scanner, lexer, valid_symbols);
|
return scan(scanner, lexer, valid_symbols);
|
||||||
}
|
}
|
||||||
|
|
||||||
t_u32 tree_sitter_sh_external_scanner_serialize(void *payload, t_u8 *state)
|
t_u32 tree_sitter_sh_external_scanner_serialize(void *payload, t_u8 *state)
|
||||||
{
|
{
|
||||||
Scanner *scanner = (Scanner *)payload;
|
t_scanner *scanner = (t_scanner *)payload;
|
||||||
return serialize(scanner, state);
|
return serialize(scanner, state);
|
||||||
}
|
}
|
||||||
|
|
||||||
void tree_sitter_sh_external_scanner_deserialize(void *payload, const t_u8 *state, t_u32 length)
|
void tree_sitter_sh_external_scanner_deserialize(void *payload, const t_u8 *state, t_u32 length)
|
||||||
{
|
{
|
||||||
Scanner *scanner = (Scanner *)payload;
|
t_scanner *scanner = (t_scanner *)payload;
|
||||||
deserialize(scanner, state, length);
|
deserialize(scanner, state, length);
|
||||||
}
|
}
|
||||||
|
|
||||||
void tree_sitter_sh_external_scanner_destroy(void *payload)
|
void tree_sitter_sh_external_scanner_destroy(void *payload)
|
||||||
{
|
{
|
||||||
Scanner *scanner = (Scanner *)payload;
|
t_scanner *scanner = (t_scanner *)payload;
|
||||||
for (size_t i = 0; i < scanner->heredocs.size; i++)
|
for (size_t i = 0; i < scanner->heredocs.size; i++)
|
||||||
{
|
{
|
||||||
Heredoc *heredoc = array_get(&scanner->heredocs, i);
|
t_heredoc *heredoc = array_get(&scanner->heredocs, i);
|
||||||
array_delete(&heredoc->current_leading_word);
|
array_delete(&heredoc->current_leading_word);
|
||||||
array_delete(&heredoc->delimiter);
|
array_delete(&heredoc->delimiter);
|
||||||
}
|
}
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue