walrus 0.2 → 0.3

data/lib/walrus/grammar/additions/proc.rb

@@ -1,26 +0,0 @@
-# Copyright 2007 Wincent Colaiuta
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU General Public License for more details.
-#
-# You should have received a copy of the GNU General Public License
-# along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-require 'walrus'
-
-class Proc
-  
-  include Walrus::Grammar::ParsletCombining
-  
-  # Returns a ProcParslet based on the receiver
-  def to_parseable
-    Walrus::Grammar::ProcParslet.new(self)
-  end
-  
-end # class Proc

data/lib/walrus/grammar/additions/regexp.rb

@@ -1,27 +0,0 @@
-# Copyright 2007 Wincent Colaiuta
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU General Public License for more details.
-#
-# You should have received a copy of the GNU General Public License
-# along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-require 'walrus'
-
-class Regexp
-  
-  require 'walrus/grammar/parslet_combining'
-  include Walrus::Grammar::ParsletCombining
-  
-  # Returns a RegexpParslet based on the receiver
-  def to_parseable
-    Walrus::Grammar::RegexpParslet.new(self)
-  end
-  
-end # class Regexp

data/lib/walrus/grammar/additions/string.rb

@@ -1,58 +0,0 @@
-# Copyright 2007 Wincent Colaiuta
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU General Public License for more details.
-#
-# You should have received a copy of the GNU General Public License
-# along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-require 'walrus'
-
-require 'jindex' # multibyte-friendly implementations of String#index and String#rindex
-
-# Additions to String class for Unicode support.
-class String
-  
-  # Returns an array of Unicode characters.
-  def chars
-    scan(/./m)
-  end
-  
-  alias old_range []
-  
-  # multi-byte friendly [] implementation
-  def [](range, other = Walrus::NoParameterMarker.instance)
-    if other == Walrus::NoParameterMarker.instance
-      if range.kind_of? Range
-        chars[range].join
-      else
-        old_range range
-      end
-    else
-      old_range range, other
-    end
-  end
-  
-  # Returns a character-level enumerator for the receiver.
-  def enumerator
-    Walrus::Grammar::StringEnumerator.new(self)
-  end
-  
-end # class String
-
-class String
-  
-  include Walrus::Grammar::ParsletCombining   # Rationale: it's ok to add "&" and "|" methods to string because they don't exist yet (they're not overrides).
-  
-  # Returns a StringParslet based on the receiver
-  def to_parseable
-    Walrus::Grammar::StringParslet.new(self)
-  end
-  
-end # class String

data/lib/walrus/grammar/additions/symbol.rb

@@ -1,49 +0,0 @@
-# Copyright 2007 Wincent Colaiuta
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU General Public License for more details.
-#
-# You should have received a copy of the GNU General Public License
-# along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-require 'walrus'
-
-class Symbol
-  
-  include Walrus::Grammar::ParsletCombining
-  
-  # Returns a SymbolParslet based on the receiver.
-  # Symbols can be used in Grammars when specifying rules and productions to refer to other rules and productions that have not been defined yet.
-  # They can also be used to allow self-references within rules and productions (recursion); for example:
-  #   rule :thing & :thing.optional & :other_thing
-  # Basically these SymbolParslets allow deferred evaluation of a rule or production (deferred until parsing takes place) rather than being evaluated at the time a rule or production is defined.
-  def to_parseable
-    Walrus::Grammar::SymbolParslet.new(self)
-  end
-  
-  # Dynamically creates a subclass named after the receiver, with parent class superclass, taking params.
-  def build(superclass, *params)    
-    
-    # first use the continuation trick to find out what grammar (namespace) receiver is being messaged in
-    # Ruby 1.9/2.0 will not support continuations, so may need to come up with an alternative
-    continuation  = nil
-    value         = callcc { |c| continuation = c }         
-    if value == continuation                                # first time that we're here
-      raise Walrus::Grammar::ContinuationWrapperException.new(continuation)  # give higher up a chance to help us
-    else # value is the Grammar instance passed to us from higher up using call on the continuation
-      grammar = value
-    end
-    
-    # actually create the subclass
-    grammar.const_get(superclass.to_s.to_class_name.to_s).subclass(self.to_s.to_class_name.to_s, grammar, *params)
-    self
-    
-  end
-  
-end # class Symbol

