methic 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: a28f40b0c1a99dc37830175725f8319468a46ab4
+  data.tar.gz: 7a96c2312722b4f3498aaaf6fbfe4142b8bb76f9
+SHA512:
+  metadata.gz: 6908e75f68ea08980bda60ccf9814093095773c6f8cd20193de3a9c442d494e04117c1d9dcda0ea7725906efb474d06528db8e1f7248eff16da9061265a00372
+  data.tar.gz: 2e2b9d8f6550734dc81d2e6372b59275596d1faeafd44515e45c27872f34741f77b38e05f7638ed314f6da7ad05b41fec10cedd82cd68e3cd7c064e6e0362dde

data/.gitignore

@@ -0,0 +1,22 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log

data/.travis.yml

@@ -0,0 +1 @@
+language: ruby

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in methic.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 Josef Šimánek
+
+MIT License
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,56 @@
+# Methic [![Build Status](https://travis-ci.org/zizkovrb/methic.svg?branch=master)](https://travis-ci.org/zizkovrb/methic)
+
+Simple arithmetic implemented by Treetop.
+
+Heavily based on [treetop arithmetic example](https://github.com/cjheath/treetop/blob/master/examples/lambda_calculus/arithmetic.treetop).
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'methic'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install methic
+
+## Usage
+
+```ruby
+parser = MethicParser.new
+
+parser.parse('0').eval #=> 0
+parser.parse('1').eval #=> 1
+parser.parse('123').eval #=> 123
+
+parser.parse('x').eval('x' => 0) #=> 0
+parser.parse('x').eval('x' => 3) #=> 3
+parser.parse('y').eval('y' => 10) #=> 10
+
+parser.parse('x + 5').eval('x' => 5) #=> 10
+parser.parse('x - 5').eval('x' => 5) #=> 0
+parser.parse('x * 2').eval('x' => 3) #=> 6
+parser.parse('x / 2').eval('x' => 6) #=> 3
+
+parser.parse('1 + 2 * 3 + 4').eval #=> 11
+parser.parse('5 - 2 - 1').eval #=> 2
+
+parser.parse('(5 + x) * (10 - y)').eval('x' => 0, 'y' => 5) #=> 25
+
+parser.parse('4 == 4').eval #=> true
+parser.parse('4 == 3').eval #=> false
+```
+
+## Contributing
+
+1. Fork it ( https://github.com/zizkovrb/methic/fork )
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create a new Pull Request

data/Rakefile

@@ -0,0 +1,17 @@
+require "bundler/gem_tasks"
+require 'treetop'
+require 'rake/testtask'
+
+Rake::TestTask.new(:test) do |t|
+  t.libs << 'test'
+  t.pattern = 'test/**/*_test.rb'
+end
+
+desc 'Compile treetop to ruby'
+task :compile do
+  compiler = Treetop::Compiler::GrammarCompiler.new
+  treetop_file = File.expand_path('../lib/methic.tt', __FILE__)
+  compiler.compile(treetop_file)
+end
+
+task :default => [:compile, :test]

data/lib/methic.rb

@@ -0,0 +1,727 @@
+# Autogenerated from a Treetop grammar. Edits may be lost.
+
+
+require 'treetop'
+require 'methic_node_classes'
+
+module Methic
+  include Treetop::Runtime
+
+  def root
+    @root ||= :expression
+  end
+
+  def _nt_expression
+    start_index = index
+    if node_cache[:expression].has_key?(index)
+      cached = node_cache[:expression][index]
+      if cached
+        node_cache[:expression][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0 = index
+    r1 = _nt_comparative
+    if r1
+      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
+      r0 = r1
+    else
+      r2 = _nt_additive
+      if r2
+        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
+        r0 = r2
+      else
+        @index = i0
+        r0 = nil
+      end
+    end
+
+    node_cache[:expression][start_index] = r0
+
+    r0
+  end
+
+  module Comparative0
+    def space1
+      elements[0]
+    end
+
+    def operator
+      elements[1]
+    end
+
+    def space2
+      elements[2]
+    end
+
+    def operand
+      elements[3]
+    end
+  end
+
+  module Comparative1
+    def head
+      elements[0]
+    end
+
+    def tail
+      elements[1]
+    end
+  end
+
+  def _nt_comparative
+    start_index = index
+    if node_cache[:comparative].has_key?(index)
+      cached = node_cache[:comparative][index]
+      if cached
+        node_cache[:comparative][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0, s0 = index, []
+    r1 = _nt_additive
+    s0 << r1
+    if r1
+      s2, i2 = [], index
+      loop do
+        i3, s3 = index, []
+        r4 = _nt_space
+        s3 << r4
+        if r4
+          r5 = _nt_equality_op
+          s3 << r5
+          if r5
+            r6 = _nt_space
+            s3 << r6
+            if r6
+              r7 = _nt_additive
+              s3 << r7
+            end
+          end
+        end
+        if s3.last
+          r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
+          r3.extend(Comparative0)
+        else
+          @index = i3
+          r3 = nil
+        end
+        if r3
+          s2 << r3
+        else
+          break
+        end
+      end
+      r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
+      s0 << r2
+    end
+    if s0.last
+      r0 = instantiate_node(BinaryOperation,input, i0...index, s0)
+      r0.extend(Comparative1)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:comparative][start_index] = r0
+
+    r0
+  end
+
+  module EqualityOp0
+    def apply(a, b)
+      a == b
+    end
+  end
+
+  def _nt_equality_op
+    start_index = index
+    if node_cache[:equality_op].has_key?(index)
+      cached = node_cache[:equality_op][index]
+      if cached
+        node_cache[:equality_op][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    if (match_len = has_terminal?('==', false, index))
+      r0 = instantiate_node(SyntaxNode,input, index...(index + match_len))
+      r0.extend(EqualityOp0)
+      @index += match_len
+    else
+      terminal_parse_failure('==')
+      r0 = nil
+    end
+
+    node_cache[:equality_op][start_index] = r0
+
+    r0
+  end
+
+  module Additive0
+    def space1
+      elements[0]
+    end
+
+    def operator
+      elements[1]
+    end
+
+    def space2
+      elements[2]
+    end
+
+    def operand
+      elements[3]
+    end
+  end
+
+  module Additive1
+    def head
+      elements[0]
+    end
+
+    def tail
+      elements[1]
+    end
+  end
+
+  def _nt_additive
+    start_index = index
+    if node_cache[:additive].has_key?(index)
+      cached = node_cache[:additive][index]
+      if cached
+        node_cache[:additive][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0, s0 = index, []
+    r1 = _nt_multitive
+    s0 << r1
+    if r1
+      s2, i2 = [], index
+      loop do
+        i3, s3 = index, []
+        r4 = _nt_space
+        s3 << r4
+        if r4
+          r5 = _nt_additive_op
+          s3 << r5
+          if r5
+            r6 = _nt_space
+            s3 << r6
+            if r6
+              r7 = _nt_multitive
+              s3 << r7
+            end
+          end
+        end
+        if s3.last
+          r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
+          r3.extend(Additive0)
+        else
+          @index = i3
+          r3 = nil
+        end
+        if r3
+          s2 << r3
+        else
+          break
+        end
+      end
+      r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
+      s0 << r2
+    end
+    if s0.last
+      r0 = instantiate_node(BinaryOperation,input, i0...index, s0)
+      r0.extend(Additive1)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:additive][start_index] = r0
+
+    r0
+  end
+
+  module AdditiveOp0
+    def apply(a, b)
+      a + b
+    end
+  end
+
+  module AdditiveOp1
+    def apply(a, b)
+      a - b
+    end
+  end
+
+  def _nt_additive_op
+    start_index = index
+    if node_cache[:additive_op].has_key?(index)
+      cached = node_cache[:additive_op][index]
+      if cached
+        node_cache[:additive_op][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0 = index
+    if (match_len = has_terminal?('+', false, index))
+      r1 = instantiate_node(SyntaxNode,input, index...(index + match_len))
+      r1.extend(AdditiveOp0)
+      @index += match_len
+    else
+      terminal_parse_failure('+')
+      r1 = nil
+    end
+    if r1
+      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
+      r0 = r1
+    else
+      if (match_len = has_terminal?('-', false, index))
+        r2 = instantiate_node(SyntaxNode,input, index...(index + match_len))
+        r2.extend(AdditiveOp1)
+        @index += match_len
+      else
+        terminal_parse_failure('-')
+        r2 = nil
+      end
+      if r2
+        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
+        r0 = r2
+      else
+        @index = i0
+        r0 = nil
+      end
+    end
+
+    node_cache[:additive_op][start_index] = r0
+
+    r0
+  end
+
+  module Multitive0
+    def space1
+      elements[0]
+    end
+
+    def operator
+      elements[1]
+    end
+
+    def space2
+      elements[2]
+    end
+
+    def operand
+      elements[3]
+    end
+  end
+
+  module Multitive1
+    def head
+      elements[0]
+    end
+
+    def tail
+      elements[1]
+    end
+  end
+
+  def _nt_multitive
+    start_index = index
+    if node_cache[:multitive].has_key?(index)
+      cached = node_cache[:multitive][index]
+      if cached
+        node_cache[:multitive][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0, s0 = index, []
+    r1 = _nt_primary
+    s0 << r1
+    if r1
+      s2, i2 = [], index
+      loop do
+        i3, s3 = index, []
+        r4 = _nt_space
+        s3 << r4
+        if r4
+          r5 = _nt_multitive_op
+          s3 << r5
+          if r5
+            r6 = _nt_space
+            s3 << r6
+            if r6
+              r7 = _nt_primary
+              s3 << r7
+            end
+          end
+        end
+        if s3.last
+          r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
+          r3.extend(Multitive0)
+        else
+          @index = i3
+          r3 = nil
+        end
+        if r3
+          s2 << r3
+        else
+          break
+        end
+      end
+      r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
+      s0 << r2
+    end
+    if s0.last
+      r0 = instantiate_node(BinaryOperation,input, i0...index, s0)
+      r0.extend(Multitive1)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:multitive][start_index] = r0
+
+    r0
+  end
+
+  module MultitiveOp0
+    def apply(a, b)
+      a * b
+    end
+  end
+
+  module MultitiveOp1
+    def apply(a, b)
+      a / b
+    end
+  end
+
+  def _nt_multitive_op
+    start_index = index
+    if node_cache[:multitive_op].has_key?(index)
+      cached = node_cache[:multitive_op][index]
+      if cached
+        node_cache[:multitive_op][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0 = index
+    if (match_len = has_terminal?('*', false, index))
+      r1 = instantiate_node(SyntaxNode,input, index...(index + match_len))
+      r1.extend(MultitiveOp0)
+      @index += match_len
+    else
+      terminal_parse_failure('*')
+      r1 = nil
+    end
+    if r1
+      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
+      r0 = r1
+    else
+      if (match_len = has_terminal?('/', false, index))
+        r2 = instantiate_node(SyntaxNode,input, index...(index + match_len))
+        r2.extend(MultitiveOp1)
+        @index += match_len
+      else
+        terminal_parse_failure('/')
+        r2 = nil
+      end
+      if r2
+        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
+        r0 = r2
+      else
+        @index = i0
+        r0 = nil
+      end
+    end
+
+    node_cache[:multitive_op][start_index] = r0
+
+    r0
+  end
+
+  module Primary0
+    def space1
+      elements[1]
+    end
+
+    def expression
+      elements[2]
+    end
+
+    def space2
+      elements[3]
+    end
+
+  end
+
+  module Primary1
+    def eval(env={})
+      expression.eval(env)
+    end
+  end
+
+  def _nt_primary
+    start_index = index
+    if node_cache[:primary].has_key?(index)
+      cached = node_cache[:primary][index]
+      if cached
+        node_cache[:primary][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0 = index
+    r1 = _nt_variable
+    if r1
+      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
+      r0 = r1
+    else
+      r2 = _nt_number
+      if r2
+        r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
+        r0 = r2
+      else
+        i3, s3 = index, []
+        if (match_len = has_terminal?('(', false, index))
+          r4 = true
+          @index += match_len
+        else
+          terminal_parse_failure('(')
+          r4 = nil
+        end
+        s3 << r4
+        if r4
+          r5 = _nt_space
+          s3 << r5
+          if r5
+            r6 = _nt_expression
+            s3 << r6
+            if r6
+              r7 = _nt_space
+              s3 << r7
+              if r7
+                if (match_len = has_terminal?(')', false, index))
+                  r8 = true
+                  @index += match_len
+                else
+                  terminal_parse_failure(')')
+                  r8 = nil
+                end
+                s3 << r8
+              end
+            end
+          end
+        end
+        if s3.last
+          r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
+          r3.extend(Primary0)
+          r3.extend(Primary1)
+        else
+          @index = i3
+          r3 = nil
+        end
+        if r3
+          r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
+          r0 = r3
+        else
+          @index = i0
+          r0 = nil
+        end
+      end
+    end
+
+    node_cache[:primary][start_index] = r0
+
+    r0
+  end
+
+  module Variable0
+    def eval(env={})
+      env[name]
+    end
+    
+    def name
+      text_value
+    end
+  end
+
+  def _nt_variable
+    start_index = index
+    if node_cache[:variable].has_key?(index)
+      cached = node_cache[:variable][index]
+      if cached
+        node_cache[:variable][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    s0, i0 = [], index
+    loop do
+      if has_terminal?(@regexps[gr = '\A[a-z]'] ||= Regexp.new(gr), :regexp, index)
+        r1 = true
+        @index += 1
+      else
+        terminal_parse_failure('[a-z]')
+        r1 = nil
+      end
+      if r1
+        s0 << r1
+      else
+        break
+      end
+    end
+    if s0.empty?
+      @index = i0
+      r0 = nil
+    else
+      r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
+      r0.extend(Variable0)
+    end
+
+    node_cache[:variable][start_index] = r0
+
+    r0
+  end
+
+  module Number0
+  end
+
+  module Number1
+    def eval(env={})
+      text_value.to_i
+    end
+  end
+
+  def _nt_number
+    start_index = index
+    if node_cache[:number].has_key?(index)
+      cached = node_cache[:number][index]
+      if cached
+        node_cache[:number][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0 = index
+    i1, s1 = index, []
+    if has_terminal?(@regexps[gr = '\A[1-9]'] ||= Regexp.new(gr), :regexp, index)
+      r2 = true
+      @index += 1
+    else
+      terminal_parse_failure('[1-9]')
+      r2 = nil
+    end
+    s1 << r2
+    if r2
+      s3, i3 = [], index
+      loop do
+        if has_terminal?(@regexps[gr = '\A[0-9]'] ||= Regexp.new(gr), :regexp, index)
+          r4 = true
+          @index += 1
+        else
+          terminal_parse_failure('[0-9]')
+          r4 = nil
+        end
+        if r4
+          s3 << r4
+        else
+          break
+        end
+      end
+      r3 = instantiate_node(SyntaxNode,input, i3...index, s3)
+      s1 << r3
+    end
+    if s1.last
+      r1 = instantiate_node(SyntaxNode,input, i1...index, s1)
+      r1.extend(Number0)
+    else
+      @index = i1
+      r1 = nil
+    end
+    if r1
+      r1 = SyntaxNode.new(input, (index-1)...index) if r1 == true
+      r0 = r1
+      r0.extend(Number1)
+    else
+      if (match_len = has_terminal?('0', false, index))
+        r5 = true
+        @index += match_len
+      else
+        terminal_parse_failure('0')
+        r5 = nil
+      end
+      if r5
+        r5 = SyntaxNode.new(input, (index-1)...index) if r5 == true
+        r0 = r5
+        r0.extend(Number1)
+      else
+        @index = i0
+        r0 = nil
+      end
+    end
+
+    node_cache[:number][start_index] = r0
+
+    r0
+  end
+
+  def _nt_space
+    start_index = index
+    if node_cache[:space].has_key?(index)
+      cached = node_cache[:space][index]
+      if cached
+        node_cache[:space][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    s0, i0 = [], index
+    loop do
+      if (match_len = has_terminal?(' ', false, index))
+        r1 = true
+        @index += match_len
+      else
+        terminal_parse_failure(' ')
+        r1 = nil
+      end
+      if r1
+        s0 << r1
+      else
+        break
+      end
+    end
+    r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
+
+    node_cache[:space][start_index] = r0
+
+    r0
+  end
+
+end
+
+class MethicParser < Treetop::Runtime::CompiledParser
+  include Methic
+end
+

data/lib/methic.tt

@@ -0,0 +1,101 @@
+require 'treetop'
+require 'methic_node_classes'
+
+grammar Methic
+  rule expression
+    comparative / additive
+  end
+  
+  rule comparative
+    head:additive
+    tail:(
+      space operator:equality_op
+      space operand:additive)* <BinaryOperation>
+  end
+  
+  rule equality_op
+    '==' {
+      def apply(a, b)
+        a == b
+      end
+    }
+  end
+  
+  rule additive
+    head:multitive
+    tail:(
+      space operator:additive_op
+      space operand:multitive)* <BinaryOperation>
+  end
+  
+  rule additive_op
+    '+' {
+      def apply(a, b)
+        a + b
+      end
+    }
+    /
+    '-' {
+      def apply(a, b)
+        a - b
+      end
+    }
+  end
+
+  rule multitive
+    head:primary
+    tail:(
+      space operator:multitive_op
+      space operand:primary)* <BinaryOperation>
+  end
+  
+  rule multitive_op
+    '*' {
+      def apply(a, b)
+        a * b
+      end
+    }
+    /
+    '/' {
+      def apply(a, b)
+        a / b
+      end
+    }
+  end  
+  
+  rule primary
+    variable
+    /
+    number
+    /
+    '(' space expression space ')' {
+      def eval(env={})
+        expression.eval(env)
+      end
+    }
+  end
+
+  rule variable
+    [a-z]+ {
+      def eval(env={})
+        env[name]
+      end
+      
+      def name
+        text_value
+      end
+    }
+  end
+
+  rule number
+    ([1-9] [0-9]* / '0') {
+      def eval(env={})
+        text_value.to_i
+      end
+    }
+  end
+  
+  rule space
+    ' '*
+  end
+end

data/lib/methic/version.rb

@@ -0,0 +1,3 @@
+module Methic
+  VERSION = "0.0.1"
+end

data/lib/methic_node_classes.rb

@@ -0,0 +1,9 @@
+module Methic
+  class BinaryOperation < Treetop::Runtime::SyntaxNode
+    def eval(env={})
+      tail.elements.inject(head.eval(env)) do |value, element|
+        element.operator.apply(value, element.operand.eval(env))
+      end
+    end
+  end
+end

data/methic.gemspec

@@ -0,0 +1,24 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'methic/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "methic"
+  spec.version       = Methic::VERSION
+  spec.authors       = ["Josef Šimánek"]
+  spec.email         = ["josef.simanek@gmail.com"]
+  spec.summary       = %q{Simple arithmetic implemented by Treetop.}
+  spec.homepage      = "https://github.com/zizkovrb/methic"
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_dependency "treetop"
+
+  spec.add_development_dependency "minitest", "~> 5.0"
+  spec.add_development_dependency "rake"
+end

data/test/methic_test.rb

@@ -0,0 +1,54 @@
+require 'test_helper'
+
+class MethicParserTest < Minitest::Test
+  include ParserTestHelper
+
+  def setup
+    @parser = MethicParser.new
+  end
+
+  def test_number
+    assert_equal 0, parse('0').eval
+    assert_equal 1, parse('1').eval
+    assert_equal 123, parse('123').eval
+  end
+
+  def test_variable
+    assert_equal 0, parse('x').eval('x' => 0)
+    assert_equal 3, parse('x').eval('x' => 3)
+    assert_equal 10, parse('y').eval('y' => 10)
+  end
+
+  def test_addition
+    assert_equal 10, parse('x + 5').eval('x' => 5)
+  end
+
+  def test_subtraction
+    assert_equal 0, parse('x - 5').eval('x' => 5)
+  end
+
+  def test_multiplication
+    assert_equal 6, parse('x * 2').eval('x' => 3)
+  end
+
+  def test_division
+    assert_equal 3, parse('x / 2').eval('x' => 6)
+  end
+
+  def test_order_of_operations
+    assert_equal 11, parse('1 + 2 * 3 + 4').eval
+  end
+
+  def test_left_to_right
+    assert_equal 2, parse('5 - 2 - 1').eval
+  end
+
+  def test_parentheses
+    assert_equal 25, parse('(5 + x) * (10 - y)').eval('x' => 0, 'y' => 5)
+  end
+
+  def test_equality
+    assert parse('4 == 4').eval
+    assert !parse('4 == 3').eval
+  end
+end

data/test/test_helper.rb

@@ -0,0 +1,18 @@
+require 'bundler/setup'
+require 'minitest/autorun'
+require 'methic'
+
+module ParserTestHelper
+  def assert_evals_to_self(input)
+    assert_evals_to(input, input)
+  end
+
+  def parse(input)
+    result = @parser.parse(input)
+    unless result
+      puts @parser.terminal_failures.join("\n")
+    end
+    assert !result.nil?
+    result
+  end
+end

metadata

@@ -0,0 +1,102 @@
+--- !ruby/object:Gem::Specification
+name: methic
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Josef Šimánek
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-05-08 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: treetop
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '5.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '5.0'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: 
+email:
+- josef.simanek@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- .travis.yml
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- lib/methic.rb
+- lib/methic.tt
+- lib/methic/version.rb
+- lib/methic_node_classes.rb
+- methic.gemspec
+- test/methic_test.rb
+- test/test_helper.rb
+homepage: https://github.com/zizkovrb/methic
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.2.1
+signing_key: 
+specification_version: 4
+summary: Simple arithmetic implemented by Treetop.
+test_files:
+- test/methic_test.rb
+- test/test_helper.rb
+has_rdoc: