racc 1.4.15 → 1.4.16

data/test/regress/php_serialization

@@ -1,7 +1,7 @@
 #
 # DO NOT MODIFY!!!!
-# This file is automatically generated by Racc 1.4.14
-# from Racc grammer file "".
+# This file is automatically generated by Racc 1.4.16.pre.1
+# from Racc grammar file "".
 #
 
 require 'racc/parser.rb'
@@ -181,84 +181,84 @@ Racc_debug_parser = false
 
 module_eval(<<'.,.,', 'php_serialization.y', 6)
   def _reduce_1(val, _values, result)
-     @object = val[0] 
+     @object = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 7)
   def _reduce_2(val, _values, result)
-     @object = val[0] 
+     @object = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 8)
   def _reduce_3(val, _values, result)
-     @object = val[0] 
+     @object = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 9)
   def _reduce_4(val, _values, result)
-     @object = val[0] 
+     @object = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 10)
   def _reduce_5(val, _values, result)
-     @object = val[0] 
+     @object = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 11)
   def _reduce_6(val, _values, result)
-     @object = val[0] 
+     @object = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 12)
   def _reduce_7(val, _values, result)
-     @object = val[0] 
+     @object = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 15)
   def _reduce_8(val, _values, result)
-     result = nil 
+     result = nil
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 18)
   def _reduce_9(val, _values, result)
-     result = Integer(val[2]) > 0 
+     result = Integer(val[2]) > 0
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 21)
   def _reduce_10(val, _values, result)
-     result = Integer(val[2]) 
+     result = Integer(val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 24)
   def _reduce_11(val, _values, result)
-     result = Float(val[2]) 
+     result = Float(val[2])
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 27)
   def _reduce_12(val, _values, result)
-     result = val[4] 
+     result = val[4]
     result
   end
 .,.,
@@ -286,28 +286,28 @@ module_eval(<<'.,.,', 'php_serialization.y', 32)
                         result = Struct.new(klass_name, *attr_names).new(*values)
                         result.instance_variable_set("@_php_class", klass_name)
                       end
-                    
+
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 56)
   def _reduce_14(val, _values, result)
-     result = val[0] << val[1] 
+     result = val[0] << val[1]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 57)
   def _reduce_15(val, _values, result)
