X-Git-Url: http://nitlanguage.org diff --git a/src/parser/parser_prod.nit b/src/parser/parser_prod.nit index 178217b..847a005 100644 --- a/src/parser/parser_prod.nit +++ b/src/parser/parser_prod.nit @@ -1,9 +1,10 @@ # Production AST nodes full definition. -# This file was generated by SableCC (http://www.sablecc.org/). +# This file was generated by SableCC (http://www.sablecc.org/). package parser_prod import lexer intrude import parser_nodes +private import tables redef class ANode # Parent of the node in the AST @@ -29,41 +30,18 @@ redef class ANode # Visit all nodes in order. # Thus, call "v.visit(e)" for each node e fun visit_all(v: Visitor) is abstract - - # Visit all nodes in reverse order. - # Thus, call "v.visit(e)" for each node e starting from the last child - fun visit_all_reverse(v: Visitor) is abstract - - # Debug method: output a message prefixed with the location. - fun printl(str: String) - do - if location == null then - print("???: {str}\n") - else - print("{location}: {str}\n") - end - end end redef class Token redef fun visit_all(v: Visitor) do end - redef fun visit_all_reverse(v: Visitor) do end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do end end redef class Prod - # The first token of the production node - readable writable var _first_token: nullable Token - - # The last token of the production node - readable writable var _last_token: nullable Token - redef fun replace_with(n: ANode) do super assert n isa Prod - n.first_token = first_token - n.last_token = last_token n.location = location end end @@ -90,26 +68,18 @@ class Visitor end redef class AModule - redef fun n_packagedecl=(n) - do - _n_packagedecl = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_amodule ( - n_packagedecl: nullable APackagedecl , - n_imports: Collection[Object] , # Should be Collection[AImport] - n_classdefs: Collection[Object] # Should be Collection[AClassdef] + n_moduledecl: nullable AModuledecl, + n_imports: Collection[Object], # Should be Collection[AImport] + n_classdefs: Collection[Object] # Should be Collection[AClassdef] ) do empty_init - _n_packagedecl = n_packagedecl - if n_packagedecl != null then - n_packagedecl.parent = self + _n_moduledecl = n_moduledecl + if n_moduledecl != null then + n_moduledecl.parent = self end for n in n_imports do assert n isa AImport @@ -125,13 +95,13 @@ redef class AModule redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_packagedecl == old_child then + if _n_moduledecl == old_child then if new_child != null then new_child.parent = self - assert new_child isa APackagedecl - _n_packagedecl = new_child + assert new_child isa AModuledecl + _n_moduledecl = new_child else - _n_packagedecl = null + _n_moduledecl = null end return end @@ -163,8 +133,8 @@ redef class AModule redef fun visit_all(v: Visitor) do - if _n_packagedecl != null then - v.enter_visit(_n_packagedecl.as(not null)) + if _n_moduledecl != null then + v.enter_visit(_n_moduledecl.as(not null)) end for n in _n_imports do v.enter_visit(n) @@ -173,53 +143,14 @@ redef class AModule v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_packagedecl != null then - v.enter_visit(_n_packagedecl.as(not null)) - end - do - var i = _n_imports.length - while i >= 0 do - v.enter_visit(_n_imports[i]) - i = i - 1 - end - end - do - var i = _n_classdefs.length - while i >= 0 do - v.enter_visit(_n_classdefs[i]) - i = i - 1 - end - end - end end -redef class APackagedecl - redef fun n_doc=(n) - do - _n_doc = n - if n != null then - n.parent = self - end - end - redef fun n_kwpackage=(n) - do - _n_kwpackage = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - +redef class AModuledecl private init empty_init do end - init init_apackagedecl ( - n_doc: nullable ADoc , - n_kwpackage: nullable TKwpackage , - n_id: nullable TId + init init_amoduledecl ( + n_doc: nullable ADoc, + n_kwmodule: nullable TKwmodule, + n_id: nullable TId ) do empty_init @@ -227,8 +158,8 @@ redef class APackagedecl if n_doc != null then n_doc.parent = self end - _n_kwpackage = n_kwpackage.as(not null) - n_kwpackage.parent = self + _n_kwmodule = n_kwmodule.as(not null) + n_kwmodule.parent = self _n_id = n_id.as(not null) n_id.parent = self end @@ -245,11 +176,11 @@ redef class APackagedecl end return end - if _n_kwpackage == old_child then + if _n_kwmodule == old_child then if new_child != null then new_child.parent = self - assert new_child isa TKwpackage - _n_kwpackage = new_child + assert new_child isa TKwmodule + _n_kwmodule = new_child else abort end @@ -272,42 +203,17 @@ redef class APackagedecl if _n_doc != null then v.enter_visit(_n_doc.as(not null)) end - v.enter_visit(_n_kwpackage) - v.enter_visit(_n_id) - end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_doc != null then - v.enter_visit(_n_doc.as(not null)) - end - v.enter_visit(_n_kwpackage) + v.enter_visit(_n_kwmodule) v.enter_visit(_n_id) end end redef class AStdImport - redef fun n_visibility=(n) - do - _n_visibility = n - n.parent = self - end - redef fun n_kwimport=(n) - do - _n_kwimport = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - private init empty_init do end init init_astdimport ( - n_visibility: nullable AVisibility , - n_kwimport: nullable TKwimport , - n_id: nullable TId + n_visibility: nullable AVisibility, + n_kwimport: nullable TKwimport, + n_id: nullable TId ) do empty_init @@ -359,37 +265,14 @@ redef class AStdImport v.enter_visit(_n_kwimport) v.enter_visit(_n_id) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_visibility) - v.enter_visit(_n_kwimport) - v.enter_visit(_n_id) - end end redef class ANoImport - redef fun n_visibility=(n) - do - _n_visibility = n - n.parent = self - end - redef fun n_kwimport=(n) - do - _n_kwimport = n - n.parent = self - end - redef fun n_kwend=(n) - do - _n_kwend = n - n.parent = self - end - private init empty_init do end init init_anoimport ( - n_visibility: nullable AVisibility , - n_kwimport: nullable TKwimport , - n_kwend: nullable TKwend + n_visibility: nullable AVisibility, + n_kwimport: nullable TKwimport, + n_kwend: nullable TKwend ) do empty_init @@ -441,16 +324,8 @@ redef class ANoImport v.enter_visit(_n_kwimport) v.enter_visit(_n_kwend) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_visibility) - v.enter_visit(_n_kwimport) - v.enter_visit(_n_kwend) - end end redef class APublicVisibility - private init empty_init do end init init_apublicvisibility @@ -465,22 +340,12 @@ redef class APublicVisibility redef fun visit_all(v: Visitor) do end - - redef fun visit_all_reverse(v: Visitor) - do - end end redef class APrivateVisibility - redef fun n_kwprivate=(n) - do - _n_kwprivate = n - n.parent = self - end - private init empty_init do end init init_aprivatevisibility ( - n_kwprivate: nullable TKwprivate + n_kwprivate: nullable TKwprivate ) do empty_init @@ -506,23 +371,12 @@ redef class APrivateVisibility do v.enter_visit(_n_kwprivate) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwprivate) - end end redef class AProtectedVisibility - redef fun n_kwprotected=(n) - do - _n_kwprotected = n - n.parent = self - end - private init empty_init do end init init_aprotectedvisibility ( - n_kwprotected: nullable TKwprotected + n_kwprotected: nullable TKwprotected ) do empty_init @@ -548,23 +402,12 @@ redef class AProtectedVisibility do v.enter_visit(_n_kwprotected) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwprotected) - end end redef class AIntrudeVisibility - redef fun n_kwintrude=(n) - do - _n_kwintrude = n - n.parent = self - end - private init empty_init do end init init_aintrudevisibility ( - n_kwintrude: nullable TKwintrude + n_kwintrude: nullable TKwintrude ) do empty_init @@ -590,56 +433,19 @@ redef class AIntrudeVisibility do v.enter_visit(_n_kwintrude) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwintrude) - end end redef class AStdClassdef - redef fun n_doc=(n) - do - _n_doc = n - if n != null then - n.parent = self - end - end - redef fun n_kwredef=(n) - do - _n_kwredef = n - if n != null then - n.parent = self - end - end - redef fun n_visibility=(n) - do - _n_visibility = n - n.parent = self - end - redef fun n_classkind=(n) - do - _n_classkind = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_astdclassdef ( - n_doc: nullable ADoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable AVisibility , - n_classkind: nullable AClasskind , - n_id: nullable TClassid , - n_formaldefs: Collection[Object] , # Should be Collection[AFormaldef] - n_superclasses: Collection[Object] , # Should be Collection[ASuperclass] - n_propdefs: Collection[Object] # Should be Collection[APropdef] + n_doc: nullable ADoc, + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, + n_classkind: nullable AClasskind, + n_id: nullable TClassid, + n_formaldefs: Collection[Object], # Should be Collection[AFormaldef] + n_superclasses: Collection[Object], # Should be Collection[ASuperclass] + n_propdefs: Collection[Object] # Should be Collection[APropdef] ) do empty_init @@ -789,49 +595,12 @@ redef class AStdClassdef v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_doc != null then - v.enter_visit(_n_doc.as(not null)) - end - if _n_kwredef != null then - v.enter_visit(_n_kwredef.as(not null)) - end - v.enter_visit(_n_visibility) - v.enter_visit(_n_classkind) - if _n_id != null then - v.enter_visit(_n_id.as(not null)) - end - do - var i = _n_formaldefs.length - while i >= 0 do - v.enter_visit(_n_formaldefs[i]) - i = i - 1 - end - end - do - var i = _n_superclasses.length - while i >= 0 do - v.enter_visit(_n_superclasses[i]) - i = i - 1 - end - end - do - var i = _n_propdefs.length - while i >= 0 do - v.enter_visit(_n_propdefs[i]) - i = i - 1 - end - end - end end redef class ATopClassdef - private init empty_init do end init init_atopclassdef ( - n_propdefs: Collection[Object] # Should be Collection[APropdef] + n_propdefs: Collection[Object] # Should be Collection[APropdef] ) do empty_init @@ -864,24 +633,12 @@ redef class ATopClassdef v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - do - var i = _n_propdefs.length - while i >= 0 do - v.enter_visit(_n_propdefs[i]) - i = i - 1 - end - end - end end redef class AMainClassdef - private init empty_init do end init init_amainclassdef ( - n_propdefs: Collection[Object] # Should be Collection[APropdef] + n_propdefs: Collection[Object] # Should be Collection[APropdef] ) do empty_init @@ -914,29 +671,12 @@ redef class AMainClassdef v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - do - var i = _n_propdefs.length - while i >= 0 do - v.enter_visit(_n_propdefs[i]) - i = i - 1 - end - end - end end redef class AConcreteClasskind - redef fun n_kwclass=(n) - do - _n_kwclass = n - n.parent = self - end - private init empty_init do end init init_aconcreteclasskind ( - n_kwclass: nullable TKwclass + n_kwclass: nullable TKwclass ) do empty_init @@ -962,29 +702,13 @@ redef class AConcreteClasskind do v.enter_visit(_n_kwclass) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwclass) - end end redef class AAbstractClasskind - redef fun n_kwabstract=(n) - do - _n_kwabstract = n - n.parent = self - end - redef fun n_kwclass=(n) - do - _n_kwclass = n - n.parent = self - end - private init empty_init do end init init_aabstractclasskind ( - n_kwabstract: nullable TKwabstract , - n_kwclass: nullable TKwclass + n_kwabstract: nullable TKwabstract, + n_kwclass: nullable TKwclass ) do empty_init @@ -1023,24 +747,12 @@ redef class AAbstractClasskind v.enter_visit(_n_kwabstract) v.enter_visit(_n_kwclass) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwabstract) - v.enter_visit(_n_kwclass) - end end redef class AInterfaceClasskind - redef fun n_kwinterface=(n) - do - _n_kwinterface = n - n.parent = self - end - private init empty_init do end init init_ainterfaceclasskind ( - n_kwinterface: nullable TKwinterface + n_kwinterface: nullable TKwinterface ) do empty_init @@ -1066,37 +778,26 @@ redef class AInterfaceClasskind do v.enter_visit(_n_kwinterface) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwinterface) - end end -redef class AUniversalClasskind - redef fun n_kwuniversal=(n) - do - _n_kwuniversal = n - n.parent = self - end - +redef class AEnumClasskind private init empty_init do end - init init_auniversalclasskind ( - n_kwuniversal: nullable TKwuniversal + init init_aenumclasskind ( + n_kwenum: nullable TKwenum ) do empty_init - _n_kwuniversal = n_kwuniversal.as(not null) - n_kwuniversal.parent = self + _n_kwenum = n_kwenum.as(not null) + n_kwenum.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_kwuniversal == old_child then + if _n_kwenum == old_child then if new_child != null then new_child.parent = self - assert new_child isa TKwuniversal - _n_kwuniversal = new_child + assert new_child isa TKwenum + _n_kwenum = new_child else abort end @@ -1106,33 +807,15 @@ redef class AUniversalClasskind redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwuniversal) - end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwuniversal) + v.enter_visit(_n_kwenum) end end redef class AFormaldef - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_type=(n) - do - _n_type = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_aformaldef ( - n_id: nullable TClassid , - n_type: nullable AType + n_id: nullable TClassid, + n_type: nullable AType ) do empty_init @@ -1175,37 +858,25 @@ redef class AFormaldef v.enter_visit(_n_type.as(not null)) end end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_id) - if _n_type != null then - v.enter_visit(_n_type.as(not null)) - end - end end redef class ASuperclass - redef fun n_kwspecial=(n) - do - _n_kwspecial = n - n.parent = self - end - redef fun n_type=(n) - do - _n_type = n - n.parent = self - end - private init empty_init do end init init_asuperclass ( - n_kwspecial: nullable TKwspecial , - n_type: nullable AType + n_kwspecial: nullable TKwspecial, + n_kwsuper: nullable TKwsuper, + n_type: nullable AType ) do empty_init - _n_kwspecial = n_kwspecial.as(not null) - n_kwspecial.parent = self + _n_kwspecial = n_kwspecial + if n_kwspecial != null then + n_kwspecial.parent = self + end + _n_kwsuper = n_kwsuper + if n_kwsuper != null then + n_kwsuper.parent = self + end _n_type = n_type.as(not null) n_type.parent = self end @@ -1218,7 +889,17 @@ redef class ASuperclass assert new_child isa TKwspecial _n_kwspecial = new_child else - abort + _n_kwspecial = null + end + return + end + if _n_kwsuper == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa TKwsuper + _n_kwsuper = new_child + else + _n_kwsuper = null end return end @@ -1236,97 +917,29 @@ redef class ASuperclass redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwspecial) - v.enter_visit(_n_type) - end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwspecial) + if _n_kwspecial != null then + v.enter_visit(_n_kwspecial.as(not null)) + end + if _n_kwsuper != null then + v.enter_visit(_n_kwsuper.as(not null)) + end v.enter_visit(_n_type) end end redef class AAttrPropdef - redef fun n_doc=(n) - do - _n_doc = n - if n != null then - n.parent = self - end - end - redef fun n_readable=(n) - do - _n_readable = n - if n != null then - n.parent = self - end - end - redef fun n_writable=(n) - do - _n_writable = n - if n != null then - n.parent = self - end - end - redef fun n_kwredef=(n) - do - _n_kwredef = n - if n != null then - n.parent = self - end - end - redef fun n_visibility=(n) - do - _n_visibility = n - n.parent = self - end - redef fun n_kwattr=(n) - do - _n_kwattr = n - if n != null then - n.parent = self - end - end - redef fun n_kwvar=(n) - do - _n_kwvar = n - if n != null then - n.parent = self - end - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_type=(n) - do - _n_type = n - if n != null then - n.parent = self - end - end - redef fun n_expr=(n) - do - _n_expr = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_aattrpropdef ( - n_doc: nullable ADoc , - n_readable: nullable AAble , - n_writable: nullable AAble , - n_kwredef: nullable TKwredef , - n_visibility: nullable AVisibility , - n_kwattr: nullable TKwattr , - n_kwvar: nullable TKwvar , - n_id: nullable TAttrid , - n_type: nullable AType , - n_expr: nullable AExpr + n_doc: nullable ADoc, + n_readable: nullable AAble, + n_writable: nullable AAble, + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, + n_kwvar: nullable TKwvar, + n_id: nullable TAttrid, + n_id2: nullable TId, + n_type: nullable AType, + n_expr: nullable AExpr ) do empty_init @@ -1348,16 +961,16 @@ redef class AAttrPropdef end _n_visibility = n_visibility.as(not null) n_visibility.parent = self - _n_kwattr = n_kwattr - if n_kwattr != null then - n_kwattr.parent = self + _n_kwvar = n_kwvar.as(not null) + n_kwvar.parent = self + _n_id = n_id + if n_id != null then + n_id.parent = self end - _n_kwvar = n_kwvar - if n_kwvar != null then - n_kwvar.parent = self + _n_id2 = n_id2 + if n_id2 != null then + n_id2.parent = self end - _n_id = n_id.as(not null) - n_id.parent = self _n_type = n_type if n_type != null then n_type.parent = self @@ -1420,23 +1033,13 @@ redef class AAttrPropdef end return end - if _n_kwattr == old_child then - if new_child != null then - new_child.parent = self - assert new_child isa TKwattr - _n_kwattr = new_child - else - _n_kwattr = null - end - return - end if _n_kwvar == old_child then if new_child != null then new_child.parent = self assert new_child isa TKwvar _n_kwvar = new_child else - _n_kwvar = null + abort end return end @@ -1446,7 +1049,17 @@ redef class AAttrPropdef assert new_child isa TAttrid _n_id = new_child else - abort + _n_id = null + end + return + end + if _n_id2 == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa TId + _n_id2 = new_child + else + _n_id2 = null end return end @@ -1487,43 +1100,13 @@ redef class AAttrPropdef v.enter_visit(_n_kwredef.as(not null)) end v.enter_visit(_n_visibility) - if _n_kwattr != null then - v.enter_visit(_n_kwattr.as(not null)) - end - if _n_kwvar != null then - v.enter_visit(_n_kwvar.as(not null)) - end - v.enter_visit(_n_id) - if _n_type != null then - v.enter_visit(_n_type.as(not null)) - end - if _n_expr != null then - v.enter_visit(_n_expr.as(not null)) - end - end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_doc != null then - v.enter_visit(_n_doc.as(not null)) - end - if _n_readable != null then - v.enter_visit(_n_readable.as(not null)) - end - if _n_writable != null then - v.enter_visit(_n_writable.as(not null)) - end - if _n_kwredef != null then - v.enter_visit(_n_kwredef.as(not null)) - end - v.enter_visit(_n_visibility) - if _n_kwattr != null then - v.enter_visit(_n_kwattr.as(not null)) + v.enter_visit(_n_kwvar) + if _n_id != null then + v.enter_visit(_n_id.as(not null)) end - if _n_kwvar != null then - v.enter_visit(_n_kwvar.as(not null)) + if _n_id2 != null then + v.enter_visit(_n_id2.as(not null)) end - v.enter_visit(_n_id) if _n_type != null then v.enter_visit(_n_type.as(not null)) end @@ -1533,44 +1116,14 @@ redef class AAttrPropdef end end redef class AMethPropdef - redef fun n_doc=(n) - do - _n_doc = n - if n != null then - n.parent = self - end - end - redef fun n_kwredef=(n) - do - _n_kwredef = n - if n != null then - n.parent = self - end - end - redef fun n_visibility=(n) - do - _n_visibility = n - n.parent = self - end - redef fun n_methid=(n) - do - _n_methid = n - n.parent = self - end - redef fun n_signature=(n) - do - _n_signature = n - n.parent = self - end - private init empty_init do end init init_amethpropdef ( - n_doc: nullable ADoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable AVisibility , - n_methid: nullable AMethid , - n_signature: nullable ASignature + n_doc: nullable ADoc, + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, + n_methid: nullable AMethid, + n_signature: nullable ASignature ) do empty_init @@ -1656,65 +1209,17 @@ redef class AMethPropdef v.enter_visit(_n_methid) v.enter_visit(_n_signature) end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_doc != null then - v.enter_visit(_n_doc.as(not null)) - end - if _n_kwredef != null then - v.enter_visit(_n_kwredef.as(not null)) - end - v.enter_visit(_n_visibility) - v.enter_visit(_n_methid) - v.enter_visit(_n_signature) - end end redef class ADeferredMethPropdef - redef fun n_doc=(n) - do - _n_doc = n - if n != null then - n.parent = self - end - end - redef fun n_kwredef=(n) - do - _n_kwredef = n - if n != null then - n.parent = self - end - end - redef fun n_visibility=(n) - do - _n_visibility = n - n.parent = self - end - redef fun n_kwmeth=(n) - do - _n_kwmeth = n - n.parent = self - end - redef fun n_methid=(n) - do - _n_methid = n - n.parent = self - end - redef fun n_signature=(n) - do - _n_signature = n - n.parent = self - end - private init empty_init do end init init_adeferredmethpropdef ( - n_doc: nullable ADoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable AVisibility , - n_kwmeth: nullable TKwmeth , - n_methid: nullable AMethid , - n_signature: nullable ASignature + n_doc: nullable ADoc, + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, + n_kwmeth: nullable TKwmeth, + n_methid: nullable AMethid, + n_signature: nullable ASignature ) do empty_init @@ -1813,66 +1318,17 @@ redef class ADeferredMethPropdef v.enter_visit(_n_methid) v.enter_visit(_n_signature) end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_doc != null then - v.enter_visit(_n_doc.as(not null)) - end - if _n_kwredef != null then - v.enter_visit(_n_kwredef.as(not null)) - end - v.enter_visit(_n_visibility) - v.enter_visit(_n_kwmeth) - v.enter_visit(_n_methid) - v.enter_visit(_n_signature) - end end redef class AInternMethPropdef - redef fun n_doc=(n) - do - _n_doc = n - if n != null then - n.parent = self - end - end - redef fun n_kwredef=(n) - do - _n_kwredef = n - if n != null then - n.parent = self - end - end - redef fun n_visibility=(n) - do - _n_visibility = n - n.parent = self - end - redef fun n_kwmeth=(n) - do - _n_kwmeth = n - n.parent = self - end - redef fun n_methid=(n) - do - _n_methid = n - n.parent = self - end - redef fun n_signature=(n) - do - _n_signature = n - n.parent = self - end - private init empty_init do end init init_ainternmethpropdef ( - n_doc: nullable ADoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable AVisibility , - n_kwmeth: nullable TKwmeth , - n_methid: nullable AMethid , - n_signature: nullable ASignature + n_doc: nullable ADoc, + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, + n_kwmeth: nullable TKwmeth, + n_methid: nullable AMethid, + n_signature: nullable ASignature ) do empty_init @@ -1971,74 +1427,18 @@ redef class AInternMethPropdef v.enter_visit(_n_methid) v.enter_visit(_n_signature) end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_doc != null then - v.enter_visit(_n_doc.as(not null)) - end - if _n_kwredef != null then - v.enter_visit(_n_kwredef.as(not null)) - end - v.enter_visit(_n_visibility) - v.enter_visit(_n_kwmeth) - v.enter_visit(_n_methid) - v.enter_visit(_n_signature) - end end redef class AExternMethPropdef - redef fun n_doc=(n) - do - _n_doc = n - if n != null then - n.parent = self - end - end - redef fun n_kwredef=(n) - do - _n_kwredef = n - if n != null then - n.parent = self - end - end - redef fun n_visibility=(n) - do - _n_visibility = n - n.parent = self - end - redef fun n_kwmeth=(n) - do - _n_kwmeth = n - n.parent = self - end - redef fun n_methid=(n) - do - _n_methid = n - n.parent = self - end - redef fun n_signature=(n) - do - _n_signature = n - n.parent = self - end - redef fun n_extern=(n) - do - _n_extern = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_aexternmethpropdef ( - n_doc: nullable ADoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable AVisibility , - n_kwmeth: nullable TKwmeth , - n_methid: nullable AMethid , - n_signature: nullable ASignature , - n_extern: nullable TString + n_doc: nullable ADoc, + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, + n_kwmeth: nullable TKwmeth, + n_methid: nullable AMethid, + n_signature: nullable ASignature, + n_extern: nullable TString ) do empty_init @@ -2154,77 +1554,18 @@ redef class AExternMethPropdef v.enter_visit(_n_extern.as(not null)) end end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_doc != null then - v.enter_visit(_n_doc.as(not null)) - end - if _n_kwredef != null then - v.enter_visit(_n_kwredef.as(not null)) - end - v.enter_visit(_n_visibility) - v.enter_visit(_n_kwmeth) - v.enter_visit(_n_methid) - v.enter_visit(_n_signature) - if _n_extern != null then - v.enter_visit(_n_extern.as(not null)) - end - end end redef class AConcreteMethPropdef - redef fun n_doc=(n) - do - _n_doc = n - if n != null then - n.parent = self - end - end - redef fun n_kwredef=(n) - do - _n_kwredef = n - if n != null then - n.parent = self - end - end - redef fun n_visibility=(n) - do - _n_visibility = n - n.parent = self - end - redef fun n_kwmeth=(n) - do - _n_kwmeth = n - n.parent = self - end - redef fun n_methid=(n) - do - _n_methid = n - n.parent = self - end - redef fun n_signature=(n) - do - _n_signature = n - n.parent = self - end - redef fun n_block=(n) - do - _n_block = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_aconcretemethpropdef ( - n_doc: nullable ADoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable AVisibility , - n_kwmeth: nullable TKwmeth , - n_methid: nullable AMethid , - n_signature: nullable ASignature , - n_block: nullable AExpr + n_doc: nullable ADoc, + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, + n_kwmeth: nullable TKwmeth, + n_methid: nullable AMethid, + n_signature: nullable ASignature, + n_block: nullable AExpr ) do empty_init @@ -2340,79 +1681,18 @@ redef class AConcreteMethPropdef v.enter_visit(_n_block.as(not null)) end end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_doc != null then - v.enter_visit(_n_doc.as(not null)) - end - if _n_kwredef != null then - v.enter_visit(_n_kwredef.as(not null)) - end - v.enter_visit(_n_visibility) - v.enter_visit(_n_kwmeth) - v.enter_visit(_n_methid) - v.enter_visit(_n_signature) - if _n_block != null then - v.enter_visit(_n_block.as(not null)) - end - end end redef class AConcreteInitPropdef - redef fun n_doc=(n) - do - _n_doc = n - if n != null then - n.parent = self - end - end - redef fun n_kwredef=(n) - do - _n_kwredef = n - if n != null then - n.parent = self - end - end - redef fun n_visibility=(n) - do - _n_visibility = n - n.parent = self - end - redef fun n_kwinit=(n) - do - _n_kwinit = n - n.parent = self - end - redef fun n_methid=(n) - do - _n_methid = n - if n != null then - n.parent = self - end - end - redef fun n_signature=(n) - do - _n_signature = n - n.parent = self - end - redef fun n_block=(n) - do - _n_block = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_aconcreteinitpropdef ( - n_doc: nullable ADoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable AVisibility , - n_kwinit: nullable TKwinit , - n_methid: nullable AMethid , - n_signature: nullable ASignature , - n_block: nullable AExpr + n_doc: nullable ADoc, + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, + n_kwinit: nullable TKwinit, + n_methid: nullable AMethid, + n_signature: nullable ASignature, + n_block: nullable AExpr ) do empty_init @@ -2532,47 +1812,13 @@ redef class AConcreteInitPropdef v.enter_visit(_n_block.as(not null)) end end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_doc != null then - v.enter_visit(_n_doc.as(not null)) - end - if _n_kwredef != null then - v.enter_visit(_n_kwredef.as(not null)) - end - v.enter_visit(_n_visibility) - v.enter_visit(_n_kwinit) - if _n_methid != null then - v.enter_visit(_n_methid.as(not null)) - end - v.enter_visit(_n_signature) - if _n_block != null then - v.enter_visit(_n_block.as(not null)) - end - end end redef class AMainMethPropdef - redef fun n_kwredef=(n) - do - _n_kwredef = n - if n != null then - n.parent = self - end - end - redef fun n_block=(n) - do - _n_block = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_amainmethpropdef ( - n_kwredef: nullable TKwredef , - n_block: nullable AExpr + n_kwredef: nullable TKwredef, + n_block: nullable AExpr ) do empty_init @@ -2619,62 +1865,17 @@ redef class AMainMethPropdef v.enter_visit(_n_block.as(not null)) end end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_kwredef != null then - v.enter_visit(_n_kwredef.as(not null)) - end - if _n_block != null then - v.enter_visit(_n_block.as(not null)) - end - end end redef class ATypePropdef - redef fun n_doc=(n) - do - _n_doc = n - if n != null then - n.parent = self - end - end - redef fun n_kwredef=(n) - do - _n_kwredef = n - if n != null then - n.parent = self - end - end - redef fun n_visibility=(n) - do - _n_visibility = n - n.parent = self - end - redef fun n_kwtype=(n) - do - _n_kwtype = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_type=(n) - do - _n_type = n - n.parent = self - end - private init empty_init do end init init_atypepropdef ( - n_doc: nullable ADoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable AVisibility , - n_kwtype: nullable TKwtype , - n_id: nullable TClassid , - n_type: nullable AType + n_doc: nullable ADoc, + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, + n_kwtype: nullable TKwtype, + n_id: nullable TClassid, + n_type: nullable AType ) do empty_init @@ -2773,41 +1974,14 @@ redef class ATypePropdef v.enter_visit(_n_id) v.enter_visit(_n_type) end +end +redef class AReadAble + private init empty_init do end - redef fun visit_all_reverse(v: Visitor) - do - if _n_doc != null then - v.enter_visit(_n_doc.as(not null)) - end - if _n_kwredef != null then - v.enter_visit(_n_kwredef.as(not null)) - end - v.enter_visit(_n_visibility) - v.enter_visit(_n_kwtype) - v.enter_visit(_n_id) - v.enter_visit(_n_type) - end -end -redef class AReadAble - redef fun n_kwredef=(n) - do - _n_kwredef = n - if n != null then - n.parent = self - end - end - redef fun n_kwreadable=(n) - do - _n_kwreadable = n - n.parent = self - end - - private init empty_init do end - - init init_areadable ( - n_kwredef: nullable TKwredef , - n_kwreadable: nullable TKwreadable - ) + init init_areadable ( + n_kwredef: nullable TKwredef, + n_kwreadable: nullable TKwreadable + ) do empty_init _n_kwredef = n_kwredef @@ -2849,34 +2023,14 @@ redef class AReadAble end v.enter_visit(_n_kwreadable) end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_kwredef != null then - v.enter_visit(_n_kwredef.as(not null)) - end - v.enter_visit(_n_kwreadable) - end end redef class AWriteAble - redef fun n_kwredef=(n) - do - _n_kwredef = n - if n != null then - n.parent = self - end - end - redef fun n_kwwritable=(n) - do - _n_kwwritable = n - n.parent = self - end - private init empty_init do end init init_awriteable ( - n_kwredef: nullable TKwredef , - n_kwwritable: nullable TKwwritable + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, + n_kwwritable: nullable TKwwritable ) do empty_init @@ -2884,6 +2038,10 @@ redef class AWriteAble if n_kwredef != null then n_kwredef.parent = self end + _n_visibility = n_visibility + if n_visibility != null then + n_visibility.parent = self + end _n_kwwritable = n_kwwritable.as(not null) n_kwwritable.parent = self end @@ -2900,6 +2058,16 @@ redef class AWriteAble end return end + if _n_visibility == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa AVisibility + _n_visibility = new_child + else + _n_visibility = null + end + return + end if _n_kwwritable == old_child then if new_child != null then new_child.parent = self @@ -2917,28 +2085,17 @@ redef class AWriteAble if _n_kwredef != null then v.enter_visit(_n_kwredef.as(not null)) end - v.enter_visit(_n_kwwritable) - end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_kwredef != null then - v.enter_visit(_n_kwredef.as(not null)) + if _n_visibility != null then + v.enter_visit(_n_visibility.as(not null)) end v.enter_visit(_n_kwwritable) end end redef class AIdMethid - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - private init empty_init do end init init_aidmethid ( - n_id: nullable TId + n_id: nullable TId ) do empty_init @@ -2964,23 +2121,12 @@ redef class AIdMethid do v.enter_visit(_n_id) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_id) - end end redef class APlusMethid - redef fun n_plus=(n) - do - _n_plus = n - n.parent = self - end - private init empty_init do end init init_aplusmethid ( - n_plus: nullable TPlus + n_plus: nullable TPlus ) do empty_init @@ -3006,23 +2152,12 @@ redef class APlusMethid do v.enter_visit(_n_plus) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_plus) - end end redef class AMinusMethid - redef fun n_minus=(n) - do - _n_minus = n - n.parent = self - end - private init empty_init do end init init_aminusmethid ( - n_minus: nullable TMinus + n_minus: nullable TMinus ) do empty_init @@ -3048,23 +2183,12 @@ redef class AMinusMethid do v.enter_visit(_n_minus) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_minus) - end end redef class AStarMethid - redef fun n_star=(n) - do - _n_star = n - n.parent = self - end - private init empty_init do end init init_astarmethid ( - n_star: nullable TStar + n_star: nullable TStar ) do empty_init @@ -3090,23 +2214,12 @@ redef class AStarMethid do v.enter_visit(_n_star) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_star) - end end redef class ASlashMethid - redef fun n_slash=(n) - do - _n_slash = n - n.parent = self - end - private init empty_init do end init init_aslashmethid ( - n_slash: nullable TSlash + n_slash: nullable TSlash ) do empty_init @@ -3132,23 +2245,12 @@ redef class ASlashMethid do v.enter_visit(_n_slash) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_slash) - end end redef class APercentMethid - redef fun n_percent=(n) - do - _n_percent = n - n.parent = self - end - private init empty_init do end init init_apercentmethid ( - n_percent: nullable TPercent + n_percent: nullable TPercent ) do empty_init @@ -3174,23 +2276,12 @@ redef class APercentMethid do v.enter_visit(_n_percent) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_percent) - end end redef class AEqMethid - redef fun n_eq=(n) - do - _n_eq = n - n.parent = self - end - private init empty_init do end init init_aeqmethid ( - n_eq: nullable TEq + n_eq: nullable TEq ) do empty_init @@ -3216,23 +2307,12 @@ redef class AEqMethid do v.enter_visit(_n_eq) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_eq) - end end redef class ANeMethid - redef fun n_ne=(n) - do - _n_ne = n - n.parent = self - end - private init empty_init do end init init_anemethid ( - n_ne: nullable TNe + n_ne: nullable TNe ) do empty_init @@ -3258,23 +2338,12 @@ redef class ANeMethid do v.enter_visit(_n_ne) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_ne) - end end redef class ALeMethid - redef fun n_le=(n) - do - _n_le = n - n.parent = self - end - private init empty_init do end init init_alemethid ( - n_le: nullable TLe + n_le: nullable TLe ) do empty_init @@ -3300,23 +2369,12 @@ redef class ALeMethid do v.enter_visit(_n_le) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_le) - end end redef class AGeMethid - redef fun n_ge=(n) - do - _n_ge = n - n.parent = self - end - private init empty_init do end init init_agemethid ( - n_ge: nullable TGe + n_ge: nullable TGe ) do empty_init @@ -3342,23 +2400,12 @@ redef class AGeMethid do v.enter_visit(_n_ge) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_ge) - end end redef class ALtMethid - redef fun n_lt=(n) - do - _n_lt = n - n.parent = self - end - private init empty_init do end init init_altmethid ( - n_lt: nullable TLt + n_lt: nullable TLt ) do empty_init @@ -3384,23 +2431,12 @@ redef class ALtMethid do v.enter_visit(_n_lt) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_lt) - end end redef class AGtMethid - redef fun n_gt=(n) - do - _n_gt = n - n.parent = self - end - private init empty_init do end init init_agtmethid ( - n_gt: nullable TGt + n_gt: nullable TGt ) do empty_init @@ -3426,29 +2462,75 @@ redef class AGtMethid do v.enter_visit(_n_gt) end +end +redef class ALlMethid + private init empty_init do end - redef fun visit_all_reverse(v: Visitor) + init init_allmethid ( + n_ll: nullable TLl + ) do - v.enter_visit(_n_gt) + empty_init + _n_ll = n_ll.as(not null) + n_ll.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_ll == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa TLl + _n_ll = new_child + else + abort + end + return + end + end + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_ll) end end -redef class ABraMethid - redef fun n_obra=(n) +redef class AGgMethid + private init empty_init do end + + init init_aggmethid ( + n_gg: nullable TGg + ) do - _n_obra = n - n.parent = self + empty_init + _n_gg = n_gg.as(not null) + n_gg.parent = self end - redef fun n_cbra=(n) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_cbra = n - n.parent = self + if _n_gg == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa TGg + _n_gg = new_child + else + abort + end + return + end end + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_gg) + end +end +redef class ABraMethid private init empty_init do end init init_abramethid ( - n_obra: nullable TObra , - n_cbra: nullable TCbra + n_obra: nullable TObra, + n_cbra: nullable TCbra ) do empty_init @@ -3487,24 +2569,12 @@ redef class ABraMethid v.enter_visit(_n_obra) v.enter_visit(_n_cbra) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_obra) - v.enter_visit(_n_cbra) - end end redef class AStarshipMethid - redef fun n_starship=(n) - do - _n_starship = n - n.parent = self - end - private init empty_init do end init init_astarshipmethid ( - n_starship: nullable TStarship + n_starship: nullable TStarship ) do empty_init @@ -3530,29 +2600,13 @@ redef class AStarshipMethid do v.enter_visit(_n_starship) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_starship) - end end redef class AAssignMethid - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_assign=(n) - do - _n_assign = n - n.parent = self - end - private init empty_init do end init init_aassignmethid ( - n_id: nullable TId , - n_assign: nullable TAssign + n_id: nullable TId, + n_assign: nullable TAssign ) do empty_init @@ -3591,36 +2645,14 @@ redef class AAssignMethid v.enter_visit(_n_id) v.enter_visit(_n_assign) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_id) - v.enter_visit(_n_assign) - end end redef class ABraassignMethid - redef fun n_obra=(n) - do - _n_obra = n - n.parent = self - end - redef fun n_cbra=(n) - do - _n_cbra = n - n.parent = self - end - redef fun n_assign=(n) - do - _n_assign = n - n.parent = self - end - private init empty_init do end init init_abraassignmethid ( - n_obra: nullable TObra , - n_cbra: nullable TCbra , - n_assign: nullable TAssign + n_obra: nullable TObra, + n_cbra: nullable TCbra, + n_assign: nullable TAssign ) do empty_init @@ -3672,29 +2704,14 @@ redef class ABraassignMethid v.enter_visit(_n_cbra) v.enter_visit(_n_assign) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_obra) - v.enter_visit(_n_cbra) - v.enter_visit(_n_assign) - end end redef class ASignature - redef fun n_type=(n) - do - _n_type = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_asignature ( - n_params: Collection[Object] , # Should be Collection[AParam] - n_type: nullable AType , - n_closure_decls: Collection[Object] # Should be Collection[AClosureDecl] + n_params: Collection[Object], # Should be Collection[AParam] + n_type: nullable AType, + n_closure_decls: Collection[Object] # Should be Collection[AClosureDecl] ) do empty_init @@ -3764,55 +2781,14 @@ redef class ASignature v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - do - var i = _n_params.length - while i >= 0 do - v.enter_visit(_n_params[i]) - i = i - 1 - end - end - if _n_type != null then - v.enter_visit(_n_type.as(not null)) - end - do - var i = _n_closure_decls.length - while i >= 0 do - v.enter_visit(_n_closure_decls[i]) - i = i - 1 - end - end - end end redef class AParam - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_type=(n) - do - _n_type = n - if n != null then - n.parent = self - end - end - redef fun n_dotdotdot=(n) - do - _n_dotdotdot = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_aparam ( - n_id: nullable TId , - n_type: nullable AType , - n_dotdotdot: nullable TDotdotdot + n_id: nullable TId, + n_type: nullable AType, + n_dotdotdot: nullable TDotdotdot ) do empty_init @@ -3872,66 +2848,25 @@ redef class AParam v.enter_visit(_n_dotdotdot.as(not null)) end end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_id) - if _n_type != null then - v.enter_visit(_n_type.as(not null)) - end - if _n_dotdotdot != null then - v.enter_visit(_n_dotdotdot.as(not null)) - end - end end redef class AClosureDecl - redef fun n_kwwith=(n) - do - _n_kwwith = n - n.parent = self - end - redef fun n_kwbreak=(n) - do - _n_kwbreak = n - if n != null then - n.parent = self - end - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_signature=(n) - do - _n_signature = n - n.parent = self - end - redef fun n_expr=(n) - do - _n_expr = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_aclosuredecl ( - n_kwwith: nullable TKwwith , - n_kwbreak: nullable TKwbreak , - n_id: nullable TId , - n_signature: nullable ASignature , - n_expr: nullable AExpr + n_kwbreak: nullable TKwbreak, + n_bang: nullable TBang, + n_id: nullable TId, + n_signature: nullable ASignature, + n_expr: nullable AExpr ) do empty_init - _n_kwwith = n_kwwith.as(not null) - n_kwwith.parent = self _n_kwbreak = n_kwbreak if n_kwbreak != null then n_kwbreak.parent = self end + _n_bang = n_bang.as(not null) + n_bang.parent = self _n_id = n_id.as(not null) n_id.parent = self _n_signature = n_signature.as(not null) @@ -3944,23 +2879,23 @@ redef class AClosureDecl redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_kwwith == old_child then + if _n_kwbreak == old_child then if new_child != null then new_child.parent = self - assert new_child isa TKwwith - _n_kwwith = new_child + assert new_child isa TKwbreak + _n_kwbreak = new_child else - abort + _n_kwbreak = null end return end - if _n_kwbreak == old_child then + if _n_bang == old_child then if new_child != null then new_child.parent = self - assert new_child isa TKwbreak - _n_kwbreak = new_child + assert new_child isa TBang + _n_bang = new_child else - _n_kwbreak = null + abort end return end @@ -3998,23 +2933,10 @@ redef class AClosureDecl redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwwith) - if _n_kwbreak != null then - v.enter_visit(_n_kwbreak.as(not null)) - end - v.enter_visit(_n_id) - v.enter_visit(_n_signature) - if _n_expr != null then - v.enter_visit(_n_expr.as(not null)) - end - end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwwith) if _n_kwbreak != null then v.enter_visit(_n_kwbreak.as(not null)) end + v.enter_visit(_n_bang) v.enter_visit(_n_id) v.enter_visit(_n_signature) if _n_expr != null then @@ -4023,25 +2945,12 @@ redef class AClosureDecl end end redef class AType - redef fun n_kwnullable=(n) - do - _n_kwnullable = n - if n != null then - n.parent = self - end - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - private init empty_init do end init init_atype ( - n_kwnullable: nullable TKwnullable , - n_id: nullable TClassid , - n_types: Collection[Object] # Should be Collection[AType] + n_kwnullable: nullable TKwnullable, + n_id: nullable TClassid, + n_types: Collection[Object] # Should be Collection[AType] ) do empty_init @@ -4104,39 +3013,13 @@ redef class AType v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_kwnullable != null then - v.enter_visit(_n_kwnullable.as(not null)) - end - v.enter_visit(_n_id) - do - var i = _n_types.length - while i >= 0 do - v.enter_visit(_n_types[i]) - i = i - 1 - end - end - end end redef class ALabel - redef fun n_kwlabel=(n) - do - _n_kwlabel = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - private init empty_init do end init init_alabel ( - n_kwlabel: nullable TKwlabel , - n_id: nullable TId + n_kwlabel: nullable TKwlabel, + n_id: nullable TId ) do empty_init @@ -4175,19 +3058,12 @@ redef class ALabel v.enter_visit(_n_kwlabel) v.enter_visit(_n_id) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwlabel) - v.enter_visit(_n_id) - end end redef class ABlockExpr - private init empty_init do end init init_ablockexpr ( - n_expr: Collection[Object] # Should be Collection[AExpr] + n_expr: Collection[Object] # Should be Collection[AExpr] ) do empty_init @@ -4220,59 +3096,16 @@ redef class ABlockExpr v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - do - var i = _n_expr.length - while i >= 0 do - v.enter_visit(_n_expr[i]) - i = i - 1 - end - end - end end redef class AVardeclExpr - redef fun n_kwvar=(n) - do - _n_kwvar = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_type=(n) - do - _n_type = n - if n != null then - n.parent = self - end - end - redef fun n_assign=(n) - do - _n_assign = n - if n != null then - n.parent = self - end - end - redef fun n_expr=(n) - do - _n_expr = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_avardeclexpr ( - n_kwvar: nullable TKwvar , - n_id: nullable TId , - n_type: nullable AType , - n_assign: nullable TAssign , - n_expr: nullable AExpr + n_kwvar: nullable TKwvar, + n_id: nullable TId, + n_type: nullable AType, + n_assign: nullable TAssign, + n_expr: nullable AExpr ) do empty_init @@ -4362,46 +3195,20 @@ redef class AVardeclExpr v.enter_visit(_n_expr.as(not null)) end end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwvar) - v.enter_visit(_n_id) - if _n_type != null then - v.enter_visit(_n_type.as(not null)) - end - if _n_assign != null then - v.enter_visit(_n_assign.as(not null)) - end - if _n_expr != null then - v.enter_visit(_n_expr.as(not null)) - end - end end redef class AReturnExpr - redef fun n_kwreturn=(n) - do - _n_kwreturn = n - n.parent = self - end - redef fun n_expr=(n) - do - _n_expr = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_areturnexpr ( - n_kwreturn: nullable TKwreturn , - n_expr: nullable AExpr + n_kwreturn: nullable TKwreturn, + n_expr: nullable AExpr ) do empty_init - _n_kwreturn = n_kwreturn.as(not null) - n_kwreturn.parent = self + _n_kwreturn = n_kwreturn + if n_kwreturn != null then + n_kwreturn.parent = self + end _n_expr = n_expr if n_expr != null then n_expr.parent = self @@ -4416,7 +3223,7 @@ redef class AReturnExpr assert new_child isa TKwreturn _n_kwreturn = new_child else - abort + _n_kwreturn = null end return end @@ -4434,47 +3241,21 @@ redef class AReturnExpr redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwreturn) - if _n_expr != null then - v.enter_visit(_n_expr.as(not null)) + if _n_kwreturn != null then + v.enter_visit(_n_kwreturn.as(not null)) end - end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwreturn) if _n_expr != null then v.enter_visit(_n_expr.as(not null)) end end end redef class ABreakExpr - redef fun n_kwbreak=(n) - do - _n_kwbreak = n - n.parent = self - end - redef fun n_label=(n) - do - _n_label = n - if n != null then - n.parent = self - end - end - redef fun n_expr=(n) - do - _n_expr = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_abreakexpr ( - n_kwbreak: nullable TKwbreak , - n_label: nullable ALabel , - n_expr: nullable AExpr + n_kwbreak: nullable TKwbreak, + n_label: nullable ALabel, + n_expr: nullable AExpr ) do empty_init @@ -4534,29 +3315,12 @@ redef class ABreakExpr v.enter_visit(_n_expr.as(not null)) end end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwbreak) - if _n_label != null then - v.enter_visit(_n_label.as(not null)) - end - if _n_expr != null then - v.enter_visit(_n_expr.as(not null)) - end - end end redef class AAbortExpr - redef fun n_kwabort=(n) - do - _n_kwabort = n - n.parent = self - end - private init empty_init do end init init_aabortexpr ( - n_kwabort: nullable TKwabort + n_kwabort: nullable TKwabort ) do empty_init @@ -4582,44 +3346,21 @@ redef class AAbortExpr do v.enter_visit(_n_kwabort) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwabort) - end end redef class AContinueExpr - redef fun n_kwcontinue=(n) - do - _n_kwcontinue = n - n.parent = self - end - redef fun n_label=(n) - do - _n_label = n - if n != null then - n.parent = self - end - end - redef fun n_expr=(n) - do - _n_expr = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_acontinueexpr ( - n_kwcontinue: nullable TKwcontinue , - n_label: nullable ALabel , - n_expr: nullable AExpr + n_kwcontinue: nullable TKwcontinue, + n_label: nullable ALabel, + n_expr: nullable AExpr ) do empty_init - _n_kwcontinue = n_kwcontinue.as(not null) - n_kwcontinue.parent = self + _n_kwcontinue = n_kwcontinue + if n_kwcontinue != null then + n_kwcontinue.parent = self + end _n_label = n_label if n_label != null then n_label.parent = self @@ -4638,7 +3379,7 @@ redef class AContinueExpr assert new_child isa TKwcontinue _n_kwcontinue = new_child else - abort + _n_kwcontinue = null end return end @@ -4666,18 +3407,9 @@ redef class AContinueExpr redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwcontinue) - if _n_label != null then - v.enter_visit(_n_label.as(not null)) - end - if _n_expr != null then - v.enter_visit(_n_expr.as(not null)) + if _n_kwcontinue != null then + v.enter_visit(_n_kwcontinue.as(not null)) end - end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwcontinue) if _n_label != null then v.enter_visit(_n_label.as(not null)) end @@ -4687,32 +3419,12 @@ redef class AContinueExpr end end redef class ADoExpr - redef fun n_kwdo=(n) - do - _n_kwdo = n - n.parent = self - end - redef fun n_block=(n) - do - _n_block = n - if n != null then - n.parent = self - end - end - redef fun n_label=(n) - do - _n_label = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_adoexpr ( - n_kwdo: nullable TKwdo , - n_block: nullable AExpr , - n_label: nullable ALabel + n_kwdo: nullable TKwdo, + n_block: nullable AExpr, + n_label: nullable ALabel ) do empty_init @@ -4772,51 +3484,15 @@ redef class ADoExpr v.enter_visit(_n_label.as(not null)) end end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwdo) - if _n_block != null then - v.enter_visit(_n_block.as(not null)) - end - if _n_label != null then - v.enter_visit(_n_label.as(not null)) - end - end end redef class AIfExpr - redef fun n_kwif=(n) - do - _n_kwif = n - n.parent = self - end - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_then=(n) - do - _n_then = n - if n != null then - n.parent = self - end - end - redef fun n_else=(n) - do - _n_else = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_aifexpr ( - n_kwif: nullable TKwif , - n_expr: nullable AExpr , - n_then: nullable AExpr , - n_else: nullable AExpr + n_kwif: nullable TKwif, + n_expr: nullable AExpr, + n_then: nullable AExpr, + n_else: nullable AExpr ) do empty_init @@ -4889,60 +3565,17 @@ redef class AIfExpr v.enter_visit(_n_else.as(not null)) end end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwif) - v.enter_visit(_n_expr) - if _n_then != null then - v.enter_visit(_n_then.as(not null)) - end - if _n_else != null then - v.enter_visit(_n_else.as(not null)) - end - end end redef class AIfexprExpr - redef fun n_kwif=(n) - do - _n_kwif = n - n.parent = self - end - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_kwthen=(n) - do - _n_kwthen = n - n.parent = self - end - redef fun n_then=(n) - do - _n_then = n - n.parent = self - end - redef fun n_kwelse=(n) - do - _n_kwelse = n - n.parent = self - end - redef fun n_else=(n) - do - _n_else = n - n.parent = self - end - private init empty_init do end init init_aifexprexpr ( - n_kwif: nullable TKwif , - n_expr: nullable AExpr , - n_kwthen: nullable TKwthen , - n_then: nullable AExpr , - n_kwelse: nullable TKwelse , - n_else: nullable AExpr + n_kwif: nullable TKwif, + n_expr: nullable AExpr, + n_kwthen: nullable TKwthen, + n_then: nullable AExpr, + n_kwelse: nullable TKwelse, + n_else: nullable AExpr ) do empty_init @@ -5033,56 +3666,16 @@ redef class AIfexprExpr v.enter_visit(_n_kwelse) v.enter_visit(_n_else) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwif) - v.enter_visit(_n_expr) - v.enter_visit(_n_kwthen) - v.enter_visit(_n_then) - v.enter_visit(_n_kwelse) - v.enter_visit(_n_else) - end end redef class AWhileExpr - redef fun n_kwwhile=(n) - do - _n_kwwhile = n - n.parent = self - end - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_kwdo=(n) - do - _n_kwdo = n - n.parent = self - end - redef fun n_block=(n) - do - _n_block = n - if n != null then - n.parent = self - end - end - redef fun n_label=(n) - do - _n_label = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_awhileexpr ( - n_kwwhile: nullable TKwwhile , - n_expr: nullable AExpr , - n_kwdo: nullable TKwdo , - n_block: nullable AExpr , - n_label: nullable ALabel + n_kwwhile: nullable TKwwhile, + n_expr: nullable AExpr, + n_kwdo: nullable TKwdo, + n_block: nullable AExpr, + n_label: nullable ALabel ) do empty_init @@ -5168,12 +3761,66 @@ redef class AWhileExpr v.enter_visit(_n_label.as(not null)) end end +end +redef class ALoopExpr + private init empty_init do end - redef fun visit_all_reverse(v: Visitor) + init init_aloopexpr ( + n_kwloop: nullable TKwloop, + n_block: nullable AExpr, + n_label: nullable ALabel + ) do - v.enter_visit(_n_kwwhile) - v.enter_visit(_n_expr) - v.enter_visit(_n_kwdo) + empty_init + _n_kwloop = n_kwloop.as(not null) + n_kwloop.parent = self + _n_block = n_block + if n_block != null then + n_block.parent = self + end + _n_label = n_label + if n_label != null then + n_label.parent = self + end + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_kwloop == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa TKwloop + _n_kwloop = new_child + else + abort + end + return + end + if _n_block == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa AExpr + _n_block = new_child + else + _n_block = null + end + return + end + if _n_label == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa ALabel + _n_label = new_child + else + _n_label = null + end + return + end + end + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_kwloop) if _n_block != null then v.enter_visit(_n_block.as(not null)) end @@ -5183,50 +3830,15 @@ redef class AWhileExpr end end redef class AForExpr - redef fun n_kwfor=(n) - do - _n_kwfor = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_kwdo=(n) - do - _n_kwdo = n - n.parent = self - end - redef fun n_block=(n) - do - _n_block = n - if n != null then - n.parent = self - end - end - redef fun n_label=(n) - do - _n_label = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_aforexpr ( - n_kwfor: nullable TKwfor , - n_id: nullable TId , - n_expr: nullable AExpr , - n_kwdo: nullable TKwdo , - n_block: nullable AExpr , - n_label: nullable ALabel + n_kwfor: nullable TKwfor, + n_id: nullable TId, + n_expr: nullable AExpr, + n_kwdo: nullable TKwdo, + n_block: nullable AExpr, + n_label: nullable ALabel ) do empty_init @@ -5325,46 +3937,15 @@ redef class AForExpr v.enter_visit(_n_label.as(not null)) end end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwfor) - v.enter_visit(_n_id) - v.enter_visit(_n_expr) - v.enter_visit(_n_kwdo) - if _n_block != null then - v.enter_visit(_n_block.as(not null)) - end - if _n_label != null then - v.enter_visit(_n_label.as(not null)) - end - end end redef class AAssertExpr - redef fun n_kwassert=(n) - do - _n_kwassert = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - if n != null then - n.parent = self - end - end - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - private init empty_init do end init init_aassertexpr ( - n_kwassert: nullable TKwassert , - n_id: nullable TId , - n_expr: nullable AExpr + n_kwassert: nullable TKwassert, + n_id: nullable TId, + n_expr: nullable AExpr, + n_else: nullable AExpr ) do empty_init @@ -5376,6 +3957,10 @@ redef class AAssertExpr end _n_expr = n_expr.as(not null) n_expr.parent = self + _n_else = n_else + if n_else != null then + n_else.parent = self + end end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -5410,6 +3995,16 @@ redef class AAssertExpr end return end + if _n_else == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa AExpr + _n_else = new_child + else + _n_else = null + end + return + end end redef fun visit_all(v: Visitor) @@ -5419,34 +4014,17 @@ redef class AAssertExpr v.enter_visit(_n_id.as(not null)) end v.enter_visit(_n_expr) - end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwassert) - if _n_id != null then - v.enter_visit(_n_id.as(not null)) + if _n_else != null then + v.enter_visit(_n_else.as(not null)) end - v.enter_visit(_n_expr) end end redef class AOnceExpr - redef fun n_kwonce=(n) - do - _n_kwonce = n - n.parent = self - end - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - private init empty_init do end init init_aonceexpr ( - n_kwonce: nullable TKwonce , - n_expr: nullable AExpr + n_kwonce: nullable TKwonce, + n_expr: nullable AExpr ) do empty_init @@ -5485,24 +4063,12 @@ redef class AOnceExpr v.enter_visit(_n_kwonce) v.enter_visit(_n_expr) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwonce) - v.enter_visit(_n_expr) - end end redef class ASendExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - private init empty_init do end init init_asendexpr ( - n_expr: nullable AExpr + n_expr: nullable AExpr ) do empty_init @@ -5528,29 +4094,13 @@ redef class ASendExpr do v.enter_visit(_n_expr) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - end end redef class ABinopExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - private init empty_init do end init init_abinopexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5589,30 +4139,58 @@ redef class ABinopExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end redef class AOrExpr - redef fun n_expr=(n) + private init empty_init do end + + init init_aorexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr + ) do - _n_expr = n - n.parent = self + empty_init + _n_expr = n_expr.as(not null) + n_expr.parent = self + _n_expr2 = n_expr2.as(not null) + n_expr2.parent = self end - redef fun n_expr2=(n) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_expr2 = n - n.parent = self + if _n_expr == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa AExpr + _n_expr = new_child + else + abort + end + return + end + if _n_expr2 == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa AExpr + _n_expr2 = new_child + else + abort + end + return + end end + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_expr) + v.enter_visit(_n_expr2) + end +end +redef class AAndExpr private init empty_init do end - init init_aorexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + init init_aandexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5651,30 +4229,103 @@ redef class AOrExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end +end +redef class AOrElseExpr + private init empty_init do end - redef fun visit_all_reverse(v: Visitor) + init init_aorelseexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr + ) + do + empty_init + _n_expr = n_expr.as(not null) + n_expr.parent = self + _n_expr2 = n_expr2.as(not null) + n_expr2.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_expr == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa AExpr + _n_expr = new_child + else + abort + end + return + end + if _n_expr2 == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa AExpr + _n_expr2 = new_child + else + abort + end + return + end + end + + redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end end -redef class AAndExpr - redef fun n_expr=(n) +redef class ANotExpr + private init empty_init do end + + init init_anotexpr ( + n_kwnot: nullable TKwnot, + n_expr: nullable AExpr + ) do - _n_expr = n - n.parent = self + empty_init + _n_kwnot = n_kwnot.as(not null) + n_kwnot.parent = self + _n_expr = n_expr.as(not null) + n_expr.parent = self end - redef fun n_expr2=(n) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_expr2 = n - n.parent = self + if _n_kwnot == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa TKwnot + _n_kwnot = new_child + else + abort + end + return + end + if _n_expr == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa AExpr + _n_expr = new_child + else + abort + end + return + end end + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_kwnot) + v.enter_visit(_n_expr) + end +end +redef class AEqExpr private init empty_init do end - init init_aandexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + init init_aeqexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5713,56 +4364,39 @@ redef class AAndExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end -redef class ANotExpr - redef fun n_kwnot=(n) - do - _n_kwnot = n - n.parent = self - end - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - +redef class AEeExpr private init empty_init do end - init init_anotexpr ( - n_kwnot: nullable TKwnot , - n_expr: nullable AExpr + init init_aeeexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init - _n_kwnot = n_kwnot.as(not null) - n_kwnot.parent = self _n_expr = n_expr.as(not null) n_expr.parent = self + _n_expr2 = n_expr2.as(not null) + n_expr2.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_kwnot == old_child then + if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa TKwnot - _n_kwnot = new_child + assert new_child isa AExpr + _n_expr = new_child else abort end return end - if _n_expr == old_child then + if _n_expr2 == old_child then if new_child != null then new_child.parent = self assert new_child isa AExpr - _n_expr = new_child + _n_expr2 = new_child else abort end @@ -5772,33 +4406,16 @@ redef class ANotExpr redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwnot) - v.enter_visit(_n_expr) - end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwnot) v.enter_visit(_n_expr) + v.enter_visit(_n_expr2) end end -redef class AEqExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - +redef class ANeExpr private init empty_init do end - init init_aeqexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + init init_aneexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5837,30 +4454,13 @@ redef class AEqExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end -redef class AEeExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - +redef class ALtExpr private init empty_init do end - init init_aeeexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + init init_altexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5899,30 +4499,13 @@ redef class AEeExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end -redef class ANeExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - +redef class ALeExpr private init empty_init do end - init init_aneexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + init init_aleexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5961,30 +4544,13 @@ redef class ANeExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end -redef class ALtExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - +redef class ALlExpr private init empty_init do end - init init_altexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + init init_allexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6023,30 +4589,13 @@ redef class ALtExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end -redef class ALeExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - +redef class AGtExpr private init empty_init do end - init init_aleexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + init init_agtexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6085,30 +4634,13 @@ redef class ALeExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end -redef class AGtExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - +redef class AGeExpr private init empty_init do end - init init_agtexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + init init_ageexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6147,30 +4679,13 @@ redef class AGtExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end -redef class AGeExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - +redef class AGgExpr private init empty_init do end - init init_ageexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + init init_aggexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6209,30 +4724,13 @@ redef class AGeExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end redef class AIsaExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_type=(n) - do - _n_type = n - n.parent = self - end - private init empty_init do end init init_aisaexpr ( - n_expr: nullable AExpr , - n_type: nullable AType + n_expr: nullable AExpr, + n_type: nullable AType ) do empty_init @@ -6271,30 +4769,13 @@ redef class AIsaExpr v.enter_visit(_n_expr) v.enter_visit(_n_type) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_type) - end end redef class APlusExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - private init empty_init do end init init_aplusexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6333,30 +4814,13 @@ redef class APlusExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end redef class AMinusExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - private init empty_init do end init init_aminusexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6395,30 +4859,13 @@ redef class AMinusExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end redef class AStarshipExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - private init empty_init do end init init_astarshipexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6457,30 +4904,13 @@ redef class AStarshipExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end redef class AStarExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - private init empty_init do end init init_astarexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6519,30 +4949,13 @@ redef class AStarExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end redef class ASlashExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - private init empty_init do end init init_aslashexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6581,30 +4994,13 @@ redef class ASlashExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end redef class APercentExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - private init empty_init do end init init_apercentexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6643,30 +5039,13 @@ redef class APercentExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end redef class AUminusExpr - redef fun n_minus=(n) - do - _n_minus = n - n.parent = self - end - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - private init empty_init do end init init_auminusexpr ( - n_minus: nullable TMinus , - n_expr: nullable AExpr + n_minus: nullable TMinus, + n_expr: nullable AExpr ) do empty_init @@ -6705,39 +5084,15 @@ redef class AUminusExpr v.enter_visit(_n_minus) v.enter_visit(_n_expr) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_minus) - v.enter_visit(_n_expr) - end end redef class ANewExpr - redef fun n_kwnew=(n) - do - _n_kwnew = n - n.parent = self - end - redef fun n_type=(n) - do - _n_type = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_anewexpr ( - n_kwnew: nullable TKwnew , - n_type: nullable AType , - n_id: nullable TId , - n_args: Collection[Object] # Should be Collection[AExpr] + n_kwnew: nullable TKwnew, + n_type: nullable AType, + n_id: nullable TId, + n_args: Collection[Object] # Should be Collection[AExpr] ) do empty_init @@ -6813,40 +5168,13 @@ redef class ANewExpr v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwnew) - v.enter_visit(_n_type) - if _n_id != null then - v.enter_visit(_n_id.as(not null)) - end - do - var i = _n_args.length - while i >= 0 do - v.enter_visit(_n_args[i]) - i = i - 1 - end - end - end end redef class AAttrExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - private init empty_init do end init init_aattrexpr ( - n_expr: nullable AExpr , - n_id: nullable TAttrid + n_expr: nullable AExpr, + n_id: nullable TAttrid ) do empty_init @@ -6877,50 +5205,23 @@ redef class AAttrExpr abort end return - end - end - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_id) - end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_id) - end -end -redef class AAttrAssignExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_assign=(n) - do - _n_assign = n - n.parent = self + end end - redef fun n_value=(n) + + redef fun visit_all(v: Visitor) do - _n_value = n - n.parent = self + v.enter_visit(_n_expr) + v.enter_visit(_n_id) end - +end +redef class AAttrAssignExpr private init empty_init do end init init_aattrassignexpr ( - n_expr: nullable AExpr , - n_id: nullable TAttrid , - n_assign: nullable TAssign , - n_value: nullable AExpr + n_expr: nullable AExpr, + n_id: nullable TAttrid, + n_assign: nullable TAssign, + n_value: nullable AExpr ) do empty_init @@ -6985,44 +5286,15 @@ redef class AAttrAssignExpr v.enter_visit(_n_assign) v.enter_visit(_n_value) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_id) - v.enter_visit(_n_assign) - v.enter_visit(_n_value) - end end redef class AAttrReassignExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_assign_op=(n) - do - _n_assign_op = n - n.parent = self - end - redef fun n_value=(n) - do - _n_value = n - n.parent = self - end - private init empty_init do end init init_aattrreassignexpr ( - n_expr: nullable AExpr , - n_id: nullable TAttrid , - n_assign_op: nullable AAssignOp , - n_value: nullable AExpr + n_expr: nullable AExpr, + n_id: nullable TAttrid, + n_assign_op: nullable AAssignOp, + n_value: nullable AExpr ) do empty_init @@ -7087,34 +5359,15 @@ redef class AAttrReassignExpr v.enter_visit(_n_assign_op) v.enter_visit(_n_value) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_id) - v.enter_visit(_n_assign_op) - v.enter_visit(_n_value) - end end redef class ACallExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - private init empty_init do end init init_acallexpr ( - n_expr: nullable AExpr , - n_id: nullable TId , - n_args: Collection[Object] , # Should be Collection[AExpr] - n_closure_defs: Collection[Object] # Should be Collection[AClosureDef] + n_expr: nullable AExpr, + n_id: nullable TId, + n_args: Collection[Object], # Should be Collection[AExpr] + n_closure_defs: Collection[Object] # Should be Collection[AClosureDef] ) do empty_init @@ -7193,57 +5446,16 @@ redef class ACallExpr v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_id) - do - var i = _n_args.length - while i >= 0 do - v.enter_visit(_n_args[i]) - i = i - 1 - end - end - do - var i = _n_closure_defs.length - while i >= 0 do - v.enter_visit(_n_closure_defs[i]) - i = i - 1 - end - end - end end redef class ACallAssignExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_assign=(n) - do - _n_assign = n - n.parent = self - end - redef fun n_value=(n) - do - _n_value = n - n.parent = self - end - private init empty_init do end init init_acallassignexpr ( - n_expr: nullable AExpr , - n_id: nullable TId , - n_args: Collection[Object] , # Should be Collection[AExpr] - n_assign: nullable TAssign , - n_value: nullable AExpr + n_expr: nullable AExpr, + n_id: nullable TId, + n_args: Collection[Object], # Should be Collection[AExpr] + n_assign: nullable TAssign, + n_value: nullable AExpr ) do empty_init @@ -7328,52 +5540,16 @@ redef class ACallAssignExpr v.enter_visit(_n_assign) v.enter_visit(_n_value) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_id) - do - var i = _n_args.length - while i >= 0 do - v.enter_visit(_n_args[i]) - i = i - 1 - end - end - v.enter_visit(_n_assign) - v.enter_visit(_n_value) - end end redef class ACallReassignExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_assign_op=(n) - do - _n_assign_op = n - n.parent = self - end - redef fun n_value=(n) - do - _n_value = n - n.parent = self - end - private init empty_init do end init init_acallreassignexpr ( - n_expr: nullable AExpr , - n_id: nullable TId , - n_args: Collection[Object] , # Should be Collection[AExpr] - n_assign_op: nullable AAssignOp , - n_value: nullable AExpr + n_expr: nullable AExpr, + n_id: nullable TId, + n_args: Collection[Object], # Should be Collection[AExpr] + n_assign_op: nullable AAssignOp, + n_value: nullable AExpr ) do empty_init @@ -7458,42 +5634,14 @@ redef class ACallReassignExpr v.enter_visit(_n_assign_op) v.enter_visit(_n_value) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_id) - do - var i = _n_args.length - while i >= 0 do - v.enter_visit(_n_args[i]) - i = i - 1 - end - end - v.enter_visit(_n_assign_op) - v.enter_visit(_n_value) - end end redef class ASuperExpr - redef fun n_qualified=(n) - do - _n_qualified = n - if n != null then - n.parent = self - end - end - redef fun n_kwsuper=(n) - do - _n_kwsuper = n - n.parent = self - end - private init empty_init do end init init_asuperexpr ( - n_qualified: nullable AQualified , - n_kwsuper: nullable TKwsuper , - n_args: Collection[Object] # Should be Collection[AExpr] + n_qualified: nullable AQualified, + n_kwsuper: nullable TKwsuper, + n_args: Collection[Object] # Should be Collection[AExpr] ) do empty_init @@ -7556,40 +5704,14 @@ redef class ASuperExpr v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_qualified != null then - v.enter_visit(_n_qualified.as(not null)) - end - v.enter_visit(_n_kwsuper) - do - var i = _n_args.length - while i >= 0 do - v.enter_visit(_n_args[i]) - i = i - 1 - end - end - end end redef class AInitExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_kwinit=(n) - do - _n_kwinit = n - n.parent = self - end - private init empty_init do end init init_ainitexpr ( - n_expr: nullable AExpr , - n_kwinit: nullable TKwinit , - n_args: Collection[Object] # Should be Collection[AExpr] + n_expr: nullable AExpr, + n_kwinit: nullable TKwinit, + n_args: Collection[Object] # Should be Collection[AExpr] ) do empty_init @@ -7648,33 +5770,14 @@ redef class AInitExpr v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_kwinit) - do - var i = _n_args.length - while i >= 0 do - v.enter_visit(_n_args[i]) - i = i - 1 - end - end - end end redef class ABraExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - private init empty_init do end init init_abraexpr ( - n_expr: nullable AExpr , - n_args: Collection[Object] , # Should be Collection[AExpr] - n_closure_defs: Collection[Object] # Should be Collection[AClosureDef] + n_expr: nullable AExpr, + n_args: Collection[Object], # Should be Collection[AExpr] + n_closure_defs: Collection[Object] # Should be Collection[AClosureDef] ) do empty_init @@ -7740,50 +5843,15 @@ redef class ABraExpr v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - do - var i = _n_args.length - while i >= 0 do - v.enter_visit(_n_args[i]) - i = i - 1 - end - end - do - var i = _n_closure_defs.length - while i >= 0 do - v.enter_visit(_n_closure_defs[i]) - i = i - 1 - end - end - end end redef class ABraAssignExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_assign=(n) - do - _n_assign = n - n.parent = self - end - redef fun n_value=(n) - do - _n_value = n - n.parent = self - end - private init empty_init do end init init_abraassignexpr ( - n_expr: nullable AExpr , - n_args: Collection[Object] , # Should be Collection[AExpr] - n_assign: nullable TAssign , - n_value: nullable AExpr + n_expr: nullable AExpr, + n_args: Collection[Object], # Should be Collection[AExpr] + n_assign: nullable TAssign, + n_value: nullable AExpr ) do empty_init @@ -7855,45 +5923,15 @@ redef class ABraAssignExpr v.enter_visit(_n_assign) v.enter_visit(_n_value) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - do - var i = _n_args.length - while i >= 0 do - v.enter_visit(_n_args[i]) - i = i - 1 - end - end - v.enter_visit(_n_assign) - v.enter_visit(_n_value) - end end redef class ABraReassignExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_assign_op=(n) - do - _n_assign_op = n - n.parent = self - end - redef fun n_value=(n) - do - _n_value = n - n.parent = self - end - private init empty_init do end init init_abrareassignexpr ( - n_expr: nullable AExpr , - n_args: Collection[Object] , # Should be Collection[AExpr] - n_assign_op: nullable AAssignOp , - n_value: nullable AExpr + n_expr: nullable AExpr, + n_args: Collection[Object], # Should be Collection[AExpr] + n_assign_op: nullable AAssignOp, + n_value: nullable AExpr ) do empty_init @@ -7965,34 +6003,14 @@ redef class ABraReassignExpr v.enter_visit(_n_assign_op) v.enter_visit(_n_value) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - do - var i = _n_args.length - while i >= 0 do - v.enter_visit(_n_args[i]) - i = i - 1 - end - end - v.enter_visit(_n_assign_op) - v.enter_visit(_n_value) - end end redef class AClosureCallExpr - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - private init empty_init do end init init_aclosurecallexpr ( - n_id: nullable TId , - n_args: Collection[Object] , # Should be Collection[AExpr] - n_closure_defs: Collection[Object] # Should be Collection[AClosureDef] + n_id: nullable TId, + n_args: Collection[Object], # Should be Collection[AExpr] + n_closure_defs: Collection[Object] # Should be Collection[AClosureDef] ) do empty_init @@ -8058,37 +6076,12 @@ redef class AClosureCallExpr v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_id) - do - var i = _n_args.length - while i >= 0 do - v.enter_visit(_n_args[i]) - i = i - 1 - end - end - do - var i = _n_closure_defs.length - while i >= 0 do - v.enter_visit(_n_closure_defs[i]) - i = i - 1 - end - end - end end redef class AVarExpr - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - private init empty_init do end init init_avarexpr ( - n_id: nullable TId + n_id: nullable TId ) do empty_init @@ -8114,35 +6107,14 @@ redef class AVarExpr do v.enter_visit(_n_id) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_id) - end end redef class AVarAssignExpr - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_assign=(n) - do - _n_assign = n - n.parent = self - end - redef fun n_value=(n) - do - _n_value = n - n.parent = self - end - private init empty_init do end init init_avarassignexpr ( - n_id: nullable TId , - n_assign: nullable TAssign , - n_value: nullable AExpr + n_id: nullable TId, + n_assign: nullable TAssign, + n_value: nullable AExpr ) do empty_init @@ -8194,37 +6166,14 @@ redef class AVarAssignExpr v.enter_visit(_n_assign) v.enter_visit(_n_value) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_id) - v.enter_visit(_n_assign) - v.enter_visit(_n_value) - end end redef class AVarReassignExpr - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - redef fun n_assign_op=(n) - do - _n_assign_op = n - n.parent = self - end - redef fun n_value=(n) - do - _n_value = n - n.parent = self - end - private init empty_init do end init init_avarreassignexpr ( - n_id: nullable TId , - n_assign_op: nullable AAssignOp , - n_value: nullable AExpr + n_id: nullable TId, + n_assign_op: nullable AAssignOp, + n_value: nullable AExpr ) do empty_init @@ -8276,31 +6225,13 @@ redef class AVarReassignExpr v.enter_visit(_n_assign_op) v.enter_visit(_n_value) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_id) - v.enter_visit(_n_assign_op) - v.enter_visit(_n_value) - end end redef class ARangeExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - private init empty_init do end init init_arangeexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -8339,30 +6270,13 @@ redef class ARangeExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end redef class ACrangeExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - private init empty_init do end init init_acrangeexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -8401,30 +6315,13 @@ redef class ACrangeExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end redef class AOrangeExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - private init empty_init do end init init_aorangeexpr ( - n_expr: nullable AExpr , - n_expr2: nullable AExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -8463,19 +6360,12 @@ redef class AOrangeExpr v.enter_visit(_n_expr) v.enter_visit(_n_expr2) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_expr2) - end end redef class AArrayExpr - private init empty_init do end init init_aarrayexpr ( - n_exprs: Collection[Object] # Should be Collection[AExpr] + n_exprs: Collection[Object] # Should be Collection[AExpr] ) do empty_init @@ -8508,29 +6398,12 @@ redef class AArrayExpr v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - do - var i = _n_exprs.length - while i >= 0 do - v.enter_visit(_n_exprs[i]) - i = i - 1 - end - end - end end redef class ASelfExpr - redef fun n_kwself=(n) - do - _n_kwself = n - n.parent = self - end - private init empty_init do end init init_aselfexpr ( - n_kwself: nullable TKwself + n_kwself: nullable TKwself ) do empty_init @@ -8556,14 +6429,8 @@ redef class ASelfExpr do v.enter_visit(_n_kwself) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwself) - end end redef class AImplicitSelfExpr - private init empty_init do end init init_aimplicitselfexpr @@ -8578,22 +6445,12 @@ redef class AImplicitSelfExpr redef fun visit_all(v: Visitor) do end - - redef fun visit_all_reverse(v: Visitor) - do - end end redef class ATrueExpr - redef fun n_kwtrue=(n) - do - _n_kwtrue = n - n.parent = self - end - private init empty_init do end init init_atrueexpr ( - n_kwtrue: nullable TKwtrue + n_kwtrue: nullable TKwtrue ) do empty_init @@ -8619,23 +6476,12 @@ redef class ATrueExpr do v.enter_visit(_n_kwtrue) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwtrue) - end end redef class AFalseExpr - redef fun n_kwfalse=(n) - do - _n_kwfalse = n - n.parent = self - end - private init empty_init do end init init_afalseexpr ( - n_kwfalse: nullable TKwfalse + n_kwfalse: nullable TKwfalse ) do empty_init @@ -8661,23 +6507,12 @@ redef class AFalseExpr do v.enter_visit(_n_kwfalse) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwfalse) - end end redef class ANullExpr - redef fun n_kwnull=(n) - do - _n_kwnull = n - n.parent = self - end - private init empty_init do end init init_anullexpr ( - n_kwnull: nullable TKwnull + n_kwnull: nullable TKwnull ) do empty_init @@ -8703,23 +6538,12 @@ redef class ANullExpr do v.enter_visit(_n_kwnull) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwnull) - end end redef class AIntExpr - redef fun n_number=(n) - do - _n_number = n - n.parent = self - end - private init empty_init do end init init_aintexpr ( - n_number: nullable TNumber + n_number: nullable TNumber ) do empty_init @@ -8745,23 +6569,12 @@ redef class AIntExpr do v.enter_visit(_n_number) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_number) - end end redef class AFloatExpr - redef fun n_float=(n) - do - _n_float = n - n.parent = self - end - private init empty_init do end init init_afloatexpr ( - n_float: nullable TFloat + n_float: nullable TFloat ) do empty_init @@ -8787,23 +6600,12 @@ redef class AFloatExpr do v.enter_visit(_n_float) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_float) - end end redef class ACharExpr - redef fun n_char=(n) - do - _n_char = n - n.parent = self - end - private init empty_init do end init init_acharexpr ( - n_char: nullable TChar + n_char: nullable TChar ) do empty_init @@ -8829,23 +6631,12 @@ redef class ACharExpr do v.enter_visit(_n_char) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_char) - end end redef class AStringExpr - redef fun n_string=(n) - do - _n_string = n - n.parent = self - end - private init empty_init do end init init_astringexpr ( - n_string: nullable TString + n_string: nullable TString ) do empty_init @@ -8871,23 +6662,12 @@ redef class AStringExpr do v.enter_visit(_n_string) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_string) - end end redef class AStartStringExpr - redef fun n_string=(n) - do - _n_string = n - n.parent = self - end - private init empty_init do end init init_astartstringexpr ( - n_string: nullable TStartString + n_string: nullable TStartString ) do empty_init @@ -8913,23 +6693,12 @@ redef class AStartStringExpr do v.enter_visit(_n_string) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_string) - end end redef class AMidStringExpr - redef fun n_string=(n) - do - _n_string = n - n.parent = self - end - private init empty_init do end init init_amidstringexpr ( - n_string: nullable TMidString + n_string: nullable TMidString ) do empty_init @@ -8955,23 +6724,12 @@ redef class AMidStringExpr do v.enter_visit(_n_string) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_string) - end end redef class AEndStringExpr - redef fun n_string=(n) - do - _n_string = n - n.parent = self - end - private init empty_init do end init init_aendstringexpr ( - n_string: nullable TEndString + n_string: nullable TEndString ) do empty_init @@ -8997,18 +6755,12 @@ redef class AEndStringExpr do v.enter_visit(_n_string) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_string) - end end redef class ASuperstringExpr - private init empty_init do end init init_asuperstringexpr ( - n_exprs: Collection[Object] # Should be Collection[AExpr] + n_exprs: Collection[Object] # Should be Collection[AExpr] ) do empty_init @@ -9041,29 +6793,12 @@ redef class ASuperstringExpr v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - do - var i = _n_exprs.length - while i >= 0 do - v.enter_visit(_n_exprs[i]) - i = i - 1 - end - end - end end redef class AParExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - private init empty_init do end init init_aparexpr ( - n_expr: nullable AExpr + n_expr: nullable AExpr ) do empty_init @@ -9089,35 +6824,14 @@ redef class AParExpr do v.enter_visit(_n_expr) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - end end redef class AAsCastExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_kwas=(n) - do - _n_kwas = n - n.parent = self - end - redef fun n_type=(n) - do - _n_type = n - n.parent = self - end - private init empty_init do end init init_aascastexpr ( - n_expr: nullable AExpr , - n_kwas: nullable TKwas , - n_type: nullable AType + n_expr: nullable AExpr, + n_kwas: nullable TKwas, + n_type: nullable AType ) do empty_init @@ -9169,43 +6883,15 @@ redef class AAsCastExpr v.enter_visit(_n_kwas) v.enter_visit(_n_type) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_kwas) - v.enter_visit(_n_type) - end end redef class AAsNotnullExpr - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_kwas=(n) - do - _n_kwas = n - n.parent = self - end - redef fun n_kwnot=(n) - do - _n_kwnot = n - n.parent = self - end - redef fun n_kwnull=(n) - do - _n_kwnull = n - n.parent = self - end - private init empty_init do end init init_aasnotnullexpr ( - n_expr: nullable AExpr , - n_kwas: nullable TKwas , - n_kwnot: nullable TKwnot , - n_kwnull: nullable TKwnull + n_expr: nullable AExpr, + n_kwas: nullable TKwas, + n_kwnot: nullable TKwnot, + n_kwnull: nullable TKwnull ) do empty_init @@ -9270,38 +6956,14 @@ redef class AAsNotnullExpr v.enter_visit(_n_kwnot) v.enter_visit(_n_kwnull) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) - v.enter_visit(_n_kwas) - v.enter_visit(_n_kwnot) - v.enter_visit(_n_kwnull) - end end redef class AIssetAttrExpr - redef fun n_kwisset=(n) - do - _n_kwisset = n - n.parent = self - end - redef fun n_expr=(n) - do - _n_expr = n - n.parent = self - end - redef fun n_id=(n) - do - _n_id = n - n.parent = self - end - private init empty_init do end init init_aissetattrexpr ( - n_kwisset: nullable TKwisset , - n_expr: nullable AExpr , - n_id: nullable TAttrid + n_kwisset: nullable TKwisset, + n_expr: nullable AExpr, + n_id: nullable TAttrid ) do empty_init @@ -9353,25 +7015,12 @@ redef class AIssetAttrExpr v.enter_visit(_n_expr) v.enter_visit(_n_id) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwisset) - v.enter_visit(_n_expr) - v.enter_visit(_n_id) - end end redef class APlusAssignOp - redef fun n_pluseq=(n) - do - _n_pluseq = n - n.parent = self - end - private init empty_init do end init init_aplusassignop ( - n_pluseq: nullable TPluseq + n_pluseq: nullable TPluseq ) do empty_init @@ -9397,23 +7046,12 @@ redef class APlusAssignOp do v.enter_visit(_n_pluseq) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_pluseq) - end end redef class AMinusAssignOp - redef fun n_minuseq=(n) - do - _n_minuseq = n - n.parent = self - end - private init empty_init do end init init_aminusassignop ( - n_minuseq: nullable TMinuseq + n_minuseq: nullable TMinuseq ) do empty_init @@ -9439,58 +7077,33 @@ redef class AMinusAssignOp do v.enter_visit(_n_minuseq) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_minuseq) - end end redef class AClosureDef - redef fun n_kwwith=(n) - do - _n_kwwith = n - n.parent = self - end - redef fun n_kwdo=(n) - do - _n_kwdo = n - n.parent = self - end - redef fun n_expr=(n) - do - _n_expr = n - if n != null then - n.parent = self - end - end - redef fun n_label=(n) - do - _n_label = n - if n != null then - n.parent = self - end - end - private init empty_init do end init init_aclosuredef ( - n_kwwith: nullable TKwwith , - n_id: Collection[Object] , # Should be Collection[TId] - n_kwdo: nullable TKwdo , - n_expr: nullable AExpr , - n_label: nullable ALabel + n_bang: nullable TBang, + n_id: nullable AClosureId, + n_ids: Collection[Object], # Should be Collection[TId] + n_kwdo: nullable TKwdo, + n_expr: nullable AExpr, + n_label: nullable ALabel ) do empty_init - _n_kwwith = n_kwwith.as(not null) - n_kwwith.parent = self - for n in n_id do + _n_bang = n_bang.as(not null) + n_bang.parent = self + _n_id = n_id.as(not null) + n_id.parent = self + for n in n_ids do assert n isa TId - _n_id.add(n) + _n_ids.add(n) n.parent = self end - _n_kwdo = n_kwdo.as(not null) - n_kwdo.parent = self + _n_kwdo = n_kwdo + if n_kwdo != null then + n_kwdo.parent = self + end _n_expr = n_expr if n_expr != null then n_expr.parent = self @@ -9503,24 +7116,34 @@ redef class AClosureDef redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_kwwith == old_child then + if _n_bang == old_child then if new_child != null then new_child.parent = self - assert new_child isa TKwwith - _n_kwwith = new_child + assert new_child isa TBang + _n_bang = new_child else abort end return end - for i in [0.._n_id.length[ do - if _n_id[i] == old_child then + if _n_id == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa AClosureId + _n_id = new_child + else + abort + end + return + end + for i in [0.._n_ids.length[ do + if _n_ids[i] == old_child then if new_child != null then assert new_child isa TId - _n_id[i] = new_child + _n_ids[i] = new_child new_child.parent = self else - _n_id.remove_at(i) + _n_ids.remove_at(i) end return end @@ -9531,7 +7154,7 @@ redef class AClosureDef assert new_child isa TKwdo _n_kwdo = new_child else - abort + _n_kwdo = null end return end @@ -9559,11 +7182,14 @@ redef class AClosureDef redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwwith) - for n in _n_id do + v.enter_visit(_n_bang) + v.enter_visit(_n_id) + for n in _n_ids do v.enter_visit(n) end - v.enter_visit(_n_kwdo) + if _n_kwdo != null then + v.enter_visit(_n_kwdo.as(not null)) + end if _n_expr != null then v.enter_visit(_n_expr.as(not null)) end @@ -9571,40 +7197,75 @@ redef class AClosureDef v.enter_visit(_n_label.as(not null)) end end +end +redef class ASimpleClosureId + private init empty_init do end + + init init_asimpleclosureid ( + n_id: nullable TId + ) + do + empty_init + _n_id = n_id.as(not null) + n_id.parent = self + end - redef fun visit_all_reverse(v: Visitor) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - v.enter_visit(_n_kwwith) - do - var i = _n_id.length - while i >= 0 do - v.enter_visit(_n_id[i]) - i = i - 1 - end + if _n_id == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa TId + _n_id = new_child + else + abort + end + return end - v.enter_visit(_n_kwdo) - if _n_expr != null then - v.enter_visit(_n_expr.as(not null)) - end - if _n_label != null then - v.enter_visit(_n_label.as(not null)) - end + end + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_id) end end -redef class AQualified - redef fun n_classid=(n) +redef class ABreakClosureId + private init empty_init do end + + init init_abreakclosureid ( + n_kwbreak: nullable TKwbreak + ) do - _n_classid = n - if n != null then - n.parent = self - end + empty_init + _n_kwbreak = n_kwbreak.as(not null) + n_kwbreak.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_kwbreak == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa TKwbreak + _n_kwbreak = new_child + else + abort + end + return + end end + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_kwbreak) + end +end +redef class AQualified private init empty_init do end init init_aqualified ( - n_id: Collection[Object] , # Should be Collection[TId] - n_classid: nullable TClassid + n_id: Collection[Object], # Should be Collection[TId] + n_classid: nullable TClassid ) do empty_init @@ -9654,27 +7315,12 @@ redef class AQualified v.enter_visit(_n_classid.as(not null)) end end - - redef fun visit_all_reverse(v: Visitor) - do - do - var i = _n_id.length - while i >= 0 do - v.enter_visit(_n_id[i]) - i = i - 1 - end - end - if _n_classid != null then - v.enter_visit(_n_classid.as(not null)) - end - end end redef class ADoc - private init empty_init do end init init_adoc ( - n_comment: Collection[Object] # Should be Collection[TComment] + n_comment: Collection[Object] # Should be Collection[TComment] ) do empty_init @@ -9707,17 +7353,6 @@ redef class ADoc v.enter_visit(n) end end - - redef fun visit_all_reverse(v: Visitor) - do - do - var i = _n_comment.length - while i >= 0 do - v.enter_visit(_n_comment[i]) - i = i - 1 - end - end - end end redef class Start @@ -9748,12 +7383,6 @@ redef class Start if _n_base != null then v.enter_visit(_n_base.as(not null)) end - end - - redef fun visit_all_reverse(v: Visitor) - do - if _n_base != null then - v.enter_visit(_n_base.as(not null)) - end + v.enter_visit(_n_eof) end end