rley 0.2.09 → 0.2.10

checksums.yaml

@@ -1,15 +1,15 @@
 ---
 !binary "U0hBMQ==":
   metadata.gz: !binary |-
-    MTgzNDQzMWNlYTAwMWNiZjIxZjYxYzBiY2YyZjYyMDE2MjA4NjJkZg==
+    YTA0ZWM0OGY5NTM0ZGJhYTYyMDMyOGEyMjk4Mzc0NTMxOWZkZmMxYw==
   data.tar.gz: !binary |-
-    YTFjMDBmNWYzYmUwNjI4ZDNiNjczMjNhMTlhZjRjYzhlODUwMWM5Nw==
+    OGRhZDdiMzg5ZDA2YTA3YTZiZTBjYWYyOTFkOGJlNTVhNjk5YmVmZg==
 !binary "U0hBNTEy":
   metadata.gz: !binary |-
-    MjAwZjQ4YzdmMTMxOTAxY2IxMTQ0N2QzYzI0MWM1ZWIyOGJmNGZjMWE0YzVk
-    MTZlOGZmZWU2YzhiZmFhN2I5YzU5NGFkNDk0MTY2NjFmNzk4MzBhZWM5NjUz
-    NDgyODQxNTkzMWFkMGM2OTJhMDYyYWMxMjY1ZjQ0NjZlMjdhNTU=
+    NTA0MTBkNzU4ZDdkNmNmOTA5YjBmNTY3Njg4ZDVkZGU5MmMzNzFmZWVlY2Fm
+    YzUzZWI4MzU3NmZjYTBmYWQ0NjQzY2QxZjBlMTZlMGIxODY5ZDQ2NTM0ZDRk
+    NTdjODAxZjViZmU2MThiNDhkNDEzNGI3MjVkMDg3MDI3ZTIwNTU=
   data.tar.gz: !binary |-
-    ZmZlMGNlY2Q1M2E1MzkwMThlNmI0NTEwOTEzNTcxNzZjYWU2MGE0MDQ3ODUz
-    MjhjYjZjMjQxMGQzZjJkMTYwZDNhNWViMjhmZDk4ZGM1MjFkYjIxNTJkYjBm
-    MjZkMTE2YzdhYjg0NTRiMzhkZjMzOWVlY2VlMGFlMWU4ZDAxOGM=
+    NTFiZGZlZWI2NTU0ZjNmMzlhZjVmZTlkNmM3ZTFmZGFhYmNhYjcwNDQ5Zjdi
+    NGRlMjkwZGJjZjMzNDMxOGM3NTIyYTdjNmQzYjQyMGI3ZjdiMDdjMmE5MDkz
+    NzI5ZDRmZTQ1Zjg2YjFjYmVhMTJmNGYxZTViNTQzNTRlNjhiNjI=

data/.rubocop.yml

