rley 0.1.00 → 0.1.01

checksums.yaml

@@ -1,15 +1,15 @@
 ---
 !binary "U0hBMQ==":
   metadata.gz: !binary |-
-    MzdkNmMxNWFhMmZjYWY2MzUwM2JhZjUyYzQxYmJjMzdiZmFjMjRhOQ==
+    NDFkMmY0NDg1YzViYzMwYjRmODJhZDg2ZmQ5Mjc4OTljNTMxZjEyZg==
   data.tar.gz: !binary |-
-    ODFlMzBlNjNjYjQyODIyNjQwYzY2OTUzMTAyNDI3NGIyMmFkOTcxMg==
+    NWJjNzRmZWEzZjc3N2IyMTgxYTQ2ZGNjMGI0ZmI0ODY1NTU4N2Q1NA==
 !binary "U0hBNTEy":
   metadata.gz: !binary |-
-    M2EyMDU5MDQ2YzFiYTMyNGU1OWYxYWQ2ODBjNjllZjNhZTUzZjU3NmY0YzE0
-    ODYzMTRiZjZmNzg2ZjZmMTIzZWI2MmNiNzY4M2ZiYjljZTcyN2E4MGNjZDNl
-    ZTQ5YTQ0OWRjMmFlNGIwNTFmMjU2Y2E4YzJkMjFiZGM4NjU4NDI=
+    MTNlOGQ3NjliMDFmNGY2ZDk4NGRjZGYzMjE1NzdhODg0ZWJiNzMwZGE5MjY2
+    MTgwOWI0NjRiMjI3MTBhOGI2NjQ4MWMxNmMyNjM3ODFhYWMzZjlmNzNmYTdm
+    ODk5MDZiZjAxNmJkYTY0YjIyYmI3YWI4YjRlMzEyZDE3YzFjMjU=
   data.tar.gz: !binary |-
-    ZTRlMjdhNGM3MTIzZTUyZmQ5MDVjZGMxZjFlNzI0MTI3NTIyZjNlZDBiYmEz
-    ZTU1MDQ4NTBlNzJjYmRiMDRlZTdmODdhYTUwY2NiZDcxMTVlYTM5NjgwZDcz
-    MzM0YTBjZDJiMGI1YWMxMDI0MzYzOGQ4ZDU5ZjIwNWZkZDY2ZWY=
+    YWE0NWIzNThkZWU1YThkN2JjZTg4Y2ZkYTAyNzYyODk3NjIyNGFiZDFlNzlm
+    OTRlMGE1OTQ2ZWI4MTI0ZjJiNzhlNzk3MDNmYWQyNTA5ZGQwNmE0MzMwMDU1
+    NzE4MTZhYzBkYjVhNWQ5ZTBmNGYwNjUxMGEwOTVlZDhiYzUwZTI=

data/CHANGELOG.md

@@ -1,3 +1,6 @@
+### 0.1.01 / 2014-12-06
+* [CHANGE] Restaured test coverage to above 99%
+
 ### 0.1.00 / 2014-12-05
 * [CHANGE] Bumped version number: it is the first version able to generate a parse tree.
 * [NEW] `Grammar#name2symbol` attribute and accessor. Retrieve a grammar symbol from its name.

data/lib/rley/constants.rb

@@ -3,7 +3,7 @@
 
 module Rley # Module used as a namespace
   # The version number of the gem.
-  Version = '0.1.00'
+  Version = '0.1.01'
 
   # Brief description of the gem.
   Description = "Ruby implementation of the Earley's parsing algorithm"

data/spec/rley/parser/parse_state_spec.rb

@@ -98,6 +98,8 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           state0 = ParseState.new(DottedItem.new(sample_prod, 0), origin_val)
           expect(state0.precedes?(state1)).to eq(true)
           expect(state0.precedes?(subject)).to eq(false)
+          state3 = ParseState.new(DottedItem.new(sample_prod, 3), origin_val)
+          expect(state3.precedes?(state0)).to eq(false)
         end
         
         it 'should know its text representation' do

data/spec/rley/parser/state_set_spec.rb

@@ -72,6 +72,14 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           allow(prod2).to receive(:lhs).and_return(non_term) 
           expect(subject.states_rewriting(non_term)).to eq([state2])
         end
+        
+        it 'should complain when impossible predecessor of parse state' do
+          subject.push_state(state1)
+          subject.push_state(state2)
+          allow(dotted_rule1).to receive(:prev_position).and_return(nil) 
+          err = StandardError
+          expect { subject.predecessor_state(state1) }.to raise_error(err)
+        end
 
       end # context
 

data/spec/rley/ptree/token_range_spec.rb

@@ -13,7 +13,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
       subject { TokenRange.new(sample_range) }
 
       context 'Initialization:' do
-        it 'should be created with a range Hash' do
+        it 'could be created with a range Hash' do
           # No bounds provided
           expect { TokenRange.new({}) }.not_to raise_error
 
@@ -26,6 +26,20 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           # Both bounds provided
           expect { TokenRange.new({low: 0, high: 5}) }.not_to raise_error
         end
+        
+        it 'could be created with another TokenRange' do
+          # Low bound provided
+          instance = TokenRange.new({low: 0})
+          expect { TokenRange.new(instance) }.not_to raise_error
+
+          # High bound provided
+          instance = TokenRange.new({high: 5})
+          expect { TokenRange.new(instance) }.not_to raise_error
+
+          # Both bounds provided
+          instance = TokenRange.new({low: 0, high: 5})
+          expect { TokenRange.new(instance) }.not_to raise_error
+        end
 
         it 'should know its low bound' do
           expect(subject.low).to eq(0)
@@ -37,6 +51,13 @@ module Rley # Open this namespace to avoid module qualifier prefixes
       end # context
 
       context 'Provided services:' do
+        it 'should compare to another range' do
+          expect(subject == subject).to eq(true)
+          equal = TokenRange.new({low: 0, high: 5})
+          expect(subject == equal).to eq(true)
+        end
+
+      
         it 'should know whether it is bounded or not' do
           expect(subject).to be_bounded
 
@@ -53,7 +74,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           expect(instance).not_to be_bounded
         end
 
-        it 'should assign it open bounds' do
+        it 'should assign its open bounds' do
           some_range = {low: 1, high: 4}
 
           ###########

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rley
 version: !ruby/object:Gem::Version
-  version: 0.1.00
+  version: 0.1.01
 platform: ruby
 authors:
 - Dimitri Geshef
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2014-12-05 00:00:00.000000000 Z
+date: 2014-12-06 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake