pegex 0.0.2 → 0.0.3

data/test/testml_bridge.rb

@@ -0,0 +1,64 @@
+require 'testml/bridge'
+require 'testml/util'; include TestML::Util
+require 'pegex'
+require 'pegex/compiler'
+require 'pegex/tree'
+require 'pegex/tree/wrap'
+require 'testast'
+require 'yaml'
+# XXX can we eliminate this?
+require 'recursive_sort'
+
+class TestMLBridge < TestML::Bridge
+  def compile grammar
+    tree = Pegex::Compiler.new.parse(grammar.value).combinate.tree
+    tree.delete '+toprule'
+    return native tree
+  end
+
+  alias bootstrap_compile compile
+
+  def compress grammar
+    grammar = grammar.value
+    grammar.gsub! /([^;])\n(\w+\s*:)/, '\1;\2'
+    grammar.gsub! /\s/, ''
+
+    # XXX mod/quant ERROR rules are too protective here:
+    grammar.gsub! />%</, '> % <'
+
+    return str "#{grammar}\n"
+  end
+
+  def yaml object
+    return str YAML.dump(object.value.recursive_sort)
+  end
+
+  def clean yaml
+    yaml = yaml.value
+    yaml.sub! /^\.\.\.\n/, ''
+    yaml.sub! /\A---\s/, ''
+    yaml.gsub! /'(\d+)'/, '\1'
+    yaml.gsub! /\+eok: true/, '+eok: 1'
+    return str yaml
+  end
+
+  def parse_input grammar, input
+    parser = pegex(grammar.value)
+    return native parser.parse input.value
+  end
+
+  def parse_to_tree(grammar, input)
+    parser = pegex(grammar.value, Pegex::Tree)
+    return native parser.parse(input.value)
+  end
+
+  def parse_to_tree_wrap(grammar, input)
+    parser = pegex(grammar.value, Pegex::Tree::Wrap)
+    return native parser.parse(input.value)
+  end
+
+  def parse_to_tree_test(grammar, input)
+    parser = pegex(grammar.value, TestAST)
+    return native parser.parse(input.value)
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: pegex
 version: !ruby/object:Gem::Version
-  version: 0.0.2
+  version: 0.0.3
   prerelease: 
 platform: ruby
 authors:
@@ -9,16 +9,16 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-12-20 00:00:00.000000000 Z
+date: 2013-04-19 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
-  name: testml-lite
+  name: testml
   requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
-        version: 0.0.1
+        version: 0.0.2
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
@@ -26,7 +26,7 @@ dependencies:
     requirements:
     - - ! '>='
       - !ruby/object:Gem::Version
-        version: 0.0.1
+        version: 0.0.2
 description: ! 'Pegex is a Acmeist parser framework. It allows you to easily create
   parsers
 
@@ -39,6 +39,7 @@ extensions: []
 extra_rdoc_files: []
 files:
 - .gemspec
+- .profile
 - CHANGELOG.yaml
 - Gemfile
 - Gemfile.lock
@@ -57,22 +58,26 @@ files:
 - lib/pegex/receiver.rb
 - lib/pegex/tree.rb
 - lib/pegex/tree/wrap.rb
-- test/compiler-checks.rb
-- test/compiler-checks.tml
-- test/compiler-equivalence.rb
-- test/compiler.rb
-- test/compiler.tml
-- test/error.rb
-- test/export_ok.rb
+- test/export-api.rb
+- test/flatten.rb
 - test/grammar-api.rb
 - test/lib/recursive_sort.rb
-- test/lib/test_pegex.rb
 - test/lib/testast.rb
 - test/lib/xxx.rb
-- test/optimize.rb
-- test/tree-pegex.tml
-- test/tree.rb
-- test/tree.tml
+- test/mice.pgx
+- test/parse.rb
+- test/repeat.rb
+- test/sample.rb
+- test/testml.rb
+- test/testml.yaml
+- test/testml/compiler-checks.tml
+- test/testml/compiler-equivalence.tml
+- test/testml/compiler.tml
+- test/testml/error.tml
+- test/testml/optimize.tml
+- test/testml/tree-pegex.tml
+- test/testml/tree.tml
+- test/testml_bridge.rb
 homepage: http://pegex.org
 licenses:
 - MIT

data/test/compiler-checks.rb

