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
..
compiler	Refine logic for deciding when tokens need to be re-lexed	2016-06-21 07:28:04 -07:00
fixtures	Don't count extra trees toward stack versions' error costs	2016-06-26 22:46:40 -07:00
helpers	Move random string helpers into a separate file	2016-07-17 06:22:05 -07:00
integration	Move random string helpers into a separate file	2016-07-17 06:22:05 -07:00
runtime	Reuse nodes based on state matching, not sentential form validity	2016-07-31 21:31:19 -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