babel_bridge 0.5.1 → 0.5.3

data/lib/babel_bridge/version.rb

@@ -0,0 +1,3 @@
+module BabelBridge
+  VERSION = "0.5.3"
+end

data/spec/advanced_parsers_spec.rb

@@ -21,6 +21,7 @@ describe "advanced parsing" do
     end
 
     test_parse("END this is in the middle END")
+    test_parse("FROG this is in the middle FROG")
     test_parse("END this is in END the middle END",:partial_match => true).text.should == "END this is in END"
     test_parse "END this is in the middle EN", :should_fail_at => 0
     test_parse "    END this is in the middle END", :should_fail_at => 0

data/spec/basic_parsing_spec.rb

@@ -91,4 +91,47 @@ describe "basic parsing" do
     test_parse "boO"
   end
 
+  it "any() pattern should work" do
+    new_parser do
+      rule :foo, any("foo","bar")
+    end
+
+    test_parse "bar"
+    test_parse "foo"
+    test_parse "boo", :should_fail_at => 0
+  end
+
+  it "any!() should work" do
+    new_parser do
+      rule :foo, any!("foo","bar"), /[a-z]+/
+    end
+
+    test_parse "bar", :should_fail_at => 0
+    test_parse "foo", :should_fail_at => 0
+    test_parse "boo"
+  end
+
+  it "any?() should work" do
+    new_parser do
+      rule :foo, any?("foo","bar"), "baz"
+    end
+
+    test_parse "barbaz"
+    test_parse "foobaz"
+    test_parse "baz"
+    test_parse "foo", :should_fail_at => 3
+  end
+
+  it "[] (match in order) pattern should work" do
+    new_parser do
+      rule :foo, ["foo", "bar"], "baz"
+      rule :foo, "foo", "boo"
+    end
+
+    test_parse "foobarbaz"
+    test_parse "foo", :should_fail_at => 3
+    test_parse "foobar", :should_fail_at => 6
+    test_parse "fooboo"
+  end
+
 end

data/spec/bb_spec.rb

@@ -52,4 +52,23 @@ describe BabelBridge do
     test_parse("barbar").bar.class.should == BabelBridge::MultiMatchesArray
   end
 
+  it "if a name can be optionally matched more than one time, it should always be an array of matchs" do
+    new_parser do
+      rule :file, :space, :constant
+      rule :space, /\s*/
+      rule :constant, /[A-Z][0-9_a-zA-Z]*/
+    end
+
+    p = test_parse("This")
+
+    p.constant.match_length.should == 4
+    p.space.match_length.should == 0
+
+    p.constant.match_range.should == (0..3)
+    p.space.match_range.should == (0..-1)
+
+    p.constant.to_s.should == "This"
+    p.space.to_s.should == ""
+  end
+
 end

data/spec/compound_patterns_spec.rb

@@ -0,0 +1,61 @@
+require 'spec_helper'
+
+describe "compound pattern parsing" do
+  include TestParserGenerator
+
+  it "many + []" do
+    new_parser do
+      rule :foo, many(["bar","baz"])
+    end
+
+    test_parse("barbaz").matches.length.should == 2
+    test_parse("barbazbarbaz").matches.length.should == 4
+    test_parse "barbazbar", :should_fail_at => 9
+  end
+
+  it "many + any" do
+    new_parser do
+      rule :foo, many(any("foo","bar"))
+    end
+
+    test_parse "foo"
+    test_parse "foofoo"
+    test_parse "bar"
+    test_parse "barfoo"
+    test_parse "barfoofoofoobarbarbarbafoo", :should_fail_at => 21
+  end
+
+  it "any + []" do
+    new_parser do
+      rule :foo, any(["foo","bar"],"baz")
+    end
+
+    test_parse "foobar"
+    test_parse "foo", :should_fail_at => 3
+    test_parse "bar", :should_fail_at => 0
+    test_parse "baz"
+  end
+
+  it "[] + any" do
+    new_parser do
+      rule :foo, [any("foo", "bar"), "baz"], "boo"
+    end
+
+    test_parse "foobazboo"
+    test_parse "barbazboo"
+    test_parse "barbaz", :should_fail_at => 6
+    test_parse "fooboo", :should_fail_at => 3
+  end
+
+  it "many + [] + any" do
+    new_parser do
+      rule :foo, many(any(["foo",/[0-9]+/],"bar"))
+    end
+
+    test_parse "foo", :should_fail_at => 3
+    test_parse "foo123"
+    test_parse "bar123", :should_fail_at => 3
+    test_parse "barfoo123"
+    test_parse "barfoo123barbarbarfoo9foo0foo1barfoo8"
+  end
+end

