calvin 0.0.1

data/.gitignore

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

data/.rspec

@@ -0,0 +1,2 @@
+--color
+--format documentation

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2012 Utkarsh Kukreti
+
+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,36 @@
+# Calvin
+
+Calvin is a very terse programming language, inspired by APL/J/K.
+
+## Installation
+
+### Using Git (Recommended)
+
+    git clone https://github.com/utkarshkukreti/calvin.git
+    cd calvin
+    bundle install
+    rake install
+
+### From RubyGems
+
+    gem install calvin
+
+## Usage
+
+Run
+
+    calvin
+
+to start the interactive REPL.
+
+## Documentation
+
+No docs yet, but the language is **heavily** tested.
+
+Best way to learn more is to read the specs in `spec/`.
+
+## License
+
+The MIT License
+
+Copyright (c) 2012 Utkarsh Kukreti

data/Rakefile

@@ -0,0 +1,9 @@
+require "bundler/gem_tasks"
+
+require "rspec/core/rake_task"
+RSpec::Core::RakeTask.new("spec")
+
+task :pry do
+  system "pry -I lib -r calvin -e 'include Calvin'"
+end
+task :default => :pry

data/bin/calvin

@@ -0,0 +1,4 @@
+#!/usr/bin/env ruby
+require 'calvin'
+
+Calvin::CLI.new ARGV

data/calvin.gemspec

@@ -0,0 +1,24 @@
+# -*- encoding: utf-8 -*-
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'calvin/version'
+
+Gem::Specification.new do |gem|
+  gem.name          = "calvin"
+  gem.version       = Calvin::VERSION
+  gem.authors       = ["Utkarsh Kukreti"]
+  gem.email         = ["utkarshkukreti@gmail.com"]
+  gem.description   = %q{Very terse programming language, inspired by APL/J/K.}
+  gem.summary       = %q{Very terse programming language, inspired by APL/J/K.}
+  gem.homepage      = "https://github.com/utkarshkukreti/calvin"
+
+  gem.files         = `git ls-files`.split($/)
+  gem.executables   = gem.files.grep(%r{^bin/}).map{ |f| File.basename(f) }
+  gem.test_files    = gem.files.grep(%r{^(test|spec|features)/})
+  gem.require_paths = ["lib"]
+
+  gem.add_dependency "docopt"
+  gem.add_dependency "parslet"
+
+  gem.add_development_dependency "rspec"
+end

data/lib/calvin/ast.rb

@@ -0,0 +1,9 @@
+module Calvin
+  class AST
+    attr_reader :ast
+
+    def initialize(input)
+      @ast = Transform.new.apply Parser.new.parse(input)
+    end
+  end
+end

data/lib/calvin/cli.rb

@@ -0,0 +1,43 @@
+module Calvin
+  class CLI
+    def initialize(argv)
+      if argv.any?
+        puts "Argument passed: #{argv.inspect}"
+      end
+      @verbose = argv.include?("--verbose")
+      repl
+    end
+
+    def repl
+      evaluator = Evaluator.new
+      require 'readline'
+
+      puts "Calvin Programming Language REPL."
+      puts "Type exit or press Ctrl-D to exit."
+      lines = ""
+      loop do
+        prompt = "> "
+        line = Readline::readline(prompt)
+
+        exit if line.nil? || line == "exit"
+
+        Readline::HISTORY.push line
+
+        begin
+          ast = AST.new(line).ast
+
+          if @verbose
+            puts  "      AST: #{ast.inspect}"
+            print "Evaluated: "
+          end
+
+          p evaluator.apply(ast)[0]
+        rescue Exception => e
+          puts e
+          p e.message
+          puts e.backtrace
+        end
+      end
+    end
+  end
+end

data/lib/calvin/core.rb

@@ -0,0 +1,10 @@
+module Calvin
+  class Core
+    ImpossibleException = Exception.new
+
+    BinaryOperators = { add: "+", multiply: "*", subtract: "-", divide: "/", power: "^", modulo: "%" }.invert
+    ComparisonOperators = { eq: "=", neq: "<>", lte: "<=", lt: "<", gte: ">=", gt: ">" }.invert
+    Folders = { foldr: "\\:", foldl: "\\" }.invert
+    Mappers = { map: "@" }.invert
+  end
+end

data/lib/calvin/evaluator.rb

