def logop(type, left, right)
left = value_expr left
if left and left[0] == type and not left.paren then
node, second = left, nil
while (second = node[2]) && second[0] == type and not second.paren do
node = second
end
node[2] = s(type, second, right)
return left
end
return s(type, left, right)
end
def new_aref val
val[2] ||= s(:arglist)
val[2][0] = :arglist if val[2][0] == :array
if val[0].node_type == :self then
result = new_call nil, "[]""[]", val[2]
else
result = new_call val[0], "[]""[]", val[2]
end
result
end
def new_body val
result = val[0]
if val[1] then
result = s(:rescue)
result << val[0] if val[0]
resbody = val[1]
while resbody do
result << resbody
resbody = resbody.resbody(true)
end
result << val[2] if val[2]
result.line = (val[0] || val[1]).line
elsif not val[2].nil? then
warning("else without rescue is useless")
result = block_append(result, val[2])
end
result = s(:ensure, result, val[3]).compact if val[3]
return result
end
def argl x
x = s(:arglist, x) if x and x[0] != :arglist
x
end
def backref_assign_error ref
case ref.first
when :nth_ref then
raise "write a test 2"
raise SyntaxError, "Can't set variable %p" % ref.last
when :back_ref then
raise "write a test 3"
raise SyntaxError, "Can't set back reference %p" % ref.last
else
raise "Unknown backref type: #{ref.inspect}"
end
end
def new_call recv, meth, args = nil
result = s(:call, recv, meth)
result.line = recv.line if recv
args ||= s(:arglist)
args[0] = :arglist if args.first == :array
args = s(:arglist, args) unless args.first == :arglist
result.concat args[1..-1]
result
end
def new_case expr, body
result = s(:case, expr)
line = (expr || body).line
while body and body.node_type == :when
result << body
body = body.delete_at 3
end
result[2..-1].each do |node|
block = node.block(:delete)
node.concat block[1..-1] if block
end
body = nil if body == s(:block)
result << body
result.line = line
result
end
def new_class val
line, path, superclass, body = val[1], val[2], val[3], val[5]
result = s(:class, path, superclass)
if body then
if body.first == :block then
result.push(*body[1..-1])
else
result.push body
end
end
result.line = line
result.comments = self.comments.pop
result
end
def new_compstmt val
result = void_stmts(val.grep(Sexp)[0])
result = remove_begin(result) if result
result
end
def new_defn val
(_, line), name, args, body = val[0], val[1], val[3], val[4]
body ||= s(:nil)
result = s(:defn, name.to_sym, args)
if body then
if body.first == :block then
result.push(*body[1..-1])
else
result.push body
end
end
result.line = line
result.comments = self.comments.pop
result
end
def new_defs val
recv, name, args, body = val[1], val[4], val[6], val[7]
result = s(:defs, recv, name.to_sym, args)
if body then
if body.first == :block then
result.push(*body[1..-1])
else
result.push body
end
end
result.line = recv.line
result.comments = self.comments.pop
result
end
def new_for expr, var, body
result = s(:for, expr, var).line(var.line)
result << body if body
result
end
def new_if c, t, f
l = [c.line, t && t.line, f && f.line].compact.min
c = cond c
c, t, f = c.last, f, t if c[0] == :not and canonicalize_conditions
s(:if, c, t, f).line(l)
end
def new_iter call, args, body
body ||= nil
args ||= s(:args)
args = s(:args, args) if Symbol === args
result = s(:iter)
result << call if call
result << args
result << body if body
args[0] = :args unless args == 0
result
end
def new_masgn lhs, rhs, wrap = false
rhs = value_expr(rhs)
rhs = lhs[1] ? s(:to_ary, rhs) : s(:array, rhs) if wrap
lhs.delete_at 1 if lhs[1].nil?
lhs << rhs
lhs
end
def new_module val
line, path, body = val[1], val[2], val[4]
result = s(:module, path)
if body then
if body.first == :block then
result.push(*body[1..-1])
else
result.push body
end
end
result.line = line
result.comments = self.comments.pop
result
end
def new_op_asgn val
lhs, asgn_op, arg = val[0], val[1].to_sym, val[2]
name = lhs.value
arg = remove_begin(arg)
result = case asgn_op
when "||""||" then
lhs << arg
s(:op_asgn_or, self.gettable(name), lhs)
when "&&""&&" then
lhs << arg
s(:op_asgn_and, self.gettable(name), lhs)
else
lhs[2] = new_call(self.gettable(name), asgn_op, argl(arg))
lhs
end
result.line = lhs.line
result
end
def new_regexp val
node = val[1] || s(:str, '')
options = val[2]
o, k = 0, nil
options.split(//).uniq.each do |c|
v = {
'x' => Regexp::EXTENDED,
'i' => Regexp::IGNORECASE,
'm' => Regexp::MULTILINE,
'o' => Regexp::ONCE,
'n' => Regexp::ENC_NONE,
'e' => Regexp::ENC_EUC,
's' => Regexp::ENC_SJIS,
'u' => Regexp::ENC_UTF8,
}[c]
raise "unknown regexp option: #{c}" unless v
o += v
k = c if c =~ /[esu]/
end
case node[0]
when :str then
node[0] = :lit
node[1] = if k then
Regexp.new(node[1], o, k)
else
begin
Regexp.new(node[1], o)
rescue RegexpError => e
warn "Ignoring: #{e.message}"
Regexp.new(node[1], Regexp::ENC_NONE)
end
end
when :dstr then
if options =~ /o/ then
node[0] = :dregx_once
else
node[0] = :dregx
end
node << o if o and o != 0
else
node = s(:dregx, '', node);
node[0] = :dregx_once if options =~ /o/
node << o if o and o != 0
end
node
end
def new_resbody cond, body
if body && body.first == :block then
body.shift
else
body = [body]
end
s(:resbody, cond, *body)
end
def new_sclass val
recv, in_def, in_single, body = val[3], val[4], val[6], val[7]
result = s(:sclass, recv)
if body then
if body.first == :block then
result.push(*body[1..-1])
else
result.push body
end
end
result.line = val[2]
self.in_def = in_def
self.in_single = in_single
result
end
def new_super args
if args && args.node_type == :block_pass then
s(:super, args)
else
args ||= s(:arglist)
s(:super, *args[1..-1])
end
end
def new_undef n, m = nil
if m then
block_append(n, s(:undef, m))
else
s(:undef, n)
end
end
def new_until block, expr, pre
new_until_or_while :until, block, expr, pre
end
def new_until_or_while type, block, expr, pre
other = type == :until ? :while : :until
line = [block && block.line, expr.line].compact.min
block, pre = block.last, false if block && block[0] == :begin
expr = cond expr
result = unless expr.first == :not and canonicalize_conditions then
s(type, expr, block, pre)
else
s(other, expr.last, block, pre)
end
result.line = line
result
end
def new_when cond, body
s(:when, cond, body)
end
def new_while block, expr, pre
new_until_or_while :while, block, expr, pre
end
def new_xstring str
if str then
case str[0]
when :str
str[0] = :xstr
when :dstr
str[0] = :dxstr
else
str = s(:dxstr, '', str)
end
str
else
s(:xstr, '')
end
end
def new_yield args = nil
raise "write a test 4" if args && args.node_type == :block_pass
raise SyntaxError, "Block argument should not be given." if
args && args.node_type == :block_pass
args ||= s(:arglist)
args[0] = :arglist if args.first == :array
args = s(:arglist, args) unless args.first == :arglist
return s(:yield, *args[1..-1])
end
def next_token
if self.lexer.advance then
return self.lexer.token, self.lexer.yacc_value
else
return [false, '$end']
end
end
def node_assign(lhs, rhs)
return nil unless lhs
rhs = value_expr rhs
case lhs[0]
when :gasgn, :iasgn, :lasgn, :masgn, :cdecl, :cvdecl, :cvasgn then
lhs << rhs
when :attrasgn, :call then
args = lhs.pop unless Symbol === lhs.last
lhs.concat arg_add(args, rhs)[1..-1]
when :const then
lhs[0] = :cdecl
lhs << rhs
else
raise "unknown lhs #{lhs.inspect}"
end
lhs
end
def handle_encoding str
str = str.dup
ruby19 = str.respond_to? :encoding
encoding = nil
header = str.lines.first(2)
header.map! { |s| s.force_encoding "ASCII-8BIT" } if ruby19
first = header.first || ""
encoding, str = "utf-8", str[3..-1] if first =~ /\A\xEF\xBB\xBF/
encoding = $1.strip if header.find { |s|
s[/^#.*?-\*-.*?coding:\s*([^ ;]+).*?-\*-/, 1] ||
s[/^#.*(?:en)?coding(?:\s*[:=])\s*([\w-]+)/, 1]
}
if encoding then
if ruby19 then
encoding.sub!(/utf-8-.+$/, 'utf-8')
hack_encoding str, encoding
else
warn "Skipping magic encoding comment"
end
else
hack_encoding str if ruby19
end
str
end
def hack_encoding str, extra = nil
encodings = [
extra,
Encoding::ISO_8859_1,
Encoding::UTF_8,
Encoding::ISO_8859_2,
Encoding::ISO_8859_9,
Encoding::SHIFT_JIS,
Encoding::WINDOWS_1252,
Encoding::EUC_JP,
].compact
encodings.each do |enc|
begin
str.force_encoding enc
if str.valid_encoding? then
str.encode! Encoding::UTF_8
break
end
rescue Encoding::InvalidByteSequenceError
rescue Encoding::UndefinedConversionError
end
end
raise "Bad encoding. Need a magic encoding comment." unless
str.encoding.name == "UTF-8"
end
def process(str, file = "(string)", time = 10)
Timeout.timeout time do
raise "bad val: #{str.inspect}" unless String === str
str = handle_encoding str
self.file = file.dup
self.lexer.src = str
@yydebug = ENV.has_key? 'DEBUG'
do_parse
end
end
alias :parse :process
def remove_begin node
oldnode = node
if node and :begin == node[0] and node.size == 2 then
node = node[-1]
node.line = oldnode.line
end
node
end
def reset
lexer.reset
self.in_def = false
self.in_single = 0
self.env.reset
self.comments.clear
end
def block_dup_check call_or_args, block
syntax_error "Both block arg and actual block given." if
block and call_or_args.block_pass?
end
def ret_args node
if node then
raise "write a test 5" if node[0] == :block_pass
raise SyntaxError, "block argument should not be given" if
node[0] == :block_pass
node = node.last if node[0] == :array && node.size == 2
node = s(:svalue, node) if node[0] == :splat and not node.paren
node[0] = :svalue if node[0] == :arglist && node[1][0] == :splat
end
node
end
def s(*args)
result = Sexp.new(*args)
result.line ||= lexer.lineno if lexer.src
result.file = self.file
result
end
def value_expr oldnode
node = remove_begin oldnode
node.line = oldnode.line if oldnode
node[2] = value_expr(node[2]) if node and node[0] == :if
node
end
def void_stmts node
return nil unless node
return node unless node[0] == :block
node[1..-1] = node[1..-1].map { |n| remove_begin(n) }
node
end
def warning s
end
def yyerror msg
warn msg
super()
end
def on_error(et, ev, values)
super
rescue Racc::ParseError => e
msg = "# ERROR: %s:%p :: %s" % [self.file, lexer.lineno, e.message.strip]
warn msg
raise
end
class Keyword
class KWtable
attr_accessor :name, :state, :id0, :id1
def initialize(name, id=[], state=nil)
@name = name
@id0, @id1 = id
@state = state
end
end
wordlist = [
["end", [:kEND, :kEND ], :expr_end ],
["else", [:kELSE, :kELSE ], :expr_beg ],
["case", [:kCASE, :kCASE ], :expr_beg ],
["ensure", [:kENSURE, :kENSURE ], :expr_beg ],
["module", [:kMODULE, :kMODULE ], :expr_beg ],
["elsif", [:kELSIF, :kELSIF ], :expr_beg ],
["def", [:kDEF, :kDEF ], :expr_fname ],
["rescue", [:kRESCUE, :kRESCUE_MOD ], :expr_mid ],
["not", [:kNOT, :kNOT ], :expr_beg ],
["then", [:kTHEN, :kTHEN ], :expr_beg ],
["yield", [:kYIELD, :kYIELD ], :expr_arg ],
["for", [:kFOR, :kFOR ], :expr_beg ],
["self", [:kSELF, :kSELF ], :expr_end ],
["false", [:kFALSE, :kFALSE ], :expr_end ],
["retry", [:kRETRY, :kRETRY ], :expr_end ],
["return", [:kRETURN, :kRETURN ], :expr_mid ],
["true", [:kTRUE, :kTRUE ], :expr_end ],
["if", [:kIF, :kIF_MOD ], :expr_beg ],
["defined?", [:kDEFINED, :kDEFINED ], :expr_arg ],
["super", [:kSUPER, :kSUPER ], :expr_arg ],
["undef", [:kUNDEF, :kUNDEF ], :expr_fname ],
["break", [:kBREAK, :kBREAK ], :expr_mid ],
["in", [:kIN, :kIN ], :expr_beg ],
["do", [:kDO, :kDO ], :expr_beg ],
["nil", [:kNIL, :kNIL ], :expr_end ],
["until", [:kUNTIL, :kUNTIL_MOD ], :expr_beg ],
["unless", [:kUNLESS, :kUNLESS_MOD ], :expr_beg ],
["or", [:kOR, :kOR ], :expr_beg ],
["next", [:kNEXT, :kNEXT ], :expr_mid ],
["when", [:kWHEN, :kWHEN ], :expr_beg ],
["redo", [:kREDO, :kREDO ], :expr_end ],
["and", [:kAND, :kAND ], :expr_beg ],
["begin", [:kBEGIN, :kBEGIN ], :expr_beg ],
["__LINE__", [:k__LINE__, :k__LINE__ ], :expr_end ],
["class", [:kCLASS, :kCLASS ], :expr_class ],
["__FILE__", [:k__FILE__, :k__FILE__ ], :expr_end ],
["END", [:klEND, :klEND ], :expr_end ],
["BEGIN", [:klBEGIN, :klBEGIN ], :expr_end ],
["while", [:kWHILE, :kWHILE_MOD ], :expr_beg ],
["alias", [:kALIAS, :kALIAS ], :expr_fname ],
["__ENCODING__", [:k__ENCODING__, :k__ENCODING__], :expr_end],
].map { |args| KWtable.new(*args) }
WORDLIST18 = Hash[*wordlist.map { |o| [o.name, o] }.flatten]
WORDLIST19 = Hash[*wordlist.map { |o| [o.name, o] }.flatten]
%w[and case elsif for if in module or unless until when while].each do |k|
WORDLIST19[k] = WORDLIST19[k].dup
WORDLIST19[k].state = :expr_value
end
%w[not].each do |k|
WORDLIST19[k] = WORDLIST19[k].dup
WORDLIST19[k].state = :expr_arg
end
def self.keyword18 str
WORDLIST18[str]
end
def self.keyword19 str
WORDLIST19[str]
end
end
class Environment
attr_reader :env, :dyn
def [] k
self.all[k]
end
def []= k, v
raise "no" if v == true
self.current[k] = v
end
def all
idx = @dyn.index(false) || 0
@env[0..idx].reverse.inject { |env, scope| env.merge scope }
end
def current
@env.first
end
def dynamic
idx = @dyn.index false
@env[0...idx].reverse.inject { |env, scope| env.merge scope } || {}
end
def dynamic?
@dyn[0] != false
end
def extend dyn = false
@dyn.unshift dyn
@env.unshift({})
@use.unshift({})
end
def initialize dyn = false
@dyn = []
@env = []
@use = []
self.reset
end
def reset
@dyn.clear
@env.clear
@use.clear
self.extend
end
def unextend
@dyn.shift
@env.shift
@use.shift
raise "You went too far unextending env" if @env.empty?
end
def use id
@env.each_with_index do |env, i|
if env[id] then
@use[i][id] = true
end
end
end
def used? id
idx = @dyn.index false
u = @use[0...idx].reverse.inject { |env, scope| env.merge scope } || {}
u[id]
end
end
class StackState
attr_reader :name
attr_reader :stack
attr_accessor :debug
def initialize(name)
@name = name
@stack = [false]
@debug = false
end
def inspect
"StackState(#{@name}, #{@stack.inspect})"
end
def is_in_state
p :stack_is_in_state => [name, @stack.last, caller.first] if debug
@stack.last
end
def lexpop
p :stack_lexpop => caller.first if debug
raise if @stack.size == 0
a = @stack.pop
b = @stack.pop
@stack.push(a || b)
end
def pop
r = @stack.pop
p :stack_pop => [name, r, @stack, caller.first] if debug
@stack.push false if @stack.size == 0
r
end
def push val
@stack.push val
p :stack_push => [name, @stack, caller.first] if debug
nil
end
end
end