@@ -1,83 +1,87 @@
-AllCops:
-  Exclude:
-    - 'examples/**/*'
-    - 'features/**/*'
-    - 'gems/**/*'
-    - 'refs/**/*'
-
-AbcSize:
-  Max: 45
-  Enabled: true
-    
-    # This is disabled because some demos use UTF-8
-AsciiComments:
-  Enabled: false
-  
-BlockComments:
-  Enabled: false
-
-CaseIndentation:
-  IndentWhenRelativeTo: end
-  IndentOneStep: true
-
-# Rubocop enforces the use of is_a? instead of kind_of?
-# Which is contrary to modelling practice.
-ClassCheck:
-  Enabled: false
-  
-ClassLength:
-  Max: 250
-  CountComments: false  
-
-ConstantName:  
-  Enabled: false
-  
-CyclomaticComplexity:
-  Enabled: false
-  
-DefWithParentheses:  
-  Enabled: false
-  
-Documentation:
-  Enabled: false
-  
-EmptyLines:
-  Enabled: false
-
-
-Encoding:
-  Enabled: false
-
-FileName:
-  Enabled: false
-  
-IndentationWidth :
-  Enabled: false
-  
-  
-# Avoid methods longer than 50 lines of code
-MethodLength:
-  Max: 50
-  CountComments: false 
- 
-NonNilCheck:
-  Enabled: false
-
-NumericLiterals:
-  Enabled: false
-  
-RaiseArgs:
-  Enabled: false
-  
-RedundantReturn:
-  Enabled: false
-
-SpaceInsideBrackets:
-  Enabled: false
-
-TrailingWhitespace:
-  Enabled: false
-  
-VariableName:
-  Enabled: false
-  
+AllCops:
+  Exclude:
+    - 'examples/**/*'
+    - 'features/**/*'
+    - 'gems/**/*'
+    - 'lab/**/*'
+
+AbcSize:
+  Max: 35
+    
+# This is disabled because some demos use UTF-8
+AsciiComments:
+  Enabled: false
+  
+Attr:
+  Enabled: false
+  
+BlockComments:
+  Enabled: false
+  
+CaseIndentation:
+  IndentWhenRelativeTo: end
+  IndentOneStep: true
+
+# Rubocop enforces the use of is_a? instead of kind_of?
+# Which is contrary to modelling practice.
+ClassCheck:
+  Enabled: false
+  
+ClassLength:
+  Max: 250
+  CountComments: false  
+
+ConstantName:  
+  Enabled: false
+  
+CyclomaticComplexity:
+  Enabled: false
+  
+DefWithParentheses:  
+  Enabled: false
+  
+Documentation:
+  Enabled: false
+  
+EmptyLines:
+  Enabled: false 
+
+Encoding:
+  Enabled: false
+  
+IndentationWidth :
+  Enabled: false
+  
+  
+# Avoid methods longer than 50 lines of code
+MethodLength:
+  Max: 50
+  CountComments: false 
+ 
+# Avoid modules longer than 500 lines of code 
+ModuleLength:
+  Max: 500
+ 
+NonNilCheck:
+  Enabled: false
+
+NumericLiterals:
+  Enabled: false
+  
+PerceivedComplexity:
+  Max: 10
+  
+RaiseArgs:
+  Enabled: false
+  
+RedundantReturn:
+  Enabled: false
+
+SpaceInsideBrackets:
+  Enabled: false
+
+TrailingWhitespace:
+  Enabled: false
+  
+VariableName:
+  Enabled: false  

data/CHANGELOG.md

@@ -1,3 +1,7 @@
+### 0.2.10 / 2015-06-16
+* [CHANGE] Code re-formatted to please Rubocop 0.32.0
+* [FIX] File `.rubocop.yml`: disable some cop settings that were too loud.
+
 ### 0.2.08 / 2015-04-28
 * [NEW] Added folder with JSON demo parser under `examples\parsers\demo-JSON`.
 

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.09'
+  Version = '0.2.10'
 
   # Brief description of the gem.
   Description = "Ruby implementation of the Earley's parsing algorithm"

data/lib/rley/parse_tree_visitor.rb

@@ -1,17 +1,22 @@
 module Rley # This module is used as a namespace
-  # A visitor class dedicated in the visit of ParseTree objects.
+  # A visitor class dedicated in the visit of a parse tree.
+  # It combines the Visitor and Observer patterns.
   class ParseTreeVisitor
     # Link to the parse tree to visit
     attr_reader(:ptree)
 
     # List of objects that subscribed to the visit event notification.
     attr_reader(:subscribers)
+    
+    # Indicates the kind of tree traversal to perform: :post_order, :pre-order
+    attr_reader(:traversal)
 
     # Build a visitor for the given ptree.
     # @param aParseTree [ParseTree] the parse tree to visit.
-    def initialize(aParseTree)
+    def initialize(aParseTree, aTraversalStrategy = :post_order)
       @ptree = aParseTree
       @subscribers = []
+      @traversal = aTraversalStrategy
     end
 
     public
@@ -44,21 +49,15 @@ module Rley # This module is used as a namespace
 
     # Visit event. The visitor is about to visit the given non terminal node.
     # @param aNonTerminalNode [NonTerminalNode] the node to visit.
-    def start_visit_nonterminal(aNonTerminalNode)
-      broadcast(:before_non_terminal, aNonTerminalNode)
-    end
-
-    # Visit event. The visitor is about to visit the children of a non 
-    # terminal node.
-    # @param aParentNode [NonTeminalNode] the (non-terminal) parent node.
-    def visit_children(aParentNode)
-      children = aParentNode.children
-      broadcast(:before_children, aParentNode, children)
-      
-      # Let's proceed with the visit of children
-      children.each { |a_node| a_node.accept(self) }
-      
-      broadcast(:after_children, aParentNode, children)
+    def visit_nonterminal(aNonTerminalNode)
+      if @traversal == :post_order
+        broadcast(:before_non_terminal, aNonTerminalNode)
+        traverse_children(aNonTerminalNode)
+      else
+        traverse_children(aNonTerminalNode)  
+        broadcast(:before_non_terminal, aNonTerminalNode)
+      end
+      broadcast(:after_non_terminal, aNonTerminalNode)
     end
 
     # Visit event. The visitor is visiting the
