rley 0.6.00 → 0.6.01

data/examples/general/left.rb

@@ -8,8 +8,8 @@ builder = Rley::Syntax::GrammarBuilder.new do
   add_terminals('DOT')
   
   # Grammar with left recursive rule.
-	rule 'l_dots' => []
-	rule 'l_dots' => %w[l_dots DOT]  
+  rule 'l_dots' => []
+  rule 'l_dots' => %w[l_dots DOT]  
 end
 
 # And now, let's build the grammar...
@@ -17,12 +17,12 @@ grammar = builder.grammar
 
 # Highly simplified tokenizer implementation.
 def tokenizer(aText, aGrammar)
-	tokens = aText.scan(/\./).map do |dot|
-	  terminal = aGrammar.name2symbol['DOT']
-	  Rley::Lexical::Token.new(dot, terminal)
-	end
+  tokens = aText.scan(/\./).map do |dot|
+    terminal = aGrammar.name2symbol['DOT']
+    Rley::Lexical::Token.new(dot, terminal)
+  end
 
-	return tokens
+  return tokens
 end
 
 input_to_parse = '.' * 500 # Input = 500 consecutive dots
@@ -35,4 +35,4 @@ puts "Parsing successful? #{result.success?}"
 unless result.success?
   puts result.failure_reason.message
   exit(1)
-end
+end

data/examples/general/right.rb

@@ -8,8 +8,8 @@ builder = Rley::Syntax::GrammarBuilder.new do
   add_terminals('DOT')
   
   # Grammar with right recursive rule.
-	rule 'r_dots' => []
-	rule 'r_dots' => %w[DOT r_dots]  
+  rule 'r_dots' => []
+  rule 'r_dots' => %w[DOT r_dots]  
 end
 
 # And now, let's build the grammar...
@@ -17,12 +17,12 @@ grammar = builder.grammar
 
 # Highly simplified tokenizer implementation.
 def tokenizer(aText, aGrammar)
-	tokens = aText.scan(/\./).map do |dot|
-	  terminal = aGrammar.name2symbol['DOT']
-	  Rley::Lexical::Token.new(dot, terminal)
-	end
+  tokens = aText.scan(/\./).map do |dot|
+    terminal = aGrammar.name2symbol['DOT']
+    Rley::Lexical::Token.new(dot, terminal)
+  end
 
-	return tokens
+  return tokens
 end
 
 input_to_parse = '.' * 500 # Input = 500 consecutive dots
@@ -35,4 +35,4 @@ puts "Parsing successful? #{result.success?}"
 unless result.success?
   puts result.failure_reason.message
   exit(1)
-end
+end

data/lib/rley/constants.rb

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

data/lib/rley/engine.rb

@@ -22,11 +22,9 @@ module Rley # This module is used as a namespace
     attr_reader :grammar
 
     # Constructor.
-    # @param &aBlock [Proc, Lambda] Code block for setting the configuration.
-    def initialize(&aConfigBlock)
+    def initialize()
       @configuration = EngineConfig.new
-
-       yield configuration if block_given?
+      yield configuration if block_given?
     end
 
     # Factory method.
@@ -48,12 +46,11 @@ module Rley # This module is used as a namespace
     def parse(aTokenizer)
       tokens = []
       aTokenizer.each do |a_token|
-        if a_token
-          term_name = a_token.terminal
-          term_symb = grammar.name2symbol[term_name]
-          a_token.instance_variable_set(:@terminal, term_symb)
-          tokens << a_token
-        end
+        next unless a_token
+        term_name = a_token.terminal
+        term_symb = grammar.name2symbol[term_name]
+        a_token.instance_variable_set(:@terminal, term_symb)
+        tokens << a_token
       end
       parser = build_parser(grammar)
       return parser.parse(tokens)
@@ -89,14 +86,14 @@ module Rley # This module is used as a namespace
     # Convert raw parse result into a parse forest representation
     # @param aRawParse [Parser::GFGParsing]
     # def to_pforest(aRawParse)
-      # factory = ParseRep::ParseForestFactory.new(aRawParse)
-      # if configuration.repr_builder == :default
-        # result = factory.create(nil)
-      # else
-        # result = factory.create(configuration.repr_builder)
-      # end
-
-      # return result
+    #   factory = ParseRep::ParseForestFactory.new(aRawParse)
+    #   if configuration.repr_builder == :default
+    #     result = factory.create(nil)
+    #   else
+    #     result = factory.create(configuration.repr_builder)
+    #   end
+
+    #   return result
     # end
 
     # Build a visitor for the given parse tree
