rley 0.0.04 → 0.0.05

checksums.yaml

@@ -1,15 +1,15 @@
 ---
 !binary "U0hBMQ==":
   metadata.gz: !binary |-
-    ODc2MTFmNTM3MjNjNTEyMzYzOWNmNmQ1OGM0NDUwNGFiNjViYzEyMw==
+    ZTEwY2E4YWQ0MDgwMmE0MTFjMjBmOGQ0OWUwYjI5ZjZjMWU2MDNjMw==
   data.tar.gz: !binary |-
-    YjA5ZWUzYzczYzJhODQxMmM3MDJhNzYzMTA0NWRjNmNkNWYyOTFiNA==
+    MjkzZGJjMjM3MmIyZDY0ZjRmZjU2ZTEzNzM2NDRmNzE5MGNhZTU3ZA==
 !binary "U0hBNTEy":
   metadata.gz: !binary |-
-    YTBmMGU1NWIxYjhlODQ2YmNkZWQyYmIwZGZiNDQzNGExNGI0ZjgwNjZmYjNi
-    NmZmZDNkOWZkNjE5NmI4ZjE0ZjJkZmIwNzUxOWIxNzUxZDI0ZWRlZWJjZWI1
-    NjM0NGM3NGM0NmI5N2QzNjBhNjExNjRmMWM4MDJkZmFiMDE5ZTQ=
+    MzRmMTAxMzcyZmJkZjNiYTYxNGYxOTQ1M2YzNDRmOTcyZGEzODVjYWZhOGE2
+    MTQxYjQ2YWMxZGMzN2E3NjRjZjhjNmI2MzljOGIwMzcxNGY1ZDg2MGM0YTA5
+    YzZmZjBiODMwMzk0YmY4OTQ4NjRhNGNjMWJjZTRlNjU5Y2NiNjY=
   data.tar.gz: !binary |-
-    MWQyYjUzMzVmZjRlNDE4ZGZmODMwNmNkNWQ4ODZhM2U5NGFhM2ZmNzM4MjQ3
-    MDI3M2JlMWFiNDNiN2VlNTYxYTE3YWZlZTFiYzFkYTViMmFhMjlmMzk2OGY1
-    MDY3NjI4M2Y0NDE3MTQ2ODI2OTU3MjJhYTg4YjJmYjU2NmZlMzk=
+    ZDAzM2I1ZDNjMWRjNWEyMGNhMWYwNmUzNTdiNzE3NDYzMzVlMzdiYjFiYzUx
+    Y2I0MGY2MjU2MDg5ZDIxOGI5NjViOWExMDhkZGIyZTc0NmQ4ODVlOTJlYWQx
+    ODU0NGRhZDZmNDA1MTdmMzE1Y2Q3OTY3MmMxZDM4Y2NlYmI3YWQ=

data/lib/rley/constants.rb

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

data/lib/rley/parser/chart.rb

@@ -9,7 +9,7 @@ module Rley # This module is used as a namespace
       attr_reader(:state_sets)
 
       def initialize(startDottedItem, tokenCount)
-        @state_sets = Array.new(tokenCount + 1) {|_| StateSet.new }
+        @state_sets = Array.new(tokenCount + 1) { |_| StateSet.new }
         push_state(startDottedItem, 0, 0)
       end
 
@@ -30,10 +30,8 @@ module Rley # This module is used as a namespace
         new_state = ParseState.new(aDottedItem, anOrigin)
         self[anIndex].push_state(new_state)
       end
-
     end # class
-
   end # module
 end # module
 
-# End of file
+# End of file

data/lib/rley/parser/dotted_item.rb

@@ -1,5 +1,4 @@
 module Rley # This module is used as a namespace
-
   # A dotted item is a parse state for a given production/grammar rule
   # It partitions the rhs of the rule in two parts.
   # The left part consists of the symbols in the rules that are matched
@@ -37,7 +36,7 @@ module Rley # This module is used as a namespace
 
     # An item with the dot at the beginning is called 
     # predicted item  
-    alias :predicted_item? :at_start?
+    alias_method :predicted_item?, :at_start?
 
     # A dotted item is called a reduce item if the dot is at the end.
     def reduce_item?()
@@ -52,7 +51,7 @@ module Rley # This module is used as a namespace
     # Return the symbol after the dot.
     # nil is returned if the dot is at the end
     def next_symbol()