@@ -0,0 +1,130 @@
+module Calvin
+  class Evaluator < Parslet::Transform
+    attr_accessor :env
+
+    def initialize
+      super
+      @env = {}
+
+      rule assignment: { identifier: simple(:name), expression:
+        subtree(:expression)} do |context|
+        @env[context[:name].to_s] = context[:expression]
+      end
+
+      rule deassignment: { identifier: simple(:name) } do |context|
+        @env[context[:name].to_s]
+      end
+
+      rule range: subtree(:range) do
+        if range[:first]
+          range[:first]..range[:last]
+        else
+          0..(range[:last] - 1)
+        end
+      end
+
+      rule folded: { binary_operator: simple(:op), folder: simple(:folder),
+        expression: subtree(:expression) } do
+        if folder == "\\"
+        elsif folder == "\\:"
+          expression.reverse!
+        else
+          raise Core::ImpossibleException
+        end
+
+        case op.to_sym
+        when :+, :-, :%, :*, :/
+          expression.reduce op.to_sym
+        when :^
+          expression.reduce :**
+        else
+          raise Core::ImpossibleException
+        end
+      end
+
+      rule mapped: { monad: { left: { binary_operator: simple(:op) },
+        integer: simple(:integer) }, mapper: simple(:mapper), expression: subtree(:expression) } do
+        if mapper == "@"
+        else
+          raise Core::ImpossibleException
+        end
+
+        op = op().to_sym # hack; make it a var
+        if op == :^
+          op = :**
+        end
+
+        if expression.is_a?(Array) || expression.is_a?(Range)
+          expression.to_a.map {|el| el.send(op, integer.to_i) }
+        else
+          expression.send(op, integer.to_i)
+        end
+      end
+
+      rule mapped: { monad: { right: { binary_operator: simple(:op) },
+        integer: simple(:integer) }, mapper: simple(:mapper), expression: subtree(:expression) } do
+        if mapper == "@"
+        else
+          raise Core::ImpossibleException
+        end
+
+        op = op().to_sym # hack; make it a var
+        if op == :^
+          op = :**
+        end
+
+        if expression.is_a?(Array) || expression.is_a?(Range)
+          expression.to_a.map {|el| integer.to_i.send(op, el) }
+        else
+          integer.to_i.send(op, expression)
+        end
+      end
+
+      rule expression: subtree(:expression) do
+        expression
+      end
+
+      rule mapped: { monad: { left: { comparison_operator: simple(:op) },
+        integer: simple(:integer) }, mapper: simple(:mapper), expression: subtree(:expression) } do
+        if mapper == "@"
+        else
+          raise Core::ImpossibleException
+        end
+
+        op = op().to_sym # hack; make it a var
+        if op == :"<>"
+          op = :!=
+        elsif op == :"="
+          op = :"=="
+        end
+
+        if expression.is_a?(Array) || expression.is_a?(Range)
+          expression.to_a.select {|el| el.send(op, integer.to_i) }
+        else
+          expression.send(op, integer.to_i)
+        end
+      end
+
+      rule mapped: { monad: { right: { comparison_operator: simple(:op) },
+        integer: simple(:integer) }, mapper: simple(:mapper), expression: subtree(:expression) } do
+        if mapper == "@"
+        else
+          raise Core::ImpossibleException
+        end
+
+        op = op().to_sym # hack; make it a var
+        if op == :"<>"
+          op = :!=
+        elsif op == :"="
+          op = :"=="
+        end
+
+        if expression.is_a?(Array) || expression.is_a?(Range)
+          expression.to_a.select {|el| integer.to_i.send(op, el) }
+        else
+          expression.send(op, integer.to_i)
+        end
+      end
+    end
+  end
+end

data/lib/calvin/parser.rb

