rkelly-remix 0.0.5 → 0.0.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 0735c3a4887540bf2decb0e3212c0402bb0e8a7e
-  data.tar.gz: d546a14e99056db30d3e3f66664f52efbbc733cc
+  metadata.gz: f47c6af1354b1166a7984f8d583c79c56ae987b7
+  data.tar.gz: 57847f8a36c5309daeea9598997d836ca1dba724
 SHA512:
-  metadata.gz: 1d2912446c29a7af0698985a20b87a245f9f310ece9fbde5df6db4e14479699faa7345e9c6f206fc0b46f757fc78b8cc08255001a72230a8be896828b29e46b7
-  data.tar.gz: 9a18576dfb4323215987fd68216c49dd9f32b206f6d52cc74d9bd93a090f0b803cf8646e5475b120df84ed386346283aeb5c01bf07b9dc2adf5126f78f836eee
+  metadata.gz: bc58e42be04a97025e1289bef17dc7d5327a7dc91543c64780d6f515b2da9df0bbb5964bfa194524bc527bc30fa3cffcc66f4f5042d875edff32d98f4868d971
+  data.tar.gz: 60b17e556acda51daa526a70d3e809fa29dd2bafc55787d966ae19ac422a3e7fbe2266cdb5431ad6a97d8f3b8dfa3ecda9387a467d6dc4505ff7566941cd1634

data/lib/rkelly/constants.rb

@@ -1,3 +1,3 @@
 module RKelly
-  VERSION = '0.0.5'
+  VERSION = '0.0.6'
 end

data/lib/rkelly/generated_parser.rb

@@ -1510,14 +1510,14 @@ Racc_debug_parser = false
 
 module_eval(<<'.,.,', 'parser.y', 45)
   def _reduce_1(val, _values, result)
-     result = SourceElementsNode.new([]) 
+     result = SourceElementsNode.new([])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 46)
   def _reduce_2(val, _values, result)
-     result = SourceElementsNode.new([val].flatten) 
+     result = SourceElementsNode.new([val].flatten)
     result
   end
 .,.,
@@ -1526,7 +1526,7 @@ module_eval(<<'.,.,', 'parser.y', 46)
 
 module_eval(<<'.,.,', 'parser.y', 50)
   def _reduce_4(val, _values, result)
-     result = val.flatten 
+     result = val.flatten
     result
   end
 .,.,
@@ -1569,42 +1569,42 @@ module_eval(<<'.,.,', 'parser.y', 50)
 
 module_eval(<<'.,.,', 'parser.y', 78)
   def _reduce_23(val, _values, result)
-     result = NullNode.new(val.first) 
+     result = NullNode.new(val.first)
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 79)
   def _reduce_24(val, _values, result)
-     result = TrueNode.new(val.first) 
+     result = TrueNode.new(val.first)
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 80)
   def _reduce_25(val, _values, result)
-     result = FalseNode.new(val.first) 
+     result = FalseNode.new(val.first)
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 81)
   def _reduce_26(val, _values, result)
-     result = NumberNode.new(val.first) 
+     result = NumberNode.new(val.first)
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 82)
   def _reduce_27(val, _values, result)
-     result = StringNode.new(val.first) 
+     result = StringNode.new(val.first)
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 83)
   def _reduce_28(val, _values, result)
-     result = RegexpNode.new(val.first) 
+     result = RegexpNode.new(val.first)
     result
   end
 .,.,
@@ -1612,21 +1612,21 @@ module_eval(<<'.,.,', 'parser.y', 83)
 module_eval(<<'.,.,', 'parser.y', 88)
   def _reduce_29(val, _values, result)
           result = PropertyNode.new(val[0], val[2])
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 90)
   def _reduce_30(val, _values, result)
-     result = PropertyNode.new(val.first, val.last) 
+     result = PropertyNode.new(val.first, val.last)
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 91)
   def _reduce_31(val, _values, result)
-     result = PropertyNode.new(val.first, val.last) 
+     result = PropertyNode.new(val.first, val.last)
     result
   end
 .,.,
@@ -1636,7 +1636,7 @@ module_eval(<<'.,.,', 'parser.y', 93)
           klass = property_class_for(val.first)
       yyabort unless klass
       result = klass.new(val[1], FunctionExprNode.new(nil, val[4]))
-    
+
     result
   end
 .,.,
@@ -1646,7 +1646,7 @@ module_eval(<<'.,.,', 'parser.y', 98)
           klass = property_class_for(val.first)
       yyabort unless klass
       result = klass.new(val[1], FunctionExprNode.new(nil, val[5], val[3]))
-    
+
     result
   end
 .,.,
@@ -1717,14 +1717,14 @@ module_eval(<<'.,.,', 'parser.y', 98)
 
 module_eval(<<'.,.,', 'parser.y', 114)
   def _reduce_66(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 115)
   def _reduce_67(val, _values, result)
-     result = [val.first, val.last].flatten 
+     result = [val.first, val.last].flatten
     result
   end
 .,.,
@@ -1733,28 +1733,28 @@ module_eval(<<'.,.,', 'parser.y', 115)
 
 module_eval(<<'.,.,', 'parser.y', 120)
   def _reduce_69(val, _values, result)
-     result = ObjectLiteralNode.new([]) 
+     result = ObjectLiteralNode.new([])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 121)
   def _reduce_70(val, _values, result)
-     result = ObjectLiteralNode.new(val[1]) 
+     result = ObjectLiteralNode.new(val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 122)
   def _reduce_71(val, _values, result)
-     result = ObjectLiteralNode.new(val[1]) 
+     result = ObjectLiteralNode.new(val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 126)
   def _reduce_72(val, _values, result)
-     result = ThisNode.new(val.first) 
+     result = ThisNode.new(val.first)
     result
   end
 .,.,
