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

Compute transitions correctly for long sequences

Browse source
This commit is contained in:
Max Brunsfeld 2013-11-06 13:37:01 -08:00
parent 95d955e779
commit 061d8a8efc
4 changed files with 36 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

10
spec/rules_spec.cpp
View file

@ -12,6 +12,7 @@ Describe(Rules) {
Symbol symbol1 = Symbol(1);
Symbol symbol2 = Symbol(2);
Symbol symbol3 = Symbol(3);
Symbol symbol4 = Symbol(3);
It(handles_symbols) {
AssertThat(
@ -40,6 +41,15 @@ Describe(Rules) {
), TransitionMap<Rule>::elements_equal));
}
It(handles_long_sequences) {
AssertThat(
Seq(Seq(symbol1, symbol2), Seq(symbol3, symbol4)).transitions(),
EqualsContainer(TransitionMap<Rule>(
{ symbol1.copy() },
{ new Seq(symbol2, Seq(symbol3, symbol4)) }
), TransitionMap<Rule>::elements_equal));
}
It(handles_choices_with_common_starting_symbols) {
AssertThat(
Choice(