rley 0.2.01 → 0.2.02

data/spec/rley/ptree/non_terminal_node_spec.rb

@@ -1,13 +1,22 @@
+require 'ostruct'
 require_relative '../../spec_helper'
 
+require_relative '../../../lib/rley/ptree/terminal_node'
 # Load the class under test
 require_relative '../../../lib/rley/ptree/non_terminal_node'
 
 module Rley # Open this namespace to avoid module qualifier prefixes
   module PTree # Open this namespace to avoid module qualifier prefixes
     describe NonTerminalNode do
-      let(:sample_symbol) { double('fake-symbol') }
-      let(:sample_range) { double('fake-range') }
+      # Factory method. Generate a range from its boundary values.
+      def range(low, high)
+        return TokenRange.new(low: low, high: high)
+      end
+    
+      let(:sample_symbol) do
+        OpenStruct.new(name: 'VP')
+      end
+      let(:sample_range) { range(0, 3) }
       
       subject { NonTerminalNode.new(sample_symbol, sample_range) }
 
@@ -18,7 +27,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
       end # context
       
       context 'Provided services:' do
-        it 'should accept children' do
+        it 'should accept the addition of children' do
           child1 = double('first_child')
           child2 = double('second_child')
           child3 = double('third_child')
@@ -27,6 +36,36 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           subject.add_child(child3)
           expect(subject.children).to eq([child1, child2, child3])
         end
+        
+        it 'should provide a text representation of itself' do
+          # Case 1: no child
+          expected_text = "VP[0, 3]"
+          expect(subject.to_string(0)).to eq(expected_text)
+          
+          # Case 2: with children
+          child_1_1 = TerminalNode.new(OpenStruct.new(name: 'Verb'), range(0, 1))
+          child_1_2 = NonTerminalNode.new(OpenStruct.new(name: 'NP'), range(1, 3))
+          child_2_1 = TerminalNode.new(OpenStruct.new(name: 'Determiner'), range(1, 2))
+          child_2_2 = NonTerminalNode.new(OpenStruct.new(name: 'Nominal'), range(2, 3))          
+          child_3_1 = TerminalNode.new(OpenStruct.new(name: 'Noun'), range(2, 3))
+          subject.add_child(child_1_1)
+          subject.add_child(child_1_2)
+          child_1_2.add_child(child_2_1)
+          child_1_2.add_child(child_2_2)
+          child_2_2.add_child(child_3_1)
+          child_1_1.token = OpenStruct.new(lexeme: 'catch')
+          child_2_1.token = OpenStruct.new(lexeme: 'that')
+          child_3_1.token = OpenStruct.new(lexeme: 'bus')
+          expected_text = <<-SNIPPET
+VP[0, 3]
++- Verb[0, 1]: 'catch'
++- NP[1, 3]
+   +- Determiner[1, 2]: 'that'
+   +- Nominal[2, 3]
+      +- Noun[2, 3]: 'bus'
+SNIPPET
+          expect(subject.to_string(0)).to eq(expected_text.chomp)
+        end
       end # context
     end # describe
   end # module

data/spec/rley/ptree/terminal_node_spec.rb

@@ -0,0 +1,39 @@
+require 'ostruct'
+require_relative '../../spec_helper'
+
+# Load the class under test
+require_relative '../../../lib/rley/ptree/terminal_node'
+
+module Rley # Open this namespace to avoid module qualifier prefixes
+  module PTree # Open this namespace to avoid module qualifier prefixes
+    describe TerminalNode do
+      let(:sample_symbol) do
+        OpenStruct.new(name: 'Noun')
+      end
+      let(:sample_range) { double('fake-range') }
+      
+      subject { TerminalNode.new(sample_symbol, sample_range) }
+      
+      context 'Initialization:' do
+        it "shouldn't be already bound to a token" do
+          expect(subject.token).to be_nil
+        end
+      end # context
+      
+      context 'Provided services:' do
+        it 'should provide a text representation of itself' do
+          # Case 1: not bound to a token
+          expected_text = "Noun[?, ?]: '(nil)'"
+          expect(subject.to_string(0)).to eq(expected_text)
+          
+          # Case 2: bound to token
+          subject.token = OpenStruct.new(lexeme: 'peace')
+          expected_text = "Noun[?, ?]: 'peace'"
+          expect(subject.to_string(0)).to eq(expected_text)          
+        end
+      end # context
+    end # describe
+  end # module
+end # module
+
+# End of file

data/spec/rley/ptree/token_range_spec.rb

@@ -116,6 +116,51 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           expect(instance.low).to eq(1)
           expect(instance.high).to eq(4)
         end