@@ -1765,28 +1765,28 @@ module_eval(<<'.,.,', 'parser.y', 126)
 
 module_eval(<<'.,.,', 'parser.y', 129)
   def _reduce_75(val, _values, result)
-     result = ResolveNode.new(val.first) 
+     result = ResolveNode.new(val.first)
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 130)
   def _reduce_76(val, _values, result)
-     result = ParentheticalNode.new(val[1]) 
+     result = ParentheticalNode.new(val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 134)
   def _reduce_77(val, _values, result)
-     result = ArrayNode.new([] + [nil] * val[1]) 
+     result = ArrayNode.new([] + [nil] * val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 135)
   def _reduce_78(val, _values, result)
-     result = ArrayNode.new(val[1]) 
+     result = ArrayNode.new(val[1])
     result
   end
 .,.,
@@ -1794,7 +1794,7 @@ module_eval(<<'.,.,', 'parser.y', 135)
 module_eval(<<'.,.,', 'parser.y', 137)
   def _reduce_79(val, _values, result)
           result = ArrayNode.new(val[1] + [nil] * val[3])
-    
+
     result
   end
 .,.,
@@ -1802,7 +1802,7 @@ module_eval(<<'.,.,', 'parser.y', 137)
 module_eval(<<'.,.,', 'parser.y', 143)
   def _reduce_80(val, _values, result)
           result = [nil] * val[0] + [ElementNode.new(val[1])]
-    
+
     result
   end
 .,.,
@@ -1810,14 +1810,14 @@ module_eval(<<'.,.,', 'parser.y', 143)
 module_eval(<<'.,.,', 'parser.y', 146)
   def _reduce_81(val, _values, result)
           result = [val[0], [nil] * val[2], ElementNode.new(val[3])].flatten
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 151)
   def _reduce_82(val, _values, result)
-     result = 0 
+     result = 0
     result
   end
 .,.,
@@ -1826,14 +1826,14 @@ module_eval(<<'.,.,', 'parser.y', 151)
 
 module_eval(<<'.,.,', 'parser.y', 156)
   def _reduce_84(val, _values, result)
-     result = 1 
+     result = 1
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 157)
   def _reduce_85(val, _values, result)
-     result = val.first + 1 
+     result = val.first + 1
     result
   end
 .,.,
@@ -1844,21 +1844,21 @@ module_eval(<<'.,.,', 'parser.y', 157)
 
 module_eval(<<'.,.,', 'parser.y', 163)
   def _reduce_88(val, _values, result)
-     result = BracketAccessorNode.new(val[0], val[2]) 
+     result = BracketAccessorNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 164)
   def _reduce_89(val, _values, result)
-     result = DotAccessorNode.new(val[0], val[2]) 
+     result = DotAccessorNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 165)
   def _reduce_90(val, _values, result)
-     result = NewExprNode.new(val[1], val[2]) 
+     result = NewExprNode.new(val[1], val[2])
     result
   end
 .,.,
@@ -1868,21 +1868,21 @@ module_eval(<<'.,.,', 'parser.y', 165)
 module_eval(<<'.,.,', 'parser.y', 171)
   def _reduce_92(val, _values, result)
           result = BracketAccessorNode.new(val[0], val[2])
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 173)
   def _reduce_93(val, _values, result)
-     result = DotAccessorNode.new(val[0], val[2]) 
+     result = DotAccessorNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 174)
   def _reduce_94(val, _values, result)
-     result = NewExprNode.new(val[1], val[2]) 
+     result = NewExprNode.new(val[1], val[2])
     result
   end
 .,.,
@@ -1891,7 +1891,7 @@ module_eval(<<'.,.,', 'parser.y', 174)
 
 module_eval(<<'.,.,', 'parser.y', 179)
   def _reduce_96(val, _values, result)
-     result = NewExprNode.new(val[1], ArgumentsNode.new([])) 
+     result = NewExprNode.new(val[1], ArgumentsNode.new([]))
     result
   end
 .,.,
@@ -1900,98 +1900,98 @@ module_eval(<<'.,.,', 'parser.y', 179)
 
 module_eval(<<'.,.,', 'parser.y', 184)
   def _reduce_98(val, _values, result)
-     result = NewExprNode.new(val[1], ArgumentsNode.new([])) 
+     result = NewExprNode.new(val[1], ArgumentsNode.new([]))
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 188)
   def _reduce_99(val, _values, result)
-     result = FunctionCallNode.new(val[0], val[1]) 
+     result = FunctionCallNode.new(val[0], val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 189)
   def _reduce_100(val, _values, result)
-     result = FunctionCallNode.new(val[0], val[1]) 
+     result = FunctionCallNode.new(val[0], val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 190)
   def _reduce_101(val, _values, result)
-     result = BracketAccessorNode.new(val[0], val[2]) 
+     result = BracketAccessorNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 191)
   def _reduce_102(val, _values, result)
-     result = DotAccessorNode.new(val[0], val[2]) 
+     result = DotAccessorNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 195)
   def _reduce_103(val, _values, result)
-     result = FunctionCallNode.new(ResolveNode.new(val[0]), val[2]) 
+     result = FunctionCallNode.new(ResolveNode.new(val[0]), val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 196)
   def _reduce_104(val, _values, result)
-     result = FunctionCallNode.new(val[0], val[1]) 
+     result = FunctionCallNode.new(val[0], val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 197)
   def _reduce_105(val, _values, result)
-     result = FunctionCallNode.new(val[0], val[1]) 
+     result = FunctionCallNode.new(val[0], val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 198)
   def _reduce_106(val, _values, result)
-     result = BracketAccessorNode.new(val[0], val[2]) 
+     result = BracketAccessorNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 199)
   def _reduce_107(val, _values, result)
