sequitur 0.1.18 → 0.1.23

data/.travis.yml

@@ -1,23 +1,29 @@
 language: ruby
+dist: trusty
+
+before_install:
+  - gem update --system
+  - gem install bundler  
+
+script:
+  - bundle exec rake
+  
 rvm:
+  - 2.6.3
+  - 2.5.5
+  - 2.4.6
+  - 2.3.8
   - ruby-head
-  - jruby-head  
-  - 2.3.3
-  - 2.2.6
-  - 2.1.9
-  - 2.0.0  
-  - jruby    
-
+  - jruby-9.1.9.0
+  - jruby-head
+  
 matrix:
   allow_failures:
-    - rvm: jruby  
     - rvm: ruby-head
     - rvm: jruby-head
 
-gemfile:
-  - Gemfile
-  
+
 # whitelist
-branches:  
+branches:
   only:
-    - master
+    - master

data/CHANGELOG.md

@@ -1,3 +1,36 @@
+## [0.1.23] - 2021-09-04
+- Remove dependencies towards `coverall`, `simplecov`  
+- Code restyling to please rubocop 1.19.1
+
+* [CHANGE] File 'sequitur.gemspec' Remove dependencies towards `coverall`, `simplecov` 
+* [CHANGE] File 'sequitur.gemspec' Ruby version must be 2.5+
+
+## [0.1.22] - 2019-08-18
+- Code refactoring to use string frozen magic comments (as a consequence, sequitur runs only on Rubies 2.3 or newer).  
+- Code restyling to please rubocop 0.7.40. 
+
+* [CHANGE] Files `Gemfile`, `.travis.yml`, `appveyor.yml` updated.
+
+## 0.1.21 - 2019-01-13
+- Removed Ruby versions older than 2.3 in CI testing because of breaking changes by Bundler 2.0  
+* [CHANGE] Files `Gemfile`, `.travis.yml`, `appveyor.yml` updated.
+
+### 0.1.20 / 2019-01-03
+Maintenance release.
+* [CHANGE] File `.travis.yml`: updated Ruby versions.
+* [CHANGE] File `appveyor.yml` updated Ruby versions.
+* [CHANGE] File 'Gemfile' Code re-styling to please Rubocop 0.62.0.
+* [CHANGE] File `LICENSE.txt` Updated copyright years.
+
+### 0.1.19 / 2018-05-16
+Maintenance release.
+* [CHANGE] File `.travis.yml`: updated Ruby versions.
+* [CHANGE] File `appveyor.yml` updated Ruby versions, updated for syntax changes.
+* [CHANGE] File 'sequitur.gemspec' Updated versions in dependencies.
+* [CHANGE] File 'Gemfile' Updated versions in dependencies.
+* [CHANGE] File 'Gemfile' Code re-styling to please Rubocop 0.55.0.
+
+
 ### 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.

data/Gemfile

@@ -1,10 +1,11 @@
+# frozen_string_literal: true
+
 source 'https://rubygems.org'
 # Prevent Bundler to load the dependencies from our .gemspec file
 
-
 group :development do
   gem 'coveralls', '>= 0.7.0'
-  gem 'rake', '>= 10.0.0'  
-  gem 'rspec', '>= 2.1.0'  
+  gem 'rake', '>= 10.0.0'
+  gem 'rspec', '>= 3.0.0'
   gem 'simplecov', '>= 0.8.0'
 end

data/LICENSE.txt

