52daffb3f3
This way, every ParseItem can be associated with a particular production for its non-terminal. That lets us keep track of which productions are involved in shift/reduce conflicts.
88 lines
2.6 KiB
C++
88 lines
2.6 KiB
C++
#include "compiler/compiler_spec_helper.h"
|
|
#include "compiler/build_tables/build_parse_table.h"
|
|
#include "compiler/parse_table.h"
|
|
#include "compiler/lexical_grammar.h"
|
|
#include "compiler/syntax_grammar.h"
|
|
#include "compiler/rules/built_in_symbols.h"
|
|
|
|
using namespace rules;
|
|
using namespace build_tables;
|
|
|
|
START_TEST
|
|
|
|
describe("build_parse_table", []() {
|
|
SyntaxGrammar parse_grammar({
|
|
{
|
|
"rule0",
|
|
{
|
|
Production({ {Symbol(1), 0, 1} }, 0),
|
|
Production({ {Symbol(2), 0, 2} }, 0)
|
|
}
|
|
},
|
|
{
|
|
"rule1",
|
|
{
|
|
Production({ {Symbol(0, SymbolOptionToken), 0, 3} }, 0)
|
|
}
|
|
},
|
|
{
|
|
"rule2",
|
|
{
|
|
Production({ {Symbol(1, SymbolOptionToken), 0, 4} }, 0)
|
|
}
|
|
},
|
|
}, {}, { Symbol(2, SymbolOptionToken) });
|
|
|
|
LexicalGrammar lex_grammar({
|
|
{ "token0", pattern("[a-c]") },
|
|
{ "token1", pattern("[b-d]") },
|
|
}, {});
|
|
|
|
it("first looks for the start rule and its item set closure", [&]() {
|
|
auto result = build_parse_table(parse_grammar, lex_grammar);
|
|
|
|
AssertThat(result.first.states[0].actions, Equals(map<Symbol, ParseAction>({
|
|
// start item
|
|
{ Symbol(0), ParseAction::Shift(1, { 0 }) },
|
|
|
|
// expanded from the item set closure of the start item
|
|
{ Symbol(1), ParseAction::Shift(2, { 0 }) },
|
|
{ Symbol(2), ParseAction::Shift(2, { 0 }) },
|
|
{ Symbol(0, SymbolOptionToken), ParseAction::Shift(3, { 0 }) },
|
|
{ Symbol(1, SymbolOptionToken), ParseAction::Shift(4, { 0 }) },
|
|
|
|
// for the ubiquitous_token 'token2'
|
|
{ Symbol(2, SymbolOptionToken), ParseAction::ShiftExtra() },
|
|
})));
|
|
});
|
|
|
|
it("ensures that the built-in 'ERROR' symbol is in the symbol set", [&]() {
|
|
auto result = build_parse_table(parse_grammar, lex_grammar);
|
|
AssertThat(result.first.symbols, Contains(rules::ERROR()));
|
|
});
|
|
|
|
it("accepts the input when EOF occurs after the start rule", [&]() {
|
|
auto result = build_parse_table(parse_grammar, lex_grammar);
|
|
|
|
AssertThat(result.first.states[1].actions, Equals(map<Symbol, ParseAction>({
|
|
{ END_OF_INPUT(), ParseAction::Accept() },
|
|
|
|
// for the ubiquitous_token 'token2'
|
|
{ Symbol(2, SymbolOptionToken), ParseAction::ShiftExtra() },
|
|
})));
|
|
});
|
|
|
|
it("reduces a rule once it has been consumed", [&]() {
|
|
auto result = build_parse_table(parse_grammar, lex_grammar);
|
|
|
|
AssertThat(result.first.states[2].actions, Equals(map<Symbol, ParseAction>({
|
|
{ END_OF_INPUT(), ParseAction::Reduce(Symbol(0), 1, 0) },
|
|
|
|
// for the ubiquitous_token 'token2'
|
|
{ Symbol(2, SymbolOptionToken), ParseAction::ShiftExtra() },
|
|
})));
|
|
});
|
|
});
|
|
|
|
|
|
END_TEST
|