rley 0.7.06 → 0.8.01

data/spec/rley/syntax/terminal_spec.rb

@@ -19,18 +19,18 @@ module Rley # Open this namespace to avoid module qualifier prefixes
         it 'should know its name' do
           expect(subject.name).to eq(sample_name)
         end
-        
+
         it 'should know that is a terminal symbol' do
           expect(subject).to be_terminal
-        end        
-        
+        end
+
         it "should know that isn't nullable" do
           expect(subject).not_to be_nullable
         end
-        
+
         it 'should know that it is generative' do
           expect(subject).to be_generative
-        end        
+        end
       end # context
     end # describe
   end # module

data/spec/rley/syntax/verbatim_symbol_spec.rb

@@ -24,7 +24,7 @@ module Rley # Open this namespace to avoid module qualifier prefixes
           expect(subject.text).to eq(sample_name)
         end
       end # context
-      
+
       context 'Provided services:' do
         it 'should give its text representation' do
           expected = "'#{sample_name}'"

data/spec/spec_helper.rb

@@ -3,18 +3,6 @@
 # File: spec_helper.rb
 # Purpose: utility file that is loaded by all our RSpec files
 
-require 'simplecov'
-require 'coveralls'
-
-Coveralls.wear!
-
-SimpleCov.formatter = SimpleCov::Formatter::MultiFormatter.new(
-  [
-    SimpleCov::Formatter::HTMLFormatter,
-    Coveralls::SimpleCov::Formatter
-  ]
-)
-
 require 'pp'    # Use pretty-print for debugging purposes
 require 'rspec' # Use the RSpec framework
 

data/spec/support/base_tokenizer_spec.rb

@@ -25,6 +25,8 @@ describe BaseTokenizer do
 
 
   context 'Provided services:' do