@@ -109,7 +106,7 @@ module Rley # This module is used as a namespace
     # @param aPTree[SPPF::ParseForest]
     # @return [ParseForestVisitor]
     # def pforest_visitor(aPForest)
-      # return Rley::ParseForestVisitor.new(aPForest)
+    #   return Rley::ParseForestVisitor.new(aPForest)
     # end
 
     protected
@@ -119,4 +116,3 @@ module Rley # This module is used as a namespace
     end
   end # class
 end # module
-

data/lib/rley/formatter/json.rb

@@ -19,7 +19,7 @@ module Rley # This module is used as a namespace
       def initialize(anIO)
         super(anIO)
         @indentation = 0
-        @sibling_flags = [ false ]
+        @sibling_flags = [false]
       end
 
       # Method called by a ParseTreeVisitor to which the formatter subscribed.

data/lib/rley/gfg/grm_flow_graph.rb

@@ -63,7 +63,7 @@ module Rley # This module is used as a namespace
       # production.
       # @return [String]
       def inspect()
-        result = "#<#{self.class.name}:#{self.object_id}"
+        result = "#<#{self.class.name}:#{object_id}"
         result << ' @vertices=['
         list = vertices.map { |v| "#<#{v.selfie}>" }
         result << list.join(', ')

data/lib/rley/gfg/item_vertex.rb

@@ -4,13 +4,13 @@ require_relative 'vertex'
 
 module Rley # This module is used as a namespace
   module GFG # This module is used as a namespace
-    # Specialization of Vertex class. Represents a 
+    # Specialization of Vertex class. Represents a
     # vertex in a grammar flow graph associated to a given dotted item.
     # Responsibilities (in addition to inherited ones):
     # - Know its related non-terminal symbol
     class ItemVertex < Vertex
       # Link to the dotted item object
-      # @return [DottedItem] The corresponding dotted item      
+      # @return [DottedItem] The corresponding dotted item
       attr_reader :dotted_item
 
       # Optional link to a "shortcut" edge.
@@ -65,16 +65,17 @@ module Rley # This module is used as a namespace
       end
 
       # Return the symbol after the dot.
-      # @return [Syntax::GrmSymbol, NilClass] Next grammar symbol otherwise nil.      
+      # @return [Syntax::GrmSymbol, NilClass] Next grammar symbol otherwise nil.
       def next_symbol()
         return dotted_item.next_symbol
       end
 
       # Return the non-terminal symbol at the left-hand side of the production
-      # @return [Syntax::GrmSymbol] The non-terminal symbol at left side of production.
+      # @return [Syntax::GrmSymbol]
+      #   The non-terminal symbol at left side of production.
       def lhs()
         return dotted_item.lhs
-      end 
+      end
     end # class
   end # module
 end # module

data/lib/rley/gfg/vertex.rb

@@ -35,7 +35,7 @@ module Rley # This module is used as a namespace
         result = '#<'
         result << selfie
         edges.each { |e| result << e.inspect }
-        result << specific_inspect()
+        result << specific_inspect
         result << '>'
         
         return result
@@ -45,8 +45,8 @@ module Rley # This module is used as a namespace
       # vertex without the edges.
       # @return [String]      
       def selfie()
-        result = "#{self.class.name}:#{self.object_id}"
-        result << %Q[ label="#{self.label}"]
+        result = "#{self.class.name}:#{object_id}"
+        result << %Q( label="#{label}")
         return result
       end
       

data/lib/rley/lexical/token.rb

@@ -7,20 +7,21 @@ module Rley # This module is used as a namespace
     # Say, that in a particular language, the lexeme 'foo' is an occurrence
     # of the terminal symbol IDENTIFIER. Then the lexer will return a Token
     # object that states the fact that 'foo' is indeed an IDENTIFIER. Basically,
-    # a Token is a pair (lexeme, terminal): it asserts that a given lexeme 
+    # a Token is a pair (lexeme, terminal): it asserts that a given lexeme
     # is an instance of given terminal symbol.
     class Token
       # The sequence of character(s) from the input stream that is an occurrence
       # of the related terminal symbol.
       # @return [String] Input substring that is an instance of the terminal.
       attr_reader(:lexeme)