+        
+        it 'should tell whether an index value lies outside the range' do
+          # Out of range...
+          expect(subject.out_of_range?(-1)).to eq(true)
+          expect(subject.out_of_range?(6)).to eq(true)
+          
+          # On boundaries...
+          expect(subject.out_of_range?(0)).to eq(false)
+          expect(subject.out_of_range?(5)).to eq(false)
+          
+          # Inside boundaries
+          expect(subject.out_of_range?(2)).to eq(false)
+
+          instance = TokenRange.new(low: nil, high: 5)
+          
+          # Lower bound is nil
+          expect(instance.out_of_range?(-1)).to eq(false)
+          expect(instance.out_of_range?(5)).to eq(false)
+          expect(instance.out_of_range?(6)).to eq(true)
+          
+          instance = TokenRange.new(low: 0, high: nil)
+          
+          # Upper bound is nil
+          expect(instance.out_of_range?(-1)).to eq(true)
+          expect(instance.out_of_range?(0)).to eq(false)
+          expect(instance.out_of_range?(6)).to eq(false)
+        end
+        
+        it 'should provide a text representation of itself' do
+          # Case 1: not bound is set
+          instance =  TokenRange.new({})
+          expect(instance.to_string(0)).to eq('[?, ?]') 
+          
+          # Case: only low bound is set
+          instance = TokenRange.new(low: 0)
+          expect(instance.to_string(0)).to eq('[0, ?]') 
+
+          # Case: only upper bound is set
+          instance =  TokenRange.new(high: 5) 
+          expect(instance.to_string(0)).to eq('[?, 5]') 
+
+          # Case: both bounds are set
+          instance =  TokenRange.new(low: 0, high: 5) 
+          expect(instance.to_string(0)).to eq('[0, 5]')            
+        end
       end
     end # describe
   end # module

data/spec/rley/support/ambiguous_grammar_helper.rb

@@ -0,0 +1,36 @@
+# Load the builder class
+require_relative '../../../lib/rley/syntax/grammar_builder'
+require_relative '../../../lib/rley/parser/token'
+
+
+module AmbiguousGrammarHelper
+  # Factory method. Creates a grammar builder for a basic ambiguous
+  # expression grammar.
+  # (based on an example from Fisher and LeBlanc: "Crafting a Compiler")
+  def grammar_builder()
+    builder = Rley::Syntax::GrammarBuilder.new
+    builder.add_terminals('+', 'id')
+    builder.add_production('S' => 'E')
+    builder.add_production('E' => %w(E + E))
+    builder.add_production('E' => 'id')
+    builder
+  end
+  
+  # Basic tokenizing method
+  def tokenize(aText, aGrammar)
+    tokens = aText.scan(/\S+/).map do |lexeme|
+      case lexeme
+        when '+'
+          terminal = aGrammar.name2symbol[lexeme]
+        when /^[_a-zA-Z][_a-zA-Z0-9]*$/
+          terminal = aGrammar.name2symbol['id']
+        else
+          msg = "Unknown input text '#{lexeme}'"
+          fail StandardError, msg
+      end
+      Rley::Parser::Token.new(lexeme, terminal)
+    end
+    
+    return tokens
+  end
+end # module

data/spec/rley/support/grammar_b_expr_helper.rb

@@ -6,7 +6,7 @@ require_relative '../../../lib/rley/parser/token'
 module GrammarBExprHelper
   # Factory method. Creates a grammar builder for a basic arithmetic
   # expression grammar.
-  # (based on example in article on Earley's algorithm in Wikipedia)
+  # (based on the article about Earley's algorithm in Wikipedia)
   def grammar_expr_builder()
     builder = Rley::Syntax::GrammarBuilder.new
     builder.add_terminals('+', '*', 'integer')

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rley
 version: !ruby/object:Gem::Version
-  version: 0.2.01
+  version: 0.2.02
 platform: ruby
 authors:
 - Dimitri Geshef
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-01-03 00:00:00.000000000 Z
+date: 2015-02-02 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake
@@ -102,8 +102,10 @@ files:
 - examples/grammars/grammar_abc.rb
 - examples/grammars/grammar_L0.rb
 - examples/parsers/parsing_abc.rb
+- examples/parsers/parsing_ambig.rb
 - examples/parsers/parsing_b_expr.rb
 - examples/parsers/parsing_L0.rb
+- examples/parsers/parsing_L1.rb
 - examples/recognizers/recognizer_abc.rb
 - lib/rley.rb
 - lib/rley/constants.rb
@@ -148,7 +150,9 @@ files:
 - spec/rley/ptree/non_terminal_node_spec.rb
 - spec/rley/ptree/parse_tree_node_spec.rb
 - spec/rley/ptree/parse_tree_spec.rb
+- spec/rley/ptree/terminal_node_spec.rb
 - spec/rley/ptree/token_range_spec.rb
+- spec/rley/support/ambiguous_grammar_helper.rb
 - spec/rley/support/grammar_abc_helper.rb
 - spec/rley/support/grammar_b_expr_helper.rb
 - spec/rley/syntax/grammar_builder_spec.rb
@@ -207,6 +211,7 @@ test_files:
 - spec/rley/ptree/non_terminal_node_spec.rb
 - spec/rley/ptree/parse_tree_node_spec.rb
 - spec/rley/ptree/parse_tree_spec.rb
+- spec/rley/ptree/terminal_node_spec.rb
 - spec/rley/ptree/token_range_spec.rb
 - spec/rley/syntax/grammar_builder_spec.rb
 - spec/rley/syntax/grammar_spec.rb