cognita-treetop 1.2.4

data/lib/treetop/runtime/interval_skip_list/node.rb

@@ -0,0 +1,164 @@
+class IntervalSkipList
+  class Node < HeadNode
+    attr_accessor :key
+    attr_reader :markers, :endpoint_of
+
+    def initialize(key, height, path)
+      super(height)
+      @key = key
+      @markers = []
+      @endpoint_of = []
+      update_forward_pointers(path)
+      promote_markers(path)
+    end
+
+    def all_forward_markers
+      markers.flatten
+    end
+
+    def delete(path)
+      0.upto(top_level) do |i|
+        path[i].forward[i] = forward[i]
+      end
+      demote_markers(path)
+    end
+
+    def propagate_length_change(length_change)
+      cur_node = self
+      while cur_node do
+        cur_node.key += length_change
+        cur_node = cur_node.forward[0]
+      end
+    end
+
+    protected
+
+    def update_forward_pointers(path)
+      0.upto(top_level) do |i|
+        forward[i] = path[i].forward[i]
+        path[i].forward[i] = self
+      end
+    end
+
+    def promote_markers(path)
+      promoted = []
+      new_promoted = []
+      0.upto(top_level) do |i|
+        incoming_markers = path[i].forward_markers[i]
+        markers.concat(incoming_markers)
+
+        incoming_markers.each do |marker|
+          if can_be_promoted_higher?(marker, i)
+            new_promoted.push(marker)
+            forward[i].delete_marker_from_path(marker, i, forward[i+1])
+          else
+            forward_markers[i].push(marker)
+          end
+        end
+
+        promoted.each do |marker|
+          if can_be_promoted_higher?(marker, i)
+            new_promoted.push(marker)
+            forward[i].delete_marker_from_path(marker, i, forward[i+1])
+          else
+            forward_markers[i].push(marker)
+          end
+        end
+
+        promoted = new_promoted
+        new_promoted = []
+      end
+    end
+
+
+    def can_be_promoted_higher?(marker, level)
+      level < top_level && forward[level + 1] && forward[level + 1].markers.include?(marker)
+    end
+
+    def delete_marker_from_path(marker, level, terminus)
+      cur_node = self
+      until cur_node == terminus
+        cur_node.forward_markers[level].delete(marker)
+        cur_node.markers.delete(marker)
+        cur_node = cur_node.forward[level]
+      end
+    end
+
+    def demote_markers(path)
+      demote_inbound_markers(path)
+      demote_outbound_markers(path)
+    end
+
+    def demote_inbound_markers(path)
+      demoted = []
+      new_demoted = []
+
+      top_level.downto(0) do |i|
+        incoming_markers = path[i].forward_markers[i].dup
+        incoming_markers.each do |marker|
+          unless forward_node_with_marker_at_or_above_level?(marker, i)
+            path[i].forward_markers[i].delete(marker)
+            new_demoted.push(marker)
+          end
+        end
+
+        demoted.each do |marker|
+          path[i + 1].place_marker_on_inbound_path(marker, i, path[i])
+
+          if forward[i].markers.include?(marker)
+            path[i].forward_markers[i].push(marker)
+          else
+            new_demoted.push(marker)
+          end
+        end
+
+        demoted = new_demoted
+        new_demoted = []
+      end
+    end
+
+    def demote_outbound_markers(path)
+      demoted = []
+      new_demoted = []
+
+      top_level.downto(0) do |i|
+        forward_markers[i].each do |marker|
+          new_demoted.push(marker) unless path[i].forward_markers[i].include?(marker)
+        end
+
+        demoted.each do |marker|
+          forward[i].place_marker_on_outbound_path(marker, i, forward[i + 1])
+          new_demoted.push(marker) unless path[i].forward_markers[i].include?(marker)
+        end
+
+        demoted = new_demoted
+        new_demoted = []
+      end
+    end
+
+    def forward_node_with_marker_at_or_above_level?(marker, level)
+      level.upto(top_level) do |i|
+        return true if forward[i].markers.include?(marker)
+      end
+      false
+    end
+
+    def place_marker_on_outbound_path(marker, level, terminus)
+      cur_node = self
+      until cur_node == terminus
+        cur_node.forward_markers[level].push(marker)
+        cur_node.markers.push(marker)
+        cur_node = cur_node.forward[level]
+      end
+    end
+
+    def place_marker_on_inbound_path(marker, level, terminus)
+      cur_node = self
+      until cur_node == terminus
+        cur_node.forward_markers[level].push(marker)
+        cur_node = cur_node.forward[level]
+        cur_node.markers.push(marker)
+      end
+    end
+  end
+end

