sequitur 0.1.17 → 0.1.18

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: a6ec2920b6ec19a8bc8cf2c023d75328c71d1914
-  data.tar.gz: 245c57bf0675a138fd8f29fd7b429b39ac3eb76d
+  metadata.gz: aab8594b29205b00f9ea39da791ea0fbae413934
+  data.tar.gz: 936518eec769379e776b2b034c52bd450872994d
 SHA512:
-  metadata.gz: 685428b125c4126f24c5d893d23d978394a55ad3ab96e29e7dd3a522e788e0c024cd820e4aedd80f5c2a624d03a89a2aaa625ca3d0cc0d54419942321f8fb512
-  data.tar.gz: c2e38f4a59591648794ce2ebc2769204b033e35c4f03a4cd46ee241eb754104d140c0030388f4edb62e82350816edd0c405f62e1487c38f40409f666fe47a5e0
+  metadata.gz: 95470830db25990b9988ec6c45766182d91537913c2a92ca037f47b62421a09f40ba9fb8b3b447287e163669befe77229853e918633c83f1a7ad444246365b61
+  data.tar.gz: bf018a2bd8a38e00eb352c0d6226bb37c4fc7228724c3e47e2954714a911b6af7dc98ae15218f17c9ae18637d1813edae4e92e756de79b26157e183d5a54696f

data/.rubocop.yml

@@ -1,79 +1,82 @@
-AllCops:
-  Exclude:
-    - 'examples/**/*'
-    - 'features/**/*'
-    - 'gems/**/*'
-    - 'lab/**/*'
-
-AbcSize:
-  Max: 20
-    
-# This is disabled because some demos use UTF-8
-AsciiComments:
-  Enabled: false
-  
-Attr:
-  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 400 lines of code 
-ModuleLength:
-  Max: 400
- 
-NonNilCheck:
-  Enabled: false
-
-NumericLiterals:
-  Enabled: false
-  
-RaiseArgs:
-  Enabled: false
-  
-RedundantReturn:
-  Enabled: false
-
-SpaceInsideBrackets:
-  Enabled: false
-
-TrailingWhitespace:
-  Enabled: false
-  
+AllCops:
+  Exclude:
+    - 'examples/**/*'
+    - 'features/**/*'
+    - 'gems/**/*'
+    - 'lab/**/*'
+
+AbcSize:
+  Max: 20
+    
+# This is disabled because some demos use UTF-8
+AsciiComments:
+  Enabled: false
+  
+Attr:
+  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 400 lines of code 
+ModuleLength:
+  Max: 400
+ 
+NonNilCheck:
+  Enabled: false
+
+NumericLiterals:
+  Enabled: false
+  
+RaiseArgs:
+  Enabled: false
+  
+RedundantReturn:
+  Enabled: false
+
+SpaceInsideBrackets:
+  Enabled: false
+
+TrailingWhitespace:
+  Enabled: false
+  
+VariableName:
+  Enabled: false
+  

data/.travis.yml

@@ -1,18 +1,21 @@
 language: ruby
 rvm:
-  - 1.9.3
-  - 2.0.0
-  - 2.1.0
-  - 2.2.0
-  - jruby-head
-  - jruby-9.0.1.0
+  - ruby-head
+  - jruby-head  
+  - 2.3.3
+  - 2.2.6
+  - 2.1.9
+  - 2.0.0  
+  - jruby    
 
-gemfile:
-  - Gemfile
-  
 matrix:
   allow_failures:
+    - rvm: jruby  
+    - rvm: ruby-head
     - rvm: jruby-head
+
+gemfile:
+  - Gemfile
   
 # whitelist
 branches:  

data/CHANGELOG.md

