pratt_parser 0.0.0 → 0.0.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 2be786fcdd7e3a6860fd2218ae404036a6de85e1
-  data.tar.gz: b0684865ee6fcbb04ef26544819e43598e2dfa3a
+  metadata.gz: f8429fe8f5e629ccb6048fdc5766a278bbd5f5ae
+  data.tar.gz: 03df74e2cb12a8403dd4025c5a4597d3da067a0f
 SHA512:
-  metadata.gz: 6d7a691fa927a0e0095827cf1abebdf4ac8102a12774b6b60a93693eef495beabe79ef4b6f4885d99ccecf5928957684f7eb1fdc377b032300eec099a8943cc9
-  data.tar.gz: 3d8549f09a0d0b74b45238f390b0124fe5e7cbcaf6e9e25a13513f45701212945044add373e623e8064b005bdb6f2cc313ebfc65dd9700db824b20dec28fcde5
+  metadata.gz: b215b84b04fde6efdbce9c5244ece12be8b9cb9d9e268056cd2699eb63e30f253c93e17e8cfd1287de0fc1702514a26c5b3e4154fa11a21712b248e1019685a9
+  data.tar.gz: e27d791be91a17b96ca7907f32a53274a6ade2a7ab2d88c6cbbfc3d1c77e05f0fc313c560228a6085af4514cf9072d99303e2a31a5c3e8831e768bdce446d9d8

data/CHANGELOG

@@ -0,0 +1,8 @@
+## 0.0.1 ##
+
+  * Include examples.
+
+## 0.0.0 ##
+
+  * Initial release.
+		

data/README.md

@@ -1,19 +1,26 @@
 Pratt Parser
 ============
 
-A Pratt Parser.  Construct it with a Lexer that returns tokens that
-define the language to be parsed and combines terms.
+A Pratt Parser.  Just a simple parsing framework.
+
+Define tokens that describe your language and combine terms.  Write a
+Lexer (an Enumerator) that produces a stream of tokens.  Instantiate a
+PrattParser and call #eval to parse the stream and return whatever
+your tokens want.
 
 Pratt parsers are like recursive descent parsers but instead of having
 to code a function for each production you just code up some token
-objects which define their own prededence and associativity.  So it's
-simple to add new tokens without having to rewrite a bunch of
-recursive descent functions.
+objects which define their own prededence and associativity and how
+subexpressions to the left and/or right are combined.  So it's simple
+to add new language features/tokens without having to rewrite a bunch
+of recursive descent functions.
 
 Pratt parsers are also more efficient than recursive descent parsers
 since they don't need to recurse all the way down to the bottom level
 to figure out what to do.
 
+Read more:
+
 http://javascript.crockford.com/tdop/tdop.html
 
 http://effbot.org/zone/simple-top-down-parsing.htm

data/examples/expression_evaluator.rb

@@ -0,0 +1,104 @@
+#!/usr/bin/env ruby
+
+# Evaluate simple arithmetic expressions using a PrattParser.
+# Supports +, -, *, /, ^ (with ustomarycorrect 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.
+
+require "pratt_parser"
+
+class PrattEvaluator
+  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)
+      expression.each_char.lazy.map{|c|@@tokens[c]}
+    end
+
+    class Token
+      def initialize(lbp)
+        @lbp = lbp
+      end
+
+      def lbp
+        @lbp
+      end
+    end
+
+    class InfixToken < Token
+      def initialize(lbp, associates = :left, &block)
+        super(lbp)
+        @block = block
+        @rbp = (associates == :left ? lbp : lbp - 1)
+      end
+
+      def led(parser, left)
+        @block.call(left, parser.expression(@rbp))
+      end
+    end
+
+    class DigitToken < Token
+      def initialize(lbp, value)
+        super(lbp)
+        @value = value
+      end
+      
+      def nud(parser)
+        @value
+      end
+      
+      def led(parser, left)
+        left*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, &block)
+      token(char, InfixToken.new(lbp, associates, &block))
+    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.to_f))
+    end
+  end
+end
+
+if __FILE__ == $0
+  puts PrattEvaluator.eval(ARGV[0])
+end

data/pratt_parser.gemspec

@@ -1,14 +1,14 @@
 Gem::Specification.new do |gem|
-  gem.description      = "A Pratt parser.  Create token objects to define your language."
+  gem.description      = "A Pratt parser.  Create token objects to define your language.  Create a lexer to return tokens.  Call the parser to grok the language."
   gem.summary          = "A Pratt parser."
   gem.authors          = ["Tom May"]
   gem.email            = ["tom@tommay.net"]
   gem.homepage         = "https://github.com/tommay/pratt_parser"
-  gem.files            = `git ls-files | egrep -v '^example'`.split("\n")
+  gem.files            = `git ls-files`.split("\n")
   gem.test_files       = `git ls-files -- spec/*`.split("\n")
   gem.name             = "pratt_parser"
   gem.require_paths    = ["lib"]
-  gem.version          = "0.0.0"
+  gem.version          = "0.0.1"
   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.0
+  version: 0.0.1
 platform: ruby
 authors:
 - Tom May
@@ -10,7 +10,8 @@ bindir: bin
 cert_chain: []
 date: 2015-02-26 00:00:00.000000000 Z
 dependencies: []
-description: A Pratt parser.  Create token objects to define your language.
+description: A Pratt parser.  Create token objects to define your language.  Create
+  a lexer to return tokens.  Call the parser to grok the language.
 email:
 - tom@tommay.net
 executables: []
@@ -18,9 +19,11 @@ extensions: []
 extra_rdoc_files: []
 files:
 - ".gitignore"
+- CHANGELOG
 - LICENSE.md
 - README.md
 - Rakefile
+- examples/expression_evaluator.rb
 - lib/pratt_parser.rb
 - pratt_parser.gemspec
 homepage: https://github.com/tommay/pratt_parser