regexp_parser 0.1.0 → 0.1.1

data/ChangeLog

@@ -1,4 +1,19 @@
+Tue Nov 23 11:35:56 2010 Ammar Ali <ammarabuali@gmail.com>
 
-Sat Nov 20 16:40:10 EET 2010 Ammar Ali <ammarabuali@gmail.com>
+	* Made ruby 1.8.6 the base for all 1.8 syntax, and the 1.8 name a pointer
+		to the latest (1.8.7 at this time)
+
+	* Removed look-behind assertions (positive and negative) from 1.8 syntax
+
+	* Added control (\cc and \C-c) and meta (\M-c) escapes to 1.8 syntax
+
+	* The default syntax is now the one of the running ruby version in both the
+    lexer and the parser.
+
+Sun Nov 21 03:36:42 2010 Ammar Ali <ammarabuali@gmail.com>
+
+	* Released version 0.1.0
+
+Sat Nov 20 16:40:10 2010 Ammar Ali <ammarabuali@gmail.com>
 
 	* Initial version bump to 0.1.0

data/Rakefile

@@ -1,14 +1,26 @@
 require 'rake'
+require 'yaml'
 require 'rake/testtask'
 require 'rake/gempackagetask'
 
 task :default => [:test]
 
+
 RAGEL_SOURCE_DIR = File.expand_path '../lib/regexp_parser/scanner', __FILE__
 RAGEL_OUTPUT_DIR = File.expand_path '../lib/regexp_parser', __FILE__
 
 RAGEL_SOURCE_FILES = %w{scanner}
 
+RP_ROOT = File.expand_path '../', __FILE__
+
+def regexp_parser_version
+  v = YAML.load(File.read("#{RP_ROOT}/VERSION.yml"))
+  v[:build] ? "#{v[:major]}.#{v[:minor]}.#{v[:patch]}.#{v[:build]}" :
+              "#{v[:major]}.#{v[:minor]}.#{v[:patch]}"
+end
+
+RP_VERSION  = regexp_parser_version
+
 desc "Find and run all unit tests under test/ directory"
 Rake::TestTask.new("test") do |t|
   t.libs << "test"
@@ -60,32 +72,47 @@ namespace :ragel do
   end
 end
 