@@ -1,3 +1,13 @@
+### 0.1.18 / 2016-12-21
+* [NEW] Added AppVeyor CI to Github commits. AppVeyor allows to build and test commits on Windows servers.
+This is complementary to Travis CI which does Linux builds.
+* [NEW] File `appveyor.yml` Contains the AppVeyor configuration.
+* [CHANGE] File `README.md` Added AppVeyor badge.
+* [CHANGE] File `.travis.yml`: updated Ruby versions to test for. Added MRI 2.3.x, dropped MRI 1.9.3
+* [CHANGE] File 'sequitur.gemspec' Lowest supported Ruby version is now 2.0.0.
+* [CHANGE] Many files. Code re-styling in order to please Rubocop 0.46.0
+
+
 ### 0.1.17 / 2015-09-05
 * [CHANGE] File `.travis.yml`: Added versions MRI 2.2.0, JRuby 9.0.1.0
 

data/Gemfile

@@ -3,9 +3,8 @@ source 'https://rubygems.org'
 
 
 group :development do
-  gem 'rake', '>= 10.0.0' 
-  gem 'rspec', '>= 2.1.0'
-  gem 'simplecov', '>= 0.8.0'
   gem 'coveralls', '>= 0.7.0'
+  gem 'rake', '>= 10.0.0'  
+  gem 'rspec', '>= 2.1.0'  
+  gem 'simplecov', '>= 0.8.0'
 end
-

data/LICENSE.txt

@@ -1,4 +1,4 @@
-Copyright (c) 2014-2015 Dimitri Geshef
+Copyright (c) 2014-2017 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

