X-Git-Url: http://nitlanguage.org diff --git a/src/parser/parser_prod.nit b/src/parser/parser_prod.nit index a45f736..0535648 100644 --- a/src/parser/parser_prod.nit +++ b/src/parser/parser_prod.nit @@ -1,25 +1,25 @@ # 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 -redef class PNode +redef class ANode # Parent of the node in the AST - readable writable var _parent: nullable PNode + readable writable var _parent: nullable ANode # Remove a child from the AST - fun remove_child(child: PNode) + fun remove_child(child: ANode) do replace_child(child, null) end # Replace a child with an other node in the AST - fun replace_child(old_child: PNode, new_child: nullable PNode) is abstract + fun replace_child(old_child: ANode, new_child: nullable ANode) is abstract # Replace itself with an other node in the AST - fun replace_with(node: PNode) + fun replace_with(node: ANode) do if (_parent != null) then _parent.replace_child(self, node) @@ -29,46 +29,18 @@ redef class PNode # 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 - - # Give a human readable location of the node. - fun locate: String - do - if location == null then - return "????" - end - return location.to_s - end - - # Debug method: output a message prefixed with the location. - fun printl(str: String) - do - print("{locate}: {str}\n") - 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: PNode, new_child: nullable PNode) 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: PNode) + 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 @@ -77,12 +49,12 @@ end class Visitor # What the visitor do when a node is visited # Concrete visitors should redefine this method. - protected fun visit(e: nullable PNode) is abstract + protected fun visit(e: nullable ANode) is abstract # Ask the visitor to visit a given node. # Usually automatically called by visit_all* methods. # This methos should not be redefined - fun enter_visit(e: nullable PNode) + fun enter_visit(e: nullable ANode) do var old = _current_node _current_node = e @@ -91,24 +63,16 @@ class Visitor end # The current visited node - readable var _current_node: nullable PNode = null + readable var _current_node: nullable ANode = null 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 PPackagedecl , - n_imports: Collection[Object] , # Should be Collection[PImport] - n_classdefs: Collection[Object] # Should be Collection[PClassdef] + n_packagedecl: nullable APackagedecl, + n_imports: Collection[Object], # Should be Collection[AImport] + n_classdefs: Collection[Object] # Should be Collection[AClassdef] ) do empty_init @@ -117,23 +81,23 @@ redef class AModule n_packagedecl.parent = self end for n in n_imports do - assert n isa PImport + assert n isa AImport _n_imports.add(n) n.parent = self end for n in n_classdefs do - assert n isa PClassdef + assert n isa AClassdef _n_classdefs.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_packagedecl == old_child then if new_child != null then new_child.parent = self - assert new_child isa PPackagedecl + assert new_child isa APackagedecl _n_packagedecl = new_child else _n_packagedecl = null @@ -143,7 +107,7 @@ redef class AModule for i in [0.._n_imports.length[ do if _n_imports[i] == old_child then if new_child != null then - assert new_child isa PImport + assert new_child isa AImport _n_imports[i] = new_child new_child.parent = self else @@ -155,7 +119,7 @@ redef class AModule for i in [0.._n_classdefs.length[ do if _n_classdefs[i] == old_child then if new_child != null then - assert new_child isa PClassdef + assert new_child isa AClassdef _n_classdefs[i] = new_child new_child.parent = self else @@ -178,53 +142,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 - private init empty_init do end init init_apackagedecl ( - n_doc: nullable PDoc , - n_kwpackage: nullable TKwpackage , - n_id: nullable TId + n_doc: nullable ADoc, + n_kwpackage: nullable TKwpackage, + n_id: nullable TId ) do empty_init @@ -238,12 +163,12 @@ redef class APackagedecl n_id.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_doc == old_child then if new_child != null then new_child.parent = self - assert new_child isa PDoc + assert new_child isa ADoc _n_doc = new_child else _n_doc = null @@ -280,39 +205,14 @@ redef class APackagedecl 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_id) - end end -redef class AImport - 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 - +redef class AStdImport private init empty_init do end - init init_aimport ( - n_visibility: nullable PVisibility , - n_kwimport: nullable TKwimport , - n_id: nullable TId + init init_astdimport ( + n_visibility: nullable AVisibility, + n_kwimport: nullable TKwimport, + n_id: nullable TId ) do empty_init @@ -324,12 +224,12 @@ redef class AImport n_id.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_visibility == old_child then if new_child != null then new_child.parent = self - assert new_child isa PVisibility + assert new_child isa AVisibility _n_visibility = new_child else abort @@ -364,37 +264,14 @@ redef class AImport 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 PVisibility , - n_kwimport: nullable TKwimport , - n_kwend: nullable TKwend + n_visibility: nullable AVisibility, + n_kwimport: nullable TKwimport, + n_kwend: nullable TKwend ) do empty_init @@ -406,12 +283,12 @@ redef class ANoImport n_kwend.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_visibility == old_child then if new_child != null then new_child.parent = self - assert new_child isa PVisibility + assert new_child isa AVisibility _n_visibility = new_child else abort @@ -446,16 +323,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 @@ -463,29 +332,19 @@ redef class APublicVisibility empty_init end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do end 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 @@ -493,7 +352,7 @@ redef class APrivateVisibility n_kwprivate.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwprivate == old_child then if new_child != null then @@ -511,23 +370,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 @@ -535,7 +383,7 @@ redef class AProtectedVisibility n_kwprotected.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwprotected == old_child then if new_child != null then @@ -553,23 +401,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 @@ -577,7 +414,7 @@ redef class AIntrudeVisibility n_kwintrude.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwintrude == old_child then if new_child != null then @@ -595,56 +432,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 AClassdef - 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 - +redef class AStdClassdef private init empty_init do end - init init_aclassdef ( - n_doc: nullable PDoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable PVisibility , - n_classkind: nullable PClasskind , - n_id: nullable TClassid , - n_formaldefs: Collection[Object] , # Should be Collection[PFormaldef] - n_superclasses: Collection[Object] , # Should be Collection[PSuperclass] - n_propdefs: Collection[Object] # Should be Collection[PPropdef] + 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] ) do empty_init @@ -665,28 +465,28 @@ redef class AClassdef n_id.parent = self end for n in n_formaldefs do - assert n isa PFormaldef + assert n isa AFormaldef _n_formaldefs.add(n) n.parent = self end for n in n_superclasses do - assert n isa PSuperclass + assert n isa ASuperclass _n_superclasses.add(n) n.parent = self end for n in n_propdefs do - assert n isa PPropdef + assert n isa APropdef _n_propdefs.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_doc == old_child then if new_child != null then new_child.parent = self - assert new_child isa PDoc + assert new_child isa ADoc _n_doc = new_child else _n_doc = null @@ -706,7 +506,7 @@ redef class AClassdef if _n_visibility == old_child then if new_child != null then new_child.parent = self - assert new_child isa PVisibility + assert new_child isa AVisibility _n_visibility = new_child else abort @@ -716,7 +516,7 @@ redef class AClassdef if _n_classkind == old_child then if new_child != null then new_child.parent = self - assert new_child isa PClasskind + assert new_child isa AClasskind _n_classkind = new_child else abort @@ -736,7 +536,7 @@ redef class AClassdef for i in [0.._n_formaldefs.length[ do if _n_formaldefs[i] == old_child then if new_child != null then - assert new_child isa PFormaldef + assert new_child isa AFormaldef _n_formaldefs[i] = new_child new_child.parent = self else @@ -748,7 +548,7 @@ redef class AClassdef for i in [0.._n_superclasses.length[ do if _n_superclasses[i] == old_child then if new_child != null then - assert new_child isa PSuperclass + assert new_child isa ASuperclass _n_superclasses[i] = new_child new_child.parent = self else @@ -760,7 +560,7 @@ redef class AClassdef for i in [0.._n_propdefs.length[ do if _n_propdefs[i] == old_child then if new_child != null then - assert new_child isa PPropdef + assert new_child isa APropdef _n_propdefs[i] = new_child new_child.parent = self else @@ -794,65 +594,28 @@ redef class AClassdef 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[PPropdef] + n_propdefs: Collection[Object] # Should be Collection[APropdef] ) do empty_init for n in n_propdefs do - assert n isa PPropdef + assert n isa APropdef _n_propdefs.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do for i in [0.._n_propdefs.length[ do if _n_propdefs[i] == old_child then if new_child != null then - assert new_child isa PPropdef + assert new_child isa APropdef _n_propdefs[i] = new_child new_child.parent = self else @@ -869,40 +632,28 @@ 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[PPropdef] + n_propdefs: Collection[Object] # Should be Collection[APropdef] ) do empty_init for n in n_propdefs do - assert n isa PPropdef + assert n isa APropdef _n_propdefs.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do for i in [0.._n_propdefs.length[ do if _n_propdefs[i] == old_child then if new_child != null then - assert new_child isa PPropdef + assert new_child isa APropdef _n_propdefs[i] = new_child new_child.parent = self else @@ -919,29 +670,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 @@ -949,7 +683,7 @@ redef class AConcreteClasskind n_kwclass.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwclass == old_child then if new_child != null then @@ -967,29 +701,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 @@ -999,7 +717,7 @@ redef class AAbstractClasskind n_kwclass.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwabstract == old_child then if new_child != null then @@ -1028,24 +746,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 @@ -1053,7 +759,7 @@ redef class AInterfaceClasskind n_kwinterface.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwinterface == old_child then if new_child != null then @@ -1071,23 +777,12 @@ 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 - private init empty_init do end init init_auniversalclasskind ( - n_kwuniversal: nullable TKwuniversal + n_kwuniversal: nullable TKwuniversal ) do empty_init @@ -1095,7 +790,7 @@ redef class AUniversalClasskind n_kwuniversal.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwuniversal == old_child then if new_child != null then @@ -1113,31 +808,13 @@ redef class AUniversalClasskind do v.enter_visit(_n_kwuniversal) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwuniversal) - 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 PType + n_id: nullable TClassid, + n_type: nullable AType ) do empty_init @@ -1149,7 +826,7 @@ redef class AFormaldef end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_id == old_child then if new_child != null then @@ -1164,7 +841,7 @@ redef class AFormaldef if _n_type == old_child then if new_child != null then new_child.parent = self - assert new_child isa PType + assert new_child isa AType _n_type = new_child else _n_type = null @@ -1180,42 +857,30 @@ 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 PType + 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 - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwspecial == old_child then if new_child != null then @@ -1223,14 +888,24 @@ 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 if _n_type == old_child then if new_child != null then new_child.parent = self - assert new_child isa PType + assert new_child isa AType _n_type = new_child else abort @@ -1241,97 +916,28 @@ 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 PDoc , - n_readable: nullable PAble , - n_writable: nullable PAble , - n_kwredef: nullable TKwredef , - n_visibility: nullable PVisibility , - n_kwattr: nullable TKwattr , - n_kwvar: nullable TKwvar , - n_id: nullable TAttrid , - n_type: nullable PType , - n_expr: nullable PExpr + 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_type: nullable AType, + n_expr: nullable AExpr ) do empty_init @@ -1353,14 +959,8 @@ 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 - end - _n_kwvar = n_kwvar - if n_kwvar != null then - n_kwvar.parent = self - end + _n_kwvar = n_kwvar.as(not null) + n_kwvar.parent = self _n_id = n_id.as(not null) n_id.parent = self _n_type = n_type @@ -1373,12 +973,12 @@ redef class AAttrPropdef end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_doc == old_child then if new_child != null then new_child.parent = self - assert new_child isa PDoc + assert new_child isa ADoc _n_doc = new_child else _n_doc = null @@ -1388,7 +988,7 @@ redef class AAttrPropdef if _n_readable == old_child then if new_child != null then new_child.parent = self - assert new_child isa PAble + assert new_child isa AAble _n_readable = new_child else _n_readable = null @@ -1398,7 +998,7 @@ redef class AAttrPropdef if _n_writable == old_child then if new_child != null then new_child.parent = self - assert new_child isa PAble + assert new_child isa AAble _n_writable = new_child else _n_writable = null @@ -1418,30 +1018,20 @@ redef class AAttrPropdef if _n_visibility == old_child then if new_child != null then new_child.parent = self - assert new_child isa PVisibility + assert new_child isa AVisibility _n_visibility = new_child else abort 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 @@ -1458,7 +1048,7 @@ redef class AAttrPropdef if _n_type == old_child then if new_child != null then new_child.parent = self - assert new_child isa PType + assert new_child isa AType _n_type = new_child else _n_type = null @@ -1468,7 +1058,7 @@ redef class AAttrPropdef if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else _n_expr = null @@ -1492,42 +1082,7 @@ 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)) - end - if _n_kwvar != null then - v.enter_visit(_n_kwvar.as(not null)) - end + v.enter_visit(_n_kwvar) v.enter_visit(_n_id) if _n_type != null then v.enter_visit(_n_type.as(not null)) @@ -1538,44 +1093,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 PDoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable PVisibility , - n_methid: nullable PMethid , - n_signature: nullable PSignature + n_doc: nullable ADoc, + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, + n_methid: nullable AMethid, + n_signature: nullable ASignature ) do empty_init @@ -1595,12 +1120,12 @@ redef class AMethPropdef n_signature.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_doc == old_child then if new_child != null then new_child.parent = self - assert new_child isa PDoc + assert new_child isa ADoc _n_doc = new_child else _n_doc = null @@ -1620,7 +1145,7 @@ redef class AMethPropdef if _n_visibility == old_child then if new_child != null then new_child.parent = self - assert new_child isa PVisibility + assert new_child isa AVisibility _n_visibility = new_child else abort @@ -1630,7 +1155,7 @@ redef class AMethPropdef if _n_methid == old_child then if new_child != null then new_child.parent = self - assert new_child isa PMethid + assert new_child isa AMethid _n_methid = new_child else abort @@ -1640,7 +1165,7 @@ redef class AMethPropdef if _n_signature == old_child then if new_child != null then new_child.parent = self - assert new_child isa PSignature + assert new_child isa ASignature _n_signature = new_child else abort @@ -1661,65 +1186,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 PDoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable PVisibility , - n_kwmeth: nullable TKwmeth , - n_methid: nullable PMethid , - n_signature: nullable PSignature + 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 @@ -1741,12 +1218,12 @@ redef class ADeferredMethPropdef n_signature.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_doc == old_child then if new_child != null then new_child.parent = self - assert new_child isa PDoc + assert new_child isa ADoc _n_doc = new_child else _n_doc = null @@ -1766,7 +1243,7 @@ redef class ADeferredMethPropdef if _n_visibility == old_child then if new_child != null then new_child.parent = self - assert new_child isa PVisibility + assert new_child isa AVisibility _n_visibility = new_child else abort @@ -1786,7 +1263,7 @@ redef class ADeferredMethPropdef if _n_methid == old_child then if new_child != null then new_child.parent = self - assert new_child isa PMethid + assert new_child isa AMethid _n_methid = new_child else abort @@ -1796,7 +1273,7 @@ redef class ADeferredMethPropdef if _n_signature == old_child then if new_child != null then new_child.parent = self - assert new_child isa PSignature + assert new_child isa ASignature _n_signature = new_child else abort @@ -1818,66 +1295,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 PDoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable PVisibility , - n_kwmeth: nullable TKwmeth , - n_methid: nullable PMethid , - n_signature: nullable PSignature + 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 @@ -1899,12 +1327,12 @@ redef class AInternMethPropdef n_signature.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_doc == old_child then if new_child != null then new_child.parent = self - assert new_child isa PDoc + assert new_child isa ADoc _n_doc = new_child else _n_doc = null @@ -1924,7 +1352,7 @@ redef class AInternMethPropdef if _n_visibility == old_child then if new_child != null then new_child.parent = self - assert new_child isa PVisibility + assert new_child isa AVisibility _n_visibility = new_child else abort @@ -1944,7 +1372,7 @@ redef class AInternMethPropdef if _n_methid == old_child then if new_child != null then new_child.parent = self - assert new_child isa PMethid + assert new_child isa AMethid _n_methid = new_child else abort @@ -1954,7 +1382,7 @@ redef class AInternMethPropdef if _n_signature == old_child then if new_child != null then new_child.parent = self - assert new_child isa PSignature + assert new_child isa ASignature _n_signature = new_child else abort @@ -1976,74 +1404,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 PDoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable PVisibility , - n_kwmeth: nullable TKwmeth , - n_methid: nullable PMethid , - n_signature: nullable PSignature , - 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 @@ -2069,12 +1441,12 @@ redef class AExternMethPropdef end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_doc == old_child then if new_child != null then new_child.parent = self - assert new_child isa PDoc + assert new_child isa ADoc _n_doc = new_child else _n_doc = null @@ -2094,7 +1466,7 @@ redef class AExternMethPropdef if _n_visibility == old_child then if new_child != null then new_child.parent = self - assert new_child isa PVisibility + assert new_child isa AVisibility _n_visibility = new_child else abort @@ -2114,7 +1486,7 @@ redef class AExternMethPropdef if _n_methid == old_child then if new_child != null then new_child.parent = self - assert new_child isa PMethid + assert new_child isa AMethid _n_methid = new_child else abort @@ -2124,7 +1496,7 @@ redef class AExternMethPropdef if _n_signature == old_child then if new_child != null then new_child.parent = self - assert new_child isa PSignature + assert new_child isa ASignature _n_signature = new_child else abort @@ -2159,77 +1531,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 PDoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable PVisibility , - n_kwmeth: nullable TKwmeth , - n_methid: nullable PMethid , - n_signature: nullable PSignature , - n_block: nullable PExpr + 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 @@ -2255,12 +1568,12 @@ redef class AConcreteMethPropdef end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_doc == old_child then if new_child != null then new_child.parent = self - assert new_child isa PDoc + assert new_child isa ADoc _n_doc = new_child else _n_doc = null @@ -2280,7 +1593,7 @@ redef class AConcreteMethPropdef if _n_visibility == old_child then if new_child != null then new_child.parent = self - assert new_child isa PVisibility + assert new_child isa AVisibility _n_visibility = new_child else abort @@ -2300,7 +1613,7 @@ redef class AConcreteMethPropdef if _n_methid == old_child then if new_child != null then new_child.parent = self - assert new_child isa PMethid + assert new_child isa AMethid _n_methid = new_child else abort @@ -2310,7 +1623,7 @@ redef class AConcreteMethPropdef if _n_signature == old_child then if new_child != null then new_child.parent = self - assert new_child isa PSignature + assert new_child isa ASignature _n_signature = new_child else abort @@ -2320,7 +1633,7 @@ redef class AConcreteMethPropdef if _n_block == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_block = new_child else _n_block = null @@ -2345,79 +1658,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 PDoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable PVisibility , - n_kwinit: nullable TKwinit , - n_methid: nullable PMethid , - n_signature: nullable PSignature , - n_block: nullable PExpr + 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 @@ -2445,12 +1697,12 @@ redef class AConcreteInitPropdef end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_doc == old_child then if new_child != null then new_child.parent = self - assert new_child isa PDoc + assert new_child isa ADoc _n_doc = new_child else _n_doc = null @@ -2470,7 +1722,7 @@ redef class AConcreteInitPropdef if _n_visibility == old_child then if new_child != null then new_child.parent = self - assert new_child isa PVisibility + assert new_child isa AVisibility _n_visibility = new_child else abort @@ -2490,7 +1742,7 @@ redef class AConcreteInitPropdef if _n_methid == old_child then if new_child != null then new_child.parent = self - assert new_child isa PMethid + assert new_child isa AMethid _n_methid = new_child else _n_methid = null @@ -2500,7 +1752,7 @@ redef class AConcreteInitPropdef if _n_signature == old_child then if new_child != null then new_child.parent = self - assert new_child isa PSignature + assert new_child isa ASignature _n_signature = new_child else abort @@ -2510,7 +1762,7 @@ redef class AConcreteInitPropdef if _n_block == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_block = new_child else _n_block = null @@ -2537,47 +1789,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 PExpr + n_kwredef: nullable TKwredef, + n_block: nullable AExpr ) do empty_init @@ -2591,7 +1809,7 @@ redef class AMainMethPropdef end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwredef == old_child then if new_child != null then @@ -2606,7 +1824,7 @@ redef class AMainMethPropdef if _n_block == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_block = new_child else _n_block = null @@ -2624,62 +1842,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 PDoc , - n_kwredef: nullable TKwredef , - n_visibility: nullable PVisibility , - n_kwtype: nullable TKwtype , - n_id: nullable TClassid , - n_type: nullable PType + 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 @@ -2701,12 +1874,12 @@ redef class ATypePropdef n_type.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_doc == old_child then if new_child != null then new_child.parent = self - assert new_child isa PDoc + assert new_child isa ADoc _n_doc = new_child else _n_doc = null @@ -2726,7 +1899,7 @@ redef class ATypePropdef if _n_visibility == old_child then if new_child != null then new_child.parent = self - assert new_child isa PVisibility + assert new_child isa AVisibility _n_visibility = new_child else abort @@ -2756,7 +1929,7 @@ redef class ATypePropdef if _n_type == old_child then if new_child != null then new_child.parent = self - assert new_child isa PType + assert new_child isa AType _n_type = new_child else abort @@ -2778,40 +1951,13 @@ redef class ATypePropdef v.enter_visit(_n_id) v.enter_visit(_n_type) 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 + n_kwredef: nullable TKwredef, + n_kwreadable: nullable TKwreadable ) do empty_init @@ -2823,7 +1969,7 @@ redef class AReadAble n_kwreadable.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwredef == old_child then if new_child != null then @@ -2854,34 +2000,13 @@ 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_kwwritable: nullable TKwwritable ) do empty_init @@ -2893,7 +2018,7 @@ redef class AWriteAble n_kwwritable.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwredef == old_child then if new_child != null then @@ -2924,26 +2049,12 @@ redef class AWriteAble 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)) - 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 @@ -2951,7 +2062,7 @@ redef class AIdMethid n_id.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_id == old_child then if new_child != null then @@ -2969,23 +2080,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 @@ -2993,7 +2093,7 @@ redef class APlusMethid n_plus.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_plus == old_child then if new_child != null then @@ -3011,23 +2111,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 @@ -3035,7 +2124,7 @@ redef class AMinusMethid n_minus.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_minus == old_child then if new_child != null then @@ -3053,23 +2142,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 @@ -3077,7 +2155,7 @@ redef class AStarMethid n_star.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_star == old_child then if new_child != null then @@ -3095,23 +2173,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 @@ -3119,7 +2186,7 @@ redef class ASlashMethid n_slash.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_slash == old_child then if new_child != null then @@ -3137,23 +2204,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 @@ -3161,7 +2217,7 @@ redef class APercentMethid n_percent.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_percent == old_child then if new_child != null then @@ -3179,23 +2235,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 @@ -3203,7 +2248,7 @@ redef class AEqMethid n_eq.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_eq == old_child then if new_child != null then @@ -3221,23 +2266,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 @@ -3245,7 +2279,7 @@ redef class ANeMethid n_ne.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_ne == old_child then if new_child != null then @@ -3263,23 +2297,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 @@ -3287,7 +2310,7 @@ redef class ALeMethid n_le.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_le == old_child then if new_child != null then @@ -3305,23 +2328,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 @@ -3329,7 +2341,7 @@ redef class AGeMethid n_ge.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_ge == old_child then if new_child != null then @@ -3347,23 +2359,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 @@ -3371,7 +2372,7 @@ redef class ALtMethid n_lt.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_lt == old_child then if new_child != null then @@ -3389,23 +2390,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 @@ -3413,7 +2403,7 @@ redef class AGtMethid n_gt.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_gt == old_child then if new_child != null then @@ -3431,29 +2421,13 @@ redef class AGtMethid do v.enter_visit(_n_gt) end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_gt) - end end redef class ABraMethid - 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 - 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 @@ -3463,7 +2437,7 @@ redef class ABraMethid n_cbra.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_obra == old_child then if new_child != null then @@ -3492,24 +2466,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 @@ -3517,7 +2479,7 @@ redef class AStarshipMethid n_starship.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_starship == old_child then if new_child != null then @@ -3535,29 +2497,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 @@ -3567,7 +2513,7 @@ redef class AAssignMethid n_assign.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_id == old_child then if new_child != null then @@ -3596,36 +2542,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 @@ -3637,7 +2561,7 @@ redef class ABraassignMethid n_assign.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_obra == old_child then if new_child != null then @@ -3677,34 +2601,19 @@ 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[PParam] - n_type: nullable PType , - n_closure_decls: Collection[Object] # Should be Collection[PClosureDecl] + n_params: Collection[Object], # Should be Collection[AParam] + n_type: nullable AType, + n_closure_decls: Collection[Object] # Should be Collection[AClosureDecl] ) do empty_init for n in n_params do - assert n isa PParam + assert n isa AParam _n_params.add(n) n.parent = self end @@ -3713,18 +2622,18 @@ redef class ASignature n_type.parent = self end for n in n_closure_decls do - assert n isa PClosureDecl + assert n isa AClosureDecl _n_closure_decls.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do for i in [0.._n_params.length[ do if _n_params[i] == old_child then if new_child != null then - assert new_child isa PParam + assert new_child isa AParam _n_params[i] = new_child new_child.parent = self else @@ -3736,7 +2645,7 @@ redef class ASignature if _n_type == old_child then if new_child != null then new_child.parent = self - assert new_child isa PType + assert new_child isa AType _n_type = new_child else _n_type = null @@ -3746,7 +2655,7 @@ redef class ASignature for i in [0.._n_closure_decls.length[ do if _n_closure_decls[i] == old_child then if new_child != null then - assert new_child isa PClosureDecl + assert new_child isa AClosureDecl _n_closure_decls[i] = new_child new_child.parent = self else @@ -3769,55 +2678,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 PType , - n_dotdotdot: nullable TDotdotdot + n_id: nullable TId, + n_type: nullable AType, + n_dotdotdot: nullable TDotdotdot ) do empty_init @@ -3833,7 +2701,7 @@ redef class AParam end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_id == old_child then if new_child != null then @@ -3848,7 +2716,7 @@ redef class AParam if _n_type == old_child then if new_child != null then new_child.parent = self - assert new_child isa PType + assert new_child isa AType _n_type = new_child else _n_type = null @@ -3877,66 +2745,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 PSignature , - n_expr: nullable PExpr + 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) @@ -3947,25 +2774,25 @@ redef class AClosureDecl end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 @@ -3982,7 +2809,7 @@ redef class AClosureDecl if _n_signature == old_child then if new_child != null then new_child.parent = self - assert new_child isa PSignature + assert new_child isa ASignature _n_signature = new_child else abort @@ -3992,7 +2819,7 @@ redef class AClosureDecl if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else _n_expr = null @@ -4003,23 +2830,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 @@ -4028,25 +2842,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[PType] + n_kwnullable: nullable TKwnullable, + n_id: nullable TClassid, + n_types: Collection[Object] # Should be Collection[AType] ) do empty_init @@ -4057,13 +2858,13 @@ redef class AType _n_id = n_id.as(not null) n_id.parent = self for n in n_types do - assert n isa PType + assert n isa AType _n_types.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwnullable == old_child then if new_child != null then @@ -4088,7 +2889,7 @@ redef class AType for i in [0.._n_types.length[ do if _n_types[i] == old_child then if new_child != null then - assert new_child isa PType + assert new_child isa AType _n_types[i] = new_child new_child.parent = self else @@ -4109,113 +2910,99 @@ 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 ABlockExpr - +redef class ALabel private init empty_init do end - init init_ablockexpr ( - n_expr: Collection[Object] # Should be Collection[PExpr] + init init_alabel ( + n_kwlabel: nullable TKwlabel, + n_id: nullable TId ) do empty_init - for n in n_expr do - assert n isa PExpr - _n_expr.add(n) - n.parent = self - end + _n_kwlabel = n_kwlabel.as(not null) + n_kwlabel.parent = self + _n_id = n_id.as(not null) + n_id.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - for i in [0.._n_expr.length[ do - if _n_expr[i] == old_child then - if new_child != null then - assert new_child isa PExpr - _n_expr[i] = new_child - new_child.parent = self - else - _n_expr.remove_at(i) - end - return + if _n_kwlabel == old_child then + if new_child != null then + new_child.parent = self + assert new_child isa TKwlabel + _n_kwlabel = new_child + else + abort end - end - end + return + 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 + end redef fun visit_all(v: Visitor) do - for n in _n_expr do - v.enter_visit(n) - end + v.enter_visit(_n_kwlabel) + v.enter_visit(_n_id) end +end +redef class ABlockExpr + private init empty_init do end - redef fun visit_all_reverse(v: Visitor) + init init_ablockexpr ( + n_expr: Collection[Object] # Should be Collection[AExpr] + ) do - do - var i = _n_expr.length - while i >= 0 do - v.enter_visit(_n_expr[i]) - i = i - 1 - end + empty_init + for n in n_expr do + assert n isa AExpr + _n_expr.add(n) + n.parent = self 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) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_assign = n - if n != null then - n.parent = self + for i in [0.._n_expr.length[ do + if _n_expr[i] == old_child then + if new_child != null then + assert new_child isa AExpr + _n_expr[i] = new_child + new_child.parent = self + else + _n_expr.remove_at(i) + end + return + end end end - redef fun n_expr=(n) + + redef fun visit_all(v: Visitor) do - _n_expr = n - if n != null then - n.parent = self - end + for n in _n_expr do + v.enter_visit(n) + end end - +end +redef class AVardeclExpr private init empty_init do end init init_avardeclexpr ( - n_kwvar: nullable TKwvar , - n_id: nullable TId , - n_type: nullable PType , - n_assign: nullable TAssign , - n_expr: nullable PExpr + n_kwvar: nullable TKwvar, + n_id: nullable TId, + n_type: nullable AType, + n_assign: nullable TAssign, + n_expr: nullable AExpr ) do empty_init @@ -4237,7 +3024,7 @@ redef class AVardeclExpr end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwvar == old_child then if new_child != null then @@ -4262,7 +3049,7 @@ redef class AVardeclExpr if _n_type == old_child then if new_child != null then new_child.parent = self - assert new_child isa PType + assert new_child isa AType _n_type = new_child else _n_type = null @@ -4282,7 +3069,7 @@ redef class AVardeclExpr if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else _n_expr = null @@ -4305,53 +3092,27 @@ 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 PExpr + 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 end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwreturn == old_child then if new_child != null then @@ -4359,14 +3120,14 @@ redef class AReturnExpr assert new_child isa TKwreturn _n_kwreturn = new_child else - abort + _n_kwreturn = null end return end if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else _n_expr = null @@ -4377,51 +3138,37 @@ 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_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_expr: nullable PExpr + n_kwbreak: nullable TKwbreak, + n_label: nullable ALabel, + n_expr: nullable AExpr ) do empty_init _n_kwbreak = n_kwbreak.as(not null) n_kwbreak.parent = self + _n_label = n_label + if n_label != null then + n_label.parent = self + end _n_expr = n_expr if n_expr != null then n_expr.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwbreak == old_child then if new_child != null then @@ -4433,10 +3180,20 @@ redef class ABreakExpr 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 if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else _n_expr = null @@ -4448,30 +3205,19 @@ redef class ABreakExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_kwbreak) - if _n_expr != null then - v.enter_visit(_n_expr.as(not null)) + if _n_label != null then + v.enter_visit(_n_label.as(not null)) end - end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwbreak) 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 @@ -4479,7 +3225,7 @@ redef class AAbortExpr n_kwabort.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwabort == old_child then if new_child != null then @@ -4497,43 +3243,32 @@ 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_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_expr: nullable PExpr + 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 + end _n_expr = n_expr if n_expr != null then n_expr.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwcontinue == old_child then if new_child != null then @@ -4541,14 +3276,24 @@ redef class AContinueExpr assert new_child isa TKwcontinue _n_kwcontinue = new_child else - abort + _n_kwcontinue = 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 if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else _n_expr = null @@ -4559,39 +3304,24 @@ redef class AContinueExpr redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwcontinue) - 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 + if _n_label != null then + v.enter_visit(_n_label.as(not null)) end - end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwcontinue) if _n_expr != null then v.enter_visit(_n_expr.as(not null)) end 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 - private init empty_init do end init init_adoexpr ( - n_kwdo: nullable TKwdo , - n_block: nullable PExpr + n_kwdo: nullable TKwdo, + n_block: nullable AExpr, + n_label: nullable ALabel ) do empty_init @@ -4601,9 +3331,13 @@ redef class ADoExpr 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: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwdo == old_child then if new_child != null then @@ -4618,13 +3352,23 @@ redef class ADoExpr if _n_block == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + 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) @@ -4633,49 +3377,19 @@ redef class ADoExpr if _n_block != null then v.enter_visit(_n_block.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)) + 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 PExpr , - n_then: nullable PExpr , - n_else: nullable PExpr + n_kwif: nullable TKwif, + n_expr: nullable AExpr, + n_then: nullable AExpr, + n_else: nullable AExpr ) do empty_init @@ -4693,7 +3407,7 @@ redef class AIfExpr end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwif == old_child then if new_child != null then @@ -4708,7 +3422,7 @@ redef class AIfExpr if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -4718,7 +3432,7 @@ redef class AIfExpr if _n_then == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_then = new_child else _n_then = null @@ -4728,7 +3442,7 @@ redef class AIfExpr if _n_else == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_else = new_child else _n_else = null @@ -4748,60 +3462,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 PExpr , - n_kwthen: nullable TKwthen , - n_then: nullable PExpr , - n_kwelse: nullable TKwelse , - n_else: nullable PExpr + 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 @@ -4819,7 +3490,7 @@ redef class AIfexprExpr n_else.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwif == old_child then if new_child != null then @@ -4834,7 +3505,7 @@ redef class AIfexprExpr if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -4854,7 +3525,7 @@ redef class AIfexprExpr if _n_then == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_then = new_child else abort @@ -4874,7 +3545,7 @@ redef class AIfexprExpr if _n_else == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_else = new_child else abort @@ -4892,48 +3563,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 - private init empty_init do end init init_awhileexpr ( - n_kwwhile: nullable TKwwhile , - n_expr: nullable PExpr , - n_kwdo: nullable TKwdo , - n_block: nullable PExpr + n_kwwhile: nullable TKwwhile, + n_expr: nullable AExpr, + n_kwdo: nullable TKwdo, + n_block: nullable AExpr, + n_label: nullable ALabel ) do empty_init @@ -4947,9 +3586,13 @@ redef class AWhileExpr 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: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwwhile == old_child then if new_child != null then @@ -4964,7 +3607,7 @@ redef class AWhileExpr if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -4984,13 +3627,23 @@ redef class AWhileExpr if _n_block == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + 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) @@ -5001,55 +3654,88 @@ redef class AWhileExpr if _n_block != null then v.enter_visit(_n_block.as(not null)) end - end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_kwwhile) - v.enter_visit(_n_expr) - v.enter_visit(_n_kwdo) - if _n_block != null then - v.enter_visit(_n_block.as(not null)) + if _n_label != null then + v.enter_visit(_n_label.as(not null)) end 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) +redef class ALoopExpr + private init empty_init do end + + init init_aloopexpr ( + n_kwloop: nullable TKwloop, + n_block: nullable AExpr, + n_label: nullable ALabel + ) do - _n_expr = n - n.parent = self + 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 n_kwdo=(n) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_kwdo = n - n.parent = self + 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 n_block=(n) + + redef fun visit_all(v: Visitor) do - _n_block = n - if n != null then - n.parent = self + v.enter_visit(_n_kwloop) + 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 AForExpr private init empty_init do end init init_aforexpr ( - n_kwfor: nullable TKwfor , - n_id: nullable TId , - n_expr: nullable PExpr , - n_kwdo: nullable TKwdo , - n_block: nullable PExpr + 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 @@ -5065,9 +3751,13 @@ redef class AForExpr 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: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwfor == old_child then if new_child != null then @@ -5092,7 +3782,7 @@ redef class AForExpr if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5112,13 +3802,23 @@ redef class AForExpr if _n_block == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + 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) @@ -5130,44 +3830,19 @@ redef class AForExpr if _n_block != null then v.enter_visit(_n_block.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)) + 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 PExpr + n_kwassert: nullable TKwassert, + n_id: nullable TId, + n_expr: nullable AExpr, + n_else: nullable AExpr ) do empty_init @@ -5179,9 +3854,13 @@ 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: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwassert == old_child then if new_child != null then @@ -5206,13 +3885,23 @@ redef class AAssertExpr if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else abort 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) @@ -5222,34 +3911,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 PExpr + n_kwonce: nullable TKwonce, + n_expr: nullable AExpr ) do empty_init @@ -5259,7 +3931,7 @@ redef class AOnceExpr n_expr.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwonce == old_child then if new_child != null then @@ -5274,7 +3946,7 @@ redef class AOnceExpr if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5288,38 +3960,70 @@ redef class AOnceExpr v.enter_visit(_n_kwonce) v.enter_visit(_n_expr) end +end +redef class ASendExpr + private init empty_init do end - redef fun visit_all_reverse(v: Visitor) + init init_asendexpr ( + n_expr: nullable AExpr + ) do - v.enter_visit(_n_kwonce) - v.enter_visit(_n_expr) + empty_init + _n_expr = n_expr.as(not null) + n_expr.parent = self end -end -redef class ASendExpr - redef fun n_expr=(n) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_expr = 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 end + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_expr) + end +end +redef class ABinopExpr private init empty_init do end - init init_asendexpr ( - n_expr: nullable PExpr + init init_abinopexpr ( + 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: PNode, new_child: nullable PNode) + 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 PExpr - _n_expr = new_child + 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 @@ -5330,30 +4034,15 @@ redef class ASendExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) - end - - redef fun visit_all_reverse(v: Visitor) - do - v.enter_visit(_n_expr) + v.enter_visit(_n_expr2) 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 - +redef class AOrExpr private init empty_init do end - init init_abinopexpr ( - n_expr: nullable PExpr , - n_expr2: nullable PExpr + init init_aorexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5363,12 +4052,12 @@ redef class ABinopExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5378,7 +4067,7 @@ redef class ABinopExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -5392,30 +4081,13 @@ 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) - do - _n_expr = n - n.parent = self - end - redef fun n_expr2=(n) - do - _n_expr2 = n - n.parent = self - end - +redef class AAndExpr private init empty_init do end - init init_aorexpr ( - n_expr: nullable PExpr , - n_expr2: nullable PExpr + init init_aandexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5425,12 +4097,12 @@ redef class AOrExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5440,7 +4112,7 @@ redef class AOrExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -5454,30 +4126,13 @@ redef class AOrExpr 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 AAndExpr - 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 AOrElseExpr private init empty_init do end - init init_aandexpr ( - n_expr: nullable PExpr , - n_expr2: nullable PExpr + init init_aorelseexpr ( + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5487,12 +4142,12 @@ redef class AAndExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5502,7 +4157,7 @@ redef class AAndExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -5516,30 +4171,13 @@ 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 - private init empty_init do end init init_anotexpr ( - n_kwnot: nullable TKwnot , - n_expr: nullable PExpr + n_kwnot: nullable TKwnot, + n_expr: nullable AExpr ) do empty_init @@ -5549,7 +4187,7 @@ redef class ANotExpr n_expr.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwnot == old_child then if new_child != null then @@ -5564,7 +4202,7 @@ redef class ANotExpr if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5578,30 +4216,13 @@ redef class ANotExpr 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) - 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 - private init empty_init do end init init_aeqexpr ( - n_expr: nullable PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5611,12 +4232,12 @@ redef class AEqExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5626,7 +4247,7 @@ redef class AEqExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -5640,30 +4261,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 - private init empty_init do end init init_aeeexpr ( - n_expr: nullable PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5673,12 +4277,12 @@ redef class AEeExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5688,7 +4292,7 @@ redef class AEeExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -5702,30 +4306,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 - private init empty_init do end init init_aneexpr ( - n_expr: nullable PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5735,12 +4322,12 @@ redef class ANeExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5750,7 +4337,7 @@ redef class ANeExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -5764,30 +4351,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 - private init empty_init do end init init_altexpr ( - n_expr: nullable PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5797,12 +4367,12 @@ redef class ALtExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5812,7 +4382,7 @@ redef class ALtExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -5826,30 +4396,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 - private init empty_init do end init init_aleexpr ( - n_expr: nullable PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5859,12 +4412,12 @@ redef class ALeExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5874,7 +4427,7 @@ redef class ALeExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -5888,30 +4441,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 - private init empty_init do end init init_agtexpr ( - n_expr: nullable PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5921,12 +4457,12 @@ redef class AGtExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5936,7 +4472,7 @@ redef class AGtExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -5950,30 +4486,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 - private init empty_init do end init init_ageexpr ( - n_expr: nullable PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -5983,12 +4502,12 @@ redef class AGeExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -5998,7 +4517,7 @@ redef class AGeExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -6012,30 +4531,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 PExpr , - n_type: nullable PType + n_expr: nullable AExpr, + n_type: nullable AType ) do empty_init @@ -6045,12 +4547,12 @@ redef class AIsaExpr n_type.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -6060,7 +4562,7 @@ redef class AIsaExpr if _n_type == old_child then if new_child != null then new_child.parent = self - assert new_child isa PType + assert new_child isa AType _n_type = new_child else abort @@ -6074,30 +4576,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 PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6107,12 +4592,12 @@ redef class APlusExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -6122,7 +4607,7 @@ redef class APlusExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -6136,30 +4621,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 PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6169,12 +4637,12 @@ redef class AMinusExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -6184,7 +4652,7 @@ redef class AMinusExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -6198,30 +4666,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 PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6231,12 +4682,12 @@ redef class AStarshipExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -6246,7 +4697,7 @@ redef class AStarshipExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -6260,30 +4711,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 PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6293,12 +4727,12 @@ redef class AStarExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -6308,7 +4742,7 @@ redef class AStarExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -6322,30 +4756,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 PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6355,12 +4772,12 @@ redef class ASlashExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -6370,7 +4787,7 @@ redef class ASlashExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -6384,30 +4801,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 PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -6417,12 +4817,12 @@ redef class APercentExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -6432,7 +4832,7 @@ redef class APercentExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -6446,30 +4846,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 PExpr + n_minus: nullable TMinus, + n_expr: nullable AExpr ) do empty_init @@ -6479,7 +4862,7 @@ redef class AUminusExpr n_expr.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_minus == old_child then if new_child != null then @@ -6494,7 +4877,7 @@ redef class AUminusExpr if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -6508,39 +4891,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 PType , - n_id: nullable TId , - n_args: Collection[Object] # Should be Collection[PExpr] + n_kwnew: nullable TKwnew, + n_type: nullable AType, + n_id: nullable TId, + n_args: Collection[Object] # Should be Collection[AExpr] ) do empty_init @@ -6553,13 +4912,13 @@ redef class ANewExpr n_id.parent = self end for n in n_args do - assert n isa PExpr + assert n isa AExpr _n_args.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwnew == old_child then if new_child != null then @@ -6574,7 +4933,7 @@ redef class ANewExpr if _n_type == old_child then if new_child != null then new_child.parent = self - assert new_child isa PType + assert new_child isa AType _n_type = new_child else abort @@ -6594,7 +4953,7 @@ redef class ANewExpr for i in [0.._n_args.length[ do if _n_args[i] == old_child then if new_child != null then - assert new_child isa PExpr + assert new_child isa AExpr _n_args[i] = new_child new_child.parent = self else @@ -6616,40 +4975,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 PExpr , - n_id: nullable TAttrid + n_expr: nullable AExpr, + n_id: nullable TAttrid ) do empty_init @@ -6659,12 +4991,12 @@ redef class AAttrExpr n_id.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -6680,50 +5012,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 PExpr , - n_id: nullable TAttrid , - n_assign: nullable TAssign , - n_value: nullable PExpr + n_expr: nullable AExpr, + n_id: nullable TAttrid, + n_assign: nullable TAssign, + n_value: nullable AExpr ) do empty_init @@ -6737,12 +5042,12 @@ redef class AAttrAssignExpr n_value.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -6772,7 +5077,7 @@ redef class AAttrAssignExpr if _n_value == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_value = new_child else abort @@ -6788,44 +5093,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 PExpr , - n_id: nullable TAttrid , - n_assign_op: nullable PAssignOp , - n_value: nullable PExpr + n_expr: nullable AExpr, + n_id: nullable TAttrid, + n_assign_op: nullable AAssignOp, + n_value: nullable AExpr ) do empty_init @@ -6839,12 +5115,12 @@ redef class AAttrReassignExpr n_value.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -6864,7 +5140,7 @@ redef class AAttrReassignExpr if _n_assign_op == old_child then if new_child != null then new_child.parent = self - assert new_child isa PAssignOp + assert new_child isa AAssignOp _n_assign_op = new_child else abort @@ -6874,7 +5150,7 @@ redef class AAttrReassignExpr if _n_value == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_value = new_child else abort @@ -6890,34 +5166,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 PExpr , - n_id: nullable TId , - n_args: Collection[Object] , # Should be Collection[PExpr] - n_closure_defs: Collection[Object] # Should be Collection[PClosureDef] + 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 @@ -6926,23 +5183,23 @@ redef class ACallExpr _n_id = n_id.as(not null) n_id.parent = self for n in n_args do - assert n isa PExpr + assert n isa AExpr _n_args.add(n) n.parent = self end for n in n_closure_defs do - assert n isa PClosureDef + assert n isa AClosureDef _n_closure_defs.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -6962,7 +5219,7 @@ redef class ACallExpr for i in [0.._n_args.length[ do if _n_args[i] == old_child then if new_child != null then - assert new_child isa PExpr + assert new_child isa AExpr _n_args[i] = new_child new_child.parent = self else @@ -6974,7 +5231,7 @@ redef class ACallExpr for i in [0.._n_closure_defs.length[ do if _n_closure_defs[i] == old_child then if new_child != null then - assert new_child isa PClosureDef + assert new_child isa AClosureDef _n_closure_defs[i] = new_child new_child.parent = self else @@ -6996,57 +5253,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 PExpr , - n_id: nullable TId , - n_args: Collection[Object] , # Should be Collection[PExpr] - n_assign: nullable TAssign , - n_value: nullable PExpr + 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 @@ -7055,7 +5271,7 @@ redef class ACallAssignExpr _n_id = n_id.as(not null) n_id.parent = self for n in n_args do - assert n isa PExpr + assert n isa AExpr _n_args.add(n) n.parent = self end @@ -7065,12 +5281,12 @@ redef class ACallAssignExpr n_value.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -7090,7 +5306,7 @@ redef class ACallAssignExpr for i in [0.._n_args.length[ do if _n_args[i] == old_child then if new_child != null then - assert new_child isa PExpr + assert new_child isa AExpr _n_args[i] = new_child new_child.parent = self else @@ -7112,7 +5328,7 @@ redef class ACallAssignExpr if _n_value == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_value = new_child else abort @@ -7131,52 +5347,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 PExpr , - n_id: nullable TId , - n_args: Collection[Object] , # Should be Collection[PExpr] - n_assign_op: nullable PAssignOp , - n_value: nullable PExpr + 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 @@ -7185,7 +5365,7 @@ redef class ACallReassignExpr _n_id = n_id.as(not null) n_id.parent = self for n in n_args do - assert n isa PExpr + assert n isa AExpr _n_args.add(n) n.parent = self end @@ -7195,12 +5375,12 @@ redef class ACallReassignExpr n_value.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -7220,7 +5400,7 @@ redef class ACallReassignExpr for i in [0.._n_args.length[ do if _n_args[i] == old_child then if new_child != null then - assert new_child isa PExpr + assert new_child isa AExpr _n_args[i] = new_child new_child.parent = self else @@ -7232,7 +5412,7 @@ redef class ACallReassignExpr if _n_assign_op == old_child then if new_child != null then new_child.parent = self - assert new_child isa PAssignOp + assert new_child isa AAssignOp _n_assign_op = new_child else abort @@ -7242,7 +5422,7 @@ redef class ACallReassignExpr if _n_value == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_value = new_child else abort @@ -7261,42 +5441,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 PQualified , - n_kwsuper: nullable TKwsuper , - n_args: Collection[Object] # Should be Collection[PExpr] + n_qualified: nullable AQualified, + n_kwsuper: nullable TKwsuper, + n_args: Collection[Object] # Should be Collection[AExpr] ) do empty_init @@ -7307,18 +5459,18 @@ redef class ASuperExpr _n_kwsuper = n_kwsuper.as(not null) n_kwsuper.parent = self for n in n_args do - assert n isa PExpr + assert n isa AExpr _n_args.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_qualified == old_child then if new_child != null then new_child.parent = self - assert new_child isa PQualified + assert new_child isa AQualified _n_qualified = new_child else _n_qualified = null @@ -7338,7 +5490,7 @@ redef class ASuperExpr for i in [0.._n_args.length[ do if _n_args[i] == old_child then if new_child != null then - assert new_child isa PExpr + assert new_child isa AExpr _n_args[i] = new_child new_child.parent = self else @@ -7359,40 +5511,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 PExpr , - n_kwinit: nullable TKwinit , - n_args: Collection[Object] # Should be Collection[PExpr] + n_expr: nullable AExpr, + n_kwinit: nullable TKwinit, + n_args: Collection[Object] # Should be Collection[AExpr] ) do empty_init @@ -7401,18 +5527,18 @@ redef class AInitExpr _n_kwinit = n_kwinit.as(not null) n_kwinit.parent = self for n in n_args do - assert n isa PExpr + assert n isa AExpr _n_args.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -7432,7 +5558,7 @@ redef class AInitExpr for i in [0.._n_args.length[ do if _n_args[i] == old_child then if new_child != null then - assert new_child isa PExpr + assert new_child isa AExpr _n_args[i] = new_child new_child.parent = self else @@ -7451,56 +5577,37 @@ 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 PExpr , - n_args: Collection[Object] , # Should be Collection[PExpr] - n_closure_defs: Collection[Object] # Should be Collection[PClosureDef] + n_expr: nullable AExpr, + n_args: Collection[Object], # Should be Collection[AExpr] + n_closure_defs: Collection[Object] # Should be Collection[AClosureDef] ) do empty_init _n_expr = n_expr.as(not null) n_expr.parent = self for n in n_args do - assert n isa PExpr + assert n isa AExpr _n_args.add(n) n.parent = self end for n in n_closure_defs do - assert n isa PClosureDef + assert n isa AClosureDef _n_closure_defs.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -7510,7 +5617,7 @@ redef class ABraExpr for i in [0.._n_args.length[ do if _n_args[i] == old_child then if new_child != null then - assert new_child isa PExpr + assert new_child isa AExpr _n_args[i] = new_child new_child.parent = self else @@ -7522,7 +5629,7 @@ redef class ABraExpr for i in [0.._n_closure_defs.length[ do if _n_closure_defs[i] == old_child then if new_child != null then - assert new_child isa PClosureDef + assert new_child isa AClosureDef _n_closure_defs[i] = new_child new_child.parent = self else @@ -7543,57 +5650,22 @@ 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 PExpr , - n_args: Collection[Object] , # Should be Collection[PExpr] - n_assign: nullable TAssign , - n_value: nullable PExpr + n_expr: nullable AExpr, + n_args: Collection[Object], # Should be Collection[AExpr] + n_assign: nullable TAssign, + n_value: nullable AExpr ) do empty_init _n_expr = n_expr.as(not null) n_expr.parent = self for n in n_args do - assert n isa PExpr + assert n isa AExpr _n_args.add(n) n.parent = self end @@ -7603,12 +5675,12 @@ redef class ABraAssignExpr n_value.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -7618,7 +5690,7 @@ redef class ABraAssignExpr for i in [0.._n_args.length[ do if _n_args[i] == old_child then if new_child != null then - assert new_child isa PExpr + assert new_child isa AExpr _n_args[i] = new_child new_child.parent = self else @@ -7640,7 +5712,7 @@ redef class ABraAssignExpr if _n_value == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_value = new_child else abort @@ -7658,52 +5730,22 @@ 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 PExpr , - n_args: Collection[Object] , # Should be Collection[PExpr] - n_assign_op: nullable PAssignOp , - n_value: nullable PExpr + n_expr: nullable AExpr, + n_args: Collection[Object], # Should be Collection[AExpr] + n_assign_op: nullable AAssignOp, + n_value: nullable AExpr ) do empty_init _n_expr = n_expr.as(not null) n_expr.parent = self for n in n_args do - assert n isa PExpr + assert n isa AExpr _n_args.add(n) n.parent = self end @@ -7713,12 +5755,12 @@ redef class ABraReassignExpr n_value.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -7728,7 +5770,7 @@ redef class ABraReassignExpr for i in [0.._n_args.length[ do if _n_args[i] == old_child then if new_child != null then - assert new_child isa PExpr + assert new_child isa AExpr _n_args[i] = new_child new_child.parent = self else @@ -7740,7 +5782,7 @@ redef class ABraReassignExpr if _n_assign_op == old_child then if new_child != null then new_child.parent = self - assert new_child isa PAssignOp + assert new_child isa AAssignOp _n_assign_op = new_child else abort @@ -7750,7 +5792,7 @@ redef class ABraReassignExpr if _n_value == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_value = new_child else abort @@ -7768,52 +5810,32 @@ 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[PExpr] - n_closure_defs: Collection[Object] # Should be Collection[PClosureDef] + n_id: nullable TId, + n_args: Collection[Object], # Should be Collection[AExpr] + n_closure_defs: Collection[Object] # Should be Collection[AClosureDef] ) do empty_init _n_id = n_id.as(not null) n_id.parent = self for n in n_args do - assert n isa PExpr + assert n isa AExpr _n_args.add(n) n.parent = self end for n in n_closure_defs do - assert n isa PClosureDef + assert n isa AClosureDef _n_closure_defs.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_id == old_child then if new_child != null then @@ -7828,7 +5850,7 @@ redef class AClosureCallExpr for i in [0.._n_args.length[ do if _n_args[i] == old_child then if new_child != null then - assert new_child isa PExpr + assert new_child isa AExpr _n_args[i] = new_child new_child.parent = self else @@ -7840,7 +5862,7 @@ redef class AClosureCallExpr for i in [0.._n_closure_defs.length[ do if _n_closure_defs[i] == old_child then if new_child != null then - assert new_child isa PClosureDef + assert new_child isa AClosureDef _n_closure_defs[i] = new_child new_child.parent = self else @@ -7861,37 +5883,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 @@ -7899,7 +5896,7 @@ redef class AVarExpr n_id.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_id == old_child then if new_child != null then @@ -7917,35 +5914,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 PExpr + n_id: nullable TId, + n_assign: nullable TAssign, + n_value: nullable AExpr ) do empty_init @@ -7957,7 +5933,7 @@ redef class AVarAssignExpr n_value.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_id == old_child then if new_child != null then @@ -7982,7 +5958,7 @@ redef class AVarAssignExpr if _n_value == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_value = new_child else abort @@ -7997,37 +5973,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 PAssignOp , - n_value: nullable PExpr + n_id: nullable TId, + n_assign_op: nullable AAssignOp, + n_value: nullable AExpr ) do empty_init @@ -8039,7 +5992,7 @@ redef class AVarReassignExpr n_value.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_id == old_child then if new_child != null then @@ -8054,7 +6007,7 @@ redef class AVarReassignExpr if _n_assign_op == old_child then if new_child != null then new_child.parent = self - assert new_child isa PAssignOp + assert new_child isa AAssignOp _n_assign_op = new_child else abort @@ -8064,7 +6017,7 @@ redef class AVarReassignExpr if _n_value == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_value = new_child else abort @@ -8079,31 +6032,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 PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -8113,12 +6048,12 @@ redef class ARangeExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -8128,7 +6063,7 @@ redef class ARangeExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -8142,30 +6077,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 PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -8175,12 +6093,12 @@ redef class ACrangeExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -8190,7 +6108,7 @@ redef class ACrangeExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -8204,30 +6122,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 PExpr , - n_expr2: nullable PExpr + n_expr: nullable AExpr, + n_expr2: nullable AExpr ) do empty_init @@ -8237,12 +6138,12 @@ redef class AOrangeExpr n_expr2.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -8252,7 +6153,7 @@ redef class AOrangeExpr if _n_expr2 == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr2 = new_child else abort @@ -8266,35 +6167,28 @@ 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[PExpr] + n_exprs: Collection[Object] # Should be Collection[AExpr] ) do empty_init for n in n_exprs do - assert n isa PExpr + assert n isa AExpr _n_exprs.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do for i in [0.._n_exprs.length[ do if _n_exprs[i] == old_child then if new_child != null then - assert new_child isa PExpr + assert new_child isa AExpr _n_exprs[i] = new_child new_child.parent = self else @@ -8311,29 +6205,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 @@ -8341,7 +6218,7 @@ redef class ASelfExpr n_kwself.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwself == old_child then if new_child != null then @@ -8359,14 +6236,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 @@ -8374,29 +6245,19 @@ redef class AImplicitSelfExpr empty_init end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do end 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 @@ -8404,7 +6265,7 @@ redef class ATrueExpr n_kwtrue.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwtrue == old_child then if new_child != null then @@ -8422,23 +6283,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 @@ -8446,7 +6296,7 @@ redef class AFalseExpr n_kwfalse.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwfalse == old_child then if new_child != null then @@ -8464,23 +6314,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 @@ -8488,7 +6327,7 @@ redef class ANullExpr n_kwnull.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwnull == old_child then if new_child != null then @@ -8506,23 +6345,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 @@ -8530,7 +6358,7 @@ redef class AIntExpr n_number.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_number == old_child then if new_child != null then @@ -8548,23 +6376,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 @@ -8572,7 +6389,7 @@ redef class AFloatExpr n_float.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_float == old_child then if new_child != null then @@ -8590,23 +6407,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 @@ -8614,7 +6420,7 @@ redef class ACharExpr n_char.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_char == old_child then if new_child != null then @@ -8632,23 +6438,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 @@ -8656,7 +6451,7 @@ redef class AStringExpr n_string.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_string == old_child then if new_child != null then @@ -8674,23 +6469,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 @@ -8698,7 +6482,7 @@ redef class AStartStringExpr n_string.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_string == old_child then if new_child != null then @@ -8716,23 +6500,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 @@ -8740,7 +6513,7 @@ redef class AMidStringExpr n_string.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_string == old_child then if new_child != null then @@ -8758,23 +6531,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 @@ -8782,7 +6544,7 @@ redef class AEndStringExpr n_string.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_string == old_child then if new_child != null then @@ -8800,34 +6562,28 @@ 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[PExpr] + n_exprs: Collection[Object] # Should be Collection[AExpr] ) do empty_init for n in n_exprs do - assert n isa PExpr + assert n isa AExpr _n_exprs.add(n) n.parent = self end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do for i in [0.._n_exprs.length[ do if _n_exprs[i] == old_child then if new_child != null then - assert new_child isa PExpr + assert new_child isa AExpr _n_exprs[i] = new_child new_child.parent = self else @@ -8844,29 +6600,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 PExpr + n_expr: nullable AExpr ) do empty_init @@ -8874,12 +6613,12 @@ redef class AParExpr n_expr.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -8892,35 +6631,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 PExpr , - n_kwas: nullable TKwas , - n_type: nullable PType + n_expr: nullable AExpr, + n_kwas: nullable TKwas, + n_type: nullable AType ) do empty_init @@ -8932,12 +6650,12 @@ redef class AAsCastExpr n_type.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -8957,7 +6675,7 @@ redef class AAsCastExpr if _n_type == old_child then if new_child != null then new_child.parent = self - assert new_child isa PType + assert new_child isa AType _n_type = new_child else abort @@ -8972,43 +6690,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 PExpr , - 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 @@ -9022,12 +6712,12 @@ redef class AAsNotnullExpr n_kwnull.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -9073,38 +6763,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 PExpr , - n_id: nullable TAttrid + n_kwisset: nullable TKwisset, + n_expr: nullable AExpr, + n_id: nullable TAttrid ) do empty_init @@ -9116,7 +6782,7 @@ redef class AIssetAttrExpr n_id.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwisset == old_child then if new_child != null then @@ -9131,7 +6797,7 @@ redef class AIssetAttrExpr if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else abort @@ -9156,25 +6822,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 @@ -9182,7 +6835,7 @@ redef class APlusAssignOp n_pluseq.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_pluseq == old_child then if new_child != null then @@ -9200,23 +6853,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 @@ -9224,7 +6866,7 @@ redef class AMinusAssignOp n_minuseq.parent = self end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_minuseq == old_child then if new_child != null then @@ -9242,76 +6884,73 @@ 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 - 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 PExpr + 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 end + _n_label = n_label + if n_label != null then + n_label.parent = self + end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + 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 @@ -9322,64 +6961,118 @@ redef class AClosureDef assert new_child isa TKwdo _n_kwdo = new_child else - abort + _n_kwdo = null end return end if _n_expr == old_child then if new_child != null then new_child.parent = self - assert new_child isa PExpr + assert new_child isa AExpr _n_expr = new_child else _n_expr = 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_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 + if _n_label != null then + v.enter_visit(_n_label.as(not null)) + end end +end +redef class ASimpleClosureId + private init empty_init do end - redef fun visit_all_reverse(v: Visitor) + init init_asimpleclosureid ( + n_id: nullable TId + ) 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 + empty_init + _n_id = n_id.as(not null) + n_id.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + 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 + 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 @@ -9394,7 +7087,7 @@ redef class AQualified end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do for i in [0.._n_id.length[ do if _n_id[i] == old_child then @@ -9429,27 +7122,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 @@ -9460,7 +7138,7 @@ redef class ADoc end end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do for i in [0.._n_comment.length[ do if _n_comment[i] == old_child then @@ -9482,35 +7160,24 @@ 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 init( - n_base: nullable PModule, + n_base: nullable AModule, n_eof: EOF) do _n_base = n_base _n_eof = n_eof end - redef fun replace_child(old_child: PNode, new_child: nullable PNode) + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_base == old_child then if new_child == null then else new_child.parent = self - assert new_child isa PModule + assert new_child isa AModule _n_base = new_child end old_child.parent = null @@ -9523,12 +7190,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