data/lib/treetop/runtime/syntax_node.rb

@@ -0,0 +1,72 @@
+module Treetop
+  module Runtime
+    class SyntaxNode
+      attr_reader :input, :interval, :elements
+      attr_accessor :parent
+
+      def initialize(input, interval, elements = nil)
+        @input = input
+        @interval = interval
+        if @elements = elements
+          elements.each do |element|
+            element.parent = self
+          end
+        end
+      end
+
+      def terminal?
+        @elements.nil?
+      end
+
+      def nonterminal?
+        !terminal?
+      end
+
+      def text_value
+        input[interval]
+      end
+
+      def empty?
+	      interval.first == interval.last && interval.exclude_end?
+      end
+
+      def extension_modules
+        local_extensions =
+          class <<self
+            included_modules-Object.included_modules
+          end
+        if local_extensions.size > 0
+          local_extensions
+        else
+          []    # There weren't any; must be a literal node
+        end
+      end
+
+      def inspect(indent="")
+        em = extension_modules
+        interesting_methods = methods-[em.last ? em.last.methods : nil]-self.class.instance_methods
+        im = interesting_methods.size > 0 ? " (#{interesting_methods.join(",")})" : ""
+        tv = text_value
+        tv = "...#{tv[-20..-1]}" if tv.size > 20
+
+        indent +
+        self.class.to_s.sub(/.*:/,'') +
+          em.map{|m| "+"+m.to_s.sub(/.*:/,'')}*"" +
+          " offset=#{interval.first}" +
+          ", #{tv.inspect}" +
+          im +
+          (elements && elements.size > 0 ?
+            ":" +
+              (@elements||[]).map{|e|
+          begin
+            "\n"+e.inspect(indent+"  ")
+          rescue  # Defend against inspect not taking a parameter
+            "\n"+indent+" "+e.inspect
+          end
+              }.join("") :
+            ""
+          )
+      end
+    end
+  end
+end

data/lib/treetop/runtime/terminal_parse_failure.rb

@@ -0,0 +1,16 @@
+module Treetop
+  module Runtime
+    class TerminalParseFailure
+      attr_reader :index, :expected_string
+
+      def initialize(index, expected_string)
+        @index = index
+        @expected_string = expected_string
+      end
+
+      def to_s
+        "String matching #{expected_string} expected."
+      end
+    end
+  end
+end

data/lib/treetop/runtime/terminal_syntax_node.rb

@@ -0,0 +1,17 @@
+module Treetop
+  module Runtime
+    class TerminalSyntaxNode < SyntaxNode
+
+      def initialize(input, interval)
+        super(input, interval, [])
+      end
+
+      def inspect(indent="")
+	indent+
+	  self.class.to_s.sub(/.*:/,'') +
+	  " offset=#{interval.first}" +
+	  " #{text_value.inspect}"
+      end
+    end
+  end
+end

metadata

