malady 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 0d14f4e7a9f9b9ce3dc3cb990f414f8dd5e57c80
+  data.tar.gz: e487da725753bca92744a880d4387c2950cfceb1
+SHA512:
+  metadata.gz: 7d744a69db79e060449af290b692c3962d2ec1ce98ab1de9b9a232e17150258c10ce2e1d151e3b623f68c108cd140ef2d1f71af1bc719bfcc990a9239e758db9
+  data.tar.gz: 0f62ddf7153ed892fc9798891de11a7290ad7af5ce1ba4d21125edf95b12cd3a32e324ef8fc38c4313fab3dbfa192f2c3f8731c3abea1ec3dd123b331696621d

data/.gitignore

@@ -0,0 +1,9 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/

data/.rspec

@@ -0,0 +1,3 @@
+--color
+--require spec_helper
+--format documentation

data/.travis.yml

@@ -0,0 +1,4 @@
+language: ruby
+rvm:
+  - 2.1.0
+before_install: gem install bundler -v 1.10.6

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2015 Jason Yeo
+
+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,51 @@
+# Malady
+
+Malady is an implementation of [mal](https://github.com/kanaka/mal) that compiles to [Rubinius](http://rubinius.com) bytecode.
+
+## Installation
+
+```bash
+$ gem install malady
+```
+
+## Usage
+
+Use the `malady` binary provided in the `bin` directory to execute the malady repl.
+
+```bash
+$ malady
+malady> (+ 42 88)
+130
+malady>
+```
+
+## Development
+
+Malady requires [Rubinius](http://rubinius.com).
+
+Install dependencies with bundle
+
+```bash
+$ bundle install
+```
+
+To run tests, use rspec
+
+```bash
+$ rspec
+```
+
+## To Do:
+
+- [ ] Macros
+- [ ] Import mal's test cases
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/jsyeo/malady.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+

data/Rakefile

@@ -0,0 +1 @@
+require "bundler/gem_tasks"

data/bin/console

@@ -0,0 +1,10 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "malady"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+require "pry"
+Pry.start

data/bin/malady

@@ -0,0 +1,13 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require 'malady'
+
+prompt = 'malady> '
+print prompt
+
+while input = gets
+  output = Malady::Compiler.eval(input, '(eval)', Object.send(:binding))
+  puts output
+  print prompt
+end

data/bin/setup

@@ -0,0 +1,7 @@
+#!/bin/bash
+set -euo pipefail
+IFS=$'\n\t'
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/lib/malady.rb

@@ -0,0 +1,14 @@
+RBX = Rubinius::ToolSets.current::ToolSet
+
+require 'malady/version'
+require 'malady/reader'
+require 'malady/scope'
+require 'malady/ast'
+require 'malady/parser'
+require 'malady/evaluator'
+require 'malady/generator'
+require 'malady/compiler'
+
+module Malady
+  # Your code goes here...
+end

data/lib/malady/ast.rb

@@ -0,0 +1,298 @@
+module Malady
+  module AST
+    class Node
+      attr_reader :filename, :line
+
+      def initialize(filename="(script)", line=1, *args)
+        @filename = filename
+        @line = line
+      end
+
+      def pos(g)
+        g.set_line line
+      end
+    end
+
+    class Program < Node
+      attr_reader :body
+
+      def initialize(filename, line, body)
+        super
+        @body = body
+      end
+
+      def bytecode(g)
+        g.file = (filename || :"(malady)").to_sym
+        pos(g)
+
+        body.each_with_index do |expression, idx|
+          expression.bytecode(g)
+          g.pop unless idx == body.size - 1
+        end
+
+        g.finalize
+      end
+    end
+
+    class SymbolNode < Node
+      attr_reader :name
+
+      def initialize(filename, line, name)
+        super
+        @name = name
+      end
+
+      def bytecode(g)
+        pos(g)
+        local = g.state.scope.search_local(name)
+        local.get_bytecode(g)
+      end
+    end
+
+    class IntegerNode < Node
+      attr_reader :value
+
+      def initialize(filename, line, value)
+        super
+        @value = value.to_i
+      end
+
+      def bytecode(g)
+        pos(g)
+        g.push_int value
+      end
+    end
+
+    class BinaryNode < Node
+      attr_reader :lhs, :rhs
+
+      def initialize(filename, line, lhs, rhs)
+        super
+        @lhs = lhs
+        @rhs = rhs
+      end
+    end
+
+    class AddNode < BinaryNode
+      def bytecode(g)
+        pos(g)
+        lhs.bytecode(g)
+        rhs.bytecode(g)
+        g.send(:+, 1)
+      end
+    end
+
+    class MinusNode < BinaryNode
+      def bytecode(g)
+        pos(g)
+        lhs.bytecode(g)
+        rhs.bytecode(g)
+        g.send(:-, 1)
+      end
+    end
+
+    class DivideNode < BinaryNode
+      def bytecode(g)
+        pos(g)
+        lhs.bytecode(g)
+        rhs.bytecode(g)
+        g.send(:/, 1)
+      end
+    end
+
+    class MultiplyNode < BinaryNode
+      def bytecode(g)
+        pos(g)
+        lhs.bytecode(g)
+        rhs.bytecode(g)
+        g.send(:*, 1)
+      end
+    end
+
+    class AssignNode < Node
+      attr_reader :name, :value
+
+      def initialize(filename, line, name, value)
+        super
+        @name = name
+        @value = value
+      end
+
+      def bytecode(g)
+        pos(g)
+        local = g.state.scope.new_local(name)
+        value.bytecode(g)
+        local.reference.set_bytecode(g)
+      end
+    end
+
+    class TrueBooleanNode < Node
+      def bytecode(g)
+        pos(g)
+        g.push_true
+      end
+    end
+
+    class FalseBooleanNode < Node
+      def bytecode(g)
+        pos(g)
+        g.push_false
+      end
+    end
+
+    class IfNode < Node
+      attr_reader :condition, :then_branch, :else_branch
+      def initialize(filename, line, condition, then_branch, else_branch)
+        super
+        @condition = condition
+        @then_branch = then_branch
+        @else_branch = else_branch
+      end
+
+      def bytecode(g)
+        pos(g)
+
+        end_label = g.new_label
+        else_label = g.new_label
+
+        condition.bytecode(g)
+        g.goto_if_false else_label
+        then_branch.bytecode(g)
+        g.goto end_label
+
+        else_label.set!
+        else_branch.bytecode(g)
+
+        end_label.set!
+      end
+    end
+
+    class LessThanNode < BinaryNode
+      def bytecode(g)
+        pos(g)
+        lhs.bytecode(g)
+        rhs.bytecode(g)
+        g.send(:<, 1)
+      end
+    end
+
+    class FnNode < Node
+      attr_reader :arguments, :body
+
+      def initialize(filename, line, arguments, body)
+        @filename = filename
+        @line = line
+        @arguments = arguments
+        @body = body
+      end
+
+      def bytecode(g)
+        pos(g)
+
+        # get a new scope
+        scope = Malady::Scope.new
+
+        # nest the scope in the current context
+        state = g.state
+        state.scope.nest_scope scope
+
+        # get a new generator for our block
+        blk = new_block_generator(g, @arguments)
+
+        # push our scope
+        blk.push_state scope
+
+        # setup the state in our block
+        blk.state.push_super state.super
+        blk.state.push_eval state.eval
+        blk.state.push_name blk.name
+
+        # our args are locals in the block
+        @arguments.each do |id|
+          blk.shift_array
+          local = blk.state.scope.new_local(id.to_s)
+          blk.set_local local.slot
+          blk.pop
+        end
+        blk.pop if !@arguments.empty?
+
+        # push the block
+        blk.state.push_block
+
+        # compile the body of the closure in the block
+        body.bytecode(blk)
+
+        # pop the block
+        blk.state.pop_block
+        blk.ret
+
+        # pop the state
+        blk.local_names = blk.state.scope.local_names
+        blk.local_count = blk.state.scope.local_count
+        blk.pop_state
+        blk.close
+
+        # create the block in our current generator
+        g.create_block blk
+      end
+
+      def new_block_generator(g, arguments)
+        blk = g.class.new
+        blk.name = g.state.name || :__block__
+        blk.file = g.file
+        blk.for_block = true
+
+        blk.required_args = arguments.count
+        blk.post_args = arguments.count
+        blk.total_args = arguments.count
+        blk.cast_for_multi_block_arg if !arguments.count.zero?
+
+        blk
+      end
+    end
+
+    class LetNode < FnNode
+      attr_reader :bindings, :identifiers, :values
+
+      def initialize(filename, line, bindings, body)
+        @bindings = bindings
+        @identifiers = @bindings.map(&:first)
+        @values = @bindings.map(&:last)
+        super(filename, line, identifiers, body)
+      end
+
+      # A LetNode is basically a closure with its arguments applied to the bindings
+      def bytecode(g)
+        super(g)
+
+        # compile bindings' values
+        @values.each do |val|
+          val.bytecode(g)
+        end
+
+        # send :call to the block
+        g.send :call, @bindings.count
+      end
+    end
+
+    class FunctionCallNode < Node
+      attr_reader :function, :arguments
+
+      def initialize(filename, line, function, arguments)
+        super
+        @function = function
+        @arguments = arguments
+      end
+
+      def bytecode(g)
+        function.bytecode(g)
+
+        @arguments.each do |val|
+          val.bytecode(g)
+        end
+
+        g.send :call, @arguments.count
+      end
+    end
+  end
+end

data/lib/malady/compiler.rb

@@ -0,0 +1,109 @@
+module Malady
+  class Compiler < RBX::Compiler
+    Stages = Hash.new { |h,k| RBX::Compiler::Stages[k] }
+
+    def initialize(from, to)
+      @start = Stages[from].new self, to
+    end
+
+    def self.eval(code, *args)
+      file, line, binding, instance = '(eval)', 1, Object.send(:binding), Object.new
+      args.each do |arg|
+        case arg
+        when String   then file    = arg
+        when Integer  then line    = arg
+        when Binding  then binding = arg
+        else
+          instance = arg
+        end
+      end
+
+      cm       = compile_eval(code, binding.variables, file, line)
+      cm.scope = Rubinius::ConstantScope.new(Object)
+      cm.name  = :__malady__
+      script   = Rubinius::CompiledMethod::Script.new(cm, file, true)
+      be       = Rubinius::BlockEnvironment.new
+
+      script.eval_source  = code
+      cm.scope.script     = script
+
+      be.under_context(binding.variables, cm)
+      be.call_on_instance(instance)
+    end
+
+    def self.compile_eval(string, variable_scope, file="(eval)", line=1)
+      if ec = @eval_cache
+        layout = variable_scope.local_layout
+        if code = ec.retrieve([string, layout, line])
+          return code
+        end
+      end
+
+      compiler = new :eval, :compiled_code
+
+      parser = compiler.parser
+      parser.root RBX::AST::EvalExpression
+      parser.default_transforms
+      parser.input string, file, line
+
+      compiler.generator.variable_scope = variable_scope
+
+      code = compiler.run
+
+      code.add_metadata :for_eval, true
+
+      if ec and parser.should_cache?
+        ec.set([string.dup, layout, line], code)
+      end
+
+      return code
+    end
+
+    # AST -> Bytecode
+    class Bytecode < RBX::Compiler::Bytecode
+      Stages[:bytecode] = self
+      next_stage RBX::Compiler::Encoder
+
+      def initialize(*)
+        super
+      ensure
+        @processor = Malady::Generator
+      end
+    end
+
+    # String -> AST
+    class StringParser < RBX::Compiler::Parser
+      Stages[:string] = self
+      next_stage Bytecode
+
+      def initialize(*)
+        super
+      ensure
+        @processor = Malady::Parser.new '(eval)'
+      end
+
+      def create
+        @parser = @processor
+      end
+
+      def input(string, name="(eval)", line=1)
+        @input = string
+        @file = name
+        @line = line
+      end
+
+      def parse
+        create.parse_string(@input)
+      end
+    end
+
+    class EvalParser < StringParser
+      Stages[:eval] = self
+      next_stage Bytecode
+
+      def should_cache?
+        @output.should_cache?
+      end
+    end
+  end
+end

data/lib/malady/evaluator.rb

@@ -0,0 +1,43 @@
+module Malady
+  module Evaluator
+    module_function
+    def evaluate(env, ast)
+      type = ast.first
+      rest = ast[1..-1]
+      if type == :list
+        evaluated_list = eval_ast(env, ast)
+        fn = evaluated_list[1]
+        args = evaluated_list[2..-1]
+        fn.call(*args)
+      else
+        eval_ast(env, ast)
+      end
+    end
+
+    def eval_with_repl_env(ast)
+      repl_env = {
+        '+' => lambda { |x, y| x + y },
+        '-' => lambda { |x, y| x - y },
+        '/' => lambda { |x, y| Integer(x / y) },
+        '*' => lambda { |x, y| x * y }
+      }
+      evaluate(repl_env, ast)
+    end
+
+    def eval_ast(env, ast)
+      type = ast.first
+      rest = ast[1..-1]
+      case type
+      when :symbol
+        env[ast[1]]
+      when :list
+        result = [:list]
+        result + rest.map { |ast| evaluate(env, ast) }
+      when :integer
+        ast[1]
+      else
+        ast
+      end
+    end
+  end
+end

data/lib/malady/generator.rb

@@ -0,0 +1,22 @@
+module Malady
+  class Generator < RBX::Generator
+    def debug!
+      p @detected_locals
+      puts '*****'
+      ip = 0
+      while instruction = stream[ip]
+        instruct = RBX::InstructionSet[instruction]
+        ip += instruct.size
+        puts "#{instruct.name}"
+      end
+      puts '**end**'
+    end
+
+    def finalize
+      self.local_names = state.scope.local_names
+      self.local_count = state.scope.local_count
+      pop_state
+      close
+    end
+  end
+end

data/lib/malady/parser.rb

@@ -0,0 +1,114 @@
+module Malady
+  class Parser
+    attr_reader :filename
+
+    def initialize(filename)
+      @filename = filename
+      @line = 0
+    end
+
+    def parse_string(string)
+      sexp = Reader.read_str(string)
+      program_body = [parse(sexp)]
+      Malady::AST::Program.new @filename, @line, program_body
+    end
+
+    def parse(sexp)
+      type, *rest = sexp
+      if type == :list
+        symbol = rest.first
+        case symbol[1]
+        when 'def!'
+          parse_def(sexp)
+        when 'let*'
+          parse_let(sexp)
+        when 'if'
+          parse_if(sexp)
+        when 'fn*'
+          parse_fn(sexp)
+        else
+          fn, *args = parse_sexp(sexp)
+          apply(fn, args)
+        end
+      else
+        parse_sexp(sexp)
+      end
+    end
+
+    def parse_sexp(sexp)
+      type, *rest = sexp
+      case type
+      when :boolean
+        boolean = sexp.last
+        if boolean == :true
+          Malady::AST::TrueBooleanNode.new(@filename, @line)
+        else
+          Malady::AST::FalseBooleanNode.new(@filename, @line)
+        end
+      when :symbol
+        name = sexp.last
+        builtins.fetch(name, Malady::AST::SymbolNode.new(@filename, @line, name))
+      when :integer
+        Malady::AST::IntegerNode.new @filename, @line, sexp[1]
+      when :list
+        rest.map { |sexp| parse(sexp) }
+      end
+    end
+
+    def parse_def(sexp)
+      # [:list, [:symbol, 'def!'], [:symbol, 'blah'], sexp]
+      name = sexp[2][1]
+      value = sexp[3]
+      Malady::AST::AssignNode.new(@filename, @line, name, parse(value))
+    end
+
+    def parse_let(sexp)
+      # [:list, [:symbol, 'let'], [:list, [:symbol, 'c'], sexp], sexp]
+      bindings = sexp[2][1..-1].each_slice(2).to_a
+      body = sexp[3]
+      parsed_bindings = bindings.map { |s, val| [s[1], parse(val)] }
+      Malady::AST::LetNode.new(@filename, @line, parsed_bindings, parse(body))
+    end
+
+    def parse_if(sexp)
+      # [:list, [:symbol, 'if'], condition, then_branch, else_branch]
+      _, _, condition, then_branch, else_branch = sexp
+      Malady::AST::IfNode.new(@filename, @line, parse(condition), parse(then_branch), parse(else_branch))
+    end
+
+    def parse_fn(sexp)
+      # [:list, [:symbol, 'fn*'], [:list, [:symbol, 'x']], body]
+      _, _, (_, *arguments), body = sexp
+      arguments = arguments.map(&:last)
+      Malady::AST::FnNode.new(@filename, @line, arguments, parse(body))
+    end
+
+    def apply(fn, args)
+      if builtins.values.include? fn
+        fn.new(@filename, @line, *args)
+      else
+        Malady::AST::FunctionCallNode.new(@filename, @line, fn, args)
+      end
+    end
+
+    def builtins
+      {
+        '+' => Malady::AST::AddNode,
+        '-' => Malady::AST::MinusNode,
+        '/' => Malady::AST::DivideNode,
+        '*' => Malady::AST::MultiplyNode,
+        '<' => Malady::AST::LessThanNode,
+      }
+    end
+
+    # the following methods are needed to conform with RBX's parser interface
+    def pre_exe
+      []
+    end
+
+    def on_error(t, val, vstack)
+        raise ParseError, sprintf("\nparse error on value %s (%s) #{@filename}:#{@line}",
+            val.inspect, token_to_str(t) || '?')
+    end
+  end
+end

data/lib/malady/reader.rb

@@ -0,0 +1,61 @@
+module Malady
+  module Reader
+    module_function
+    def parse_string(string)
+      read_str(string)
+    end
+
+    def read_str(string)
+      tokens = tokenizer(string)
+      read_form(tokens)
+    end
+
+    def read_form(tokens)
+      if tokens.first =~ /(\(|\[)/
+        read_list(tokens)
+      else
+        read_atom(tokens.shift)
+      end
+    end
+
+    def read_list(tokens)
+      raise 'Reader error: read_list called on non-list' if tokens.shift !~ /(\(|\[)/
+      list = [:list]
+
+      while tokens.first !~ /(\)|\])/
+        raise 'Reader error: Unmatched parens' if tokens.empty?
+        list << read_form(tokens)
+      end
+
+      tokens.shift # pop our closing paren
+
+      list
+    end
+
+    def read_atom(token)
+      case token
+      when /^-?\d+$/
+        [:integer, token.to_i]
+      when 'true'
+        [:boolean, :true]
+      when 'false'
+        [:boolean, :false]
+      when /^\D+$/
+        [:symbol, token]
+      else
+        raise 'Reader error: Unknown token'
+      end
+    end
+
+    def tokenizer(string)
+      pos = 0
+      re = /[\s,]*(~@|[\[\]{}()'`~^@]|"(?:\\.|[^\\"])*"|;.*|[^\s\[\]{}('"`,;)]*)/
+      result = []
+      while (m = re.match(string, pos)) && pos < string.size
+        result << m.to_s.strip
+        pos = m.end(0)
+      end
+      result
+    end
+  end
+end

data/lib/malady/scope.rb

@@ -0,0 +1,62 @@
+module Malady
+  class Scope
+    include RBX::Compiler::LocalVariables
+
+    attr_accessor :parent
+
+    def nest_scope(scope)
+      scope.parent = self
+    end
+
+    # A nested scope is looking up a local variable. If the variable exists
+    # in our local variables hash, return a nested reference to it. If it
+    # exists in an enclosing scope, increment the depth of the reference
+    # when it passes through this nested scope (i.e. the depth of a
+    # reference is a function of the nested scopes it passes through from
+    # the scope it is defined in to the scope it is used in).
+    def search_local(name)
+      if variable = variables[name]
+        variable.nested_reference
+      elsif block_local?(name)
+        new_local name
+      elsif reference = @parent.search_local(name)
+        reference.depth += 1
+        reference
+      end
+    end
+
+    def block_local?(name)
+      @locals.include?(name) if @locals
+    end
+
+    def new_local(name)
+      variable = RBX::Compiler::LocalVariable.new allocate_slot
+      variables[name] = variable
+    end
+
+    def new_nested_local(name)
+      new_local(name).nested_reference
+    end
+
+    # If the local variable exists in this scope, set the local variable
+    # node attribute to a reference to the local variable. If the variable
+    # exists in an enclosing scope, set the local variable node attribute to
+    # a nested reference to the local variable. Otherwise, create a local
+    # variable in this scope and set the local variable node attribute.
+    def assign_local_reference(var)
+      if variable = variables[var.name]
+        var.variable = variable.reference
+      elsif block_local?(var.name)
+        variable = new_local var.name
+        var.variable = variable.reference
+      elsif reference = @parent.search_local(var.name)
+        reference.depth += 1
+        var.variable = reference
+      else
+        variable = new_local var.name
+        var.variable = variable.reference
+      end
+    end
+  end
+end
+

data/lib/malady/version.rb

@@ -0,0 +1,3 @@
+module Malady
+  VERSION = "0.1.0"
+end

data/malady.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'malady/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "malady"
+  spec.version       = Malady::VERSION
+  spec.authors       = ["Jason Yeo"]
+  spec.email         = ["jasonyeo88@gmail.com"]
+
+  spec.summary       = %q{An implementation of lisp that compiles to rubinius bytecode.}
+  spec.homepage      = "https://github.com/jsyeo/malady"
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.10"
+  spec.add_development_dependency "rake", "~> 10.0"
+end

metadata

@@ -0,0 +1,93 @@
+--- !ruby/object:Gem::Specification
+name: malady
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Jason Yeo
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-01-26 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+  name: bundler
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+- !ruby/object:Gem::Dependency
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  name: rake
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+description: 
+email:
+- jasonyeo88@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/malady
+- bin/setup
+- lib/malady.rb
+- lib/malady/ast.rb
+- lib/malady/compiler.rb
+- lib/malady/evaluator.rb
+- lib/malady/generator.rb
+- lib/malady/parser.rb
+- lib/malady/reader.rb
+- lib/malady/scope.rb
+- lib/malady/version.rb
+- malady.gemspec
+homepage: https://github.com/jsyeo/malady
+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.5.1
+signing_key: 
+specification_version: 4
+summary: An implementation of lisp that compiles to rubinius bytecode.
+test_files: []
+has_rdoc: