rley 0.3.04 → 0.3.05

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 4c5e18168fe007f5fb819f2df4f1f1944bae971d
-  data.tar.gz: ccb8abe6ea9d8d135a0fc896ebfa4dbf5fe6f674
+  metadata.gz: 29bd8f0b4ab6dacef0a6086f91ccd464b0417aa5
+  data.tar.gz: ee3d9fde440b5936350b3cfc0779694eac4bc924
 SHA512:
-  metadata.gz: d2eab437aba2c78676529651cca3a0a1fd9cf0b23f14f7003bf631add424a50295a14ddc1065e63db907c3003a415ae1c20427a1d6594243f5724a25203f248b
-  data.tar.gz: 4fc6fa566e1f8c847dd34a862e27d73d7dc758bfcd557e84343b41951f6f52dd2993d0be4d92c60ec40241887065021ca006ef4b96dd1e609264b9976da6a433
+  metadata.gz: cd2d999e9d1534d11106b86139a87570a250ed7f3c7d525e4cc518bc2e023252e097ce4bd2f550a745d113551856765fc4ac7a45e318da640fca3a42f38fef91
+  data.tar.gz: 63f1f1bef8272d05da2cf35fb7f4030c6c9c6e8d0e666151e95be7867317b946c88d8591025b7fdc0f496d381eca6c164e9217c6f11891a979a2eb02ea6441d5

data/.rubocop.yml

@@ -2,11 +2,12 @@ AllCops:
   Exclude:
     - 'examples/**/*'
     - 'features/**/*'
+    - 'exp/**/*'    
     - 'gems/**/*'
-    - 'lab/**/*'
+    - 'refs/**/*'
 
 AbcSize:
-  Max: 35
+  Max: 45
     
 # This is disabled because some demos use UTF-8
 AsciiComments:
@@ -60,7 +61,7 @@ MethodLength:
  
 # Avoid modules longer than 500 lines of code 
 ModuleLength:
-  Max: 500
+  Max: 700
  
 NonNilCheck:
   Enabled: false
@@ -84,4 +85,7 @@ TrailingWhitespace:
   Enabled: false
   
 VariableName:
+  Enabled: false
+
+VariableNumber:
   Enabled: false  

data/CHANGELOG.md

@@ -1,3 +1,6 @@
+### 0.3.05 / 2016-11-01
+* [CHANGE] Code re-styling to please Rubocop 0.45.0: only 2 offences remain (from a few hundreds!)
+
 ### 0.3.04 / 2016-11-01
 * [FIX] File `state_set_spec.rb` : Failing mock tests. Reverted `expect` to `allow` expectations.
 

data/Rakefile

@@ -1,30 +1,30 @@
-require 'rubygems'
-require_relative './lib/rley/constants'
-
-namespace :gem do
-  desc 'Push the gem to rubygems.org'
-  task :push do
-    system("gem push rley-#{Rley::Version}.gem")
-  end
-end # namespace
-
-
-# Testing-specific tasks
-
-# RSpec as testing tool
-require 'rspec/core/rake_task'
-desc 'Run RSpec'
-RSpec::Core::RakeTask.new do |spec|
-  spec.pattern = 'spec/**/*_spec.rb'
-end
-
-
-# Combine RSpec tests
-desc 'Run tests, with RSpec'
-task test: [:spec]
-
-
-# Default rake task
-task default: :test
-
-# End of file
+require 'rubygems'
+require_relative './lib/rley/constants'
+
+namespace :gem do
+  desc 'Push the gem to rubygems.org'
+  task :push do
+    system("gem push rley-#{Rley::Version}.gem")
+  end
+end # namespace
+
+
+# Testing-specific tasks
+
+# RSpec as testing tool
+require 'rspec/core/rake_task'
+desc 'Run RSpec'
+RSpec::Core::RakeTask.new do |spec|
+  spec.pattern = 'spec/**/*_spec.rb'
+end
+
+
+# Combine RSpec tests
+desc 'Run tests, with RSpec'
+task test: [:spec]
+
+
+# Default rake task
+task default: :test
+
+# End of file