-spec = Gem::Specification.new do |s|
-  s.name = 'regexp_parser'
-  s.version = '0.1.0'
-  s.summary = %q{Scanner, lexer, parser for ruby's regular expressions}
-  s.description = %q{A library for tokenizing, lexing, and parsing Ruby regular expressions.}
-  s.date = '2010-10-01'
-  s.authors = ["Ammar Ali"]
-  s.email = 'ammarabuali@gmail.com'
-  s.homepage = %q{http://github.com/ammar/regexp_parser}
-  s.rdoc_options = ["--inline-source", "--charset=UTF-8"]
-  s.require_paths = ["lib"]
-  s.rubygems_version = %q{1.3.7}
-
-  s.files = Dir.glob("{lib,test}/**/*.rb") + Dir.glob("lib/**/*.rl") +
-            %w(Rakefile LICENSE README.rdoc ChangeLog)
-
-  s.test_files = Dir.glob("test/**/*.rb")
-  s.extra_rdoc_files = ["ChangeLog", "LICENSE", "README.rdoc"]
-  s.required_rubygems_version = ">= 1.3.7"
-  s.rubyforge_project = "regexp_parser"
-  s.require_path = 'lib'
+spec = Gem::Specification.new do |gem|
+  gem.name = 'regexp_parser'
+  gem.version = '0.1.1'
+  gem.date = '2010-11-23'
+
+  gem.license = 'MIT'
+  gem.summary = %q{Scanner, lexer, parser for ruby's regular expressions}
+  gem.description = %q{A library for tokenizing, lexing, and parsing Ruby regular expressions.}
+  gem.homepage = %q{http://github.com/ammar/regexp_parser}
+
+  gem.authors = ["Ammar Ali"]
+  gem.email = 'ammarabuali@gmail.com'
+
+  gem.rdoc_options = ["--inline-source", "--charset=UTF-8"]
+  gem.extra_rdoc_files = ["ChangeLog", "LICENSE", "README.rdoc"]
+
+  gem.require_paths = ["lib"]
+
+  gem.files = Dir.glob("{lib,test}/**/*.rb") + Dir.glob("lib/**/*.rl") +
+              %w(Rakefile LICENSE README.rdoc ChangeLog)
+
+  gem.test_files = Dir.glob("test/**/*.rb")
+
+  gem.required_rubygems_version = Gem::Requirement.new(">= 0") if
+    gem.respond_to? :required_rubygems_version=
 end
 
 Rake::GemPackageTask.new(spec) do |pkg|
-  Rake::Task['ragel:rb'].execute
-
   pkg.need_zip = true
   pkg.need_tar = true
 end
+
+namespace :gem do
+  desc "Release the gem to rubygems.org"
+  task :release do |t|
+    Rake::Task['ragel:rb'].execute
+
+    Rake::Task['gem'].invoke("#{RP_ROOT}/pkg/regexp_parser-#{RP_VERSION}")
+
+    Rake::Task['repackage'].execute
+
+    sh "gem push #{RP_ROOT}/pkg/regexp_parser-#{RP_VERSION}.gem"
+  end
+end

data/lib/regexp_parser/lexer.rb

@@ -10,7 +10,7 @@ module Regexp::Lexer
 
   CLOSING_TOKENS = [:close].freeze
 
-  def self.scan(input, syntax = 'ruby/1.9', &block)
+  def self.scan(input, syntax = "ruby/#{RUBY_VERSION}", &block)
     syntax = Regexp::Syntax.new(syntax)
 
     @tokens = []

data/lib/regexp_parser/parser.rb

@@ -22,7 +22,7 @@ module Regexp::Parser
     end
   end
 
-  def self.parse(input, syntax = :any, &block)
+  def self.parse(input, syntax = "ruby/#{RUBY_VERSION}", &block)
     @nesting = [@root = @node = Root.new]
 
     Regexp::Lexer.scan(input, syntax) do |token|

data/lib/regexp_parser/syntax/ruby/1.8.6.rb

@@ -1,11 +1,34 @@
-require File.expand_path('../1.8', __FILE__)
-
 module Regexp::Syntax
 
   module Ruby
-    class V186 < Regexp::Syntax::Ruby::V18
+    class V186 < Regexp::Syntax::Base
+      include Regexp::Syntax::Token
+
       def initialize
         super
+
+        implements :anchor, Anchor::All
+        implements :assertion, Group::Assertion::Lookahead
+        implements :backref, [:number]
+
+        implements :escape, 
+          Escape::Basic + Escape::Backreference +
+          Escape::ASCII + Escape::Meta + Escape::Control
+
+        implements :group, Group::All
+
+        implements :meta, Meta::Extended
+
+        implements :quantifier, 
+          Quantifier::Greedy + Quantifier::Reluctant +
+          Quantifier::Interval + Quantifier::IntervalReluctant
+
+        implements :set, CharacterSet::OpenClose +
+          CharacterSet::Extended + CharacterSet::Types +
+          CharacterSet::POSIX::Standard 
+
+        implements :type,
+          CharacterType::Extended
       end
 
     end

data/lib/regexp_parser/syntax/ruby/1.8.7.rb

@@ -1,9 +1,9 @@
-require File.expand_path('../1.8', __FILE__)
+require File.expand_path('../1.8.6', __FILE__)
 
 module Regexp::Syntax
 
   module Ruby
-    class V187 < Regexp::Syntax::Ruby::V18
+    class V187 < Regexp::Syntax::Ruby::V186
       def initialize
         super
       end

data/lib/regexp_parser/syntax/ruby/1.8.rb

@@ -1,37 +1,11 @@
+require File.expand_path('../1.8.7', __FILE__)
+
 module Regexp::Syntax
 
   module Ruby
-    class V18 < Regexp::Syntax::Base
-      include Regexp::Syntax::Token
-
+    class V18 < Regexp::Syntax::Ruby::V187
       def initialize
         super
-
-
-        implements :anchor, Anchor::All
-        implements :assertion, Group::Assertion::All
-        implements :backref, [:number]
-
-        implements :escape, 
-          Escape::Basic + Escape::Backreference +
-          Escape::ASCII + Escape::Meta
-
-        implements :group, Group::All
-
-        implements :meta, Meta::Extended
-
-        implements :quantifier, 
-          Quantifier::Greedy + Quantifier::Reluctant +
-          Quantifier::Interval + Quantifier::IntervalReluctant
-
-        implements :set, CharacterSet::OpenClose +
-          CharacterSet::Extended + CharacterSet::Types +
-          CharacterSet::POSIX::Standard 
-
-        implements :type,
-          CharacterType::Extended
-
-           
       end
     end
   end

data/lib/regexp_parser/syntax/ruby/1.9.1.rb

@@ -9,6 +9,9 @@ module Regexp::Syntax
       def initialize
         super
 
+        implements :assertion, Group::Assertion::Lookbehind +
+          Group::SubexpressionCall::All
+
         implements :backref, Group::Backreference::All +
           Group::SubexpressionCall::All
 
@@ -26,7 +29,8 @@ module Regexp::Syntax
         implements :set, 
           CharacterSet::POSIX::StandardNegative +
           CharacterSet::POSIX::Extensions +
-          CharacterSet::POSIX::ExtensionsNegative
+          CharacterSet::POSIX::ExtensionsNegative +
+          UnicodeProperty::All
 
         implements :subset, CharacterSet::OpenClose +
           CharacterSet::Extended + CharacterSet::Types +

data/lib/regexp_parser/syntax/ruby/1.9.2.rb

@@ -3,7 +3,6 @@ require File.expand_path('../1.9.1', __FILE__)
 module Regexp::Syntax
 
   module Ruby
-    # no difference, so far
     class V192 < Regexp::Syntax::Ruby::V191; end
   end
 

data/lib/regexp_parser/syntax/tokens.rb

@@ -66,6 +66,8 @@ module Regexp::Syntax
 
       Backreference = [:digit]
 
+      Control = [:control, :meta_sequence]
+
       ASCII = [:bell, :backspace, :escape, :form_feed, :newline, :carriage,
                :space, :tab, :vertical_tab]
 
@@ -88,10 +90,10 @@ module Regexp::Syntax
       Comment   = [:comment]
 
       module Assertion
-        Positive = [:lookahead, :lookbehind]
-        Negative = [:nlookahead, :nlookbehind]
+        Lookahead = [:lookahead, :nlookahead]
+        Lookbehind = [:lookbehind, :nlookbehind]
 
-        All = Positive + Negative
+        All = Lookahead + Lookbehind
       end
 
       module Backreference

data/test/lexer/test_refcalls.rb

@@ -35,7 +35,7 @@ class LexerRefCalls < Test::Unit::TestCase
   tests.each do |pattern, test|
     define_method "test_lexer_#{test[1]}_#{test[2]}_#{count+=1}" do
 
-      tokens = RL.scan(pattern)
+      tokens = RL.scan(pattern, 'ruby/1.9')
       assert_equal( test[1,7], tokens[test[0]].to_a)
       assert_equal( test[3],   pattern[tokens[test[0]][3], tokens[test[0]][4]])
 

data/test/parser/test_alternation.rb

@@ -6,7 +6,7 @@ class ParserAlternation < Test::Unit::TestCase
   # to navigate
 
   def setup
-    @root = RP.parse('(ab??|cd*+|ef+)*|(gh|ij|kl)?')
+    @root = RP.parse('(ab??|cd*|ef+)*|(gh|ij|kl)?')
   end
 
   def test_parse_alternation_root

data/test/parser/test_expression.rb

@@ -19,17 +19,17 @@ class ParserExpression < Test::Unit::TestCase
 
   def test_parse_expression_to_s_property_sets
     pattern = '[\a\b\p{Lu}\P{Z}\c\d]+'
-    assert_equal( pattern, RP.parse(pattern).to_s )
+    assert_equal( pattern, RP.parse(pattern, 'ruby/1.9').to_s )
   end
 
   def test_parse_expression_to_s_groups
     pattern = "(a(?>b(?:c(?<n>d(?'N'e)??f)+g)*+h)*i)++"
-    assert_equal( pattern, RP.parse(pattern).to_s )
+    assert_equal( pattern, RP.parse(pattern, 'ruby/1.9').to_s )
   end
 
   def test_parse_expression_to_s_assertions
     pattern = '(a+(?=b+(?!c+(?<=d+(?<!e+)?f+)?g+)?h+)?i+)?'
-    assert_equal( pattern, RP.parse(pattern).to_s )
+    assert_equal( pattern, RP.parse(pattern, 'ruby/1.9').to_s )
   end
 
   def test_parse_expression_to_s_comments

data/test/parser/test_groups.rb

@@ -3,7 +3,7 @@ require File.expand_path("../../helpers", __FILE__)
 class TestParserGroups < Test::Unit::TestCase
 
   def test_parse_root_options_mi
-    t = RP.parse((/[abc]/mi).to_s)
+    t = RP.parse((/[abc]/mi).to_s, 'ruby/1.8')
 
     assert_equal( true,  t.m? )
     assert_equal( true,  t.i? )
@@ -11,7 +11,7 @@ class TestParserGroups < Test::Unit::TestCase
   end
 
   def test_parse_nested_options_m
-    t = RP.parse('(?xi-m:a(?m-ix:b))')
+    t = RP.parse('(?xi-m:a(?m-ix:b))', 'ruby/1.8')
 
     assert_equal( true,  t.expressions[0].expressions[1].m? )
     assert_equal( false, t.expressions[0].expressions[1].i? )
@@ -19,7 +19,7 @@ class TestParserGroups < Test::Unit::TestCase
   end
 
   def test_parse_nested_options_xm
-    t = RP.parse(/(?i-xm:a(?mx-i:b))/)
+    t = RP.parse(/(?i-xm:a(?mx-i:b))/, 'ruby/1.8')
 
     assert_equal( true,  t.expressions[0].expressions[1].m? )
     assert_equal( false, t.expressions[0].expressions[1].i? )
@@ -27,7 +27,7 @@ class TestParserGroups < Test::Unit::TestCase
   end
 
   def test_parse_nested_options_im
-    t = RP.parse(/(?x-mi:a(?mi-x:b))/)
+    t = RP.parse(/(?x-mi:a(?mi-x:b))/, 'ruby/1.8')
 
     assert_equal( true,  t.expressions[0].expressions[1].m? )
     assert_equal( true,  t.expressions[0].expressions[1].i? )
@@ -35,7 +35,7 @@ class TestParserGroups < Test::Unit::TestCase
   end
 
   def test_parse_lookahead
-    t = RP.parse('(?=abc)(?!def)')
+    t = RP.parse('(?=abc)(?!def)', 'ruby/1.8')
 
     assert( t.expressions[0].is_a?(Assertion::Lookahead),
            "Expected lookahead, but got #{t.expressions[0].class.name}")
@@ -45,7 +45,7 @@ class TestParserGroups < Test::Unit::TestCase
   end
 
   def test_parse_lookbehind
-    t = RP.parse('(?<=abc)(?<!def)')
+    t = RP.parse('(?<=abc)(?<!def)', 'ruby/1.9')
 
     assert( t.expressions[0].is_a?(Assertion::Lookbehind),
            "Expected lookbehind, but got #{t.expressions[0].class.name}")

data/test/parser/test_properties.rb

@@ -295,7 +295,7 @@ class ParserProperties < Test::Unit::TestCase
 
     props.each do |property|
       define_method "test_parse_#{token_type}_#{property}" do
-        t = RP.parse "ab\\#{mode}{#{property}}"
+        t = RP.parse "ab\\#{mode}{#{property}}", 'ruby/1.9'
 
         assert( t.expressions.last.is_a?(UnicodeProperty::Base),
                "Expected property, but got #{t.expressions.last.class.name}")
@@ -307,38 +307,38 @@ class ParserProperties < Test::Unit::TestCase
   end
 
   def test_parse_property_negative
-    t = RP.parse 'ab\p{L}cd'
+    t = RP.parse 'ab\p{L}cd', 'ruby/1.9'
     assert_equal( false, t.expressions[1].negative? )
   end
 
   def test_parse_nonproperty_negative
-    t = RP.parse 'ab\P{L}cd'
+    t = RP.parse 'ab\P{L}cd', 'ruby/1.9'
     assert_equal( true, t.expressions[1].negative? )
   end
 
   def test_parse_property_age
-    t = RP.parse 'ab\p{age=5.2}cd'
+    t = RP.parse 'ab\p{age=5.2}cd', 'ruby/1.9'
 
     assert( t.expressions[1].is_a?(UnicodeProperty::Age),
            "Expected Age property, but got #{t.expressions[1].class.name}")
   end
 
   def test_parse_property_derived
-    t = RP.parse 'ab\p{Math}cd'
+    t = RP.parse 'ab\p{Math}cd', 'ruby/1.9'
 
     assert( t.expressions[1].is_a?(UnicodeProperty::Derived),
            "Expected Derived property, but got #{t.expressions[1].class.name}")
   end
 
   def test_parse_property_script
-    t = RP.parse 'ab\p{Hiragana}cd'
+    t = RP.parse 'ab\p{Hiragana}cd', 'ruby/1.9'
 
     assert( t.expressions[1].is_a?(UnicodeProperty::Script),
            "Expected Script property, but got #{t.expressions[1].class.name}")
   end
 
   def test_parse_property_following_literal
-    t = RP.parse 'ab\p{Lu}cd'
+    t = RP.parse 'ab\p{Lu}cd', 'ruby/1.9'
 
     assert( t.expressions[2].is_a?(Literal),
            "Expected Literal, but got #{t.expressions[2].class.name}")

data/test/parser/test_quantifiers.rb

@@ -25,7 +25,7 @@ class TestRegexpParserQuantifiers < Test::Unit::TestCase
   end
 
   def test_parse_zero_or_one_possessive
-    t = RP.parse('a?+bc')
+    t = RP.parse('a?+bc', 'ruby/1.9')
 
     assert_equal( true, t.expressions.first.quantified? )
     assert_equal( :zero_or_one, t.expressions.first.quantifier.token )
@@ -58,7 +58,7 @@ class TestRegexpParserQuantifiers < Test::Unit::TestCase
   end
 
   def test_parse_zero_or_more_possessive
-    t = RP.parse('a*+bc')
+    t = RP.parse('a*+bc', 'ruby/1.9')
 
     assert_equal( true, t.expressions.first.quantified? )
     assert_equal( :zero_or_more, t.expressions.first.quantifier.token )
@@ -91,7 +91,7 @@ class TestRegexpParserQuantifiers < Test::Unit::TestCase
   end
 
   def test_parse_one_or_more_possessive
-    t = RP.parse('a++bc')
+    t = RP.parse('a++bc', 'ruby/1.9')
 
     assert_equal( true, t.expressions.first.quantified? )
     assert_equal( :one_or_more, t.expressions.first.quantifier.token )
@@ -124,7 +124,7 @@ class TestRegexpParserQuantifiers < Test::Unit::TestCase
   end
 
   def test_parse_intervals_min_max_possessive
-    t = RP.parse('a{2,4}+bc')
+    t = RP.parse('a{2,4}+bc', 'ruby/1.9')
 
     assert_equal( true, t.expressions.first.quantified? )
     assert_equal( :interval, t.expressions.first.quantifier.token )
@@ -157,7 +157,7 @@ class TestRegexpParserQuantifiers < Test::Unit::TestCase
   end
 
   def test_parse_intervals_min_only_possessive
-    t = RP.parse('a{3,}+bc')
+    t = RP.parse('a{3,}+bc', 'ruby/1.9')
 
     assert_equal( true, t.expressions.first.quantified? )
     assert_equal( :interval, t.expressions.first.quantifier.token )
@@ -190,7 +190,7 @@ class TestRegexpParserQuantifiers < Test::Unit::TestCase
   end
 
   def test_parse_intervals_max_only_possessive
-    t = RP.parse('a{,3}+bc')
+    t = RP.parse('a{,3}+bc', 'ruby/1.9')
 
     assert_equal( true, t.expressions.first.quantified? )
     assert_equal( :interval, t.expressions.first.quantifier.token )
@@ -223,7 +223,7 @@ class TestRegexpParserQuantifiers < Test::Unit::TestCase
   end
 
   def test_parse_intervals_exact_possessive
-    t = RP.parse('a{3}+bc')
+    t = RP.parse('a{3}+bc', 'ruby/1.9')
 
     assert_equal( true, t.expressions.first.quantified? )
     assert_equal( :interval, t.expressions.first.quantifier.token )

data/test/parser/test_refcalls.rb

@@ -3,97 +3,97 @@ require File.expand_path("../../helpers", __FILE__)
 class TestParserGroups < Test::Unit::TestCase
 
   def test_parse_backref_named_ab
-    t = RP.parse('(?<X>abc)\k<X>')[1]
+    t = RP.parse('(?<X>abc)\k<X>', 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::Name) )
   end
 
   def test_parse_backref_named_sq
-    t = RP.parse("(?<X>abc)\\k'X'")[1]
+    t = RP.parse("(?<X>abc)\\k'X'", 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::Name) )
   end
 
   def test_parse_backref_number_ab
-    t = RP.parse('(abc)\k<1>')[1]
+    t = RP.parse('(abc)\k<1>', 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::Number) )
   end
 
   def test_parse_backref_number_sq
-    t = RP.parse("(abc)\\k'1'")[1]
+    t = RP.parse("(abc)\\k'1'", 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::Number) )
   end
 
   def test_parse_backref_number_relative_ab
