tree-sitter/spec/compiler/prepare_grammar_spec.cpp

125 lines
4.4 KiB
C++
Raw Normal View History

2014-01-03 01:02:24 -08:00
#include "spec_helper.h"
#include "prepared_grammar.h"
2014-01-28 18:44:14 -08:00
#include "prepare_grammar/perform.h"
#include "rules/symbol.h"
2014-01-03 01:02:24 -08:00
START_TEST
2014-01-11 17:08:32 -08:00
using namespace rules;
2014-01-28 18:44:14 -08:00
using prepare_grammar::perform;
2014-01-03 01:02:24 -08:00
describe("preparing a grammar", []() {
describe("extracting tokens", []() {
it("moves sub-rules that don't contain symbols into a separate 'lexical' grammar", [&]() {
pair<PreparedGrammar, PreparedGrammar> result = perform(Grammar("rule1", {
{ "rule1", seq({
character({ 'a' }),
character({ 'b' }),
seq({
sym("rule2"),
sym("rule3") }),
seq({
character({ 'a' }),
character({ 'b' }) }) }) }
}));
AssertThat(result.first, Equals(PreparedGrammar("rule1", {
{ "rule1", seq({
make_shared<Symbol>("token1", SymbolTypeAuxiliary),
seq({
sym("rule2"),
sym("rule3") }),
make_shared<Symbol>("token1", SymbolTypeAuxiliary) }) }
}, {})));
AssertThat(result.second, Equals(PreparedGrammar("", {}, {
{ "token1", rules::seq({
rules::character({ 'a' }),
rules::character({ 'b' }) }) },
})));
});
2014-01-03 01:02:24 -08:00
it("moves entire rules into the lexical grammar when possible, preserving their names", [&]() {
auto result = perform(Grammar("rule1", {
{ "rule1", sym("rule2") },
{ "rule2", seq({
character({ 'a' }),
character({ 'b' }) }) }
}));
AssertThat(result.first, Equals(PreparedGrammar("rule1", {
{ "rule1", sym("rule2") }
}, {})));
AssertThat(result.second, Equals(PreparedGrammar("", {
{ "rule2", seq({
character({ 'a' }),
character({ 'b' }) }) },
}, {})));
});
it("does not extract blanks into tokens", [&]() {
pair<PreparedGrammar, PreparedGrammar> result = perform(Grammar("rule1", {
{ "rule1", choice({ sym("rule2"), blank() }) },
}));
AssertThat(result.first, Equals(PreparedGrammar("rule1", {
{ "rule1", choice({ sym("rule2"), blank() }) },
}, {})));
AssertThat(result.second, Equals(PreparedGrammar("", {}, {})));
});
});
describe("expanding repeats", []() {
it("replaces repeat rules with pairs of recursive rules", [&]() {
PreparedGrammar result = perform(Grammar("rule1", {
{ "rule1", seq({
sym("x"),
repeat(seq({ sym("a"), sym("b") })),
sym("y")
}) },
})).first;
AssertThat(result, Equals(PreparedGrammar("rule1", {
{ "rule1", seq({
sym("x"),
make_shared<Symbol>("repeat_helper1", SymbolTypeAuxiliary),
sym("y")
}) },
}, {
2014-02-15 15:43:32 -08:00
{ "repeat_helper1", choice({
seq({
seq({ sym("a"), sym("b") }),
make_shared<Symbol>("repeat_helper1", SymbolTypeAuxiliary),
}),
2014-02-15 15:43:32 -08:00
blank(),
}) }
})));
});
it("does not replace repeat rules that can be moved into the lexical grammar", [&]() {
pair<PreparedGrammar, PreparedGrammar> result = perform(Grammar("rule1", {
{ "rule1", seq({
sym("x"),
repeat(seq({ str("a"), str("b") })),
sym("y")
}) },
}));
AssertThat(result.first, Equals(PreparedGrammar("rule1", {
{ "rule1", seq({
sym("x"),
make_shared<Symbol>("token1", SymbolTypeAuxiliary),
sym("y")
}) },
}, {})));
AssertThat(result.second, Equals(PreparedGrammar("", {}, {
{ "token1", repeat(seq({ str("a"), str("b") })) },
})));
});
});
2014-01-03 01:02:24 -08:00
});
END_TEST