-     result = [] 
+     result = []
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'php_serialization.y', 60)
   def _reduce_16(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
@@ -323,7 +323,7 @@ module_eval(<<'.,.,', 'php_serialization.y', 65)
                       else
                         result = Hash[val[5]]
                       end
-                    
+
     result
   end
 .,.,
@@ -333,4 +333,4 @@ def _reduce_none(val, _values, result)
 end
 
   end   # class Unserializer
-  end   # module PhpSerialization
+end   # module PhpSerialization

data/test/regress/riml

@@ -1,7 +1,7 @@
 #
 # DO NOT MODIFY!!!!
-# This file is automatically generated by Racc 1.4.14
-# from Racc grammer file "".
+# This file is automatically generated by Racc 1.4.16.pre.1
+# from Racc grammar file "".
 #
 
 require 'racc/parser.rb'
@@ -1485,1806 +1485,1806 @@ Racc_debug_parser = false
 
 module_eval(<<'.,.,', 'riml.y', 61)
   def _reduce_1(val, _values, result)
-     result = make_node(val) { |_| Riml::Nodes.new([]) } 
+     result = make_node(val) { |_| Riml::Nodes.new([]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 62)
   def _reduce_2(val, _values, result)
-     result = make_node(val) { |_| Riml::Nodes.new([]) } 
+     result = make_node(val) { |_| Riml::Nodes.new([]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 63)
   def _reduce_3(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 68)
   def _reduce_4(val, _values, result)
-     result = make_node(val) { |v| Riml::Nodes.new([ v[0] ]) } 
+     result = make_node(val) { |v| Riml::Nodes.new([ v[0] ]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 69)
   def _reduce_5(val, _values, result)
-     result = val[0] << val[2] 
+     result = val[0] << val[2]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 70)
   def _reduce_6(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 71)
   def _reduce_7(val, _values, result)
-     result = make_node(val) { |v| Riml::Nodes.new(v[1]) } 
+     result = make_node(val) { |v| Riml::Nodes.new(v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 76)
   def _reduce_8(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 77)
   def _reduce_9(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 78)
   def _reduce_10(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 79)
   def _reduce_11(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 80)
   def _reduce_12(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 81)
   def _reduce_13(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 82)
   def _reduce_14(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 83)
   def _reduce_15(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 84)
   def _reduce_16(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 85)
   def _reduce_17(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 86)
   def _reduce_18(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 87)
   def _reduce_19(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 88)
   def _reduce_20(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 89)
   def _reduce_21(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 90)
   def _reduce_22(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 91)
   def _reduce_23(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 92)
   def _reduce_24(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 93)
   def _reduce_25(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 97)
   def _reduce_26(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 98)
   def _reduce_27(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 99)
   def _reduce_28(val, _values, result)
-     result = make_node(val) { |v| Riml::DictGetDotNode.new(v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::DictGetDotNode.new(v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 100)
   def _reduce_29(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 101)
   def _reduce_30(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 102)
   def _reduce_31(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 103)
   def _reduce_32(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 104)
   def _reduce_33(val, _values, result)
-     result = make_node(val) { |v| Riml::WrapInParensNode.new(v[1]) } 
+     result = make_node(val) { |v| Riml::WrapInParensNode.new(v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 108)
   def _reduce_34(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 109)
   def _reduce_35(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 110)
   def _reduce_36(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 111)
   def _reduce_37(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 112)
   def _reduce_38(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 113)
   def _reduce_39(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 114)
   def _reduce_40(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 115)
   def _reduce_41(val, _values, result)
-     result = make_node(val) { |v| Riml::WrapInParensNode.new(v[1]) } 
+     result = make_node(val) { |v| Riml::WrapInParensNode.new(v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 120)
   def _reduce_42(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 121)
   def _reduce_43(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 122)
   def _reduce_44(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 123)
   def _reduce_45(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 124)
   def _reduce_46(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 125)
   def _reduce_47(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 126)
   def _reduce_48(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 130)
   def _reduce_49(val, _values, result)
-     result = nil 
+     result = nil
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 131)
   def _reduce_50(val, _values, result)
-     result = nil 
+     result = nil
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 135)
   def _reduce_51(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 136)
   def _reduce_52(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 137)
   def _reduce_53(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 138)
   def _reduce_54(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 139)
   def _reduce_55(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 140)
   def _reduce_56(val, _values, result)
-     result = make_node(val) { |_| Riml::TrueNode.new } 
+     result = make_node(val) { |_| Riml::TrueNode.new }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 141)
   def _reduce_57(val, _values, result)
-     result = make_node(val) { |_| Riml::FalseNode.new } 
+     result = make_node(val) { |_| Riml::FalseNode.new }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 145)
   def _reduce_58(val, _values, result)
-     result = make_node(val) { |v| Riml::NumberNode.new(v[0]) } 
+     result = make_node(val) { |v| Riml::NumberNode.new(v[0]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 149)
   def _reduce_59(val, _values, result)
-     result = make_node(val) { |v| Riml::StringNode.new(v[0], :s) } 
+     result = make_node(val) { |v| Riml::StringNode.new(v[0], :s) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 150)
   def _reduce_60(val, _values, result)
-     result = make_node(val) { |v| Riml::StringNode.new(v[0], :d) } 
+     result = make_node(val) { |v| Riml::StringNode.new(v[0], :d) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 151)
   def _reduce_61(val, _values, result)
-     result = make_node(val) { |v| Riml::StringLiteralConcatNode.new(v[0], Riml::StringNode.new(v[1], :s)) } 
+     result = make_node(val) { |v| Riml::StringLiteralConcatNode.new(v[0], Riml::StringNode.new(v[1], :s)) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 152)
   def _reduce_62(val, _values, result)
-     result = make_node(val) { |v| Riml::StringLiteralConcatNode.new(v[0], Riml::StringNode.new(v[1], :d)) } 
+     result = make_node(val) { |v| Riml::StringLiteralConcatNode.new(v[0], Riml::StringNode.new(v[1], :d)) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 156)
   def _reduce_63(val, _values, result)
-     result = make_node(val) { |v| Riml::RegexpNode.new(v[0]) } 
+     result = make_node(val) { |v| Riml::RegexpNode.new(v[0]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 160)
   def _reduce_64(val, _values, result)
-     result = make_node(val) { |v| Riml::ScopeModifierLiteralNode.new(v[0]) } 
+     result = make_node(val) { |v| Riml::ScopeModifierLiteralNode.new(v[0]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 164)
   def _reduce_65(val, _values, result)
-     result = make_node(val) { |v| Riml::ListNode.new(v[0]) } 
+     result = make_node(val) { |v| Riml::ListNode.new(v[0]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 168)
   def _reduce_66(val, _values, result)
-     result = make_node(val) { |v| Riml::ListUnpackNode.new(v[1] << v[3]) } 
+     result = make_node(val) { |v| Riml::ListUnpackNode.new(v[1] << v[3]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 172)
   def _reduce_67(val, _values, result)
-     result = val[1] 
+     result = val[1]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 173)
   def _reduce_68(val, _values, result)
-     result = val[1] 
+     result = val[1]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 177)
   def _reduce_69(val, _values, result)
-     result = [] 
+     result = []
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 178)
   def _reduce_70(val, _values, result)
-     result = [val[0]] 
+     result = [val[0]]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 179)
   def _reduce_71(val, _values, result)
-     result = val[0] << val[2] 
+     result = val[0] << val[2]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 183)
   def _reduce_72(val, _values, result)
-     result = make_node(val) { |v| Riml::DictionaryNode.new(v[0]) } 
+     result = make_node(val) { |v| Riml::DictionaryNode.new(v[0]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 190)
   def _reduce_73(val, _values, result)
-     result = val[1] 
+     result = val[1]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 191)
   def _reduce_74(val, _values, result)
-     result = val[1] 
+     result = val[1]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 196)
   def _reduce_75(val, _values, result)
-     result = [] 
+     result = []
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 197)
   def _reduce_76(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 198)
   def _reduce_77(val, _values, result)
-     result = val[0] << val[2] 
+     result = val[0] << val[2]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 203)
   def _reduce_78(val, _values, result)
-     result = [val[0], val[2]] 
+     result = [val[0], val[2]]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 207)
   def _reduce_79(val, _values, result)
