swift-pyrite 0.1.0

data/vendor/bundle/ruby/2.0.0/gems/treetop-1.6.3/examples/lambda_calculus/lambda_calculus.treetop

@@ -0,0 +1,132 @@
+grammar LambdaCalculus
+  include Arithmetic
+
+  rule program
+    expression more_expressions:(';' space expression)* {
+      def eval(env={})
+        env = env.clone
+        last_eval = nil
+        expressions.each do |exp|
+          last_eval = exp.eval(env)
+        end
+        last_eval
+      end
+      
+      def expressions
+        [expression] + more_expressions.elements.map {|elt| elt.expression}
+      end
+    }
+  end
+
+  rule expression
+    definition / conditional / application / function / super
+  end
+  
+  rule definition
+    'def' space variable space expression {
+      def eval(env)
+        env[variable.name] = expression.eval(env)
+      end
+    }
+  end
+  
+  rule conditional
+    'if' space '(' space condition:expression space ')' space
+    true_case:expression space 'else' space false_case:expression {
+      def eval(env)
+        if condition.eval(env)
+          true_case.eval(env)
+        else
+          false_case.eval(env)
+        end
+      end
+    }
+  end
+  
+  rule primary
+    application / super
+  end
+
+  rule application
+    operator space expression <Application> {
+      def eval(env={})
+        left_associative_apply(operator.eval(env), env)
+      end
+      
+      def left_associative_apply(operator, env)
+        if expression.instance_of?(Application)
+          expression.left_associative_apply(operator.apply(expression.operator.eval(env)), env)
+        else
+          operator.apply(expression.eval(env))
+        end
+      end
+      
+      def to_s(env={})
+        operator.to_s(env) + ' ' + expression.to_s(env)
+      end
+    }
+  end
+  
+  rule operator
+    function / variable
+  end
+  
+  rule non_application
+    function / variable
+  end
+  
+  rule function
+    '\\' param:variable '(' body:expression ')' {
+      class Closure
+        attr_reader :env, :function
+        
+        def initialize(function, env)
+          @function = function
+          @env = env
+        end
+      
+        def apply(arg)
+          function.body.eval(function.param.bind(arg, env))
+        end
+      
+        def to_s(other_env={})
+          "\\#{function.param.to_s}(#{function.body.to_s(other_env.merge(env))})"
+        end
+      end
+      
+      def eval(env={})
+        Closure.new(self, env)
+      end
+      
+      def to_s(env={})
+        eval(env).to_s
+      end
+    }
+  end
+  
+  rule variable
+    !keyword (
+      super {
+        def bind(value, env)
+          env.merge(name => value)
+        end
+
+        def to_s(env={})
+          env.has_key?(name) ? env[name].to_s : name
+      end
+      }
+    )
+  end
+  
+  rule keyword
+    ('if' / 'else') !non_space_char
+  end
+  
+  rule non_space_char
+    ![ \n] .
+  end
+  
+  rule space
+    [ \n]*
+  end
+end

data/vendor/bundle/ruby/2.0.0/gems/treetop-1.6.3/examples/lambda_calculus/lambda_calculus_node_classes.rb

@@ -0,0 +1,5 @@
+module LambdaCalculus
+  class Application < Treetop::Runtime::SyntaxNode
+    
+  end
+end

data/vendor/bundle/ruby/2.0.0/gems/treetop-1.6.3/examples/lambda_calculus/lambda_calculus_test.rb

