rley 0.5.10 → 0.5.11

data/lib/rley/parser/parse_walker_factory.rb

@@ -113,7 +113,6 @@ module Rley # This module is used as a namespace
       # [event, entry, index, vertex]
       def visit_entry(anEntry, aContext)
         index = aContext.entry_set_index
-
         aContext.nterm2start[[anEntry, index]] if anEntry.start_entry?
 
         if aContext.visitees.include?(anEntry) # Already visited?...

data/lib/rley/syntax/grm_symbol.rb

@@ -13,7 +13,9 @@ module Rley # This module is used as a namespace
       # Constructor.
       # aName [String] The name of the grammar symbol.
       def initialize(aName)
+        raise 'Internal error: nil name encountered' if aName.nil?
         @name = aName.dup
+        @name.freeze
       end
 
       # The String representation of the grammar symbol

data/lib/rley/syntax/production.rb

@@ -19,7 +19,7 @@ module Rley # This module is used as a namespace
       # @return [String] The unique name of the production rule.
       attr_accessor(:name)
       
-      # @return [Boolean ]A production is generative when all of its 
+      # @return [Boolean] A production is generative when all of its 
       # rhs members are generative (that is, they can each generate/derive
       # a non-empty string of terminals).
       attr_writer(:generative)      
@@ -38,7 +38,7 @@ module Rley # This module is used as a namespace
       end
 
       # Is the rhs empty?
-      # @ return true if the rhs has no members.
+      # @return [Boolean] true if the rhs has no members.
       def empty?()
         return rhs.empty?
       end
@@ -49,7 +49,19 @@ module Rley # This module is used as a namespace
         end
         
         return @generative
-      end      
+      end
+
+      # Returns a string containing a human-readable representation of the 
+      # production.
+      # @return [String]
+      def inspect()
+        result = "#<#{self.class.name}:#{self.object_id}"
+        result << " @name=\"#{self.name}\""
+        result << " @lhs=#{lhs.name}"
+        result << " @rhs=#{rhs.inspect}"
+        result << " @generative=#{@generative}>"
+        return result
+      end
 
       private
 

data/lib/rley/syntax/symbol_seq.rb

@@ -7,14 +7,19 @@ module Rley # This module is used as a namespace
       extend Forwardable
       def_delegators :@members, :empty?, :size, :[], :each, :find, :map
 
-      # The sequence of symbols
+      # @return [Array<GrmSymbol>] The sequence of symbols
       attr_reader(:members)
 
+      # Create a sequence of grammar symbols (as in right-hand side of 
+      # a production rule).
+      # @param theSymbols [Array<GrmSymbol>] An array of symbols.      
       def initialize(theSymbols)
         @members = theSymbols.dup
       end
 
       # Equality operator.
+      # @param other [SymbolSeq|Array]
+      # @return [Boolean]
       def ==(other)
         return true if other.object_id == object_id
 
@@ -29,6 +34,16 @@ module Rley # This module is used as a namespace
         return result
       end
       
+      # Returns a string containing a human-readable representation of the 
+      # sequence of symbols.
+      # @return [String]
+      def inspect()
+        result = "#<#{self.class.name}:#{self.object_id}"
+        symbol_names = self.members.map(&:name)
+        result << " @members=#{symbol_names}>"
+        return result
+      end
+      
       
     end # class
   end # module

data/spec/rley/gfg/end_vertex_spec.rb

@@ -1,4 +1,5 @@
 require_relative '../../spec_helper'
+require_relative '../../../lib/rley/syntax/non_terminal'
 
 # Load the class under test
 require_relative '../../../lib/rley/gfg/end_vertex'
@@ -6,7 +7,7 @@ require_relative '../../../lib/rley/gfg/end_vertex'
 module Rley # Open this namespace to avoid module qualifier prefixes
   module GFG # Open this namespace to avoid module qualifier prefixes
     describe EndVertex do
-      let(:sample_nt) { double('NT') }
+      let(:sample_nt) { Syntax::NonTerminal.new('NT') }
       subject { EndVertex.new(sample_nt) }
 
       context 'Initialization:' do
