Files
coffeescript/lib/coffee_script/nodes.rb

485 lines
15 KiB
Ruby

module CoffeeScript
# The abstract base class for all CoffeeScript nodes.
class Node
# Tabs are two spaces for pretty-printing.
TAB = ' '
# Tag this node as a statement, meaning that it can't be used directly as
# the result of an expression.
def self.statement
class_eval "def statement?; true; end"
end
# Tag this node as having a custom return, meaning that instead of returning
# it from the outside, you ask it to return itself, and it obliges.
def self.custom_return
class_eval "def custom_return?; true; end"
end
# Tag this node as having a custom assignment, meaning that instead of
# assigning it to a variable name from the outside, you pass it the variable
# name and let it take care of it.
def self.custom_assign
class_eval "def custom_assign?; true; end"
end
# Default implementations of the common node methods.
def unwrap; self; end
def line_ending; ';'; end
def statement?; false; end
def custom_return?; false; end
def custom_assign?; false; end
def compile(indent='', scope=nil, opts={}); end
end
# A collection of nodes, each one representing an expression.
class Expressions < Node
statement
attr_reader :expressions
# Wrap up a node as an Expressions, unless it already is.
def self.wrap(node)
node.is_a?(Expressions) ? node : Expressions.new([node])
end
def initialize(nodes)
@expressions = nodes
end
# Tack an expression onto the end of this node.
def <<(node)
@expressions << node
self
end
# If this Expressions consists of a single node, pull it back out.
def unwrap
@expressions.length == 1 ? @expressions.first : self
end
# If this is the top-level Expressions, wrap everything in a safety closure.
def root_compile
"(function(){\n#{compile(TAB, Scope.new)}\n})();"
end
# The extra fancy is to handle pushing down returns recursively to the
# final lines of inner statements (so as to make expressions out of them).
def compile(indent='', scope=nil, opts={})
return root_compile unless scope
@expressions.map { |n|
if opts[:return] && n == @expressions.last
if n.statement? || n.custom_return?
"#{indent}#{n.compile(indent, scope, opts)}#{n.line_ending}"
else
"#{indent}return #{n.compile(indent, scope, opts)}#{n.line_ending}"
end
else
"#{indent}#{n.compile(indent, scope)}#{n.line_ending}"
end
}.join("\n")
end
end
# Literals are static values that have a Ruby representation, eg.: a string, a number,
# true, false, nil, etc.
class LiteralNode < Node
STATEMENTS = ['break', 'continue']
def initialize(value)
@value = value
end
def statement?
STATEMENTS.include?(@value.to_s)
end
def compile(indent, scope, opts={})
@value.to_s
end
end
# Try to return your expression, or tell it to return itself.
class ReturnNode < Node
statement
custom_return
def initialize(expression)
@expression = expression
end
def compile(indent, scope, opts={})
return @expression.compile(indent, scope, opts.merge(:return => true)) if @expression.custom_return?
compiled = @expression.compile(indent, scope)
@expression.statement? ? "#{compiled}\n#{indent}return null" : "return #{compiled}"
end
end
# Node for a function invocation. Takes care of converting super() calls into
# calls against the prototype's function of the same name.
class CallNode < Node
LEADING_DOT = /\A\./
def initialize(variable, arguments=[])
@variable, @arguments = variable, arguments
end
def new_instance
@new = true
self
end
def super?
@variable == :super
end
def compile(indent, scope, opts={})
args = @arguments.map{|a| a.compile(indent, scope, :no_paren => true) }.join(', ')
return compile_super(args, indent, scope, opts) if super?
prefix = @new ? "new " : ''
"#{prefix}#{@variable.compile(indent, scope)}(#{args})"
end
def compile_super(args, indent, scope, opts)
methname = opts[:last_assign].sub(LEADING_DOT, '')
"this.constructor.prototype.#{methname}.call(this, #{args})"
end
end
# A value, indexed or dotted into or vanilla.
class ValueNode < Node
attr_reader :last
def initialize(name, properties=[])
@name, @properties = name, properties
end
def <<(other)
@properties << other
self
end
def properties?
return !@properties.empty?
end
def compile(indent, scope, opts={})
parts = [@name, @properties].flatten.map do |v|
v.respond_to?(:compile) ? v.compile(indent, scope) : v.to_s
end
@last = parts.last
parts.join('')
end
end
# A dotted accessor into a part of a value.
class AccessorNode
def initialize(name)
@name = name
end
def compile(indent, scope, opts={})
".#{@name}"
end
end
# An indexed accessor into a part of an array or object.
class IndexNode
def initialize(index)
@index = index
end
def compile(indent, scope, opts={})
"[#{@index.compile(indent, scope)}]"
end
end
# An array slice literal. Unlike JavaScript's Array#slice, the second parameter
# specifies the index of the end of the slice (just like the first parameter)
# is the index of the beginning.
class SliceNode
def initialize(from, to)
@from, @to = from, to
end
def compile(indent, scope, opts={})
".slice(#{@from.compile(indent, scope, opts)}, #{@to.compile(indent, scope, opts)} + 1)"
end
end
# Setting the value of a local variable, or the value of an object property.
class AssignNode < Node
statement
custom_return
def initialize(variable, value, context=nil)
@variable, @value, @context = variable, value, context
end
def compile(indent, scope, opts={})
name = @variable.compile(indent, scope) if @variable.respond_to?(:compile)
last = @variable.respond_to?(:last) ? @variable.last : name
opts = opts.merge({:assign => name, :last_assign => last})
value = @value.compile(indent + TAB, scope, opts)
return "#{@variable}: #{value}" if @context == :object
return "#{name} = #{value}" if @variable.properties?
defined = scope.find(name)
postfix = !defined && opts[:return] ? ";\n#{indent}return #{name}" : ''
def_part = defined ? "" : "var #{name};\n#{indent}"
return def_part + @value.compile(indent, scope, opts) if @value.custom_assign?
def_part = defined ? name : "var #{name}"
"#{def_part} = #{@value.compile(indent, scope, opts)}#{postfix}"
end
end
# Simple Arithmetic and logical operations. Performs some conversion from
# CoffeeScript operations into their JavaScript equivalents.
class OpNode < Node
CONVERSIONS = {
"==" => "===",
"!=" => "!==",
'and' => '&&',
'or' => '||',
'is' => '===',
"aint" => "!==",
'not' => '!',
}
CONDITIONALS = ['||=', '&&=']
def initialize(operator, first, second=nil)
@first, @second = first, second
@operator = CONVERSIONS[operator] || operator
end
def unary?
@second.nil?
end
def compile(indent, scope, opts={})
return compile_conditional(indent, scope) if CONDITIONALS.include?(@operator)
return compile_unary(indent, scope) if unary?
"#{@first.compile(indent, scope)} #{@operator} #{@second.compile(indent, scope)}"
end
def compile_conditional(indent, scope)
first, second = @first.compile(indent, scope), @second.compile(indent, scope)
sym = @operator[0..1]
"#{first} = #{first} #{sym} #{second}"
end
def compile_unary(indent, scope)
space = @operator == 'delete' ? ' ' : ''
"#{@operator}#{space}#{@first.compile(indent, scope)}"
end
end
# A function definition. The only node that creates a new Scope.
class CodeNode < Node
def initialize(params, body)
@params = params
@body = body
end
def compile(indent, scope, opts={})
scope = Scope.new(scope)
@params.each {|id| scope.find(id) }
opts = opts.merge(:return => true)
code = @body.compile(indent + TAB, scope, opts)
"function(#{@params.join(', ')}) {\n#{code}\n#{indent}}"
end
end
# An object literal.
class ObjectNode < Node
def initialize(properties = [])
@properties = properties
end
def compile(indent, scope, opts={})
props = @properties.map {|p| indent + TAB + p.compile(indent, scope) }.join(",\n")
"{\n#{props}\n#{indent}}"
end
end
# An array literal.
class ArrayNode < Node
def initialize(objects=[])
@objects = objects
end
def compile(indent, scope, opts={})
objects = @objects.map {|o| o.compile(indent, scope) }.join(', ')
"[#{objects}]"
end
end
# A while loop, the only sort of low-level loop exposed by CoffeeScript. From
# it, all other loops can be manufactured.
class WhileNode < Node
statement
def initialize(condition, body)
@condition, @body = condition, body
end
def line_ending
''
end
def compile(indent, scope, opts={})
"while (#{@condition.compile(indent, scope, :no_paren => true)}) {\n#{@body.compile(indent + TAB, scope)}\n#{indent}}"
end
end
# The replacement for the for loop is an array comprehension (that compiles)
# into a for loop. Also acts as an expression, able to return the result
# of the comprehenion. Unlike Python array comprehensions, it's able to pass
# the current index of the loop as a second parameter.
class ForNode < Node
statement
custom_return
custom_assign
def initialize(body, source, name, index=nil)
@body, @source, @name, @index = body, source, name, index
end
def line_ending
''
end
def compile(indent, scope, opts={})
svar = scope.free_variable
ivar = scope.free_variable
lvar = scope.free_variable
name_part = scope.find(@name) ? @name : "var #{@name}"
index_name = @index ? (scope.find(@index) ? @index : "var #{@index}") : nil
source_part = "var #{svar} = #{@source.compile(indent, scope)};"
for_part = "var #{ivar}=0, #{lvar}=#{svar}.length; #{ivar}<#{lvar}; #{ivar}++"
var_part = "\n#{indent + TAB}#{name_part} = #{svar}[#{ivar}];\n"
index_part = @index ? "#{indent + TAB}#{index_name} = #{ivar};\n" : ''
set_result = ''
save_result = ''
return_result = ''
if opts[:return] || opts[:assign]
rvar = scope.free_variable
set_result = "var #{rvar} = [];\n#{indent}"
save_result = "#{rvar}[#{ivar}] = "
return_result = rvar
return_result = "#{opts[:assign]} = #{return_result}" if opts[:assign]
return_result = "return #{return_result}" if opts[:return]
return_result = "\n#{indent}#{return_result}"
end
body = @body.compile(indent + TAB, scope)
"#{source_part}\n#{indent}#{set_result}for (#{for_part}) {#{var_part}#{index_part}#{indent + TAB}#{save_result}#{body};\n#{indent}}#{return_result}"
end
end
# A try/catch/finally block.
class TryNode < Node
statement
def initialize(try, error, recovery, finally=nil)
@try, @error, @recovery, @finally = try, error, recovery, finally
end
def line_ending
''
end
def compile(indent, scope, opts={})
catch_part = @recovery && " catch (#{@error}) {\n#{@recovery.compile(indent + TAB, scope, opts)}\n#{indent}}"
finally_part = @finally && " finally {\n#{@finally.compile(indent + TAB, scope, opts)}\n#{indent}}"
"try {\n#{@try.compile(indent + TAB, scope, opts)}\n#{indent}}#{catch_part}#{finally_part}"
end
end
# Throw an exception.
class ThrowNode < Node
statement
def initialize(expression)
@expression = expression
end
def compile(indent, scope, opts={})
"throw #{@expression.compile(indent, scope)}"
end
end
# An extra set of parenthesis, supplied by the script source.
class ParentheticalNode < Node
def initialize(expressions)
@expressions = expressions
end
def compile(indent, scope, opts={})
compiled = @expressions.unwrap.compile(indent, scope)
compiled = compiled[0...-1] if compiled[-1..-1] == ';'
opts[:no_paren] ? compiled : "(#{compiled})"
end
end
# If/else statements. Switch/cases get compiled into these. Acts as an
# expression by pushing down requested returns to the expression bodies.
# Single-expression IfNodes are compiled into ternary operators if possible,
# because ternaries are first-class returnable assignable expressions.
class IfNode < Node
def initialize(condition, body, else_body=nil, tag=nil)
@condition = condition
@body = body && body.unwrap
@else_body = else_body && else_body.unwrap
@condition = OpNode.new("!", @condition) if tag == :invert
end
def <<(else_body)
eb = else_body.unwrap
@else_body ? @else_body << eb : @else_body = eb
self
end
# Rewrite a chain of IfNodes with their switch condition for equality.
def rewrite_condition(expression)
@condition = OpNode.new("is", expression, @condition)
@else_body.rewrite_condition(expression) if chain?
self
end
# Rewrite a chain of IfNodes to add a default case as the final else.
def add_else(expressions)
chain? ? @else_body.add_else(expressions) : @else_body = expressions
self
end
def chain?
@chain ||= @else_body && @else_body.is_a?(IfNode)
end
def statement?
@is_statement ||= (@body.statement? || (@else_body && @else_body.statement?))
end
def line_ending
statement? ? '' : ';'
end
def compile(indent, scope, opts={})
statement? ? compile_statement(indent, scope, opts) : compile_ternary(indent, scope)
end
def compile_statement(indent, scope, opts)
if_part = "if (#{@condition.compile(indent, scope, :no_paren => true)}) {\n#{Expressions.wrap(@body).compile(indent + TAB, scope, opts)}\n#{indent}}"
else_part = @else_body ? " else {\n#{Expressions.wrap(@else_body).compile(indent + TAB, scope, opts)}\n#{indent}}" : ''
if_part + else_part
end
def compile_ternary(indent, scope)
if_part = "#{@condition.compile(indent, scope)} ? #{@body.compile(indent, scope)}"
else_part = @else_body ? "#{@else_body.compile(indent, scope)}" : 'null'
"#{if_part} : #{else_part}"
end
end
end