tree-sitter/spec/runtime
Max Brunsfeld 87ca3cb099 Reuse nodes based on state matching, not sentential form validity
I think that state matching is the only correct strategy for incremental
node reuse that is compatible with the new error recovery algorithm. It's
also simpler than the sentential-form algorithm. With the compressed parse
tables, state matching shouldn't be too conservative of a test.
2016-07-31 21:31:19 -07:00
..
document_spec.cc Reuse nodes based on state matching, not sentential form validity 2016-07-31 21:31:19 -07:00
node_spec.cc Avoid recompiling test languages when possible 2016-03-03 12:05:04 -08:00
parser_spec.cc Reuse nodes based on state matching, not sentential form validity 2016-07-31 21:31:19 -07:00
stack_spec.cc Store error recovery actions in the normal parse table 2016-06-27 14:07:47 -07:00
tree_spec.cc Expose lower stack nodes via pop_until() function 2016-03-07 16:09:34 -08:00