-     result = DotAccessorNode.new(val[0], val[2]) 
+     result = DotAccessorNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 203)
   def _reduce_108(val, _values, result)
-     result = ArgumentsNode.new([]) 
+     result = ArgumentsNode.new([])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 204)
   def _reduce_109(val, _values, result)
-     result = ArgumentsNode.new(val[1]); 
+     result = ArgumentsNode.new(val[1]);
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 208)
   def _reduce_110(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 209)
   def _reduce_111(val, _values, result)
-     result = [val[0], val[2]].flatten 
+     result = [val[0], val[2]].flatten
     result
   end
 .,.,
@@ -2008,14 +2008,14 @@ module_eval(<<'.,.,', 'parser.y', 209)
 
 module_eval(<<'.,.,', 'parser.y', 224)
   def _reduce_117(val, _values, result)
-     result = PostfixNode.new(val[0], '++') 
+     result = PostfixNode.new(val[0], '++')
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 225)
   def _reduce_118(val, _values, result)
-     result = PostfixNode.new(val[0], '--') 
+     result = PostfixNode.new(val[0], '--')
     result
   end
 .,.,
@@ -2024,77 +2024,77 @@ module_eval(<<'.,.,', 'parser.y', 225)
 
 module_eval(<<'.,.,', 'parser.y', 230)
   def _reduce_120(val, _values, result)
-     result = PostfixNode.new(val[0], '++') 
+     result = PostfixNode.new(val[0], '++')
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 231)
   def _reduce_121(val, _values, result)
-     result = PostfixNode.new(val[0], '--') 
+     result = PostfixNode.new(val[0], '--')
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 235)
   def _reduce_122(val, _values, result)
-     result = DeleteNode.new(val[1]) 
+     result = DeleteNode.new(val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 236)
   def _reduce_123(val, _values, result)
-     result = VoidNode.new(val[1]) 
+     result = VoidNode.new(val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 237)
   def _reduce_124(val, _values, result)
-     result = TypeOfNode.new(val[1]) 
+     result = TypeOfNode.new(val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 238)
   def _reduce_125(val, _values, result)
-     result = PrefixNode.new(val[1], '++') 
+     result = PrefixNode.new(val[1], '++')
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 241)
   def _reduce_126(val, _values, result)
-     result = PrefixNode.new(val[1], '--') 
+     result = PrefixNode.new(val[1], '--')
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 244)
   def _reduce_127(val, _values, result)
-     result = UnaryPlusNode.new(val[1]) 
+     result = UnaryPlusNode.new(val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 245)
   def _reduce_128(val, _values, result)
-     result = UnaryMinusNode.new(val[1]) 
+     result = UnaryMinusNode.new(val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 246)
   def _reduce_129(val, _values, result)
-     result = BitwiseNotNode.new(val[1]) 
+     result = BitwiseNotNode.new(val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 247)
   def _reduce_130(val, _values, result)
-     result = LogicalNotNode.new(val[1]) 
+     result = LogicalNotNode.new(val[1])
     result
   end
 .,.,
@@ -2118,7 +2118,7 @@ module_eval(<<'.,.,', 'parser.y', 262)
 
 module_eval(<<'.,.,', 'parser.y', 263)
   def _reduce_137(val, _values, result)
-     result = DivideNode.new(val[0], val[2]) 
+     result = DivideNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2134,21 +2134,21 @@ module_eval(<<'.,.,', 'parser.y', 264)
 
 module_eval(<<'.,.,', 'parser.y', 269)
   def _reduce_140(val, _values, result)
-     result = MultiplyNode.new(val[0], val[2]) 
+     result = MultiplyNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 270)
   def _reduce_141(val, _values, result)
-     result = DivideNode.new(val[0],val[2]) 
+     result = DivideNode.new(val[0],val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 271)
   def _reduce_142(val, _values, result)
-     result = ModulusNode.new(val[0], val[2]) 
+     result = ModulusNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2157,14 +2157,14 @@ module_eval(<<'.,.,', 'parser.y', 271)
 
 module_eval(<<'.,.,', 'parser.y', 276)
   def _reduce_144(val, _values, result)
-     result = AddNode.new(val[0], val[2]) 
+     result = AddNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 277)
   def _reduce_145(val, _values, result)
-     result = SubtractNode.new(val[0], val[2]) 
+     result = SubtractNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2173,14 +2173,14 @@ module_eval(<<'.,.,', 'parser.y', 277)
 
 module_eval(<<'.,.,', 'parser.y', 282)
   def _reduce_147(val, _values, result)
-     result = AddNode.new(val[0], val[2]) 
+     result = AddNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 283)
   def _reduce_148(val, _values, result)
-     result = SubtractNode.new(val[0], val[2]) 
+     result = SubtractNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2189,21 +2189,21 @@ module_eval(<<'.,.,', 'parser.y', 283)
 
 module_eval(<<'.,.,', 'parser.y', 288)
   def _reduce_150(val, _values, result)
-     result = LeftShiftNode.new(val[0], val[2]) 
+     result = LeftShiftNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 289)
   def _reduce_151(val, _values, result)
-     result = RightShiftNode.new(val[0], val[2]) 
+     result = RightShiftNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 290)
   def _reduce_152(val, _values, result)
-     result = UnsignedRightShiftNode.new(val[0], val[2]) 
+     result = UnsignedRightShiftNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2212,21 +2212,21 @@ module_eval(<<'.,.,', 'parser.y', 290)
 
 module_eval(<<'.,.,', 'parser.y', 295)
   def _reduce_154(val, _values, result)
-     result = LeftShiftNode.new(val[0], val[2]) 
+     result = LeftShiftNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 296)
   def _reduce_155(val, _values, result)
-     result = RightShiftNode.new(val[0], val[2]) 
+     result = RightShiftNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 297)
   def _reduce_156(val, _values, result)