@@ -19,6 +20,13 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           expect(subject.label).to eq('NT.')
         end
       end # context
+
+      context 'Provided services:' do       
+        it 'should provide human-readable representation of itself' do
+          pattern = /^#<Rley::GFG::EndVertex:\d+ label="NT\."/         
+          expect(subject.inspect).to match(pattern)       
+        end        
+      end # context      
     end # describe
   end # module
 end # module

data/spec/rley/gfg/grm_flow_graph_spec.rb

@@ -197,6 +197,15 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           expect(result).to eq(expected)
         end
         
+        it 'should provide human-readable representation of itself' do
+          prefix = /^#<Rley::GFG::GrmFlowGraph:\d+ @vertices=\[/
+          expect(subject.inspect).to match(prefix)
+          pattern = /@vertices=\[#<Rley::GFG::StartVertex:\d+ label="\.S"/          
+          expect(subject.inspect).to match(pattern)
+          suffix = /]>$/          
+          expect(subject.inspect).to match(suffix)          
+        end        
+        
         it 'should perform a diagnosis of a correct grammar' do
           expect { subject.diagnose }.not_to raise_error
           grammar_abc.non_terminals.each do |nterm|

data/spec/rley/gfg/item_vertex_spec.rb

@@ -117,6 +117,15 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           expect { subject.shortcut = 'invalid' }.to raise_error(err, err_msg)
         end        
       end # context
+
+      context 'Provided services:' do
+        it 'should provide human-readable representation of itself' do
+          prefix = /^#<Rley::GFG::ItemVertex:\d+/           
+          expect(subject.inspect).to match(prefix)
+          suffix = /label="sentence => a \. b_sequence c">$/        
+          expect(subject.inspect).to match(suffix)            
+        end        
+      end # context
     end # describe
   end # module
 end # module

data/spec/rley/gfg/start_vertex_spec.rb

@@ -1,4 +1,5 @@
 require_relative '../../spec_helper'
+require_relative '../../../lib/rley/syntax/non_terminal'
 
 # Load the class under test
 require_relative '../../../lib/rley/gfg/start_vertex'
@@ -6,7 +7,7 @@ require_relative '../../../lib/rley/gfg/start_vertex'
 module Rley # Open this namespace to avoid module qualifier prefixes
   module GFG # Open this namespace to avoid module qualifier prefixes
     describe StartVertex do
-      let(:sample_nt) { double('NT') }
+      let(:sample_nt) { Syntax::NonTerminal.new('NT') }
       subject { StartVertex.new(sample_nt) }
 
       context 'Initialization:' do
@@ -19,6 +20,13 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           expect(subject.label).to eq('.NT')
         end
       end # context
+      
+      context 'Provided services:' do       
+        it 'should provide human-readable representation of itself' do
+          pattern = /^#<Rley::GFG::StartVertex:\d+ label="\.NT"/         
+          expect(subject.inspect).to match(pattern)       
+        end        
+      end # context
     end # describe
   end # module
 end # module

data/spec/rley/parser/gfg_parsing_spec.rb

@@ -319,7 +319,6 @@ SNIPPET
 
         it 'should build a parse forest' do
           expect { subject.parse_forest }.not_to raise_error
-          
         end
 =begin
         it 'should create the root of a parse forest' do

data/spec/rley/parser/parse_entry_set_spec.rb

@@ -90,6 +90,21 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           subject.push_entry(entry3)
           expect(subject.entries4n_term(nt_rep_c)).to eq([entry3])
         end
+        
+        it 'should provide human-readable representation of itself' do
+          # Case 1: empty set
+          pattern_empty = /^#<Rley::Parser::ParseEntrySet:\d+ @entries=\[\]>$/
+          expect(subject.inspect).to match(pattern_empty)
+          
+          # Case 2: non-empty set
+          subject.push_entry(entry1)
+          prefix = /^#<Rley::Parser::ParseEntrySet:\d+ @entries=\[#<Rley/
+          expect(subject.inspect).to match(prefix)
+          pattern_entry = /ParseEntry:\d+ @vertex=<Rley::GFG::ItemVertex:\d+/          
+          expect(subject.inspect).to match(pattern_entry)
+          suffix = /=> a \. b b Repetition> @origin=2 @antecedents=\[\]>\]>$/
+          expect(subject.inspect).to match(suffix)          
+        end
 
 =begin
         it 'should list of ambiguous states' do

