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.h	Fix assorted memory leaks in test code	2016-02-05 12:23:54 -08:00
parser.h	Refine logic for deciding when tokens need to be re-lexed	2016-06-21 07:28:04 -07:00
runtime.h	Remove old error recovery code	2016-03-02 20:58:39 -08:00