-      result = (position < 0) ? nil : production.rhs[position]
+      return (position < 0) ? nil : production.rhs[position]
     end
 
     # An item with the dot in front of a terminal is called a shift item
@@ -79,7 +78,6 @@ module Rley # This module is used as a namespace
       return index
     end
   end # class
-
 end # module
 
 # End of file

data/lib/rley/parser/earley_parser.rb

@@ -4,7 +4,6 @@ require_relative 'parsing'
 
 module Rley # This module is used as a namespace
   module Parser # This module is used as a namespace
-
     # Implementation of a parser that uses the Earley parsing algorithm.
     class EarleyParser
       # The grammar of the language.
@@ -113,8 +112,8 @@ module Rley # This module is used as a namespace
       # 'pos':
       # For each production with 'nt' as lhs, retrieve their corresponding
       # initial dotted rules nt -> . xxxx
-      # For retrieved dotted rule, add a parse state to the chart entry at 'pos':
-      #   <initial dotted rule, pos, pos>
+      # For retrieved dotted rule, add a parse state to the chart entry 
+      # at 'pos': <initial dotted rule, pos, pos>
       # In short, one adds states to chart[pos], one per production that
       # specifies how to reduce some input into the predicted nt (non-terminal)
       # A prediction corresponds to a potential expansion of a nonterminal 
@@ -149,29 +148,27 @@ module Rley # This module is used as a namespace
       #   immediately follows a dot 
       # @param aPosition [Fixnum] position in the input token sequence.
       def scanning(aParsing, aTerminal, aPosition)
-        aParsing.scanning(aTerminal, aPosition) { |item|
+        aParsing.scanning(aTerminal, aPosition) do |item|
           next_mapping[item]
-        }
+        end
       end
-      
 
-      # This method is called when a parse state at chart entry reaches the end
-      # of a production.
-      # For every state in chart[aPosition] that is complete (i.e. of the form:
-      #   { dotted_rule: X -> γ •, origin: j}),
-      # Find states s in chart[j] of the form {dotted_rule: Y -> α • X β, origin: i}
+      # This method is called when a parse state at chart entry reaches 
+      # the end of a production.
+      # For every state in chart[aPosition] that is 
+      # complete (i.e. of the form: { dotted_rule: X -> γ •, origin: j}),
+      # Find states s in chart[j] of the 
+      #  form {dotted_rule: Y -> α • X β, origin: i}
       #   In other words, rules that predicted the non-terminal X.
       # For each s, add to chart[aPosition] a state of the form
       #   { dotted_rule: Y → α X • β, origin: i})
       def completion(aParsing, aState, aPosition)
-        aParsing.completion(aState, aPosition) { |item|
+        aParsing.completion(aState, aPosition) do |item|
           next_mapping[item]
-        }
+        end
       end
-
     end # class
-
   end # module
 end # module
 
-# End of file
+# End of file

data/lib/rley/parser/parse_state.rb

@@ -1,6 +1,5 @@
 module Rley # This module is used as a namespace
   module Parser # This module is used as a namespace
-
     class ParseState
       attr_reader(:dotted_rule)
 
@@ -15,7 +14,7 @@ module Rley # This module is used as a namespace
 
       # Equality comparison. A parse state behaves as a value object.
       def ==(other)
-        return true if self.object_id == other.object_id
+        return true if object_id == other.object_id
 
         if (dotted_rule == other.dotted_rule) && (origin == other.origin)
           result = true
@@ -45,10 +44,8 @@ module Rley # This module is used as a namespace
         
         return aDottedRule
       end
-
     end # class
-
   end # module
 end # module
 
-# End of file
+# End of file

data/lib/rley/parser/parsing.rb

@@ -2,10 +2,9 @@ require_relative 'chart'
 
 module Rley # This module is used as a namespace
   module Parser # This module is used as a namespace
-
     class Parsing
       attr_reader(:chart)
-      
+
       # The sequence of input token to parse
       attr_reader(:tokens)
 
@@ -13,7 +12,7 @@ module Rley # This module is used as a namespace
         @tokens = theTokens.dup
         @chart = Chart.new(startDottedRule, tokens.size)
       end
-      
+
       # Return true if the parse was successful (= input tokens
       # followed the syntax specified by the grammar)
       def success?()