data/examples/parsers/parsing_L0.rb

@@ -80,7 +80,7 @@ def tokenizer(aText, aGrammar)
   tokens = aText.scan(/\S+/).map do |word|
     term_name = L0_lexicon[word]
     if term_name.nil?
-      fail StandardError, "Word '#{word}' not found in lexicon"
+      raise StandardError, "Word '#{word}' not found in lexicon"
     end
     terminal = aGrammar.name2symbol[term_name]
     Rley::Parser::Token.new(word, terminal)

data/examples/parsers/parsing_L1.rb

@@ -93,7 +93,7 @@ def tokenizer(aText, aGrammar)
   tokens = aText.scan(/\S+/).map do |word|
     term_name = L1_lexicon[word]
     if term_name.nil?
-      fail StandardError, "Word '#{word}' not found in lexicon"
+      raise StandardError, "Word '#{word}' not found in lexicon"
     end
     terminal = aGrammar.name2symbol[term_name]
     Rley::Parser::Token.new(word, terminal)

data/examples/parsers/parsing_abc.rb

@@ -31,7 +31,7 @@ grammar_abc = builder.grammar
 def tokenizer(aText, aGrammar)
   tokens = aText.chars.map do |ch|
     terminal = aGrammar.name2symbol[ch]
-    fail StandardError, "Unknown input character '#{ch}'" if terminal.nil?
+    raise StandardError, "Unknown input character '#{ch}'" if terminal.nil?
     Rley::Parser::Token.new(ch, terminal)
   end
   

data/examples/parsers/parsing_ambig.rb

@@ -41,7 +41,7 @@ def tokenizer(aText, aGrammar)
         terminal = aGrammar.name2symbol['integer']
       else
         msg = "Unknown input text '#{lexeme}'"
-        fail StandardError, msg
+        raise StandardError, msg
     end
     Rley::Parser::Token.new(lexeme, terminal)
   end

data/examples/parsers/parsing_another.rb

@@ -37,7 +37,7 @@ def tokenizer(aText, aGrammar)
         terminal = aGrammar.name2symbol[lexeme]
       else
         msg = "Unknown input text '#{lexeme}'"
-        fail StandardError, msg
+        raise StandardError, msg
     end
     Rley::Parser::Token.new(lexeme, terminal)
   end

data/examples/parsers/parsing_b_expr.rb

@@ -42,7 +42,7 @@ def tokenizer(aText, aGrammar)
         terminal = aGrammar.name2symbol['integer']
       else
         msg = "Unknown input text '#{lexeme}'"
-        fail StandardError, msg
+        raise StandardError, msg
     end
     Rley::Parser::Token.new(lexeme, terminal)
   end

data/examples/parsers/parsing_err_expr.rb

@@ -41,7 +41,7 @@ def tokenizer(aText, aGrammar)
         terminal = aGrammar.name2symbol['integer']
       else
         msg = "Unknown input text '#{lexeme}'"
-        fail StandardError, msg
+        raise StandardError, msg
     end
     Rley::Parser::Token.new(lexeme, terminal)
   end

data/examples/parsers/parsing_groucho.rb

@@ -53,7 +53,7 @@ def tokenizer(aText, aGrammar)
   tokens = aText.scan(/\S+/).map do |word|
     term_name = Groucho_lexicon[word]
     if term_name.nil?
-      fail StandardError, "Word '#{word}' not found in lexicon"
+      raise StandardError, "Word '#{word}' not found in lexicon"
     end
     terminal = aGrammar.name2symbol[term_name]
     Rley::Parser::Token.new(word, terminal)

data/examples/parsers/parsing_right_recursive.rb

@@ -38,7 +38,7 @@ def tokenizer(aText, aGrammar)
         terminal = aGrammar.name2symbol[lexeme]
       else
         msg = "Unknown input text '#{lexeme}'"