-     result = UnsignedRightShiftNode.new(val[0], val[2]) 
+     result = UnsignedRightShiftNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2242,35 +2242,35 @@ module_eval(<<'.,.,', 'parser.y', 302)
 
 module_eval(<<'.,.,', 'parser.y', 303)
   def _reduce_159(val, _values, result)
-     result = GreaterNode.new(val[0], val[2]) 
+     result = GreaterNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 304)
   def _reduce_160(val, _values, result)
-     result = LessOrEqualNode.new(val[0], val[2]) 
+     result = LessOrEqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 305)
   def _reduce_161(val, _values, result)
-     result = GreaterOrEqualNode.new(val[0], val[2]) 
+     result = GreaterOrEqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 306)
   def _reduce_162(val, _values, result)
-     result = InstanceOfNode.new(val[0], val[2]) 
+     result = InstanceOfNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 307)
   def _reduce_163(val, _values, result)
-     result = InNode.new(val[0], val[2]) 
+     result = InNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2286,28 +2286,28 @@ module_eval(<<'.,.,', 'parser.y', 312)
 
 module_eval(<<'.,.,', 'parser.y', 313)
   def _reduce_166(val, _values, result)
-     result = GreaterNode.new(val[0], val[2]) 
+     result = GreaterNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 314)
   def _reduce_167(val, _values, result)
-     result = LessOrEqualNode.new(val[0], val[2]) 
+     result = LessOrEqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 315)
   def _reduce_168(val, _values, result)
-     result = GreaterOrEqualNode.new(val[0], val[2]) 
+     result = GreaterOrEqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 317)
   def _reduce_169(val, _values, result)
-     result = InstanceOfNode.new(val[0], val[2]) 
+     result = InstanceOfNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2316,42 +2316,42 @@ module_eval(<<'.,.,', 'parser.y', 317)
 
 module_eval(<<'.,.,', 'parser.y', 322)
   def _reduce_171(val, _values, result)
-     result = LessNode.new(val[0], val[2]) 
+     result = LessNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 323)
   def _reduce_172(val, _values, result)
-     result = GreaterNode.new(val[0], val[2]) 
+     result = GreaterNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 324)
   def _reduce_173(val, _values, result)
-     result = LessOrEqualNode.new(val[0], val[2]) 
+     result = LessOrEqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 325)
   def _reduce_174(val, _values, result)
-     result = GreaterOrEqualNode.new(val[0], val[2]) 
+     result = GreaterOrEqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 327)
   def _reduce_175(val, _values, result)
-     result = InstanceOfNode.new(val[0], val[2]) 
+     result = InstanceOfNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 328)
   def _reduce_176(val, _values, result)
-     result = InNode.new(val[0], val[2]) 
+     result = InNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2360,28 +2360,28 @@ module_eval(<<'.,.,', 'parser.y', 328)
 
 module_eval(<<'.,.,', 'parser.y', 333)
   def _reduce_178(val, _values, result)
-     result = EqualNode.new(val[0], val[2]) 
+     result = EqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 334)
   def _reduce_179(val, _values, result)
-     result = NotEqualNode.new(val[0], val[2]) 
+     result = NotEqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 335)
   def _reduce_180(val, _values, result)
-     result = StrictEqualNode.new(val[0], val[2]) 
+     result = StrictEqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 336)
   def _reduce_181(val, _values, result)
-     result = NotStrictEqualNode.new(val[0], val[2]) 
+     result = NotStrictEqualNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2390,28 +2390,28 @@ module_eval(<<'.,.,', 'parser.y', 336)
 
 module_eval(<<'.,.,', 'parser.y', 342)
   def _reduce_183(val, _values, result)
-     result = EqualNode.new(val[0], val[2]) 
+     result = EqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 344)
   def _reduce_184(val, _values, result)
-     result = NotEqualNode.new(val[0], val[2]) 
+     result = NotEqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 346)
   def _reduce_185(val, _values, result)
-     result = StrictEqualNode.new(val[0], val[2]) 
+     result = StrictEqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 348)
   def _reduce_186(val, _values, result)
-     result = NotStrictEqualNode.new(val[0], val[2]) 
+     result = NotStrictEqualNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2420,28 +2420,28 @@ module_eval(<<'.,.,', 'parser.y', 348)
 
 module_eval(<<'.,.,', 'parser.y', 354)
   def _reduce_188(val, _values, result)
-     result = EqualNode.new(val[0], val[2]) 
+     result = EqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 355)
   def _reduce_189(val, _values, result)
-     result = NotEqualNode.new(val[0], val[2]) 
+     result = NotEqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 357)
   def _reduce_190(val, _values, result)
-     result = StrictEqualNode.new(val[0], val[2]) 
+     result = StrictEqualNode.new(val[0], val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 359)
   def _reduce_191(val, _values, result)
-     result = NotStrictEqualNode.new(val[0], val[2]) 
+     result = NotStrictEqualNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2450,7 +2450,7 @@ module_eval(<<'.,.,', 'parser.y', 359)
 
 module_eval(<<'.,.,', 'parser.y', 364)
   def _reduce_193(val, _values, result)
-     result = BitAndNode.new(val[0], val[2]) 
+     result = BitAndNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2459,7 +2459,7 @@ module_eval(<<'.,.,', 'parser.y', 364)
 
 module_eval(<<'.,.,', 'parser.y', 370)
   def _reduce_195(val, _values, result)
-     result = BitAndNode.new(val[0], val[2]) 
+     result = BitAndNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2468,7 +2468,7 @@ module_eval(<<'.,.,', 'parser.y', 370)
 
 module_eval(<<'.,.,', 'parser.y', 375)
   def _reduce_197(val, _values, result)