@@ -0,0 +1,119 @@
+--- !ruby/object:Gem::Specification 
+name: cognita-treetop
+version: !ruby/object:Gem::Version 
+  version: 1.2.4
+platform: ruby
+authors: 
+- Nathan Sobo
+autorequire: treetop
+bindir: bin
+cert_chain: []
+
+date: 2008-08-13 00:00:00 -07:00
+default_executable: 
+dependencies: []
+
+description: 
+email: nathansobo@gmail.com
+executables: 
+- tt
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- README
+- Rakefile
+- lib/treetop.rb
+- lib/treetop
+- lib/treetop/bootstrap_gen_1_metagrammar.rb
+- lib/treetop/compiler.rb
+- lib/treetop/compiler
+- lib/treetop/compiler/grammar_compiler.rb
+- lib/treetop/compiler/lexical_address_space.rb
+- lib/treetop/compiler/metagrammar.rb
+- lib/treetop/compiler/metagrammar.treetop
+- lib/treetop/compiler/node_classes.rb
+- lib/treetop/compiler/node_classes
+- lib/treetop/compiler/node_classes/anything_symbol.rb
+- lib/treetop/compiler/node_classes/atomic_expression.rb
+- lib/treetop/compiler/node_classes/character_class.rb
+- lib/treetop/compiler/node_classes/choice.rb
+- lib/treetop/compiler/node_classes/declaration_sequence.rb
+- lib/treetop/compiler/node_classes/grammar.rb
+- lib/treetop/compiler/node_classes/inline_module.rb
+- lib/treetop/compiler/node_classes/nonterminal.rb
+- lib/treetop/compiler/node_classes/optional.rb
+- lib/treetop/compiler/node_classes/parenthesized_expression.rb
+- lib/treetop/compiler/node_classes/parsing_expression.rb
+- lib/treetop/compiler/node_classes/parsing_rule.rb
+- lib/treetop/compiler/node_classes/predicate.rb
+- lib/treetop/compiler/node_classes/repetition.rb
+- lib/treetop/compiler/node_classes/sequence.rb
+- lib/treetop/compiler/node_classes/terminal.rb
+- lib/treetop/compiler/node_classes/transient_prefix.rb
+- lib/treetop/compiler/node_classes/treetop_file.rb
+- lib/treetop/compiler/ruby_builder.rb
+- lib/treetop/ruby_extensions.rb
+- lib/treetop/ruby_extensions
+- lib/treetop/ruby_extensions/string.rb
+- lib/treetop/runtime.rb
+- lib/treetop/runtime
+- lib/treetop/runtime/compiled_parser.rb
+- lib/treetop/runtime/interval_skip_list.rb
+- lib/treetop/runtime/interval_skip_list
+- lib/treetop/runtime/interval_skip_list/head_node.rb
+- lib/treetop/runtime/interval_skip_list/interval_skip_list.rb
+- lib/treetop/runtime/interval_skip_list/node.rb
+- lib/treetop/runtime/syntax_node.rb
+- lib/treetop/runtime/terminal_parse_failure.rb
+- lib/treetop/runtime/terminal_syntax_node.rb
+- bin/tt
+- doc/contributing_and_planned_features.markdown
+- doc/grammar_composition.markdown
+- doc/index.markdown
+- doc/pitfalls_and_advanced_techniques.markdown
+- doc/semantic_interpretation.markdown
+- doc/site.rb
+- doc/sitegen.rb
+- doc/syntactic_recognition.markdown
+- doc/using_in_ruby.markdown
+- examples/lambda_calculus
+- examples/lambda_calculus/arithmetic.rb
+- examples/lambda_calculus/arithmetic.treetop
+- examples/lambda_calculus/arithmetic_node_classes.rb
+- examples/lambda_calculus/arithmetic_test.rb
+- examples/lambda_calculus/lambda_calculus
+- examples/lambda_calculus/lambda_calculus.rb
+- examples/lambda_calculus/lambda_calculus.treetop
+- examples/lambda_calculus/lambda_calculus_node_classes.rb
+- examples/lambda_calculus/lambda_calculus_test.rb
+- examples/lambda_calculus/test_helper.rb
+has_rdoc: false
+homepage: http://github.com/cognita/treetop
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+  version: 
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.2.0
+signing_key: 
+specification_version: 2
+summary: A Ruby-based text parsing and interpretation DSL
+test_files: []
+