-      
+
       # @return [Syntax::Terminal] Terminal symbol corresponding to the lexeme.
       attr_reader(:terminal)
 
       # Constructor.
       # @param theLexeme [String] the lexeme (= piece of text from input)
-      # @param aTerminal [Syntax::Terminal] The terminal symbol corresponding to the lexeme.
+      # @param aTerminal [Syntax::Terminal]
+      #   The terminal symbol corresponding to the lexeme.
       def initialize(theLexeme, aTerminal)
         raise 'Internal error: nil terminal symbol detected' if aTerminal.nil?
         @lexeme = theLexeme

data/lib/rley/parse_rep/ast_base_builder.rb

@@ -85,7 +85,7 @@ module Rley # This module is used as a namespace
       # Factory method for creating a node object for the given
       # input token.
       # @param aTerminal [Syntax::Production] Relevant production rule
-      # @param aTerminal [Syntax::Terminal] Terminal symbol associated with the token
+      # @param aTerminal [Syntax::Terminal] Terminal associated with the token
       # @param aTokenPosition [Integer] Position of token in the input stream
       # @param aToken [Lexical::Token] The input token
       def new_leaf_node(aProduction, aTerminal, aTokenPosition, aToken)
@@ -107,7 +107,7 @@ module Rley # This module is used as a namespace
       # @param theChildren [Array] Children nodes (one per rhs symbol)
       def new_parent_node(aProduction, aRange, theTokens, theChildren)
         mth_name = method_name(aProduction.name)
-        if self.respond_to?(mth_name, true)
+        if respond_to?(mth_name, true)
           node = send(mth_name, aProduction, aRange, theTokens, theChildren)
         else
           # Default action...
@@ -117,7 +117,8 @@ module Rley # This module is used as a namespace
                    when 1
                      return_first_child(aRange, theTokens, theChildren)
                    else
-                    raise StandardError, "Don't know production '#{aProduction.name}'"
+                    msg = "Don't know production '#{aProduction.name}'"
+                    raise StandardError, msg
                  end            
         end
         return node

data/lib/rley/parse_rep/parse_rep_creator.rb

@@ -26,7 +26,7 @@ module Rley # This module is used as a namespace
             # puts "EVENT #{event[0]} #{event[1]}"
             a_builder.receive_event(*event)
           end
-        rescue StopIteration
+        rescue StopIteration => exc
           # Do nothing
         end
 

data/lib/rley/parse_rep/parse_tree_builder.rb

@@ -100,7 +100,7 @@ module Rley # This module is used as a namespace
             non_terminal = entry2nonterm(anEntry)
             # Create raw node and push onto stack
             push_raw_node(range, non_terminal)
-          #when :revisit
+          # when :revisit
           #  # TODO: design specification
           else
             raise NotImplementedError, "Cannot handle event #{anEvent}"
@@ -135,7 +135,8 @@ module Rley # This module is used as a namespace
               process_middle_entry(anEntry, anIndex)
             end
           else
-            $stderr.puts "Internal Errore '#{anEvent}', entry: #{anEntry}, index: #{anIndex}"
+            msg_prefix = "Internal Error '#{anEvent}', "
+            $stderr.puts msg_prefix + "entry: #{anEntry}, index: #{anIndex}"
             raise NotImplementedError
         end
       end

data/lib/rley/parser/error_reason.rb

@@ -16,7 +16,7 @@ module Rley # Module used as a namespace
 
       # Returns the result of invoking reason.to_s.
       def message()
-        return self.to_s
+        return to_s
       end
 
       # Return this reason's class name and message

data/lib/rley/parser/gfg_chart.rb

@@ -13,7 +13,7 @@ module Rley # This module is used as a namespace
       attr_reader(:sets)
 
       # @param tokenCount [Integer] The number of lexemes in the input to parse.
-      # @param aGFGraph [GFG::GrmFlowGraph] The GFG for the grammar in use.       
+      # @param aGFGraph [GFG::GrmFlowGraph] The GFG for the grammar in use.
       def initialize(tokenCount, aGFGraph)
         @sets = Array.new(tokenCount + 1) { |_| ParseEntrySet.new }
         push_entry(aGFGraph.start_vertex, 0, 0, :start_rule)
@@ -74,11 +74,11 @@ module Rley # This module is used as a namespace
         # Retrieve all the end entries (i.e. of the form
         last_entries = sets[last_index].entries.select(&:end_entry?)
         # last_entries.each_with_index do |entry, index|