@@ -1,271 +0,0 @@
-require './test/lib/test_pegex'
-
-TestML.require_or_skip 'psych'
-
-TestML.run do |t|
-  t.eval '*grammar.compile.yaml.clean == *yaml'
-end
-
-TestML.data <<'...'
-=== Empty Grammar
---- grammar
---- yaml
-{}
-
-=== Simple Grammar
---- grammar
-a: ( <b> <c>* )+
-b: /x/
-c: <x>
-
---- yaml
-a:
-  +min: 1
-  .all:
-  - .ref: b
-  - +min: 0
-    .ref: c
-b:
-  .rgx: x
-c:
-  .ref: x
-
-=== Single Rule Reference
---- grammar
-a: <x>
---- yaml
-a:
-  .ref: x
-
-=== Single Rule with no brackets
---- grammar
-a: x
---- yaml
-a:
-  .ref: x
-
-=== Single Rule With Trailing Quantifier
---- grammar
-a: <x>*
---- yaml
-a:
-  +min: 0
-  .ref: x
-
-=== Single Rule With Trailing Quantifier (no angles)
---- grammar
-a: x*
---- yaml
-a:
-  +min: 0
-  .ref: x
-
-=== Single Rule With Leading Assertion
---- grammar
-a: =<x>
---- yaml
-a:
-  +asr: 1
-  .ref: x
-
-=== Negative and Positive Assertion
---- grammar
-a: !<b> =<c>
---- yaml
-a:
-  .all:
-  - +asr: -1
-    .ref: b
-  - +asr: 1
-    .ref: c
-
-=== Single Regex
---- grammar
-a: /x/
---- yaml
-a:
-  .rgx: x
-
-=== Single Error
---- grammar
-a: `x`
---- yaml
-a:
-  .err: x
-
-=== Skip and Wrap Marker
---- grammar
-a: .<b> +<c>+ -<d>?
---- yaml
-a:
-  .all:
-  - -skip: 1
-    .ref: b
-  - +min: 1
-    -wrap: 1
-    .ref: c
-  - +max: 1
-    -pass: 1
-    .ref: d
-
-=== Unbracketed All Group
---- grammar
-a: /x/ <y>
---- yaml
-a:
-  .all:
-  - .rgx: x
-  - .ref: y
-
-=== Unbracketed Any Group
---- grammar
-a: /x/ | <y> | `z`
---- yaml
-a:
-  .any:
-  - .rgx: x
-  - .ref: y
-  - .err: z
-
-=== Bracketed All Group
---- grammar
-a: ( <x> <y> )
---- yaml
-a:
-  .all:
-  - .ref: x
-  - .ref: y
-
-=== Bracketed Group With Trailing Modifier
---- grammar
-a: ( <x> <y> )?
---- yaml
-a:
-  +max: 1
-  .all:
-  - .ref: x
-  - .ref: y
-
-=== Bracketed Group With Leading Modifier
---- grammar
-a: .( =<x> <y> )
---- yaml
-a:
-  -skip: 1
-  .all:
-  - +asr: 1
-    .ref: x
-  - .ref: y
-
-=== Multiple Groups
---- grammar
-a: ( <x> <y> ) ( <z> | /zzz/ )
---- yaml
-a:
-  .all:
-  - .all:
-    - .ref: x
-    - .ref: y
-  - .any:
-    - .ref: z
-    - .rgx: zzz
-
-=== List Separator
---- grammar
-a: <b> | <c>? %% /d/
---- yaml
-a:
-  .any:
-  - .ref: b
-  - +max: 1
-    .ref: c
-    .sep:
-      +eok: 1
-      .rgx: d
-
-=== Separators with Quantifiers
---- grammar
-a: <b>2+ % <c>* <d>* %% <e>2-3
---- yaml
-a:
-  .all:
-  - +min: 2
-    .ref: b
-    .sep:
-      +min: 0
-      .ref: c
-  - +min: 0
-    .ref: d
-    .sep:
-      +eok: 1
-      +max: 3
-      +min: 2
-      .ref: e
-
-=== All Quantifier Forms
---- grammar
-a: <b> <c>? <d>* <e>+ <f>55 <g>5+ <h>5-55
---- yaml
-a:
-  .all:
-  - .ref: b
-  - +max: 1
-    .ref: c
-  - +min: 0
-    .ref: d
-  - +min: 1
-    .ref: e
-  - +max: 55
-    +min: 55
-    .ref: f
-  - +min: 5
-    .ref: g
-  - +max: 55
-    +min: 5
-    .ref: h
-
-=== Whitespace in Regex
---- grammar
-a: /<DOT>* (<DASH>{3})
-    <BANG>   <BANG>
-   /
---- yaml
-a:
-  .rgx: \.*(\-{3})!!
-
-=== Directives
---- grammar
-\%grammar foo
-\%version 1.2.3
-
---- yaml
-+grammar: foo
-+version: 1.2.3
-
-=== Multiple Duplicate Directives
---- grammar
-\%grammar foo
-\%include bar
-\%include baz
-
---- yaml
-+grammar: foo
-+include:
-- bar
-- baz
-
-=== Meta Lines
---- grammar
-%grammar        foo
-%version    1.1.1
-%extends bar bar  
-%include   bazzy 
-a: /b/
---- yaml
-+extends: bar bar
-+grammar: foo
-+include: bazzy
-+version: 1.1.1
-a:
-  .rgx: b
-...

data/test/compiler.rb

@@ -1,42 +0,0 @@
-require './test/lib/test_pegex'
-
-TestML.require_or_skip 'psych'
-
-TestML.data 'test/compiler.tml'
-
-TestML.run do |t|
-  t.eval '*grammar', t.method('run_compiler_tests')
-end
-
-class TestPegex
-  def run_compiler_tests block, expr=nil
-    label '$BlockLabel - Compiler output matches bootstrap?'
-    run_test(
-      block,
-      '*grammar.compile.yaml == *grammar.compile.yaml',
-    )
-
-    label '$BlockLabel - Compressed grammar compiles the same?'
-    run_test(
-      block,
-      '*grammar.compress.compile.yaml == *grammar.compress.compile.yaml',
-    )
-
-    label '$BlockLabel - Compressed grammar matches uncompressed?'
-    run_test(
-      block,
-      '*grammar.compress.compile.yaml == *grammar.compile.yaml',
-    )
-  end
-
-  def compress grammar_text
-    grammar_text.gsub! /([^;])\n(\w+\s*:)/ do |m|
-      "#{$1};#{$2}"
-    end
-    grammar_text.gsub! /\s/, ''
-
-    # XXX mod/quant ERROR rules are too prtective here:
-    grammar_text.gsub! />%</, '> % <'
-    return "#{grammar_text}\n"
-  end
-end