-        fail StandardError, msg
+        raise StandardError, msg
     end
     Rley::Parser::Token.new(lexeme, terminal)
   end

data/examples/parsers/parsing_tricky.rb

@@ -41,7 +41,7 @@ def tokenizer(aText, aGrammar)
         terminal = aGrammar.name2symbol[lexeme]
       else
         msg = "Unknown input text '#{lexeme}'"
-        fail StandardError, msg
+        raise StandardError, msg
     end
     Rley::Parser::Token.new(lexeme, terminal)
   end

data/lib/rley/constants.rb

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

data/lib/rley/formatter/base_formatter.rb

@@ -13,8 +13,6 @@ module Rley # This module is used as a namespace
         @output = anIO
       end
 
-      public
-
       # Given a parse tree visitor, perform the visit
       # and render the visit events in the output stream.
       # @param aVisitor [ParseTreeVisitor]

data/lib/rley/formatter/debug.rb

@@ -18,8 +18,6 @@ module Rley # This module is used as a namespace
         @indentation = 0
       end
 
-      public
-
       # Method called by a ParseTreeVisitor to which the formatter subscribed.
       # Notification of a visit event: the visitor is about to visit the given
       # parse tree

data/lib/rley/formatter/json.rb

@@ -22,8 +22,6 @@ module Rley # This module is used as a namespace
         @sibling_flags = [ false ]
       end
 
-      public
-
       # Method called by a ParseTreeVisitor to which the formatter subscribed.
       # Notification of a visit event: the visitor is about to visit the given
       # parse tree
@@ -31,7 +29,7 @@ module Rley # This module is used as a namespace
       def before_ptree(_ptree)
         print_text('', "{\n")
         indent
-        print_text('', "\"root\":")
+        print_text('', '"root":')
         indent
       end
 

data/lib/rley/gfg/call_edge.rb

@@ -1,30 +1,31 @@
-require_relative 'edge'
-
-module Rley # This module is used as a namespace
-  module GFG # This module is used as a namespace
-    # Specialization of an edge in a grammar flow graph
-    # that has a item vertex as its head (predecessor).    
-    # and a start vertex (.X) as its tail (successor).
-    # Responsibilities:
-    # - To know the successor vertex (tail)
-    class CallEdge < Edge
-      attr_reader(:key)
-    
-      # Pre-condition: thePredecessor is an ItemVertex
-      # Pre-condition: theSuccessor is an StartVertex
-      def initialize(thePredecessor, theSuccessor)
-        super(thePredecessor, theSuccessor)
-        do_set_key(thePredecessor, theSuccessor)
-      end
-      
-private
-      def do_set_key(thePredecessor, theSuccessor)
-        tail_d_item = thePredecessor.dotted_item
-        @key = "CALL_#{tail_d_item.production.object_id}_#{tail_d_item.position}"
-      end
-
-    end # class
-  end # module
-end # module
-
-# End of file
+require_relative 'edge'
+
+module Rley # This module is used as a namespace
+  module GFG # This module is used as a namespace
+    # Specialization of an edge in a grammar flow graph
+    # that has a item vertex as its head (predecessor).
+    # and a start vertex (.X) as its tail (successor).
+    # Responsibilities:
+    # - To know the successor vertex (tail)
+    class CallEdge < Edge
+      attr_reader(:key)
+
+      # Pre-condition: thePredecessor is an ItemVertex
+      # Pre-condition: theSuccessor is an StartVertex
+      def initialize(thePredecessor, theSuccessor)
+        super(thePredecessor, theSuccessor)
+        do_set_key(thePredecessor, theSuccessor)
+      end
+
+      private
+
+      def do_set_key(thePredecessor, _theSuccessor)
+        tail_d_item = thePredecessor.dotted_item
+        tail_production = tail_d_item.production
+        @key = "CALL_#{tail_production.object_id}_#{tail_d_item.position}"
+      end
+    end # class
+  end # module
+end # module
+
+# End of file