-          # if entry.nil?
-            # puts "Nil entry at index #{index}"
-          # else
-            # puts entry
-          # end
+        #  if entry.nil?
+        #    puts "Nil entry at index #{index}"
+        #  else
+        #    puts entry
+        #  end
         # end
 
         # ... now find the end vertex for start symbol and with origin at zero.

data/lib/rley/parser/gfg_parsing.rb

@@ -9,11 +9,11 @@ module Rley # This module is used as a namespace
   module Parser # This module is used as a namespace
     class GFGParsing
       # The link to the grammar flow graph
-      # @return [GFG::GrmFlowGraph] The GFG that drives the parsing      
+      # @return [GFG::GrmFlowGraph] The GFG that drives the parsing
       attr_reader(:gf_graph)
 
       # The link to the chart object
-      # @return [GFGChart]     
+      # @return [GFGChart]
       attr_reader(:chart)
 
       # The sequence of input token to parse
@@ -54,16 +54,16 @@ module Rley # This module is used as a namespace
         pos = aPosition
         size_before = chart[pos].size
         apply_rule(anEntry, start_vertex, pos, pos, :call_rule)
-        
+
         if next_symbol.nullable? && anEntry.dotted_entry?
           size_after = chart[pos].size
           # ...apply the Nullable rule
           nullable_rule(anEntry, aPosition) if size_after == size_before
-        end        
+        end
       end
-      
+
       # Let the current sigma set be the ith parse entry set.
-      # This method is invoked when a dotted entry is added 
+      # This method is invoked when a dotted entry is added
       # to the parse entry set of the from [A => alpha . B beta, k]
       # and B is nullable
       # Then the entry [A => alpha B . beta, k] is added to the current
@@ -78,8 +78,8 @@ module Rley # This module is used as a namespace
 
         # first pos == origin
         # second pos == position
-        apply_rule(end_entry, next_vertex, anEntry.origin, pos, :nullable_rule)        
-      end      
+        apply_rule(end_entry, next_vertex, anEntry.origin, pos, :nullable_rule)
+      end
 
       # Let the current sigma set be the ith parse entry set.
       # This method is invoked when an entry is added to a parse entry set
@@ -156,7 +156,7 @@ module Rley # This module is used as a namespace
             apply_rule(ntry, vertex_after_terminal, origin, pos, :scan_rule)
           end
         end
-        
+
         return true
       end
 
@@ -165,7 +165,7 @@ module Rley # This module is used as a namespace
       def success?()
         return false if @failure_reason
         return chart.accepting_entry ? true : false
-      end      
+      end
 
       # Return true if there are more than one complete state
       # for the same lhs and same origin in any state set.
@@ -179,28 +179,28 @@ module Rley # This module is used as a namespace
       def parse_forest()
         msg = <<-END_MSG
  Method Rley::Parser::GFGParsing.parse_forest is deprecated, call
- Rley::Engine::to_pforest. It will be removed April 1st 
- or version 0.6.1 (whichever is first)       
+ Rley::Engine::to_pforest. It will be removed April 1st
+ or version 0.6.1 (whichever is first)
 END_MSG
-        # $stderr.puts(msg)      
+        # warn(msg)
         factory = ParseRep::ParseForestFactory.new(self)
 
         return factory.create
       end
-      
+
       # Factory method. Builds a ParseTree from the parse result.
       # @return [ParseTree]
       def parse_tree(aBuilder = nil)
         msg = <<-END_MSG
 Method Rley::Parser::GFGParsing.parse_tree is deprecated, call
-Rley::Engine::to_ptree. It will be removed April 1st 
-or version 0.6.1 (whichever is first)       
+Rley::Engine::to_ptree. It will be removed April 1st
+or version 0.6.1 (whichever is first)
 END_MSG
-        $stderr.puts(msg)
+        warn(msg)
         factory = ParseRep::ParseTreeFactory.new(self)
 
         return factory.create(aBuilder)
-      end      
+      end
 
       # Retrieve the very first parse entry added to the chart.
       # This entry corresponds to the start vertex of the GF graph
@@ -225,7 +225,7 @@ END_MSG
       # A notification that the parsing reached an end
       def done()
         # Parse not successful and no reason identified
-        # Assuming that parse failed because of a premature end      
+        # Assuming that parse failed because of a premature end
         premature_end unless success? || failure_reason
       end