-    t = RP.parse('(abc)\k<-1>')[1]
+    t = RP.parse('(abc)\k<-1>', 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::NumberRelative) )
   end
 
   def test_parse_backref_number_relative_sq
-    t = RP.parse("(abc)\\k'-1'")[1]
+    t = RP.parse("(abc)\\k'-1'", 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::NumberRelative) )
   end
 
   def test_parse_backref_name_call_ab
-    t = RP.parse('(?<X>abc)\g<X>')[1]
+    t = RP.parse('(?<X>abc)\g<X>', 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::NameCall) )
   end
 
   def test_parse_backref_name_call_sq
-    t = RP.parse("(?<X>abc)\\g'X'")[1]
+    t = RP.parse("(?<X>abc)\\g'X'", 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::NameCall) )
   end
 
   def test_parse_backref_number_call_ab
-    t = RP.parse('(abc)\g<1>')[1]
+    t = RP.parse('(abc)\g<1>', 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::NumberCall) )
   end
 
   def test_parse_backref_number_call_sq
-    t = RP.parse("(abc)\\g'1'")[1]
+    t = RP.parse("(abc)\\g'1'", 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::NumberCall) )
   end
 
   def test_parse_backref_number_relative_call_ab
-    t = RP.parse('(abc)\g<-1>')[1]
+    t = RP.parse('(abc)\g<-1>', 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::NumberCallRelative) )
   end
 
   def test_parse_backref_number_relative_call_sq