@@ -1,4 +1,4 @@
-Copyright (c) 2014-2017 Dimitri Geshef
+Copyright (c) 2014-2019 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,7 +7,6 @@ _Ruby gem implementing the Sequitur algorithm_
 [![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)
 [![Inline docs](http://inch-ci.org/github/famished-tiger/Sequitur.svg?branch=master)](http://inch-ci.org/github/famished-tiger/Sequitur)
 [![Code Climate](https://codeclimate.com/github/famished-tiger/Sequitur.png)](https://codeclimate.com/github/famished-tiger/Sequitur)
 [![License](https://img.shields.io/badge/license-MIT-brightgreen.svg?style=flat)](https://github.com/famished-tiger/Sequitur/blob/master/LICENSE.txt)
@@ -248,4 +247,4 @@ More examples are available in the examples folder.
 
 Copyright
 ---------
-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.
+Copyright (c) 2014-2018, 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/Rakefile

@@ -1,3 +1,5 @@
+# frozen_string_literal: true
+
 require 'rubygems'
 require_relative './lib/sequitur/constants'
 

data/appveyor.yml

@@ -1,20 +1,28 @@
 version: '{build}'
-max_jobs: 3
+max_jobs: 5
 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: 26-x64
+  - Ruby_version: 25-x64
+  - Ruby_version: 24-x64
   - Ruby_version: 23-x64
+  - Ruby_version: 26
+  - Ruby_version: 25
+  - Ruby_version: 24
+  - Ruby_version: 23
+
 install:
-- cmd: >-
-    SET PATH=C:\Ruby%Ruby_version%\bin;%PATH%
+  - set PATH=C:\Ruby%Ruby_version%\bin;%PATH%
+  - gem update --system
+  - gem install bundler
+  - bundle install --retry=3 --clean --force
 
-    bundle install --retry=3 --clean
 build: off
+
+before_test:
+  - ruby -v
+  - gem -v
+  - bundle -v
+
 test_script:
-- cmd: bundle exec rake
+  - bundle exec rake

data/examples/integer_sample.rb

@@ -1,16 +1,18 @@
-require 'sequitur'  # Load the Sequitur library
+# frozen_string_literal: true
+
+require 'sequitur' # Load the Sequitur library
 
 #
 # Purpose: show how to apply Sequitur on a stream of integer values
 #
-input_sequence =  [1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5]
+input_sequence = [1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5]
 
 # Generate the grammar from the sequence
 grammar = Sequitur.build_from(input_sequence)
 
 
 # Use a formatter to display the grammar rules on the console output
-formatter = Sequitur::Formatter::BaseText.new(STDOUT)
+formatter = Sequitur::Formatter::BaseText.new($stdout)
 
 # Now render the rules
 formatter.render(grammar.visitor)
@@ -23,11 +25,10 @@ formatter.render(grammar.visitor)
 
 # Playing a bit with the API
 # Access last symbol from rhs of start production:
-last_symbol_p0 = grammar.start.rhs.symbols[-1]  
-puts last_symbol_p0     # => 5
+last_symbol_p0 = grammar.start.rhs.symbols[-1]
+puts last_symbol_p0 # => 5
 
 # Access first symbol from rhs of P1 production:
 first_symbol_p1 = grammar.productions[1].rhs.symbols[0]
 
-puts first_symbol_p1    # => 1
-
+puts first_symbol_p1 # => 1

data/examples/porridge.rb

@@ -1,9 +1,9 @@
-require 'sequitur'  # Load the Sequitur library
+# frozen_string_literal: true
 
+require 'sequitur' # Load the Sequitur library
 
 # Purpose: demo to show that sequitur gem works on example from sequitur.info website
-input_sequence =        
-      input = <<-SNIPPET
+input_sequence = <<-SNIPPET
 pease porridge hot,
 pease porridge cold,
 pease porridge in the pot,
@@ -19,9 +19,9 @@ grammar = Sequitur.build_from(input_sequence)
 
 # To display the grammar rules on the console output
 # We use a formatter
-formatter = Sequitur::Formatter::BaseText.new(STDOUT)
+formatter = Sequitur::Formatter::BaseText.new($stdout)
 
-# Now render the rules. 
+# Now render the rules.
 formatter.render(grammar.visitor)
 
 # Rendered output is:
@@ -38,4 +38,4 @@ formatter.render(grammar.visitor)
 # P9 : s o m P1 l i k P1 i t  .
 # P10 : c P7.
 # P11 : P5 P9.
-# P12 : P6   t h P4 t P5 n P6 P1 d a y s   P7 .
+# P12 : P6   t h P4 t P5 n P6 P1 d a y s P7 .

data/examples/simple_case.rb

@@ -1,8 +1,9 @@
-require 'sequitur'  # Load the Sequitur library
+# frozen_string_literal: true
 
+require 'sequitur' # Load the Sequitur library
 
 # Purpose: show how to apply Sequitur on a stream of single characters
-input_sequence =  'ababcabcdabcde'  # Let's analyze this string
+input_sequence = 'ababcabcdabcde' # Let's analyze this string
 
 # The SEQUITUR algorithm will detect the repeated 'ab' pattern
 # and will generate a context-free grammar that represents the input string
@@ -10,13 +11,13 @@ grammar = Sequitur.build_from(input_sequence)
 
 # To display the grammar rules on the console output
 # We use a formatter
-formatter = Sequitur::Formatter::BaseText.new(STDOUT)
+formatter = Sequitur::Formatter::BaseText.new($stdout)
 
 # 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)
 
@@ -24,4 +25,4 @@ formatter.render(grammar.visitor)
 # start : P1 P2 P3 P3 e.
 # P1 : a b.
 # P2 : P1 c.
-# P3 : P2 d.
+# P3 : P2 d.

data/examples/symbol_sample.rb

@@ -1,21 +1,21 @@
-require 'sequitur'  # Load the Sequitur library
+# frozen_string_literal: true
+
+require 'sequitur' # Load the Sequitur library
 
 #
 # Purpose: show how to apply Sequitur on a stream of Symbol values
 #
-input_sequence =  [
-  :aa, :bb, :aa, :bb,
-  :cc, :aa, :bb, :cc, 
-  :dd, :aa, :bb, :cc, 
-  :dd, :ee
+input_sequence = %i[
+  aa bb aa bb cc
+  aa bb cc dd aa
+  bb cc dd ee
 ]
 
 # Generate the grammar from the sequence
 grammar = Sequitur.build_from(input_sequence)
 
-
 # Use a formatter to display the grammar rules on the console output
-formatter = Sequitur::Formatter::BaseText.new(STDOUT)
+formatter = Sequitur::Formatter::BaseText.new($stdout)
 
 # Now render the rules
 formatter.render(grammar.visitor)
@@ -25,4 +25,3 @@ formatter.render(grammar.visitor)
 # P1 : aa bb.
 # P2 : P1 cc.
 # P3 : P2 dd.
-

data/examples/word_sample.rb

@@ -1,4 +1,6 @@
-require 'sequitur'  # Load the Sequitur library
+# frozen_string_literal: true
+
+require 'sequitur' # Load the Sequitur library
 
 #
 # Purpose: show how to apply Sequitur on a stream of text words
@@ -18,7 +20,7 @@ grammar = Sequitur.build_from(input_sequence)
 
 
 # Use a formatter to display the grammar rules on the console output
-formatter = Sequitur::Formatter::BaseText.new(STDOUT)
+formatter = Sequitur::Formatter::BaseText.new($stdout)
 
 # Now render the rules
 formatter.render(grammar.visitor)
@@ -27,4 +29,3 @@ formatter.render(grammar.visitor)
 # start : P2 6 Error illegal P1 20 P2 9.
 # P1 : character at position.
 # P2 : Error unknown P1.
-

data/lib/sequitur/constants.rb

@@ -1,12 +1,14 @@
+# frozen_string_literal: true
+
 # File: constants.rb
 # Purpose: definition of Sequitur constants.
 
 module Sequitur # Module used as a namespace
   # The version number of the gem.
-  Version = '0.1.18'.freeze
+  Version = '0.1.23'
 
   # Brief description of the gem.
-  Description = 'Ruby implementation of the Sequitur algorithm'.freeze
+  Description = 'Ruby implementation of the Sequitur algorithm'
 
   # Constant Sequitur::RootDir contains the absolute path of Sequitur's
   # start directory. Note: it also ends with a slash character.
@@ -18,7 +20,7 @@ module Sequitur # Module used as a namespace
     RootDir = begin
       require 'pathname' # Load Pathname class from standard library
       startdir = Pathname(__FILE__).dirname.parent.parent.expand_path
-      startdir.to_s + '/' # Append trailing slash character to it
+      "#{startdir}/" # Append trailing slash character to it
     end
   end
 end # module

data/lib/sequitur/digram.rb

@@ -1,49 +1,51 @@
+# frozen_string_literal: true
+
 # File: digram.rb
 
 module Sequitur # Module for classes implementing the Sequitur algorithm
-# In linguistics, a digram is a sequence of two letters.
-# In Sequitur, a digram is a sequence of two consecutive symbols that
-# appear in a production rule. Each symbol in a digram
-# can be a terminal or not.
-class Digram
-  # The sequence of two consecutive grammar symbols.
-  #   The two symbols should respond to the :hash message.
-  attr_reader(:symbols)
-
-  # An unique hash key of the digram
-  attr_reader(:key)
-
-  # The production in which the digram occurs
-  attr_reader(:production)
-
-  # Constructor.
-  # A digram represents a sequence of two symbols
-  # (that appears in a rhs of a production).
-  # Terminal symbols must respond to the :hash message.
-  # @param symbol1 [StringOrSymbol] First element of the digram
-  # @param symbol2 [StringOrSymbol] Second element of the digram
-  # @param aProduction [Production] Production in which the RHS
-  #   the sequence symbol1 symbol2 appears.
-  def initialize(symbol1, symbol2, aProduction)
-    @symbols = [symbol1, symbol2]
-    @key = symbol1.hash.to_s(16) + ':' + symbol2.hash.to_s(16)
-    @production = aProduction
-  end
-
-  # Equality testing.
-  #   true iff keys of both digrams are equal, false otherwise
-  # @param other [Digram] another to compare with
-  # @return [true/false]
-  def ==(other)
-    return key == other.key
-  end
-
-  # Does the digram consists of twice the same symbols?
-  # @return [true/false] true when symbols.first == symbols.last
-  def repeating?()
-    return symbols[0] == symbols[1]
-  end
-end # class
+  # In linguistics, a digram is a sequence of two letters.
+  # In Sequitur, a digram is a sequence of two consecutive symbols that
+  # appear in a production rule. Each symbol in a digram
+  # can be a terminal or not.
+  class Digram
+    # The sequence of two consecutive grammar symbols.
+    #   The two symbols should respond to the :hash message.
+    attr_reader(:symbols)
+
+    # An unique hash key of the digram
+    attr_reader(:key)
+
+    # The production in which the digram occurs
+    attr_reader(:production)
+
+    # Constructor.
+    # A digram represents a sequence of two symbols
+    # (that appears in a rhs of a production).
+    # Terminal symbols must respond to the :hash message.
+    # @param symbol1 [StringOrSymbol] First element of the digram
+    # @param symbol2 [StringOrSymbol] Second element of the digram
+    # @param aProduction [Production] Production in which the RHS
+    #   the sequence symbol1 symbol2 appears.
+    def initialize(symbol1, symbol2, aProduction)
+      @symbols = [symbol1, symbol2]
+      @key = "#{symbol1.hash.to_s(16)}:#{symbol2.hash.to_s(16)}"
+      @production = aProduction
+    end
+
+    # Equality testing.
+    #   true iff keys of both digrams are equal, false otherwise
+    # @param other [Digram] another to compare with
+    # @return [true/false]
+    def ==(other)
+      return key == other.key
+    end
+
+    # Does the digram consists of twice the same symbols?
+    # @return [true/false] true when symbols.first == symbols.last
+    def repeating?
+      return symbols[0] == symbols[1]
+    end
+  end # class
 end # module
 
 # End of file