-     result = BitAndNode.new(val[0], val[2]) 
+     result = BitAndNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2477,7 +2477,7 @@ module_eval(<<'.,.,', 'parser.y', 375)
 
 module_eval(<<'.,.,', 'parser.y', 380)
   def _reduce_199(val, _values, result)
-     result = BitXOrNode.new(val[0], val[2]) 
+     result = BitXOrNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2486,7 +2486,7 @@ module_eval(<<'.,.,', 'parser.y', 380)
 
 module_eval(<<'.,.,', 'parser.y', 386)
   def _reduce_201(val, _values, result)
-     result = BitXOrNode.new(val[0], val[2]) 
+     result = BitXOrNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2495,7 +2495,7 @@ module_eval(<<'.,.,', 'parser.y', 386)
 
 module_eval(<<'.,.,', 'parser.y', 392)
   def _reduce_203(val, _values, result)
-     result = BitXOrNode.new(val[0], val[2]) 
+     result = BitXOrNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2504,7 +2504,7 @@ module_eval(<<'.,.,', 'parser.y', 392)
 
 module_eval(<<'.,.,', 'parser.y', 397)
   def _reduce_205(val, _values, result)
-     result = BitOrNode.new(val[0], val[2]) 
+     result = BitOrNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2513,7 +2513,7 @@ module_eval(<<'.,.,', 'parser.y', 397)
 
 module_eval(<<'.,.,', 'parser.y', 403)
   def _reduce_207(val, _values, result)
-     result = BitOrNode.new(val[0], val[2]) 
+     result = BitOrNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2522,7 +2522,7 @@ module_eval(<<'.,.,', 'parser.y', 403)
 
 module_eval(<<'.,.,', 'parser.y', 409)
   def _reduce_209(val, _values, result)
-     result = BitOrNode.new(val[0], val[2]) 
+     result = BitOrNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2531,7 +2531,7 @@ module_eval(<<'.,.,', 'parser.y', 409)
 
 module_eval(<<'.,.,', 'parser.y', 414)
   def _reduce_211(val, _values, result)
-     result = LogicalAndNode.new(val[0], val[2]) 
+     result = LogicalAndNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2540,7 +2540,7 @@ module_eval(<<'.,.,', 'parser.y', 414)
 
 module_eval(<<'.,.,', 'parser.y', 420)
   def _reduce_213(val, _values, result)
-     result = LogicalAndNode.new(val[0], val[2]) 
+     result = LogicalAndNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2549,7 +2549,7 @@ module_eval(<<'.,.,', 'parser.y', 420)
 
 module_eval(<<'.,.,', 'parser.y', 426)
   def _reduce_215(val, _values, result)
-     result = LogicalAndNode.new(val[0], val[2]) 
+     result = LogicalAndNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2558,7 +2558,7 @@ module_eval(<<'.,.,', 'parser.y', 426)
 
 module_eval(<<'.,.,', 'parser.y', 431)
   def _reduce_217(val, _values, result)
-     result = LogicalOrNode.new(val[0], val[2]) 
+     result = LogicalOrNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2567,7 +2567,7 @@ module_eval(<<'.,.,', 'parser.y', 431)
 
 module_eval(<<'.,.,', 'parser.y', 437)
   def _reduce_219(val, _values, result)
-     result = LogicalOrNode.new(val[0], val[2]) 
+     result = LogicalOrNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2576,7 +2576,7 @@ module_eval(<<'.,.,', 'parser.y', 437)
 
 module_eval(<<'.,.,', 'parser.y', 442)
   def _reduce_221(val, _values, result)
-     result = LogicalOrNode.new(val[0], val[2]) 
+     result = LogicalOrNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2586,7 +2586,7 @@ module_eval(<<'.,.,', 'parser.y', 442)
 module_eval(<<'.,.,', 'parser.y', 448)
   def _reduce_223(val, _values, result)
           result = ConditionalNode.new(val[0], val[2], val[4])
-    
+
     result
   end
 .,.,
@@ -2596,7 +2596,7 @@ module_eval(<<'.,.,', 'parser.y', 448)
 module_eval(<<'.,.,', 'parser.y', 455)
   def _reduce_225(val, _values, result)
           result = ConditionalNode.new(val[0], val[2], val[4])
-    
+
     result
   end
 .,.,
@@ -2606,7 +2606,7 @@ module_eval(<<'.,.,', 'parser.y', 455)
 module_eval(<<'.,.,', 'parser.y', 462)
   def _reduce_227(val, _values, result)
           result = ConditionalNode.new(val[0], val[2], val[4])
-    
+
     result
   end
 .,.,
@@ -2616,7 +2616,7 @@ module_eval(<<'.,.,', 'parser.y', 462)
 module_eval(<<'.,.,', 'parser.y', 469)
   def _reduce_229(val, _values, result)
           result = val[1].new(val.first, val.last)
-    
+
     result
   end
 .,.,
@@ -2626,7 +2626,7 @@ module_eval(<<'.,.,', 'parser.y', 469)
 module_eval(<<'.,.,', 'parser.y', 476)
   def _reduce_231(val, _values, result)
           result = val[1].new(val.first, val.last)
-    
+
     result
   end
 .,.,
@@ -2636,91 +2636,91 @@ module_eval(<<'.,.,', 'parser.y', 476)
 module_eval(<<'.,.,', 'parser.y', 483)
   def _reduce_233(val, _values, result)
           result = val[1].new(val.first, val.last)
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 488)
   def _reduce_234(val, _values, result)
-     result = OpEqualNode 
+     result = OpEqualNode
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 489)
   def _reduce_235(val, _values, result)
-     result = OpPlusEqualNode 
+     result = OpPlusEqualNode
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 490)
   def _reduce_236(val, _values, result)
-     result = OpMinusEqualNode 
+     result = OpMinusEqualNode
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 491)
   def _reduce_237(val, _values, result)