@@ -84,6 +83,19 @@ module Rley # This module is used as a namespace
     end
 
     private
+    
+    # Visit event. The visitor is about to visit the children of a non 
+    # terminal node.
+    # @param aParentNode [NonTeminalNode] the (non-terminal) parent node.
+    def traverse_children(aParentNode)
+      children = aParentNode.children
+      broadcast(:before_children, aParentNode, children)
+      
+      # Let's proceed with the visit of children
+      children.each { |a_node| a_node.accept(self) }
+      
+      broadcast(:after_children, aParentNode, children)
+    end
 
     # Send a notification to all subscribers.
     # @param msg [Symbol] event to notify

data/lib/rley/parser/chart.rb

@@ -61,7 +61,7 @@ module Rley # This module is used as a namespace
             when :completion
                tracer.trace_completion(anIndex, new_state)
             else
-              raise NotImplementedError, "Unknown push_state mode #{aReason}"
+              fail NotImplementedError, "Unknown push_state mode #{aReason}"
           end
         end
       end

data/lib/rley/parser/earley_parser.rb

@@ -216,8 +216,8 @@ module Rley # This module is used as a namespace
         else
            err_msg << ": #{term_names[0]},"
         end
-        err_msg << " found a '#{aParsing.tokens[pos-1].terminal.name}' instead."
-        fail StandardError, err_msg
+        err_msg << " found a '#{aParsing.tokens[pos - 1].terminal.name}'"
+        fail StandardError, err_msg + ' instead.'
       end
     end # class
   end # module

data/lib/rley/parser/parse_state_tracker.rb

@@ -25,7 +25,7 @@ module Rley # This module is used as a namespace
 
       # Write accessor. Set the given parse state as the current one.
       def parse_state=(aParseState)
-        fail StandardError, "Nil parse state" if aParseState.nil?
+        fail StandardError, 'Nil parse state' if aParseState.nil?
         @parse_state = aParseState
         processed_states[parse_state] = true
       end

data/lib/rley/parser/parse_tracer.rb

@@ -34,9 +34,9 @@ module Rley # This module is used as a namespace
       def trace_scanning(aStatesetIndex, aParseState)
         return unless level
 
-        scan_picture = '[' + '-' * (col_width-1) + ']'
+        scan_picture = '[' + '-' * (col_width - 1) + ']'
         org = OpenStruct.new(origin: aStatesetIndex - 1, 
-          dotted_rule: aParseState.dotted_rule)
+                             dotted_rule: aParseState.dotted_rule)
         trace_diagram(aStatesetIndex, org, scan_picture)
       end
 
@@ -49,7 +49,8 @@ module Rley # This module is used as a namespace
       def trace_completion(aStatesetIndex, aParseState)
         return unless level
 
-        if aStatesetIndex == lexemes.size && aParseState.origin == 0 &&  aParseState.complete?
+        if aStatesetIndex == lexemes.size && aParseState.origin == 0 && 
+           aParseState.complete?
           picture = '=' * (col_width * lexemes.size - 1)
         else
           count = col_width * (aStatesetIndex - aParseState.origin) - 1
@@ -69,14 +70,14 @@ module Rley # This module is used as a namespace
       def emit_heading()
         longest = lexemes.map(&:length).max
         @col_width = longest + 3
-        headers = lexemes.map { |l| "#{l.center(col_width-1, ' ')}" }
+        headers = lexemes.map { |l| "#{l.center(col_width - 1, ' ')}" }
         print_if 1, '|.' + headers.join('.') + ".|\n"
       end
 
       def padding(aStatesetIndex, aParseState, aPicture)
-        l_pad_pattern = '.' + ' ' * (col_width-1)
+        l_pad_pattern = '.' + ' ' * (col_width - 1)
         left_padding =  l_pad_pattern * ([0, aParseState.origin].max)
