razyk 0.0.0

data/spec/node_spec.rb

@@ -0,0 +1,58 @@
+# encoding: utf-8
+
+require_relative "spec_helper"
+
+require "razyk/node"
+
+include RazyK
+
+describe Combinator do
+  it "should be created with label" do
+    Combinator.new(:l).label.should == :l
+  end
+
+  it "#to_s return label string" do
+    Combinator.new(:name).to_s.should == "name"
+  end
+end
+
+describe Pair do
+  it "should be created with two Combinator" do
+    a = Combinator.new :a
+    b = Combinator.new :b
+    pair = Pair.new(a, b)
+    pair.car.should == a
+    pair.cdr.should == b
+    pair.to_s.should == "(a b)"
+    a.from.should == [pair]
+    b.from.should == [pair]
+  end
+
+  it "#car= should replace car" do
+    a = Combinator.new :a
+    b = Combinator.new :b
+    pair = Pair.new(a, b)
+    c = Combinator.new :c
+    pair.car = c
+    pair.car.should == c
+    pair.cdr.should == b
+    a.from.should be_empty
+    c.from.should == [pair]
+    b.from.should == [pair]
+    pair.to_s.should == "(c b)"
+  end
+
+  it "#cdr= should replace cdr" do
+    a = Combinator.new :a
+    b = Combinator.new :b
+    pair = Pair.new(a, b)
+    c = Combinator.new :c
+    pair.cdr = c
+    pair.car.should == a
+    pair.cdr.should == c
+    a.from.should == [pair]
+    b.from.should be_empty
+    c.from.should == [pair]
+    pair.to_s.should == "(a c)"
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,5 @@
+$LOAD_PATH.unshift(File.dirname(__FILE__))
+$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
+
+require 'razyk'
+require 'rspec'

data/spec/vm_spec.rb

@@ -0,0 +1,128 @@
+# encoding: utf-8
+
+require_relative "spec_helper"
+
+require "razyk/vm"
+require "stringio"
+
+include RazyK
+
+describe VM do
+  it "should reduce I combinator" do
+    i = Combinator.new(:I)
+    x = Combinator.new(:X)
+    cons = Pair.new(i, x)
+    vm = VM.new(cons)
+    vm.tree.should == cons
+    x.from.size.should == 1
+    x.from[0].should == cons
+    vm.reduce
+    vm.tree.should == x
+    x.from.size.should == 1
+    x.from[0].should_not == cons
+  end
+
+  it "should reduce K combinator" do
+    k = Combinator.new(:K)
+    x = Combinator.new(:X)
+    y = Combinator.new(:Y)
+    cons1 = Pair.new(k, x)
+    cons2 = Pair.new(cons1, y)
+    vm = VM.new(cons2)
+    vm.tree.should == cons2
+    x.from.size.should == 1
+    x.from[0].should == cons1
+    vm.reduce
+    vm.tree.should == x
+    x.from.size.should == 1
+    x.from[0].should_not == cons1
+  end
+
+  it "should reduce S combinator" do
+    s = Combinator.new(:S)
+    x = Combinator.new(:X)
+    y = Combinator.new(:Y)
+    z = Combinator.new(:Z)
+    cons1 = Pair.new(s, x)
+    cons2 = Pair.new(cons1, y)
+    cons3 = Pair.new(cons2, z)
+    vm = VM.new(cons3)
+    vm.tree.should == cons3
+    x.from.should == [ cons1 ]
+    y.from.should == [ cons2 ]
+    z.from.should == [ cons3 ]
+    vm.reduce
+    vm.tree.inspect.should == "((X Z) (Y Z))"
+    x.from.size.should == 1
+    x.from.should_not == [ cons1 ]
+    y.from.size.should == 1
+    y.from.should_not == [ cons2 ]
+    z.from.size.should == 2
+  end
+
+  it "should reduce CONS and CAR combinator" do
+    cons = Combinator.new(:CONS)
+    a = Combinator.new(:A)
+    b = Combinator.new(:B)
+    list = Pair.new(Pair.new(cons, a), b)
+    car = Combinator.new(:CAR)
+    root = Pair.new(car, list)
+    vm = VM.new(root)
+    vm.evaluate(vm.tree)
+    vm.tree.should == a
+    a.from.size.should == 1
+  end
+
+  it "should reduce CONS and CDR combinator" do
+    cons = Combinator.new(:CONS)
+    a = Combinator.new(:A)
+    b = Combinator.new(:B)
+    list = Pair.new(Pair.new(cons, a), b)
+    cdr = Combinator.new(:CDR)
+    root = Pair.new(cdr, list)
+    vm = VM.new(root)
+    vm.evaluate(vm.tree)
+    vm.tree.should == b
+    b.from.size.should == 1
+  end
+
+  it "should reduce IN combinator (CAR)" do
+    input = Combinator.new(:IN)
+    car = Combinator.new(:CAR)
+    root = Pair.new(car, input)
+    buf = StringIO.new([100, 200].pack("C"))
+    vm = VM.new(root, buf)
+    vm.evaluate(vm.tree)
+    vm.tree.should be_is_a(Combinator)
+    vm.tree.label.should == 100
+    buf.pos.should == 1
+  end
+
+  it "should reduce IN combinator (CDR)" do
+    input = Combinator.new(:IN)
+    cdr = Combinator.new(:CDR)
+    root = Pair.new(cdr, input)
+    buf = StringIO.new([100, 200].pack("C*"))
+    vm = VM.new(root, buf)
+    vm.evaluate(vm.tree)
+    vm.tree.should be_is_a(Pair)
+    vm.tree.cdr.label == :IN
+    vm.tree.from.size.should == 1
+    buf.pos.should == 2
+  end
+
+  it "should reduce PUTC combinator" do
+    putc = Combinator.new(:PUTC)
+    a = Combinator.new(97)
+    x = Combinator.new(:X)
+    decode = Pair.new(Pair.new(a, :INC), 0)
+    root = Pair.new(Pair.new(putc, decode), x)
+    ibuf = StringIO.new("")
+    obuf = StringIO.new("")
+    vm = VM.new(root,ibuf, obuf)
+    vm.evaluate(vm.tree)
+    obuf.string.should == "a"
+    vm.tree.should == x
+    x.from.size.should == 1
+  end
+end

