tree-sitter/spec
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
..
compiler Refine logic for deciding when tokens need to be re-lexed 2016-06-21 07:28:04 -07:00
fixtures Rewind and re-tokenize in error mode after detecting an error 2016-06-17 21:26:03 -07:00
helpers Refine logic for deciding when tokens need to be re-lexed 2016-06-21 07:28:04 -07:00
integration Abort erroneous parse versions more eagerly 2016-06-02 14:04:48 -07:00
runtime Update error recovery specs to reflect slightly different recoveries 2016-06-18 20:46:16 -07:00
spec_helper.h Fix leaked lookahead trees in normal parsing 2016-01-29 17:31:43 -08:00
specs.cc Unify test targets, use externally defined languages as fixtures 2016-01-15 11:19:24 -08:00