data/spec/rley/parser/parse_entry_spec.rb

@@ -26,14 +26,14 @@ module Rley # Open this namespace to avoid module qualifier prefixes
 
       let(:dotted_rule) { Base::DottedItem.new(sample_prod, 2) }
       let(:origin_val) { 3 }
-      let(:vertex_faked) { double('fake-vertex') }
+      let(:sample_vertex) { GFG::StartVertex.new(nt_sentence) }
       let(:vertex2) { double('vertex-mock') }
       # Default instantiation rule
-      subject { ParseEntry.new(vertex_faked, origin_val) }
+      subject { ParseEntry.new(sample_vertex, origin_val) }
 
       context 'Initialization:' do
         it 'should be created with a vertex and an origin position' do
-          args = [vertex_faked, origin_val]
+          args = [sample_vertex, origin_val]
           expect { ParseEntry.new(*args) }.not_to raise_error
         end
 
@@ -44,7 +44,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
         end
 
         it 'should know the vertex' do
-          expect(subject.vertex).to eq(vertex_faked)
+          expect(subject.vertex).to eq(sample_vertex)
         end
 
         it 'should know the origin value' do
@@ -64,23 +64,23 @@ module Rley # Open this namespace to avoid module qualifier prefixes
         end
 
         it 'should compare with another' do
-          equal = ParseEntry.new(vertex_faked, origin_val)
+          equal = ParseEntry.new(sample_vertex, origin_val)
           expect(subject == equal).to eq(true)
 
           # Same vertex, different origin
-          diff_origin = ParseEntry.new(vertex_faked, 2)
+          diff_origin = ParseEntry.new(sample_vertex, 2)
           expect(subject == diff_origin).to eq(false)
 
           # Different vertices, same origin
-          diff_vertex = ParseEntry.new(double('other_vertex_faked'), 3)
+          diff_vertex = ParseEntry.new(double('other_sample_vertex'), 3)
           expect(subject == diff_vertex).to eq(false)
         end
 
         it 'should know if the vertex is a start vertex' do
-          expect(subject).not_to be_start_entry
+          expect(subject).to be_start_entry
 
-          instance = ParseEntry.new(GFG::StartVertex.new('.NT'), 3)
-          expect(instance).to be_start_entry
+          instance = ParseEntry.new(GFG::EndVertex.new('.NT'), 3)
+          expect(instance).not_to be_start_entry
         end
 
         it 'should know if the vertex is an end vertex' do
@@ -191,13 +191,24 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           expect(subject.antecedents).to eql([antecedent])
           expect(subject).not_to be_orphan
         end
-=begin
 
         it 'should know its text representation' do
-          expected = 'sentence => A B . C | 3'
+          expected = '.sentence | 3'
           expect(subject.to_s).to eq(expected)
         end
-=end
+        
+        it 'should be inspectable' do
+          subject.add_antecedent(subject) # Cheat for the good cause...
+          expected = '.sentence | 3'
+          prefix = /^#<Rley::Parser::ParseEntry:\d+ @vertex/
+          expect(subject.inspect).to match(prefix)
+          pattern = /@vertex=<Rley::GFG::StartVertex:\d+ label=\.sentence/
+          expect(subject.inspect).to match(pattern)
+          pattern2 = /@origin=3 @antecedents=\[/
+          expect(subject.inspect).to match(pattern2)
+          suffix = /<Rley::GFG::StartVertex:\d+ label=\.sentence> @origin=3\]>$/
+          expect(subject.inspect).to match(suffix)          
+        end        
       end # context
     end # describe
   end # module

data/spec/rley/parser/parse_tracer_spec.rb