data/spec/node_spec.rb

@@ -28,7 +28,7 @@ describe "basic parsing" do
     test_parse("123").number.should == 123
   end
 
-  def test_adder
+  it "test_adder" do
     new_parser do
       rule :adder, :number, "+", :number do
         def answer;
@@ -41,10 +41,10 @@ describe "basic parsing" do
     end
 
 
-    test_parser("123+654").answer.should == 777
+    test_parse("123+654").answer.should == 777
   end
 
-  def test_adder_multiplier
+  it "test_adder_multiplier" do
     new_parser do
 
       rule :adder, :multiplier, "+", :adder do

data/spec/pattern_generators_spec.rb

@@ -11,10 +11,6 @@ describe "basic parsing" do
     BabelBridge::Parser.many?(";").hash.should == {:many=>";", :optionally=>true, :match=>true}
   end
 
-  it "test_many!" do
-    BabelBridge::Parser.many!(";").hash.should == {:many=>";", :dont=>true, :match=>true}
-  end
-
   it "test_match" do
     BabelBridge::Parser.match(";").hash.should == {:match=>";"}
   end
@@ -38,4 +34,8 @@ describe "basic parsing" do
   it "test_could" do
     BabelBridge::Parser.could.match(";").hash.should == {:match=>";",:could=>true}
   end
+
+  it "test_any" do
+    BabelBridge::Parser.any(";").hash.should == {:any=>[";"]}
+  end
 end

data/spec/spec_helper.rb

@@ -1,3 +1,6 @@
+require 'simplecov'
+SimpleCov.start
+
 require File.join(File.dirname(__FILE__),"..","lib","babel_bridge")
 
 module TestParserGenerator

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: babel_bridge
 version: !ruby/object:Gem::Version
-  version: 0.5.1
+  version: 0.5.3
   prerelease: 
 platform: ruby
 authors:
@@ -43,6 +43,70 @@ dependencies:
     - - ! '>='
       - !ruby/object:Gem::Version
         version: '0'
+- !ruby/object:Gem::Dependency
+  name: simplecov
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: guard-rspec
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: guard-test
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rb-fsevent
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 description: ! 'Babel Bridge is an object oriented parser generator for parsing expression
   grammars (PEG).
 
@@ -54,41 +118,19 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- README
+- CHANGE_LOG
+- Gemfile
+- Guardfile
+- LICENCE
+- README.md
 - Rakefile
+- TODO
 - babel_bridge.gemspec
-- spec/advanced_parsers_spec.rb
-- spec/basic_parsing_spec.rb
-- spec/bb_spec.rb
-- spec/ignore_whitespace_spec.rb
-- spec/inspect_spec.rb
-- spec/many_spec.rb
-- spec/node_spec.rb
-- spec/pattern_generators_spec.rb
-- spec/rule_parsing_spec.rb
-- spec/spec_helper.rb
-- spec/tools_spec.rb
-- lib/babel_bridge.rb
-- lib/nodes/empty_node.rb
-- lib/nodes/node.rb
-- lib/nodes/non_terminal_node.rb
-- lib/nodes/root_node.rb
-- lib/nodes/rule_node.rb
-- lib/nodes/terminal_node.rb
-- lib/nodes.rb
-- lib/parser.rb
-- lib/pattern_element.rb
-- lib/rule.rb
-- lib/rule_variant.rb
-- lib/shell.rb
-- lib/string.rb
-- lib/tools.rb
-- lib/version.rb
 - examples/indention_grouping.rb
 - examples/indention_grouping_test.txt