-        r_pad_pattern = ' ' * (col_width-1) + '.'
+        r_pad_pattern = ' ' * (col_width - 1) + '.'
         right_padding = r_pad_pattern * (lexemes.size - aStatesetIndex)
         return left_padding + aPicture + right_padding
       end
@@ -97,4 +98,4 @@ module Rley # This module is used as a namespace
   end # module
 end # module
 
-# End of file
+# End of file

data/lib/rley/parser/parsing.rb

@@ -41,7 +41,8 @@ module Rley # This module is used as a namespace
         builder = tree_builder(state_tracker.state_set_index)
 
         loop do
-          match_symbol = state_tracker.symbol_on_left
+          state_tracker.symbol_on_left
+          # match_symbol = state_tracker.symbol_on_left
           # puts '--------------------'
           # puts "Active parse state: #{state_tracker.parse_state}"
           # puts "Matching symbol: #{match_symbol}"

data/lib/rley/parser/state_set.rb

@@ -60,8 +60,8 @@ module Rley # This module is used as a namespace
         return candidate
       end
       
-      # The list of distinct expected terminal symbols. An expected symbol is on the
-      # left of a dot in a parse state of the parse set.
+      # The list of distinct expected terminal symbols. An expected symbol
+      # is on the left of a dot in a parse state of the parse set.
       def expected_terminals()
         expecting_terminals = states.select do |s| 
           s.dotted_rule.next_symbol.kind_of?(Rley::Syntax::Terminal) 

data/lib/rley/ptree/non_terminal_node.rb

@@ -32,9 +32,7 @@ module Rley # This module is used as a namespace
       # Part of the 'visitee' role in Visitor design pattern.
       # @param aVisitor[ParseTreeVisitor] the visitor
       def accept(aVisitor)
-        aVisitor.start_visit_nonterminal(self)
-        aVisitor.visit_children(self)
-        aVisitor.end_visit_nonterminal(self)
+        aVisitor.visit_nonterminal(self)
       end
     end # class
   end # module

data/lib/rley/ptree/parse_tree.rb

@@ -3,6 +3,14 @@ require_relative 'non_terminal_node'
 
 module Rley # This module is used as a namespace
   module PTree # This module is used as a namespace
+    # A parse tree (a.k.a. concrete syntax tree) is a tree-based representation
+    # for the parse that corresponds to the input text. In a parse tree, 
+    # a node corresponds to a grammar symbol used during the parsing:
+    # - a leaf node maps to a terminal symbol occurring in
+    # the input, and
+    # - a intermediate node maps to a non-terminal node reduced
+    # during the parse. 
+    # The root node corresponds to the main/start symbol of the grammar.
     class ParseTree
       # The root node of the tree
       attr_reader(:root)

data/spec/rley/parse_tree_visitor_spec.rb

@@ -128,7 +128,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
       it 'should react to the start_visit_nonterminal message' do
         # Notify subscribers when start the visit of a non-terminal node
         expect(listener1).to receive(:before_non_terminal).with(nterm_node)
-        subject.start_visit_nonterminal(nterm_node)
+        subject.visit_nonterminal(nterm_node)
       end
 
       it 'should react to the visit_children message' do
@@ -139,7 +139,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
         expect(listener1).to receive(:before_terminal).with(children[0])
         expect(listener1).to receive(:after_terminal).with(children[0])
         expect(listener1).to receive(:after_children).with(nterm_node, children)
-        subject.visit_children(nterm_node)
+        subject.send(:traverse_children, nterm_node)
       end
 
       it 'should react to the end_visit_nonterminal message' do

data/spec/rley/parser/chart_spec.rb

@@ -21,8 +21,8 @@ module Rley # Open this namespace to avoid module qualifier prefixes
       let(:output) { StringIO.new('', 'w') }
 
       let(:token_seq) do
-        literals = ['I', 'saw', 'John', 'with', 'a', 'dog']
-        literals.map {|lexeme| Token.new(lexeme, nil)}
+        literals = %w(I saw John with a dog)
+        literals.map { |lexeme| Token.new(lexeme, nil) }
       end
 
       let(:sample_tracer) { ParseTracer.new(0, output, token_seq) }
