brainfuck-rb 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 61f75a20af1bb4192279cd1c93009d9fa54c91e9
+  data.tar.gz: 7d8a008799e664f0da54acee9ae7a4661c28ee1c
+SHA512:
+  metadata.gz: b1171d7277b7d96a441f78e2a778c235a03625491a1a8601ccc11705296f484a64b94859dd08ed2c4af3a330b1c3a31b1c2adfe1b925c89519d69961692937a1
+  data.tar.gz: 4b7f3805fa508659c7f7132c4d22bf90944ea8564aa6a49c4e666c50448b311cd5bfcbd20e7c221b51d146c9421b736aedbce1368985bef8de3084f8139cfffb

data/bin/brainfuck

@@ -0,0 +1,11 @@
+#!/usr/bin/env ruby -I.
+
+require "brainfuck-rb"
+
+unless ARGV.length > 0
+  puts "USAGE"
+  puts "\tbrainfuck FILE_NAME"
+  exit
+end
+
+Brainfuck.eval(ARGV[0])

data/lib/brainfuck-rb.rb

@@ -0,0 +1,7 @@
+require "lang/interpreter"
+
+module Brainfuck
+  def self.eval(file)
+    Interpreter.new.eval(File.read(file))
+  end
+end

data/lib/lang/interpreter.rb

@@ -0,0 +1,59 @@
+require "io/console"
+require "lang/parser"
+require "lang/runtime"
+
+module Brainfuck
+  class Interpreter
+    def initialize
+      @parser = Parser.new
+      @runtime = Runtime.new
+    end
+
+    def eval(code, show_nodes = false)
+      nodes = @parser.parse(code)
+      p nodes if show_nodes
+      nodes.eval(@runtime)
+    end
+  end
+
+  class Nodes
+    def eval(runtime)
+      nodes.each do |node|
+        node.eval(runtime)
+      end
+    end
+  end
+
+  class ShiftNode
+    def eval(runtime)
+      runtime.shift(direction)
+    end
+  end
+
+  class OperationNode
+    def eval(runtime)
+      runtime.mutate(type)
+    end
+  end
+
+  class LoopNode
+    def eval(runtime)
+      loop do
+        loop_body.eval(runtime)
+        break if runtime.value == 0
+      end
+    end
+  end
+
+  class ReadNode
+    def eval(runtime)
+      runtime.value = $stdin.getch.ord
+    end
+  end
+
+  class PrintNode
+    def eval(runtime)
+      print runtime.value.chr
+    end
+  end
+end

data/lib/lang/lexer.rb

@@ -0,0 +1,26 @@
+module Brainfuck
+  class Lexer
+    class << self
+      OPERATORS = ['>', '<', '+', '-', '[', ']', ',', '.']
+      def tokenize(code)
+        tokens = []
+        unless code && code.length > 0
+          tokens
+        end
+        i = 0
+        while i < code.length
+          case code[i..-1]
+          when /\A(\s+)/
+            i += $1.length # ignore whitespace
+          when /\A(.)/
+            if OPERATORS.include? $1
+              tokens << [$1, $1]
+            end # Comment is anything other than operators, so ignore
+            i += 1
+          end
+        end
+        tokens
+      end
+    end
+  end
+end

data/lib/lang/nodes.rb

@@ -0,0 +1,13 @@
+module Brainfuck
+  class Nodes < Struct.new(:nodes)
+    def <<(node)
+      nodes << node
+      self
+    end
+  end
+  class ShiftNode < Struct.new(:direction); end
+  class OperationNode < Struct.new(:type); end
+  class LoopNode < Struct.new(:loop_body); end
+  class ReadNode; end
+  class PrintNode; end
+end

data/lib/lang/parser.rb

