parser_combinator 0.0.3 → 0.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: 3868c0360f7f7a56d60413eacf5ce4e257b45324
-  data.tar.gz: 8345b5a9780a95e5b05aecea7aeb0b331fdcfcd9
+SHA256:
+  metadata.gz: 67329f878af48506d74c9053ee84a35927b05e1b91782dfee376624eee18d415
+  data.tar.gz: f7f732e42c45e23709deb657eb257e841e1aaea40dcc77139730024f5ad992cd
 SHA512:
-  metadata.gz: d09a00160babecd7bbd80570ae526e5997d03ced197a0b81abefa0995f36cb7d8f5ef0a1d86dccd304dcd0fc0cd3d0557f403c787f7a1c8bba9e9f872bc6a6d6
-  data.tar.gz: fdff95bc8692fc4699d29cc534efdc047668dff6f0d0a136560c4fceabfded5fe4c680b4b461feda686c024664cd69ab79ce9a216e6bfcb00e8a4fffa037e491
+  metadata.gz: 75aa1c3a98a3bb230764914eefe28fbaf0dd39afeabe7fd053c363987f99a6b703690398b20d859756a8e81a6983ea8ae294c77d9e811df953bf696bb54ff6ef
+  data.tar.gz: 787d06cb0d7d9ccd8fbeeba6285d725c3b87979eba3d27a11b2e72ed58cd81ed82e1189d3c2d4b2872a7f4cc145ca1914db0b4f7206945bd6b99dba8d509c33d

data/.gitignore

@@ -1,14 +1,14 @@
-/.bundle/
-/.yardoc
-/Gemfile.lock
-/_yardoc/
-/coverage/
-/doc/
-/pkg/
-/spec/reports/
-/tmp/
-*.bundle
-*.so
-*.o
-*.a
-mkmf.log
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log

data/Gemfile

@@ -1,4 +1,4 @@
-source 'https://rubygems.org'
-
-# Specify your gem's dependencies in parser_combinator.gemspec
-gemspec
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in parser_combinator.gemspec
+gemspec

data/LICENSE.txt