-     result = OpMultiplyEqualNode 
+     result = OpMultiplyEqualNode
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 492)
   def _reduce_238(val, _values, result)
-     result = OpDivideEqualNode 
+     result = OpDivideEqualNode
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 493)
   def _reduce_239(val, _values, result)
-     result = OpLShiftEqualNode 
+     result = OpLShiftEqualNode
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 494)
   def _reduce_240(val, _values, result)
-     result = OpRShiftEqualNode 
+     result = OpRShiftEqualNode
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 495)
   def _reduce_241(val, _values, result)
-     result = OpURShiftEqualNode 
+     result = OpURShiftEqualNode
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 496)
   def _reduce_242(val, _values, result)
-     result = OpAndEqualNode 
+     result = OpAndEqualNode
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 497)
   def _reduce_243(val, _values, result)
-     result = OpXOrEqualNode 
+     result = OpXOrEqualNode
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 498)
   def _reduce_244(val, _values, result)
-     result = OpOrEqualNode 
+     result = OpOrEqualNode
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 499)
   def _reduce_245(val, _values, result)
-     result = OpModEqualNode 
+     result = OpModEqualNode
     result
   end
 .,.,
@@ -2729,7 +2729,7 @@ module_eval(<<'.,.,', 'parser.y', 499)
 
 module_eval(<<'.,.,', 'parser.y', 504)
   def _reduce_247(val, _values, result)
-     result = CommaNode.new(val[0], val[2]) 
+     result = CommaNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2738,7 +2738,7 @@ module_eval(<<'.,.,', 'parser.y', 504)
 
 module_eval(<<'.,.,', 'parser.y', 509)
   def _reduce_249(val, _values, result)
-     result = CommaNode.new(val[0], val[2]) 
+     result = CommaNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2747,7 +2747,7 @@ module_eval(<<'.,.,', 'parser.y', 509)
 
 module_eval(<<'.,.,', 'parser.y', 514)
   def _reduce_251(val, _values, result)
-     result = CommaNode.new(val[0], val[2]) 
+     result = CommaNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -2756,7 +2756,7 @@ module_eval(<<'.,.,', 'parser.y', 520)
   def _reduce_252(val, _values, result)
           result = BlockNode.new(val[1])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -2765,7 +2765,7 @@ module_eval(<<'.,.,', 'parser.y', 527)
   def _reduce_253(val, _values, result)
           result = VarStatementNode.new(val[1])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -2775,14 +2775,14 @@ module_eval(<<'.,.,', 'parser.y', 531)
           result = VarStatementNode.new(val[1])
       debug(result)
       yyabort unless allow_auto_semi?(val.last)
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 538)
   def _reduce_255(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
@@ -2790,14 +2790,14 @@ module_eval(<<'.,.,', 'parser.y', 538)
 module_eval(<<'.,.,', 'parser.y', 540)
   def _reduce_256(val, _values, result)
           result = [val.first, val.last].flatten
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 545)
   def _reduce_257(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
@@ -2805,35 +2805,35 @@ module_eval(<<'.,.,', 'parser.y', 545)
 module_eval(<<'.,.,', 'parser.y', 547)
   def _reduce_258(val, _values, result)
           result = [val.first, val.last].flatten
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 552)
   def _reduce_259(val, _values, result)
-     result = VarDeclNode.new(val.first, nil) 
+     result = VarDeclNode.new(val.first, nil)
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 553)
   def _reduce_260(val, _values, result)
-     result = VarDeclNode.new(val.first, val[1]) 
+     result = VarDeclNode.new(val.first, val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 557)
   def _reduce_261(val, _values, result)
-     result = VarDeclNode.new(val[0],nil) 
+     result = VarDeclNode.new(val[0],nil)
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 558)
   def _reduce_262(val, _values, result)
-     result = VarDeclNode.new(val[0], val[1]) 
+     result = VarDeclNode.new(val[0], val[1])
     result
   end
 .,.,
@@ -2842,7 +2842,7 @@ module_eval(<<'.,.,', 'parser.y', 563)
   def _reduce_263(val, _values, result)
           result = ConstStatementNode.new(val[1])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -2852,14 +2852,14 @@ module_eval(<<'.,.,', 'parser.y', 567)
           result = ConstStatementNode.new(val[1])
       debug(result)
       yyerror unless allow_auto_semi?(val.last)
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 574)
   def _reduce_265(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
@@ -2867,42 +2867,42 @@ module_eval(<<'.,.,', 'parser.y', 574)
 module_eval(<<'.,.,', 'parser.y', 576)
   def _reduce_266(val, _values, result)
           result = [val.first, val.last].flatten
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 581)
   def _reduce_267(val, _values, result)
-     result = VarDeclNode.new(val[0], nil, true) 
+     result = VarDeclNode.new(val[0], nil, true)
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 582)
   def _reduce_268(val, _values, result)
-     result = VarDeclNode.new(val[0], val[1], true) 
+     result = VarDeclNode.new(val[0], val[1], true)
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 586)
   def _reduce_269(val, _values, result)
-     result = AssignExprNode.new(val[1]) 
+     result = AssignExprNode.new(val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 590)
   def _reduce_270(val, _values, result)
-     result = AssignExprNode.new(val[1]) 
+     result = AssignExprNode.new(val[1])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 594)
   def _reduce_271(val, _values, result)
-     result = EmptyStatementNode.new(val[0]) 
+     result = EmptyStatementNode.new(val[0])
     result
   end
 .,.,
@@ -2911,7 +2911,7 @@ module_eval(<<'.,.,', 'parser.y', 599)
   def _reduce_272(val, _values, result)
           result = ExpressionStatementNode.new(val.first)
       debug(result)
-    
+
     result
   end
 .,.,
@@ -2921,7 +2921,7 @@ module_eval(<<'.,.,', 'parser.y', 603)
           result = ExpressionStatementNode.new(val.first)
       debug(result)
       raise RKelly::SyntaxError unless allow_auto_semi?(val.last)
-    
+
     result
   end
 .,.,
@@ -2930,7 +2930,7 @@ module_eval(<<'.,.,', 'parser.y', 611)
   def _reduce_274(val, _values, result)
           result = IfNode.new(val[2], val[4])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -2939,7 +2939,7 @@ module_eval(<<'.,.,', 'parser.y', 615)
   def _reduce_275(val, _values, result)
           result = IfNode.new(val[2], val[4], val[6])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -2948,7 +2948,7 @@ module_eval(<<'.,.,', 'parser.y', 622)
   def _reduce_276(val, _values, result)
           result = DoWhileNode.new(val[1], val[4])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -2957,7 +2957,7 @@ module_eval(<<'.,.,', 'parser.y', 626)
   def _reduce_277(val, _values, result)
           result = DoWhileNode.new(val[1], val[4])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -2966,7 +2966,7 @@ module_eval(<<'.,.,', 'parser.y', 630)
   def _reduce_278(val, _values, result)
           result = WhileNode.new(val[2], val[4])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -2975,7 +2975,7 @@ module_eval(<<'.,.,', 'parser.y', 634)
   def _reduce_279(val, _values, result)
           result = ForNode.new(val[2], val[4], val[6], val[8])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -2984,7 +2984,7 @@ module_eval(<<'.,.,', 'parser.y', 639)
   def _reduce_280(val, _values, result)
           result = ForNode.new(VarStatementNode.new(val[3]), val[5], val[7], val[9])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -2994,7 +2994,7 @@ module_eval(<<'.,.,', 'parser.y', 643)
           #yyabort if (!n.isLocation())
       result = ForInNode.new(val[2], val[4], val[6])
       debug(result);
-    
+
     result
   end
 .,.,
@@ -3004,7 +3004,7 @@ module_eval(<<'.,.,', 'parser.y', 648)
           result = ForInNode.new(
         VarDeclNode.new(val[3], nil), val[5], val[7])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3015,14 +3015,14 @@ module_eval(<<'.,.,', 'parser.y', 653)
         VarDeclNode.new(val[3], val[4]), val[6], val[8]
       )
       debug(result)
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 661)
   def _reduce_284(val, _values, result)
-     result = nil 
+     result = nil
     result
   end
 .,.,
@@ -3031,7 +3031,7 @@ module_eval(<<'.,.,', 'parser.y', 661)
 
 module_eval(<<'.,.,', 'parser.y', 666)
   def _reduce_286(val, _values, result)
-     result = nil 
+     result = nil
     result
   end
 .,.,
@@ -3042,7 +3042,7 @@ module_eval(<<'.,.,', 'parser.y', 672)
   def _reduce_288(val, _values, result)
           result = ContinueNode.new(nil)
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3052,7 +3052,7 @@ module_eval(<<'.,.,', 'parser.y', 676)
           result = ContinueNode.new(nil)
       debug(result)
       yyabort unless allow_auto_semi?(val[1])
-    
+
     result
   end
 .,.,
@@ -3061,7 +3061,7 @@ module_eval(<<'.,.,', 'parser.y', 681)
   def _reduce_290(val, _values, result)
           result = ContinueNode.new(val[1])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3071,7 +3071,7 @@ module_eval(<<'.,.,', 'parser.y', 685)
           result = ContinueNode.new(val[1])
       debug(result)
       yyabort unless allow_auto_semi?(val[2])
-    
+
     result
   end
 .,.,
@@ -3080,7 +3080,7 @@ module_eval(<<'.,.,', 'parser.y', 693)
   def _reduce_292(val, _values, result)
           result = BreakNode.new(nil)
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3090,7 +3090,7 @@ module_eval(<<'.,.,', 'parser.y', 697)
           result = BreakNode.new(nil)
       debug(result)
       yyabort unless allow_auto_semi?(val[1])
-    
+
     result
   end
 .,.,
@@ -3099,7 +3099,7 @@ module_eval(<<'.,.,', 'parser.y', 702)
   def _reduce_294(val, _values, result)
           result = BreakNode.new(val[1])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3109,7 +3109,7 @@ module_eval(<<'.,.,', 'parser.y', 706)
           result = BreakNode.new(val[1])
       debug(result)
       yyabort unless allow_auto_semi?(val[2])
-    
+
     result
   end
 .,.,
@@ -3118,7 +3118,7 @@ module_eval(<<'.,.,', 'parser.y', 714)
   def _reduce_296(val, _values, result)
           result = ReturnNode.new(nil)
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3128,7 +3128,7 @@ module_eval(<<'.,.,', 'parser.y', 718)
           result = ReturnNode.new(nil)
       debug(result)
       yyabort unless allow_auto_semi?(val[1])
-    
+
     result
   end
 .,.,
@@ -3137,7 +3137,7 @@ module_eval(<<'.,.,', 'parser.y', 723)
   def _reduce_298(val, _values, result)
           result = ReturnNode.new(val[1])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3147,7 +3147,7 @@ module_eval(<<'.,.,', 'parser.y', 727)
           result = ReturnNode.new(val[1])
       debug(result)
       yyabort unless allow_auto_semi?(val[2])
-    
+
     result
   end
 .,.,
@@ -3156,7 +3156,7 @@ module_eval(<<'.,.,', 'parser.y', 735)
   def _reduce_300(val, _values, result)
           result = WithNode.new(val[2], val[4])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3165,14 +3165,14 @@ module_eval(<<'.,.,', 'parser.y', 742)
   def _reduce_301(val, _values, result)
           result = SwitchNode.new(val[2], val[4])
       debug(result)
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 748)
   def _reduce_302(val, _values, result)
-     result = CaseBlockNode.new(val[1]) 
+     result = CaseBlockNode.new(val[1])
     result
   end
 .,.,
@@ -3180,14 +3180,14 @@ module_eval(<<'.,.,', 'parser.y', 748)
 module_eval(<<'.,.,', 'parser.y', 750)
   def _reduce_303(val, _values, result)
           result = CaseBlockNode.new([val[1], val[2], val[3]].flatten)
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 755)
   def _reduce_304(val, _values, result)
-     result = [] 
+     result = []
     result
   end
 .,.,
@@ -3196,14 +3196,14 @@ module_eval(<<'.,.,', 'parser.y', 755)
 
 module_eval(<<'.,.,', 'parser.y', 760)
   def _reduce_306(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 761)
   def _reduce_307(val, _values, result)
-     result = val.flatten 
+     result = val.flatten
     result
   end
 .,.,
@@ -3211,7 +3211,7 @@ module_eval(<<'.,.,', 'parser.y', 761)
 module_eval(<<'.,.,', 'parser.y', 766)
   def _reduce_308(val, _values, result)
           result = CaseClauseNode.new(val[1], val[3])
-    
+
     result
   end
 .,.,
@@ -3219,14 +3219,14 @@ module_eval(<<'.,.,', 'parser.y', 766)
 module_eval(<<'.,.,', 'parser.y', 772)
   def _reduce_309(val, _values, result)
           result = CaseClauseNode.new(nil, val[2])
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 777)
   def _reduce_310(val, _values, result)
-     result = LabelNode.new(val[0], val[2]) 
+     result = LabelNode.new(val[0], val[2])
     result
   end
 .,.,
@@ -3235,7 +3235,7 @@ module_eval(<<'.,.,', 'parser.y', 782)
   def _reduce_311(val, _values, result)
           result = ThrowNode.new(val[1])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3245,7 +3245,7 @@ module_eval(<<'.,.,', 'parser.y', 786)
           result = ThrowNode.new(val[1])
       debug(result)
       yyabort unless allow_auto_semi?(val[2])
-    
+
     result
   end
 .,.,
@@ -3254,7 +3254,7 @@ module_eval(<<'.,.,', 'parser.y', 794)
   def _reduce_313(val, _values, result)
           result = TryNode.new(val[1], nil, nil, val[3])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3263,7 +3263,7 @@ module_eval(<<'.,.,', 'parser.y', 798)
   def _reduce_314(val, _values, result)
           result = TryNode.new(val[1], val[4], val[6])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3272,7 +3272,7 @@ module_eval(<<'.,.,', 'parser.y', 802)
   def _reduce_315(val, _values, result)
           result = TryNode.new(val[1], val[4], val[6], val[8])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3281,7 +3281,7 @@ module_eval(<<'.,.,', 'parser.y', 809)
   def _reduce_316(val, _values, result)
           result = EmptyStatementNode.new(val[0])
       debug(result)
-    
+
     result
   end
 .,.,
@@ -3291,7 +3291,7 @@ module_eval(<<'.,.,', 'parser.y', 813)
           result = EmptyStatementNode.new(val[0])
       debug(result)
       yyabort unless allow_auto_semi?(val[1])
-    
+
     result
   end
 .,.,
@@ -3300,7 +3300,7 @@ module_eval(<<'.,.,', 'parser.y', 821)
   def _reduce_318(val, _values, result)
           result = FunctionDeclNode.new(val[1], val[4])
       debug(val[5])
-    
+
     result
   end
 .,.,
@@ -3309,7 +3309,7 @@ module_eval(<<'.,.,', 'parser.y', 825)
   def _reduce_319(val, _values, result)
           result = FunctionDeclNode.new(val[1], val[5], val[3])
       debug(val[6])
-    
+
     result
   end
 .,.,
@@ -3318,7 +3318,7 @@ module_eval(<<'.,.,', 'parser.y', 832)
   def _reduce_320(val, _values, result)
           result = FunctionExprNode.new(val[0], val[3])
       debug(val[4])
-    
+
     result
   end
 .,.,
@@ -3327,7 +3327,7 @@ module_eval(<<'.,.,', 'parser.y', 836)
   def _reduce_321(val, _values, result)
           result = FunctionExprNode.new(val[0], val[4], val[2])
       debug(val[5])
-    
+
     result
   end
 .,.,
@@ -3336,7 +3336,7 @@ module_eval(<<'.,.,', 'parser.y', 840)
   def _reduce_322(val, _values, result)
           result = FunctionExprNode.new(val[1], val[4])
       debug(val[5])
-    
+
     result
   end
 .,.,
@@ -3345,14 +3345,14 @@ module_eval(<<'.,.,', 'parser.y', 844)
   def _reduce_323(val, _values, result)
           result = FunctionExprNode.new(val[1], val[5], val[3])
       debug(val[6])
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 850)
   def _reduce_324(val, _values, result)
-     result = [ParameterNode.new(val[0])] 
+     result = [ParameterNode.new(val[0])]
     result
   end
 .,.,
@@ -3360,14 +3360,14 @@ module_eval(<<'.,.,', 'parser.y', 850)
 module_eval(<<'.,.,', 'parser.y', 852)
   def _reduce_325(val, _values, result)
           result = [val.first, ParameterNode.new(val.last)].flatten
-    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'parser.y', 857)
   def _reduce_326(val, _values, result)
-     result = FunctionBodyNode.new(val[1]) 
+     result = FunctionBodyNode.new(val[1])
     result
   end
 .,.,
@@ -3377,4 +3377,4 @@ def _reduce_none(val, _values, result)
 end
 
   end   # class GeneratedParser
-  end   # module RKelly
+end   # module RKelly