@@ -21,14 +20,14 @@ module Rley # This module is used as a namespace
         # The last chart entry has a parse state
         # that involves the start production and
         # has a dot positioned at the end of its rhs.
-        
+
         start_dotted_rule = chart.start_dotted_rule
         start_production = start_dotted_rule.production
         last_chart_entry = chart.state_sets.last
         candidate_states = last_chart_entry.states_for(start_production)
         found = candidate_states.find(&:complete?)
-        
-        return ! found.nil?
+
+        return !found.nil?
       end
 
 
@@ -40,23 +39,22 @@ module Rley # This module is used as a namespace
       end
 
 
-      # This method is called when a parse state for chart entry at position 
+      # This method is called when a parse state for chart entry at position
       # 'pos' expects a terminal as next symbol.
       # If the input token matches the terminal symbol then:
       # Retrieve all parse states for chart entry at 'aPosition'
       # that have the given terminal as next symbol.
-      # For each s of the above states, push to chart entry aPosition + 1 
+      # For each s of the above states, push to chart entry aPosition + 1
       # a new state like: <next dotted rule, s.origin, aPosition + 1>
-      # In other words, we place the dotted rules in the next state set 
+      # In other words, we place the dotted rules in the next state set
       # such that the dot appears after terminal.
-      # @param Terminal [Terminal] a terminal symbol that 
-      #   immediately follows a dot 
+      # @param Terminal [Terminal] a terminal symbol that
+      #   immediately follows a dot
       # @param aPosition [Fixnum] position in the input token sequence.
       # @param nextMapping [Proc or Lambda] code to evaluate in order to
       #   determine the "next" dotted rule for a given one.
       def scanning(aTerminal, aPosition, &nextMapping)
         curr_token = tokens[aPosition]
-        
         if curr_token.terminal == aTerminal
           states = states_expecting(aTerminal, aPosition)
           states.each do |s|
@@ -70,12 +68,13 @@ module Rley # This module is used as a namespace
 
       # This method is called when a parse state at chart entry reaches the end
       # of a production.
-      # For every state in chart[aPosition] that is complete (i.e. of the form:
-      #   { dotted_rule: X -> γ •, origin: j}),
-      # Find states s in chart[j] of the form {dotted_rule: Y -> α • X β, origin: i}
-      #   In other words, rules that predicted the non-terminal X.
+      # For every state in chart[aPosition] that is complete 
+      #  (i.e. of the form: { dotted_rule: X -> γ •, origin: j}),
+      # Find states s in chart[j] of the form 
+      #  {dotted_rule: Y -> α • X β, origin: i}
+      #  In other words, rules that predicted the non-terminal X.
       # For each s, add to chart[aPosition] a state of the form
-      #   { dotted_rule: Y → α X • β, origin: i})
+      #  { dotted_rule: Y → α X • β, origin: i})
       def completion(aState, aPosition, &nextMapping)
         curr_origin = aState.origin
         curr_lhs = aState.dotted_rule.lhs
@@ -92,10 +91,8 @@ module Rley # This module is used as a namespace
       def states_expecting(aTerminal, aPosition)
         return chart[aPosition].states_expecting(aTerminal)
       end
-
     end # class
-
   end # module
 end # module
 
-# End of file
+# End of file

data/lib/rley/parser/state_set.rb

@@ -2,7 +2,6 @@ require 'forwardable' # Delegation
 
 module Rley # This module is used as a namespace
   module Parser # This module is used as a namespace
-  
     class StateSet
       extend Forwardable
       def_delegators :states, :empty?, :size, :first, :each
@@ -38,10 +37,7 @@ module Rley # This module is used as a namespace
         # TODO: make it better than linear search
         return states.include?(aState)
       end
-
     end # class
-  
   end # module
 end # module
-
-# End of file
+# End of file

data/lib/rley/parser/token.rb

@@ -3,7 +3,6 @@ require_relative 'dotted_item'
 
 module Rley # This module is used as a namespace
   module Parser # This module is used as a namespace
-
     class Token
       attr_reader(:lexeme)
       attr_reader(:terminal)
@@ -12,10 +11,7 @@ module Rley # This module is used as a namespace
         @lexeme = theLexeme
         @terminal = aTerminal
       end
-
     end # class
-
   end # module
 end # module
-
 # End of file

data/lib/rley/syntax/grammar.rb