@@ -0,0 +1,234 @@
+#
+# DO NOT MODIFY!!!!
+# This file is automatically generated by Racc 1.4.9
+# from Racc grammer file "".
+#
+
+require 'racc/parser.rb'
+
+  require "lang/lexer"
+  require "lang/nodes"
+
+module Brainfuck
+
+class Parser < Racc::Parser
+
+module_eval(<<'...end grammer.y/module_eval...', 'grammer.y', 46)
+  def parse(code, show_tokens = false)
+    @tokens = Lexer.tokenize(code)
+    p @tokens if show_tokens
+    do_parse
+  end
+
+  def next_token
+    @tokens.shift
+  end
+...end grammer.y/module_eval...
+##### State transition tables begin ###
+
+racc_action_table = [
+     8,     9,    10,    18,    11,    12,    13,    14,     8,     9,
+    10,    19,    11,    12,    13,    14,     8,     9,    10,    15,
+    11,    12,    13,    14,     8,     9,    10,   nil,    11,    12,
+    13,    14 ]
+
+racc_action_check = [
+     0,     0,     0,    15,     0,     0,     0,     0,    17,    17,
+    17,    17,    17,    17,    17,    17,     2,     2,     2,     1,
+     2,     2,     2,     2,    10,    10,    10,   nil,    10,    10,
+    10,    10 ]
+
+racc_action_pointer = [
+    -2,    19,    14,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
+    22,   nil,   nil,   nil,   nil,     3,   nil,     6,   nil,   nil ]
+
+racc_action_default = [
+    -1,   -16,    -2,    -3,    -5,    -6,    -7,    -8,    -9,   -10,
+   -16,   -12,   -13,   -14,   -15,   -16,    -4,   -16,    20,   -11 ]
+
+racc_goto_table = [
+    16,     2,     1,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
+   nil,    17,   nil,   nil,   nil,    16 ]
+
+racc_goto_check = [
+     3,     2,     1,   nil,   nil,   nil,   nil,   nil,   nil,   nil,
+   nil,     2,   nil,   nil,   nil,     3 ]
+
+racc_goto_pointer = [
+   nil,     2,     1,    -2,   nil,   nil,   nil,   nil ]
+
+racc_goto_default = [
+   nil,   nil,   nil,     3,     4,     5,     6,     7 ]
+
+racc_reduce_table = [
+  0, 0, :racc_error,
+  0, 11, :_reduce_1,
+  1, 11, :_reduce_2,
+  1, 12, :_reduce_3,
+  2, 12, :_reduce_4,
+  1, 13, :_reduce_none,
+  1, 13, :_reduce_none,
+  1, 13, :_reduce_none,
+  1, 13, :_reduce_none,
+  1, 14, :_reduce_9,
+  1, 14, :_reduce_10,
+  3, 15, :_reduce_11,
+  1, 16, :_reduce_12,
+  1, 16, :_reduce_13,
+  1, 17, :_reduce_14,
+  1, 17, :_reduce_15 ]
+
+racc_reduce_n = 16
+
+racc_shift_n = 20
+
+racc_token_table = {
+  false => 0,
+  :error => 1,
+  ">" => 2,
+  "<" => 3,
+  "[" => 4,
+  "]" => 5,
+  "," => 6,
+  "." => 7,
+  "+" => 8,
+  "-" => 9 }
+
+racc_nt_base = 10
+
+racc_use_result_var = true
+
+Racc_arg = [
+  racc_action_table,
+  racc_action_check,
+  racc_action_default,
+  racc_action_pointer,
+  racc_goto_table,
+  racc_goto_check,
+  racc_goto_default,
+  racc_goto_pointer,
+  racc_nt_base,
+  racc_reduce_table,
+  racc_token_table,
+  racc_shift_n,
+  racc_reduce_n,
+  racc_use_result_var ]
+
+Racc_token_to_s_table = [
+  "$end",
+  "error",
+  "\">\"",
+  "\"<\"",
+  "\"[\"",
+  "\"]\"",
+  "\",\"",
+  "\".\"",
+  "\"+\"",
+  "\"-\"",
+  "$start",
+  "Program",
+  "Expressions",
+  "Expression",
+  "Shift",
+  "Loop",
+  "InputOutput",
+  "Operation" ]
+
+Racc_debug_parser = false
+
+##### State transition tables end #####
+
+# reduce 0 omitted
+
+module_eval(<<'.,.,', 'grammer.y', 4)
+  def _reduce_1(val, _values, result)
+     result = Nodes.new([])
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'grammer.y', 5)
+  def _reduce_2(val, _values, result)
+     result = val[0]
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'grammer.y', 9)
+  def _reduce_3(val, _values, result)
+     result = Nodes.new(val)
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'grammer.y', 10)
+  def _reduce_4(val, _values, result)
+     result = val[0] << val[1]
+    result
+  end
+.,.,
+
+# reduce 5 omitted
+
+# reduce 6 omitted
+
+# reduce 7 omitted
+
+# reduce 8 omitted
+
+module_eval(<<'.,.,', 'grammer.y', 21)
+  def _reduce_9(val, _values, result)
+     result = ShiftNode.new(:right)
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'grammer.y', 22)
+  def _reduce_10(val, _values, result)
+     result = ShiftNode.new(:left)
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'grammer.y', 26)
+  def _reduce_11(val, _values, result)
+     result = LoopNode.new(val[1])
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'grammer.y', 30)
+  def _reduce_12(val, _values, result)
+     result = ReadNode.new
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'grammer.y', 31)
+  def _reduce_13(val, _values, result)
+     result = PrintNode.new
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'grammer.y', 35)
+  def _reduce_14(val, _values, result)
+     result = OperationNode.new(:incr)
+    result
+  end
+.,.,
+
+module_eval(<<'.,.,', 'grammer.y', 36)
+  def _reduce_15(val, _values, result)
+     result = OperationNode.new(:decr)
+    result
+  end
+.,.,
+
+def _reduce_none(val, _values, result)
+  val[0]
+end
+
+end   # class Parser
+
+end # module Brainfuck

data/lib/lang/runtime.rb

@@ -0,0 +1,40 @@
+module Brainfuck
+  class Runtime
+    def initialize
+      @cells = [0]
+      @current_cell = 0
+    end
+
+    def shift(direction)
+      case direction
+      when :right
+        @current_cell += 1
+        if @current_cell > @cells.length - 1
+          @cells << 0
+        end
+      when :left
+        @current_cell -= 1
+        if @current_cell < 0
+          @current_cell = 0
+        end
+      end
+    end
+
+    def mutate(how)
+      case how
+      when :incr
+        @cells[@current_cell] += 1
+      when :decr
+        @cells[@current_cell] -= 1
+      end
+    end
+
+    def value
+      @cells[@current_cell]
+    end
+
+    def value=(value)
+      @cells[@current_cell] = value
+    end
+  end
+end

metadata

@@ -0,0 +1,51 @@
+--- !ruby/object:Gem::Specification
+name: brainfuck-rb
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+platform: ruby
+authors:
+- Brandon Buck
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-07-22 00:00:00.000000000 Z
+dependencies: []
+description: Small and simple Brainfuck interpreter written in Ruby
+email: lordizuriel@gmail.com
+executables:
+- brainfuck
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/brainfuck-rb.rb
+- lib/lang/lexer.rb
+- lib/lang/parser.rb
+- lib/lang/nodes.rb
+- lib/lang/runtime.rb
+- lib/lang/interpreter.rb
+- bin/brainfuck
+homepage: http://github.com/bbuck/brainfuck-rb
+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.0.3
+signing_key: 
+specification_version: 4
+summary: Brainfuck interpreter written in Ruby
+test_files: []