| .. |
|
lex_conflict_manager.cc
|
Mark tokens as non-reusable in states where shorter takes take precedence
|
2017-06-22 16:04:42 -07:00 |
|
lex_conflict_manager.h
|
Implement Rule as a union rather than an abstract base class
|
2017-03-17 13:29:31 -07:00 |
|
lex_item.cc
|
Remove use of shared_ptr in choice, repeat, and seq factories
|
2017-03-17 14:28:13 -07:00 |
|
lex_item.h
|
Implement Rule as a union rather than an abstract base class
|
2017-03-17 13:29:31 -07:00 |
|
lex_item_transitions.cc
|
Remove use of shared_ptr in choice, repeat, and seq factories
|
2017-03-17 14:28:13 -07:00 |
|
lex_item_transitions.h
|
Implement Rule as a union rather than an abstract base class
|
2017-03-17 13:29:31 -07:00 |
|
lex_table_builder.cc
|
Optimize lex state merging
|
2017-09-18 13:40:37 -07:00 |
|
lex_table_builder.h
|
Merge compatible starting token states before constructing lex table
|
2017-09-05 13:21:53 -07:00 |
|
lookahead_set.cc
|
Fix compile warnings
|
2017-07-12 22:08:36 -07:00 |
|
lookahead_set.h
|
Optimize lex state merging
|
2017-09-18 13:40:37 -07:00 |
|
parse_item.cc
|
Rename RENAME rule to ALIAS, allow it to create anonymous nodes
|
2017-07-31 16:41:11 -07:00 |
|
parse_item.h
|
Introduce RENAME rule type
|
2017-07-13 17:17:22 -07:00 |
|
parse_item_set_builder.cc
|
Use a constructor rather than aggregate initialization for Production
|
2017-08-08 10:41:54 -07:00 |
|
parse_item_set_builder.h
|
Handle inlined rules that contain other inlined rules
|
2017-07-20 15:29:06 -07:00 |
|
parse_table_builder.cc
|
Never move the start rule of a grammar into the lexical grammar
|
2017-12-07 11:50:27 -08:00 |
|
parse_table_builder.h
|
Move incompatible token map into LexTableBuilder
|
2017-08-31 15:46:37 -07:00 |
|
rule_can_be_blank.cc
|
Remove use of shared_ptr in choice, repeat, and seq factories
|
2017-03-17 14:28:13 -07:00 |
|
rule_can_be_blank.h
|
Implement Rule as a union rather than an abstract base class
|
2017-03-17 13:29:31 -07:00 |