@@ -0,0 +1,89 @@
+dir = File.dirname(__FILE__)
+require File.expand_path("#{dir}/test_helper")
+require File.expand_path("#{dir}/arithmetic_node_classes")
+require File.expand_path("#{dir}/lambda_calculus_node_classes")
+Treetop.load File.expand_path("#{dir}/arithmetic")
+Treetop.load File.expand_path("#{dir}/lambda_calculus")
+
+class Treetop::Runtime::SyntaxNode 
+  def method_missing(method, *args)
+    raise "Node representing #{text_value} does not respond to #{method}"
+  end
+end
+
+class LambdaCalculusParserTest < Test::Unit::TestCase
+  include ParserTestHelper
+  
+  def setup
+    @parser = LambdaCalculusParser.new
+  end
+  
+  def test_free_variable
+    assert_equal 'x', parse('x').eval.to_s
+  end
+  
+  def test_variable_binding
+    variable = parse('x').eval
+    env = variable.bind(1, {})
+    assert_equal 1, env['x']
+  end
+  
+  def test_bound_variable_evaluation
+    assert_equal 1, parse('x').eval({'x' => 1})
+  end
+  
+  def test_identity_function
+    assert_equal '\x(x)', parse('\x(x)').eval.to_s
+  end
+  
+  def test_function_returning_constant_function
+    assert_equal '\x(\y(x))', parse('\x(\y(x))').eval.to_s
+  end
+  
+  def test_identity_function_application
+    assert_equal 1, parse('\x(x) 1').eval
+    assert_equal '\y(y)', parse('\x(x) \y(y)').eval.to_s
+  end
+  
+  def test_constant_function_construction
+    assert_equal '\y(1)', parse('\x(\y(x)) 1').eval.to_s
+  end
+  
+  def test_multiple_argument_application_is_left_associative
+    assert_equal '\b(b)', parse('\x(\y(x y)) \a(a) \b(b)').eval.to_s
+  end
+  
+  def test_parentheses_override_application_order
+    assert_equal '\y(\b(b) y)', parse('\x(\y(x y)) (\a(a) \b(b))').eval.to_s
+  end
+  
+  def test_arithmetic_in_function_body
+    assert_equal 10, parse('\x(x + 5) 5').eval
+  end
+  
+  def test_addition_of_function_results
+    assert_equal 20, parse('\x(x + 5) 5 + \x(15 - x) 5').eval
+  end
+  
+  def test_conditional
+    result = parse('if (x) 1 else 2')
+    assert_equal 1, result.eval({'x' => true})
+    assert_equal 2, result.eval({'x' => false})
+  end
+  
+  def test_keyword
+    assert @parser.parse('if').failure?
+    assert @parser.parse('else').failure?
+    assert parse('elsee').success?
+    assert parse('iff').success?
+  end
+  
+  def test_program
+    result = parse('def fact \x(if (x == 0)
+                                  1
+                                else
+                                  x * fact (x - 1));
+                    fact(5)').eval
+    assert_equal 5 * 4 * 3 * 2, result
+  end
+end

data/vendor/bundle/ruby/2.0.0/gems/treetop-1.6.3/examples/lambda_calculus/test_helper.rb

@@ -0,0 +1,18 @@
+require 'test/unit'
+require 'rubygems'
+require 'treetop'
+
+module ParserTestHelper
+  def assert_evals_to_self(input)
+    assert_evals_to(input, input)
+  end
+  
+  def parse(input)
+    result = @parser.parse(input)
+    unless result
+      puts @parser.terminal_failures.join("\n")
+    end
+    assert !result.nil?
+    result
+  end
+end

data/vendor/bundle/ruby/2.0.0/gems/treetop-1.6.3/examples/numerals.rb