+- examples/json/json_parser.rb
+- examples/json/json_parser2.rb
 - examples/test.rb
-- examples/turing/examples.turing
-- examples/turing/notes.rb
 - examples/turing/turing++.rb
 - examples/turing/turing.rb
 - examples/turing/turing00.rb
@@ -104,7 +146,35 @@ files:
 - examples/turing/turing10.rb
 - examples/turing/turing11.rb
 - examples/turing/turing12.rb
-- examples/turing/turing_demo.rb
+- lib/babel_bridge.rb
+- lib/babel_bridge/nodes.rb
+- lib/babel_bridge/nodes/empty_node.rb
+- lib/babel_bridge/nodes/node.rb
+- lib/babel_bridge/nodes/non_terminal_node.rb
+- lib/babel_bridge/nodes/root_node.rb
+- lib/babel_bridge/nodes/rule_node.rb
+- lib/babel_bridge/nodes/terminal_node.rb
+- lib/babel_bridge/parser.rb
+- lib/babel_bridge/pattern_element.rb
+- lib/babel_bridge/pattern_element_hash.rb
+- lib/babel_bridge/rule.rb
+- lib/babel_bridge/rule_variant.rb
+- lib/babel_bridge/shell.rb
+- lib/babel_bridge/string.rb
+- lib/babel_bridge/tools.rb
+- lib/babel_bridge/version.rb
+- spec/advanced_parsers_spec.rb
+- spec/basic_parsing_spec.rb
+- spec/bb_spec.rb
+- spec/compound_patterns_spec.rb
+- spec/ignore_whitespace_spec.rb
+- spec/inspect_spec.rb
+- spec/many_spec.rb
+- spec/node_spec.rb
+- spec/pattern_generators_spec.rb
+- spec/rule_parsing_spec.rb
+- spec/spec_helper.rb
+- spec/tools_spec.rb
 homepage: http://babel-bridge.rubyforge.org
 licenses: []
 post_install_message: 
@@ -129,4 +199,16 @@ rubygems_version: 1.8.24
 signing_key: 
 specification_version: 3
 summary: A Ruby-based parser-generator based on Parsing Expression Grammars.
-test_files: []
+test_files:
+- spec/advanced_parsers_spec.rb
+- spec/basic_parsing_spec.rb
+- spec/bb_spec.rb
+- spec/compound_patterns_spec.rb
+- spec/ignore_whitespace_spec.rb
+- spec/inspect_spec.rb
+- spec/many_spec.rb
+- spec/node_spec.rb
+- spec/pattern_generators_spec.rb
+- spec/rule_parsing_spec.rb
+- spec/spec_helper.rb
+- spec/tools_spec.rb

data/README