@@ -1,22 +1,22 @@
-Copyright (c) 2015 Kensuke Sawada
-
-MIT License
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+Copyright (c) 2015 Kensuke Sawada
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -1,153 +1,153 @@
-# ParserCombinator
-
-Yet another class-base parser combinator (monadic parser) library.
-
-## Installation
-
-Add this line to your application's Gemfile:
-
-```ruby
-gem 'parser_combinator'
-```
-
-And then execute:
-
-    $ bundle
-
-Or install it yourself as:
-
-    $ gem install parser_combinator
-
-## Basics
-
-### Item class
-Abstraction of Char (in Ruby, it is String of 1-length).
-Parsing charactors through this abstraction, you can handle meta-info of source-string such as file-name, line-number, column-number.
-
-### Items class
-Abstraction of String. This is Array of Item.
-
-## Usage
-
-### Basic Example
-```ruby
-require 'parser_combinator/string_parser'
-
-class MyParser < ParserCombinator::StringParser
-  parser :noun do
-    str("I") | str("you") | str("it")
-  end
-
-  parser :verb do
-    str("love") | str("hate") | str("live") | str("die")
-  end
-
-  parser :token do |p|
-    many(str("\s")) > p < many(str("\s"))
-  end
-
-  parser :sentence_way1 do
-    token(noun) >> proc{|n1|
-      token(verb) >> proc{|v|
-        token(noun) >> proc{|n2|
-          ok("You said, '#{n1} #{v} #{n2}'")
-        }}}
-  end
-
-  parser :sentence_way2 do
-    seq(token(noun), token(verb), token(noun)).map do |x|
-      "You said, '#{x[0]} #{x[1]} #{x[2]}'"
-    end
-  end
-
-  parser :sentence_way3 do
-    seq(token(noun).name(:a), token(verb).name(:b), token(noun).name(:c)).map do |x|
-      "You said, '#{x[:a]} #{x[:b]} #{x[:c]}'"
-    end
-  end
-end
-
-result = MyParser.sentence_way1.parse_from_string("I love you")
-puts result.parsed # => You said, 'I love you.'
-
-result = MyParser.sentence_way2.parse_from_string("I love you")
-puts result.parsed # => You said, 'I love you.'
-
-result = MyParser.sentence_way3.parse_from_string("I love you")
-puts result.parsed # => You said, 'I love you.'
-
-```
-
-### Error Handling
-`^` is error handling version of `|`.
-```ruby
-require 'parser_combinator/string_parser'
-
-class MyParser < ParserCombinator::StringParser
-  parser :love_sentence do
-    str("I") > str("\s") > str("love") > str("you").onfail("Who do you love?")
-  end
-
-  parser :hate_sentence do
-    str("I") > str("\s") > str("hate") > str("you").onfail("Who do you hate?")
-  end
-
-  parser :sentence do
-    love_sentence ^ hate_sentence
-  end
-end
-
-result = MyParser.sentence.parse_from_string("I love")
-puts result.status.message # => Who do you love?
-
-result = MyParser.sentence.parse_from_string("I hate")
-puts result.status.message # => Who do you hate?
-
-result = MyParser.sentence.parse_from_string("I am laughing")
-puts result.status == nil # => true
-```
-
-### Recursive parsing and Left recursion
-```ruby
-require 'parser_combinator/string_parser'
-
-class MyParser < ParserCombinator::StringParser
-  parser :expression do
-    add_sub
-  end
-
-  parser :add_sub do
-    add_op = str("+").map{ proc{|l, r| l + r}}
-    sub_op = str("-").map{ proc{|l, r| l - r}}
-    binopl(mul_div, add_op | sub_op)
-  end
-
-  parser :mul_div do
-    mul_op = str("*").map{ proc{|l, r| l * r}}
-    div_op = str("/").map{ proc{|l, r| l / r}}
-    binopl(integer | parenth, mul_op | div_op)
-  end
-
-  parser :integer do
-    many1(digit).map{|x| x.map{|i| i.item}.join.to_i}
-  end
-
-  parser :parenth do
-    str("(") > expression < str(")")
-  end
-end
-
-result = MyParser.expression.parse_from_string("(1+2)*3+10/2")
-puts result.parsed # => 14
-
-result = MyParser.expression.parse_from_string("3-2-1")
-puts result.parsed # => 0
-```
-
-## Contributing
-
-1. Fork it ( https://github.com/sawaken/parser_combinator/fork )
-2. Create your feature branch (`git checkout -b my-new-feature`)
-3. Commit your changes (`git commit -am 'Add some feature'`)
-4. Push to the branch (`git push origin my-new-feature`)
-5. Create a new Pull Request
+# ParserCombinator
+
+Yet another class-base parser combinator (monadic parser) library.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'parser_combinator'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install parser_combinator
+
+## Basics
+
+### Item class
+Abstraction of Char (in Ruby, it is String of 1-length).
+Parsing charactors through this abstraction, you can handle meta-info of source-string such as file-name, line-number, column-number.
+
+### Items class
+Abstraction of String. This is Array of Item.
+
+## Usage
+
+### Basic Example
+```ruby
+require 'parser_combinator/string_parser'
+
+class MyParser < ParserCombinator::StringParser
+  parser :noun do
+    str("I") | str("you") | str("it")
+  end
+
+  parser :verb do
+    str("love") | str("hate") | str("live") | str("die")
+  end
+
+  parser :token do |p|
+    many(str("\s")) > p < many(str("\s"))
+  end
+
+  parser :sentence_way1 do
+    token(noun) >> proc{|n1|
+      token(verb) >> proc{|v|
+        token(noun) >> proc{|n2|
+          ok("You said, '#{n1} #{v} #{n2}'")
+        }}}
+  end
+
+  parser :sentence_way2 do
+    seq(token(noun), token(verb), token(noun)).map do |x|
+      "You said, '#{x[0]} #{x[1]} #{x[2]}'"
+    end
+  end
+
+  parser :sentence_way3 do
+    seq(token(noun).name(:a), token(verb).name(:b), token(noun).name(:c)).map do |x|
+      "You said, '#{x[:a]} #{x[:b]} #{x[:c]}'"
+    end
+  end
+end
+
+result = MyParser.sentence_way1.parse_from_string("I love you")
+puts result.parsed # => You said, 'I love you.'
+
+result = MyParser.sentence_way2.parse_from_string("I love you")
+puts result.parsed # => You said, 'I love you.'
+
+result = MyParser.sentence_way3.parse_from_string("I love you")
+puts result.parsed # => You said, 'I love you.'
+
+```
+
+### Error Handling
+`^` is error handling version of `|`.
+```ruby
+require 'parser_combinator/string_parser'
+
+class MyParser < ParserCombinator::StringParser
+  parser :love_sentence do
+    str("I") > str("\s") > str("love") > str("you").onfail("Who do you love?")
+  end
+
+  parser :hate_sentence do
+    str("I") > str("\s") > str("hate") > str("you").onfail("Who do you hate?")
+  end
+
+  parser :sentence do
+    love_sentence ^ hate_sentence
+  end
+end
+
+result = MyParser.sentence.parse_from_string("I love")
+puts result.status.message # => Who do you love?
+
+result = MyParser.sentence.parse_from_string("I hate")
+puts result.status.message # => Who do you hate?
+
+result = MyParser.sentence.parse_from_string("I am laughing")
+puts result.status == nil # => true
+```
+
+### Recursive parsing and Left recursion
+```ruby
+require 'parser_combinator/string_parser'
+
+class MyParser < ParserCombinator::StringParser
+  parser :expression do
+    add_sub
+  end
+
+  parser :add_sub do
+    add_op = str("+").map{ proc{|l, r| l + r}}
+    sub_op = str("-").map{ proc{|l, r| l - r}}
+    binopl(mul_div, add_op | sub_op)
+  end
+
+  parser :mul_div do
+    mul_op = str("*").map{ proc{|l, r| l * r}}
+    div_op = str("/").map{ proc{|l, r| l / r}}
+    binopl(integer | parenth, mul_op | div_op)
+  end
+
+  parser :integer do
+    many1(digit).map{|x| x.map{|i| i.item}.join.to_i}
+  end
+
+  parser :parenth do
+    str("(") > expression < str(")")
+  end
+end
+
+result = MyParser.expression.parse_from_string("(1+2)*3+10/2")
+puts result.parsed # => 14
+
+result = MyParser.expression.parse_from_string("3-2-1")
+puts result.parsed # => 0
+```
+
+## Contributing
+
+1. Fork it ( https://github.com/sawaken/parser_combinator/fork )
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create a new Pull Request

data/Rakefile

@@ -1,9 +1,9 @@
-require "bundler/gem_tasks"
-
-task :examples do
-  $LOAD_PATH.unshift File.expand_path('../examples', __FILE__)
-  require 'basic'
-  require 'error_handling'
-  require 'recursive'
-end
-
+require "bundler/gem_tasks"
+
+task :examples do
+  $LOAD_PATH.unshift File.expand_path('../examples', __FILE__)
+  require 'basic'
+  require 'error_handling'
+  require 'recursive'
+end
+

data/lib/parser_combinator/version.rb

@@ -1,3 +1,3 @@
-class ParserCombinator
-  VERSION = "0.0.3"
-end
+class ParserCombinator
+  VERSION = "0.0.4"
+end

data/lib/parser_combinator.rb

@@ -1,337 +1,373 @@
-require "parser_combinator/version"
-
-class ParserCombinator
-  ParserCombinatorError = Class.new(RuntimeError)
-
-  class Ok
-    attr_reader :parsed, :rest
-    def initialize(parsed, rest)
-      @parsed, @rest = parsed, rest
-    end
-  end
-
-  class Fail
-    attr_reader :status
-    def initialize(status=nil)
-      @status = status
-    end
-  end
-
-  class StandardFailStatus
-    attr_reader :message, :rest
-    def initialize(message, rest)
-      @message, @rest = message, rest
-    end
-  end
-
-  class Item
-    attr_reader :item, :tag
-
-    def initialize(item, tag)
-      @item, @tag = item, tag
-    end
-
-    def to_s
-      item.to_s
-    end
-
-    def inspect
-      "Item {item = #{item}, tag = #{tag}}"
-    end
-  end
-
-  class Items < Array
-    def head
-      self.first
-    end
-
-    def rest
-      self.drop(1)
-    end
-
-    def to_s
-      self.map(&:to_s).join
-    end
-
-    def inspect
-      "Items [#{self.map(&:inspect).join(",\n")}]"
-    end
-  end
-
-  class ParsedSeq
-    def initialize(seq)
-      @seq = seq
-    end
-
-    def to_a
-      @seq.map{|e| e[:entity]}
-    end
-
-    def to_h
-      Hash[@seq.select{|e| e[:name]}.map{|e| [e[:name], e[:entity]]}]
-    end
-
-    def self.empty
-      new([])
-    end
-
-    def cons(entity, name)
-      self.class.new([{:entity => entity, :name => name}] + @seq)
-    end
-
-    def [](key)
-      case key
-      when Integer
-        if 0 <= key && key < @seq.length
-          @seq[key][:entity]
-        else
-          raise "out of bounds for ParsedSeq"
-        end
-      else
-        if e = @seq.find{|e| e[:name] == key}
-          e[:entity]
-        else
-          raise "key #{key} is not found in ParsedSeq"
-        end
-      end
-    end
-  end
-
-  attr_reader :status_handler, :parser_name, :parser_proc
-  def initialize(status_handler=proc{nil}, name=nil, &proc)
-    @status_handler = status_handler
-    @parser_name = name
-    @parser_proc = proc
-  end
-
-  def parse(items)
-    result = @parser_proc.call(items)
-    case result
-    when Fail
-      if  @status_handler.call(items, result.status) != nil
-        result.class.new(@status_handler.call(items, result.status))
-      else
-        result
-      end
-    when Ok
-      result
-    else
-      raise "parsed object is #{result.inspect}/#{result.class}"
-    end
-  end
-
-  def onfail(message=nil, ifnotyet=false, &status_handler)
-    raise "Only eihter message or fail_handler can be specified" if message && status_handler
-    if message
-      onfail{|items, status| status == nil ? StandardFailStatus.new(message, items) : status}
-    elsif status_handler
-      self.class.new(status_handler, @parser_name, &parser_proc)
-    else
-      self
-    end
-  end
-
-  def onparse(&proc)
-    self.class.new(@status_handler, @parser_name) do |*args|
-      proc.call(*args)
-      @parser_proc.call(*args)
-    end
-  end
-
-  def name(new_name)
-    self.class.new(@status_handler, new_name, &parser_proc)
-  end
-
-  def map(&mapping)
-    self >> proc{|x| self.class.ok(mapping.call(x))}
-  end
-
-  def >>(proc)
-    self.class.so_then(self, &proc)
-  end
-
-  def |(other)
-    self.class.either(self, other)
-  end
-
-  def ^(other)
-    self.class.either_fail(self, other)
-  end
-
-  def >(other)
-    self.class.discardl(self, other)
-  end
-
-  def <(other)
-    self.class.discardr(self, other)
-  end
-
-  # CoreCombinator
-  # --------------------
-
-  def self.ok(object)
-    new{|i| Ok.new(object, i)}
-  end
-
-  def self.fail(status=nil)
-    new{|i| Fail.new(status)}
-  end
-
-  def self.so_then(parser, &continuation_proc)
-    new{|i|
-      case result = parser.parse(i)
-      when Fail
-        result
-      when Ok
-        continuation_proc.call(result.parsed).parse(result.rest)
-      else
-        raise "error"
-      end
-    }
-  end
-
-  def self.either(parser1, parser2)
-    new{|i|
-      case result1 = parser1.parse(i)
-      when Fail
-        parser2.parse(i)
-      when Ok
-        result1
-      else
-        raise "error"
-      end
-    }
-  end
-
-  def self.either_fail(parser1, parser2)
-    new{|i|
-      case result1 = parser1.parse(i)
-      when Fail
-        if result1.status == nil
-          parser2.parse(i)
-        else
-          result1
-        end
-      when Ok
-        result1
-      else
-        raise "error"
-      end
-    }
-  end
-
-  def self.item
-    new{|i| i.size == 0 ? Fail.new : Ok.new(i.head, i.rest)}
-  end
-
-  def self.end_of_input
-    new{|i| i.size == 0 ? Ok.new(nil, i) : Fail.new}
-  end
-
-  def self.sat(&item_cond_proc)
-    item >> proc{|i|
-      item_cond_proc.call(i.item) ? ok(i) : fail
-    }
-  end
-
-  # UtilCombinator
-  # --------------------
-
-  def self.seq(*parsers)
-    if parsers.size == 0
-      ok(ParsedSeq.empty)
-    else
-      parsers.first >> proc{|x|
-        seq(*parsers.drop(1)) >> proc{|xs|
-          ok(xs.cons(x, parsers.first.parser_name))
-        }}
-    end
-  end
-
-  def self.opt(parser)
-    parser.map{|x| [x]} | ok([])
-  end
-
-  def self.many(parser, separator_parser=ok(nil))
-    many1(parser, separator_parser) | ok([])
-  end
-
-  def self.many1(parser, separator_parser=ok(nil))
-    parser >> proc{|x|
-       many(separator_parser > parser) >> proc{|xs|
-        ok([x] + xs)
-      }}
-  end
-
-  def self.opt_fail(parser)
-    parser.map{|x| [x]} ^ ok([])
-  end
-
-  def self.many_fail(parser, separator_parser=ok(nil))
-    many1_fail(parser, separator_parser) ^ ok([])
-  end
-
-  def self.many1_fail(parser, separator_parser=ok(nil))
-    parser >> proc{|x|
-      many_fail(separator_parser > parser) >> proc{|xs|
-        ok([x] + xs)
-      }}
-  end
-
-  def self.discardl(parser1, parser2)
-    parser1 >> proc{parser2}
-  end
-
-  def self.discardr(parser1, parser2)
-    parser1 >> proc{|x|
-      parser2 >> proc{
-        ok(x)
-      }}
-  end
-
-  def self.binopl(parser, op_proc_parser)
-    rest = proc{|a|
-      op_proc_parser >> proc{|f|
-        parser >> proc{|b|
-          rest.call(f.call(a, b))
-        }} | ok(a)
-    }
-    parser >> proc{|a|
-      rest.call(a)
-    }
-  end
-
-  def self.binopl_fail(parser, op_proc_parser)
-    rest = proc{|a|
-      op_proc_parser >> proc{|f|
-        parser >> proc{|b|
-          rest.call(f.call(a, b))
-        }} ^ ok(a)
-    }
-    parser >> proc{|a|
-      rest.call(a)
-    }
-  end
-
-  # Memorization DSL suport (for recursive grammer)
-  # --------------------
-
-  def self.parser(name, &proc)
-    @cache ||= {}
-    spcls = class << self; self end
-    spcls.send(:define_method, name) do |*args|
-      key = [name, args]
-      if @cache[key]
-        return @cache[key]
-      else
-        status_handler = proc{ raise "this is never-called proc (status_handler)" }
-        parser_proc = proc{ raise "this is never-called proc (parser_proc)" }
-        @cache[key] = self.new(proc{|*args| status_handler.call(*args)}){|*args| parser_proc.call(*args)}
-        generated_parser = proc.call(*args)
-        parser_proc = generated_parser.parser_proc
-        status_handler = generated_parser.status_handler
-        return @cache[key]
-      end
-    end
-  end
-end
+require "parser_combinator/version"
+
+class ParserCombinator
+  ParserCombinatorError = Class.new(RuntimeError)
+
+  class Ok
+    attr_reader :parsed, :rest
+    def initialize(parsed, rest)
+      @parsed, @rest = parsed, rest
+    end
+  end
+
+  class Fail
+    attr_reader :status
+    def initialize(status=nil)
+      @status = status
+    end
+  end
+
+  class StandardFailStatus
+    attr_reader :message, :rest
+    def initialize(message, rest)
+      @message, @rest = message, rest
+    end
+  end
+
+  class Item
+    attr_reader :item, :tag
+
+    def initialize(item, tag)
+      @item, @tag = item, tag
+    end
+
+    def to_s
+      item.to_s
+    end
+
+    def inspect
+      "Item {item = #{item}, tag = #{tag}}"
+    end
+  end
+
+  class Items < Array
+    def drop(v)
+      Items.new(super(v))
+    end
+
+    def drop_while(&p)
+      Items.new(super(&p))
+    end
+
+    def flatten
+      Items.new(super())
+    end
+
+    def slice(nth)
+      if nth.instance_of? Range then
+        Items.new(super(nth))
+      else
+        super(nth)
+      end
+    end
+
+    def slice(pos, len)
+      Items.new(super(pos, len))
+    end
+
+    def take(n)
+       Items.new(super(n))
+    end
+
+    def take_while(&p)
+       Items.new(super(&p))
+    end
+
+    def uniq
+       Items.new(super())
+    end
+
+    def head
+      self.first
+    end
+
+    def rest
+      self.drop(1)
+    end
+
+    def to_s
+      self.map(&:to_s).join
+    end
+
+    def inspect
+      "Items [#{self.map(&:inspect).join(",\n")}]"
+    end
+  end
+
+  class ParsedSeq
+    def initialize(seq)
+      @seq = seq
+    end
+
+    def to_a
+      @seq.map{|e| e[:entity]}
+    end
+
+    def to_h
+      Hash[@seq.select{|e| e[:name]}.map{|e| [e[:name], e[:entity]]}]
+    end
+
+    def self.empty
+      new([])
+    end
+
+    def cons(entity, name)
+      self.class.new([{:entity => entity, :name => name}] + @seq)
+    end
+
+    def [](key)
+      case key
+      when Integer
+        if 0 <= key && key < @seq.length
+          @seq[key][:entity]
+        else
+          raise "out of bounds for ParsedSeq"
+        end
+      else
+        if e = @seq.find{|e| e[:name] == key}
+          e[:entity]
+        else
+          raise "key #{key} is not found in ParsedSeq"
+        end
+      end
+    end
+  end
+
+  attr_reader :status_handler, :parser_name, :parser_proc
+  def initialize(status_handler=proc{nil}, name=nil, &proc)
+    @status_handler = status_handler
+    @parser_name = name
+    @parser_proc = proc
+  end
+
+  def parse(items)
+    result = @parser_proc.call(items)
+    case result
+    when Fail
+      if  @status_handler.call(items, result.status) != nil
+        result.class.new(@status_handler.call(items, result.status))
+      else
+        result
+      end
+    when Ok
+      result
+    else
+      raise "parsed object is #{result.inspect}/#{result.class}"
+    end
+  end
+
+  def onfail(message=nil, ifnotyet=false, &status_handler)
+    raise "Only eihter message or fail_handler can be specified" if message && status_handler
+    if message
+      onfail{|items, status| status == nil ? StandardFailStatus.new(message, items) : status}
+    elsif status_handler
+      self.class.new(status_handler, @parser_name, &parser_proc)
+    else
+      self
+    end
+  end
+
+  def onparse(&proc)
+    self.class.new(@status_handler, @parser_name) do |*args|
+      proc.call(*args)
+      @parser_proc.call(*args)
+    end
+  end
+
+  def name(new_name)
+    self.class.new(@status_handler, new_name, &parser_proc)
+  end
+
+  def map(&mapping)
+    self >> proc{|x| self.class.ok(mapping.call(x))}
+  end
+
+  def >>(proc)
+    self.class.so_then(self, &proc)
+  end
+
+  def |(other)
+    self.class.either(self, other)
+  end
+
+  def ^(other)
+    self.class.either_fail(self, other)
+  end
+
+  def >(other)
+    self.class.discardl(self, other)
+  end
+
+  def <(other)
+    self.class.discardr(self, other)
+  end
+
+  # CoreCombinator
+  # --------------------
+
+  def self.ok(object)
+    new{|i| Ok.new(object, i)}
+  end
+
+  def self.fail(status=nil)
+    new{|i| Fail.new(status)}
+  end
+
+  def self.so_then(parser, &continuation_proc)
+    new{|i|
+      case result = parser.parse(i)
+      when Fail
+        result
+      when Ok
+        continuation_proc.call(result.parsed).parse(result.rest)
+      else
+        raise "error"
+      end
+    }
+  end
+
+  def self.either(parser1, parser2)
+    new{|i|
+      case result1 = parser1.parse(i)
+      when Fail
+        parser2.parse(i)
+      when Ok
+        result1
+      else
+        raise "error"
+      end
+    }
+  end
+
+  def self.either_fail(parser1, parser2)
+    new{|i|
+      case result1 = parser1.parse(i)
+      when Fail
+        if result1.status == nil
+          parser2.parse(i)
+        else
+          result1
+        end
+      when Ok
+        result1
+      else
+        raise "error"
+      end
+    }
+  end
+
+  def self.item
+    new{|i| i.size == 0 ? Fail.new : Ok.new(i.head, i.rest)}
+  end
+
+  def self.end_of_input
+    new{|i| i.size == 0 ? Ok.new(nil, i) : Fail.new}
+  end
+
+  def self.sat(&item_cond_proc)
+    item >> proc{|i|
+      item_cond_proc.call(i.item) ? ok(i) : fail
+    }
+  end
+
+  # UtilCombinator
+  # --------------------
+
+  def self.seq(*parsers)
+    if parsers.size == 0
+      ok(ParsedSeq.empty)
+    else
+      parsers.first >> proc{|x|
+        seq(*parsers.drop(1)) >> proc{|xs|
+          ok(xs.cons(x, parsers.first.parser_name))
+        }}
+    end
+  end
+
+  def self.opt(parser)
+    parser.map{|x| [x]} | ok([])
+  end
+
+  def self.many(parser, separator_parser=ok(nil))
+    many1(parser, separator_parser) | ok([])
+  end
+
+  def self.many1(parser, separator_parser=ok(nil))
+    parser >> proc{|x|
+       many(separator_parser > parser) >> proc{|xs|
+        ok([x] + xs)
+      }}
+  end
+
+  def self.opt_fail(parser)
+    parser.map{|x| [x]} ^ ok([])
+  end
+
+  def self.many_fail(parser, separator_parser=ok(nil))
+    many1_fail(parser, separator_parser) ^ ok([])
+  end
+
+  def self.many1_fail(parser, separator_parser=ok(nil))
+    parser >> proc{|x|
+      many_fail(separator_parser > parser) >> proc{|xs|
+        ok([x] + xs)
+      }}
+  end
+
+  def self.discardl(parser1, parser2)
+    parser1 >> proc{parser2}
+  end
+
+  def self.discardr(parser1, parser2)
+    parser1 >> proc{|x|
+      parser2 >> proc{
+        ok(x)
+      }}
+  end
+
+  def self.binopl(parser, op_proc_parser)
+    rest = proc{|a|
+      op_proc_parser >> proc{|f|
+        parser >> proc{|b|
+          rest.call(f.call(a, b))
+        }} | ok(a)
+    }
+    parser >> proc{|a|
+      rest.call(a)
+    }
+  end
+
+  def self.binopl_fail(parser, op_proc_parser)
+    rest = proc{|a|
+      op_proc_parser >> proc{|f|
+        parser >> proc{|b|
+          rest.call(f.call(a, b))
+        }} ^ ok(a)
+    }
+    parser >> proc{|a|
+      rest.call(a)
+    }
+  end
+
+  # Memorization DSL suport (for recursive grammer)
+  # --------------------
+
+  def self.parser(name, &proc)
+    @cache ||= {}
+    spcls = class << self; self end
+    spcls.send(:define_method, name) do |*args|
+      key = [name, args]
+      if @cache[key]
+        return @cache[key]
+      else
+        status_handler = proc{ raise "this is never-called proc (status_handler)" }
+        parser_proc = proc{ raise "this is never-called proc (parser_proc)" }
+        @cache[key] = self.new(proc{|*args| status_handler.call(*args)}){|*args| parser_proc.call(*args)}
+        generated_parser = proc.call(*args)
+        parser_proc = generated_parser.parser_proc
+        status_handler = generated_parser.status_handler
+        return @cache[key]
+      end
+    end
+  end
+end

data/parser_combinator.gemspec

@@ -1,22 +1,22 @@
-# coding: utf-8
-lib = File.expand_path('../lib', __FILE__)
-$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
-require 'parser_combinator/version'
-
-Gem::Specification.new do |spec|
-  spec.name          = "parser_combinator"
-  spec.version       = ParserCombinator::VERSION
-  spec.authors       = ["Kensuke Sawada"]
-  spec.email         = ["sasasawada@gmail.com"]
-  spec.summary       = %q{Yet another class-base parser combinator library. }
-  spec.homepage      = ""
-  spec.license       = "MIT"
-
-  spec.files         = `git ls-files -z`.split("\x0")
-  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
-  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
-  spec.require_paths = ["lib"]
-
-  spec.add_development_dependency "bundler", "~> 1.7"
-  spec.add_development_dependency "rake", "~> 10.0"
-end
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'parser_combinator/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "parser_combinator"
+  spec.version       = ParserCombinator::VERSION
+  spec.authors       = ["Kensuke Sawada"]
+  spec.email         = ["sasasawada@gmail.com"]
+  spec.summary       = %q{Yet another class-base parser combinator library. }
+  spec.homepage      = ""
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.7"
+  spec.add_development_dependency "rake", "~> 10.0"
+end

metadata

@@ -1,51 +1,51 @@
 --- !ruby/object:Gem::Specification
 name: parser_combinator
 version: !ruby/object:Gem::Version
-  version: 0.0.3
+  version: 0.0.4
 platform: ruby
 authors:
 - Kensuke Sawada
-autorequire: 
+autorequire:
 bindir: bin
 cert_chain: []
-date: 2015-12-11 00:00:00.000000000 Z
+date: 2022-11-19 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
         version: '1.7'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
         version: '1.7'
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !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'
-description: 
+description:
 email:
 - sasasawada@gmail.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- .gitignore
+- ".gitignore"
 - Gemfile
 - LICENSE.txt
 - README.md
@@ -61,24 +61,23 @@ homepage: ''
 licenses:
 - MIT
 metadata: {}
-post_install_message: 
+post_install_message:
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.0.14
-signing_key: 
+rubygems_version: 3.3.7
+signing_key:
 specification_version: 4
 summary: Yet another class-base parser combinator library.
 test_files: []