@@ -32,7 +32,8 @@ module Rley # Open this namespace to avoid module qualifier prefixes
         subject { Chart.new(dotted_rule, count_token, sample_tracer) }
 
         it 'should be created with start dotted rule, token count, tracer' do
-          expect { Chart.new(dotted_rule, count_token, sample_tracer) }.not_to raise_error
+          expect { Chart.new(dotted_rule, count_token, sample_tracer) }
+            .not_to raise_error
         end
 
         it 'should have a seed state in first state_set' do
@@ -91,7 +92,6 @@ module Rley # Open this namespace to avoid module qualifier prefixes
 |>      .      .      .      .      .      .| [0:0] sentence => A B . C
 SNIPPET
           expect(output.string).to eq(expectation)
-
         end
 
         it 'should trace parse state pushing' do

data/spec/rley/parser/earley_parser_spec.rb

@@ -233,7 +233,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           $stdout = StringIO.new('', 'w')
           
           trace_level = 1
-          parse_result = subject.parse(grm1_tokens, trace_level)
+          subject.parse(grm1_tokens, trace_level)
           expectations = <<-SNIPPET
 ['a', 'a', 'b', 'c', 'c']
 |. a . a . b . c . c .|
@@ -562,7 +562,8 @@ Syntax error at or near token 3>>>c<<<:
 Expected one of: ['a', 'b'], found a 'c' instead.
 MSG
           err = StandardError
-          expect { subject.parse(wrong)}.to raise_error(err, err_msg.chomp)
+          expect { subject.parse(wrong) }
+            .to raise_error(err, err_msg.chomp)
 =begin
           expect(parse_result.success?).to eq(false)
 

data/spec/rley/parser/parse_tracer_spec.rb

@@ -17,20 +17,19 @@ module Rley # Open this namespace to avoid module qualifier prefixes
       let(:output) { StringIO.new('', 'w') }
 
       let(:token_seq) do
-        literals = ['I', 'saw', 'John', 'with', 'a', 'dog']
-        literals.map {|lexeme| Token.new(lexeme, nil)}
+        literals = %w(I saw John with a dog)
+        literals.map { |lexeme| Token.new(lexeme, nil) }
       end
-      
-      subject { ParseTracer.new(1, output, token_seq) } 
+
+      subject { ParseTracer.new(1, output, token_seq) }
 
       context 'Creation & initialization:' do
         it 'should accept trace level 0' do
           expect { ParseTracer.new(0, output, token_seq) }.not_to raise_error
           expect(output.string).to eq('')
         end
-        
-# |.  I   . saw  . John . with .  a   . dog  .|
-        
+
+
         it 'should accept trace level 1' do
           expect { ParseTracer.new(1, output, token_seq) }.not_to raise_error
           expectations = <<-SNIPPET
@@ -39,7 +38,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
 SNIPPET
           expect(output.string).to eq(expectations)
         end
-        
+
         it 'should accept trace level 2' do
           expect { ParseTracer.new(2, output, token_seq) }.not_to raise_error
           expectations = <<-SNIPPET
@@ -48,16 +47,16 @@ SNIPPET
 SNIPPET
           expect(output.string).to eq(expectations)
         end
-        
+
         it 'should know the trace level' do
           expect(subject.level).to eq(1)
         end
-        
+
         it 'should know the output stream' do
           expect(subject.ostream).to eq(output)
-        end       
+        end
       end # context
-      
+
       context 'Provided services:' do
         let(:t_a) { Syntax::Terminal.new('A') }
         let(:t_b) { Syntax::Terminal.new('B') }
@@ -72,7 +71,7 @@ SNIPPET
         let(:dotted_rule) { DottedItem.new(sample_prod, 2) }
         let(:complete_rule) { DottedItem.new(sample_prod, 3) }
         let(:sample_parse_state) { ParseState.new(dotted_rule, origin_val) }
-        
+
         # Factory method.
         def parse_state(origin, aDottedRule)
           ParseState.new(aDottedRule, origin)
@@ -85,6 +84,7 @@ SNIPPET
           expectations = <<-SNIPPET
 |[------]      .      .      .      .      .| [0:1] sentence => A B . C
 SNIPPET
+          expect(output.string).to eq(expectations)
 
           # Case: token in the middle
           subject.ostream.string = ''
@@ -92,13 +92,15 @@ SNIPPET
           expectations = <<-SNIPPET
 |.      .      .      [------]      .      .| [3:4] sentence => A B . C
 SNIPPET