metadata

@@ -0,0 +1,129 @@
+--- !ruby/object:Gem::Specification 
+name: razyk
+version: !ruby/object:Gem::Version 
+  prerelease: false
+  segments: 
+  - 0
+  - 0
+  - 0
+  version: 0.0.0
+platform: ruby
+authors: 
+- nagachika
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2010-11-19 00:00:00 +09:00
+default_executable: razyk
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: rspec
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 1
+        - 2
+        - 9
+        version: 1.2.9
+  type: :development
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: rack
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :runtime
+  version_requirements: *id002
+- !ruby/object:Gem::Dependency 
+  name: ruby-graphviz
+  prerelease: false
+  requirement: &id003 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :runtime
+  version_requirements: *id003
+description: RazyK is a LazyK implementetion by pure ruby
+email: nagachika00@gmail.com
+executables: 
+- razyk
+extensions: []
+
+extra_rdoc_files: 
+- LICENSE
+- README.rdoc
+files: 
+- .document
+- .rspec
+- LICENSE
+- README.rdoc
+- Rakefile
+- VERSION
+- bin/razyk
+- examples/lazier.scm
+- examples/prelude.scm
+- examples/prime.lazy
+- examples/reverse.lazy
+- examples/reverse.scm
+- lib/razyk.rb
+- lib/razyk/graph.rb
+- lib/razyk/node.rb
+- lib/razyk/parser.rb
+- lib/razyk/parser.y
+- lib/razyk/vm.rb
+- lib/razyk/webapp.rb
+- lib/razyk/webapp/templates/main.html
+- spec/node_spec.rb
+- spec/spec_helper.rb
+- spec/vm_spec.rb
+has_rdoc: true
+homepage: http://github.com/nagachika/razyk
+licenses: []
+
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.3.7
+signing_key: 
+specification_version: 3
+summary: pure ruby LazyK implementation
+test_files: 
+- spec/node_spec.rb
+- spec/spec_helper.rb
+- spec/vm_spec.rb