RubyGems - treetop - Versions diffs - 1.5.3 → 1.6.12 - Mend

treetop 1.5.3 → 1.6.12

Files changed (95) hide show

checksums.yaml +5 -13
data/Gemfile +12 -0
data/History.txt +18 -0
data/README.md +4 -0
data/Rakefile +20 -40
data/Treetop.tmbundle/Preferences/Comments.tmPreferences +28 -0
data/Treetop.tmbundle/Snippets/grammar ___ end.tmSnippet +20 -0
data/Treetop.tmbundle/Snippets/rule ___ end.tmSnippet +18 -0
data/Treetop.tmbundle/Support/nibs/SyntaxTreeViewer.nib/designable.nib +1524 -0
data/Treetop.tmbundle/Support/nibs/SyntaxTreeViewer.nib/keyedobjects.nib +0 -0
data/Treetop.tmbundle/Support/syntax_tree_viewer.rb +117 -0
data/Treetop.tmbundle/Syntaxes/Treetop Grammar.tmLanguage +358 -0
data/Treetop.tmbundle/info.plist +10 -0
data/doc/pitfalls_and_advanced_techniques.markdown +7 -1
data/doc/syntactic_recognition.markdown +7 -2
data/doc/tt.1 +1 -1
data/examples/indented_blocks/indented_blocks.tt +73 -0
data/examples/indented_blocks/indented_blocks_test.rb +24 -0
data/lib/treetop/compiler/grammar_compiler.rb +6 -3
data/lib/treetop/compiler/metagrammar.rb +301 -159
data/lib/treetop/compiler/metagrammar.treetop +96 -13
data/lib/treetop/compiler/node_classes/anything_symbol.rb +10 -2
data/lib/treetop/compiler/node_classes/atomic_expression.rb +2 -2
data/lib/treetop/compiler/node_classes/character_class.rb +10 -2
data/lib/treetop/compiler/node_classes/choice.rb +11 -7
data/lib/treetop/compiler/node_classes/nonterminal.rb +6 -2
data/lib/treetop/compiler/node_classes/parenthesized_expression.rb +5 -1
data/lib/treetop/compiler/node_classes/parsing_expression.rb +10 -1
data/lib/treetop/compiler/node_classes/parsing_rule.rb +1 -1
data/lib/treetop/compiler/node_classes/predicate.rb +8 -1
data/lib/treetop/compiler/node_classes/predicate_block.rb +7 -0
data/lib/treetop/compiler/node_classes/repetition.rb +28 -8
data/lib/treetop/compiler/node_classes/sequence.rb +5 -1
data/lib/treetop/compiler/node_classes/terminal.rb +36 -22
data/lib/treetop/compiler/ruby_builder.rb +2 -2
data/lib/treetop/ruby_extensions/string.rb +0 -6
data/lib/treetop/runtime/compiled_parser.rb +33 -14
data/lib/treetop/runtime/syntax_node.rb +24 -15
data/lib/treetop/runtime/terminal_parse_failure.rb +4 -3
data/lib/treetop/runtime/terminal_syntax_node.rb +4 -4
data/lib/treetop/version.rb +2 -2
data/treetop.gemspec +25 -165
metadata +43 -98
data/doc/site.rb +0 -112
data/doc/sitegen.rb +0 -65
data/examples/lambda_calculus/lambda_calculus +0 -0
data/spec/compiler/and_predicate_spec.rb +0 -36
data/spec/compiler/anything_symbol_spec.rb +0 -44
data/spec/compiler/character_class_spec.rb +0 -301
data/spec/compiler/choice_spec.rb +0 -80
data/spec/compiler/circular_compilation_spec.rb +0 -30
data/spec/compiler/failure_propagation_functional_spec.rb +0 -21
data/spec/compiler/grammar_compiler_spec.rb +0 -113
data/spec/compiler/grammar_spec.rb +0 -41
data/spec/compiler/multibyte_chars_spec.rb +0 -38
data/spec/compiler/namespace_spec.rb +0 -42
data/spec/compiler/nonterminal_symbol_spec.rb +0 -40
data/spec/compiler/not_predicate_spec.rb +0 -38
data/spec/compiler/occurrence_range_spec.rb +0 -189
data/spec/compiler/one_or_more_spec.rb +0 -35
data/spec/compiler/optional_spec.rb +0 -37
data/spec/compiler/parenthesized_expression_spec.rb +0 -19
data/spec/compiler/parsing_rule_spec.rb +0 -61
data/spec/compiler/repeated_subrule_spec.rb +0 -29
data/spec/compiler/semantic_predicate_spec.rb +0 -175
data/spec/compiler/sequence_spec.rb +0 -129
data/spec/compiler/terminal_spec.rb +0 -170
data/spec/compiler/terminal_symbol_spec.rb +0 -37
data/spec/compiler/test_grammar.treetop +0 -7
data/spec/compiler/test_grammar.tt +0 -7
data/spec/compiler/test_grammar_do.treetop +0 -7
data/spec/compiler/test_grammar_magic_coding.treetop +0 -8
data/spec/compiler/test_grammar_magic_encoding.treetop +0 -8
data/spec/compiler/tt_compiler_spec.rb +0 -224
data/spec/compiler/zero_or_more_spec.rb +0 -56
data/spec/composition/a.treetop +0 -11
data/spec/composition/b.treetop +0 -11
data/spec/composition/c.treetop +0 -10
data/spec/composition/d.treetop +0 -10
data/spec/composition/f.treetop +0 -17
data/spec/composition/grammar_composition_spec.rb +0 -40
data/spec/composition/subfolder/e_includes_c.treetop +0 -15
data/spec/ruby_extensions/string_spec.rb +0 -32
data/spec/runtime/compiled_parser_spec.rb +0 -123
data/spec/runtime/interval_skip_list/delete_spec.rb +0 -147
data/spec/runtime/interval_skip_list/expire_range_spec.rb +0 -349
data/spec/runtime/interval_skip_list/insert_and_delete_node_spec.rb +0 -385
data/spec/runtime/interval_skip_list/insert_spec.rb +0 -660
data/spec/runtime/interval_skip_list/interval_skip_list_spec.graffle +0 -6175
data/spec/runtime/interval_skip_list/interval_skip_list_spec.rb +0 -58
data/spec/runtime/interval_skip_list/palindromic_fixture.rb +0 -35
data/spec/runtime/interval_skip_list/palindromic_fixture_spec.rb +0 -163
data/spec/runtime/interval_skip_list/spec_helper.rb +0 -91
data/spec/runtime/syntax_node_spec.rb +0 -77
data/spec/spec_helper.rb +0 -115