@@ -1,144 +0,0 @@
-Summary
--------
-
-Babel Bridge let's you generate parsers 100% in Ruby code. It is a memoizing Parsing Expression Grammar (PEG) generator like Treetop, but it doesn't require special file-types or new syntax. Overall focus is on simplicity and usability over performance.
-
-Example
--------
-
-require "babel_bridge"
-class MyParser < BabelBridge::Parser
-  rule :foo, "foo", :bar? # match "foo" optionally followed by the :bar
-  rule :bar, "bar" # match "bar"
-end
-
-MyParser.new.parse("foo") # matches "foo"
-MyParser.new.parse("foobar") # matches "foobar"
-
-Babel Bridge is a parser-generator for Parsing Expression Grammars
-
-Goals
------
-
-  Allow expression 100% in ruby
-  Productivity through Simplicity and Understandability first
-  Performance second
-
-Features
---------
-
-  rule=MyParser[:foo] # returns the BabelBridge::Rule instance for that rule
-
-  rule.to_s
-    nice human-readable view of the rule with extra info
-
-  rule.inspect
-    returns the code necessary for generating the rule and all its variants
-    (minus any class_eval code)
-
-  MyParser.node_class(rule)
-    returns the Node class for a rule
-
-  MyParser.node_class(rule) do
-    # class_eval inside the rule's Node-class
-  end
-
-  MyParser.new.parse(text)
-    # parses Text starting with the MyParser.root_rule
-    # The root_rule is defined automatically by the first rule defined, but can be set by:
-    # MyParser.root_rule=v # where v is the symbol name of the rule or the actual rule object from MyParser[rule]
-  MyParser.new.parse(text,offset,rule) # only has to match the rule - it's ok if there is input left
-  parser.parse uses the root_rule
-
-  detailed parser_failure_info report
-
-Defining Rules
---------------
-
-Inside the parser class, a rule is defined as follows:
-
-  class MyParser < BabelBridge::Parser
-    rule :rule_name, pattern
-  end
-
-Where:
-
-  :rule_name    is a symbol
-  pattern       see Patterns below
-
-You can also add new rules outside the class definition by:
-
-  MyParser.rule :rule_name, pattern
-
-Patterns
---------
-
-Patterns are an Array of pattern elements, matched in order:
-
-Ex (both are equivelent):
-  rule :my_rule, "match", "this", "in", "order"  # matches "matchthisinorder"
-  rule :my_rule, ["match", "this", "in", "order"]  # matches "matchthisinorder"
-
-Pattern Elements
-----------------
-
-Pattern elements are basic-pattern-element or extended-pattern-element ( expressed as a hash). Internally, they are "compiled" into instances of PatternElement with optimized lambda functions for parsing.
-
-  basic-pattern-element:
-    :my_rule      matches the Rule named :my_rule
-    :my_rule?     optional: optionally matches Rule :my_rule
-    :my_rule!     negative: success only if it DOESN'T match Rule :my_rule
-    "string"      matches the string exactly
-    /regex/       matches the regex exactly
-    true          always matches the empty string (useful as a no-op if you don't want to change the length of your pattern)
-
-  extended-pattern-element:
-
-    A Hash with :match or :parser set and zero or more additional options:
-
-    :match => basic_element
-      provide one of the basic elements above
-      NOTE: Optional and Negative options are preserved, but they are overridden by any such directives in the Hash-Element
-
-    :parser => lambda {|parent_node| ... }
-      Custom lambda function for parsing the input.
-      Return "nil" if could not find a parse, otherwise return a new Node, typically the TerminalNode
-      Make sure the returned node.next value is the index where you wish parsing to resume
-
-    :as => :my_name
-      Assign a name to an element for later programatic reference:
-        rule_variant_node_class_instance.my_name
-
-    :optionally => true
-      PEG equivelent: term?
-      turn this into an optional-match element
-      optional elements cannot be negative
-
-    :dont => true
-      PEG equivalent: !term
-      turn this into a Negative-match element
-      negative elements cannot be optional
-
-    :could => true
-      PEG equivalent: &term
-
-    :many => PatternElement
-      PEG equivalent: term+ (for "term*", use optionally + many)
-      accept 1 or more reptitions of this element delimited by PatternElement
-      NOTE: PatternElement can be "true" for no delimiter (since "true" matches the empty string)
-
-    :delimiter => PatternElement
-      pattern to match between the :many patterns
-
-    :post_delimiter => true           # use the :delimiter PatternElement for final match
-    :post_delimiter => PatternElement # use custom post_delimiter PatternElement for final match
-      if true, then poly will match a delimiter after the last poly-match
-
-Structure
----------
-
-  Each Rule defines a subclass of Node
-  Each RuleVariant defines a subclass of the parent Rule's node-class
-
-  Therefor you can easily define code to be shared across all variants as well
-  as define code specific to one variant.