@@ -3,7 +3,8 @@ Sequitur
 _Ruby gem implementing the Sequitur algorithm_  
 [Homepage](https://github.com/famished-tiger/Sequitur)  
 
-[![Build Status](https://travis-ci.org/famished-tiger/Sequitur.svg?branch=master)](https://travis-ci.org/famished-tiger/Sequitur)
+[![Linux Build Status](https://travis-ci.org/famished-tiger/Sequitur.svg?branch=master)](https://travis-ci.org/famished-tiger/Sequitur)
+[![Windows Build status](https://ci.appveyor.com/api/projects/status/nvi1be8mb0494dqw?svg=true)](https://ci.appveyor.com/project/famished-tiger/sequitur)
 [![Coverage Status](https://coveralls.io/repos/famished-tiger/Sequitur/badge.png?branch=master)](https://coveralls.io/r/famished-tiger/Sequitur)
 [![Gem Version](https://badge.fury.io/rb/sequitur.svg)](http://badge.fury.io/rb/sequitur)
 [![Dependency Status](https://gemnasium.com/famished-tiger/Sequitur.png)](https://gemnasium.com/famished-tiger/Sequitur)
@@ -24,8 +25,8 @@ The following are good entry points to learn about the algorithm:
 * Algorithm works with different input token types (no limited to single character)
 
 ### The theory in a nutshell ###
-Given a sequence of input tokens (say, characters), the Sequitur algorithm 
-will represent that input sequence as a set of rules. As the algorithm detects 
+Given a sequence of input tokens (say, characters), the Sequitur algorithm
+will represent that input sequence as a set of rules. As the algorithm detects
 automatically repeated token patterns, the resulting rule set can encode repetitions in the input
 in a very compact way.  
 Of interest is the fact that the algorithm runs in time linear in the length of the input sequence.
@@ -46,7 +47,7 @@ is three time the pattern encoded by the rule called P1.
 -The second rule (named P1) represents the sequence a b c.  
 
 **Can you give another example?**  
-Yep. Assume this time that the input is *'ababcabcdabcde'*. 
+Yep. Assume this time that the input is *'ababcabcdabcde'*.
 Then Sequitur algorithm will generate the rule set:  
 ```
 start : P1 P2 P3 P3 e.  
@@ -73,7 +74,7 @@ repeated elements)
 
 **Time for a quick demo**
 
-The following Ruby snippet show how to apply Sequitur on the input string from the last example above. 
+The following Ruby snippet show how to apply Sequitur on the input string from the last example above.
 
 ```ruby  
 
@@ -91,7 +92,7 @@ can you make good use of the algorithm's result.
 **Printing the resulting rules**  
 The very first natural step is to be able to print out the (grammar) rules.
 Here's how:
- 
+
 
 ```ruby  
     require 'sequitur'
@@ -104,9 +105,9 @@ Here's how:
 
     # Now render the rules. Each rule is displayed with the format:
     # rule_id : a_sequence_grammar_symbols.
-    # Where: 
+    # Where:
     # - rule_id is either 'start' or a name like 'Pxxxx' (xxxx is a sequential number)
-    # - a grammar symbol is either a terminal symbol 
+    # - a grammar symbol is either a terminal symbol
     # (i.e. a character from the input) or a rule id
     formatter.render(grammar.visitor)
 
@@ -121,7 +122,7 @@ Here's how:
 The Sequitur algorithm generates a -simplified- context-free grammar, therefore we dedicate this section
 to the terminology about context-free grammars. As the Internet provides tons of information can be found
 on the subject, we limit ourselves to the minimal terminology of interest when using the sequitur gem.
- 
+
 First of all, what is a **grammar**? To simplify the matter, one can see a grammar as a set of
 grammar rules. These rules are called production rules or more briefly **productions**.  
 
@@ -133,12 +134,12 @@ P : body.
 Where:
 - The colon ':' character separates the head (= left-hand side) and the body (right-hand side, *rhs* in short)
 of the rule.
-- The left-hand side consists just of one symbol, P. P is a categorized as a *nonterminal symbol* and for our purposes 
-a nonterminal symbol can be seen as the "name" of the production. By contrast, a terminal symbol is just one element 
-from the input sequence (symbols as defined in formal grammar theory shouldn't be confused with Ruby's `Symbol` class). 
-- the body is a sequence -possibly empty- of *symbols* (terminal or nonterminal). 
+- The left-hand side consists just of one symbol, P. P is a categorized as a *nonterminal symbol* and for our purposes
+a nonterminal symbol can be seen as the "name" of the production. By contrast, a terminal symbol is just one element
+from the input sequence (symbols as defined in formal grammar theory shouldn't be confused with Ruby's `Symbol` class).
+- the body is a sequence -possibly empty- of *symbols* (terminal or nonterminal).
 
-Basically, a production rule tells that P is equivalent to the sequence of symbols found in the 
+Basically, a production rule tells that P is equivalent to the sequence of symbols found in the
 right-hand side of the production. A nonterminal symbol that appears in the rhs of a production can be
 seen as a reference to the production with same name.
 
@@ -166,7 +167,7 @@ that returns the productions of the grammar as an array of `Sequitur::Production
 
 	# Retrieve all productions of the grammar
 	all_prods = grammar.productions
-	
+
 	# Retrieve the start production
 	start_prod = grammar.production[0]
 ```
@@ -193,7 +194,7 @@ A ProductionRef is reference to a Production object. The latter one can be acces
 ### Installation ###
 The sequitur gem installation is fairly standard.  
 If your project has a `Gemfile` file, add `sequitur` to it. Otherwise, install the gem like this:
- 
+
 ```bash  
 $[sudo] gem install sequitur
 ```
@@ -201,11 +202,11 @@ $[sudo] gem install sequitur
 
 
 ### Good to know ###
-The above examples might give the impression that the input stream must consist of single 
+The above examples might give the impression that the input stream must consist of single
 character tokens. This is simply not true.  
 This implementation is flexible enough to cope with other kinds of input values.  
 The next example shows how integer values can be correctly processed by Sequitur.  
-Assume that the input is the array of Fixnums *[1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5]*. 
+Assume that the input is the array of Fixnums *[1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5]*.
 
 ```ruby
 require 'sequitur'  # Load the Sequitur library
@@ -247,4 +248,4 @@ More examples are available in the examples folder.
 
 Copyright
 ---------
-Copyright (c) 2014, Dimitri Geshef. Sequitur is released under the MIT License see [LICENSE.txt](https://github.com/famished-tiger/Sequitur/blob/master/LICENSE.txt) for details.
+Copyright (c) 2014-2017, Dimitri Geshef. Sequitur is released under the MIT License see [LICENSE.txt](https://github.com/famished-tiger/Sequitur/blob/master/LICENSE.txt) for details.

data/appveyor.yml

@@ -0,0 +1,20 @@
+version: '{build}'
+max_jobs: 3
+environment:
+  matrix:
+  - Ruby_version: 200
+  - Ruby_version: 200-x64
+  - Ruby_version: 21
+  - Ruby_version: 21-x64
+  - Ruby_version: 22
+  - Ruby_version: 22-x64
+  - Ruby_version: 23
+  - Ruby_version: 23-x64
+install:
+- cmd: >-
+    SET PATH=C:\Ruby%Ruby_version%\bin;%PATH%
+
+    bundle install --retry=3 --clean
+build: off
+test_script:
+- cmd: bundle exec rake

data/lib/sequitur.rb

@@ -17,10 +17,10 @@ module Sequitur
   # @return [SequiturGrammar] a grammar that encodes the input.
   def self.build_from(tokens)
     input_sequence = case tokens
-      when String then tokens.chars
-      when Enumerator then tokens
-      else tokens.to_enum
-    end
+                       when String then tokens.chars
+                       when Enumerator then tokens
+                       else tokens.to_enum
+                     end
 
     return SequiturGrammar.new(input_sequence)
   end

data/lib/sequitur/constants.rb

@@ -3,10 +3,10 @@
 
 module Sequitur # Module used as a namespace
   # The version number of the gem.
-  Version = '0.1.17'
+  Version = '0.1.18'.freeze
 
   # Brief description of the gem.
-  Description = 'Ruby implementation of the Sequitur algorithm'
+  Description = 'Ruby implementation of the Sequitur algorithm'.freeze
 
   # Constant Sequitur::RootDir contains the absolute path of Sequitur's
   # start directory. Note: it also ends with a slash character.

data/lib/sequitur/dynamic_grammar.rb

@@ -29,8 +29,6 @@ class DynamicGrammar
     @trace = false
   end
 
-  public
-
   # Emit a text representation of the grammar.
   # Each production rule is emitted per line.
   # @return [String]

data/lib/sequitur/formatter/base_formatter.rb

@@ -13,17 +13,15 @@ module Sequitur
         @output = anIO
       end
 
-      public
-
       # Given a grammar or a grammar visitor, perform the visit
       # and render the visit events in the output stream.
       # @param aGrmOrVisitor [DynamicGrammar or GrammarVisitor]
       def render(aGrmOrVisitor)
-        if aGrmOrVisitor.kind_of?(GrammarVisitor)
-          a_visitor = aGrmOrVisitor
-        else
-          a_visitor = aGrmOrVisitor.visitor
-        end
+        a_visitor = if aGrmOrVisitor.kind_of?(GrammarVisitor)
+                      aGrmOrVisitor
+                    else
+                      aGrmOrVisitor.visitor
+                    end
 
         a_visitor.subscribe(self)
         a_visitor.start

data/lib/sequitur/formatter/base_text.rb

@@ -18,8 +18,6 @@ module Sequitur
         @prod_lookup = {}
       end
 
-      public
-
       # Method called by a GrammarVisitor to which the formatter subscribed.
       # Notification of a visit event: the visitor is about to visit a grammar
       # @param aGrammar [DynamicGrammar-like object]
@@ -82,7 +80,7 @@ module Sequitur
       # @param aProduction [Production]
       def prod_name(aProduction)
         prod_index = prod_lookup[aProduction]
-        name = (prod_index == 0) ? 'start' : "P#{prod_index}"
+        name = prod_index.zero? ? 'start' : "P#{prod_index}"
         return name
       end
     end # class

data/lib/sequitur/formatter/debug.rb

@@ -23,8 +23,6 @@ module Sequitur
         @indentation = 0
       end
 
-      public
-
       # Method called by a GrammarVisitor to which the formatter subscribed.
       # Notification of a visit event: the visitor is about to visit a grammar
       # @param _ [DynamicGrammar-like object]

data/lib/sequitur/grammar_visitor.rb

@@ -14,8 +14,6 @@ class GrammarVisitor
     @subscribers = []
   end
 
-  public
-
   # Add a subscriber for the visit event notification.
   # @param aSubscriber [Object]
   def subscribe(aSubscriber)

data/lib/sequitur/production.rb

@@ -29,19 +29,17 @@ class Production
     @digrams = []
   end
 
-  public
-
   # Identity testing.
   # @param other [] another production or production reference.
   # @return true when the receiver and other are the same.
   def ==(other)
     return true if object_id == other.object_id
 
-    if other.is_a?(ProductionRef)
-      result = (other == self)
-    else
-      result = false
-    end
+    result = if other.is_a?(ProductionRef)
+               (other == self)
+             else
+               false
+             end
 
     return result
   end
@@ -60,7 +58,7 @@ class Production
 
   # Decrement the reference count by one.
   def decr_refcount()
-    fail StandardError, 'Internal error' if @refcount == 0
+    raise StandardError, 'Internal error' if @refcount.zero?
     @refcount -= 1
   end
 
@@ -139,7 +137,7 @@ class Production
         if aSymbol.unbound?
           msg = 'Fail to append reference to nil production in '
           msg << to_string
-          fail StandardError, msg
+          raise StandardError, msg
         end
         new_symb = aSymbol.dup
       else

data/lib/sequitur/production_ref.rb

@@ -42,10 +42,10 @@ class ProductionRef
   # Emit the text representation of a production reference.
   # @return [String]
   def to_s()
-    return "#{production.object_id}"
+    return production.object_id.to_s
   end
 
-  alias_method :to_string, :to_s
+  alias to_string to_s
 
 
   # Equality testing.
@@ -57,11 +57,11 @@ class ProductionRef
   def ==(other)
     return true if object_id == other.object_id
 
-    if other.is_a?(ProductionRef)
-      result = (production == other.production)
-    else
-      result = (production == other)
-    end
+    result = if other.is_a?(ProductionRef)
+               (production == other.production)
+             else
+               (production == other)
+             end
 
     return result
   end
@@ -72,7 +72,7 @@ class ProductionRef
   #   referenced production
   # @return [Fixnum] the hash value
   def hash()
-    fail StandardError, 'Nil production' if production.nil?
+    raise StandardError, 'Nil production' if production.nil?
     return production.hash
   end
 
@@ -84,7 +84,7 @@ class ProductionRef
 
     production.decr_refcount if production
     unless aProduction.kind_of?(Production)
-      fail StandardError, "Illegal production type #{aProduction.class}"
+      raise StandardError, "Illegal production type #{aProduction.class}"
     end
     @production = aProduction
     production.incr_refcount

data/lib/sequitur/sequitur_grammar.rb

@@ -71,8 +71,8 @@ class SequiturGrammar < DynamicGrammar
         if found_so_far.include? its_key
           orig_digr = found_so_far[its_key]
           # Disregard sequence like a a a
-          if ((orig_digr.production == a_prod) && a_digr.repeating? &&
-            (orig_digr == a_digr))
+          if (orig_digr.production == a_prod) && a_digr.repeating? &&
+             (orig_digr == a_digr)
             next
           end
 
@@ -111,7 +111,7 @@ class SequiturGrammar < DynamicGrammar
   # Return a production that is used less than twice in the grammar.
   def detect_useless_production()
     useless = productions.index { |prod| prod.refcount < 2 }
-    useless = nil if useless && useless == 0
+    useless = nil if useless && useless.zero?
 
     return useless
   end

data/lib/sequitur/symbol_sequence.rb

@@ -20,8 +20,6 @@ module Sequitur # Module for classes implementing the Sequitur algorithm
       invalidate_refs
     end
 
-    public
-
     # Clear the symbol sequence.
     def clear()
       refs = references
@@ -66,14 +64,14 @@ module Sequitur # Module for classes implementing the Sequitur algorithm
     def ==(other)
       return true if object_id == other.object_id
 
-      case other
-        when SymbolSequence
-          same = symbols == other.symbols
-        when Array
-          same = symbols == other
-        else
-          same = false
-      end
+      same = case other
+               when SymbolSequence
+                 symbols == other.symbols
+               when Array
+                 symbols == other
+               else
+                 false
+             end
 
       return same
     end

data/spec/sequitur/digram_spec.rb

@@ -1,48 +1,48 @@
-require_relative '../spec_helper'
-
-# Load the class under test
-require_relative '../../lib/sequitur/digram'
-
-module Sequitur # Re-open the module to get rid of qualified names
-describe Digram do
-  let(:two_symbols) { [:b, :c] }
-  let(:production) { double('sample-production') }
-
-  context 'Standard creation & initialization:' do
-    it 'should be created with 3 arguments' do
-      instance = Digram.new(:b, :c, production)
-      
-      expect(instance.symbols).to eq(two_symbols)
-      expect(instance.production).to eq(production)
-    end
-    
-    it 'should return the production that it refers to' do
-      instance = Digram.new(:b, :c, production)
-      expect(instance.production).to eq(production)
-    end
-    
-    it 'should whether its symbols are the same' do
-       instance1 = Digram.new(:a, :a, production)
-       expect(instance1).to be_repeating
-       
-       instance1 = Digram.new(:a, :b, production)
-       expect(instance1).not_to be_repeating       
-    end
-  end # context
-
-  context 'Provided services:' do
-    it 'should compare itself to another digram' do
-      instance1 = Digram.new(:a, :b, production)
-      same = Digram.new(:a, :b, production)
-      different = Digram.new(:b, :c, production)
-      
-      expect(instance1).to eq(instance1)
-      expect(instance1).to eq(same)
-      expect(instance1).not_to eq(different)
-      expect(same).not_to eq(different)       
-    end
-  end # context
-end # describe
-end # module
-
-# End of file
+require_relative '../spec_helper'
+
+# Load the class under test
+require_relative '../../lib/sequitur/digram'
+
+module Sequitur # Re-open the module to get rid of qualified names
+describe Digram do
+  let(:two_symbols) { [:b, :c] }
+  let(:production) { double('sample-production') }
+
+  context 'Standard creation & initialization:' do
+    it 'should be created with 3 arguments' do
+      instance = Digram.new(:b, :c, production)
+      
+      expect(instance.symbols).to eq(two_symbols)
+      expect(instance.production).to eq(production)
+    end
+    
+    it 'should return the production that it refers to' do
+      instance = Digram.new(:b, :c, production)
+      expect(instance.production).to eq(production)
+    end
+    
+    it 'should whether its symbols are the same' do
+       instance1 = Digram.new(:a, :a, production)
+       expect(instance1).to be_repeating
+       
+       instance1 = Digram.new(:a, :b, production)
+       expect(instance1).not_to be_repeating       
+    end
+  end # context
+
+  context 'Provided services:' do
+    it 'should compare itself to another digram' do
+      instance1 = Digram.new(:a, :b, production)
+      same = Digram.new(:a, :b, production)
+      different = Digram.new(:b, :c, production)
+      
+      expect(instance1).to eq(instance1)
+      expect(instance1).to eq(same)
+      expect(instance1).not_to eq(different)
+      expect(same).not_to eq(different)       
+    end
+  end # context
+end # describe
+end # module
+
+# End of file

data/spec/sequitur/production_spec.rb

@@ -202,7 +202,7 @@ describe Production do
 
     it 'should detect any repetition pattern' do
       # Positive cases
-      cases = %w(abab abcdab abcdcd abcdefcd )
+      cases = %w(abab abcdab abcdcd abcdefcd)
       cases.each do |word|
         instance = Production.new
         word.each_char { |symb| instance.append_symbol(symb) }

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: sequitur
 version: !ruby/object:Gem::Version
-  version: 0.1.17
+  version: 0.1.18
 platform: ruby
 authors:
 - Dimitri Geshef
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-09-05 00:00:00.000000000 Z
+date: 2016-12-21 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake
@@ -121,6 +121,7 @@ files:
 - LICENSE.txt
 - README.md
 - Rakefile
+- appveyor.yml
 - examples/integer_sample.rb
 - examples/porridge.rb
 - examples/simple_case.rb
@@ -164,7 +165,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: 1.9.1
+      version: 2.0.0
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
@@ -172,7 +173,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.4.5.1
+rubygems_version: 2.6.7
 signing_key: 
 specification_version: 4
 summary: Ruby implementation of the Sequitur algorithm