@@ -1,6 +1,5 @@
 module Rley # This module is used as a namespace
   module Syntax # This module is used as a namespace
-
     # A grammar specifies the syntax of a language.
     #   Formally, a grammar has:
     #   One start symbol,
@@ -50,10 +49,8 @@ module Rley # This module is used as a namespace
           @symbols << symb
         end
       end
-
     end # class
-
   end # module
 end # module
 
-# End of file
+# End of file

data/lib/rley/syntax/grm_symbol.rb

@@ -1,6 +1,5 @@
 module Rley # This module is used as a namespace
   module Syntax # This module is used as a namespace
-
     # Abstract class for grammar symbols.
     # A grammar symbol is an element that appears in grammar rules.
     class GrmSymbol
@@ -11,7 +10,6 @@ module Rley # This module is used as a namespace
         @name = aName.dup
       end
     end # class
-
   end # module
 end # module
 

data/lib/rley/syntax/literal.rb

@@ -2,7 +2,6 @@ require_relative 'terminal' # Load superclass
 
 module Rley # This module is used as a namespace
   module Syntax # This module is used as a namespace
-
     # A literal is terminal symbol that matches a lexical pattern
     class Literal < Terminal
       # The exact text representation of the word.
@@ -13,7 +12,6 @@ module Rley # This module is used as a namespace
         @pattern = aPattern
       end
     end # class
-
   end # module
 end # module
 

data/lib/rley/syntax/non_terminal.rb

@@ -2,17 +2,13 @@ require_relative 'grm_symbol' # Load superclass
 
 module Rley # This module is used as a namespace
   module Syntax # This module is used as a namespace
-
     # A non-terminal symbol (sometimes called a syntactic variable) represents
     # a composition of terminal or non-terminal symbols
     class NonTerminal < GrmSymbol
-
       def initialize(aName)
         super(aName)
       end
     end # class
-
   end # module
 end # module
-
 # End of file

data/lib/rley/syntax/production.rb

@@ -2,7 +2,6 @@ require_relative 'symbol_seq'
 
 module Rley # This module is used as a namespace
   module Syntax # This module is used as a namespace
-
     # In a context-free grammar, a production is a rule in which
     # its left-hand side (LHS) consists solely of a non-terminal symbol
     # and the right-hand side (RHS) consists of a sequence of symbols.
@@ -10,7 +9,6 @@ module Rley # This module is used as a namespace
     # The rule stipulates that the LHS is equivalent to the RHS,
     # in other words every occurrence of the LHS can be substituted to
     # corresponding RHS.
-    # Implementation note: the object id of the production is taken as its LHS.
     class Production
       # The right-hand side (rhs) consists of a sequence of grammar symbols
       attr_reader(:rhs)
@@ -20,8 +18,8 @@ module Rley # This module is used as a namespace
 
       # Provide common alternate names to lhs and rhs accessors
 
-      alias :body :rhs
-      alias :head :lhs
+      alias_method :body, :rhs
+      alias_method :head, :lhs
 
       def initialize(aNonTerminal, theSymbols)
         @lhs = aNonTerminal
@@ -33,10 +31,8 @@ module Rley # This module is used as a namespace
       def empty?()
         return rhs.empty?
       end
-
     end # class
-
   end # module
 end # module
 
-# End of file
+# End of file

data/lib/rley/syntax/symbol_seq.rb

@@ -2,7 +2,6 @@ require 'forwardable'
 
 module Rley # This module is used as a namespace
   module Syntax # This module is used as a namespace
-
     # A symbol sequence is a suite of grammar symbols
     class SymbolSeq
       extend Forwardable
@@ -17,20 +16,20 @@ module Rley # This module is used as a namespace
 
       # Equality operator.
       def ==(other)
-        return true if other.object_id == self.object_id
+        return true if other.object_id == object_id
 
         case other
-        when SymbolSeq then result = other.members == self.members
-        when Array then result = other == self.members
-        else
-          fail StandardError, "Cannot compare a SymbolSeq with a #{other.class}"
+          when SymbolSeq then result = other.members == members
+          when Array then result = other == members
+          else
+            msg = "Cannot compare a SymbolSeq with a #{other.class}"
+            fail StandardError, msg
         end
 
         return result
       end
     end # class
-
   end # module
 end # module
 
-# End of file
+# End of file