-    t = RP.parse("(abc)\\g'-1'")[1]
+    t = RP.parse("(abc)\\g'-1'", 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::NumberCallRelative) )
   end
 
   def test_parse_backref_name_nest_level_ab
-    t = RP.parse('(?<X>abc)\k<X-0>')[1]
+    t = RP.parse('(?<X>abc)\k<X-0>', 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::NameNestLevel) )
   end
 
   def test_parse_backref_name_nest_level_sq
-    t = RP.parse("(?<X>abc)\\k'X-0'")[1]
+    t = RP.parse("(?<X>abc)\\k'X-0'", 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::NameNestLevel) )
   end
 
   def test_parse_backref_number_nest_level_ab
-    t = RP.parse('(abc)\k<1-0>')[1]
+    t = RP.parse('(abc)\k<1-0>', 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::NumberNestLevel) )
   end
 
   def test_parse_backref_number_nest_level_sq
-    t = RP.parse("(abc)\\k'1-0'")[1]
+    t = RP.parse("(abc)\\k'1-0'", 'ruby/1.9')[1]
 
     assert_equal( true,  t.is_a?(Backreference::NumberNestLevel) )
   end

data/test/syntax/ruby/test_1.8.rb

@@ -9,10 +9,10 @@ class TestSyntaxRuby_V18 < Test::Unit::TestCase
 
   tests = {
     :implements => {
+      :assertion    => [Group::Assertion::Lookahead].flatten,
       :backref      => [:number],
       :escape       => [Escape::All].flatten,
       :group        => [Group::All].flatten,
-      :assertion    => [Group::Assertion::All].flatten,
       :quantifier   => [
           Quantifier::Greedy + Quantifier::Reluctant +
           Quantifier::Interval + Quantifier::IntervalReluctant
@@ -20,6 +20,8 @@ class TestSyntaxRuby_V18 < Test::Unit::TestCase
     },
 
     :excludes => {
+      :assertion    => [Group::Assertion::Lookbehind].flatten,
+
       :backref => [
         Group::Backreference::All + Group::SubexpressionCall::All
       ].flatten,

metadata

@@ -1,12 +1,13 @@
 --- !ruby/object:Gem::Specification 
 name: regexp_parser
 version: !ruby/object:Gem::Version 
+  hash: 25
   prerelease: false
   segments: 
   - 0
   - 1
-  - 0
-  version: 0.1.0
+  - 1
+  version: 0.1.1
 platform: ruby
 authors: 
 - Ammar Ali
@@ -14,7 +15,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-10-01 00:00:00 +03:00
+date: 2010-11-23 00:00:00 +02:00
 default_executable: 
 dependencies: []
 
@@ -89,8 +90,8 @@ files:
 - ChangeLog
 has_rdoc: true
 homepage: http://github.com/ammar/regexp_parser
-licenses: []
-
+licenses: 
+- MIT
 post_install_message: 
 rdoc_options: 
 - --inline-source
@@ -102,6 +103,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      hash: 3
       segments: 
       - 0
       version: "0"
@@ -110,14 +112,13 @@ required_rubygems_version: !ruby/object:Gem::Requirement
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      hash: 3
       segments: 
-      - 1
-      - 3
-      - 7
-      version: 1.3.7
+      - 0
+      version: "0"
 requirements: []
 
-rubyforge_project: regexp_parser
+rubyforge_project: 
 rubygems_version: 1.3.7
 signing_key: 
 specification_version: 3