rpxem 0.0.2 → 0.0.7

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: c58c71a092aa80e4df9b4f619c9c452067e687a06ced3bc5e5791cecb3a2667f
+  data.tar.gz: 372a4a2e91c31414dd4f2b1b112b071430639dbf7428d89f7d1314e8b0ac03a9
+SHA512:
+  metadata.gz: 65cb700a60db4f36fd91ee5b3c225d3d875360d471ceb743b4adb232a8a8a9959eaaf27123cb0fe603bd9c77f97f92ca4a1c0a2bf4c849ab4d7afba54b156ac6
+  data.tar.gz: 52deace08db6bd44366c50c1c0eebacc8f023a8d95648273c5b5bc2604e6ef73c322dc4a2874aae76aa09ef88801b4e2889e47583ced9d268d81ccc687c95822

data/.github/workflows/rspec.yml

@@ -0,0 +1,15 @@
+name: Run RSpec
+
+on:
+  push:
+    branches: [master]
+  pull_request:
+    branches: [master]
+
+jobs:
+  run_rspec:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v2
+      - run: bundle install -j4
+      - run: bundle exec rspec

data/.travis.yml

@@ -0,0 +1,15 @@
+language: ruby
+rvm:
+  - 2.0
+  - 2.1
+  - 2.2
+  - 2.3
+  - 2.4
+  - 2.5
+  - 2.6
+  - 2.7
+  - 3.0
+cache:
+  directories: vendor/bundle
+before_install:
+  - gem install bundler || true

data/MIT-LICENSE.txt

@@ -1,4 +1,4 @@
-Copyright (c) 2012 wktk
+Copyright (c) 2012, 2018 wktk
 
 MIT License
 
@@ -19,4 +19,4 @@ 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.
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -1,10 +1,11 @@
 # RPxem
 