+    # Simplistic tokenizer.
+    # rubocop: disable Lint/ConstantDefinitionInBlock
     class PB_Tokenizer < BaseTokenizer
       @@lexeme2name = {
         '(' => 'LPAREN',
@@ -34,8 +36,9 @@ describe BaseTokenizer do
 
       protected
 
-      def recognize_token()
-        if (lexeme = scanner.scan(/[\(\)]/)) # Single characters
+      # rubocop: disable Lint/DuplicateBranch
+      def recognize_token
+        if (lexeme = scanner.scan(/[()]/)) # Single characters
           # Delimiters, separators => single character token
           build_token(@@lexeme2name[lexeme], lexeme)
         elsif (lexeme = scanner.scan(/(?:\+)(?=\s)/)) # Isolated char
@@ -44,7 +47,9 @@ describe BaseTokenizer do
           build_token('int', lexeme)
         end
       end
+      # rubocop: enable Lint/DuplicateBranch
     end # class
+    # rubocop: enable Lint/ConstantDefinitionInBlock
 
     # Basic tokenizer
     # @return [Array<Rley::Lexical::Token>]

metadata

@@ -1,115 +1,75 @@
 --- !ruby/object:Gem::Specification
 name: rley
 version: !ruby/object:Gem::Version
-  version: 0.7.06
+  version: 0.8.01
 platform: ruby
 authors:
 - Dimitri Geshef
-autorequire: 
+autorequire:
 bindir: bin
 cert_chain: []
-date: 2019-11-22 00:00:00.000000000 Z
+date: 2021-08-22 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
-  name: coveralls
+  name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 0.7.0
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '0.7'
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 0.7.0
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '0.7'
-- !ruby/object:Gem::Dependency
-  name: rake
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
+        version: '10.0'
     - - ">="
       - !ruby/object:Gem::Version
         version: 10.0.0
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '10.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 10.0.0
     - - "~>"
       - !ruby/object:Gem::Version
         version: '10.0'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 10.0.0
 - !ruby/object:Gem::Dependency
   name: rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 3.5.0
     - - "~>"
       - !ruby/object:Gem::Version
         version: '3.5'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 3.5.0
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 3.5.0
     - - "~>"
       - !ruby/object:Gem::Version
         version: '3.5'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 3.5.0
 - !ruby/object:Gem::Dependency
   name: rubygems
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 2.0.0
     - - "~>"
       - !ruby/object:Gem::Version
         version: '2.0'
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
     - - ">="
       - !ruby/object:Gem::Version
         version: 2.0.0
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '2.0'
-- !ruby/object:Gem::Dependency
-  name: simplecov
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 0.1.0
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: '0.1'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: 0.1.0
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '0.1'
+        version: '2.0'
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 2.0.0
 description: A general parser using the Earley algorithm.
 email: famished.tiger@yahoo.com
 executables: []
@@ -120,7 +80,6 @@ files:
 - ".rspec"
 - ".rubocop.yml"
 - ".ruby-gemset"
-- ".simplecov"
 - ".travis.yml"
 - ".yardopts"
 - CHANGELOG.md
@@ -177,8 +136,20 @@ files:
 - lib/rley/gfg/shortcut_edge.rb
 - lib/rley/gfg/start_vertex.rb
 - lib/rley/gfg/vertex.rb
+- lib/rley/interface.rb
 - lib/rley/lexical/token.rb
 - lib/rley/lexical/token_range.rb
+- lib/rley/notation/all_notation_nodes.rb
+- lib/rley/notation/ast_builder.rb
+- lib/rley/notation/ast_node.rb
+- lib/rley/notation/ast_visitor.rb
+- lib/rley/notation/grammar.rb
+- lib/rley/notation/grammar_builder.rb
+- lib/rley/notation/grouping_node.rb
+- lib/rley/notation/parser.rb
+- lib/rley/notation/sequence_node.rb
+- lib/rley/notation/symbol_node.rb
+- lib/rley/notation/tokenizer.rb
 - lib/rley/parse_forest_visitor.rb
 - lib/rley/parse_rep/ast_base_builder.rb
 - lib/rley/parse_rep/cst_builder.rb
@@ -195,11 +166,8 @@ files:
 - lib/rley/parser/parse_entry.rb
 - lib/rley/parser/parse_entry_set.rb
 - lib/rley/parser/parse_entry_tracker.rb
-- lib/rley/parser/parse_state.rb
-- lib/rley/parser/parse_state_tracker.rb
 - lib/rley/parser/parse_tracer.rb
 - lib/rley/parser/parse_walker_factory.rb
-- lib/rley/parser/state_set.rb
 - lib/rley/ptree/non_terminal_node.rb
 - lib/rley/ptree/parse_tree.rb
 - lib/rley/ptree/parse_tree_node.rb
@@ -213,10 +181,11 @@ files:
 - lib/rley/sppf/parse_forest.rb
 - lib/rley/sppf/sppf_node.rb
 - lib/rley/sppf/token_node.rb
+- lib/rley/syntax/base_grammar_builder.rb
 - lib/rley/syntax/grammar.rb
-- lib/rley/syntax/grammar_builder.rb
 - lib/rley/syntax/grm_symbol.rb
 - lib/rley/syntax/literal.rb
+- lib/rley/syntax/match_closest.rb
 - lib/rley/syntax/non_terminal.rb
 - lib/rley/syntax/production.rb
 - lib/rley/syntax/symbol_seq.rb
@@ -244,6 +213,9 @@ files:
 - spec/rley/gfg/vertex_spec.rb
 - spec/rley/lexical/token_range_spec.rb
 - spec/rley/lexical/token_spec.rb
+- spec/rley/notation/grammar_builder_spec.rb
+- spec/rley/notation/parser_spec.rb
+- spec/rley/notation/tokenizer_spec.rb
 - spec/rley/parse_forest_visitor_spec.rb
 - spec/rley/parse_rep/ambiguous_parse_spec.rb
 - spec/rley/parse_rep/ast_builder_spec.rb
@@ -253,16 +225,14 @@ files:
 - spec/rley/parse_rep/parse_forest_factory_spec.rb
 - spec/rley/parse_rep/parse_tree_factory_spec.rb
 - spec/rley/parse_tree_visitor_spec.rb
+- spec/rley/parser/dangling_else_spec.rb
 - spec/rley/parser/error_reason_spec.rb
 - spec/rley/parser/gfg_chart_spec.rb
 - spec/rley/parser/gfg_earley_parser_spec.rb
 - spec/rley/parser/gfg_parsing_spec.rb
 - spec/rley/parser/parse_entry_set_spec.rb
 - spec/rley/parser/parse_entry_spec.rb
-- spec/rley/parser/parse_state_spec.rb
-- spec/rley/parser/parse_tracer_spec.rb
 - spec/rley/parser/parse_walker_factory_spec.rb
-- spec/rley/parser/state_set_spec.rb
 - spec/rley/ptree/non_terminal_node_spec.rb
 - spec/rley/ptree/parse_tree_node_spec.rb
 - spec/rley/ptree/parse_tree_spec.rb
@@ -277,13 +247,15 @@ files:
 - spec/rley/support/grammar_arr_int_helper.rb
 - spec/rley/support/grammar_b_expr_helper.rb
 - spec/rley/support/grammar_helper.rb
+- spec/rley/support/grammar_int_seq_helper.rb
 - spec/rley/support/grammar_l0_helper.rb
 - spec/rley/support/grammar_pb_helper.rb
 - spec/rley/support/grammar_sppf_helper.rb
-- spec/rley/syntax/grammar_builder_spec.rb
+- spec/rley/syntax/base_grammar_builder_spec.rb
 - spec/rley/syntax/grammar_spec.rb
 - spec/rley/syntax/grm_symbol_spec.rb
 - spec/rley/syntax/literal_spec.rb
+- spec/rley/syntax/match_closest_spec.rb
 - spec/rley/syntax/non_terminal_spec.rb
 - spec/rley/syntax/production_spec.rb
 - spec/rley/syntax/symbol_seq_spec.rb
@@ -307,15 +279,15 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: 2.3.0
+      version: 2.5.0
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.0.3
-signing_key: 
+rubygems_version: 3.1.4
+signing_key:
 specification_version: 4
 summary: Ruby implementation of the Earley's parsing algorithm
 test_files:
@@ -340,16 +312,17 @@ test_files:
 - spec/rley/gfg/vertex_spec.rb
 - spec/rley/lexical/token_range_spec.rb
 - spec/rley/lexical/token_spec.rb
+- spec/rley/notation/grammar_builder_spec.rb
+- spec/rley/notation/parser_spec.rb
+- spec/rley/notation/tokenizer_spec.rb
+- spec/rley/parser/dangling_else_spec.rb
 - spec/rley/parser/error_reason_spec.rb
 - spec/rley/parser/gfg_chart_spec.rb
 - spec/rley/parser/gfg_earley_parser_spec.rb
 - spec/rley/parser/gfg_parsing_spec.rb
 - spec/rley/parser/parse_entry_set_spec.rb
 - spec/rley/parser/parse_entry_spec.rb
-- spec/rley/parser/parse_state_spec.rb
-- spec/rley/parser/parse_tracer_spec.rb
 - spec/rley/parser/parse_walker_factory_spec.rb
-- spec/rley/parser/state_set_spec.rb
 - spec/rley/parse_forest_visitor_spec.rb
 - spec/rley/parse_rep/ambiguous_parse_spec.rb
 - spec/rley/parse_rep/ast_builder_spec.rb
@@ -366,10 +339,11 @@ test_files:
 - spec/rley/sppf/alternative_node_spec.rb
 - spec/rley/sppf/non_terminal_node_spec.rb
 - spec/rley/sppf/token_node_spec.rb
-- spec/rley/syntax/grammar_builder_spec.rb
+- spec/rley/syntax/base_grammar_builder_spec.rb
 - spec/rley/syntax/grammar_spec.rb
 - spec/rley/syntax/grm_symbol_spec.rb
 - spec/rley/syntax/literal_spec.rb
+- spec/rley/syntax/match_closest_spec.rb
 - spec/rley/syntax/non_terminal_spec.rb
 - spec/rley/syntax/production_spec.rb
 - spec/rley/syntax/symbol_seq_spec.rb

data/.simplecov

@@ -1,7 +0,0 @@
-# .simplecov
-# Configuration
-
-SimpleCov.start do
-  # Remove all files that match /spec/ in their path
-  add_filter "/spec/"
-end

data/lib/rley/parser/parse_state.rb

@@ -1,83 +0,0 @@
-# frozen_string_literal: true
-
-module Rley # This module is used as a namespace
-  module Parser # This module is used as a namespace
-    class ParseState
-      attr_reader(:dotted_rule)
-
-      # the position in the input that matches the beginning of the rhs
-      # of the production.
-      attr_reader(:origin)
-
-      def initialize(aDottedRule, theOrigin)
-        @dotted_rule = valid_dotted_rule(aDottedRule)
-        @origin = theOrigin
-      end
-
-      # Equality comparison. A parse state behaves as a value object.
-      def ==(other)
-        return true if equal?(other)
-
-        result = (dotted_rule == other.dotted_rule) &&
-                 (origin == other.origin)
-
-        return result
-      end
-
-      # Returns true if the dot is at the end of the rhs of the production.
-      # In other words, the complete rhs matches the input.
-      def complete?()
-        return dotted_rule.reduce_item?
-      end
-
-      # Returns true if the dot is at the start of the rhs of the production.
-      def predicted?()
-        return dotted_rule.predicted_item?
-      end
-
-      # Next expected symbol in the production
-      def next_symbol()
-        return dotted_rule.next_symbol
-      end
-
-      # Does this parse state have the 'other' as successor?
-      def precedes?(other)
-        return false if other == self
-
-        return false unless origin == other.origin
-
-        other_production = other.dotted_rule.production
-        return false unless dotted_rule.production == other_production
-
-        prev_position = other.dotted_rule.prev_position
-        result = if prev_position.nil?
-                   false
-                 else
-                   dotted_rule.position == prev_position
-                 end
-
-        return result
-      end
-
-      # Give a String representation of itself.
-      # The format of the text representation is
-      # "format of dotted rule" + " | " + origin
-      # @return [String]
-      def to_s()
-        return dotted_rule.to_s + " | #{origin}"
-      end
-
-
-      private
-
-      # Return the validated dotted item(rule)
-      def valid_dotted_rule(aDottedRule)
-        raise StandardError, 'Dotted item cannot be nil' if aDottedRule.nil?
-
-        return aDottedRule
-      end
-    end # class
-  end # module
-end # module
-
-# End of file