rley 0.2.02 → 0.2.03

checksums.yaml

@@ -1,15 +1,15 @@
 ---
 !binary "U0hBMQ==":
   metadata.gz: !binary |-
-    MzY1NzQxNzdkNGEzMDFiYzhhNmQ0M2Q5MTU3NzQxOGMyMDkxYTM4Ng==
+    ZWM0MGE3NzdlMzhiNTBkYTkzZjBlZjZjYzhhNTA1NzMwMzc4ZjI5NA==
   data.tar.gz: !binary |-
-    OGUzMzg4YmE5ZGRiZmRiOWEzMTFiYjhiOTJlYmQ2M2FkNzBkOWVjOQ==
+    M2JjYTE2OTQxNmI3MzNjOGZjMzJlZGNhY2NiYjU2ZjgzZmVmNmE3Mw==
 !binary "U0hBNTEy":
   metadata.gz: !binary |-
-    MzAzY2FkM2VkNzY2NDVhZDEwNmIyYWVkZDg3MDEwYzQ4ZGM3NzMzMmMxZTdk
-    YzYyZDZhMjNmNDQyZDc5ZmRlYzBjYTQ5ZTMyMmQzZTk2YjBiMjI3N2IxOTYw
-    YjZiZGYzZWQxZjUxM2ExMTQxMzExZmIzNTJmZTZjNDhjYzcyOTk=
+    MzA0NjBlNDZmNzMzYjc2MTg5Y2Q4NTUwMWE1MDZjMTM2MmJlM2I3ZmQ3ZTc2
+    ZWEzMjVjMmY5NjRkMzEyZGRmMTU1NTU5YzUyNjkxMGMwZDM4OTUyMGI2ZjQ0
+    NmQzMTIzOWFkNzAzOTY2MTA4MzYyYzU0MWU1MzkwMDQ5YjlkMjM=
   data.tar.gz: !binary |-
-    MWQ5MGM3YjVjNjNhY2JjMzE0MjlkMWIxZTE0NDI2NWQyMWU1MDBjMGE0ZTc2
-    MjI1NzU4OGM3NDczNWQ4ZWNjMzIzZGFjNzM1ODE0MzljZTM2MzJjYjY4Mjgz
-    YmM2ZThiODQ0Njg5N2ZiYzYzODNlZjRkNGJlZTgyY2U3YzYyNWE=
+    NjE0M2Q2YzliYzBkMzhlNzNhM2NhOTRiMDVkYzI1NTFlMTdiOGY0ODNjOWMz
+    YzkxZmYzNDg5ZTVkMzlkNjgzMzc5ZTE5ZTQzYzM0MTgwNDk4ZDQ3NDI4NGJh
+    NTg1NjMyYmVhNGU0MTkyMzk3NGJlMTYwM2QxMmZkNGIzMjMxMjE=

data/.rubocop.yml

@@ -43,9 +43,7 @@ Documentation:
   
 EmptyLines:
   Enabled: false
-  
-EmptyLinesAroundBody:
-  Enabled: false  
+
 
 Encoding:
   Enabled: false

data/CHANGELOG.md

@@ -1,3 +1,8 @@
+### 0.2.03 / 2015-02-06
+* [FIX] File `.rubocop.yml`: removal of setting for obsolete EmptyLinesAroundBody cop.
+* [CHANGE] Source code re-formatted to please Rubocop 0.29.
+* [CHANGE] File `README.md` added licensing badge (MIT license)
+
 ### 0.2.02 / 2015-02-02
 * [NEW] Examplar file `parsing_L1.rb`: demo using a (highly simplified) English grammar.
 * [NEW] Examplar file `parsing_amb.rb`: demo using an ambiguous grammar.

data/LICENSE.txt

@@ -1,4 +1,4 @@
-Copyright (c) 2014 Dimitri Geshef
+Copyright (c) 2014-2015 Dimitri Geshef
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

data/README.md