-[![Build Status](https://travis-ci.org/wktk/rpxem.png)](https://travis-ci.org/wktk/rpxem)
+[![Build Status](https://travis-ci.org/wktk/rpxem.svg?branch=master)](https://travis-ci.org/wktk/rpxem)
 
-RPxem is a Ruby implementation of [Pxem], a esoteric programming language that
+RPxem is a Ruby implementation of [Pxem], an esoteric programming language that
 enables you to create programs in 0-byte files.
-[Pxem]: http://cfs.maxn.jp/neta/pxem.php
+
+[Pxem]: https://web.archive.org/web/20120605223423/http://cfs.maxn.jp/neta/pxem.php
 
 ## Installation
 
@@ -71,5 +72,12 @@ Hello, world!
 
 ## License
 
-Copyright (c) 2012 wktk.  This software is distributed under the
-MIT License.  See `MIT-LICENSE.txt` for details.
+Copyright (c) 2012, 2018 wktk.  
+This software is distributed under the MIT License.  
+See `MIT-LICENSE.txt` for details.
+
+
+## See also
+
+- Original resource: https://web.archive.org/web/20120605223423/http://cfs.maxn.jp/neta/pxem.php
+- Esolang wiki: https://esolangs.org/wiki/Pxem

data/Rakefile

@@ -1,12 +1,6 @@
-#!/usr/bin/env rake
 require 'bundler/gem_tasks'
+require 'rspec/core/rake_task'
 
-task :default => [:spec]
-begin
-  require 'rspec/core/rake_task'
-  RSpec::Core::RakeTask.new(:spec) do |spec|
-    spec.pattern = 'spec/**/*_spec.rb'
-    spec.rspec_opts = ['-cfs']
-  end
-rescue LoadError => e
-end
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/bin/rpxem

@@ -1,14 +1,14 @@
-#!/usr/bin/env ruby
-
-if (!ARGV[0] || /^-/ =~ ARGV[0] && !File.exist?(ARGV[0]))
-  require 'rpxem/version'
-  puts "RPxem (#{RPxem::VERSION}) https://github.com/wtkt/rpxem"
-  puts 'Usage: rpxem path-to-pxem-file.pxe'
-  puts 'Report bugs to <https://github.com/wktk/rpxem/issues>.'
-elsif (!File.exist?(ARGV[0]) || !source = open(ARGV[0]).read)
-  puts "Can't load file: #{ARGV[0]}"
-  puts "Try `rpxem --help' for more infomation."
-else
-  require 'rpxem'
-  RPxem.run(File::basename(ARGV[0]), source)
-end
+#!/usr/bin/env ruby
+
+if (!ARGV[0] || /^-/ =~ ARGV[0] && !File.exist?(ARGV[0]))
+  require 'rpxem/version'
+  puts "RPxem (#{RPxem::VERSION}) https://github.com/wktk/rpxem"
+  puts 'Usage: rpxem path-to-pxem-file.pxe'
+  puts 'Report bugs to <https://github.com/wktk/rpxem/issues>.'
+elsif (!File.exist?(ARGV[0]) || !source = open(ARGV[0]).read)
+  puts "Can't load file: #{ARGV[0]}"
+  puts "Try `rpxem --help' for more infomation."
+else
+  require 'rpxem'
+  RPxem.run(File::basename(ARGV[0]), source)
+end

data/lib/rpxem.rb

@@ -1,20 +1,20 @@
-require 'rpxem/interpreter'
-require 'rpxem/version'
-
-module RPxem
-  class << self
-    def new(options={})
-      RPxem::Interpreter.new(options)
-    end
-
-  private
-    def method_missing(name, *args, &block)
-      return super unless new.respond_to?(name)
-      new.__send__(name, *args, &block)
-    end
-
-    def respond_to?(name)
-      new.respond_to?(name) || super(name)
-    end
-  end
-end
+require 'rpxem/interpreter'
+require 'rpxem/version'
+
+module RPxem
+  class << self
+    def new(options={})
+      RPxem::Interpreter.new(options)
+    end
+
+  private
+    def method_missing(name, *args, &block)
+      return super unless new.respond_to?(name)
+      new.__send__(name, *args, &block)
+    end
+
+    def respond_to?(name)
+      new.respond_to?(name) || super(name)
+    end
+  end
+end

data/lib/rpxem/interpreter.rb

@@ -1,232 +1,229 @@
-require 'rpxem/stack'
-require 'rpxem/version'
-require 'scanf'
-
-module RPxem
-  class Interpreter
-    attr_accessor :mapping
-    attr_reader   :stack, :temp
-
-    def initialize(mapping={})
-      @mapping = default_mapping().merge(mapping)
-    end
-
-    # Open and execute a Pxem file
-    def open(file, stack=RPxem::Stack.new, temp=nil)
-      run(File.basename(file), File.open(file).read, stack, temp)
-    end
-
-    # Execute a Pxem code
-    def run(filename, source='', stack=RPxem::Stack.new, temp=nil)
-      @filename, @source, @stack, @temp = filename.each_byte.to_a, source, stack, temp
-      buffer, @cursor, length = RPxem::Stack.new, 0, @filename.length
-
-      while (@cursor < length)
-        char = @filename[@cursor]
-        @cursor += 1
-        if (@cursor < length && 46 == char && name = @mapping[@filename[@cursor].chr.downcase])
-          @stack.push(*buffer)
-          buffer = RPxem::Stack.new
-          __send__(name)
-          @cursor += 1
-        else
-          buffer.unshift(char)
-        end
-      end
-
-      return @stack
-    end
-
-    def default_mapping
-      {
-        # I/O
-        'p' => 'output_all',
-        'o' => 'output',
-        'n' => 'output_num',
-        'i' => 'input',
-        '_' => 'input_num',
-
-        # Stack
-        'c' => 'copy',
-        's' => 'throw_away',
-        'v' => 'reverse',
-
-        # File contents
-        'f' => 'read_file',
-        'e' => 'emurate',
-
-        # Rand
-        'r' => 'rand',
-
-        # Loop
-        'w' => 'w',
-        'x' => 'x',
-        'y' => 'y',
-        'z' => 'z',
-        'a' => 'a',
-
-        # Temporary area
-        't' => 'to_temp',
-        'm' => 'from_temp',
-
-        # Do nothing
-        'd' => 'void',
-
-        # Math
-        '+' => 'addition',
-        '-' => 'subtraction',
-        '!' => 'multiplication',
-        '$' => 'quotient',
-        '%' => 'surplus',
-      }
-    end
-
-  private
-
-    # .p:
-    def output_all
-      while output; end
-    end
-
-    # .o:
-    def output
-      putc @stack.pop unless @stack.empty?
-    end
-
-    # .n:
-    def output_num
-      print @stack.pop
-    end
-
-    # .i:
-    def input
-      @stack.push(*STDIN.getc.ord)
-    end
-
-    # ._:
-    def input_num
-      @stack.push(*scanf('%d'))
-    end
-
-    # .c:
-    def copy
-      @stack.push(@stack.last)
-    end
-
-    # .s:
-    def throw_away
-      @stack.pop
-    end
-
-    # .v:
-    def reverse
-      @stack.reverse!
-    end
-
-    # .f:
-    def read_file
-      @stack.push(*@source.each_byte.to_a.reverse)
-    end
-
-    # .e:
-    def emurate
-      @stack.push(*clone.run(@source, @source, @stack.clone))
-    end
-
-    # .r:
-    def rand
-      @stack.push((super * @stack.pop).to_i)
-    end
-
-    # .w:
-    def w
-      jump if (!@stack.empty? && 0 == @stack.pop)
-    end
-
-    # .x:
-    def x
-      jump if (2 <= @stack.size && @stack.pop >= @stack.pop)
-    end
-
-    # .y:
-    def y
-      jump if (2 <= @stack.size && @stack.pop <= @stack.pop)
-    end
-
-    # .z:
-    def z
-      jump if (2 <= @stack.size && @stack.pop == @stack.pop)
-    end
-
-    # Jump forward to correspondent .a
-    def jump
-      count = 1
-      while (count.nonzero?)
-        @cursor += 1
-        if (46 == @filename[@cursor])
-          if (['w','x','y','z'].include? @filename[@cursor+1].chr.downcase)
-            count += 1
-          elsif ('a' == @filename[@cursor+1].chr.downcase)
-            count -= 1
-          end
-        end
-      end
-      @cursor += 1
-    end
-
-    # .a:
-    def a
-      @cursor -= 2
-      count = -1
-      while (count.nonzero?)
-        if (46 == @filename[@cursor])
-          if (['w','x','y','z'].include? @filename[@cursor+1].chr.downcase)
-            count += 1
-          elsif ('a' == @filename[@cursor+1].chr.downcase)
-            count -= 1
-          end
-        end
-        @cursor -= 1
-      end
-    end
-
-    # .t:
-    def to_temp
-      @temp = @stack.pop
-    end
-
-    # .m:
-    def from_temp
-      @stack.push(@temp) if @temp
-    end
-
-    # .d:
-    def void
-    end
-
-    # .+:
-    def addition
-      @stack.push(@stack.pop + @stack.pop) if 2 <= @stack.size
-    end
-
-    # .-: 
-    def subtraction
-      @stack.push((@stack.pop - @stack.pop).abs) if 2 <= @stack.size
-    end
-
-    # .!:
-    def multiplication
-      @stack.push(@stack.pop * @stack.pop) if 2 <= @stack.size
-    end
-
-    # .$:
-    def quotient
-      @stack.push((f=@stack.pop)>(s=@stack.pop)? f/s : s/f) if 2 <= @stack.size
-    end
-
-    # .%:
-    def surplus
-      @stack.push((f=@stack.pop)>(s=@stack.pop)? f%s : s%f) if 2 <= @stack.size
-    end
-  end
-end
+require 'rpxem/stack'
+require 'scanf'
+
+module RPxem
+  class Interpreter
+    attr_accessor :mapping
+    attr_reader   :stack, :temp
+
+    def initialize(mapping={})
+      @mapping = default_mapping().merge(mapping)
+    end
+
+    # Open and execute a Pxem file
+    def open(file, stack=RPxem::Stack.new, temp=nil)
+      run(File.basename(file), File.open(file).read, stack, temp)
+    end
+
+    # Execute a Pxem code
+    def run(filename, source='', stack=RPxem::Stack.new, temp=nil)
+      @filename, @source, @stack, @temp = filename.each_byte.to_a, source, stack, temp
+      buffer, @cursor, length = RPxem::Stack.new, 0, @filename.length
+
+      while (@cursor < length)
+        char = @filename[@cursor]
+        @cursor += 1
+        if (@cursor < length && 46 == char && name = @mapping[@filename[@cursor].chr.downcase])
+          @stack.push(*buffer)
+          buffer = RPxem::Stack.new
+          break if name == 'terminate'
+          __send__(name)
+          @cursor += 1
+        else
+          buffer.unshift(char)
+        end
+      end
+
+      return @stack
+    end
+
+    def default_mapping
+      {
+        # I/O
+        'p' => 'output_all',
+        'o' => 'output',
+        'n' => 'output_num',
+        'i' => 'input',
+        '_' => 'input_num',
+
+        # Stack
+        'c' => 'copy',
+        's' => 'throw_away',
+        'v' => 'reverse',
+
+        # File contents
+        'f' => 'read_file',
+        'e' => 'emurate',
+
+        # Rand
+        'r' => 'rand',
+
+        # Loop
+        'w' => 'w',
+        'x' => 'x',
+        'y' => 'y',
+        'z' => 'z',
+        'a' => 'a',
+
+        # Temporary area
+        't' => 'to_temp',
+        'm' => 'from_temp',
+
+        # Terminate execution
+        'd' => 'terminate',
+
+        # Math
+        '+' => 'addition',
+        '-' => 'subtraction',
+        '!' => 'multiplication',
+        '$' => 'quotient',
+        '%' => 'surplus',
+      }
+    end
+
+  private
+
+    # .p:
+    def output_all
+      while output; end
+    end
+
+    # .o:
+    def output
+      putc @stack.pop unless @stack.empty?
+    end
+
+    # .n:
+    def output_num
+      print @stack.pop
+    end
+
+    # .i:
+    def input
+      stdin = STDIN.getc
+      @stack.push(stdin ? stdin.ord : -1)
+    end
+
+    # ._:
+    def input_num
+      @stack.push(*scanf('%d'))
+    end
+
+    # .c:
+    def copy
+      @stack.push(@stack.last) unless @stack.empty?
+    end
+
+    # .s:
+    def throw_away
+      @stack.pop
+    end
+
+    # .v:
+    def reverse
+      @stack.reverse!
+    end
+
+    # .f:
+    def read_file
+      @stack.push(*@source.each_byte.to_a.reverse)
+    end
+
+    # .e:
+    def emurate
+      @stack.push(*clone.run(@source, @source, @stack.clone))
+    end
+
+    # .r:
+    def rand
+      @stack.push((super * @stack.pop).to_i)
+    end
+
+    # .w:
+    def w
+      jump if (!@stack.empty? && 0 == @stack.pop)
+    end
+
+    # .x:
+    def x
+      jump if (2 <= @stack.size && @stack.pop >= @stack.pop)
+    end
+
+    # .y:
+    def y
+      jump if (2 <= @stack.size && @stack.pop <= @stack.pop)
+    end
+
+    # .z:
+    def z
+      jump if (2 <= @stack.size && @stack.pop == @stack.pop)
+    end
+
+    # Jump forward to correspondent .a
+    def jump
+      count = 1
+      while (count.nonzero?)
+        @cursor += 1
+        if (46 == @filename[@cursor])
+          if (['w','x','y','z'].include? @filename[@cursor+1].chr.downcase)
+            count += 1
+          elsif ('a' == @filename[@cursor+1].chr.downcase)
+            count -= 1
+          end
+        end
+      end
+      @cursor += 1
+    end
+
+    # .a:
+    def a
+      @cursor -= 2
+      count = -1
+      while (count.nonzero?)
+        if (46 == @filename[@cursor])
+          if (['w','x','y','z'].include? @filename[@cursor+1].chr.downcase)
+            count += 1
+          elsif ('a' == @filename[@cursor+1].chr.downcase)
+            count -= 1
+          end
+        end
+        @cursor -= 1
+      end
+    end
+
+    # .t:
+    def to_temp
+      @temp = @stack.pop
+    end
+
+    # .m:
+    def from_temp
+      @stack.push(@temp) if @temp
+    end
+
+    # .+:
+    def addition
+      @stack.push(@stack.pop + @stack.pop) if 2 <= @stack.size
+    end
+
+    # .-: 
+    def subtraction
+      @stack.push((@stack.pop - @stack.pop).abs) if 2 <= @stack.size
+    end
+
+    # .!:
+    def multiplication
+      @stack.push(@stack.pop * @stack.pop) if 2 <= @stack.size
+    end
+
+    # .$:
+    def quotient
+      @stack.push((f=@stack.pop)>(s=@stack.pop)? f/s : s/f) if 2 <= @stack.size
+    end
+
+    # .%:
+    def surplus
+      @stack.push((f=@stack.pop)>(s=@stack.pop)? f%s : s%f) if 2 <= @stack.size
+    end
+  end
+end