rkelly_for_reef 1.0.8

data/lib/rkelly/runtime.rb

@@ -0,0 +1,36 @@
+require 'rkelly/js'
+require 'rkelly/runtime/scope_chain'
+
+module RKelly
+  class Runtime
+    UNDEFINED = RKelly::JS::Property.new(:undefined, :undefined)
+
+    def initialize
+      @parser = Parser.new
+      @scope  = ScopeChain.new
+    end
+
+    # Execute +js+
+    def execute(js)
+      function_visitor  = Visitors::FunctionVisitor.new(@scope)
+      eval_visitor      = Visitors::EvaluationVisitor.new(@scope)
+      tree = @parser.parse(js)
+      function_visitor.accept(tree)
+      eval_visitor.accept(tree)
+      @scope
+    end
+
+    def call_function(function_name, *args)
+      function = @scope[function_name].value
+      @scope.new_scope { |chain|
+        function.js_call(chain, *(args.map { |x|
+          RKelly::JS::Property.new(:param, x)
+        }))
+      }.value
+    end
+
+    def define_function(function, &block)
+      @scope[function.to_s].function = block
+    end
+  end
+end

data/lib/rkelly/runtime/ruby_function.rb

@@ -0,0 +1,13 @@
+module RKelly
+  class Runtime
+    class RubyFunction
+      def initialize(&block)
+        @code = block
+      end
+
+      def call(chain, *args)
+        @code.call(*args)
+      end
+    end
+  end
+end

data/lib/rkelly/runtime/scope_chain.rb

@@ -0,0 +1,57 @@
+module RKelly
+  class Runtime
+    class ScopeChain
+      include RKelly::JS
+
+      def initialize(scope = Scope.new)
+        @chain = [GlobalObject.new]
+      end
+
+      def <<(scope)
+        @chain << scope
+      end
+
+      def has_property?(name)
+        scope = @chain.reverse.find { |x|
+          x.has_property?(name)
+        }
+        scope ? scope[name] : nil
+      end
+      
+      def [](name)
+        property = has_property?(name)
+        return property if property
+        @chain.last.properties[name]
+      end
+
+      def []=(name, value)
+        @chain.last.properties[name] = value
+      end
+
+      def pop
+        @chain.pop
+      end
+
+      def this
+        @chain.last
+      end
+
+      def new_scope(&block)
+        @chain << Scope.new
+        result = yield(self)
+        @chain.pop
+        result
+      end
+
+      def return=(value)
+        @chain.last.return = value
+      end
+
+      def return; @chain.last.return; end
+
+      def returned?
+        @chain.last.returned?
+      end
+    end
+  end
+end

data/lib/rkelly/syntax_error.rb

@@ -0,0 +1,4 @@
+module RKelly
+  class SyntaxError < ::SyntaxError
+  end
+end

data/lib/rkelly/token.rb

@@ -0,0 +1,19 @@
+module RKelly
+  class Token
+    attr_accessor :name, :value, :transformer, :line
+    def initialize(name, value, &transformer)
+      @name         = name
+      @value        = value
+      @transformer  = transformer
+    end
+
+    def to_racc_token
+      return transformer.call(name, value) if transformer
+      [name, value]
+    end
+
+    def to_s
+      return "#{self.name}: #{self.value}"
+    end
+  end
+end

data/lib/rkelly/tokenizer.rb

