babel_bridge 0.5.1 → 0.5.3

data/examples/turing/examples.turing

@@ -1,33 +0,0 @@
-# this language doesn't support comments, should copy-paste the examples between
-# the comments
-
-# calculate 2^[0]
-[0]=10;[1]=1;while [0]>0 do [0]=[0]-1;[1]=[1]*2 end;[1]
-
-# return the [0]th number in the fibonancci sequence:
-# [0] == fib number to output
-# [1] == current fib number 
-# [2] == fib[[1]]
-# [3] == fib[[1]-1]
-# [4] == temp
-[0]=5;[1]=2;[2]=[3]=1;while [1]<[0] do [4]=[2]+[3];[2]=[3];[3]=[4];[1]=[1]+1 end;[3]
-
-# simulate a turing machine
-# [0] == current state
-# [1] == head position
-# [2] == number of symbols this machine recognizes
-# [3] == current state + read value offset
-# [state*[2]*3+10] == write at the current head position(nil or any number)
-# [state*[2]*3+11] == move head amount (-1, 0, 1)
-# [state*[2]*3+12] == next-state (states starting from 0)
-# [10000+] == tape - pick a large enough constant that the turing machine doesn't corrupt your states
-# -1 is the stop-state
-# Assumes you initalized your turing program for all your states.
-[0]=-1;
-[1]=10000; 
-while [0]>=0 do 
-  [3] = 10 + ([0]*[2]+[[1]]) * 3;
-  [[1]] = [[3]];
-  [1] = [1] + [[3]+1];
-  [0] = [[3]+2];
-end

data/examples/turing/notes.rb

@@ -1,111 +0,0 @@
-turing0: #babel-bridge setup
-turing1: #introducing rules -> show interactive shell in action
-  rule :int, /[-]?[0-9]+/
-
-turing2: #the "add" rule (with 2 variants to support recursive matching)
-  rule :add, :int, "+", :add
-  rule :add, :int
-
-turing3: #add evaluate methods
-  rule :add, :int, "+", :add do
-    def evaluate
-      int.evaluate + add.evaluate
-    end
-  end
-  rule :add, :int
-
-  rule :int, /[-]?[0-9]+/ do
-    def evaluate
-      to_s.to_i
-    end
-  end
-
-turing4: #multiple operators, but "3*10+2" or "2+10*3" breaks!
-  # add :operator rule, update evaluate
-  rule :add, :int, /[-+\/*]/, :add do
-    def evaluate
-      int.evaluate.send match[1].to_s.to_sym, add.evaluate
-    end
-  end
-
-turing5: # binary_operators_rule
-  # replace all but the int rule with:
-  binary_operators_rule :statement, :int, [[:/, :*], [:+, :-]] do
-    def evaluate
-      left.evaluate.send operator, right.evaluate
-    end
-  end
-
-turing6: # add parenthesis
-  # rename :int to :operand
-  rule :operand, "(", :statement, ")"
-
-turing7: # show "5 + 2" fails -> ignore_whitespace
-  ignore_whitespace
-
-turing8: # add comparators
-  binary_operators_rule :statement, :operand, [[:/, :*], [:+, :-], 
-      [:<, :<=, :>, :>=, :==]] do
-    def evaluate
-      case operator
-      when :<, :<=, :>, :>=, :==
-        (left.evaluate.send operator, right.evaluate) ? 1 : nil
-      else
-        left.evaluate.send operator, right.evaluate
-      end
-    end
-  end
-
-turing9: # add if 
-  rule :statement, "if", :statement, "then", :statement, :else_clause?, "end" do
-    def evaluate
-      if matches[1].evaluate
-        matches[3].evaluate
-      else 
-        else_clause.evaluate if else_clause
-      end
-    end
-  end
-  rule :else_clause, "else", :statement
-
-turing10: #add store
-
-  def store
-    @store||=[]
-  end
-
-    rule :operand, "[", :statement, "]", "=", :statement do
-    def evaluate
-      parser.store[statement[0].evaluate] = statement[1].evaluate
-    end
-  end
-
-  rule :operand, "[", :statement, "]" do
-    def evaluate
-      parser.store[statement.evaluate]
-    end
-  end
-
-turing11: #statements
-  # update "if" bodies to have statements
-
-  rule :statements, many(:statement,";"), match?(";") do
-    def evaluate
-      ret = nil
-      statement.each do |s|
-        ret = s.evaluate
-      end
-      ret
-    end
-  end
-
-turing12: # while
-
-  rule :statement, "while", :statement, "do", :statements, "end" do
-    def evaluate
-      while statement.evaluate
-        statements.evaluate
-      end
-    end
-  end
-  

data/examples/turing/turing_demo.rb

@@ -1,71 +0,0 @@
-require "babel_bridge"
-
-class TuringParser < BabelBridge::Parser
-  ignore_whitespace
-
-  def store
-    @store||=[]
-  end
-
-  rule :statements, many(:statement,";"), match?(";") do
-    def evaluate
-      ret = nil
-      statement.each do |s|
-        ret = s.evaluate
-      end
-      ret
-    end
-  end
-
-  rule :statement, "if", :statement, "then", :statements, :else_clause?, "end" do
-    def evaluate
-      if matches[1].evaluate
-        matches[3].evaluate
-      else 
-        else_clause.evaluate if else_clause
-      end
-    end
-  end
-  rule :else_clause, "else", :statements
-
-  rule :statement, "while", :statement, "do", :statements, "end" do
-    def evaluate
-      while statement.evaluate
-        statements.evaluate
-      end
-    end
-  end
-
-  binary_operators_rule :statement, :operand, [[:/, :*], [:+, :-], [:<, :<=, :>, :>=, :==]] do
-    def evaluate
-      res = left.evaluate.send operator, right.evaluate
-      case operator
-      when :<, :<=, :>, :>=, :==
-        res ? 1 : nil
-      else
-        res
-      end    
-    end
-  end
-
-  rule :operand, "[", :statement, "]", "=", :statement do
-    def evaluate
-      parser.store[statement[0].evaluate] = statement[1].evaluate
-    end
-  end
-
-  rule :operand, "[", :statement, "]" do
-    def evaluate
-      parser.store[statement.evaluate]
-    end
-  end
-
-  rule :operand, "(", :statement, ")"
-  rule :operand, /[-]?[0-9]+/ do
-    def evaluate
-      to_s.to_i
-    end
-  end
-end
-
-BabelBridge::Shell.new(TuringParser.new).start

data/lib/version.rb

@@ -1,4 +0,0 @@
-module BabelBridge
-  # last release: 0.4.1
-  VERSION = "0.5.1"
-end