0
@@ -52,6 +52,18 @@ module Treetop
0
         results_to_delete.push(result)
0
       end
0
 
0
+      def inspect
0
+        s = ""
0
+        node_index.each do |rule_name, subhash|
0
+          s += "#{rule_name}: "
0
+          subhash.each do |i, v|
0
+            s += "#{i} => #{v.inspect}, "
0
+          end
0
+          s += "\n"
0
+        end
0
+        s
0
+      end
0
+
0
       protected
0
       
0
       def register_result(result)

0
@@ -159,4 +159,79 @@ module IterativeParsingSpec
0
       node_cache.should have_result(:number, 2)
0
     end
0
   end
0
+
0
+  describe "A parser for a simplified addition grammar" do
0
+    testing_grammar %{
0
+      grammar Addition
0
+        rule addition
0
+          primary '+' addition / primary
0
+        end
0
+
0
+        rule primary
0
+          '(' addition ')' / number
0
+        end
0
+
0
+        rule number
0
+          [0-9]
0
+        end
0
+      end
0
+    }
0
+
0
+    it "expires the stale failure of addition as successive characters are added to the buffer" do
0
+      input = '('
0
+      parse(input).should be_nil
0
+      node_cache.should have_result(:addition, 0)
0
+      node_cache.should have_result(:primary, 0)
0
+      node_cache.should have_result(:number, 0)
0
+
0
+      expire(1..1, 1)
0
+      node_cache.should_not have_result(:addition, 0)
0
+      node_cache.should_not have_result(:primary, 0)
0
+      node_cache.should have_result(:number, 0)
0
+
0
+      input.replace('(1')
0
+      reparse.should be_nil
0
+      node_cache.should have_result(:addition, 0)
0
+      node_cache.should have_result(:addition, 1)
0
+      node_cache.should have_result(:primary, 0)
0
+      node_cache.should have_result(:primary, 1)
0
+      node_cache.should have_result(:number, 0)
0
+      node_cache.should have_result(:number, 1)
0
+      
0
+      expire(2..2, 1)
0
+      node_cache.should_not have_result(:addition, 0)
0
+      node_cache.should_not have_result(:addition, 1)
0
+      node_cache.should_not have_result(:primary, 0)
0
+      node_cache.should have_result(:primary, 1) # is this true?
0
+      node_cache.should have_result(:number, 0)
0
+      node_cache.should have_result(:number, 1)
0
+
0
+      input.replace('(1+')
0
+      reparse.should be_nil
0
+      node_cache.should have_result(:addition, 0)
0
+      node_cache.should have_result(:addition, 1)
0
+      node_cache.should have_result(:primary, 0)
0
+      node_cache.should have_result(:primary, 1)
0
+      node_cache.should have_result(:number, 0)
0
+      node_cache.should have_result(:number, 1)
0
+
0
+      expire(3..3, 1)
0
+      node_cache.should_not have_result(:addition, 0)
0
+      node_cache.should_not have_result(:addition, 1)
0
+      node_cache.should_not have_result(:addition, 2)
0
+      node_cache.should_not have_result(:primary, 0)
0
+      node_cache.should have_result(:primary, 1) # is this true?
0
+      node_cache.should_not have_result(:primary, 2)
0
+      node_cache.should have_result(:number, 0)
0
+      node_cache.should have_result(:number, 1)
0
+      node_cache.should_not have_result(:number, 2)
0
+
0
+      input.replace('(1+2')
0
+      reparse.should be_nil
0
+
0
+      expire(4..4, 1)
0
+      input.replace('(1+2)')
0
+      reparse.should_not be_nil
0
+    end
0
+  end
0
 end
0
\ No newline at end of file

0
@@ -21,11 +21,11 @@ class TextraDocument < Rucola::RCDocument
0
     parser.send(:input).replace(text)
0
     
0
     puts 'after expiry'
0
-    pp node_index
0
+    p node_cache
0
 
0
     result = parser.reparse
0
     puts 'after reparse'
0
-    pp node_index
0
+    p node_cache
0
     
0
     
0