rbelly 0.1.0
Sign up to get free protection for your applications and to get access to all the features.
- data/CHANGELOG.rdoc +7 -0
- data/Manifest.txt +199 -0
- data/README.rdoc +36 -0
- data/Rakefile +38 -0
- data/lib/parser.y +871 -0
- data/lib/rbelly/constants.rb +3 -0
- data/lib/rbelly/generated_parser.rb +3274 -0
- data/lib/rbelly/js/array.rb +15 -0
- data/lib/rbelly/js/base.rb +91 -0
- data/lib/rbelly/js/boolean.rb +21 -0
- data/lib/rbelly/js/function.rb +39 -0
- data/lib/rbelly/js/function_prototype.rb +15 -0
- data/lib/rbelly/js/global_object.rb +52 -0
- data/lib/rbelly/js/math.rb +10 -0
- data/lib/rbelly/js/nan.rb +18 -0
- data/lib/rbelly/js/number.rb +22 -0
- data/lib/rbelly/js/object.rb +30 -0
- data/lib/rbelly/js/object_prototype.rb +14 -0
- data/lib/rbelly/js/property.rb +20 -0
- data/lib/rbelly/js/scope.rb +6 -0
- data/lib/rbelly/js/string.rb +21 -0
- data/lib/rbelly/js.rb +14 -0
- data/lib/rbelly/lexeme.rb +18 -0
- data/lib/rbelly/nodes/binary_node.rb +18 -0
- data/lib/rbelly/nodes/bracket_accessor_node.rb +11 -0
- data/lib/rbelly/nodes/case_clause_node.rb +11 -0
- data/lib/rbelly/nodes/comma_node.rb +11 -0
- data/lib/rbelly/nodes/conditional_node.rb +11 -0
- data/lib/rbelly/nodes/dot_accessor_node.rb +11 -0
- data/lib/rbelly/nodes/for_in_node.rb +12 -0
- data/lib/rbelly/nodes/for_node.rb +13 -0
- data/lib/rbelly/nodes/function_call_node.rb +16 -0
- data/lib/rbelly/nodes/function_decl_node.rb +6 -0
- data/lib/rbelly/nodes/function_expr_node.rb +12 -0
- data/lib/rbelly/nodes/if_node.rb +12 -0
- data/lib/rbelly/nodes/label_node.rb +11 -0
- data/lib/rbelly/nodes/new_expr_node.rb +11 -0
- data/lib/rbelly/nodes/node.rb +88 -0
- data/lib/rbelly/nodes/not_strict_equal_node.rb +6 -0
- data/lib/rbelly/nodes/op_equal_node.rb +16 -0
- data/lib/rbelly/nodes/postfix_node.rb +11 -0
- data/lib/rbelly/nodes/prefix_node.rb +6 -0
- data/lib/rbelly/nodes/property_node.rb +13 -0
- data/lib/rbelly/nodes/resolve_node.rb +19 -0
- data/lib/rbelly/nodes/strict_equal_node.rb +6 -0
- data/lib/rbelly/nodes/try_node.rb +13 -0
- data/lib/rbelly/nodes/var_decl_node.rb +15 -0
- data/lib/rbelly/nodes.rb +25 -0
- data/lib/rbelly/parser.rb +104 -0
- data/lib/rbelly/runtime/ruby_function.rb +13 -0
- data/lib/rbelly/runtime/scope_chain.rb +57 -0
- data/lib/rbelly/runtime.rb +36 -0
- data/lib/rbelly/syntax_error.rb +4 -0
- data/lib/rbelly/token.rb +19 -0
- data/lib/rbelly/tokenizer.rb +161 -0
- data/lib/rbelly/visitable.rb +16 -0
- data/lib/rbelly/visitors/dot_visitor.rb +228 -0
- data/lib/rbelly/visitors/ecma_visitor.rb +322 -0
- data/lib/rbelly/visitors/enumerable_visitor.rb +18 -0
- data/lib/rbelly/visitors/evaluation_visitor.rb +419 -0
- data/lib/rbelly/visitors/function_visitor.rb +46 -0
- data/lib/rbelly/visitors/pointcut_visitor.rb +31 -0
- data/lib/rbelly/visitors/real_sexp_visitor.rb +16 -0
- data/lib/rbelly/visitors/sexp_visitor.rb +373 -0
- data/lib/rbelly/visitors/visitor.rb +136 -0
- data/lib/rbelly/visitors.rb +4 -0
- data/lib/rbelly.rb +14 -0
- data/test/ecma_script_test_case.rb +21 -0
- data/test/execute_test_case.rb +16 -0
- data/test/execution_contexts/test_10_1_3-1.rb +32 -0
- data/test/expressions/test_11_3_1.rb +64 -0
- data/test/expressions/test_11_3_2.rb +64 -0
- data/test/expressions/test_11_4_2.rb +13 -0
- data/test/expressions/test_11_4_3.rb +52 -0
- data/test/expressions/test_11_4_4.rb +68 -0
- data/test/expressions/test_11_4_5.rb +69 -0
- data/test/expressions/test_11_4_6.rb +88 -0
- data/test/expressions/test_11_4_8.rb +28 -0
- data/test/expressions/test_11_4_9.rb +103 -0
- data/test/expressions/test_11_5_1.rb +51 -0
- data/test/expressions/test_11_5_2.rb +80 -0
- data/test/expressions/test_11_5_3.rb +88 -0
- data/test/expressions/test_11_6_1-1.rb +19 -0
- data/test/expressions/test_11_9_1.rb +19 -0
- data/test/function/test_15_3_1_1-1.rb +34 -0
- data/test/global_object/test_15_1_1_1.rb +29 -0
- data/test/global_object/test_15_1_1_2.rb +17 -0
- data/test/global_object/test_15_1_1_3.rb +9 -0
- data/test/helper.rb +5 -0
- data/test/node_test_case.rb +11 -0
- data/test/object/test_15_2_1_1.rb +257 -0
- data/test/object/test_15_2_1_2.rb +21 -0
- data/test/object/test_15_2_2_1.rb +52 -0
- data/test/statements/test_12_5-1.rb +27 -0
- data/test/test_add_node.rb +8 -0
- data/test/test_arguments_node.rb +8 -0
- data/test/test_array_node.rb +9 -0
- data/test/test_assign_expr_node.rb +8 -0
- data/test/test_automatic_semicolon_insertion.rb +137 -0
- data/test/test_bit_and_node.rb +8 -0
- data/test/test_bit_or_node.rb +8 -0
- data/test/test_bit_x_or_node.rb +8 -0
- data/test/test_bitwise_not_node.rb +8 -0
- data/test/test_block_node.rb +14 -0
- data/test/test_bracket_accessor_node.rb +16 -0
- data/test/test_break_node.rb +11 -0
- data/test/test_case_block_node.rb +11 -0
- data/test/test_case_clause_node.rb +15 -0
- data/test/test_comma_node.rb +13 -0
- data/test/test_comments.rb +44 -0
- data/test/test_conditional_node.rb +17 -0
- data/test/test_const_statement_node.rb +14 -0
- data/test/test_continue_node.rb +11 -0
- data/test/test_delete_node.rb +8 -0
- data/test/test_divide_node.rb +8 -0
- data/test/test_do_while_node.rb +13 -0
- data/test/test_dot_accessor_node.rb +9 -0
- data/test/test_ecma_visitor.rb +210 -0
- data/test/test_element_node.rb +8 -0
- data/test/test_empty_statement_node.rb +8 -0
- data/test/test_equal_node.rb +8 -0
- data/test/test_evaluation_visitor.rb +66 -0
- data/test/test_expression_statement_node.rb +10 -0
- data/test/test_false_node.rb +8 -0
- data/test/test_for_in_node.rb +17 -0
- data/test/test_for_node.rb +24 -0
- data/test/test_function_body_node.rb +8 -0
- data/test/test_function_call_node.rb +10 -0
- data/test/test_function_decl_node.rb +16 -0
- data/test/test_function_expr_node.rb +16 -0
- data/test/test_function_visitor.rb +26 -0
- data/test/test_getter_property_node.rb +10 -0
- data/test/test_global_object.rb +49 -0
- data/test/test_greater_node.rb +8 -0
- data/test/test_greater_or_equal_node.rb +8 -0
- data/test/test_if_node.rb +17 -0
- data/test/test_in_node.rb +8 -0
- data/test/test_instance_of_node.rb +8 -0
- data/test/test_label_node.rb +13 -0
- data/test/test_left_shift_node.rb +8 -0
- data/test/test_less_node.rb +8 -0
- data/test/test_less_or_equal_node.rb +8 -0
- data/test/test_line_number.rb +23 -0
- data/test/test_logical_and_node.rb +8 -0
- data/test/test_logical_not_node.rb +8 -0
- data/test/test_logical_or_node.rb +8 -0
- data/test/test_modulus_node.rb +8 -0
- data/test/test_multiply_node.rb +8 -0
- data/test/test_new_expr_node.rb +9 -0
- data/test/test_not_equal_node.rb +8 -0
- data/test/test_not_strict_equal_node.rb +8 -0
- data/test/test_null_node.rb +8 -0
- data/test/test_number_node.rb +8 -0
- data/test/test_object_literal_node.rb +9 -0
- data/test/test_op_and_equal_node.rb +10 -0
- data/test/test_op_divide_equal_node.rb +10 -0
- data/test/test_op_equal_node.rb +10 -0
- data/test/test_op_l_shift_equal_node.rb +10 -0
- data/test/test_op_minus_equal_node.rb +10 -0
- data/test/test_op_mod_equal_node.rb +10 -0
- data/test/test_op_multiply_equal_node.rb +10 -0
- data/test/test_op_or_equal_node.rb +10 -0
- data/test/test_op_plus_equal_node.rb +10 -0
- data/test/test_op_r_shift_equal_node.rb +10 -0
- data/test/test_op_u_r_shift_equal_node.rb +10 -0
- data/test/test_op_x_or_equal_node.rb +10 -0
- data/test/test_parameter_node.rb +8 -0
- data/test/test_parser.rb +1361 -0
- data/test/test_pointcut_visitor.rb +34 -0
- data/test/test_postfix_node.rb +8 -0
- data/test/test_prefix_node.rb +8 -0
- data/test/test_property_node.rb +8 -0
- data/test/test_rbelly.rb +19 -0
- data/test/test_regexp_node.rb +8 -0
- data/test/test_resolve_node.rb +22 -0
- data/test/test_return_node.rb +11 -0
- data/test/test_right_shift_node.rb +8 -0
- data/test/test_runtime.rb +12 -0
- data/test/test_scope_chain.rb +50 -0
- data/test/test_setter_property_node.rb +10 -0
- data/test/test_source_elements.rb +9 -0
- data/test/test_strict_equal_node.rb +8 -0
- data/test/test_string_node.rb +8 -0
- data/test/test_subtract_node.rb +8 -0
- data/test/test_switch_node.rb +12 -0
- data/test/test_this_node.rb +8 -0
- data/test/test_throw_node.rb +7 -0
- data/test/test_tokenizer.rb +199 -0
- data/test/test_true_node.rb +8 -0
- data/test/test_try_node.rb +59 -0
- data/test/test_type_of_node.rb +8 -0
- data/test/test_unary_minus_node.rb +8 -0
- data/test/test_unary_plus_node.rb +8 -0
- data/test/test_unsigned_right_shift_node.rb +8 -0
- data/test/test_var_decl_node.rb +21 -0
- data/test/test_var_statement_node.rb +14 -0
- data/test/test_void_node.rb +8 -0
- data/test/test_while_node.rb +15 -0
- data/test/test_with_node.rb +8 -0
- metadata +409 -0
@@ -0,0 +1,373 @@
|
|
1
|
+
module RBelly
|
2
|
+
module Visitors
|
3
|
+
class SexpVisitor < Visitor
|
4
|
+
def visit_NumberNode(o)
|
5
|
+
[:lit, o.value]
|
6
|
+
end
|
7
|
+
|
8
|
+
def visit_RegexpNode(o)
|
9
|
+
[:lit, o.value]
|
10
|
+
end
|
11
|
+
|
12
|
+
def visit_AssignExprNode(o)
|
13
|
+
[:assign, super]
|
14
|
+
end
|
15
|
+
|
16
|
+
def visit_VarDeclNode(o)
|
17
|
+
[ o.constant? ? :const_decl : :var_decl ] + super(o)
|
18
|
+
end
|
19
|
+
|
20
|
+
def visit_VarStatementNode(o)
|
21
|
+
[:var, super]
|
22
|
+
end
|
23
|
+
|
24
|
+
def visit_PostfixNode(o)
|
25
|
+
[:postfix, super, o.value]
|
26
|
+
end
|
27
|
+
|
28
|
+
def visit_PrefixNode(o)
|
29
|
+
[:prefix, super, o.value]
|
30
|
+
end
|
31
|
+
|
32
|
+
def visit_DeleteNode(o)
|
33
|
+
[:delete, super]
|
34
|
+
end
|
35
|
+
|
36
|
+
def visit_VoidNode(o)
|
37
|
+
[:void, super]
|
38
|
+
end
|
39
|
+
|
40
|
+
def visit_TypeOfNode(o)
|
41
|
+
[:typeof, super]
|
42
|
+
end
|
43
|
+
|
44
|
+
def visit_UnaryPlusNode(o)
|
45
|
+
[:u_plus, super]
|
46
|
+
end
|
47
|
+
|
48
|
+
def visit_UnaryMinusNode(o)
|
49
|
+
[:u_minus, super]
|
50
|
+
end
|
51
|
+
|
52
|
+
def visit_BitwiseNotNode(o)
|
53
|
+
[:bitwise_not, super]
|
54
|
+
end
|
55
|
+
|
56
|
+
def visit_LogicalNotNode(o)
|
57
|
+
[:not, super]
|
58
|
+
end
|
59
|
+
|
60
|
+
def visit_ConstStatementNode(o)
|
61
|
+
[:const, super]
|
62
|
+
end
|
63
|
+
|
64
|
+
def visit_MultiplyNode(o)
|
65
|
+
[:multiply, *super]
|
66
|
+
end
|
67
|
+
|
68
|
+
def visit_DivideNode(o)
|
69
|
+
[:divide, *super]
|
70
|
+
end
|
71
|
+
|
72
|
+
def visit_ModulusNode(o)
|
73
|
+
[:modulus, *super]
|
74
|
+
end
|
75
|
+
|
76
|
+
def visit_AddNode(o)
|
77
|
+
[:add, *super]
|
78
|
+
end
|
79
|
+
|
80
|
+
def visit_LeftShiftNode(o)
|
81
|
+
[:lshift, *super]
|
82
|
+
end
|
83
|
+
|
84
|
+
def visit_RightShiftNode(o)
|
85
|
+
[:rshift, *super]
|
86
|
+
end
|
87
|
+
|
88
|
+
def visit_UnsignedRightShiftNode(o)
|
89
|
+
[:urshift, *super]
|
90
|
+
end
|
91
|
+
|
92
|
+
def visit_SubtractNode(o)
|
93
|
+
[:subtract, *super]
|
94
|
+
end
|
95
|
+
|
96
|
+
def visit_LessNode(o)
|
97
|
+
[:less, *super]
|
98
|
+
end
|
99
|
+
|
100
|
+
def visit_GreaterNode(o)
|
101
|
+
[:greater, *super]
|
102
|
+
end
|
103
|
+
|
104
|
+
def visit_LessOrEqualNode(o)
|
105
|
+
[:less_or_equal, *super]
|
106
|
+
end
|
107
|
+
|
108
|
+
def visit_GreaterOrEqualNode(o)
|
109
|
+
[:greater_or_equal, *super]
|
110
|
+
end
|
111
|
+
|
112
|
+
def visit_InstanceOfNode(o)
|
113
|
+
[:instance_of, *super]
|
114
|
+
end
|
115
|
+
|
116
|
+
def visit_EqualNode(o)
|
117
|
+
[:equal, *super]
|
118
|
+
end
|
119
|
+
|
120
|
+
def visit_NotEqualNode(o)
|
121
|
+
[:not_equal, *super]
|
122
|
+
end
|
123
|
+
|
124
|
+
def visit_StrictEqualNode(o)
|
125
|
+
[:strict_equal, *super]
|
126
|
+
end
|
127
|
+
|
128
|
+
def visit_NotStrictEqualNode(o)
|
129
|
+
[:not_strict_equal, *super]
|
130
|
+
end
|
131
|
+
|
132
|
+
def visit_BitAndNode(o)
|
133
|
+
[:bit_and, *super]
|
134
|
+
end
|
135
|
+
|
136
|
+
def visit_BitOrNode(o)
|
137
|
+
[:bit_or, *super]
|
138
|
+
end
|
139
|
+
|
140
|
+
def visit_BitXOrNode(o)
|
141
|
+
[:bit_xor, *super]
|
142
|
+
end
|
143
|
+
|
144
|
+
def visit_LogicalAndNode(o)
|
145
|
+
[:and, *super]
|
146
|
+
end
|
147
|
+
|
148
|
+
def visit_LogicalOrNode(o)
|
149
|
+
[:or, *super]
|
150
|
+
end
|
151
|
+
|
152
|
+
def visit_InNode(o)
|
153
|
+
[:in, *super]
|
154
|
+
end
|
155
|
+
|
156
|
+
def visit_DoWhileNode(o)
|
157
|
+
[:do_while, *super]
|
158
|
+
end
|
159
|
+
|
160
|
+
def visit_WhileNode(o)
|
161
|
+
[:while, *super]
|
162
|
+
end
|
163
|
+
|
164
|
+
def visit_WithNode(o)
|
165
|
+
[:with, *super]
|
166
|
+
end
|
167
|
+
|
168
|
+
def visit_CaseClauseNode(o)
|
169
|
+
[:case, *super]
|
170
|
+
end
|
171
|
+
|
172
|
+
def visit_CaseBlockNode(o)
|
173
|
+
[:case_block, super]
|
174
|
+
end
|
175
|
+
|
176
|
+
def visit_SwitchNode(o)
|
177
|
+
[:switch, *super]
|
178
|
+
end
|
179
|
+
|
180
|
+
def visit_ForNode(o)
|
181
|
+
[ :for, *super]
|
182
|
+
end
|
183
|
+
|
184
|
+
def visit_BlockNode(o)
|
185
|
+
[:block, super]
|
186
|
+
end
|
187
|
+
|
188
|
+
def visit_IfNode(o)
|
189
|
+
[:if, *super].compact
|
190
|
+
end
|
191
|
+
|
192
|
+
def visit_ConditionalNode(o)
|
193
|
+
[:conditional, *super]
|
194
|
+
end
|
195
|
+
|
196
|
+
def visit_ForInNode(o)
|
197
|
+
[ :for_in, *super]
|
198
|
+
end
|
199
|
+
|
200
|
+
def visit_TryNode(o)
|
201
|
+
[ :try, *super]
|
202
|
+
end
|
203
|
+
|
204
|
+
def visit_EmptyStatementNode(o)
|
205
|
+
[:empty]
|
206
|
+
end
|
207
|
+
|
208
|
+
def visit_FunctionBodyNode(o)
|
209
|
+
[:func_body, super]
|
210
|
+
end
|
211
|
+
|
212
|
+
def visit_ResolveNode(o)
|
213
|
+
[:resolve, o.value]
|
214
|
+
end
|
215
|
+
|
216
|
+
def visit_BracketAccessorNode(o)
|
217
|
+
[:bracket_access, *super]
|
218
|
+
end
|
219
|
+
|
220
|
+
def visit_NewExprNode(o)
|
221
|
+
[:new_expr, *super]
|
222
|
+
end
|
223
|
+
|
224
|
+
def visit_ParameterNode(o)
|
225
|
+
[:param, o.value]
|
226
|
+
end
|
227
|
+
|
228
|
+
def visit_BreakNode(o)
|
229
|
+
[:break, o.value].compact
|
230
|
+
end
|
231
|
+
|
232
|
+
def visit_ContinueNode(o)
|
233
|
+
[:continue, o.value].compact
|
234
|
+
end
|
235
|
+
|
236
|
+
def visit_LabelNode(o)
|
237
|
+
[:label ] + super
|
238
|
+
end
|
239
|
+
|
240
|
+
def visit_ThrowNode(o)
|
241
|
+
[:throw, super]
|
242
|
+
end
|
243
|
+
|
244
|
+
def visit_ObjectLiteralNode(o)
|
245
|
+
[:object, super]
|
246
|
+
end
|
247
|
+
|
248
|
+
def visit_PropertyNode(o)
|
249
|
+
[ :property ] + super
|
250
|
+
end
|
251
|
+
|
252
|
+
def visit_GetterPropertyNode(o)
|
253
|
+
[ :getter ] + super
|
254
|
+
end
|
255
|
+
|
256
|
+
def visit_SetterPropertyNode(o)
|
257
|
+
[ :setter ] + super
|
258
|
+
end
|
259
|
+
|
260
|
+
def visit_ElementNode(o)
|
261
|
+
[:element, super ]
|
262
|
+
end
|
263
|
+
|
264
|
+
def visit_ExpressionStatementNode(o)
|
265
|
+
[:expression, super ]
|
266
|
+
end
|
267
|
+
|
268
|
+
def visit_OpEqualNode(o)
|
269
|
+
[:op_equal, *super ]
|
270
|
+
end
|
271
|
+
|
272
|
+
def visit_OpPlusEqualNode(o)
|
273
|
+
[:op_plus_equal, *super ]
|
274
|
+
end
|
275
|
+
|
276
|
+
def visit_OpMinusEqualNode(o)
|
277
|
+
[:op_minus_equal, *super ]
|
278
|
+
end
|
279
|
+
|
280
|
+
def visit_OpMultiplyEqualNode(o)
|
281
|
+
[:op_multiply_equal, *super ]
|
282
|
+
end
|
283
|
+
|
284
|
+
def visit_OpDivideEqualNode(o)
|
285
|
+
[:op_divide_equal, *super]
|
286
|
+
end
|
287
|
+
|
288
|
+
def visit_OpLShiftEqualNode(o)
|
289
|
+
[:op_lshift_equal, *super ]
|
290
|
+
end
|
291
|
+
|
292
|
+
def visit_OpRShiftEqualNode(o)
|
293
|
+
[:op_rshift_equal, *super ]
|
294
|
+
end
|
295
|
+
|
296
|
+
def visit_OpURShiftEqualNode(o)
|
297
|
+
[:op_urshift_equal, *super ]
|
298
|
+
end
|
299
|
+
|
300
|
+
def visit_OpAndEqualNode(o)
|
301
|
+
[:op_and_equal, *super ]
|
302
|
+
end
|
303
|
+
|
304
|
+
def visit_OpXOrEqualNode(o)
|
305
|
+
[:op_xor_equal, *super ]
|
306
|
+
end
|
307
|
+
|
308
|
+
def visit_OpOrEqualNode(o)
|
309
|
+
[:op_or_equal, *super ]
|
310
|
+
end
|
311
|
+
|
312
|
+
def visit_OpModEqualNode(o)
|
313
|
+
[:op_mod_equal, *super]
|
314
|
+
end
|
315
|
+
|
316
|
+
def visit_CommaNode(o)
|
317
|
+
[:comma, *super]
|
318
|
+
end
|
319
|
+
|
320
|
+
def visit_FunctionCallNode(o)
|
321
|
+
[:function_call, *super]
|
322
|
+
end
|
323
|
+
|
324
|
+
def visit_ArrayNode(o)
|
325
|
+
[:array, super]
|
326
|
+
end
|
327
|
+
|
328
|
+
def visit_ThisNode(o)
|
329
|
+
[:this]
|
330
|
+
end
|
331
|
+
|
332
|
+
def visit_ReturnNode(o)
|
333
|
+
o.value ? [:return, super] : [:return]
|
334
|
+
end
|
335
|
+
|
336
|
+
def visit_FunctionExprNode(o)
|
337
|
+
[ :func_expr, *super]
|
338
|
+
end
|
339
|
+
|
340
|
+
def visit_FunctionDeclNode(o)
|
341
|
+
[ :func_decl, *super]
|
342
|
+
end
|
343
|
+
|
344
|
+
def visit_ArgumentsNode(o)
|
345
|
+
[:args, super]
|
346
|
+
end
|
347
|
+
|
348
|
+
def visit_DotAccessorNode(o)
|
349
|
+
[:dot_access,
|
350
|
+
super,
|
351
|
+
o.accessor
|
352
|
+
]
|
353
|
+
end
|
354
|
+
|
355
|
+
def visit_NullNode(o)
|
356
|
+
[:nil]
|
357
|
+
end
|
358
|
+
|
359
|
+
def visit_StringNode(o)
|
360
|
+
[:str, o.value]
|
361
|
+
end
|
362
|
+
|
363
|
+
def visit_FalseNode(o)
|
364
|
+
[:false]
|
365
|
+
end
|
366
|
+
|
367
|
+
def visit_TrueNode(o)
|
368
|
+
[:true]
|
369
|
+
end
|
370
|
+
|
371
|
+
end
|
372
|
+
end
|
373
|
+
end
|
@@ -0,0 +1,136 @@
|
|
1
|
+
module RBelly
|
2
|
+
module Visitors
|
3
|
+
class Visitor
|
4
|
+
TERMINAL_NODES = %w{
|
5
|
+
Break Continue EmptyStatement False Null Number Parameter Regexp Resolve
|
6
|
+
String This True
|
7
|
+
}
|
8
|
+
SINGLE_VALUE_NODES = %w{
|
9
|
+
Parenthetical AssignExpr BitwiseNot Block Delete Element ExpressionStatement
|
10
|
+
FunctionBody LogicalNot Return Throw TypeOf UnaryMinus UnaryPlus Void
|
11
|
+
}
|
12
|
+
BINARY_NODES = %w{
|
13
|
+
Add BitAnd BitOr BitXOr CaseClause Comma Divide DoWhile Equal Greater
|
14
|
+
GreaterOrEqual In InstanceOf LeftShift Less LessOrEqual LogicalAnd
|
15
|
+
LogicalOr Modulus Multiply NotEqual NotStrictEqual OpAndEqual
|
16
|
+
OpDivideEqual OpEqual OpLShiftEqual OpMinusEqual OpModEqual
|
17
|
+
OpMultiplyEqual OpOrEqual OpPlusEqual OpRShiftEqual OpURShiftEqual
|
18
|
+
OpXOrEqual RightShift StrictEqual Subtract Switch UnsignedRightShift
|
19
|
+
While With
|
20
|
+
}
|
21
|
+
ARRAY_VALUE_NODES = %w{
|
22
|
+
Arguments Array CaseBlock ConstStatement ObjectLiteral SourceElements
|
23
|
+
VarStatement
|
24
|
+
}
|
25
|
+
NAME_VALUE_NODES = %w{
|
26
|
+
Label Property GetterProperty SetterProperty VarDecl
|
27
|
+
}
|
28
|
+
PREFIX_POSTFIX_NODES = %w{ Postfix Prefix }
|
29
|
+
CONDITIONAL_NODES = %w{ If Conditional }
|
30
|
+
FUNC_CALL_NODES = %w{ NewExpr FunctionCall }
|
31
|
+
FUNC_DECL_NODES = %w{ FunctionExpr FunctionDecl }
|
32
|
+
ALL_NODES = %w{ For ForIn Try BracketAccessor DotAccessor } +
|
33
|
+
TERMINAL_NODES + SINGLE_VALUE_NODES + BINARY_NODES + ARRAY_VALUE_NODES +
|
34
|
+
NAME_VALUE_NODES + PREFIX_POSTFIX_NODES + CONDITIONAL_NODES +
|
35
|
+
FUNC_CALL_NODES + FUNC_DECL_NODES
|
36
|
+
|
37
|
+
def accept(target)
|
38
|
+
target.accept(self)
|
39
|
+
end
|
40
|
+
|
41
|
+
TERMINAL_NODES.each do |type|
|
42
|
+
define_method(:"visit_#{type}Node") { |o| o.value }
|
43
|
+
end
|
44
|
+
|
45
|
+
BINARY_NODES.each do |type|
|
46
|
+
define_method(:"visit_#{type}Node") do |o|
|
47
|
+
[o.left && o.left.accept(self), o.value && o.value.accept(self)]
|
48
|
+
end
|
49
|
+
end
|
50
|
+
|
51
|
+
ARRAY_VALUE_NODES.each do |type|
|
52
|
+
define_method(:"visit_#{type}Node") do |o|
|
53
|
+
o.value && o.value.map { |v| v ? v.accept(self) : nil }
|
54
|
+
end
|
55
|
+
end
|
56
|
+
|
57
|
+
NAME_VALUE_NODES.each do |type|
|
58
|
+
define_method(:"visit_#{type}Node") do |o|
|
59
|
+
[o.name.to_s.to_sym, o.value ? o.value.accept(self) : nil]
|
60
|
+
end
|
61
|
+
end
|
62
|
+
|
63
|
+
SINGLE_VALUE_NODES.each do |type|
|
64
|
+
define_method(:"visit_#{type}Node") do |o|
|
65
|
+
o.value.accept(self) if o.value
|
66
|
+
end
|
67
|
+
end
|
68
|
+
|
69
|
+
PREFIX_POSTFIX_NODES.each do |type|
|
70
|
+
define_method(:"visit_#{type}Node") do |o|
|
71
|
+
o.operand.accept(self)
|
72
|
+
end
|
73
|
+
end
|
74
|
+
|
75
|
+
CONDITIONAL_NODES.each do |type|
|
76
|
+
define_method(:"visit_#{type}Node") do |o|
|
77
|
+
[ o.conditions.accept(self),
|
78
|
+
o.value.accept(self),
|
79
|
+
o.else ? o.else.accept(self) : nil
|
80
|
+
]
|
81
|
+
end
|
82
|
+
end
|
83
|
+
FUNC_CALL_NODES.each do |type|
|
84
|
+
define_method(:"visit_#{type}Node") do |o|
|
85
|
+
[o.value.accept(self), o.arguments.accept(self)]
|
86
|
+
end
|
87
|
+
end
|
88
|
+
FUNC_DECL_NODES.each do |type|
|
89
|
+
define_method(:"visit_#{type}Node") do |o|
|
90
|
+
[
|
91
|
+
o.value ? o.value : nil,
|
92
|
+
o.arguments.map { |x| x.accept(self) },
|
93
|
+
o.function_body.accept(self)
|
94
|
+
]
|
95
|
+
end
|
96
|
+
end
|
97
|
+
|
98
|
+
def visit_ForNode(o)
|
99
|
+
[
|
100
|
+
o.init ? o.init.accept(self) : nil,
|
101
|
+
o.test ? o.test.accept(self) : nil,
|
102
|
+
o.counter ? o.counter.accept(self) : nil,
|
103
|
+
o.value.accept(self)
|
104
|
+
]
|
105
|
+
end
|
106
|
+
|
107
|
+
def visit_ForInNode(o)
|
108
|
+
[
|
109
|
+
o.left.accept(self),
|
110
|
+
o.right.accept(self),
|
111
|
+
o.value.accept(self)
|
112
|
+
]
|
113
|
+
end
|
114
|
+
|
115
|
+
def visit_TryNode(o)
|
116
|
+
[
|
117
|
+
o.value.accept(self),
|
118
|
+
o.catch_var ? o.catch_var : nil,
|
119
|
+
o.catch_block ? o.catch_block.accept(self) : nil,
|
120
|
+
o.finally_block ? o.finally_block.accept(self) : nil
|
121
|
+
]
|
122
|
+
end
|
123
|
+
|
124
|
+
def visit_BracketAccessorNode(o)
|
125
|
+
[
|
126
|
+
o.value.accept(self),
|
127
|
+
o.accessor.accept(self)
|
128
|
+
]
|
129
|
+
end
|
130
|
+
|
131
|
+
def visit_DotAccessorNode(o)
|
132
|
+
o.value.accept(self)
|
133
|
+
end
|
134
|
+
end
|
135
|
+
end
|
136
|
+
end
|
data/lib/rbelly.rb
ADDED
@@ -0,0 +1,14 @@
|
|
1
|
+
require 'rbelly/constants'
|
2
|
+
require 'rbelly/visitable'
|
3
|
+
require 'rbelly/visitors'
|
4
|
+
require 'rbelly/parser'
|
5
|
+
require 'rbelly/runtime'
|
6
|
+
require 'rbelly/syntax_error'
|
7
|
+
|
8
|
+
module RBelly
|
9
|
+
class << self
|
10
|
+
def parse *args
|
11
|
+
RBelly::Parser.new.parse(*args)
|
12
|
+
end
|
13
|
+
end
|
14
|
+
end
|
@@ -0,0 +1,21 @@
|
|
1
|
+
class ECMAScriptTestCase < Test::Unit::TestCase
|
2
|
+
include RBelly::JS
|
3
|
+
|
4
|
+
if method_defined? :default_test
|
5
|
+
undef :default_test
|
6
|
+
end
|
7
|
+
|
8
|
+
def setup
|
9
|
+
@runtime = RBelly::Runtime.new
|
10
|
+
@runtime.define_function(:assert_equal) do |*args|
|
11
|
+
assert_equal(*args)
|
12
|
+
end
|
13
|
+
@runtime.define_function(:assert_in_delta) do |*args|
|
14
|
+
assert_in_delta(*args)
|
15
|
+
end
|
16
|
+
end
|
17
|
+
|
18
|
+
def js_assert_equal(expected, actual)
|
19
|
+
@runtime.execute("assert_equal(#{expected}, #{actual});")
|
20
|
+
end
|
21
|
+
end
|
@@ -0,0 +1,16 @@
|
|
1
|
+
class ExecuteTestCase < Test::Unit::TestCase
|
2
|
+
include RBelly::Nodes
|
3
|
+
|
4
|
+
if method_defined? :default_test
|
5
|
+
undef :default_test
|
6
|
+
end
|
7
|
+
|
8
|
+
def assert_execute(expected, code)
|
9
|
+
scope_chain = @runtime.execute(code)
|
10
|
+
expected.each do |name, value|
|
11
|
+
assert scope_chain.has_property?(name)
|
12
|
+
assert_equal value, scope_chain[name].value
|
13
|
+
end
|
14
|
+
end
|
15
|
+
end
|
16
|
+
|
@@ -0,0 +1,32 @@
|
|
1
|
+
require File.dirname(__FILE__) + "/../helper"
|
2
|
+
|
3
|
+
class ExecutionContext_10_1_3_1_Test < Test::Unit::TestCase
|
4
|
+
def setup
|
5
|
+
@runtime = RBelly::Runtime.new
|
6
|
+
@runtime.define_function(:assert_equal) do |*args|
|
7
|
+
assert_equal(*args)
|
8
|
+
end
|
9
|
+
end
|
10
|
+
|
11
|
+
def test_myfun3_void_0
|
12
|
+
scope_chain = @runtime.execute("
|
13
|
+
function myfun3(a, b, a) {
|
14
|
+
return a;
|
15
|
+
}
|
16
|
+
var x = myfun3(2,4);
|
17
|
+
")
|
18
|
+
assert scope_chain.has_property?('x')
|
19
|
+
#assert_equal :undefined, scope_chain['x'].value
|
20
|
+
end
|
21
|
+
|
22
|
+
def test_myfun3
|
23
|
+
scope_chain = @runtime.execute("
|
24
|
+
function myfun3(a, b, a) {
|
25
|
+
return a;
|
26
|
+
}
|
27
|
+
var x = myfun3(2,4,8);
|
28
|
+
")
|
29
|
+
assert scope_chain.has_property?('x')
|
30
|
+
assert_equal 8, scope_chain['x'].value
|
31
|
+
end
|
32
|
+
end
|
@@ -0,0 +1,64 @@
|
|
1
|
+
require File.dirname(__FILE__) + "/../helper"
|
2
|
+
|
3
|
+
class Expressions_11_3_1_Test < ECMAScriptTestCase
|
4
|
+
def test_uninitialized
|
5
|
+
@runtime.execute("var MYVAR; assert_equal(NaN, MYVAR++); assert_equal(NaN, MYVAR);")
|
6
|
+
end
|
7
|
+
|
8
|
+
@@tests = [
|
9
|
+
:undefined => [ '(void 0)', 'NaN', 'NaN'],
|
10
|
+
:null => [ 'null', '0', '1'],
|
11
|
+
:true => [ 'true', '1', '2'],
|
12
|
+
:false => [ 'false', '0', '1'],
|
13
|
+
:positive_infinity => [ 'Number.POSITIVE_INFINITY',
|
14
|
+
'Number.POSITIVE_INFINITY',
|
15
|
+
'Number.POSITIVE_INFINITY'],
|
16
|
+
:negative_infinity => [ 'Number.NEGATIVE_INFINITY',
|
17
|
+
'Number.NEGATIVE_INFINITY',
|
18
|
+
'Number.NEGATIVE_INFINITY'],
|
19
|
+
:nan => [ 'Number.NaN', 'Number.NaN', 'Number.NaN'],
|
20
|
+
:zero => [ '0', '0', '1'],
|
21
|
+
:boolean_false => ['new Boolean(false)', '0', '1'],
|
22
|
+
:boolean_true => ['new Boolean(true)', '1', '2'],
|
23
|
+
:string_string => ["'string'", 'Number.NaN', 'Number.NaN'],
|
24
|
+
:number_s => ["'12345'", '12345', '12346'],
|
25
|
+
:negative_s => ["'-12345'", '-12345', '-12344'],
|
26
|
+
:hex_s => ["'0Xf'", '15', '16'],
|
27
|
+
:num_0_s => ["'077'", '77', '78'],
|
28
|
+
:empty_s => ["''", '0', '1'],
|
29
|
+
:obj_string_string => ['new String("string")', 'Number.NaN', 'Number.NaN'],
|
30
|
+
:obj_string_num => ['new String("12345")', '12345', '12346'],
|
31
|
+
:obj_negative => ['new String("-12345")', '-12345', '-12344'],
|
32
|
+
:obj_hex => ['new String("0Xf")', '15', '16'],
|
33
|
+
:obj_0_s => ['new String("077")', '77', '78'],
|
34
|
+
:obj_empty => ['new String("")', '0', '1'],
|
35
|
+
]
|
36
|
+
|
37
|
+
def test_positive_float
|
38
|
+
@runtime.execute("
|
39
|
+
var MYVAR=0.2345;
|
40
|
+
assert_equal(0.2345, MYVAR++);
|
41
|
+
assert_in_delta(1.2345, MYVAR, 0.00001);
|
42
|
+
")
|
43
|
+
end
|
44
|
+
|
45
|
+
def test_negative_float
|
46
|
+
@runtime.execute("
|
47
|
+
var MYVAR=-0.2345;
|
48
|
+
assert_equal(-0.2345, MYVAR++);
|
49
|
+
assert_in_delta(0.7655, MYVAR, 0.00001);
|
50
|
+
")
|
51
|
+
end
|
52
|
+
|
53
|
+
@@tests.each do |testing|
|
54
|
+
testing.each do |name, values|
|
55
|
+
define_method(:"test_#{name}") do
|
56
|
+
@runtime.execute("
|
57
|
+
var MYVAR=#{values[0]};
|
58
|
+
assert_equal(#{values[1]}, MYVAR++);
|
59
|
+
assert_equal(#{values[2]}, MYVAR);
|
60
|
+
")
|
61
|
+
end
|
62
|
+
end
|
63
|
+
end
|
64
|
+
end
|