@@ -0,0 +1,42 @@
+module Calvin
+  class Parser < Parslet::Parser
+    rule(:space) { str(" ") }
+    rule(:spaces?) { space.repeat }
+    rule(:spaces) { space.repeat(1) }
+    rule(:digit) { match["0-9"] }
+
+    rule(:integer) { digit.repeat(1).as(:integer) }
+    rule(:constant) { integer }
+    rule(:identifier) { match["a-z"].repeat(1).as(:identifier) }
+    rule(:deassignment) { identifier.as(:deassignment) }
+    rule(:variable) { constant }
+
+    rule(:array) { (variable >> (space >> variable).repeat).as(:array) }
+
+    rule(:range) { (integer.as(:first).maybe >> str("..") >> integer.as(:last)).as(:range) }
+    { mapper: Core::Mappers,
+      folder: Core::Folders,
+      binary_operator: Core::BinaryOperators,
+      comparison_operator: Core::ComparisonOperators }.each do |type, hash|
+      rule type do
+        hash.keys.map { |key| str(key).as(type) }.reduce(:|)
+      end
+    end
+
+    rule :monad do
+      (variable >> (binary_operator | comparison_operator).as(:right) |
+        (binary_operator | comparison_operator).as(:left) >> variable).as(:monad)
+    end
+
+    rule(:folded) { (binary_operator >> folder >> expression).as(:folded) }
+    rule(:mapped) { (monad >> mapper >> expression).as(:mapped) }
+
+    rule(:assignment) { (identifier >> str(":=") >> expression).as(:assignment) }
+
+    rule(:expression) { (deassignment | mapped | folded | range | array).as(:expression) }
+    rule(:statement) { assignment | expression }
+    rule(:statements) { statement.repeat }
+
+    root(:statements)
+  end
+end

data/lib/calvin/transform.rb

@@ -0,0 +1,9 @@
+module Calvin
+  class Transform < Parslet::Transform
+    rule(integer:  simple(:x))   { x.to_i }
+    rule(array:    sequence(:x)) { x }
+    rule(array:    simple(:x))   { [x] }
+    rule(function: simple(:x))   { x.to_s }
+    rule(applier:  simple(:x))   { x.to_s }
+  end
+end

data/lib/calvin/version.rb

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

data/lib/calvin.rb

@@ -0,0 +1,12 @@
+require "parslet"
+require "docopt"
+
+require "calvin/core"
+require "calvin/parser"
+require "calvin/transform"
+require "calvin/ast"
+require "calvin/evaluator"
+
+require "calvin/cli"
+
+require "calvin/version"

data/spec/ast_spec.rb

@@ -0,0 +1,21 @@
+require "spec_helper"
+
+# describe Calvin::AST do
+#   describe "Array" do
+#     it "should parse simple arrays" do
+#       aste("1").should eq [1]
+#       aste("1 2 3").should eq [1, 2, 3]
+#     end
+#   end
+#
+#   describe "Folder" do
+#     it "should parse folding with binary operators on arrays" do
+#       aste("+\\1 2 3").should eq folded: { binary_operator: "+", folder: "\\", array: [1, 2, 3] }
+#       aste("-\\1 2 3").should eq folded: { binary_operator: "-", folder: "\\", array: [1, 2, 3] }
+#       aste("*\\1 2 3").should eq folded: { binary_operator: "*", folder: "\\", array: [1, 2, 3] }
+#       aste("/\\1 2 3").should eq folded: { binary_operator: "/", folder: "\\", array: [1, 2, 3] }
+#       aste("^\\1 2 3").should eq folded: { binary_operator: "^", folder: "\\", array: [1, 2, 3] }
+#       aste("%\\1 2 3").should eq folded: { binary_operator: "%", folder: "\\", array: [1, 2, 3] }
+#     end
+#   end
+# end

data/spec/calvin_spec.rb

@@ -0,0 +1,7 @@
+require "spec_helper"
+
+describe Calvin do
+  it "should have a VERSION" do
+    Calvin::VERSION.should be_a String
+  end
+end

data/spec/evaluator_spec.rb

