tree-sitter/spec/compiler/build_tables
Max Brunsfeld 38c144b4a3 Refine logic for deciding when tokens need to be re-lexed
* While generating the lex table, note which tokens can match the
  same string. A token needs to be relexed when it has possible
  homonyms in the current state.
* Also note which tokens can match substrings of each other tokens.
  A token needs to be relexed when there are viable tokens that
  could match longer strings in the current state and the next
  token has been edited.
* Remove the logic for marking tokens as fragile on creation.
* Store the reusability/non-reusability of symbols off of individual
  actions and onto the entire entry for the state & symbol.
2016-06-21 07:28:04 -07:00
..
distinctive_tokens_spec.cc Refine logic for which tokens to use in error recovery 2016-04-27 14:09:19 -07:00
item_set_closure_spec.cc Unify test targets, use externally defined languages as fixtures 2016-01-15 11:19:24 -08:00
lex_conflict_manager_spec.cc Refine logic for deciding when tokens need to be re-lexed 2016-06-21 07:28:04 -07:00
lex_item_spec.cc Distinguish separators from main tokens via a property on transitions 2016-05-19 16:27:25 -07:00
parse_conflict_manager_spec.cc Unify test targets, use externally defined languages as fixtures 2016-01-15 11:19:24 -08:00
parse_item_spec.cc Unify test targets, use externally defined languages as fixtures 2016-01-15 11:19:24 -08:00
rule_can_be_blank_spec.cc Unify test targets, use externally defined languages as fixtures 2016-01-15 11:19:24 -08:00