data/lib/walrus/grammar/and_predicate.rb

@@ -1,46 +0,0 @@
-# Copyright 2007 Wincent Colaiuta
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU General Public License for more details.
-#
-# You should have received a copy of the GNU General Public License
-# along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-require 'walrus'
-
-module Walrus
-  class Grammar
-    
-    class AndPredicate < Predicate
-      
-      def parse(string, options = {})
-        raise ArgumentError if string.nil?
-        catch :ZeroWidthParseSuccess do
-          begin
-            parsed = @parseable.memoizing_parse(string, options)
-          rescue ParseError
-            raise ParseError.new('predicate not satisfied (expected "%s") while parsing "%s"' % [@parseable.to_s, string],
-                                 :line_end => options[:line_start], :column_end => options[:column_start])
-          end
-        end
-        
-        # getting this far means that parsing succeeded (just what we wanted)
-        throw :AndPredicateSuccess # pass succeeded
-      end
-      
-    private
-      
-      def hash_offset
-        12
-      end
-      
-    end
-    
-  end # class Grammar
-end # module Walrus

data/lib/walrus/grammar/array_result.rb

@@ -1,25 +0,0 @@
-# Copyright 2007 Wincent Colaiuta
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU General Public License for more details.
-#
-# You should have received a copy of the GNU General Public License
-# along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-require 'walrus'
-
-module Walrus
-  class Grammar
-    class ArrayResult < Array
-      
-      include LocationTracking
-      
-    end # class ArrayResult
-  end # class Grammar
-end # module Walrus

data/lib/walrus/grammar/continuation_wrapper_exception.rb

@@ -1,34 +0,0 @@
-# Copyright 2007 Wincent Colaiuta
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU General Public License for more details.
-#
-# You should have received a copy of the GNU General Public License
-# along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-require 'walrus'
-
-module Walrus
-  class Grammar
-    
-    class ContinuationWrapperException < Exception
-      
-      attr_reader :continuation
-      
-      def initialize(continuation)
-        raise ArgumentError if continuation.nil?
-        super self.class.to_s
-        @continuation = continuation
-      end
-      
-    end # class ContinuationWrapperException
-    
-  end # class Grammar
-end # module Walrus
-

data/lib/walrus/grammar/left_recursion_exception.rb

@@ -1,33 +0,0 @@
-# Copyright 2007 Wincent Colaiuta
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU General Public License for more details.
-#
-# You should have received a copy of the GNU General Public License
-# along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-require 'walrus'
-
-module Walrus
-  class Grammar
-    
-    class LeftRecursionException < Exception
-      
-      attr_accessor :continuation
-       
-      def initialize(continuation = nil)
-        super self.class.to_s
-        @continuation = continuation
-      end
-      
-    end # class LeftRecursionException
-    
-  end # class Grammar
-end # module Walrus
-

data/lib/walrus/grammar/location_tracking.rb