-     result = make_node(val) { |v| Riml::DictGetDotNode.new(v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::DictGetDotNode.new(v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 208)
   def _reduce_80(val, _values, result)
-     result = make_node(val) { |v| Riml::DictGetDotNode.new(v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::DictGetDotNode.new(v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 209)
   def _reduce_81(val, _values, result)
-     result = make_node(val) { |v| Riml::DictGetDotNode.new(v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::DictGetDotNode.new(v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 210)
   def _reduce_82(val, _values, result)
-     result = make_node(val) { |v| Riml::DictGetDotNode.new(Riml::WrapInParensNode.new(v[1]), v[3]) } 
+     result = make_node(val) { |v| Riml::DictGetDotNode.new(Riml::WrapInParensNode.new(v[1]), v[3]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 214)
   def _reduce_83(val, _values, result)
-     result = make_node(val) { |v| Riml::ListOrDictGetNode.new(v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::ListOrDictGetNode.new(v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 215)
   def _reduce_84(val, _values, result)
-     result = make_node(val) { |v| Riml::ListOrDictGetNode.new(Riml::WrapInParensNode.new(v[1]), v[3]) } 
+     result = make_node(val) { |v| Riml::ListOrDictGetNode.new(Riml::WrapInParensNode.new(v[1]), v[3]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 219)
   def _reduce_85(val, _values, result)
-     result = make_node(val) { |v| Riml::ListOrDictGetNode.new(v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::ListOrDictGetNode.new(v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 223)
   def _reduce_86(val, _values, result)
-     result = [val[1]] 
+     result = [val[1]]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 224)
   def _reduce_87(val, _values, result)
-     result = [val[1]] 
+     result = [val[1]]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 225)
   def _reduce_88(val, _values, result)
-     result = val[0] << val[2] 
+     result = val[0] << val[2]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 226)
   def _reduce_89(val, _values, result)
-     result = val[0] << val[2] 
+     result = val[0] << val[2]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 230)
   def _reduce_90(val, _values, result)
-     result = make_node(val) { |v| Riml::SublistNode.new([v[0], Riml::LiteralNode.new(' : '), v[2]]) } 
+     result = make_node(val) { |v| Riml::SublistNode.new([v[0], Riml::LiteralNode.new(' : '), v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 231)
   def _reduce_91(val, _values, result)
-     result = make_node(val) { |v| Riml::SublistNode.new([v[0], Riml::LiteralNode.new(' :')]) } 
+     result = make_node(val) { |v| Riml::SublistNode.new([v[0], Riml::LiteralNode.new(' :')]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 232)
   def _reduce_92(val, _values, result)
-     result = make_node(val) { |v| Riml::SublistNode.new([Riml::LiteralNode.new(': '), v[1]]) } 
+     result = make_node(val) { |v| Riml::SublistNode.new([Riml::LiteralNode.new(': '), v[1]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 233)
   def _reduce_93(val, _values, result)
-     result = make_node(val) { |_| Riml::SublistNode.new([Riml::LiteralNode.new(':')]) } 
+     result = make_node(val) { |_| Riml::SublistNode.new([Riml::LiteralNode.new(':')]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 237)
   def _reduce_94(val, _values, result)
-     result = [val[0]] 
+     result = [val[0]]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 238)
   def _reduce_95(val, _values, result)
-     result = val[0] << val[1] 
+     result = val[0] << val[1]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 242)
   def _reduce_96(val, _values, result)
-     result = [val[1]] 
+     result = [val[1]]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 243)
   def _reduce_97(val, _values, result)
-     result = val[0] << val[1] 
+     result = val[0] << val[1]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 247)
   def _reduce_98(val, _values, result)
-     result = make_node(val) { |v| Riml::CallNode.new(v[0], v[1], v[3]) } 
+     result = make_node(val) { |v| Riml::CallNode.new(v[0], v[1], v[3]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 248)
   def _reduce_99(val, _values, result)
-     result = make_node(val) { |v| Riml::CallNode.new(nil, v[0], v[2]) } 
+     result = make_node(val) { |v| Riml::CallNode.new(nil, v[0], v[2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 249)
   def _reduce_100(val, _values, result)
-     result = make_node(val) { |v| Riml::CallNode.new(nil, v[0], v[2]) } 
+     result = make_node(val) { |v| Riml::CallNode.new(nil, v[0], v[2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 250)
   def _reduce_101(val, _values, result)
-     result = make_node(val) { |v| Riml::CallNode.new(nil, v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::CallNode.new(nil, v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 251)
   def _reduce_102(val, _values, result)
-     result = make_node(val) { |v| Riml::CallNode.new(nil, v[0], []) } 
+     result = make_node(val) { |v| Riml::CallNode.new(nil, v[0], []) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 252)
   def _reduce_103(val, _values, result)
-     result = make_node(val) { |v| Riml::ExplicitCallNode.new(nil, nil, v[2]) } 
+     result = make_node(val) { |v| Riml::ExplicitCallNode.new(nil, nil, v[2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 256)
   def _reduce_104(val, _values, result)
-     result = make_node(val) { |v| Riml::CallNode.new(v[0], v[1], v[3]) } 
+     result = make_node(val) { |v| Riml::CallNode.new(v[0], v[1], v[3]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 257)
   def _reduce_105(val, _values, result)
-     result = make_node(val) { |v| Riml::CallNode.new(v[0], v[1], []) } 
+     result = make_node(val) { |v| Riml::CallNode.new(v[0], v[1], []) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 261)
   def _reduce_106(val, _values, result)
-     result = make_node(val) { |v| Riml::RimlFileCommandNode.new(nil, v[0], v[2]) } 
+     result = make_node(val) { |v| Riml::RimlFileCommandNode.new(nil, v[0], v[2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 262)
   def _reduce_107(val, _values, result)
-     result = make_node(val) { |v| Riml::RimlFileCommandNode.new(nil, v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::RimlFileCommandNode.new(nil, v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 266)
   def _reduce_108(val, _values, result)
-     result = make_node(val) { |v| Riml::RimlClassCommandNode.new(nil, v[0], v[2]) } 
+     result = make_node(val) { |v| Riml::RimlClassCommandNode.new(nil, v[0], v[2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 267)
   def _reduce_109(val, _values, result)
-     result = make_node(val) { |v| Riml::RimlClassCommandNode.new(nil, v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::RimlClassCommandNode.new(nil, v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 271)
   def _reduce_110(val, _values, result)
-     result = ["#{val[0]}#{val[1]}"] 
+     result = ["#{val[0]}#{val[1]}"]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 272)
   def _reduce_111(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 273)
   def _reduce_112(val, _values, result)
-     result = val[0].concat ["#{val[2]}#{val[3]}"] 
+     result = val[0].concat ["#{val[2]}#{val[3]}"]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 277)
   def _reduce_113(val, _values, result)
-     result = make_node(val) { |v| Riml::ExplicitCallNode.new(v[1], v[2], v[4]) } 
+     result = make_node(val) { |v| Riml::ExplicitCallNode.new(v[1], v[2], v[4]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 278)
   def _reduce_114(val, _values, result)
-     result = make_node(val) { |v| Riml::ExplicitCallNode.new(nil, v[1], v[3]) } 
+     result = make_node(val) { |v| Riml::ExplicitCallNode.new(nil, v[1], v[3]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 282)
   def _reduce_115(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 283)
   def _reduce_116(val, _values, result)
-     result = nil 
+     result = nil
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 288)
   def _reduce_117(val, _values, result)
-     result = [ nil, val[0] ] 
+     result = [ nil, val[0] ]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 289)
   def _reduce_118(val, _values, result)
-     result = [ make_node(val) { |v| Riml::SIDNode.new(v[1]) }, val[3] ] 
+     result = [ make_node(val) { |v| Riml::SIDNode.new(v[1]) }, val[3] ]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 293)
   def _reduce_119(val, _values, result)
-     result = [] 
+     result = []
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 294)
   def _reduce_120(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 298)
   def _reduce_121(val, _values, result)
-     result = [] 
+     result = []
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 299)
   def _reduce_122(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 303)
   def _reduce_123(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 304)
   def _reduce_124(val, _values, result)
-     result = [ make_node(val) { |v| Riml::SplatNode.new(v[1]) } ] 
+     result = [ make_node(val) { |v| Riml::SplatNode.new(v[1]) } ]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 305)
   def _reduce_125(val, _values, result)
-     result = val[0] << val[2] 
+     result = val[0] << val[2]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 306)
   def _reduce_126(val, _values, result)
-     result = val[0] << make_node(val) { |v| Riml::SplatNode.new(v[3]) } 
+     result = val[0] << make_node(val) { |v| Riml::SplatNode.new(v[3]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 310)
   def _reduce_127(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 311)
   def _reduce_128(val, _values, result)
-     result = val[0] << val[2] 
+     result = val[0] << val[2]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 315)
   def _reduce_129(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 316)
   def _reduce_130(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 318)
   def _reduce_131(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 319)
   def _reduce_132(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 320)
   def _reduce_133(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 323)
   def _reduce_134(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 325)
   def _reduce_135(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 326)
   def _reduce_136(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 327)
   def _reduce_137(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 329)
   def _reduce_138(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 330)
   def _reduce_139(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 331)
   def _reduce_140(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 333)
   def _reduce_141(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 334)
   def _reduce_142(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 335)
   def _reduce_143(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 337)
   def _reduce_144(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 338)
   def _reduce_145(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 339)
   def _reduce_146(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 341)
   def _reduce_147(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 342)
   def _reduce_148(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 343)
   def _reduce_149(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 345)
   def _reduce_150(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 346)
   def _reduce_151(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 347)
   def _reduce_152(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 349)
   def _reduce_153(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 350)
   def _reduce_154(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 351)
   def _reduce_155(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 353)
   def _reduce_156(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 354)
   def _reduce_157(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 355)
   def _reduce_158(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 356)
   def _reduce_159(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 357)
   def _reduce_160(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 358)
   def _reduce_161(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 360)
   def _reduce_162(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 361)
   def _reduce_163(val, _values, result)
-     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::BinaryOperatorNode.new(v[1], [v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 365)
   def _reduce_164(val, _values, result)
-     result = make_node(val) { |v| Riml::UnaryOperatorNode.new(val[0], [val[1]]) } 
+     result = make_node(val) { |v| Riml::UnaryOperatorNode.new(val[0], [val[1]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 366)
   def _reduce_165(val, _values, result)
-     result = make_node(val) { |v| Riml::UnaryOperatorNode.new(val[0], [val[1]]) } 
+     result = make_node(val) { |v| Riml::UnaryOperatorNode.new(val[0], [val[1]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 367)
   def _reduce_166(val, _values, result)
-     result = make_node(val) { |v| Riml::UnaryOperatorNode.new(val[0], [val[1]]) } 
+     result = make_node(val) { |v| Riml::UnaryOperatorNode.new(val[0], [val[1]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 372)
   def _reduce_167(val, _values, result)
-     result = make_node(val) { |v| Riml::AssignNode.new(v[1][0], v[1][1], v[1][2]) } 
+     result = make_node(val) { |v| Riml::AssignNode.new(v[1][0], v[1][1], v[1][2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 373)
   def _reduce_168(val, _values, result)
-     result = make_node(val) { |v| Riml::AssignNode.new(v[0][0], v[0][1], v[0][2]) } 
+     result = make_node(val) { |v| Riml::AssignNode.new(v[0][0], v[0][1], v[0][2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 377)
   def _reduce_169(val, _values, result)
-     result = make_node(val) { |v| Riml::MultiAssignNode.new([v[0], v[2]]) } 
+     result = make_node(val) { |v| Riml::MultiAssignNode.new([v[0], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 378)
   def _reduce_170(val, _values, result)
-     val[0].assigns << val[2]; result = val[0] 
+     val[0].assigns << val[2]; result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 383)
   def _reduce_171(val, _values, result)
-     result = [val[1], val[0], val[2]] 
+     result = [val[1], val[0], val[2]]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 384)
   def _reduce_172(val, _values, result)
-     result = [val[1], val[0], val[2]] 
+     result = [val[1], val[0], val[2]]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 385)
   def _reduce_173(val, _values, result)
-     result = [val[1], val[0], val[2]] 
+     result = [val[1], val[0], val[2]]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 386)
   def _reduce_174(val, _values, result)
-     result = [val[1], val[0], val[2]] 
+     result = [val[1], val[0], val[2]]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 390)
   def _reduce_175(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 391)
   def _reduce_176(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 392)
   def _reduce_177(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 393)
   def _reduce_178(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 394)
   def _reduce_179(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 399)
   def _reduce_180(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 400)
   def _reduce_181(val, _values, result)
-     result = make_node(val) { |v| Riml::GetSpecialVariableNode.new(v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::GetSpecialVariableNode.new(v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 401)
   def _reduce_182(val, _values, result)
-     result = make_node(val) { |v| Riml::GetVariableByScopeAndDictNameNode.new(v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::GetVariableByScopeAndDictNameNode.new(v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 405)
   def _reduce_183(val, _values, result)
-     result = make_node(val) { |v| Riml::GetVariableNode.new(v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::GetVariableNode.new(v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 409)
   def _reduce_184(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 410)
   def _reduce_185(val, _values, result)
-     result = make_node(val) { |v| Riml::GetCurlyBraceNameNode.new(v[0], v[1]) } 
+     result = make_node(val) { |v| Riml::GetCurlyBraceNameNode.new(v[0], v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 414)
   def _reduce_186(val, _values, result)
-     result = make_node(val) { |v| Riml::UnletVariableNode.new('!', [ v[1] ]) } 
+     result = make_node(val) { |v| Riml::UnletVariableNode.new('!', [ v[1] ]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 415)
   def _reduce_187(val, _values, result)
-     result = make_node(val) { |v| Riml::UnletVariableNode.new('!', [ v[1] ]) } 
+     result = make_node(val) { |v| Riml::UnletVariableNode.new('!', [ v[1] ]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 416)
   def _reduce_188(val, _values, result)
-     result = val[0] << val[1] 
+     result = val[0] << val[1]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 420)
   def _reduce_189(val, _values, result)
-     result = make_node(val) { |v| Riml::CurlyBraceVariable.new([ v[0] ]) } 
+     result = make_node(val) { |v| Riml::CurlyBraceVariable.new([ v[0] ]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 421)
   def _reduce_190(val, _values, result)
-     result = make_node(val) { |v| Riml::CurlyBraceVariable.new([ Riml::CurlyBracePart.new(v[0]), v[1] ]) } 
+     result = make_node(val) { |v| Riml::CurlyBraceVariable.new([ Riml::CurlyBracePart.new(v[0]), v[1] ]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 422)
   def _reduce_191(val, _values, result)
-     result = val[0] << make_node(val) { |v| Riml::CurlyBracePart.new(v[1]) } 
+     result = val[0] << make_node(val) { |v| Riml::CurlyBracePart.new(v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 423)
   def _reduce_192(val, _values, result)
-     result = val[0] << val[1] 
+     result = val[0] << val[1]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 427)
   def _reduce_193(val, _values, result)
-     result = make_node(val) { |v| Riml::CurlyBracePart.new(v[1]) } 
+     result = make_node(val) { |v| Riml::CurlyBracePart.new(v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 428)
   def _reduce_194(val, _values, result)
-     result = make_node(val) { |v| Riml::CurlyBracePart.new([v[1], v[2]]) } 
+     result = make_node(val) { |v| Riml::CurlyBracePart.new([v[1], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 429)
   def _reduce_195(val, _values, result)
-     result = make_node(val) { |v| Riml::CurlyBracePart.new([v[1], v[2]]) } 
+     result = make_node(val) { |v| Riml::CurlyBracePart.new([v[1], v[2]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 435)
   def _reduce_196(val, _values, result)
-     result = make_node(val) { |v| Riml.const_get(val[0]).new('!', v[1][0], v[1][1], v[2], [], v[3], v[4]) } 
+     result = make_node(val) { |v| Riml.const_get(val[0]).new('!', v[1][0], v[1][1], v[2], [], v[3], v[4]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 436)
   def _reduce_197(val, _values, result)
-     result = make_node(val) { |v| Riml.const_get(val[0]).new('!', v[1][0], v[1][1], v[2], v[4], v[6], v[7]) } 
+     result = make_node(val) { |v| Riml.const_get(val[0]).new('!', v[1][0], v[1][1], v[2], v[4], v[6], v[7]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 437)
   def _reduce_198(val, _values, result)
-     result = make_node(val) { |v| Riml.const_get(val[0]).new('!', v[1][0], v[1][1], v[2], [v[4]], v[6], v[7]) } 
+     result = make_node(val) { |v| Riml.const_get(val[0]).new('!', v[1][0], v[1][1], v[2], [v[4]], v[6], v[7]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 438)
   def _reduce_199(val, _values, result)
-     result = make_node(val) { |v| Riml.const_get(val[0]).new('!', v[1][0], v[1][1], v[2], v[4] << v[6], v[8], v[9]) } 
+     result = make_node(val) { |v| Riml.const_get(val[0]).new('!', v[1][0], v[1][1], v[2], v[4] << v[6], v[8], v[9]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 442)
   def _reduce_200(val, _values, result)
-     result = "DefNode" 
+     result = "DefNode"
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 443)
   def _reduce_201(val, _values, result)
-     result = "DefNode" 
+     result = "DefNode"
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 444)
   def _reduce_202(val, _values, result)
-     result = "DefMethodNode" 
+     result = "DefMethodNode"
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 449)
   def _reduce_203(val, _values, result)
-     result = make_node(val) { |v| Riml::GetCurlyBraceNameNode.new('', v[0]) } 
+     result = make_node(val) { |v| Riml::GetCurlyBraceNameNode.new('', v[0]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 450)
   def _reduce_204(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 455)
   def _reduce_205(val, _values, result)
-     result = [val[0]] 
+     result = [val[0]]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 456)
   def _reduce_206(val, _values, result)
-     result = val[0] << val[1] 
+     result = val[0] << val[1]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 457)
   def _reduce_207(val, _values, result)
-     result = nil 
+     result = nil
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 461)
   def _reduce_208(val, _values, result)
-     result = [] 
+     result = []
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 462)
   def _reduce_209(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 463)
   def _reduce_210(val, _values, result)
-     result = val 
+     result = val
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 464)
   def _reduce_211(val, _values, result)
-     result = val[0] << val[2] 
+     result = val[0] << val[2]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 465)
   def _reduce_212(val, _values, result)
-     result = val[0] << val[2] 
+     result = val[0] << val[2]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 469)
   def _reduce_213(val, _values, result)
-     result = make_node(val) { |v| Riml::DefaultParamNode.new(v[0], v[2]) } 
+     result = make_node(val) { |v| Riml::DefaultParamNode.new(v[0], v[2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 473)
   def _reduce_214(val, _values, result)
-     result = make_node(val) { |v| Riml::ReturnNode.new(v[1]) } 
+     result = make_node(val) { |v| Riml::ReturnNode.new(v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 474)
   def _reduce_215(val, _values, result)
-     result = make_node(val) { |v| Riml::IfNode.new(v[3], Nodes.new([ReturnNode.new(v[1])])) } 
+     result = make_node(val) { |v| Riml::IfNode.new(v[3], Nodes.new([ReturnNode.new(v[1])])) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 475)
   def _reduce_216(val, _values, result)
-     result = make_node(val) { |v| Riml::UnlessNode.new(v[3], Nodes.new([ReturnNode.new(v[1])])) } 
+     result = make_node(val) { |v| Riml::UnlessNode.new(v[3], Nodes.new([ReturnNode.new(v[1])])) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 479)
   def _reduce_217(val, _values, result)
-     result = nil 
+     result = nil
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 480)
   def _reduce_218(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 484)
   def _reduce_219(val, _values, result)
-     result = make_node(val) { |_| Riml::FinishNode.new } 
+     result = make_node(val) { |_| Riml::FinishNode.new }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 489)
   def _reduce_220(val, _values, result)
-     result = make_node(val) { |v| Riml::IfNode.new(v[1], v[2]) } 
+     result = make_node(val) { |v| Riml::IfNode.new(v[1], v[2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 490)
   def _reduce_221(val, _values, result)
-     result = make_node(val) { |v| Riml::IfNode.new(v[1], Riml::Nodes.new([v[3]])) } 
+     result = make_node(val) { |v| Riml::IfNode.new(v[1], Riml::Nodes.new([v[3]])) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 491)
   def _reduce_222(val, _values, result)
-     result = make_node(val) { |v| Riml::IfNode.new(v[2], Riml::Nodes.new([v[0]])) } 
+     result = make_node(val) { |v| Riml::IfNode.new(v[2], Riml::Nodes.new([v[0]])) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 495)
   def _reduce_223(val, _values, result)
-     result = make_node(val) { |v| Riml::UnlessNode.new(v[1], v[2]) } 
+     result = make_node(val) { |v| Riml::UnlessNode.new(v[1], v[2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 496)
   def _reduce_224(val, _values, result)
-     result = make_node(val) { |v| Riml::UnlessNode.new(v[1], Riml::Nodes.new([v[3]])) } 
+     result = make_node(val) { |v| Riml::UnlessNode.new(v[1], Riml::Nodes.new([v[3]])) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 497)
   def _reduce_225(val, _values, result)
-     result = make_node(val) { |v| Riml::UnlessNode.new(v[2], Riml::Nodes.new([v[0]])) } 
+     result = make_node(val) { |v| Riml::UnlessNode.new(v[2], Riml::Nodes.new([v[0]])) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 501)
   def _reduce_226(val, _values, result)
-     result = make_node(val) { |v| Riml::TernaryOperatorNode.new([v[0], v[2], v[4]]) } 
+     result = make_node(val) { |v| Riml::TernaryOperatorNode.new([v[0], v[2], v[4]]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 505)
   def _reduce_227(val, _values, result)
-     result = make_node(val) { |v| Riml::WhileNode.new(v[1], v[2]) } 
+     result = make_node(val) { |v| Riml::WhileNode.new(v[1], v[2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 509)
   def _reduce_228(val, _values, result)
-     result = make_node(val) { |_| Riml::BreakNode.new } 
+     result = make_node(val) { |_| Riml::BreakNode.new }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 510)
   def _reduce_229(val, _values, result)
-     result = make_node(val) { |_| Riml::ContinueNode.new } 
+     result = make_node(val) { |_| Riml::ContinueNode.new }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 514)
   def _reduce_230(val, _values, result)
-     result = make_node(val) { |v| Riml::UntilNode.new(v[1], v[2]) } 
+     result = make_node(val) { |v| Riml::UntilNode.new(v[1], v[2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 518)
   def _reduce_231(val, _values, result)
-     result = make_node(val) { |v| Riml::ForNode.new(v[1], v[3], v[4]) } 
+     result = make_node(val) { |v| Riml::ForNode.new(v[1], v[3], v[4]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 519)
   def _reduce_232(val, _values, result)
-     result = make_node(val) { |v| Riml::ForNode.new(v[1], v[3], v[4]) } 
+     result = make_node(val) { |v| Riml::ForNode.new(v[1], v[3], v[4]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 520)
   def _reduce_233(val, _values, result)
-     result = make_node(val) { |v| Riml::ForNode.new(v[1], v[3], v[4]) } 
+     result = make_node(val) { |v| Riml::ForNode.new(v[1], v[3], v[4]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 524)
   def _reduce_234(val, _values, result)
-     result = make_node(val) { |v| Riml::TryNode.new(v[1], nil, nil) } 
+     result = make_node(val) { |v| Riml::TryNode.new(v[1], nil, nil) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 525)
   def _reduce_235(val, _values, result)
-     result = make_node(val) { |v| Riml::TryNode.new(v[1], v[2], nil) } 
+     result = make_node(val) { |v| Riml::TryNode.new(v[1], v[2], nil) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 526)
   def _reduce_236(val, _values, result)
-     result = make_node(val) { |v| Riml::TryNode.new(v[1], v[2], v[4]) } 
+     result = make_node(val) { |v| Riml::TryNode.new(v[1], v[2], v[4]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 530)
   def _reduce_237(val, _values, result)
-     result = nil 
+     result = nil
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 531)
   def _reduce_238(val, _values, result)
-     result = [ make_node(val) { |v| Riml::CatchNode.new(nil, v[1]) } ] 
+     result = [ make_node(val) { |v| Riml::CatchNode.new(nil, v[1]) } ]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 532)
   def _reduce_239(val, _values, result)
-     result = [ make_node(val) { |v| Riml::CatchNode.new(v[1], v[2]) } ] 
+     result = [ make_node(val) { |v| Riml::CatchNode.new(v[1], v[2]) } ]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 533)
   def _reduce_240(val, _values, result)
-     result = val[0] << make_node(val) { |v| Riml::CatchNode.new(nil, v[2]) } 
+     result = val[0] << make_node(val) { |v| Riml::CatchNode.new(nil, v[2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 534)
   def _reduce_241(val, _values, result)
-     result = val[0] << make_node(val) { |v| Riml::CatchNode.new(v[2], v[3]) } 
+     result = val[0] << make_node(val) { |v| Riml::CatchNode.new(v[2], v[3]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 538)
   def _reduce_242(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 539)
   def _reduce_243(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 546)
   def _reduce_244(val, _values, result)
-     result = val[1] 
+     result = val[1]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 547)
   def _reduce_245(val, _values, result)
-     result = make_node(val) { |_| Riml::Nodes.new([]) } 
+     result = make_node(val) { |_| Riml::Nodes.new([]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 551)
   def _reduce_246(val, _values, result)
-     result = val[0] 
+     result = val[0]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 552)
   def _reduce_247(val, _values, result)
-     result = val[1] << val[2] 
+     result = val[1] << val[2]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 553)
   def _reduce_248(val, _values, result)
-     result = val[1] << val[2] 
+     result = val[1] << val[2]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 554)
   def _reduce_249(val, _values, result)
-     result = val[1] << val[2] << val[3] 
+     result = val[1] << val[2] << val[3]
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 558)
   def _reduce_250(val, _values, result)
-     result = make_node(val) { |v| Riml::ElseNode.new(v[2]) } 
+     result = make_node(val) { |v| Riml::ElseNode.new(v[2]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 562)
   def _reduce_251(val, _values, result)
-     result = make_node(val) { |v| Riml::Nodes.new([Riml::ElseifNode.new(v[1], v[3])]) } 
+     result = make_node(val) { |v| Riml::Nodes.new([Riml::ElseifNode.new(v[1], v[3])]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 563)
   def _reduce_252(val, _values, result)
-     result = val[0] << make_node(val) { |v| Riml::ElseifNode.new(v[2], v[4]) } 
+     result = val[0] << make_node(val) { |v| Riml::ElseifNode.new(v[2], v[4]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 567)
   def _reduce_253(val, _values, result)
-     result = make_node(val) { |v| Riml::ClassDefinitionNode.new(v[1], v[2], nil, v[3]) } 
+     result = make_node(val) { |v| Riml::ClassDefinitionNode.new(v[1], v[2], nil, v[3]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 568)
   def _reduce_254(val, _values, result)
-     result = make_node(val) { |v| Riml::ClassDefinitionNode.new(v[1], v[2], (v[4] || ClassDefinitionNode::DEFAULT_SCOPE_MODIFIER) + v[5], v[6]) } 
+     result = make_node(val) { |v| Riml::ClassDefinitionNode.new(v[1], v[2], (v[4] || ClassDefinitionNode::DEFAULT_SCOPE_MODIFIER) + v[5], v[6]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 572)
   def _reduce_255(val, _values, result)
-     result = make_node(val) { |v| Riml::ObjectInstantiationNode.new(v[1]) } 
+     result = make_node(val) { |v| Riml::ObjectInstantiationNode.new(v[1]) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 576)
   def _reduce_256(val, _values, result)
-     result = make_node(val) { |v| Riml::SuperNode.new(v[2], true) } 
+     result = make_node(val) { |v| Riml::SuperNode.new(v[2], true) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 577)
   def _reduce_257(val, _values, result)
-     result = make_node(val) { |_| Riml::SuperNode.new([], false) } 
+     result = make_node(val) { |_| Riml::SuperNode.new([], false) }
     result
   end
 .,.,
 
 module_eval(<<'.,.,', 'riml.y', 581)
   def _reduce_258(val, _values, result)
-     result = make_node(val) { |v| Riml::ExLiteralNode.new(v[0]) } 
+     result = make_node(val) { |v| Riml::ExLiteralNode.new(v[0]) }
     result
   end
 .,.,
@@ -3294,4 +3294,4 @@ def _reduce_none(val, _values, result)
 end
 
   end   # class Parser
-  end   # module Riml
+end   # module Riml