data/lib/rley/gfg/edge.rb

@@ -1,23 +1,22 @@
-module Rley # This module is used as a namespace
-  module GFG # This module is used as a namespace
-    # Abstract class. Represents an edge in a grammar flow graph. 
-    # Responsibilities:
-    # - To know the successor vertex
-    class Edge
-      # The destination vertex of the edge .
-      attr_reader :successor
-      
-      def initialize(thePredecessor, theSuccessor)
-        @successor = theSuccessor
-        thePredecessor.add_edge(self)
-      end
-      
-      def to_s()
-        " --> #{successor.label}"
-      end      
-
-    end # class
-  end # module
-end # module
-
-# End of file
+module Rley # This module is used as a namespace
+  module GFG # This module is used as a namespace
+    # Abstract class. Represents an edge in a grammar flow graph.
+    # Responsibilities:
+    # - To know the successor vertex
+    class Edge
+      # The destination vertex of the edge .
+      attr_reader :successor
+
+      def initialize(thePredecessor, theSuccessor)
+        @successor = theSuccessor
+        thePredecessor.add_edge(self)
+      end
+
+      def to_s()
+        " --> #{successor.label}"
+      end
+    end # class
+  end # module
+end # module
+
+# End of file

data/lib/rley/gfg/end_vertex.rb

@@ -1,24 +1,22 @@
-require_relative 'non_terminal_vertex'
-
-module Rley # This module is used as a namespace
-  module GFG # This module is used as a namespace
-    # TODO: change definition.
-    # Represents a specialized vertex in a grammar flow graph 
-    # that is associated to a given non-terminal symbol.
-    # Responsibilities (in addition to inherited ones):
-    # - Know its related non-terminal symbol
-    class EndVertex < NonTerminalVertex
-      
-      def initialize(aNonTerminal)
-        super(aNonTerminal)
-      end
-      
-      def label()
-        return "#{non_terminal}."
-      end      
-
-    end # class
-  end # module
-end # module
-
-# End of file
+require_relative 'non_terminal_vertex'
+
+module Rley # This module is used as a namespace
+  module GFG # This module is used as a namespace
+    # TODO: change definition.
+    # Represents a specialized vertex in a grammar flow graph
+    # that is associated to a given non-terminal symbol.
+    # Responsibilities (in addition to inherited ones):
+    # - Know its related non-terminal symbol
+    class EndVertex < NonTerminalVertex
+      def initialize(aNonTerminal)
+        super(aNonTerminal)
+      end
+
+      def label()
+        return "#{non_terminal}."
+      end
+    end # class
+  end # module
+end # module
+
+# End of file

data/lib/rley/gfg/epsilon_edge.rb

@@ -1,21 +1,20 @@
-require_relative 'edge'
-
-module Rley # This module is used as a namespace
-  module GFG # This module is used as a namespace
-    # Represents an edge in a grammar flow graph 
-    # without change of the position in the input stream.
-    # Responsibilities:
-    # - To know the successor vertex
-    class EpsilonEdge < Edge
-      # The destination vertex of the edge .
-      attr_reader :successor
-      
-      def initialize(thePredecessor, theSuccessor)
-        super(thePredecessor, theSuccessor)
-      end
-
-    end # class
-  end # module
-end # module
-
-# End of file
+require_relative 'edge'
+
+module Rley # This module is used as a namespace
+  module GFG # This module is used as a namespace
+    # Represents an edge in a grammar flow graph
+    # without change of the position in the input stream.
+    # Responsibilities:
+    # - To know the successor vertex
+    class EpsilonEdge < Edge
+      # The destination vertex of the edge .
+      attr_reader :successor
+
+      def initialize(thePredecessor, theSuccessor)
+        super(thePredecessor, theSuccessor)
+      end
+    end # class
+  end # module
+end # module
+
+# End of file