@@ -0,0 +1,210 @@
+# Autogenerated from a Treetop grammar. Edits may be lost.
+
+
+module Numerals
+  include Treetop::Runtime
+
+  def root
+    @root ||= :percentage
+  end
+
+  module Percentage0
+    def decimal
+      elements[0]
+    end
+
+  end
+
+  module Percentage1
+    def to_f
+      decimal.to_f / 100
+    end
+  end
+
+  def _nt_percentage
+    start_index = index
+    if node_cache[:percentage].has_key?(index)
+      cached = node_cache[:percentage][index]
+      if cached
+        node_cache[:percentage][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0, s0 = index, []
+    r1 = _nt_decimal
+    s0 << r1
+    if r1
+      if (match_len = has_terminal?("%", false, index))
+        r2 = true
+        @index += match_len
+      else
+        terminal_parse_failure('"%"')
+        r2 = nil
+      end
+      s0 << r2
+    end
+    if s0.last
+      r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
+      r0.extend(Percentage0)
+      r0.extend(Percentage1)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:percentage][start_index] = r0
+
+    r0
+  end
+
+  module Decimal0
+    def sign
+      elements[0]
+    end
+
+  end
+
+  module Decimal1
+    def to_f
+      text_value.to_f
+    end
+  end
+
+  def _nt_decimal
+    start_index = index
+    if node_cache[:decimal].has_key?(index)
+      cached = node_cache[:decimal][index]
+      if cached
+        node_cache[:decimal][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i0, s0 = index, []
+    r1 = _nt_sign
+    s0 << r1
+    if r1
+      s2, i2 = [], index
+      loop do
+        if has_terminal?(@regexps[gr = '\A[0-9]'] ||= Regexp.new(gr), :regexp, index)
+          r3 = true
+          @index += 1
+        else
+          terminal_parse_failure('[0-9]')
+          r3 = nil
+        end
+        if r3
+          s2 << r3
+        else
+          break
+        end
+      end
+      if s2.empty?
+        @index = i2
+        r2 = nil
+      else
+        r2 = instantiate_node(SyntaxNode,input, i2...index, s2)
+      end
+      s0 << r2
+      if r2
+        if (match_len = has_terminal?('.', false, index))
+          r4 = true
+          @index += match_len
+        else
+          terminal_parse_failure('\'.\'')
+          r4 = nil
+        end
+        s0 << r4
+        if r4
+          s5, i5 = [], index
+          loop do
+            if has_terminal?(@regexps[gr = '\A[0-9]'] ||= Regexp.new(gr), :regexp, index)
+              r6 = true
+              @index += 1
+            else
+              terminal_parse_failure('[0-9]')
+              r6 = nil
+            end
+            if r6
+              s5 << r6
+            else
+              break
+            end
+          end
+          r5 = instantiate_node(SyntaxNode,input, i5...index, s5)
+          s0 << r5
+        end
+      end
+    end
+    if s0.last
+      r0 = instantiate_node(SyntaxNode,input, i0...index, s0)
+      r0.extend(Decimal0)
+      r0.extend(Decimal1)
+    else
+      @index = i0
+      r0 = nil
+    end
+
+    node_cache[:decimal][start_index] = r0
+
+    r0
+  end
+
+  def _nt_sign
+    start_index = index
+    if node_cache[:sign].has_key?(index)
+      cached = node_cache[:sign][index]
+      if cached
+        node_cache[:sign][index] = cached = SyntaxNode.new(input, index...(index + 1)) if cached == true
+        @index = cached.interval.end
+      end
+      return cached
+    end
+
+    i1 = index
+    if (match_len = has_terminal?('+', false, index))
+      r2 = true
+      @index += match_len
+    else
+      terminal_parse_failure('\'+\'')
+      r2 = nil
+    end
+    if r2
+      r2 = SyntaxNode.new(input, (index-1)...index) if r2 == true
+      r1 = r2
+    else
+      if (match_len = has_terminal?('-', false, index))
+        r3 = true
+        @index += match_len
+      else
+        terminal_parse_failure('\'-\'')
+        r3 = nil
+      end
+      if r3
+        r3 = SyntaxNode.new(input, (index-1)...index) if r3 == true
+        r1 = r3
+      else
+        @index = i1
+        r1 = nil
+      end
+    end
+    if r1
+      r0 = r1
+    else
+      r0 = instantiate_node(SyntaxNode,input, index...index)
+    end
+
+    node_cache[:sign][start_index] = r0
+
+    r0
+  end
+
+end
+
+class NumeralsParser < Treetop::Runtime::CompiledParser
+  include Numerals
+end
+

data/vendor/bundle/ruby/2.0.0/gems/treetop-1.6.3/examples/numerals.tt

@@ -0,0 +1,21 @@
+grammar Numerals
+  rule percentage
+    (decimal "%") {
+      def to_f
+        decimal.to_f / 100
+      end
+    }
+  end
+
+  rule decimal
+    sign [0-9]+ '.' [0-9]* {
+      def to_f
+        text_value.to_f
+      end
+    }
+  end
+
+  rule sign
+    ('+'/'-')? 
+  end
+end

data/vendor/bundle/ruby/2.0.0/gems/treetop-1.6.3/lib/treetop/bootstrap_gen_1_metagrammar.rb

@@ -0,0 +1,42 @@
+# This file's job is to load a Treetop::Compiler::Metagrammar and Treetop::Compiler::MetagrammarParser
+# into the environment by compiling the current metagrammar.treetop using a trusted version of Treetop.
+
+require 'rubygems'
+
+TREETOP_VERSION_REQUIRED_TO_BOOTSTRAP = '>= 1.1.5'
+
+# Loading trusted version of Treetop to compile the compiler
+gem_spec = Gem.source_index.find_name('treetop', TREETOP_VERSION_REQUIRED_TO_BOOTSTRAP).last
+raise "Install a Treetop Gem version #{TREETOP_VERSION_REQUIRED_TO_BOOTSTRAP} to bootstrap." unless gem_spec
+require "#{gem_spec.full_gem_path}/lib/treetop"
+
+# Relocating trusted version of Treetop to Trusted::Treetop
+Trusted = Module.new
+Trusted::Treetop = Treetop
+Object.send(:remove_const, :Treetop)
+
+# Requiring version of Treetop that is under test
+$exclude_metagrammar = true
+require File.expand_path('../treetop')
+
+# Compile and evaluate freshly generated metagrammar source
+METAGRAMMAR_PATH = File.expand_path('../compiler/metagrammar.treetop', __FILE__)
+compiled_metagrammar_source = Trusted::Treetop::Compiler::GrammarCompiler.new.ruby_source(METAGRAMMAR_PATH)
+Object.class_eval(compiled_metagrammar_source)
+
+# The compiler under test was compiled with the trusted grammar and therefore depends on its runtime
+# But the runtime in the global namespace is the new runtime. We therefore inject the trusted runtime
+# into the compiler so its parser functions correctly. It will still not work for custom classes that
+# explicitly subclass the wrong runtime. For now I am working around this by keeping 1 generation of
+# backward compatibility in these cases.
+# Treetop::Compiler::Metagrammar.module_eval do
+#   include Trusted::Treetop::Runtime
+# end
+# 
+# Treetop::Compiler.send(:remove_const, :MetagrammarParser)
+# class Treetop::Compiler::MetagrammarParser < Trusted::Treetop::Runtime::CompiledParser
+#   include Treetop::Compiler::Metagrammar
+#   include Trusted::Treetop::Runtime
+# end
+
+$bootstrapped_gen_1_metagrammar = true

data/vendor/bundle/ruby/2.0.0/gems/treetop-1.6.3/lib/treetop/compiler/grammar_compiler.rb

@@ -0,0 +1,49 @@
+module Treetop
+  module Compiler
+    AUTOGENERATED = "# Autogenerated from a Treetop grammar. Edits may be lost.\n"
+    class GrammarCompiler
+      def compile(source_path, target_path = source_path.gsub(/\.(treetop|tt)\Z/, '.rb'))
+        File.open(target_path, 'w') do |target_file|
+          ruby = ruby_source(source_path)
+          if ruby =~ /\A#.*\n/
+            ruby.sub!(/\n/, "\n"+AUTOGENERATED+"\n\n")
+          else
+            ruby = AUTOGENERATED+"\n\n"+ruby
+          end
+          target_file.write(ruby)
+        end
+      end
+
+      # compile a treetop file into ruby
+      def ruby_source(source_path)
+        ruby_source_from_string(File.read(source_path))
+      end
+
+      # compile a string containing treetop source into ruby
+      def ruby_source_from_string(s)
+        parser = MetagrammarParser.new
+        result = parser.parse(s)
+        unless result
+          raise RuntimeError.new(parser.failure_reason)
+        end
+        result.compile
+      end
+    end
+  end
+
+  # compile a treetop source file and load it
+  def self.load(path)
+    adjusted_path = path =~ /\.(treetop|tt)\Z/ ? path : path + '.treetop'
+    File.open(adjusted_path) do |source_file|
+      source = source_file.read
+      source.gsub!(/\b__FILE__\b/, %Q{"#{adjusted_path}"})
+      load_from_string(source)
+    end
+  end
+
+  # compile a treetop source string and load it
+  def self.load_from_string(s)
+    compiler = Treetop::Compiler::GrammarCompiler.new
+    Object.class_eval(compiler.ruby_source_from_string(s))
+  end
+end

data/vendor/bundle/ruby/2.0.0/gems/treetop-1.6.3/lib/treetop/compiler/lexical_address_space.rb

@@ -0,0 +1,17 @@
+module Treetop
+  module Compiler
+    class LexicalAddressSpace
+      def initialize
+        reset_addresses
+      end
+      
+      def next_address
+        @next_address += 1
+      end
+      
+      def reset_addresses
+        @next_address = -1
+      end
+    end
+  end
+end