#include "spec_helper.h" #include using namespace tree_sitter::lr; typedef std::unordered_set parse_actions; typedef std::unordered_set lex_actions; START_TEST describe("building parse and lex tables", []() { Grammar grammar = test_grammars::arithmetic(); ParseTable table = build_tables(grammar).first; LexTable lex_table = build_tables(grammar).second; function parse_state = [&](size_t index) { return table.states[index]; }; function lex_state = [&](size_t parse_state_index) { size_t index = table.states[parse_state_index].lex_state_index; return lex_table.states[index]; }; it("has the right starting state", [&]() { AssertThat(parse_state(0).actions, Equals(unordered_map({ { "expression", parse_actions({ ParseAction::Shift(1) }) }, { "term", parse_actions({ ParseAction::Shift(2) }) }, { "factor", parse_actions({ ParseAction::Shift(5) }) }, { "variable", parse_actions({ ParseAction::Shift(8) }) }, { "number", parse_actions({ ParseAction::Shift(8) }) }, { "left_paren", parse_actions({ ParseAction::Shift(9) }) } }))); AssertThat(lex_state(0).actions, Equals(unordered_map({ { CharMatchClass(CharClassWord), lex_actions({ LexAction::Advance(1) }) }, { CharMatchClass(CharClassDigit), lex_actions({ LexAction::Advance(4) }) }, { CharMatchSpecific('('), lex_actions({ LexAction::Advance(11) }) } }))); }); it("accepts when the start symbol is reduced", [&]() { AssertThat(parse_state(1).actions, Equals(unordered_map({ { ParseTable::END_OF_INPUT, parse_actions({ ParseAction::Accept() }) } }))); }); it("has the right next states", [&]() { AssertThat(parse_state(2).actions, Equals(unordered_map({ { "plus", parse_actions({ ParseAction::Shift(3) }) }, }))); AssertThat(parse_state(3).actions, Equals(unordered_map({ { "variable", parse_actions({ ParseAction::Shift(8) }) }, { "factor", parse_actions({ ParseAction::Shift(5) }) }, { "left_paren", parse_actions({ ParseAction::Shift(9) }) }, { "number", parse_actions({ ParseAction::Shift(8) }) }, { "term", parse_actions({ ParseAction::Shift(4) }) }, }))); }); }); END_TEST