-          
+          expect(output.string).to eq(expectations)
+
           # Case: token at the end
           subject.ostream.string = ''
           subject.trace_scanning(6, parse_state(5, dotted_rule))
           expectations = <<-SNIPPET
 |.      .      .      .      .      [------]| [5:6] sentence => A B . C
 SNIPPET
+          expect(output.string).to eq(expectations)
         end
 
 
@@ -109,8 +111,8 @@ SNIPPET
           expectations = <<-SNIPPET
 |>      .      .      .      .      .      .| [0:0] sentence => A B . C
 SNIPPET
-          expect(output.string).to eq(expectations)  
-          
+          expect(output.string).to eq(expectations)
+
           # Case: stateset in the middle
           subject.ostream.string = ''
           subject.trace_prediction(3, sample_parse_state)
@@ -118,7 +120,7 @@ SNIPPET
 |.      .      .      >      .      .      .| [3:3] sentence => A B . C
 SNIPPET
           expect(output.string).to eq(expectations)
-          
+
           # Case: final stateset
           subject.ostream.string = ''
           subject.trace_prediction(6, parse_state(6, dotted_rule))
@@ -136,7 +138,7 @@ SNIPPET
 |[=========================================]| [0:6] sentence => A B C .
 SNIPPET
           expect(output.string).to eq(expectations)
-          
+
           # Case: step at the start (complete)
           subject.ostream.string = ''
           subject.trace_completion(1, parse_state(0, complete_rule))
@@ -144,7 +146,7 @@ SNIPPET
 |[------]      .      .      .      .      .| [0:1] sentence => A B C .
 SNIPPET
           expect(output.string).to eq(expectations)
-          
+
           # Case: step at the start (not complete)
           subject.ostream.string = ''
           subject.trace_completion(1, parse_state(0, dotted_rule))
@@ -152,7 +154,7 @@ SNIPPET
 |[------>      .      .      .      .      .| [0:1] sentence => A B . C
 SNIPPET
           expect(output.string).to eq(expectations)
-          
+
           # Case: step at the middle (complete)
           subject.ostream.string = ''
           subject.trace_completion(4, parse_state(2, complete_rule))
@@ -160,7 +162,7 @@ SNIPPET
 |.      .      [-------------]      .      .| [2:4] sentence => A B C .
 SNIPPET
           expect(output.string).to eq(expectations)
-          
+
           # Case: step at the middle (not complete)
           subject.ostream.string = ''
           subject.trace_completion(4, parse_state(2, dotted_rule))
@@ -168,7 +170,7 @@ SNIPPET
 |.      .      [------------->      .      .| [2:4] sentence => A B . C
 SNIPPET
           expect(output.string).to eq(expectations)
-          
+
           # Case: step at the end (complete)
           subject.ostream.string = ''
           subject.trace_completion(6, parse_state(3, complete_rule))
@@ -176,7 +178,7 @@ SNIPPET
 |.      .      .      [--------------------]| [3:6] sentence => A B C .
 SNIPPET
           expect(output.string).to eq(expectations)
-          
+
           # Case: step at the end (not complete)
           subject.ostream.string = ''
           subject.trace_completion(6, parse_state(3, dotted_rule))
@@ -190,4 +192,4 @@ SNIPPET
   end # module
 end # module
 
-# End of file
+# End of file

data/spec/rley/parser/parsing_spec.rb

@@ -74,7 +74,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
         
         it 'should emit trace level 1 info' do
           tracer = ParseTracer.new(1, output, grm1_tokens)
-          instance = Parsing.new(start_dotted_rule, grm1_tokens, tracer)
+          Parsing.new(start_dotted_rule, grm1_tokens, tracer)
           expectations = <<-SNIPPET
 ['a', 'a', 'b', 'c', 'c']
 |. a . a . b . c . c .|
@@ -101,7 +101,8 @@ SNIPPET
         it 'should complain when trying to push a nil dotted item' do
           err = StandardError
           msg = 'Dotted item may not be nil'
-          expect{ subject.push_state(nil, 1, 1, :prediction) }.to raise_error(err, msg)
+          expect { subject.push_state(nil, 1, 1, :prediction) }
+            .to raise_error(err, msg)
         end
 
 

metadata

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