@@ -0,0 +1,91 @@
+require "spec_helper"
+
+describe Calvin::Evaluator do
+  it "should parse foldl" do
+    eval1("+\\1 2 3").should eq 6
+    eval1("-\\1 2 3").should eq -4
+    eval1("*\\2 3 5").should eq 30
+    eval1("/\\8 2 2").should eq 2
+    eval1("%\\9 7 9").should eq 2
+    eval1("^\\2 2 3").should eq 64
+  end
+
+  it "should parse foldr" do
+    eval1("+\\:1 2 3").should eq 6
+    eval1("-\\:1 2 3").should eq 0
+    eval1("*\\:2 3 5").should eq 30
+    eval1("/\\:2 2 8").should eq 2
+    eval1("%\\:9 7 9").should eq 2
+    eval1("^\\:2 2 3").should eq 81
+  end
+
+  it "should parse map" do
+    eval1("+2@1 2 3").should eq [3, 4, 5]
+    eval1("2+@1 2 3").should eq [3, 4, 5]
+
+    eval1("-2@1 2 3").should eq [-1, 0, 1]
+    eval1("2-@1 2 3").should eq [1, 0, -1]
+
+    eval1("*2@1 2 3").should eq [2, 4, 6]
+    eval1("2*@1 2 3").should eq [2, 4, 6]
+
+    eval1("/2@9 6 3").should eq [4, 3, 1]
+    eval1("4/@1 2 3").should eq [4, 2, 1]
+
+    eval1("%2@1 2 3").should eq [1, 0, 1]
+    eval1("2%@1 2 3").should eq [0, 0, 2]
+
+    eval1("^2@1 2 3").should eq [1, 4, 9]
+    eval1("2^@1 2 3").should eq [2, 4, 8]
+  end
+
+  it "should parse filter" do
+    eval1(">3@1 2 4").should eq [4]
+    eval1("<3@1 6 1").should eq [1, 1]
+    eval1(">=3@1 3 4").should eq [3, 4]
+    eval1("<=3@1 3 4").should eq [1, 3]
+    eval1("=3@1 2 3 3 4").should eq [3, 3]
+
+    eval1("3>@1 2 4").should eq [1, 2]
+    eval1("3<@1 6 1").should eq [6]
+    eval1("3>=@1 3 4").should eq [1, 3]
+    eval1("3<=@1 3 4").should eq [3, 4]
+    eval1("3=@1 2 3 3 4").should eq [3, 3]
+  end
+
+  it "should parse nested expressions" do
+    eval1("+\\2^@1 2 3").should eq 14
+    eval1("-\\:-2@1 2 3").should eq 2
+    eval1("/2@^2@2+@1 2 3").should eq [4, 8, 12]
+  end
+
+  it "should parse ranges" do
+    eval1("..10").should eq 0..9
+    eval1("1..100").should eq 1..100
+    eval1("+\\1..100").should eq (100 * 101) / 2
+    eval1("+\\..100").should eq (99 * 100) / 2
+  end
+
+  it "should map ranges" do
+    eval1("^2@1..3").should eq [1, 4, 9]
+    eval1("2^@1..3").should eq [2, 4, 8]
+  end
+
+  it "should apply monads to single element too" do
+    eval1("*2@+\\1 2 3").should eq 12
+  end
+
+  it "should save assigned variables in env" do
+    e = Calvin::Evaluator.new
+
+    e.apply ast("a:=1")
+    e.env["a"].should eq [1]
+    e.apply(ast("a")[0]).should eq [1]
+
+    e.apply ast("a:=1 2 4")
+    e.apply(ast("a")[0]).should eq [1, 2, 4]
+
+    e.apply ast("b:=+\\4..6")
+    e.apply(ast("b")[0]).should eq 15
+  end
+end

data/spec/spec_helper.rb

@@ -0,0 +1,20 @@
+require "bundler/setup"
+require "calvin"
+
+RSpec.configure do |config|
+  def ast(input)
+    Calvin::AST.new(input).ast
+  end
+
+  def aste(input)
+    ast(input)[0][:expression]
+  end
+
+  def eval(input)
+    Calvin::Evaluator.new.apply ast(input)
+  end
+
+  def eval1(input)
+    eval(input).first
+  end
+end

metadata

@@ -0,0 +1,119 @@
+--- !ruby/object:Gem::Specification
+name: calvin
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+  prerelease: 
+platform: ruby
+authors:
+- Utkarsh Kukreti
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-11-25 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: docopt
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: parslet
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Very terse programming language, inspired by APL/J/K.
+email:
+- utkarshkukreti@gmail.com
+executables:
+- calvin
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- .rspec
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/calvin
+- calvin.gemspec
+- lib/calvin.rb
+- lib/calvin/ast.rb
+- lib/calvin/cli.rb
+- lib/calvin/core.rb
+- lib/calvin/evaluator.rb
+- lib/calvin/parser.rb
+- lib/calvin/transform.rb
+- lib/calvin/version.rb
+- spec/ast_spec.rb
+- spec/calvin_spec.rb
+- spec/evaluator_spec.rb
+- spec/spec_helper.rb
+homepage: https://github.com/utkarshkukreti/calvin
+licenses: []
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.23
+signing_key: 
+specification_version: 3
+summary: Very terse programming language, inspired by APL/J/K.
+test_files:
+- spec/ast_spec.rb
+- spec/calvin_spec.rb
+- spec/evaluator_spec.rb
+- spec/spec_helper.rb
+has_rdoc: