pratt_parser 0.0.2 → 0.0.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: ca11d04a7ae882b9277380b20a737f9da15d71ff
-  data.tar.gz: 73b065cfad311d5310d37ace99ddd4a78683c81c
+  metadata.gz: 1e4efc171572cb5d16bf779face5ad265fcb0972
+  data.tar.gz: 1d735d195b81a1c7244232a3f104764d5f29262c
 SHA512:
-  metadata.gz: 8a2044d7296b0c958153481589955db1d2e8e40b5b31d937e72ec12175a51d6cbdaff5936e3e0739bfdcae78effe4652c037a474c237d6b9cfe121fb99631c3e
-  data.tar.gz: f576cb77ce8d32f23427dbab99faeaefab17ca438496684ef6732617516207b019bbdc2ca35312c86fa5872a19c89ae0773fba95f11adcae202a86bc409dbb8f
+  metadata.gz: acd4bbdfc592f343074a53a29eee714a90f780c5655a4dc5ea7ade6ec68690850553b9759feaea59a96b3bac5071f1f70eda1fd930b2946e51b4c8ef057966e4
+  data.tar.gz: bbf0d65f906a6579c33f15850e28ab34afece42722adc30cd27368377d71bee894ea0881c4d0f5c93157f423084e1f473be40777ff8ef3cf65f930e8695d942e

data/.travis.yml

@@ -0,0 +1,9 @@
+sudo: false
+language: ruby
+rvm:
+  - "1.9.3"
+  - "2.1.5"
+  - "2.2.0"
+  - jruby-19mode
+bundler_args: --without development
+script: rake

data/CHANGELOG

@@ -1,3 +1,8 @@
+## 0.0.3 ##
+
+  * examples/tree.rb supports prefix + and -.
+  * gem.required_ruby_version is >= 1.9.
+
 ## 0.0.2 ##
 
   * Add examples/tree.rb.

data/Gemfile

@@ -0,0 +1,9 @@
+source "https://rubygems.org"
+
+group :development do
+  gem "byebug"
+end
+
+group :test do
+  gem "minitest", "~>5.4"
+end

data/Gemfile.lock

@@ -0,0 +1,18 @@
+GEM
+  remote: https://rubygems.org/
+  specs:
+    byebug (3.5.1)
+      columnize (~> 0.8)
+      debugger-linecache (~> 1.2)
+      slop (~> 3.6)
+    columnize (0.9.0)
+    debugger-linecache (1.2.0)
+    minitest (5.5.1)
+    slop (3.6.0)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  byebug
+  minitest (~> 5.4)

data/README.md

@@ -1,6 +1,9 @@
 Pratt Parser
 ============
 