@@ -1,115 +0,0 @@
-# Copyright 2007 Wincent Colaiuta
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU General Public License for more details.
-#
-# You should have received a copy of the GNU General Public License
-# along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-require 'walrus'
-
-module Walrus
-  class Grammar
-    
-    # Methods for embedding location information in objects returned (or exceptions raised) from parse methods.
-    module LocationTracking
-      
-      attr_reader :source_text
-      
-      # For occasions where a single item must serve as a carrier for array-like information
-      # (that is, its own start, end and source_text, as well as the "outer" equivalents).
-      # This can happen where a single node appears in a list context surrounded only by skipped content.
-      attr_accessor :outer_start, :outer_end, :outer_source_text
-      
-      def source_text=(string)
-        @source_text = string.to_s.clone
-      end
-      
-      # Sets @column_start to col.
-      # Sets @column_start to 0 if passed nil (for ease of use, users of classes that mix-in this module don't have to worry about special casing nil values).
-      def column_start=(column_start)
-        @column_start = column_start.to_i
-      end
-      
-      # Returns 0 if @column_start is nil (for ease of use, users of classes that mix-in this module don't have to worry about special casing nil values).
-      def column_start
-        @column_start || 0
-      end
-      
-      # Sets @line_start to line.
-      # Sets @line_start to 0 if passed nil (for ease of use, users of classes that mix-in this module don't have to worry about special casing nil values).
-      def line_start=(line_start)
-        @line_start = line_start.to_i
-      end
-      
-      # Returns 0 if @line_start is nil (for ease of use, users of classes that mix-in this module don't have to worry about special casing nil values).
-      def line_start
-        @line_start || 0
-      end
-      
-      # Convenience method for getting both line_start and column_start at once.
-      def start
-        [self.line_start, self.column_start]
-      end
-      
-      # Convenience method for setting both line_start and column_start at once.
-      def start=(array)
-        raise ArgumentError if array.nil?
-        raise ArgumentError if array.length != 2
-        self.line_start    = array[0]
-        self.column_start  = array[1]
-      end
-      
-      def line_end=(line_end)
-        @line_end = line_end.to_i
-      end
-      
-      def line_end
-        @line_end || 0
-      end
-      
-      def column_end=(column_end)
-        @column_end = column_end.to_i
-      end
-      
-      def column_end
-        @column_end || 0
-      end
-      
-      # Convenience method for getting both line_end and column_end at once.
-      def end
-        [self.line_end, self.column_end]
-      end
-      
-      # Convenience method for setting both line_end and column_end at once.
-      def end=(array)
-        raise ArgumentError if array.nil?
-        raise ArgumentError if array.length != 2
-        self.line_end   = array[0]
-        self.column_end = array[1]
-      end
-      
-      # Given another object that responds to column_end and line_end, returns true if the receiver is rightmost or equal.
-      # If the other object is farther to the right returns false.
-      def rightmost?(other)
-        if self.line_end > other.line_end
-          true
-        elsif other.line_end > self.line_end
-          false
-        elsif self.column_end >= other.column_end
-          true
-        else
-          false
-        end
-      end
-      
-    end # module LocationTracking
-    
-  end # class Grammar
-end # module Walrus

data/lib/walrus/grammar/match_data_wrapper.rb

@@ -1,71 +0,0 @@
-# Copyright 2007 Wincent Colaiuta
-# This program is free software: you can redistribute it and/or modify
-# it under the terms of the GNU General Public License as published by
-# the Free Software Foundation, either version 3 of the License, or
-# (at your option) any later version.
-#
-# This program is distributed in the hope that it will be useful,
-# but WITHOUT ANY WARRANTY; without even the implied warranty of
-# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-# GNU General Public License for more details.
-#
-# You should have received a copy of the GNU General Public License
-# along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-require 'walrus'
-
-module Walrus
-  class Grammar
-    
-    # Simple wrapper for MatchData objects that implements length, to_s and to_str methods.
-    # By implementing to_str, MatchDataWrappers can be directly compared with Strings using the == method.
-    # The original MatchData instance can be obtained using the match_data accessor.
-    # Upon creation a clone of the passed in MatchData object is stored; this means that the $~ global variable can be conveniently wrapped without having to worry that subsequent operations will alter the contents of the variable.
-    class MatchDataWrapper
-      
-      include Walrus::Grammar::LocationTracking
-      
-      attr_reader :match_data
-      
-      # Raises if data is nil.
-      def initialize(data)
-        raise ArgumentError if data.nil?
-        self.match_data = data
-      end
-      
-      # The definition of this method, in conjunction with the == method, allows automatic comparisons with String objects using the == method.
-      # This is because in a parser matches essentially are Strings (just like Exceptions and Pathnames); it's just that this class encapsulates a little more information (the match data) for those who want it.
-      def to_str
-        self.to_s
-      end
-      
-      # Although this method explicitly allows for MatchDataWrapper to MatchDataWrapper comparisons, not that all such comparisons will return false except for those between instances which were initialized with exactly the same match data instance; this is because the MatchData class itself always returns false when compared with other MatchData instances.
-      def ==(other)
-        if other.kind_of? MatchDataWrapper
-          self.match_data == other.match_data
-        elsif other.respond_to? :to_str
-          self.to_str == other.to_str
-        else
-          false
-        end
-      end
-      
-      def to_s
-        @match_data[0]
-      end
-      
-      def jlength
-        self.to_s.jlength
-      end
-      
-    private
-      
-      def match_data=(data)
-        @match_data = (data.clone rescue data)
-      end
-      
-    end # class MatchDataWrapper
-    
-  end # class Grammar
-end # module Walrus
-