@@ -0,0 +1,161 @@
+require 'rkelly/lexeme'
+
+module RKelly
+  class Tokenizer
+    KEYWORDS = %w{
+      break case catch continue default delete do else finally for function
+      if in instanceof new return switch this throw try typeof var void while 
+      with 
+
+      const true false null debugger
+    }
+
+    RESERVED = %w{
+      abstract boolean byte char class double enum export extends
+      final float goto implements import int interface long native package
+      private protected public short static super synchronized throws
+      transient volatile
+    }
+
+    LITERALS = {
+      # Punctuators
+      '=='  => :EQEQ,
+      '!='  => :NE,
+      '===' => :STREQ,
+      '!==' => :STRNEQ,
+      '<='  => :LE,
+      '>='  => :GE,
+      '||'  => :OR,
+      '&&'  => :AND,
+      '++'  => :PLUSPLUS,
+      '--'  => :MINUSMINUS,
+      '<<'  => :LSHIFT,
+      '<<=' => :LSHIFTEQUAL,
+      '>>'  => :RSHIFT,
+      '>>=' => :RSHIFTEQUAL,
+      '>>>' => :URSHIFT,
+      '>>>='=> :URSHIFTEQUAL,
+      '&='  => :ANDEQUAL,
+      '%='  => :MODEQUAL,
+      '^='  => :XOREQUAL,
+      '|='  => :OREQUAL,
+      '+='  => :PLUSEQUAL,
+      '-='  => :MINUSEQUAL,
+      '*='  => :MULTEQUAL,
+      '/='  => :DIVEQUAL,
+    }
+
+    # Some keywords can be followed by regular expressions (eg, return and throw).
+    # Others can be followed by division.
+    KEYWORDS_THAT_IMPLY_DIVISION = %w{
+      this true false null
+    }
+
+    KEYWORDS_THAT_IMPLY_REGEX = KEYWORDS - KEYWORDS_THAT_IMPLY_DIVISION
+
+    SINGLE_CHARS_THAT_IMPLY_DIVISION = [')', ']', '}']
+
+    def initialize(&block)
+      @lexemes = []
+
+      token(:COMMENT, /\A\/(?:\*(?:.)*?\*\/|\/[^\n]*)/m)
+      token(:STRING, /\A"(?:[^"\\]*(?:\\.[^"\\]*)*)"|\A'(?:[^'\\]*(?:\\.[^'\\]*)*)'/m)
+
+      # A regexp to match floating point literals (but not integer literals).
+      token(:NUMBER, /\A\d+\.\d*(?:[eE][-+]?\d+)?|\A\d+(?:\.\d*)?[eE][-+]?\d+|\A\.\d+(?:[eE][-+]?\d+)?/m) do |type, value|
+        value.gsub!(/\.(\D)/, '.0\1') if value =~ /\.\w/
+        value.gsub!(/\.$/, '.0') if value =~ /\.$/
+        value.gsub!(/^\./, '0.') if value =~ /^\./
+        [type, eval(value)]
+      end
+      token(:NUMBER, /\A0[xX][\da-fA-F]+|\A0[0-7]*|\A\d+/) do |type, value|
+        [type, eval(value)]
+      end
+
+      token(:LITERALS,
+        Regexp.new(LITERALS.keys.sort_by { |x|
+          x.length
+        }.reverse.map { |x| "\\A#{x.gsub(/([|+*^])/, '\\\\\1')}" }.join('|')
+      )) do |type, value|
+        [LITERALS[value], value]
+      end
+
+      token(:RAW_IDENT, /\A([_\$A-Za-z][_\$0-9A-Za-z]*)/) do |type,value|
+        if KEYWORDS.include?(value)
+          [value.upcase.to_sym, value]
+        elsif RESERVED.include?(value)
+          [:RESERVED, value]
+        else
+          [:IDENT, value]
+        end
+      end
+
+      # To distinguish regular expressions from comments, we require that
+      # regular expressions start with a non * character (ie, not look like
+      # /*foo*/). Note that we can't depend on the length of the match to
+      # correctly distinguish, since `/**/i` is longer if matched as a regular
+      # expression than as matched as a comment.
+      # Incidentally, we're also not matching empty regular expressions
+      # (eg, // and //g). Here we could depend on match length and priority to
+      # determine that these are actually comments, but it turns out to be
+      # easier to not match them in the first place.
+      token(:REGEXP, /\A\/(?:[^\/\r\n\\*]|\\[^\r\n])[^\/\r\n\\]*(?:\\[^\r\n][^\/\r\n\\]*)*\/[gim]*/)
+      token(:S, /\A[\s\r\n]*/m)
+
+      token(:SINGLE_CHAR, /\A./) do |type, value|
+        [value, value]
+      end
+    end
+
+    def tokenize(string)
+      raw_tokens(string).map { |x| x.to_racc_token }
+    end
+
+    def raw_tokens(string)
+      tokens = []
+      line_number = 1
+      accepting_regexp = true
+      while string.length > 0
+        longest_token = nil
+
+        @lexemes.each { |lexeme|
+          next if lexeme.name == :REGEXP && !accepting_regexp
+
+          match = lexeme.match(string)
+          next if match.nil?
+          longest_token = match if longest_token.nil?
+          next if longest_token.value.length >= match.value.length
+          longest_token = match
+        }
+
+        if longest_token.name != :S
+          accepting_regexp = followable_by_regex(longest_token)
+        end
+
+        longest_token.line = line_number
+        line_number += longest_token.value.scan(/\n/).length
+        string = string.slice(Range.new(longest_token.value.length, -1))
+        tokens << longest_token
+      end
+      tokens
+    end
+  
+    private
+    def token(name, pattern = nil, &block)
+      @lexemes << Lexeme.new(name, pattern, &block)
+    end
+
+    def followable_by_regex(current_token)
+      case current_token.name
+      when :RAW_IDENT
+        KEYWORDS_THAT_IMPLY_REGEX.include?(current_token.value)
+      when :NUMBER
+        false
+      when :SINGLE_CHAR
+        !SINGLE_CHARS_THAT_IMPLY_DIVISION.include?(current_token.value)
+      else
+        true
+      end
+    end
+  end
+end

data/lib/rkelly/visitable.rb

@@ -0,0 +1,16 @@
+module RKelly
+  module Visitable
+    # Based off the visitor pattern from RubyGarden
+    def accept(visitor, &block)
+      klass = self.class.ancestors.find { |ancestor|
+        visitor.respond_to?("visit_#{ancestor.name.split(/::/)[-1]}")
+      }
+
+      if klass
+        visitor.send(:"visit_#{klass.name.split(/::/)[-1]}", self, &block)
+      else
+        raise "No visitor for '#{self.class}'"
+      end
+    end
+  end
+end

data/lib/rkelly/visitors.rb

@@ -0,0 +1,4 @@
+require 'rkelly/visitors/visitor'
+Dir[File.join(File.dirname(__FILE__), "visitors/*_visitor.rb")].each do |file|
+  require file[/rkelly\/visitors\/.*/]
+end

data/lib/rkelly/visitors/dot_visitor.rb

@@ -0,0 +1,228 @@
+module RKelly
+  module Visitors
+    class DotVisitor < Visitor
+      class Node < Struct.new(:node_id, :fields)
+        ESCAPE = /([<>"\\])/
+        def to_s
+          counter = 0
+          label = fields.map { |f|
+            s = "<f#{counter}> #{f.to_s.gsub(ESCAPE, '\\\\\1').gsub(/[\r\n]/,' ')}"
+            counter += 1
+            s
+          }.join('|')
+          "\"#{node_id}\" [\nlabel = \"#{label}\"\nshape = \"record\"\n];"
+        end
+      end
+
+      class Arrow < Struct.new(:from, :to, :label)
+        def to_s
+          "\"#{from.node_id}\":f0 -> \"#{to.node_id}\":f0"
+        end
+      end
+
+      attr_reader :nodes, :arrows
+      def initialize
+        @stack = []
+        @node_index = 0
+        @nodes  = []
+        @arrows = []
+      end
+
+      ## Terminal nodes
+      %w{
+        BreakNode ContinueNode EmptyStatementNode FalseNode
+        NullNode NumberNode ParameterNode RegexpNode ResolveNode StringNode
+        ThisNode TrueNode
+      }.each do |type|
+        define_method(:"visit_#{type}") do |o|
+          node = Node.new(@node_index += 1, [type, o.value].compact)
+          add_arrow_for(node)
+          @nodes << node
+        end
+      end
+      ## End Terminal nodes
+
+      # Single value nodes
+      %w{
+        AssignExprNode BitwiseNotNode BlockNode DeleteNode ElementNode
+        ExpressionStatementNode FunctionBodyNode LogicalNotNode ReturnNode
+        ThrowNode TypeOfNode UnaryMinusNode UnaryPlusNode VoidNode
+      }.each do |type|
+        define_method(:"visit_#{type}") do |o|
+          node = Node.new(@node_index += 1, [type])
+          add_arrow_for(node)
+          @nodes << node
+          @stack.push(node)
+          o.value && o.value.accept(self)
+          @stack.pop
+        end
+      end
+      # End Single value nodes
+
+      # Binary nodes
+      %w{
+        AddNode BitAndNode BitOrNode BitXOrNode CaseClauseNode CommaNode
+        DivideNode DoWhileNode EqualNode GreaterNode GreaterOrEqualNode InNode
+        InstanceOfNode LeftShiftNode LessNode LessOrEqualNode LogicalAndNode
+        LogicalOrNode ModulusNode MultiplyNode NotEqualNode NotStrictEqualNode
+        OpAndEqualNode OpDivideEqualNode OpEqualNode OpLShiftEqualNode
+        OpMinusEqualNode OpModEqualNode OpMultiplyEqualNode OpOrEqualNode
+        OpPlusEqualNode OpRShiftEqualNode OpURShiftEqualNode OpXOrEqualNode
+        RightShiftNode StrictEqualNode SubtractNode SwitchNode
+        UnsignedRightShiftNode WhileNode WithNode
+      }.each do |type|
+        define_method(:"visit_#{type}") do |o|
+          node = Node.new(@node_index += 1, [type])
+          add_arrow_for(node)
+          @nodes << node
+          @stack.push(node)
+          o.left && o.left.accept(self)
+          o.value && o.value.accept(self)
+          @stack.pop
+        end
+      end
+      # End Binary nodes
+
+      # Array Value Nodes
+      %w{
+        ArgumentsNode ArrayNode CaseBlockNode ConstStatementNode
+        ObjectLiteralNode SourceElementsNode VarStatementNode
+      }.each do |type|
+        define_method(:"visit_#{type}") do |o|
+          node = Node.new(@node_index += 1, [type])
+          add_arrow_for(node)
+          @nodes << node
+          @stack.push(node)
+          o.value && o.value.each { |v| v && v.accept(self) }
+          @stack.pop
+        end
+      end
+      # END Array Value Nodes
+
+      # Name and Value Nodes
+      %w{
+        LabelNode PropertyNode GetterPropertyNode SetterPropertyNode VarDeclNode
+      }.each do |type|
+        define_method(:"visit_#{type}") do |o|
+          node = Node.new(@node_index += 1, [type, o.name || 'NULL'])
+          add_arrow_for(node)
+          @nodes << node
+          @stack.push(node)
+          o.value && o.value.accept(self)
+          @stack.pop
+        end
+      end
+      # END Name and Value Nodes
+
+      %w{ PostfixNode PrefixNode }.each do |type|
+        define_method(:"visit_#{type}") do |o|
+          node = Node.new(@node_index += 1, [type, o.value])
+          add_arrow_for(node)
+          @nodes << node
+          @stack.push(node)
+          o.operand && o.operand.accept(self)
+          @stack.pop
+        end
+      end
+
+      def visit_ForNode(o)
+        node = Node.new(@node_index += 1, ['ForNode'])
+        add_arrow_for(node)
+        @nodes << node
+        @stack.push(node)
+        [:init, :test, :counter, :value].each do |method|
+          o.send(method) && o.send(method).accept(self)
+        end
+        @stack.pop
+      end
+
+      %w{ IfNode ConditionalNode }.each do |type|
+        define_method(:"visit_#{type}") do |o|
+          node = Node.new(@node_index += 1, [type])
+          add_arrow_for(node)
+          @nodes << node
+          @stack.push(node)
+          [:conditions, :value, :else].each do |method|
+            o.send(method) && o.send(method).accept(self)
+          end
+          @stack.pop
+        end
+      end
+
+      def visit_ForInNode(o)
+        node = Node.new(@node_index += 1, ['ForInNode'])
+        add_arrow_for(node)
+        @nodes << node
+        @stack.push(node)
+        [:left, :right, :value].each do |method|
+          o.send(method) && o.send(method).accept(self)
+        end
+        @stack.pop
+      end
+
+      def visit_TryNode(o)
+        node = Node.new(@node_index += 1, ['TryNode', o.catch_var || 'NULL'])
+        add_arrow_for(node)
+        @nodes << node
+        @stack.push(node)
+        [:value, :catch_block, :finally_block].each do |method|
+          o.send(method) && o.send(method).accept(self)
+        end
+        @stack.pop
+      end
+
+      def visit_BracketAccessorNode(o)
+        node = Node.new(@node_index += 1, ['BracketAccessorNode'])
+        add_arrow_for(node)
+        @nodes << node
+        @stack.push(node)
+        [:value, :accessor].each do |method|
+          o.send(method) && o.send(method).accept(self)
+        end
+        @stack.pop
+      end
+
+      %w{ NewExprNode FunctionCallNode }.each do |type|
+        define_method(:"visit_#{type}") do |o|
+          node = Node.new(@node_index += 1, [type])
+          add_arrow_for(node)
+          @nodes << node
+          @stack.push(node)
+          [:value, :arguments].each do |method|
+            o.send(method) && o.send(method).accept(self)
+          end
+          @stack.pop
+        end
+      end
+
+      %w{ FunctionExprNode FunctionDeclNode }.each do |type|
+        define_method(:"visit_#{type}") do |o|
+          node = Node.new(@node_index += 1, [type, o.value || 'NULL'])
+          add_arrow_for(node)
+          @nodes << node
+          @stack.push(node)
+          o.arguments.each { |a| a && a.accept(self) }
+          o.function_body && o.function_body.accept(self)
+          @stack.pop
+        end
+      end
+
+      def visit_DotAccessorNode(o)
+        node = Node.new(@node_index += 1, ['DotAccessorNode', o.accessor])
+        add_arrow_for(node)
+        @nodes << node
+        @stack.push(node)
+        [:value].each do |method|
+          o.send(method) && o.send(method).accept(self)
+        end
+        @stack.pop
+      end
+
+      private
+      def add_arrow_for(node, label = nil)
+        @arrows << Arrow.new(@stack.last, node, label) if @stack.length > 0
+      end
+
+    end
+  end
+end