#include "parse_table_builder.h" #include "item_set.h" #include "rules.h" using namespace std; namespace tree_sitter { namespace lr { static int NOT_FOUND = -1; ParseTable ParseTableBuilder::build_table(const tree_sitter::Grammar &grammar) { auto builder = ParseTableBuilder(grammar); builder.build(); return builder.table; } ParseTableBuilder::ParseTableBuilder(const Grammar &grammar) : grammar(grammar), table(ParseTable(grammar.rule_names())), state_indices(unordered_map()) {}; void ParseTableBuilder::build() { auto item = Item(ParseTable::START, rules::sym(grammar.start_rule_name), 0); auto item_set = std::make_shared(item, grammar); add_item_set(item_set); } size_t ParseTableBuilder::add_item_set(const shared_ptr item_set) { auto state_index = state_index_for_item_set(*item_set); if (state_index == NOT_FOUND) { state_index = table.add_state(); state_indices[std::hash()(*item_set)] = state_index; for (auto transition : item_set->sym_transitions(grammar)) { rules::sym_ptr symbol = static_pointer_cast(transition.first); size_t new_state_index = add_item_set(transition.second); table.add_action(state_index, symbol->name, ParseAction::Shift(new_state_index)); } for (Item item : *item_set) { if (item.is_done()) { if (item.rule_name == ParseTable::START) { table.add_action(state_index, ParseTable::END_OF_INPUT, ParseAction::Accept()); } else { for (string rule_name : table.symbol_names) table.add_action(state_index, rule_name, ParseAction::Reduce(item.rule_name, item.consumed_sym_count)); } } } } return state_index; } long ParseTableBuilder::state_index_for_item_set(const ItemSet &item_set) const { auto entry = state_indices.find(std::hash()(item_set)); return (entry == state_indices.end()) ? NOT_FOUND : entry->second; } } }