pratt_parser 0.0.1 → 0.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: f8429fe8f5e629ccb6048fdc5766a278bbd5f5ae
-  data.tar.gz: 03df74e2cb12a8403dd4025c5a4597d3da067a0f
+  metadata.gz: ca11d04a7ae882b9277380b20a737f9da15d71ff
+  data.tar.gz: 73b065cfad311d5310d37ace99ddd4a78683c81c
 SHA512:
-  metadata.gz: b215b84b04fde6efdbce9c5244ece12be8b9cb9d9e268056cd2699eb63e30f253c93e17e8cfd1287de0fc1702514a26c5b3e4154fa11a21712b248e1019685a9
-  data.tar.gz: e27d791be91a17b96ca7907f32a53274a6ade2a7ab2d88c6cbbfc3d1c77e05f0fc313c560228a6085af4514cf9072d99303e2a31a5c3e8831e768bdce446d9d8
+  metadata.gz: 8a2044d7296b0c958153481589955db1d2e8e40b5b31d937e72ec12175a51d6cbdaff5936e3e0739bfdcae78effe4652c037a474c237d6b9cfe121fb99631c3e
+  data.tar.gz: f576cb77ce8d32f23427dbab99faeaefab17ca438496684ef6732617516207b019bbdc2ca35312c86fa5872a19c89ae0773fba95f11adcae202a86bc409dbb8f

data/CHANGELOG

@@ -1,3 +1,7 @@
+## 0.0.2 ##
+
+  * Add examples/tree.rb.
+
 ## 0.0.1 ##
 
   * Include examples.

data/examples/expression_evaluator.rb

@@ -1,15 +1,15 @@
 #!/usr/bin/env ruby
 
 # Evaluate simple arithmetic expressions using a PrattParser.
-# Supports +, -, *, /, ^ (with ustomarycorrect precedence and
-# associativity, and parentheses.  Also supports = to compare numbers
+# Supports +, -, *, /, ^ (with customary precedence and
+# associativity), and parentheses.  Also supports = to compare numbers
 # and booleans.  Adding support for < and > would be a simple matter
 # of adding some more tokens.
 #
 # Supporting whitespace needs a lexer that throws away whitespace.
 #
 # Numeric integer constants are supported using single-digit tokens
-# which are left-associatiuve.
+# which are left-associative.
 
 require "pratt_parser"
 

data/examples/tree.rb

@@ -0,0 +1,150 @@
+#!/usr/bin/env ruby
+
+# 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.
+#
+# Numeric integer constants are supported using single-digit tokens
+# which are left-associative.
+
+require "pratt_parser"
+
+class BinaryNode
+  def initialize(operator, left, right)
+    @operator = operator
+    @left = left
+    @right = right
+  end
+
+  def to_s
+    "(#{@operator} #{@left} #{@right})"
+  end
+
+  # Returns a pretty-print version of the expression ala Lisp.
+
+  def pp(indent = "")
+    newindent = indent + "  "
+    "#{indent}(#{@operator}\n#{@left.pp(newindent)}\n#{@right.pp(newindent)})"
+  end
+end
+
+class NumberNode
+  def initialize(number)
+    @number = number
+  end
+
+  def get_number
+    @number
+  end
+
+  def to_s
+    @number.to_s
+  end
+
+  # Returns a pretty-print version of the expression ala Lisp.
+
+  def pp(indent = "")
+    "#{indent}#{@number}"
+  end
+end
+
+class TreeBuilder
+  def self.eval(expression)
+    PrattParser.new(Lexer.new(expression)).eval
+  end
+
+  class Lexer
+    # Note that new returns an Enumerator, not a Lexer.
+
+    def self.new(expression)
+      Enumerator.new do |y|
+        expression.each_char do |c|
+          # Discard spaces.
+          if c != " "
+            y << @@tokens[c]
+          end
+        end
+      end
+    end
+
+    class Token
+      def initialize(lbp)
+        @lbp = lbp
+      end
+
+      def lbp
+        @lbp
+      end
+    end
+
+    class InfixToken < Token
+      def initialize(operator, lbp, associates = :left)
+        super(lbp)
+        @operator = operator
+        @rbp = (associates == :left ? lbp : lbp - 1)
+      end
+
+      def led(parser, left)
+        right = parser.expression(@rbp)
+        BinaryNode.new(@operator, left, right)
+      end
+    end
+
+    class DigitToken < Token
+      def initialize(lbp, value)
+        super(lbp)
+        @value = value
+      end
+      
+      def nud(parser)
+        NumberNode.new(@value)
+      end
+
+      def led(parser, left)
+        NumberNode.new(left.number*10 + @value)
+      end
+    end
+    
+    class LeftParenToken < Token
+      def nud(parser)
+        parser.expression(lbp).tap do
+          parser.expect(RightParenToken)
+        end
+      end
+    end
+    
+    class RightParenToken < Token
+    end
+    
+    @@tokens = {}
+    
+    def self.token(char, t)
+      @@tokens[char] = t
+    end
+
+    def self.infix(char, lbp, associates = :left)
+      token(char, InfixToken.new(char, lbp, associates))
+    end
+
+    token("(", LeftParenToken.new(0))
+    token(")", RightParenToken.new(0))
+
+    infix("=", 10)
+    infix("+", 20)
+    infix("-", 20)
+    infix("*", 30)
+    infix("/", 30)
+    infix("^", 40, :right)
+
+    (0..9).each do |d|
+      token(d.to_s, DigitToken.new(100, d))
+    end
+  end
+end
+
+if __FILE__ == $0
+  tree = TreeBuilder.eval(ARGV[0])
+  puts tree.to_s
+  puts tree.pp
+end

data/pratt_parser.gemspec

@@ -8,7 +8,7 @@ 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.1"
+  gem.version          = "0.0.2"
   gem.license          = "MIT"
 #  gem.required_ruby_version = '>= 2.1.0'
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: pratt_parser
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - Tom May
@@ -24,6 +24,7 @@ files:
 - README.md
 - Rakefile
 - examples/expression_evaluator.rb
+- examples/tree.rb
 - lib/pratt_parser.rb
 - pratt_parser.gemspec
 homepage: https://github.com/tommay/pratt_parser