data/spec/runtime/interval_skip_list/insert_and_delete_node_spec.rb DELETED Viewed

@@ -1,385 +0,0 @@
-require 'runtime/interval_skip_list/spec_helper'
-shared_examples_for "it is non-empty" do
-  specify "#empty? returns false" do
-    list.should_not be_empty
-  end
-end
-shared_examples_for "#nodes is an array of the three inserted nodes in key order" do
-  specify "#nodes is an array of the three inserted nodes in key order" do
-    list.nodes.should == inserted_nodes.sort_by(&:key)
-  end
-end
-shared_examples_for "it has nil forward pointers" do
-  it "has nil forward pointers" do
-    inserted_node.forward.each do |next_pointer|
-      next_pointer.should be_nil
-    end
-  end
-end
-describe IntervalSkipList do
-  attr_reader :list
-  before do
-    @list = IntervalSkipList.new
-  end
-  describe " when nothing has been inserted" do
-    specify "#empty? returns true" do
-      list.should be_empty
-    end
-    specify "#nodes returns an empty array" do
-      list.nodes.should == []
-    end
-    describe "#head" do
-      attr_reader :head
-      before do
-        @head = list.head
-      end
-      it "#has a height of #max_height" do
-        head.height.should == list.max_height
-      end
-      it "has nil forward pointers" do
-        0.upto(list.max_height - 1) do |i|
-          head.forward[i].should be_nil
-        end
-      end
-    end
-  end
-  describe " when 1 has been inserted", :deterministic => true do
-    attr_reader :inserted_node, :inserted_nodes
-    def expected_node_heights
-      [1]
-    end
-    include NextNodeHeightIsDeterministicSharedContext
-    before do
-      @inserted_node = list.insert_node(1)
-      @inserted_nodes = [@inserted_node]
-    end
-    it_should_behave_like "it is non-empty"
-    it_should_behave_like "#nodes is an array of the three inserted nodes in key order"
-    describe "#head" do
-      attr_reader :head
-      before do
-        @head = list.head
-      end
-      it "has inserted_node.height forward pointers pointing at the inserted node" do
-        0.upto(inserted_node.height - 1) do |i|
-          head.forward[i].should == inserted_node
-        end
-      end
-      it "has the rest of its forward pointers pointing at nil" do
-        inserted_node.height.upto(list.max_height - 1) do |i|
-          head.forward[i].should == nil
-        end
-      end
-    end
-    describe "the inserted node" do
-      it_should_behave_like "it has nil forward pointers"
-      it "has a height of the expected_node_heights.first" do
-        inserted_node.height.should == expected_node_heights.first
-      end
-      it "has a key of 1" do
-        inserted_node.key.should == 1
-      end
-    end
-    describe "and subsequently deleted" do
-      before do
-        list.delete_node(1)
-      end
-      specify "#empty? returns true" do
-        list.should be_empty
-      end
-    end
-  end
-  describe " when 1 and 3 have been inserted in order", :deterministic => true do
-    attr_reader :inserted_nodes
-    def expected_node_heights
-      [1, 2]
-    end
-    include NextNodeHeightIsDeterministicSharedContext
-    before do
-      @inserted_nodes = []
-      inserted_nodes << list.insert_node(1)
-      inserted_nodes << list.insert_node(3)
-    end
-    it_should_behave_like "it is non-empty"
-    it_should_behave_like "#nodes is an array of the three inserted nodes in key order"
-    describe "the first inserted node" do
-      attr_reader :inserted_node
-      before do
-        @inserted_node = inserted_nodes[0]
-      end
-      it "has a key of 1" do
-        inserted_node.key.should == 1
-      end
-      it "has a height of the first expected node height" do
-        inserted_node.height.should == expected_node_heights[0]
-      end
-      it "has its single forward pointer pointing at the second inserted node" do
-        inserted_node.forward[0].should == inserted_nodes[1]
-      end
-    end
-    describe "the second inserted node" do
-      attr_reader :inserted_node
-      before do
-        @inserted_node = inserted_nodes[1]
-      end
-      it_should_behave_like "it has nil forward pointers"
-      it "has a key of 3" do
-        inserted_node.key.should == 3
-      end
-      it "has a height of the second expected node height" do
-        inserted_node.height.should == expected_node_heights[1]
-      end
-    end
-    describe "and 1 is subsequently deleted" do
-      before do
-        list.delete_node(1)
-      end
-      describe "the remaining node" do
-        attr_reader :inserted_node
-        before do
-          @inserted_node = inserted_nodes[1]
-        end
-        it "is the first node in the list" do
-          inserted_node.should == list.nodes[0]
-        end
-        it_should_behave_like "it has nil forward pointers"
-      end
-    end
-    describe "and 3 is subsequently deleted" do
-      before do
-        list.delete_node(3)
-      end
-      describe "the remaining node" do
-        attr_reader :inserted_node
-        before do
-          @inserted_node = inserted_nodes[0]
-        end
-        it "is the first node in the list" do
-          inserted_node.should == list.nodes[0]
-        end
-        it_should_behave_like "it has nil forward pointers"
-      end
-    end
-  end
-  describe " when 1, 3 and 7 have been inserted in order", :deterministic => true do
-    attr_reader :inserted_nodes
-    def expected_node_heights
-      [1, 2, 1]
-    end
-    include NextNodeHeightIsDeterministicSharedContext
-    before do
-      @inserted_nodes = []
-      inserted_nodes << list.insert_node(1)
-      inserted_nodes << list.insert_node(3)
-      inserted_nodes << list.insert_node(7)
-    end
-    it_should_behave_like "it is non-empty"
-    it_should_behave_like "#nodes is an array of the three inserted nodes in key order"
-    describe "the first inserted node" do
-      attr_reader :inserted_node
-      before do
-        @inserted_node = inserted_nodes[0]
-      end
-      it "has a key of 1" do
-        inserted_node.key.should == 1
-      end
-      it "has a height of the first expected node height" do
-        inserted_node.height.should == expected_node_heights[0]
-      end
-      it "has its single forward pointer pointing at the second inserted node" do
-        inserted_node.forward[0].should == inserted_nodes[1]
-      end
-    end
-    describe "the second inserted node" do
-      attr_reader :inserted_node
-      before do
-        @inserted_node = inserted_nodes[1]
-      end
-      it "has a key of 3" do
-        inserted_node.key.should == 3
-      end
-      it "has a height of the second expected node height" do
-        inserted_node.height.should == expected_node_heights[1]
-      end
-      it "has a forward pointer at level 0 pointing to the third inserted node" do
-        inserted_node.forward[0].should == inserted_nodes[2]
-      end
-      it "has nil forward pointer at level 1" do
-        inserted_node.forward[1].should be_nil
-      end
-    end
-    describe "the third inserted node" do
-      attr_reader :inserted_node
-      before do
-        @inserted_node = inserted_nodes[2]
-      end
-      it_should_behave_like "it has nil forward pointers"
-      it "has a key of 3" do
-        inserted_node.key.should == 7
-      end
-      it "has a height of the third expected node height" do
-        inserted_node.height.should == expected_node_heights[2]
-      end
-    end
-    describe "and 3 is subsequently deleted" do
-      before do
-        list.delete_node(3)
-      end
-      specify "#head points at nil at levels 1 and 2" do
-        list.head.forward[1].should be_nil
-        list.head.forward[2].should be_nil
-      end
-      specify "#nodes contains the remaining nodes in order" do
-        list.nodes.should == [inserted_nodes[0], inserted_nodes[2]]
-      end
-    end
-  end
-  describe " when 7, 1 and 3 have been inserted in order", :deterministic => true do
-    attr_reader :inserted_nodes
-    def expected_node_heights
-      [1, 1, 2]
-    end
-    include NextNodeHeightIsDeterministicSharedContext
-    before do
-      @inserted_nodes = []
-      inserted_nodes << list.insert_node(7)
-      inserted_nodes << list.insert_node(1)
-      inserted_nodes << list.insert_node(3)
-    end
-    it_should_behave_like "it is non-empty"
-    it_should_behave_like "#nodes is an array of the three inserted nodes in key order"
-    describe "the first inserted node" do
-      attr_reader :inserted_node
-      before do
-        @inserted_node = inserted_nodes[0]
-      end
-      it_should_behave_like "it has nil forward pointers"
-      it "has a key of 7" do
-        inserted_node.key.should == 7
-      end
-      it "has a height of the first expected node height" do
-        inserted_node.height.should == expected_node_heights[0]
-      end
-    end
-    describe "the second inserted node" do
-      attr_reader :inserted_node
-      before do
-        @inserted_node = inserted_nodes[1]
-      end
-      it "has a key of 1" do
-        inserted_node.key.should == 1
-      end
-      it "has a height of the second expected node height" do
-        inserted_node.height.should == expected_node_heights[1]
-      end
-      it "has a forward pointer at level 0 pointing to the second node in the list" do
-        inserted_node.forward[0].should == list.nodes[1]
-      end
-    end
-    describe "the third inserted node" do
-      attr_reader :inserted_node
-      before do
-        @inserted_node = inserted_nodes[2]
-      end
-      it "has a key of 3" do
-        inserted_node.key.should == 3
-      end
-      it "has a height of the third expected node height" do
-        inserted_node.height.should == expected_node_heights[2]
-      end
-    end
-  end
-end