diff --git a/cli/src/generate/build_tables/build_parse_table.rs b/cli/src/generate/build_tables/build_parse_table.rs index a9be76a2..b9b78966 100644 --- a/cli/src/generate/build_tables/build_parse_table.rs +++ b/cli/src/generate/build_tables/build_parse_table.rs @@ -306,7 +306,7 @@ impl<'a> ParseTableBuilder<'a> { } } - // Having computed the the successor item sets for each symbol, add a new + // Having computed the successor item sets for each symbol, add a new // parse state for each of these item sets, and add a corresponding Shift // action to this state. for (symbol, next_item_set) in terminal_successors { diff --git a/cli/src/generate/prepare_grammar/expand_repeats.rs b/cli/src/generate/prepare_grammar/expand_repeats.rs index fdc43959..e296d425 100644 --- a/cli/src/generate/prepare_grammar/expand_repeats.rs +++ b/cli/src/generate/prepare_grammar/expand_repeats.rs @@ -57,7 +57,7 @@ impl Expander { params: params.clone(), }, - // For repetitions, introduce an auxiliary rule that contains the the + // For repetitions, introduce an auxiliary rule that contains the // repeated content, but can also contain a recursive binary tree structure. Rule::Repeat(content) => { let inner_rule = self.expand_rule(content); diff --git a/cli/src/generate/prepare_grammar/process_inlines.rs b/cli/src/generate/prepare_grammar/process_inlines.rs index e37180b3..659927a1 100644 --- a/cli/src/generate/prepare_grammar/process_inlines.rs +++ b/cli/src/generate/prepare_grammar/process_inlines.rs @@ -8,7 +8,7 @@ use std::collections::HashMap; #[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)] struct ProductionStepId { // A `None` value here means that the production itself was produced via inlining, - // and is stored in the the builder's `productions` vector, as opposed to being + // and is stored in the builder's `productions` vector, as opposed to being // stored in one of the grammar's variables. variable_index: Option, production_index: usize, diff --git a/lib/src/parser.c b/lib/src/parser.c index 084797f9..b08db4c3 100644 --- a/lib/src/parser.c +++ b/lib/src/parser.c @@ -1480,7 +1480,7 @@ static void ts_parser__handle_error( ts_stack_record_summary(self->stack, version, MAX_SUMMARY_DEPTH); // Begin recovery with the current lookahead node, rather than waiting for the - // next turn of the parse loop. This ensures that the tree accounts for the the + // next turn of the parse loop. This ensures that the tree accounts for the // current lookahead token's "lookahead bytes" value, which describes how far // the lexer needed to look ahead beyond the content of the token in order to // recognize it.