+[![Gem Version](https://badge.fury.io/rb/pratt_parser.svg)](http://badge.fury.io/rb/pratt_parser)
+[![Build Status](https://travis-ci.org/tommay/pratt_parser.svg)](https://travis-ci.org/tommay/pratt_parser)
+
 A Pratt Parser.  Just a simple parsing framework.
 
 Define tokens that describe your language and combine terms.  Write a

data/Rakefile

@@ -1,3 +1,11 @@
+require 'rake/testtask'
+
+task :default => :test
+
+Rake::TestTask.new do |t|
+  t.pattern = "spec/**/*_spec.rb"
+end
+
 task :gem do
   sh "gem build pratt_parser.gemspec"
 end

data/examples/expression_evaluator.rb

@@ -83,8 +83,8 @@ class PrattEvaluator
       token(char, InfixToken.new(lbp, associates, &block))
     end
 
-    token("(", LeftParenToken.new(0))
-    token(")", RightParenToken.new(0))
+    token("(", LeftParenToken.new(1))
+    token(")", RightParenToken.new(1))
 
     infix("=", 10, &:==)
     infix("+", 20, &:+)

data/examples/tree.rb

@@ -2,14 +2,34 @@
 
 # Parses simple arithmetic expressions using a PrattParser.  Supports
 # +, -, *, /, ^ (with customary precedence and associativity), and
-# parentheses.  The parse returns a tree of BinaryNode and NumberNode
-# objects which is printed prefix-style ala Lisp.
+# parentheses.  + and - may be either prefix or infix.  The parse
+# returns a tree of *Node objects which is printed prefix-style ala
+# Lisp.
 #
 # Numeric integer constants are supported using single-digit tokens
 # which are left-associative.
 
 require "pratt_parser"
 
+class UnaryNode
+  def initialize(operator, node)
+    @operator = operator
+    @node = node
+  end
+
+  def to_s
+    "(#{@operator} #{@node})"
+  end
+
+  # Returns a pretty-print version of the expression ala Lisp.
+
+  def pp(indent = "")
+    newindent = indent + "  "
+    "#{indent}(#{@operator}\n#{@node.pp(newindent)})"
+  end
+
+end
+
 class BinaryNode
   def initialize(operator, left, right)
     @operator = operator
@@ -34,7 +54,7 @@ class NumberNode
     @number = number
   end
 
-  def get_number
+  def number
     @number
   end
 
@@ -91,6 +111,16 @@ class TreeBuilder
       end
     end
 
+    # A Bifix token can be either prefix (via nud) or infix (via lcd).
+
+    class BifixToken < InfixToken
+      def nud(parser)
+        # Bind super-right to the right.
+        right = parser.expression(1000000)
+        UnaryNode.new(@operator, right)
+      end
+    end
+
     class DigitToken < Token
       def initialize(lbp, value)
         super(lbp)
@@ -127,12 +157,16 @@ class TreeBuilder
       token(char, InfixToken.new(char, lbp, associates))
     end
 
-    token("(", LeftParenToken.new(0))
-    token(")", RightParenToken.new(0))
+    def self.bifix(char, lbp)
+      token(char, BifixToken.new(char, lbp, :left))
+    end
+
+    token("(", LeftParenToken.new(1))
+    token(")", RightParenToken.new(1))
 
     infix("=", 10)
-    infix("+", 20)
-    infix("-", 20)
+    bifix("+", 20)
+    bifix("-", 20)
     infix("*", 30)
     infix("/", 30)
     infix("^", 40, :right)

data/pratt_parser.gemspec

@@ -8,7 +8,9 @@ Gem::Specification.new do |gem|
   gem.test_files       = `git ls-files -- spec/*`.split("\n")
   gem.name             = "pratt_parser"
   gem.require_paths    = ["lib"]
-  gem.version          = "0.0.2"
+  gem.version          = "0.0.3"
+  # Needs Enumerator which was added in 1.9.
+  gem.required_ruby_version = ">= 1.9"
   gem.license          = "MIT"
 #  gem.required_ruby_version = '>= 2.1.0'
 end

data/spec/pratt_parser_spec.rb

@@ -0,0 +1,77 @@
+# Need a lot more tests than this but it's a start.
+
+require "rubygems"
+require "bundler/setup"
+require "minitest/autorun"
+require "pratt_parser"
+
+describe PrattParser do
+#  it "parses an empty expression" do
+#    lexer = Enumerator.new {}
+#    PrattParser.new(lexer).eval.must_be nil
+#  end
+
+  it "calls nud(self) for the first token in a (sub)expression" do
+    token = MiniTest::Mock.new
+    lexer = Enumerator.new do |y|
+      y << token
+    end
+    parser = PrattParser.new(lexer)
+    token.expect(:nud, "ok", [parser])
+    parser.eval.must_equal "ok"
+    token.verify
+  end
+
+  it "moves on to the next token on a valid expect" do
+    class TokenA
+      def nud(parser)
+        parser.expect(TokenB)
+        "A"
+      end
+    end
+    class TokenB; end
+    class TokenC
+      def lbp; 0; end
+    end
+
+    expected_token = MiniTest::Mock.new
+    expected_token.expect(:class, TokenB, [])
+
+    fetched_expected_token = false
+    lexer = Enumerator.new do |y|
+      y << TokenA.new
+      y << expected_token
+      fetched_expected_token = true
+      y << TokenC.new
+    end
+
+    PrattParser.new(lexer).eval
+
+    assert fetched_expected_token
+  end
+
+  it "fails on invalid expect" do
+    class TokenA
+      def nud(parser)
+        parser.expect(TokenC)
+        "A"
+      end
+    end
+    class TokenB; end
+    class TokenC; end
+
+    unexpected_token = MiniTest::Mock.new
+    unexpected_token.expect(:class, TokenB, [])
+    unexpected_token.expect(:class, TokenB, [])
+
+    lexer = Enumerator.new do |y|
+      y << TokenA.new
+      y << unexpected_token
+    end
+
+    assert_raises RuntimeError do
+      PrattParser.new(lexer).eval
+    end
+  end
+
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: pratt_parser
 version: !ruby/object:Gem::Version
-  version: 0.0.2
+  version: 0.0.3
 platform: ruby
 authors:
 - Tom May
@@ -19,7 +19,10 @@ extensions: []
 extra_rdoc_files: []
 files:
 - ".gitignore"
+- ".travis.yml"
 - CHANGELOG
+- Gemfile
+- Gemfile.lock
 - LICENSE.md
 - README.md
 - Rakefile
@@ -27,6 +30,7 @@ files:
 - examples/tree.rb
 - lib/pratt_parser.rb
 - pratt_parser.gemspec
+- spec/pratt_parser_spec.rb
 homepage: https://github.com/tommay/pratt_parser
 licenses:
 - MIT
@@ -39,7 +43,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
     - !ruby/object:Gem::Version
-      version: '0'
+      version: '1.9'
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
   - - ">="
@@ -51,4 +55,5 @@ rubygems_version: 2.4.5
 signing_key: 
 specification_version: 4
 summary: A Pratt parser.
-test_files: []
+test_files:
+- spec/pratt_parser_spec.rb