traxys/tree-sitter
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Convert repeat rules into pairs of recursive rules

Browse source
This commit is contained in:
Max Brunsfeld 2014-01-24 18:25:56 -08:00
parent cbcf28f9d4
commit 67fa81d079
10 changed files with 328 additions and 218 deletions
Download patch file Download diff file Expand all files Collapse all files

61
spec/compiler/prepare_grammar_spec.cpp
View file

@ -1,61 +0,0 @@
#include "spec_helper.h"
#include "prepare_grammar/perform.h"
START_TEST
using prepare_grammar::perform;
using namespace rules;
describe("preparing a grammar", []() {
it("extracts character-based subtrees into a separate grammar", [&]() {
pair<Grammar, Grammar> result = perform(Grammar({
{ "rule1", seq({
character('a'),
character('b'),
seq({
sym("rule2"),
sym("rule3") }),
seq({
character('a'),
character('b') }) }) }
}));
AssertThat(result.first, Equals(Grammar({
{ "rule1", seq({
sym("1"),
seq({
sym("rule2"),
sym("rule3") }),
sym("1") }) }
})));
AssertThat(result.second, Equals(Grammar("", {
{ "1", rules::seq({
rules::character('a'),
rules::character('b') }) },
{ "__END__", character('\0') },
})));
});
it("turns entire rules into tokens when they contain no symbols", [&]() {
auto result = perform(Grammar({
{ "rule1", sym("rule2") },
{ "rule2", seq({
character('a'),
character('b') }) }
}));
AssertThat(result.first, Equals(Grammar({
{ "rule1", sym("rule2") }
})));
AssertThat(result.second, Equals(Grammar("", {
{ "rule2", seq({
character('a'),
character('b') }) },
{ "__END__", character('\0') },
})));
});
});
END_TEST