@@ -18,7 +18,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
 
       let(:token_seq) do
         literals = %w[I saw John with a dog]
-        literals.map { |lexeme| Lexical::Token.new(lexeme, nil) }
+        literals.map { |lexeme| Lexical::Token.new(lexeme, double('fake-terminal')) }
       end
 
       subject { ParseTracer.new(1, output, token_seq) }

data/spec/rley/syntax/production_spec.rb

@@ -59,6 +59,16 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           subject.name = a_name
           expect(subject.name).to eq(a_name)
         end
+        
+        it 'should provide human-readable representation of itself' do
+          subject.name = 'some name'
+          prefix = /^#<Rley::Syntax::Production:\d+ @name="some name"/
+          expect(subject.inspect).to match(prefix)
+          pattern = /@lhs=Sentence @rhs=#<Rley::Syntax::SymbolSeq/          
+          expect(subject.inspect).to match(pattern)
+          suffix = /> @generative=>$/          
+          expect(subject.inspect).to match(suffix)          
+        end        
       end # context
     end # describe
   end # module

data/spec/rley/syntax/symbol_seq_spec.rb

@@ -61,6 +61,11 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           msg = 'Cannot compare a SymbolSeq with a String'
           expect { subject == 'dummy-text' }.to raise_error(err, msg)
         end
+        
+        it 'should provide human-readable representation of itself' do
+          suffix = /::SymbolSeq:\d+ @members=\["Verb", "NP", "PP"\]>$/
+          expect(subject.inspect).to match(suffix)
+        end
       end # context
     end # describe
   end # module

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rley
 version: !ruby/object:Gem::Version
-  version: 0.5.10
+  version: 0.5.11
 platform: ruby
 authors:
 - Dimitri Geshef
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-12-02 00:00:00.000000000 Z
+date: 2018-01-25 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: coveralls
@@ -131,6 +131,7 @@ files:
 - Rakefile
 - appveyor.yml
 - examples/NLP/benchmark_pico_en.rb
+- examples/NLP/engtagger.rb
 - examples/NLP/nano_eng/nano_en_demo.rb
 - examples/NLP/nano_eng/nano_grammar.rb
 - examples/NLP/pico_en_demo.rb
@@ -147,17 +148,22 @@ files:
 - examples/general/SRL/lib/grammar.rb
 - examples/general/SRL/lib/parser.rb
 - examples/general/SRL/lib/regex/abstract_method.rb
+- examples/general/SRL/lib/regex/alternation.rb
 - examples/general/SRL/lib/regex/atomic_expression.rb
 - examples/general/SRL/lib/regex/char_class.rb
 - examples/general/SRL/lib/regex/char_range.rb
+- examples/general/SRL/lib/regex/char_shorthand.rb
 - examples/general/SRL/lib/regex/character.rb
 - examples/general/SRL/lib/regex/compound_expression.rb
+- examples/general/SRL/lib/regex/concatenation.rb
 - examples/general/SRL/lib/regex/expression.rb
 - examples/general/SRL/lib/regex/monadic_expression.rb
 - examples/general/SRL/lib/regex/multiplicity.rb
+- examples/general/SRL/lib/regex/non_capturing_group.rb
 - examples/general/SRL/lib/regex/polyadic_expression.rb
 - examples/general/SRL/lib/regex/quantifiable.rb
 - examples/general/SRL/lib/regex/repetition.rb
+- examples/general/SRL/lib/regex/wildcard.rb
 - examples/general/SRL/lib/regex_repr.rb
 - examples/general/SRL/lib/tokenizer.rb
 - examples/general/SRL/spec/integration_spec.rb
@@ -181,6 +187,8 @@ files:
 - examples/general/calc_iter2/calc_lexer.rb
 - examples/general/calc_iter2/calc_parser.rb
 - examples/general/calc_iter2/spec/calculator_spec.rb
+- examples/general/left.rb
+- examples/general/right.rb
 - lib/rley.rb
 - lib/rley/base/base_parser.rb
 - lib/rley/base/dotted_item.rb