@@ -7,6 +7,7 @@ Rley
 [![Coverage Status](https://img.shields.io/coveralls/famished-tiger/Rley.svg)](https://coveralls.io/r/famished-tiger/Rley?branch=master)
 [![Gem Version](https://badge.fury.io/rb/rley.svg)](http://badge.fury.io/rb/rley)
 [![Dependency Status](https://gemnasium.com/famished-tiger/Rley.svg)](https://gemnasium.com/famished-tiger/Rley)
+[![License](https://img.shields.io/badge/license-MIT-brightgreen.svg?style=flat)](https://github.com/famished-tiger/Rley/blob/master/LICENSE.txt)
 
 __Rley__ is a Ruby implementation of an [Earley parser](http://en.wikipedia.org/wiki/Earley_parser).  
 The project aims to build a parser convenient for lightweight NLP (Natural Language Processing) purposes.  

data/examples/parsers/parsing_L1.rb

@@ -108,7 +108,8 @@ parser = Rley::Parser::EarleyParser.new(grammar_l1)
 
 ########################################
 # Step 3. Tokenize the input
-valid_input = 'I want the  flight from Alaska through Chicago to Houston'
+valid_input = 'I want the flight from Alaska through Chicago to Houston'
+
 # Another sentence: it is a flight from Chicago
 tokens = tokenizer(valid_input, grammar_l1)
 

data/lib/rley/constants.rb

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

data/lib/rley/parser/parse_tree_builder.rb

@@ -40,7 +40,7 @@ module Rley # This module is used as a namespace
       # (dot is at end of rhs)
       def use_complete_state(aCompleteState)
         prod = aCompleteState.dotted_rule.production
-        use_production(prod, { low: aCompleteState.origin })
+        use_production(prod, low: aCompleteState.origin)
       end
 
       # Given that the current node is a non-terminal

data/lib/rley/parser/parsing.rb

@@ -36,10 +36,7 @@ module Rley # This module is used as a namespace
         builder = tree_builder(state_tracker.state_set_index)
 
         loop do
-          # Retrieve the symbol on left of the dot
-          curr_symbol = state_tracker.symbol_on_left
-
-          # Place the symbol in the parse tree
+          # Place the symbol on left of the dot in the parse tree
           done = insert_matched_symbol(state_tracker, builder)
           break if done
         end

data/spec/rley/parser/earley_parser_spec.rb

@@ -444,7 +444,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
         end
 
         it 'should parse an ambiguous grammar (II)' do
-          self.extend(AmbiguousGrammarHelper)
+          extend(AmbiguousGrammarHelper)
           grammar = grammar_builder.grammar
           instance = EarleyParser.new(grammar)
           tokens = tokenize('abc + def + ghi', grammar)

data/spec/rley/parser/parse_tree_builder_spec.rb

@@ -35,7 +35,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
         parser.parse(tokens_abc)
       end
 
-      subject { ParseTreeBuilder.new(start_prod, { low: 0, high: 5 }) }
+      subject { ParseTreeBuilder.new(start_prod, low: 0, high: 5) }
 
       context 'Initialization:' do
         it 'should be created with a proposition and a range' do
@@ -172,7 +172,6 @@ SNIPPET
           expect(actual.root).to eq(subject.root)
         end
       end # context
-
     end # describe
   end # module
 end # module

data/spec/rley/parser/parsing_spec.rb

@@ -142,7 +142,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
         subject do
           parser = EarleyParser.new(b_expr_grammar)
           tokens = expr_tokenizer('2 + 3 * 4', b_expr_grammar)
-          instance = parser.parse(tokens)
+          parser.parse(tokens)
         end
 
         # Helper. Build a state tracker and a parse tree builder.
@@ -158,7 +158,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           (state_tracker, builder) = prepare_parse_tree(subject)
           # The root node should correspond to the start symbol and
           # its direct children should correspond to rhs of start production
-expected_text = <<-SNIPPET
+          expected_text = <<-SNIPPET
 P[0, 5]
 +- S[0, 5]
 SNIPPET
@@ -249,7 +249,8 @@ SNIPPET
           expected_state = 'T => integer . | 4'
           expect(state_tracker.parse_state.to_s).to eq(expected_state)
           expect(state_tracker.state_set_index).to eq(5)
-          expect(builder.current_node.to_string(0)).to eq("integer[4, 5]: '(nil)'")
+          integer_repr = "integer[4, 5]: '(nil)'"
+          expect(builder.current_node.to_string(0)).to eq(integer_repr)
 
           # Given current tree symbol is integer[4, 5]: '(nil)'
           # And its previous item is T => . integer | 4

data/spec/rley/ptree/non_terminal_node_spec.rb

@@ -12,12 +12,12 @@ module Rley # Open this namespace to avoid module qualifier prefixes
       def range(low, high)
         return TokenRange.new(low: low, high: high)
       end
-    
+
       let(:sample_symbol) do
         OpenStruct.new(name: 'VP')
       end
       let(:sample_range) { range(0, 3) }
-      
+
       subject { NonTerminalNode.new(sample_symbol, sample_range) }
 
       context 'Initialization:' do
@@ -25,7 +25,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           expect(subject.children).to be_empty
         end
       end # context
-      
+
       context 'Provided services:' do
         it 'should accept the addition of children' do
           child1 = double('first_child')
@@ -36,18 +36,23 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           subject.add_child(child3)
           expect(subject.children).to eq([child1, child2, child3])
         end
-        
+
         it 'should provide a text representation of itself' do
           # Case 1: no child
-          expected_text = "VP[0, 3]"
+          expected_text = 'VP[0, 3]'
           expect(subject.to_string(0)).to eq(expected_text)
-          
+
           # Case 2: with children
-          child_1_1 = TerminalNode.new(OpenStruct.new(name: 'Verb'), range(0, 1))
-          child_1_2 = NonTerminalNode.new(OpenStruct.new(name: 'NP'), range(1, 3))
-          child_2_1 = TerminalNode.new(OpenStruct.new(name: 'Determiner'), range(1, 2))
-          child_2_2 = NonTerminalNode.new(OpenStruct.new(name: 'Nominal'), range(2, 3))          
-          child_3_1 = TerminalNode.new(OpenStruct.new(name: 'Noun'), range(2, 3))
+          verb = OpenStruct.new(name: 'Verb')
+          child_1_1 = TerminalNode.new(verb, range(0, 1))
+          np = OpenStruct.new(name: 'NP')
+          child_1_2 = NonTerminalNode.new(np, range(1, 3))
+          det = OpenStruct.new(name: 'Determiner')
+          child_2_1 = TerminalNode.new(det, range(1, 2))
+          nominal = OpenStruct.new(name: 'Nominal')
+          child_2_2 = NonTerminalNode.new(nominal, range(2, 3))
+          noun = OpenStruct.new(name: 'Noun')
+          child_3_1 = TerminalNode.new(noun, range(2, 3))
           subject.add_child(child_1_1)
           subject.add_child(child_1_2)
           child_1_2.add_child(child_2_1)

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rley
 version: !ruby/object:Gem::Version
-  version: 0.2.02
+  version: 0.2.03
 platform: ruby
 authors:
 - Dimitri Geshef
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-02-02 00:00:00.000000000 Z
+date: 2015-02-06 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake