X-Git-Url: http://nitlanguage.org diff --git a/src/parser/parser_prod.nit b/src/parser/parser_prod.nit index 2cd7643..740278e 100644 --- a/src/parser/parser_prod.nit +++ b/src/parser/parser_prod.nit @@ -1,14 +1,12 @@ # Production AST nodes full definition. # This file was generated by SableCC (http://www.sablecc.org/). -module parser_prod +module parser_prod is no_warning("missing-doc") import lexer intrude import parser_nodes private import tables redef class AModule - private init empty_init do end - init init_amodule ( n_moduledecl: nullable AModuledecl, n_imports: Collection[Object], # Should be Collection[AImport] @@ -16,12 +14,11 @@ redef class AModule n_classdefs: Collection[Object] # Should be Collection[AClassdef] ) do - empty_init _n_moduledecl = n_moduledecl if n_moduledecl != null then n_moduledecl.parent = self - _n_imports.unsafe_add_all(n_imports) - _n_extern_code_blocks.unsafe_add_all(n_extern_code_blocks) - _n_classdefs.unsafe_add_all(n_classdefs) + self.n_imports.unsafe_add_all(n_imports) + self.n_extern_code_blocks.unsafe_add_all(n_extern_code_blocks) + self.n_classdefs.unsafe_add_all(n_classdefs) end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -30,9 +27,9 @@ redef class AModule n_moduledecl = new_child.as(nullable AModuledecl) return end - if _n_imports.replace_child(old_child, new_child) then return - if _n_extern_code_blocks.replace_child(old_child, new_child) then return - if _n_classdefs.replace_child(old_child, new_child) then return + if n_imports.replace_child(old_child, new_child) then return + if n_extern_code_blocks.replace_child(old_child, new_child) then return + if n_classdefs.replace_child(old_child, new_child) then return end redef fun n_moduledecl=(node) @@ -45,24 +42,27 @@ redef class AModule redef fun visit_all(v: Visitor) do v.enter_visit(_n_moduledecl) - _n_imports.visit_all(v) - _n_extern_code_blocks.visit_all(v) - _n_classdefs.visit_all(v) + n_imports.visit_all(v) + n_extern_code_blocks.visit_all(v) + n_classdefs.visit_all(v) end end redef class AModuledecl - private init empty_init do end - init init_amoduledecl ( n_doc: nullable ADoc, + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, n_kwmodule: nullable TKwmodule, n_name: nullable AModuleName, n_annotations: nullable AAnnotations ) do - empty_init _n_doc = n_doc if n_doc != null then n_doc.parent = self + _n_kwredef = n_kwredef + if n_kwredef != null then n_kwredef.parent = self + _n_visibility = n_visibility.as(not null) + n_visibility.parent = self _n_kwmodule = n_kwmodule.as(not null) n_kwmodule.parent = self _n_name = n_name.as(not null) @@ -77,6 +77,14 @@ redef class AModuledecl n_doc = new_child.as(nullable ADoc) return end + if _n_kwredef == old_child then + n_kwredef = new_child.as(nullable TKwredef) + return + end + if _n_visibility == old_child then + n_visibility = new_child.as(AVisibility) + return + end if _n_kwmodule == old_child then n_kwmodule = new_child.as(TKwmodule) return @@ -96,6 +104,16 @@ redef class AModuledecl _n_doc = node if node != null then node.parent = self end + redef fun n_kwredef=(node) + do + _n_kwredef = node + if node != null then node.parent = self + end + redef fun n_visibility=(node) + do + _n_visibility = node + node.parent = self + end redef fun n_kwmodule=(node) do _n_kwmodule = node @@ -116,14 +134,14 @@ redef class AModuledecl redef fun visit_all(v: Visitor) do v.enter_visit(_n_doc) + v.enter_visit(_n_kwredef) + v.enter_visit(_n_visibility) v.enter_visit(_n_kwmodule) v.enter_visit(_n_name) v.enter_visit(_n_annotations) end end redef class AStdImport - private init empty_init do end - init init_astdimport ( n_visibility: nullable AVisibility, n_kwimport: nullable TKwimport, @@ -131,7 +149,6 @@ redef class AStdImport n_annotations: nullable AAnnotations ) do - empty_init _n_visibility = n_visibility.as(not null) n_visibility.parent = self _n_kwimport = n_kwimport.as(not null) @@ -193,15 +210,12 @@ redef class AStdImport end end redef class ANoImport - private init empty_init do end - init init_anoimport ( n_visibility: nullable AVisibility, n_kwimport: nullable TKwimport, n_kwend: nullable TKwend ) do - empty_init _n_visibility = n_visibility.as(not null) n_visibility.parent = self _n_kwimport = n_kwimport.as(not null) @@ -251,31 +265,39 @@ redef class ANoImport end end redef class APublicVisibility - private init empty_init do end - - init init_apublicvisibility + init init_apublicvisibility ( + n_kwpublic: nullable TKwpublic + ) do - empty_init + _n_kwpublic = n_kwpublic + if n_kwpublic != null then n_kwpublic.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do + if _n_kwpublic == old_child then + n_kwpublic = new_child.as(nullable TKwpublic) + return + end end + redef fun n_kwpublic=(node) + do + _n_kwpublic = node + if node != null then node.parent = self + end redef fun visit_all(v: Visitor) do + v.enter_visit(_n_kwpublic) end end redef class APrivateVisibility - private init empty_init do end - init init_aprivatevisibility ( n_kwprivate: nullable TKwprivate ) do - empty_init _n_kwprivate = n_kwprivate.as(not null) n_kwprivate.parent = self end @@ -301,13 +323,10 @@ redef class APrivateVisibility end end redef class AProtectedVisibility - private init empty_init do end - init init_aprotectedvisibility ( n_kwprotected: nullable TKwprotected ) do - empty_init _n_kwprotected = n_kwprotected.as(not null) n_kwprotected.parent = self end @@ -333,13 +352,10 @@ redef class AProtectedVisibility end end redef class AIntrudeVisibility - private init empty_init do end - init init_aintrudevisibility ( n_kwintrude: nullable TKwintrude ) do - empty_init _n_kwintrude = n_kwintrude.as(not null) n_kwintrude.parent = self end @@ -365,23 +381,20 @@ redef class AIntrudeVisibility end end redef class AStdClassdef - private init empty_init do end - init init_astdclassdef ( n_doc: nullable ADoc, n_kwredef: nullable TKwredef, n_visibility: nullable AVisibility, n_classkind: nullable AClasskind, n_id: nullable TClassid, + n_obra: nullable TObra, n_formaldefs: Collection[Object], # Should be Collection[AFormaldef] - n_annotations: nullable AAnnotations, + n_cbra: nullable TCbra, n_extern_code_block: nullable AExternCodeBlock, - n_superclasses: Collection[Object], # Should be Collection[ASuperclass] n_propdefs: Collection[Object], # Should be Collection[APropdef] n_kwend: nullable TKwend ) do - empty_init _n_doc = n_doc if n_doc != null then n_doc.parent = self _n_kwredef = n_kwredef @@ -392,13 +405,14 @@ redef class AStdClassdef n_classkind.parent = self _n_id = n_id if n_id != null then n_id.parent = self - _n_formaldefs.unsafe_add_all(n_formaldefs) - _n_annotations = n_annotations - if n_annotations != null then n_annotations.parent = self + _n_obra = n_obra + if n_obra != null then n_obra.parent = self + self.n_formaldefs.unsafe_add_all(n_formaldefs) + _n_cbra = n_cbra + if n_cbra != null then n_cbra.parent = self _n_extern_code_block = n_extern_code_block if n_extern_code_block != null then n_extern_code_block.parent = self - _n_superclasses.unsafe_add_all(n_superclasses) - _n_propdefs.unsafe_add_all(n_propdefs) + self.n_propdefs.unsafe_add_all(n_propdefs) _n_kwend = n_kwend.as(not null) n_kwend.parent = self end @@ -425,17 +439,20 @@ redef class AStdClassdef n_id = new_child.as(nullable TClassid) return end - if _n_formaldefs.replace_child(old_child, new_child) then return - if _n_annotations == old_child then - n_annotations = new_child.as(nullable AAnnotations) + if _n_obra == old_child then + n_obra = new_child.as(nullable TObra) + return + end + if n_formaldefs.replace_child(old_child, new_child) then return + if _n_cbra == old_child then + n_cbra = new_child.as(nullable TCbra) return end if _n_extern_code_block == old_child then n_extern_code_block = new_child.as(nullable AExternCodeBlock) return end - if _n_superclasses.replace_child(old_child, new_child) then return - if _n_propdefs.replace_child(old_child, new_child) then return + if n_propdefs.replace_child(old_child, new_child) then return if _n_kwend == old_child then n_kwend = new_child.as(TKwend) return @@ -467,9 +484,14 @@ redef class AStdClassdef _n_id = node if node != null then node.parent = self end - redef fun n_annotations=(node) + redef fun n_obra=(node) do - _n_annotations = node + _n_obra = node + if node != null then node.parent = self + end + redef fun n_cbra=(node) + do + _n_cbra = node if node != null then node.parent = self end redef fun n_extern_code_block=(node) @@ -491,68 +513,59 @@ redef class AStdClassdef v.enter_visit(_n_visibility) v.enter_visit(_n_classkind) v.enter_visit(_n_id) - _n_formaldefs.visit_all(v) - v.enter_visit(_n_annotations) + v.enter_visit(_n_obra) + n_formaldefs.visit_all(v) + v.enter_visit(_n_cbra) v.enter_visit(_n_extern_code_block) - _n_superclasses.visit_all(v) - _n_propdefs.visit_all(v) + n_propdefs.visit_all(v) v.enter_visit(_n_kwend) end end redef class ATopClassdef - private init empty_init do end - init init_atopclassdef ( n_propdefs: Collection[Object] # Should be Collection[APropdef] ) do - empty_init - _n_propdefs.unsafe_add_all(n_propdefs) + self.n_propdefs.unsafe_add_all(n_propdefs) end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_propdefs.replace_child(old_child, new_child) then return + if n_propdefs.replace_child(old_child, new_child) then return end redef fun visit_all(v: Visitor) do - _n_propdefs.visit_all(v) + n_propdefs.visit_all(v) end end redef class AMainClassdef - private init empty_init do end - init init_amainclassdef ( n_propdefs: Collection[Object] # Should be Collection[APropdef] ) do - empty_init - _n_propdefs.unsafe_add_all(n_propdefs) + self.n_propdefs.unsafe_add_all(n_propdefs) end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_propdefs.replace_child(old_child, new_child) then return + if n_propdefs.replace_child(old_child, new_child) then return end redef fun visit_all(v: Visitor) do - _n_propdefs.visit_all(v) + n_propdefs.visit_all(v) end end redef class AConcreteClasskind - private init empty_init do end - init init_aconcreteclasskind ( n_kwclass: nullable TKwclass ) do - empty_init _n_kwclass = n_kwclass.as(not null) n_kwclass.parent = self end @@ -578,14 +591,11 @@ redef class AConcreteClasskind end end redef class AAbstractClasskind - private init empty_init do end - init init_aabstractclasskind ( n_kwabstract: nullable TKwabstract, n_kwclass: nullable TKwclass ) do - empty_init _n_kwabstract = n_kwabstract.as(not null) n_kwabstract.parent = self _n_kwclass = n_kwclass.as(not null) @@ -623,13 +633,10 @@ redef class AAbstractClasskind end end redef class AInterfaceClasskind - private init empty_init do end - init init_ainterfaceclasskind ( n_kwinterface: nullable TKwinterface ) do - empty_init _n_kwinterface = n_kwinterface.as(not null) n_kwinterface.parent = self end @@ -655,13 +662,10 @@ redef class AInterfaceClasskind end end redef class AEnumClasskind - private init empty_init do end - init init_aenumclasskind ( n_kwenum: nullable TKwenum ) do - empty_init _n_kwenum = n_kwenum.as(not null) n_kwenum.parent = self end @@ -687,14 +691,11 @@ redef class AEnumClasskind end end redef class AExternClasskind - private init empty_init do end - init init_aexternclasskind ( n_kwextern: nullable TKwextern, n_kwclass: nullable TKwclass ) do - empty_init _n_kwextern = n_kwextern.as(not null) n_kwextern.parent = self _n_kwclass = n_kwclass @@ -732,15 +733,12 @@ redef class AExternClasskind end end redef class AFormaldef - private init empty_init do end - init init_aformaldef ( n_id: nullable TClassid, n_type: nullable AType, n_annotations: nullable AAnnotations ) do - empty_init _n_id = n_id.as(not null) n_id.parent = self _n_type = n_type @@ -789,104 +787,46 @@ redef class AFormaldef v.enter_visit(_n_annotations) end end -redef class ASuperclass - private init empty_init do end - - init init_asuperclass ( - n_kwsuper: nullable TKwsuper, - n_type: nullable AType, - n_annotations: nullable AAnnotations - ) - do - empty_init - _n_kwsuper = n_kwsuper.as(not null) - n_kwsuper.parent = self - _n_type = n_type.as(not null) - n_type.parent = self - _n_annotations = n_annotations - if n_annotations != null then n_annotations.parent = self - end - - redef fun replace_child(old_child: ANode, new_child: nullable ANode) - do - if _n_kwsuper == old_child then - n_kwsuper = new_child.as(TKwsuper) - return - end - if _n_type == old_child then - n_type = new_child.as(AType) - return - end - if _n_annotations == old_child then - n_annotations = new_child.as(nullable AAnnotations) - return - end - end - - redef fun n_kwsuper=(node) - do - _n_kwsuper = node - node.parent = self - end - redef fun n_type=(node) - do - _n_type = node - node.parent = self - end - redef fun n_annotations=(node) - do - _n_annotations = node - if node != null then node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_kwsuper) - v.enter_visit(_n_type) - v.enter_visit(_n_annotations) - end -end redef class AAttrPropdef - private init empty_init do end - init init_aattrpropdef ( n_doc: nullable ADoc, - n_readable: nullable AAble, - n_writable: nullable AAble, n_kwredef: nullable TKwredef, n_visibility: nullable AVisibility, n_kwvar: nullable TKwvar, - n_id: nullable TAttrid, n_id2: nullable TId, n_type: nullable AType, + n_assign: nullable TAssign, + n_expr: nullable AExpr, n_annotations: nullable AAnnotations, - n_expr: nullable AExpr + n_kwdo: nullable TKwdo, + n_block: nullable AExpr, + n_kwend: nullable TKwend ) do - empty_init _n_doc = n_doc if n_doc != null then n_doc.parent = self - _n_readable = n_readable - if n_readable != null then n_readable.parent = self - _n_writable = n_writable - if n_writable != null then n_writable.parent = self _n_kwredef = n_kwredef if n_kwredef != null then n_kwredef.parent = self _n_visibility = n_visibility.as(not null) n_visibility.parent = self _n_kwvar = n_kwvar.as(not null) n_kwvar.parent = self - _n_id = n_id - if n_id != null then n_id.parent = self - _n_id2 = n_id2 - if n_id2 != null then n_id2.parent = self + _n_id2 = n_id2.as(not null) + n_id2.parent = self _n_type = n_type if n_type != null then n_type.parent = self - _n_annotations = n_annotations - if n_annotations != null then n_annotations.parent = self + _n_assign = n_assign + if n_assign != null then n_assign.parent = self _n_expr = n_expr if n_expr != null then n_expr.parent = self + _n_annotations = n_annotations + if n_annotations != null then n_annotations.parent = self + _n_kwdo = n_kwdo + if n_kwdo != null then n_kwdo.parent = self + _n_block = n_block + if n_block != null then n_block.parent = self + _n_kwend = n_kwend + if n_kwend != null then n_kwend.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -895,14 +835,6 @@ redef class AAttrPropdef n_doc = new_child.as(nullable ADoc) return end - if _n_readable == old_child then - n_readable = new_child.as(nullable AAble) - return - end - if _n_writable == old_child then - n_writable = new_child.as(nullable AAble) - return - end if _n_kwredef == old_child then n_kwredef = new_child.as(nullable TKwredef) return @@ -915,26 +847,38 @@ redef class AAttrPropdef n_kwvar = new_child.as(TKwvar) return end - if _n_id == old_child then - n_id = new_child.as(nullable TAttrid) - return - end if _n_id2 == old_child then - n_id2 = new_child.as(nullable TId) + n_id2 = new_child.as(TId) return end if _n_type == old_child then n_type = new_child.as(nullable AType) return end - if _n_annotations == old_child then - n_annotations = new_child.as(nullable AAnnotations) + if _n_assign == old_child then + n_assign = new_child.as(nullable TAssign) return end if _n_expr == old_child then n_expr = new_child.as(nullable AExpr) return end + if _n_annotations == old_child then + n_annotations = new_child.as(nullable AAnnotations) + return + end + if _n_kwdo == old_child then + n_kwdo = new_child.as(nullable TKwdo) + return + end + if _n_block == old_child then + n_block = new_child.as(nullable AExpr) + return + end + if _n_kwend == old_child then + n_kwend = new_child.as(nullable TKwend) + return + end end redef fun n_doc=(node) @@ -942,16 +886,6 @@ redef class AAttrPropdef _n_doc = node if node != null then node.parent = self end - redef fun n_readable=(node) - do - _n_readable = node - if node != null then node.parent = self - end - redef fun n_writable=(node) - do - _n_writable = node - if node != null then node.parent = self - end redef fun n_kwredef=(node) do _n_kwredef = node @@ -967,24 +901,19 @@ redef class AAttrPropdef _n_kwvar = node node.parent = self end - redef fun n_id=(node) - do - _n_id = node - if node != null then node.parent = self - end redef fun n_id2=(node) do _n_id2 = node - if node != null then node.parent = self + node.parent = self end redef fun n_type=(node) do _n_type = node if node != null then node.parent = self end - redef fun n_annotations=(node) + redef fun n_assign=(node) do - _n_annotations = node + _n_assign = node if node != null then node.parent = self end redef fun n_expr=(node) @@ -992,133 +921,109 @@ redef class AAttrPropdef _n_expr = node if node != null then node.parent = self end + redef fun n_annotations=(node) + do + _n_annotations = node + if node != null then node.parent = self + end + redef fun n_kwdo=(node) + do + _n_kwdo = node + if node != null then node.parent = self + end + redef fun n_block=(node) + do + _n_block = node + if node != null then node.parent = self + end + redef fun n_kwend=(node) + do + _n_kwend = node + if node != null then node.parent = self + end redef fun visit_all(v: Visitor) do v.enter_visit(_n_doc) - v.enter_visit(_n_readable) - v.enter_visit(_n_writable) v.enter_visit(_n_kwredef) v.enter_visit(_n_visibility) v.enter_visit(_n_kwvar) - v.enter_visit(_n_id) v.enter_visit(_n_id2) v.enter_visit(_n_type) - v.enter_visit(_n_annotations) + v.enter_visit(_n_assign) v.enter_visit(_n_expr) + v.enter_visit(_n_annotations) + v.enter_visit(_n_kwdo) + v.enter_visit(_n_block) + v.enter_visit(_n_kwend) end end -redef class AMethPropdef - private init empty_init do end - - init init_amethpropdef ( - n_doc: nullable ADoc, +redef class AMainMethPropdef + init init_amainmethpropdef ( n_kwredef: nullable TKwredef, - n_visibility: nullable AVisibility, - n_methid: nullable AMethid, - n_signature: nullable ASignature + n_block: nullable AExpr ) do - empty_init - _n_doc = n_doc - if n_doc != null then n_doc.parent = self _n_kwredef = n_kwredef if n_kwredef != null then n_kwredef.parent = self - _n_visibility = n_visibility.as(not null) - n_visibility.parent = self - _n_methid = n_methid.as(not null) - n_methid.parent = self - _n_signature = n_signature.as(not null) - n_signature.parent = self + _n_block = n_block + if n_block != null then n_block.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_doc == old_child then - n_doc = new_child.as(nullable ADoc) - return - end if _n_kwredef == old_child then n_kwredef = new_child.as(nullable TKwredef) return end - if _n_visibility == old_child then - n_visibility = new_child.as(AVisibility) - return - end - if _n_methid == old_child then - n_methid = new_child.as(AMethid) - return - end - if _n_signature == old_child then - n_signature = new_child.as(ASignature) + if _n_block == old_child then + n_block = new_child.as(nullable AExpr) return end end - redef fun n_doc=(node) - do - _n_doc = node - if node != null then node.parent = self - end redef fun n_kwredef=(node) do _n_kwredef = node if node != null then node.parent = self end - redef fun n_visibility=(node) - do - _n_visibility = node - node.parent = self - end - redef fun n_methid=(node) - do - _n_methid = node - node.parent = self - end - redef fun n_signature=(node) + redef fun n_block=(node) do - _n_signature = node - node.parent = self + _n_block = node + if node != null then node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_doc) v.enter_visit(_n_kwredef) - v.enter_visit(_n_visibility) - v.enter_visit(_n_methid) - v.enter_visit(_n_signature) + v.enter_visit(_n_block) end end -redef class ADeferredMethPropdef - private init empty_init do end - - init init_adeferredmethpropdef ( +redef class ATypePropdef + init init_atypepropdef ( 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_kwtype: nullable TKwtype, + n_id: nullable TClassid, + n_type: nullable AType, n_annotations: nullable AAnnotations ) do - empty_init _n_doc = n_doc if n_doc != null then n_doc.parent = self _n_kwredef = n_kwredef if n_kwredef != null then n_kwredef.parent = self _n_visibility = n_visibility.as(not null) n_visibility.parent = self - _n_kwmeth = n_kwmeth.as(not null) - n_kwmeth.parent = self - _n_methid = n_methid.as(not null) - n_methid.parent = self - _n_signature = n_signature.as(not null) - n_signature.parent = self + _n_kwtype = n_kwtype.as(not null) + n_kwtype.parent = self + _n_id = n_id.as(not null) + n_id.parent = self + _n_type = n_type.as(not null) + n_type.parent = self _n_annotations = n_annotations if n_annotations != null then n_annotations.parent = self end @@ -1137,16 +1042,16 @@ redef class ADeferredMethPropdef n_visibility = new_child.as(AVisibility) return end - if _n_kwmeth == old_child then - n_kwmeth = new_child.as(TKwmeth) + if _n_kwtype == old_child then + n_kwtype = new_child.as(TKwtype) return end - if _n_methid == old_child then - n_methid = new_child.as(AMethid) + if _n_id == old_child then + n_id = new_child.as(TClassid) return end - if _n_signature == old_child then - n_signature = new_child.as(ASignature) + if _n_type == old_child then + n_type = new_child.as(AType) return end if _n_annotations == old_child then @@ -1170,19 +1075,19 @@ redef class ADeferredMethPropdef _n_visibility = node node.parent = self end - redef fun n_kwmeth=(node) + redef fun n_kwtype=(node) do - _n_kwmeth = node + _n_kwtype = node node.parent = self end - redef fun n_methid=(node) + redef fun n_id=(node) do - _n_methid = node + _n_id = node node.parent = self end - redef fun n_signature=(node) + redef fun n_type=(node) do - _n_signature = node + _n_type = node node.parent = self end redef fun n_annotations=(node) @@ -1197,37 +1102,58 @@ redef class ADeferredMethPropdef v.enter_visit(_n_doc) v.enter_visit(_n_kwredef) v.enter_visit(_n_visibility) - v.enter_visit(_n_kwmeth) - v.enter_visit(_n_methid) - v.enter_visit(_n_signature) + v.enter_visit(_n_kwtype) + v.enter_visit(_n_id) + v.enter_visit(_n_type) v.enter_visit(_n_annotations) end end -redef class AInternMethPropdef - private init empty_init do end - - init init_ainternmethpropdef ( +redef class AMethPropdef + init init_amethpropdef ( n_doc: nullable ADoc, n_kwredef: nullable TKwredef, n_visibility: nullable AVisibility, n_kwmeth: nullable TKwmeth, + n_kwinit: nullable TKwinit, + n_kwnew: nullable TKwnew, n_methid: nullable AMethid, - n_signature: nullable ASignature + n_signature: nullable ASignature, + n_annotations: nullable AAnnotations, + n_extern_calls: nullable AExternCalls, + n_extern_code_block: nullable AExternCodeBlock, + n_kwdo: nullable TKwdo, + n_block: nullable AExpr, + n_kwend: nullable TKwend ) do - empty_init _n_doc = n_doc if n_doc != null then n_doc.parent = self _n_kwredef = n_kwredef if n_kwredef != null then n_kwredef.parent = self _n_visibility = n_visibility.as(not null) n_visibility.parent = self - _n_kwmeth = n_kwmeth.as(not null) - n_kwmeth.parent = self - _n_methid = n_methid.as(not null) - n_methid.parent = self + _n_kwmeth = n_kwmeth + if n_kwmeth != null then n_kwmeth.parent = self + _n_kwinit = n_kwinit + if n_kwinit != null then n_kwinit.parent = self + _n_kwnew = n_kwnew + if n_kwnew != null then n_kwnew.parent = self + _n_methid = n_methid + if n_methid != null then n_methid.parent = self _n_signature = n_signature.as(not null) n_signature.parent = self + _n_annotations = n_annotations + if n_annotations != null then n_annotations.parent = self + _n_extern_calls = n_extern_calls + if n_extern_calls != null then n_extern_calls.parent = self + _n_extern_code_block = n_extern_code_block + if n_extern_code_block != null then n_extern_code_block.parent = self + _n_kwdo = n_kwdo + if n_kwdo != null then n_kwdo.parent = self + _n_block = n_block + if n_block != null then n_block.parent = self + _n_kwend = n_kwend + if n_kwend != null then n_kwend.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -1245,17 +1171,49 @@ redef class AInternMethPropdef return end if _n_kwmeth == old_child then - n_kwmeth = new_child.as(TKwmeth) + n_kwmeth = new_child.as(nullable TKwmeth) + return + end + if _n_kwinit == old_child then + n_kwinit = new_child.as(nullable TKwinit) + return + end + if _n_kwnew == old_child then + n_kwnew = new_child.as(nullable TKwnew) return end if _n_methid == old_child then - n_methid = new_child.as(AMethid) + n_methid = new_child.as(nullable AMethid) return end if _n_signature == old_child then n_signature = new_child.as(ASignature) return end + if _n_annotations == old_child then + n_annotations = new_child.as(nullable AAnnotations) + return + end + if _n_extern_calls == old_child then + n_extern_calls = new_child.as(nullable AExternCalls) + return + end + if _n_extern_code_block == old_child then + n_extern_code_block = new_child.as(nullable AExternCodeBlock) + return + end + if _n_kwdo == old_child then + n_kwdo = new_child.as(nullable TKwdo) + return + end + if _n_block == old_child then + n_block = new_child.as(nullable AExpr) + return + end + if _n_kwend == old_child then + n_kwend = new_child.as(nullable TKwend) + return + end end redef fun n_doc=(node) @@ -1276,18 +1234,58 @@ redef class AInternMethPropdef redef fun n_kwmeth=(node) do _n_kwmeth = node - node.parent = self + if node != null then node.parent = self + end + redef fun n_kwinit=(node) + do + _n_kwinit = node + if node != null then node.parent = self + end + redef fun n_kwnew=(node) + do + _n_kwnew = node + if node != null then node.parent = self end redef fun n_methid=(node) do _n_methid = node - node.parent = self + if node != null then node.parent = self end redef fun n_signature=(node) do _n_signature = node node.parent = self end + redef fun n_annotations=(node) + do + _n_annotations = node + if node != null then node.parent = self + end + redef fun n_extern_calls=(node) + do + _n_extern_calls = node + if node != null then node.parent = self + end + redef fun n_extern_code_block=(node) + do + _n_extern_code_block = node + if node != null then node.parent = self + end + redef fun n_kwdo=(node) + do + _n_kwdo = node + if node != null then node.parent = self + end + redef fun n_block=(node) + do + _n_block = node + if node != null then node.parent = self + end + redef fun n_kwend=(node) + do + _n_kwend = node + if node != null then node.parent = self + end redef fun visit_all(v: Visitor) @@ -1296,44 +1294,40 @@ redef class AInternMethPropdef v.enter_visit(_n_kwredef) v.enter_visit(_n_visibility) v.enter_visit(_n_kwmeth) + v.enter_visit(_n_kwinit) + v.enter_visit(_n_kwnew) v.enter_visit(_n_methid) v.enter_visit(_n_signature) + v.enter_visit(_n_annotations) + v.enter_visit(_n_extern_calls) + v.enter_visit(_n_extern_code_block) + v.enter_visit(_n_kwdo) + v.enter_visit(_n_block) + v.enter_visit(_n_kwend) end end -redef class AExternMethPropdef - private init empty_init do end - - init init_aexternmethpropdef ( +redef class ASuperPropdef + init init_asuperpropdef ( n_doc: nullable ADoc, n_kwredef: nullable TKwredef, n_visibility: nullable AVisibility, - n_kwmeth: nullable TKwmeth, - n_methid: nullable AMethid, - n_signature: nullable ASignature, - n_extern: nullable TString, - n_extern_calls: nullable AExternCalls, - n_extern_code_block: nullable AExternCodeBlock + n_kwsuper: nullable TKwsuper, + n_type: nullable AType, + n_annotations: nullable AAnnotations ) do - empty_init _n_doc = n_doc if n_doc != null then n_doc.parent = self _n_kwredef = n_kwredef if n_kwredef != null then n_kwredef.parent = self _n_visibility = n_visibility.as(not null) n_visibility.parent = self - _n_kwmeth = n_kwmeth.as(not null) - n_kwmeth.parent = self - _n_methid = n_methid.as(not null) - n_methid.parent = self - _n_signature = n_signature.as(not null) - n_signature.parent = self - _n_extern = n_extern - if n_extern != null then n_extern.parent = self - _n_extern_calls = n_extern_calls - if n_extern_calls != null then n_extern_calls.parent = self - _n_extern_code_block = n_extern_code_block - if n_extern_code_block != null then n_extern_code_block.parent = self + _n_kwsuper = n_kwsuper.as(not null) + n_kwsuper.parent = self + _n_type = n_type.as(not null) + n_type.parent = self + _n_annotations = n_annotations + if n_annotations != null then n_annotations.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -1350,28 +1344,16 @@ redef class AExternMethPropdef n_visibility = new_child.as(AVisibility) return end - if _n_kwmeth == old_child then - n_kwmeth = new_child.as(TKwmeth) - return - end - if _n_methid == old_child then - n_methid = new_child.as(AMethid) - return - end - if _n_signature == old_child then - n_signature = new_child.as(ASignature) - return - end - if _n_extern == old_child then - n_extern = new_child.as(nullable TString) + if _n_kwsuper == old_child then + n_kwsuper = new_child.as(TKwsuper) return end - if _n_extern_calls == old_child then - n_extern_calls = new_child.as(nullable AExternCalls) + if _n_type == old_child then + n_type = new_child.as(AType) return end - if _n_extern_code_block == old_child then - n_extern_code_block = new_child.as(nullable AExternCodeBlock) + if _n_annotations == old_child then + n_annotations = new_child.as(nullable AAnnotations) return end end @@ -1391,34 +1373,19 @@ redef class AExternMethPropdef _n_visibility = node node.parent = self end - redef fun n_kwmeth=(node) - do - _n_kwmeth = node - node.parent = self - end - redef fun n_methid=(node) + redef fun n_kwsuper=(node) do - _n_methid = node + _n_kwsuper = node node.parent = self end - redef fun n_signature=(node) + redef fun n_type=(node) do - _n_signature = node + _n_type = node node.parent = self end - redef fun n_extern=(node) - do - _n_extern = node - if node != null then node.parent = self - end - redef fun n_extern_calls=(node) - do - _n_extern_calls = node - if node != null then node.parent = self - end - redef fun n_extern_code_block=(node) + redef fun n_annotations=(node) do - _n_extern_code_block = node + _n_annotations = node if node != null then node.parent = self end @@ -1428,45 +1395,38 @@ redef class AExternMethPropdef v.enter_visit(_n_doc) v.enter_visit(_n_kwredef) v.enter_visit(_n_visibility) - v.enter_visit(_n_kwmeth) - v.enter_visit(_n_methid) - v.enter_visit(_n_signature) - v.enter_visit(_n_extern) - v.enter_visit(_n_extern_calls) - v.enter_visit(_n_extern_code_block) + v.enter_visit(_n_kwsuper) + v.enter_visit(_n_type) + v.enter_visit(_n_annotations) end end -redef class AConcreteMethPropdef - private init empty_init do end - - init init_aconcretemethpropdef ( +redef class AAnnotPropdef + init init_aannotpropdef ( 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_annotations: nullable AAnnotations, - n_block: nullable AExpr + n_atid: nullable AAtid, + n_opar: nullable TOpar, + n_args: Collection[Object], # Should be Collection[AExpr] + n_cpar: nullable TCpar, + n_annotations: nullable AAnnotations ) do - empty_init _n_doc = n_doc if n_doc != null then n_doc.parent = self _n_kwredef = n_kwredef if n_kwredef != null then n_kwredef.parent = self - _n_visibility = n_visibility.as(not null) - n_visibility.parent = self - _n_kwmeth = n_kwmeth.as(not null) - n_kwmeth.parent = self - _n_methid = n_methid.as(not null) - n_methid.parent = self - _n_signature = n_signature.as(not null) - n_signature.parent = self + _n_visibility = n_visibility + if n_visibility != null then n_visibility.parent = self + _n_atid = n_atid.as(not null) + n_atid.parent = self + _n_opar = n_opar + if n_opar != null then n_opar.parent = self + self.n_args.unsafe_add_all(n_args) + _n_cpar = n_cpar + if n_cpar != null then n_cpar.parent = self _n_annotations = n_annotations if n_annotations != null then n_annotations.parent = self - _n_block = n_block - if n_block != null then n_block.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -1480,29 +1440,26 @@ redef class AConcreteMethPropdef return end if _n_visibility == old_child then - n_visibility = new_child.as(AVisibility) + n_visibility = new_child.as(nullable AVisibility) return end - if _n_kwmeth == old_child then - n_kwmeth = new_child.as(TKwmeth) + if _n_atid == old_child then + n_atid = new_child.as(AAtid) return end - if _n_methid == old_child then - n_methid = new_child.as(AMethid) + if _n_opar == old_child then + n_opar = new_child.as(nullable TOpar) return end - if _n_signature == old_child then - n_signature = new_child.as(ASignature) + if n_args.replace_child(old_child, new_child) then return + if _n_cpar == old_child then + n_cpar = new_child.as(nullable TCpar) return end if _n_annotations == old_child then n_annotations = new_child.as(nullable AAnnotations) return end - if _n_block == old_child then - n_block = new_child.as(nullable AExpr) - return - end end redef fun n_doc=(node) @@ -1518,33 +1475,28 @@ redef class AConcreteMethPropdef redef fun n_visibility=(node) do _n_visibility = node - node.parent = self + if node != null then node.parent = self end - redef fun n_kwmeth=(node) + redef fun n_atid=(node) do - _n_kwmeth = node + _n_atid = node node.parent = self end - redef fun n_methid=(node) + redef fun n_opar=(node) do - _n_methid = node - node.parent = self + _n_opar = node + if node != null then node.parent = self end - redef fun n_signature=(node) + redef fun n_cpar=(node) do - _n_signature = node - node.parent = self + _n_cpar = node + if node != null then node.parent = self end redef fun n_annotations=(node) do _n_annotations = node if node != null then node.parent = self end - redef fun n_block=(node) - do - _n_block = node - if node != null then node.parent = self - end redef fun visit_all(v: Visitor) @@ -1552,987 +1504,599 @@ redef class AConcreteMethPropdef v.enter_visit(_n_doc) v.enter_visit(_n_kwredef) v.enter_visit(_n_visibility) - v.enter_visit(_n_kwmeth) - v.enter_visit(_n_methid) - v.enter_visit(_n_signature) + v.enter_visit(_n_atid) + v.enter_visit(_n_opar) + n_args.visit_all(v) + v.enter_visit(_n_cpar) v.enter_visit(_n_annotations) - v.enter_visit(_n_block) end end -redef class AConcreteInitPropdef - private init empty_init do end - - init init_aconcreteinitpropdef ( - n_doc: nullable ADoc, - n_kwredef: nullable TKwredef, - n_visibility: nullable AVisibility, - n_kwinit: nullable TKwinit, - n_methid: nullable AMethid, - n_signature: nullable ASignature, - n_annotations: nullable AAnnotations, - n_block: nullable AExpr +redef class AIdMethid + init init_aidmethid ( + n_id: nullable TId ) do - empty_init - _n_doc = n_doc - if n_doc != null then n_doc.parent = self - _n_kwredef = n_kwredef - if n_kwredef != null then n_kwredef.parent = self - _n_visibility = n_visibility.as(not null) - n_visibility.parent = self - _n_kwinit = n_kwinit.as(not null) - n_kwinit.parent = self - _n_methid = n_methid - if n_methid != null then n_methid.parent = self - _n_signature = n_signature.as(not null) - n_signature.parent = self - _n_annotations = n_annotations - if n_annotations != null then n_annotations.parent = self - _n_block = n_block - if n_block != null then n_block.parent = self + _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_doc == old_child then - n_doc = new_child.as(nullable ADoc) - return - end - if _n_kwredef == old_child then - n_kwredef = new_child.as(nullable TKwredef) - return - end - if _n_visibility == old_child then - n_visibility = new_child.as(AVisibility) - return - end - if _n_kwinit == old_child then - n_kwinit = new_child.as(TKwinit) - return - end - if _n_methid == old_child then - n_methid = new_child.as(nullable AMethid) - return - end - if _n_signature == old_child then - n_signature = new_child.as(ASignature) + if _n_id == old_child then + n_id = new_child.as(TId) return end - if _n_annotations == old_child then - n_annotations = new_child.as(nullable AAnnotations) + end + + redef fun n_id=(node) + do + _n_id = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_id) + end +end +redef class APlusMethid + init init_aplusmethid ( + n_op: nullable TPlus + ) + do + _n_op = n_op.as(not null) + n_op.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_op == old_child then + n_op = new_child.as(TPlus) return end - if _n_block == old_child then - n_block = new_child.as(nullable AExpr) + end + + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_op) + end +end +redef class AMinusMethid + init init_aminusmethid ( + n_op: nullable TMinus + ) + do + _n_op = n_op.as(not null) + n_op.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_op == old_child then + n_op = new_child.as(TMinus) return end end - redef fun n_doc=(node) + redef fun n_op=(node) do - _n_doc = node - if node != null then node.parent = self + _n_op = node + node.parent = self end - redef fun n_kwredef=(node) + + + redef fun visit_all(v: Visitor) do - _n_kwredef = node - if node != null then node.parent = self + v.enter_visit(_n_op) end - redef fun n_visibility=(node) +end +redef class AStarMethid + init init_astarmethid ( + n_op: nullable TStar + ) do - _n_visibility = node - node.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end - redef fun n_kwinit=(node) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_kwinit = node + if _n_op == old_child then + n_op = new_child.as(TStar) + return + end + end + + redef fun n_op=(node) + do + _n_op = node node.parent = self end - redef fun n_methid=(node) + + + redef fun visit_all(v: Visitor) do - _n_methid = node - if node != null then node.parent = self + v.enter_visit(_n_op) end - redef fun n_signature=(node) +end +redef class AStarstarMethid + init init_astarstarmethid ( + n_op: nullable TStarstar + ) do - _n_signature = node - node.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end - redef fun n_annotations=(node) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_annotations = node - if node != null then node.parent = self + if _n_op == old_child then + n_op = new_child.as(TStarstar) + return + end end - redef fun n_block=(node) + + redef fun n_op=(node) do - _n_block = node - if node != null then node.parent = self + _n_op = node + node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_doc) - v.enter_visit(_n_kwredef) - v.enter_visit(_n_visibility) - v.enter_visit(_n_kwinit) - v.enter_visit(_n_methid) - v.enter_visit(_n_signature) - v.enter_visit(_n_annotations) - v.enter_visit(_n_block) + v.enter_visit(_n_op) end end -redef class AExternInitPropdef - private init empty_init do end - - init init_aexterninitpropdef ( - n_doc: nullable ADoc, - n_kwredef: nullable TKwredef, - n_visibility: nullable AVisibility, - n_kwnew: nullable TKwnew, - n_methid: nullable AMethid, - n_signature: nullable ASignature, - n_extern: nullable TString, - n_extern_calls: nullable AExternCalls, - n_extern_code_block: nullable AExternCodeBlock +redef class ASlashMethid + init init_aslashmethid ( + n_op: nullable TSlash ) do - empty_init - _n_doc = n_doc - if n_doc != null then n_doc.parent = self - _n_kwredef = n_kwredef - if n_kwredef != null then n_kwredef.parent = self - _n_visibility = n_visibility.as(not null) - n_visibility.parent = self - _n_kwnew = n_kwnew.as(not null) - n_kwnew.parent = self - _n_methid = n_methid - if n_methid != null then n_methid.parent = self - _n_signature = n_signature.as(not null) - n_signature.parent = self - _n_extern = n_extern - if n_extern != null then n_extern.parent = self - _n_extern_calls = n_extern_calls - if n_extern_calls != null then n_extern_calls.parent = self - _n_extern_code_block = n_extern_code_block - if n_extern_code_block != null then n_extern_code_block.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_doc == old_child then - n_doc = new_child.as(nullable ADoc) - return - end - if _n_kwredef == old_child then - n_kwredef = new_child.as(nullable TKwredef) - return - end - if _n_visibility == old_child then - n_visibility = new_child.as(AVisibility) - return - end - if _n_kwnew == old_child then - n_kwnew = new_child.as(TKwnew) - return - end - if _n_methid == old_child then - n_methid = new_child.as(nullable AMethid) - return - end - if _n_signature == old_child then - n_signature = new_child.as(ASignature) - return - end - if _n_extern == old_child then - n_extern = new_child.as(nullable TString) - return - end - if _n_extern_calls == old_child then - n_extern_calls = new_child.as(nullable AExternCalls) - return - end - if _n_extern_code_block == old_child then - n_extern_code_block = new_child.as(nullable AExternCodeBlock) + if _n_op == old_child then + n_op = new_child.as(TSlash) return end end - redef fun n_doc=(node) + redef fun n_op=(node) do - _n_doc = node - if node != null then node.parent = self + _n_op = node + node.parent = self end - redef fun n_kwredef=(node) + + + redef fun visit_all(v: Visitor) do - _n_kwredef = node - if node != null then node.parent = self + v.enter_visit(_n_op) end - redef fun n_visibility=(node) +end +redef class APercentMethid + init init_apercentmethid ( + n_op: nullable TPercent + ) do - _n_visibility = node - node.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end - redef fun n_kwnew=(node) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_kwnew = node - node.parent = self + if _n_op == old_child then + n_op = new_child.as(TPercent) + return + end end - redef fun n_methid=(node) + + redef fun n_op=(node) do - _n_methid = node - if node != null then node.parent = self + _n_op = node + node.parent = self end - redef fun n_signature=(node) + + + redef fun visit_all(v: Visitor) do - _n_signature = node - node.parent = self + v.enter_visit(_n_op) end - redef fun n_extern=(node) +end +redef class AEqMethid + init init_aeqmethid ( + n_op: nullable TEq + ) do - _n_extern = node - if node != null then node.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end - redef fun n_extern_calls=(node) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_extern_calls = node - if node != null then node.parent = self + if _n_op == old_child then + n_op = new_child.as(TEq) + return + end end - redef fun n_extern_code_block=(node) + + redef fun n_op=(node) do - _n_extern_code_block = node - if node != null then node.parent = self + _n_op = node + node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_doc) - v.enter_visit(_n_kwredef) - v.enter_visit(_n_visibility) - v.enter_visit(_n_kwnew) - v.enter_visit(_n_methid) - v.enter_visit(_n_signature) - v.enter_visit(_n_extern) - v.enter_visit(_n_extern_calls) - v.enter_visit(_n_extern_code_block) + v.enter_visit(_n_op) end end -redef class AMainMethPropdef - private init empty_init do end - - init init_amainmethpropdef ( - n_kwredef: nullable TKwredef, - n_block: nullable AExpr +redef class ANeMethid + init init_anemethid ( + n_op: nullable TNe ) do - empty_init - _n_kwredef = n_kwredef - if n_kwredef != null then n_kwredef.parent = self - _n_block = n_block - if n_block != null then n_block.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_kwredef == old_child then - n_kwredef = new_child.as(nullable TKwredef) - return - end - if _n_block == old_child then - n_block = new_child.as(nullable AExpr) + if _n_op == old_child then + n_op = new_child.as(TNe) return end end - redef fun n_kwredef=(node) - do - _n_kwredef = node - if node != null then node.parent = self - end - redef fun n_block=(node) + redef fun n_op=(node) do - _n_block = node - if node != null then node.parent = self + _n_op = node + node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwredef) - v.enter_visit(_n_block) + v.enter_visit(_n_op) end end -redef class ATypePropdef - private init empty_init do end - - init init_atypepropdef ( - n_doc: nullable ADoc, - n_kwredef: nullable TKwredef, - n_visibility: nullable AVisibility, - n_kwtype: nullable TKwtype, - n_id: nullable TClassid, - n_type: nullable AType, - n_annotations: nullable AAnnotations +redef class ALeMethid + init init_alemethid ( + n_op: nullable TLe ) do - empty_init - _n_doc = n_doc - if n_doc != null then n_doc.parent = self - _n_kwredef = n_kwredef - if n_kwredef != null then n_kwredef.parent = self - _n_visibility = n_visibility.as(not null) - n_visibility.parent = self - _n_kwtype = n_kwtype.as(not null) - n_kwtype.parent = self - _n_id = n_id.as(not null) - n_id.parent = self - _n_type = n_type.as(not null) - n_type.parent = self - _n_annotations = n_annotations - if n_annotations != null then n_annotations.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_doc == old_child then - n_doc = new_child.as(nullable ADoc) - return - end - if _n_kwredef == old_child then - n_kwredef = new_child.as(nullable TKwredef) - return - end - if _n_visibility == old_child then - n_visibility = new_child.as(AVisibility) - return - end - if _n_kwtype == old_child then - n_kwtype = new_child.as(TKwtype) - return - end - if _n_id == old_child then - n_id = new_child.as(TClassid) - return - end - if _n_type == old_child then - n_type = new_child.as(AType) - return - end - if _n_annotations == old_child then - n_annotations = new_child.as(nullable AAnnotations) + if _n_op == old_child then + n_op = new_child.as(TLe) return end end - redef fun n_doc=(node) - do - _n_doc = node - if node != null then node.parent = self - end - redef fun n_kwredef=(node) - do - _n_kwredef = node - if node != null then node.parent = self - end - redef fun n_visibility=(node) + redef fun n_op=(node) do - _n_visibility = node + _n_op = node node.parent = self end - redef fun n_kwtype=(node) + + + redef fun visit_all(v: Visitor) do - _n_kwtype = node - node.parent = self + v.enter_visit(_n_op) end - redef fun n_id=(node) +end +redef class AGeMethid + init init_agemethid ( + n_op: nullable TGe + ) do - _n_id = node - node.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end - redef fun n_type=(node) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_type = node - node.parent = self + if _n_op == old_child then + n_op = new_child.as(TGe) + return + end end - redef fun n_annotations=(node) + + redef fun n_op=(node) do - _n_annotations = node - if node != null then node.parent = self + _n_op = node + node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_doc) - v.enter_visit(_n_kwredef) - v.enter_visit(_n_visibility) - v.enter_visit(_n_kwtype) - v.enter_visit(_n_id) - v.enter_visit(_n_type) - v.enter_visit(_n_annotations) + v.enter_visit(_n_op) end end -redef class AReadAble - private init empty_init do end - - init init_areadable ( - n_kwredef: nullable TKwredef, - n_kwreadable: nullable TKwreadable +redef class ALtMethid + init init_altmethid ( + n_op: nullable TLt ) do - empty_init - _n_kwredef = n_kwredef - if n_kwredef != null then n_kwredef.parent = self - _n_kwreadable = n_kwreadable.as(not null) - n_kwreadable.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_kwredef == old_child then - n_kwredef = new_child.as(nullable TKwredef) - return - end - if _n_kwreadable == old_child then - n_kwreadable = new_child.as(TKwreadable) + if _n_op == old_child then + n_op = new_child.as(TLt) return end end - redef fun n_kwredef=(node) + redef fun n_op=(node) do - _n_kwredef = node - if node != null then node.parent = self - end - redef fun n_kwreadable=(node) - do - _n_kwreadable = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwredef) - v.enter_visit(_n_kwreadable) + v.enter_visit(_n_op) end end -redef class AWriteAble - private init empty_init do end - - init init_awriteable ( - n_kwredef: nullable TKwredef, - n_visibility: nullable AVisibility, - n_kwwritable: nullable TKwwritable +redef class AGtMethid + init init_agtmethid ( + n_op: nullable TGt ) do - empty_init - _n_kwredef = n_kwredef - if n_kwredef != null then n_kwredef.parent = self - _n_visibility = n_visibility - if n_visibility != null then n_visibility.parent = self - _n_kwwritable = n_kwwritable.as(not null) - n_kwwritable.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_kwredef == old_child then - n_kwredef = new_child.as(nullable TKwredef) - return - end - if _n_visibility == old_child then - n_visibility = new_child.as(nullable AVisibility) - return - end - if _n_kwwritable == old_child then - n_kwwritable = new_child.as(TKwwritable) + if _n_op == old_child then + n_op = new_child.as(TGt) return end end - redef fun n_kwredef=(node) - do - _n_kwredef = node - if node != null then node.parent = self - end - redef fun n_visibility=(node) - do - _n_visibility = node - if node != null then node.parent = self - end - redef fun n_kwwritable=(node) + redef fun n_op=(node) do - _n_kwwritable = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwredef) - v.enter_visit(_n_visibility) - v.enter_visit(_n_kwwritable) - end -end -redef class AIdMethid - private init empty_init do end - - init init_aidmethid ( - n_id: nullable TId - ) - do - 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 - n_id = new_child.as(TId) - return - end - end - - redef fun n_id=(node) - do - _n_id = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_id) - end -end -redef class APlusMethid - private init empty_init do end - - init init_aplusmethid ( - n_plus: nullable TPlus - ) - do - empty_init - _n_plus = n_plus.as(not null) - n_plus.parent = self - end - - redef fun replace_child(old_child: ANode, new_child: nullable ANode) - do - if _n_plus == old_child then - n_plus = new_child.as(TPlus) - return - end - end - - redef fun n_plus=(node) - do - _n_plus = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_plus) - end -end -redef class AMinusMethid - private init empty_init do end - - init init_aminusmethid ( - n_minus: nullable TMinus - ) - do - empty_init - _n_minus = n_minus.as(not null) - n_minus.parent = self - end - - redef fun replace_child(old_child: ANode, new_child: nullable ANode) - do - if _n_minus == old_child then - n_minus = new_child.as(TMinus) - return - end - end - - redef fun n_minus=(node) - do - _n_minus = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_minus) - end -end -redef class AStarMethid - private init empty_init do end - - init init_astarmethid ( - n_star: nullable TStar - ) - do - empty_init - _n_star = n_star.as(not null) - n_star.parent = self - end - - redef fun replace_child(old_child: ANode, new_child: nullable ANode) - do - if _n_star == old_child then - n_star = new_child.as(TStar) - return - end - end - - redef fun n_star=(node) - do - _n_star = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_star) - end -end -redef class ASlashMethid - private init empty_init do end - - init init_aslashmethid ( - n_slash: nullable TSlash - ) - do - empty_init - _n_slash = n_slash.as(not null) - n_slash.parent = self - end - - redef fun replace_child(old_child: ANode, new_child: nullable ANode) - do - if _n_slash == old_child then - n_slash = new_child.as(TSlash) - return - end - end - - redef fun n_slash=(node) - do - _n_slash = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_slash) - end -end -redef class APercentMethid - private init empty_init do end - - init init_apercentmethid ( - n_percent: nullable TPercent - ) - do - empty_init - _n_percent = n_percent.as(not null) - n_percent.parent = self - end - - redef fun replace_child(old_child: ANode, new_child: nullable ANode) - do - if _n_percent == old_child then - n_percent = new_child.as(TPercent) - return - end - end - - redef fun n_percent=(node) - do - _n_percent = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_percent) - end -end -redef class AEqMethid - private init empty_init do end - - init init_aeqmethid ( - n_eq: nullable TEq - ) - do - empty_init - _n_eq = n_eq.as(not null) - n_eq.parent = self - end - - redef fun replace_child(old_child: ANode, new_child: nullable ANode) - do - if _n_eq == old_child then - n_eq = new_child.as(TEq) - return - end - end - - redef fun n_eq=(node) - do - _n_eq = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_eq) + v.enter_visit(_n_op) end end -redef class ANeMethid - private init empty_init do end - - init init_anemethid ( - n_ne: nullable TNe +redef class ALlMethid + init init_allmethid ( + n_op: nullable TLl ) do - empty_init - _n_ne = n_ne.as(not null) - n_ne.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_ne == old_child then - n_ne = new_child.as(TNe) + if _n_op == old_child then + n_op = new_child.as(TLl) return end end - redef fun n_ne=(node) + redef fun n_op=(node) do - _n_ne = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_ne) + v.enter_visit(_n_op) end end -redef class ALeMethid - private init empty_init do end - - init init_alemethid ( - n_le: nullable TLe +redef class AGgMethid + init init_aggmethid ( + n_op: nullable TGg ) do - empty_init - _n_le = n_le.as(not null) - n_le.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_le == old_child then - n_le = new_child.as(TLe) + if _n_op == old_child then + n_op = new_child.as(TGg) return end end - redef fun n_le=(node) + redef fun n_op=(node) do - _n_le = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_le) + v.enter_visit(_n_op) end end -redef class AGeMethid - private init empty_init do end - - init init_agemethid ( - n_ge: nullable TGe +redef class AStarshipMethid + init init_astarshipmethid ( + n_op: nullable TStarship ) do - empty_init - _n_ge = n_ge.as(not null) - n_ge.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_ge == old_child then - n_ge = new_child.as(TGe) + if _n_op == old_child then + n_op = new_child.as(TStarship) return end end - redef fun n_ge=(node) + redef fun n_op=(node) do - _n_ge = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_ge) + v.enter_visit(_n_op) end end -redef class ALtMethid - private init empty_init do end - - init init_altmethid ( - n_lt: nullable TLt +redef class APipeMethid + init init_apipemethid ( + n_op: nullable TPipe ) do - empty_init - _n_lt = n_lt.as(not null) - n_lt.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_lt == old_child then - n_lt = new_child.as(TLt) + if _n_op == old_child then + n_op = new_child.as(TPipe) return end end - redef fun n_lt=(node) + redef fun n_op=(node) do - _n_lt = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_lt) + v.enter_visit(_n_op) end end -redef class AGtMethid - private init empty_init do end - - init init_agtmethid ( - n_gt: nullable TGt +redef class ACaretMethid + init init_acaretmethid ( + n_op: nullable TCaret ) do - empty_init - _n_gt = n_gt.as(not null) - n_gt.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_gt == old_child then - n_gt = new_child.as(TGt) + if _n_op == old_child then + n_op = new_child.as(TCaret) return end end - redef fun n_gt=(node) + redef fun n_op=(node) do - _n_gt = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_gt) + v.enter_visit(_n_op) end end -redef class ALlMethid - private init empty_init do end - - init init_allmethid ( - n_ll: nullable TLl +redef class AAmpMethid + init init_aampmethid ( + n_op: nullable TAmp ) do - empty_init - _n_ll = n_ll.as(not null) - n_ll.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_ll == old_child then - n_ll = new_child.as(TLl) + if _n_op == old_child then + n_op = new_child.as(TAmp) return end end - redef fun n_ll=(node) + redef fun n_op=(node) do - _n_ll = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_ll) + v.enter_visit(_n_op) end end -redef class AGgMethid - private init empty_init do end - - init init_aggmethid ( - n_gg: nullable TGg +redef class ATildeMethid + init init_atildemethid ( + n_op: nullable TTilde ) do - empty_init - _n_gg = n_gg.as(not null) - n_gg.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_gg == old_child then - n_gg = new_child.as(TGg) + if _n_op == old_child then + n_op = new_child.as(TTilde) return end end - redef fun n_gg=(node) + redef fun n_op=(node) do - _n_gg = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_gg) + v.enter_visit(_n_op) end end redef class ABraMethid - private init empty_init do end - init init_abramethid ( n_obra: nullable TObra, n_cbra: nullable TCbra ) do - empty_init _n_obra = n_obra.as(not null) n_obra.parent = self _n_cbra = n_cbra.as(not null) @@ -2569,47 +2133,12 @@ redef class ABraMethid v.enter_visit(_n_cbra) end end -redef class AStarshipMethid - private init empty_init do end - - init init_astarshipmethid ( - n_starship: nullable TStarship - ) - do - empty_init - _n_starship = n_starship.as(not null) - n_starship.parent = self - end - - redef fun replace_child(old_child: ANode, new_child: nullable ANode) - do - if _n_starship == old_child then - n_starship = new_child.as(TStarship) - return - end - end - - redef fun n_starship=(node) - do - _n_starship = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_starship) - end -end redef class AAssignMethid - private init empty_init do end - init init_aassignmethid ( n_id: nullable TId, n_assign: nullable TAssign ) do - empty_init _n_id = n_id.as(not null) n_id.parent = self _n_assign = n_assign.as(not null) @@ -2647,15 +2176,12 @@ redef class AAssignMethid end end redef class ABraassignMethid - private init empty_init do end - init init_abraassignmethid ( n_obra: nullable TObra, n_cbra: nullable TCbra, n_assign: nullable TAssign ) do - empty_init _n_obra = n_obra.as(not null) n_obra.parent = self _n_cbra = n_cbra.as(not null) @@ -2704,53 +2230,92 @@ redef class ABraassignMethid v.enter_visit(_n_assign) end end -redef class ASignature - private init empty_init do end - - init init_asignature ( - n_opar: nullable TOpar, - n_params: Collection[Object], # Should be Collection[AParam] - n_cpar: nullable TCpar, - n_type: nullable AType +redef class AQid + init init_aqid ( + n_qualified: nullable AQualified, + n_id: nullable TId ) do - empty_init - _n_opar = n_opar - if n_opar != null then n_opar.parent = self - _n_params.unsafe_add_all(n_params) - _n_cpar = n_cpar - if n_cpar != null then n_cpar.parent = self - _n_type = n_type - if n_type != null then n_type.parent = self + _n_qualified = n_qualified + if n_qualified != null then n_qualified.parent = self + _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_opar == old_child then - n_opar = new_child.as(nullable TOpar) - return - end - if _n_params.replace_child(old_child, new_child) then return - if _n_cpar == old_child then - n_cpar = new_child.as(nullable TCpar) + if _n_qualified == old_child then + n_qualified = new_child.as(nullable AQualified) return end - if _n_type == old_child then - n_type = new_child.as(nullable AType) + if _n_id == old_child then + n_id = new_child.as(TId) return end end - redef fun n_opar=(node) + redef fun n_qualified=(node) do - _n_opar = node + _n_qualified = node if node != null then node.parent = self end - redef fun n_cpar=(node) + redef fun n_id=(node) do - _n_cpar = node - if node != null then node.parent = self - end + _n_id = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_qualified) + v.enter_visit(_n_id) + end +end +redef class ASignature + init init_asignature ( + n_opar: nullable TOpar, + n_params: Collection[Object], # Should be Collection[AParam] + n_cpar: nullable TCpar, + n_type: nullable AType + ) + do + _n_opar = n_opar + if n_opar != null then n_opar.parent = self + self.n_params.unsafe_add_all(n_params) + _n_cpar = n_cpar + if n_cpar != null then n_cpar.parent = self + _n_type = n_type + if n_type != null then n_type.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_opar == old_child then + n_opar = new_child.as(nullable TOpar) + return + end + if n_params.replace_child(old_child, new_child) then return + if _n_cpar == old_child then + n_cpar = new_child.as(nullable TCpar) + return + end + if _n_type == old_child then + n_type = new_child.as(nullable AType) + return + end + end + + redef fun n_opar=(node) + do + _n_opar = node + if node != null then node.parent = self + end + redef fun n_cpar=(node) + do + _n_cpar = node + if node != null then node.parent = self + end redef fun n_type=(node) do _n_type = node @@ -2761,14 +2326,12 @@ redef class ASignature redef fun visit_all(v: Visitor) do v.enter_visit(_n_opar) - _n_params.visit_all(v) + n_params.visit_all(v) v.enter_visit(_n_cpar) v.enter_visit(_n_type) end end redef class AParam - private init empty_init do end - init init_aparam ( n_id: nullable TId, n_type: nullable AType, @@ -2776,7 +2339,6 @@ redef class AParam n_annotations: nullable AAnnotations ) do - empty_init _n_id = n_id.as(not null) n_id.parent = self _n_type = n_type @@ -2838,21 +2400,24 @@ redef class AParam end end redef class AType - private init empty_init do end - init init_atype ( n_kwnullable: nullable TKwnullable, n_id: nullable TClassid, + n_obra: nullable TObra, n_types: Collection[Object], # Should be Collection[AType] + n_cbra: nullable TCbra, n_annotations: nullable AAnnotations ) do - empty_init _n_kwnullable = n_kwnullable if n_kwnullable != null then n_kwnullable.parent = self _n_id = n_id.as(not null) n_id.parent = self - _n_types.unsafe_add_all(n_types) + _n_obra = n_obra + if n_obra != null then n_obra.parent = self + self.n_types.unsafe_add_all(n_types) + _n_cbra = n_cbra + if n_cbra != null then n_cbra.parent = self _n_annotations = n_annotations if n_annotations != null then n_annotations.parent = self end @@ -2867,7 +2432,15 @@ redef class AType n_id = new_child.as(TClassid) return end - if _n_types.replace_child(old_child, new_child) then return + if _n_obra == old_child then + n_obra = new_child.as(nullable TObra) + return + end + if n_types.replace_child(old_child, new_child) then return + if _n_cbra == old_child then + n_cbra = new_child.as(nullable TCbra) + return + end if _n_annotations == old_child then n_annotations = new_child.as(nullable AAnnotations) return @@ -2884,6 +2457,16 @@ redef class AType _n_id = node node.parent = self end + redef fun n_obra=(node) + do + _n_obra = node + if node != null then node.parent = self + end + redef fun n_cbra=(node) + do + _n_cbra = node + if node != null then node.parent = self + end redef fun n_annotations=(node) do _n_annotations = node @@ -2895,23 +2478,22 @@ redef class AType do v.enter_visit(_n_kwnullable) v.enter_visit(_n_id) - _n_types.visit_all(v) + v.enter_visit(_n_obra) + n_types.visit_all(v) + v.enter_visit(_n_cbra) v.enter_visit(_n_annotations) end end redef class ALabel - private init empty_init do end - init init_alabel ( n_kwlabel: nullable TKwlabel, n_id: nullable TId ) do - empty_init _n_kwlabel = n_kwlabel.as(not null) n_kwlabel.parent = self - _n_id = n_id.as(not null) - n_id.parent = self + _n_id = n_id + if n_id != null then n_id.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -2921,7 +2503,7 @@ redef class ALabel return end if _n_id == old_child then - n_id = new_child.as(TId) + n_id = new_child.as(nullable TId) return end end @@ -2934,7 +2516,7 @@ redef class ALabel redef fun n_id=(node) do _n_id = node - node.parent = self + if node != null then node.parent = self end @@ -2945,22 +2527,19 @@ redef class ALabel end end redef class ABlockExpr - private init empty_init do end - init init_ablockexpr ( n_expr: Collection[Object], # Should be Collection[AExpr] n_kwend: nullable TKwend ) do - empty_init - _n_expr.unsafe_add_all(n_expr) + self.n_expr.unsafe_add_all(n_expr) _n_kwend = n_kwend if n_kwend != null then n_kwend.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_expr.replace_child(old_child, new_child) then return + if n_expr.replace_child(old_child, new_child) then return if _n_kwend == old_child then n_kwend = new_child.as(nullable TKwend) return @@ -2976,13 +2555,11 @@ redef class ABlockExpr redef fun visit_all(v: Visitor) do - _n_expr.visit_all(v) + n_expr.visit_all(v) v.enter_visit(_n_kwend) end end redef class AVardeclExpr - private init empty_init do end - init init_avardeclexpr ( n_kwvar: nullable TKwvar, n_id: nullable TId, @@ -2992,9 +2569,8 @@ redef class AVardeclExpr n_annotations: nullable AAnnotations ) do - empty_init - _n_kwvar = n_kwvar.as(not null) - n_kwvar.parent = self + _n_kwvar = n_kwvar + if n_kwvar != null then n_kwvar.parent = self _n_id = n_id.as(not null) n_id.parent = self _n_type = n_type @@ -3010,7 +2586,7 @@ redef class AVardeclExpr redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_kwvar == old_child then - n_kwvar = new_child.as(TKwvar) + n_kwvar = new_child.as(nullable TKwvar) return end if _n_id == old_child then @@ -3038,7 +2614,7 @@ redef class AVardeclExpr redef fun n_kwvar=(node) do _n_kwvar = node - node.parent = self + if node != null then node.parent = self end redef fun n_id=(node) do @@ -3078,14 +2654,11 @@ redef class AVardeclExpr end end redef class AReturnExpr - private init empty_init do end - init init_areturnexpr ( n_kwreturn: nullable TKwreturn, n_expr: nullable AExpr ) do - empty_init _n_kwreturn = n_kwreturn if n_kwreturn != null then n_kwreturn.parent = self _n_expr = n_expr @@ -3123,21 +2696,15 @@ redef class AReturnExpr end end redef class ABreakExpr - private init empty_init do end - init init_abreakexpr ( n_kwbreak: nullable TKwbreak, - n_label: nullable ALabel, - n_expr: nullable AExpr + n_label: nullable ALabel ) 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 - _n_expr = n_expr - if n_expr != null then n_expr.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -3150,10 +2717,6 @@ redef class ABreakExpr n_label = new_child.as(nullable ALabel) return end - if _n_expr == old_child then - n_expr = new_child.as(nullable AExpr) - return - end end redef fun n_kwbreak=(node) @@ -3166,28 +2729,19 @@ redef class ABreakExpr _n_label = node if node != null then node.parent = self end - redef fun n_expr=(node) - do - _n_expr = node - if node != null then node.parent = self - end redef fun visit_all(v: Visitor) do v.enter_visit(_n_kwbreak) v.enter_visit(_n_label) - v.enter_visit(_n_expr) end end redef class AAbortExpr - private init empty_init do end - init init_aabortexpr ( n_kwabort: nullable TKwabort ) do - empty_init _n_kwabort = n_kwabort.as(not null) n_kwabort.parent = self end @@ -3213,21 +2767,15 @@ redef class AAbortExpr end end redef class AContinueExpr - private init empty_init do end - init init_acontinueexpr ( n_kwcontinue: nullable TKwcontinue, - n_label: nullable ALabel, - n_expr: nullable AExpr + n_label: nullable ALabel ) do - empty_init _n_kwcontinue = n_kwcontinue if n_kwcontinue != null then n_kwcontinue.parent = self _n_label = n_label if n_label != null then n_label.parent = self - _n_expr = n_expr - if n_expr != null then n_expr.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -3240,10 +2788,6 @@ redef class AContinueExpr n_label = new_child.as(nullable ALabel) return end - if _n_expr == old_child then - n_expr = new_child.as(nullable AExpr) - return - end end redef fun n_kwcontinue=(node) @@ -3256,30 +2800,21 @@ redef class AContinueExpr _n_label = node if node != null then node.parent = self end - redef fun n_expr=(node) - do - _n_expr = node - if node != null then node.parent = self - end redef fun visit_all(v: Visitor) do v.enter_visit(_n_kwcontinue) v.enter_visit(_n_label) - v.enter_visit(_n_expr) end end redef class ADoExpr - private init empty_init do end - init init_adoexpr ( n_kwdo: nullable TKwdo, n_block: nullable AExpr, n_label: nullable ALabel ) do - empty_init _n_kwdo = n_kwdo.as(not null) n_kwdo.parent = self _n_block = n_block @@ -3329,22 +2864,25 @@ redef class ADoExpr end end redef class AIfExpr - private init empty_init do end - init init_aifexpr ( 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 _n_kwif = n_kwif.as(not null) n_kwif.parent = self _n_expr = n_expr.as(not null) n_expr.parent = self + _n_kwthen = n_kwthen.as(not null) + n_kwthen.parent = self _n_then = n_then if n_then != null then n_then.parent = self + _n_kwelse = n_kwelse + if n_kwelse != null then n_kwelse.parent = self _n_else = n_else if n_else != null then n_else.parent = self end @@ -3359,10 +2897,18 @@ redef class AIfExpr n_expr = new_child.as(AExpr) return end + if _n_kwthen == old_child then + n_kwthen = new_child.as(TKwthen) + return + end if _n_then == old_child then n_then = new_child.as(nullable AExpr) return end + if _n_kwelse == old_child then + n_kwelse = new_child.as(nullable TKwelse) + return + end if _n_else == old_child then n_else = new_child.as(nullable AExpr) return @@ -3379,11 +2925,21 @@ redef class AIfExpr _n_expr = node node.parent = self end + redef fun n_kwthen=(node) + do + _n_kwthen = node + node.parent = self + end redef fun n_then=(node) do _n_then = node if node != null then node.parent = self end + redef fun n_kwelse=(node) + do + _n_kwelse = node + if node != null then node.parent = self + end redef fun n_else=(node) do _n_else = node @@ -3395,13 +2951,13 @@ redef class AIfExpr 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 AIfexprExpr - private init empty_init do end - init init_aifexprexpr ( n_kwif: nullable TKwif, n_expr: nullable AExpr, @@ -3411,7 +2967,6 @@ redef class AIfexprExpr n_else: nullable AExpr ) do - empty_init _n_kwif = n_kwif.as(not null) n_kwif.parent = self _n_expr = n_expr.as(not null) @@ -3497,8 +3052,6 @@ redef class AIfexprExpr end end redef class AWhileExpr - private init empty_init do end - init init_awhileexpr ( n_kwwhile: nullable TKwwhile, n_expr: nullable AExpr, @@ -3507,7 +3060,6 @@ redef class AWhileExpr n_label: nullable ALabel ) do - empty_init _n_kwwhile = n_kwwhile.as(not null) n_kwwhile.parent = self _n_expr = n_expr.as(not null) @@ -3581,15 +3133,12 @@ redef class AWhileExpr end end 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 - empty_init _n_kwloop = n_kwloop.as(not null) n_kwloop.parent = self _n_block = n_block @@ -3639,23 +3188,17 @@ redef class ALoopExpr end end redef class AForExpr - private init empty_init do end - init init_aforexpr ( n_kwfor: nullable TKwfor, - n_ids: Collection[Object], # Should be Collection[TId] - n_expr: nullable AExpr, + n_groups: Collection[Object], # Should be Collection[AForGroup] n_kwdo: nullable TKwdo, n_block: nullable AExpr, n_label: nullable ALabel ) do - empty_init _n_kwfor = n_kwfor.as(not null) n_kwfor.parent = self - _n_ids.unsafe_add_all(n_ids) - _n_expr = n_expr.as(not null) - n_expr.parent = self + self.n_groups.unsafe_add_all(n_groups) _n_kwdo = n_kwdo.as(not null) n_kwdo.parent = self _n_block = n_block @@ -3670,7 +3213,79 @@ redef class AForExpr n_kwfor = new_child.as(TKwfor) return end - if _n_ids.replace_child(old_child, new_child) then return + if n_groups.replace_child(old_child, new_child) then return + if _n_kwdo == old_child then + n_kwdo = new_child.as(TKwdo) + return + end + if _n_block == old_child then + n_block = new_child.as(nullable AExpr) + return + end + if _n_label == old_child then + n_label = new_child.as(nullable ALabel) + return + end + end + + redef fun n_kwfor=(node) + do + _n_kwfor = node + node.parent = self + end + redef fun n_kwdo=(node) + do + _n_kwdo = node + node.parent = self + end + redef fun n_block=(node) + do + _n_block = node + if node != null then node.parent = self + end + redef fun n_label=(node) + do + _n_label = node + if node != null then node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_kwfor) + n_groups.visit_all(v) + v.enter_visit(_n_kwdo) + v.enter_visit(_n_block) + v.enter_visit(_n_label) + end +end +redef class AWithExpr + init init_awithexpr ( + n_kwwith: nullable TKwwith, + n_expr: nullable AExpr, + n_kwdo: nullable TKwdo, + n_block: nullable AExpr, + n_label: nullable ALabel + ) + do + _n_kwwith = n_kwwith.as(not null) + n_kwwith.parent = self + _n_expr = n_expr.as(not null) + n_expr.parent = self + _n_kwdo = n_kwdo.as(not null) + n_kwdo.parent = self + _n_block = n_block + if n_block != null then n_block.parent = self + _n_label = n_label + if n_label != null then n_label.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_kwwith == old_child then + n_kwwith = new_child.as(TKwwith) + return + end if _n_expr == old_child then n_expr = new_child.as(AExpr) return @@ -3689,9 +3304,9 @@ redef class AForExpr end end - redef fun n_kwfor=(node) + redef fun n_kwwith=(node) do - _n_kwfor = node + _n_kwwith = node node.parent = self end redef fun n_expr=(node) @@ -3718,8 +3333,7 @@ redef class AForExpr redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwfor) - _n_ids.visit_all(v) + v.enter_visit(_n_kwwith) v.enter_visit(_n_expr) v.enter_visit(_n_kwdo) v.enter_visit(_n_block) @@ -3727,22 +3341,22 @@ redef class AForExpr end end redef class AAssertExpr - private init empty_init do end - init init_aassertexpr ( n_kwassert: nullable TKwassert, n_id: nullable TId, n_expr: nullable AExpr, + n_kwelse: nullable TKwelse, n_else: nullable AExpr ) do - empty_init _n_kwassert = n_kwassert.as(not null) n_kwassert.parent = self _n_id = n_id if n_id != null then n_id.parent = self _n_expr = n_expr.as(not null) n_expr.parent = self + _n_kwelse = n_kwelse + if n_kwelse != null then n_kwelse.parent = self _n_else = n_else if n_else != null then n_else.parent = self end @@ -3761,6 +3375,10 @@ redef class AAssertExpr n_expr = new_child.as(AExpr) return end + if _n_kwelse == old_child then + n_kwelse = new_child.as(nullable TKwelse) + return + end if _n_else == old_child then n_else = new_child.as(nullable AExpr) return @@ -3782,6 +3400,11 @@ redef class AAssertExpr _n_expr = node node.parent = self end + redef fun n_kwelse=(node) + do + _n_kwelse = node + if node != null then node.parent = self + end redef fun n_else=(node) do _n_else = node @@ -3794,18 +3417,16 @@ redef class AAssertExpr v.enter_visit(_n_kwassert) v.enter_visit(_n_id) v.enter_visit(_n_expr) + v.enter_visit(_n_kwelse) v.enter_visit(_n_else) end end redef class AOnceExpr - private init empty_init do end - init init_aonceexpr ( n_kwonce: nullable TKwonce, n_expr: nullable AExpr ) do - empty_init _n_kwonce = n_kwonce.as(not null) n_kwonce.parent = self _n_expr = n_expr.as(not null) @@ -3843,13 +3464,10 @@ redef class AOnceExpr end end redef class ASendExpr - private init empty_init do end - init init_asendexpr ( n_expr: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self end @@ -3875,14 +3493,11 @@ redef class ASendExpr end end redef class ABinopExpr - private init empty_init do end - 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) @@ -3920,16 +3535,16 @@ redef class ABinopExpr end end redef class AOrExpr - private init empty_init do end - init init_aorexpr ( n_expr: nullable AExpr, + n_op: nullable TKwor, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -3940,6 +3555,10 @@ redef class AOrExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TKwor) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -3951,6 +3570,11 @@ redef class AOrExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -3961,20 +3585,21 @@ redef class AOrExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class AAndExpr - private init empty_init do end - init init_aandexpr ( n_expr: nullable AExpr, + n_op: nullable TKwand, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -3985,6 +3610,10 @@ redef class AAndExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TKwand) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -3996,6 +3625,11 @@ redef class AAndExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4006,20 +3640,24 @@ redef class AAndExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class AOrElseExpr - private init empty_init do end - init init_aorelseexpr ( n_expr: nullable AExpr, + n_op: nullable TKwor, + n_kwelse: nullable TKwelse, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self + _n_kwelse = n_kwelse.as(not null) + n_kwelse.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4030,17 +3668,35 @@ redef class AOrElseExpr n_expr = new_child.as(AExpr) return end - if _n_expr2 == old_child then - n_expr2 = new_child.as(AExpr) + if _n_op == old_child then + n_op = new_child.as(TKwor) return end - end + if _n_kwelse == old_child then + n_kwelse = new_child.as(TKwelse) + return + end + if _n_expr2 == old_child then + n_expr2 = new_child.as(AExpr) + return + end + end redef fun n_expr=(node) do _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end + redef fun n_kwelse=(node) + do + _n_kwelse = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4051,20 +3707,22 @@ redef class AOrElseExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) + v.enter_visit(_n_kwelse) v.enter_visit(_n_expr2) end end redef class AImpliesExpr - private init empty_init do end - init init_aimpliesexpr ( n_expr: nullable AExpr, + n_op: nullable TKwimplies, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4075,6 +3733,10 @@ redef class AImpliesExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TKwimplies) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4086,6 +3748,11 @@ redef class AImpliesExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4096,18 +3763,16 @@ redef class AImpliesExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class ANotExpr - private init empty_init do end - init init_anotexpr ( n_kwnot: nullable TKwnot, n_expr: nullable AExpr ) do - empty_init _n_kwnot = n_kwnot.as(not null) n_kwnot.parent = self _n_expr = n_expr.as(not null) @@ -4145,16 +3810,16 @@ redef class ANotExpr end end redef class AEqExpr - private init empty_init do end - init init_aeqexpr ( n_expr: nullable AExpr, + n_op: nullable TEq, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4165,6 +3830,10 @@ redef class AEqExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TEq) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4176,6 +3845,11 @@ redef class AEqExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4186,20 +3860,21 @@ redef class AEqExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class ANeExpr - private init empty_init do end - init init_aneexpr ( n_expr: nullable AExpr, + n_op: nullable TNe, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4210,6 +3885,10 @@ redef class ANeExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TNe) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4221,6 +3900,11 @@ redef class ANeExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4231,20 +3915,21 @@ redef class ANeExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class ALtExpr - private init empty_init do end - init init_altexpr ( n_expr: nullable AExpr, + n_op: nullable TLt, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4255,6 +3940,10 @@ redef class ALtExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TLt) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4266,6 +3955,11 @@ redef class ALtExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4276,20 +3970,21 @@ redef class ALtExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class ALeExpr - private init empty_init do end - init init_aleexpr ( n_expr: nullable AExpr, + n_op: nullable TLe, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4300,6 +3995,10 @@ redef class ALeExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TLe) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4311,6 +4010,11 @@ redef class ALeExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4321,20 +4025,21 @@ redef class ALeExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class ALlExpr - private init empty_init do end - init init_allexpr ( n_expr: nullable AExpr, + n_op: nullable TLl, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4345,6 +4050,10 @@ redef class ALlExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TLl) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4356,6 +4065,11 @@ redef class ALlExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4366,20 +4080,21 @@ redef class ALlExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class AGtExpr - private init empty_init do end - init init_agtexpr ( n_expr: nullable AExpr, + n_op: nullable TGt, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4390,6 +4105,10 @@ redef class AGtExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TGt) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4401,6 +4120,11 @@ redef class AGtExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4411,20 +4135,21 @@ redef class AGtExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class AGeExpr - private init empty_init do end - init init_ageexpr ( n_expr: nullable AExpr, + n_op: nullable TGe, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4435,6 +4160,10 @@ redef class AGeExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TGe) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4446,6 +4175,11 @@ redef class AGeExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4456,20 +4190,21 @@ redef class AGeExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class AGgExpr - private init empty_init do end - init init_aggexpr ( n_expr: nullable AExpr, + n_op: nullable TGg, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4480,6 +4215,10 @@ redef class AGgExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TGg) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4491,6 +4230,11 @@ redef class AGgExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4501,20 +4245,21 @@ redef class AGgExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class AIsaExpr - private init empty_init do end - init init_aisaexpr ( n_expr: nullable AExpr, + n_kwisa: nullable TKwisa, n_type: nullable AType ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_kwisa = n_kwisa.as(not null) + n_kwisa.parent = self _n_type = n_type.as(not null) n_type.parent = self end @@ -4525,6 +4270,10 @@ redef class AIsaExpr n_expr = new_child.as(AExpr) return end + if _n_kwisa == old_child then + n_kwisa = new_child.as(TKwisa) + return + end if _n_type == old_child then n_type = new_child.as(AType) return @@ -4536,6 +4285,11 @@ redef class AIsaExpr _n_expr = node node.parent = self end + redef fun n_kwisa=(node) + do + _n_kwisa = node + node.parent = self + end redef fun n_type=(node) do _n_type = node @@ -4546,20 +4300,21 @@ redef class AIsaExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_kwisa) v.enter_visit(_n_type) end end redef class APlusExpr - private init empty_init do end - init init_aplusexpr ( n_expr: nullable AExpr, + n_op: nullable TPlus, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4570,6 +4325,10 @@ redef class APlusExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TPlus) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4581,6 +4340,11 @@ redef class APlusExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4591,20 +4355,21 @@ redef class APlusExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class AMinusExpr - private init empty_init do end - init init_aminusexpr ( n_expr: nullable AExpr, + n_op: nullable TMinus, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4615,6 +4380,10 @@ redef class AMinusExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TMinus) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4626,6 +4395,11 @@ redef class AMinusExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4636,20 +4410,21 @@ redef class AMinusExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class AStarshipExpr - private init empty_init do end - init init_astarshipexpr ( n_expr: nullable AExpr, + n_op: nullable TStarship, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4660,6 +4435,10 @@ redef class AStarshipExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TStarship) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4671,6 +4450,11 @@ redef class AStarshipExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4681,20 +4465,21 @@ redef class AStarshipExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end redef class AStarExpr - private init empty_init do end - init init_astarexpr ( n_expr: nullable AExpr, + n_op: nullable TStar, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4705,6 +4490,10 @@ redef class AStarExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TStar) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4716,6 +4505,11 @@ redef class AStarExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4726,20 +4520,21 @@ redef class AStarExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end -redef class ASlashExpr - private init empty_init do end - - init init_aslashexpr ( +redef class AStarstarExpr + init init_astarstarexpr ( n_expr: nullable AExpr, + n_op: nullable TStarstar, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4750,6 +4545,10 @@ redef class ASlashExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TStarstar) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4761,6 +4560,11 @@ redef class ASlashExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4771,20 +4575,21 @@ redef class ASlashExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end -redef class APercentExpr - private init empty_init do end - - init init_apercentexpr ( +redef class ASlashExpr + init init_aslashexpr ( n_expr: nullable AExpr, + n_op: nullable TSlash, n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self end @@ -4795,6 +4600,10 @@ redef class APercentExpr n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TSlash) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -4806,6 +4615,11 @@ redef class APercentExpr _n_expr = node node.parent = self end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -4816,138 +4630,133 @@ redef class APercentExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) + v.enter_visit(_n_op) v.enter_visit(_n_expr2) end end -redef class AUminusExpr - private init empty_init do end - - init init_auminusexpr ( - n_minus: nullable TMinus, - n_expr: nullable AExpr +redef class APercentExpr + init init_apercentexpr ( + n_expr: nullable AExpr, + n_op: nullable TPercent, + n_expr2: nullable AExpr ) do - empty_init - _n_minus = n_minus.as(not null) - n_minus.parent = self _n_expr = n_expr.as(not null) n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self + _n_expr2 = n_expr2.as(not null) + n_expr2.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_minus == old_child then - n_minus = new_child.as(TMinus) - return - end if _n_expr == old_child then n_expr = new_child.as(AExpr) return end + if _n_op == old_child then + n_op = new_child.as(TPercent) + return + end + if _n_expr2 == old_child then + n_expr2 = new_child.as(AExpr) + return + end end - redef fun n_minus=(node) + redef fun n_expr=(node) do - _n_minus = node + _n_expr = node node.parent = self end - redef fun n_expr=(node) + redef fun n_op=(node) do - _n_expr = node + _n_op = node + node.parent = self + end + redef fun n_expr2=(node) + do + _n_expr2 = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_minus) v.enter_visit(_n_expr) + v.enter_visit(_n_op) + v.enter_visit(_n_expr2) end end -redef class ANewExpr - private init empty_init do end - - init init_anewexpr ( - n_kwnew: nullable TKwnew, - n_type: nullable AType, - n_id: nullable TId, - n_args: nullable AExprs +redef class APipeExpr + init init_apipeexpr ( + n_expr: nullable AExpr, + n_op: nullable TPipe, + n_expr2: nullable AExpr ) do - empty_init - _n_kwnew = n_kwnew.as(not null) - n_kwnew.parent = self - _n_type = n_type.as(not null) - n_type.parent = self - _n_id = n_id - if n_id != null then n_id.parent = self - _n_args = n_args.as(not null) - n_args.parent = self + _n_expr = n_expr.as(not null) + n_expr.parent = self + _n_op = n_op.as(not null) + n_op.parent = self + _n_expr2 = n_expr2.as(not null) + n_expr2.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_kwnew == old_child then - n_kwnew = new_child.as(TKwnew) - return - end - if _n_type == old_child then - n_type = new_child.as(AType) + if _n_expr == old_child then + n_expr = new_child.as(AExpr) return end - if _n_id == old_child then - n_id = new_child.as(nullable TId) + if _n_op == old_child then + n_op = new_child.as(TPipe) return end - if _n_args == old_child then - n_args = new_child.as(AExprs) + if _n_expr2 == old_child then + n_expr2 = new_child.as(AExpr) return end end - redef fun n_kwnew=(node) + redef fun n_expr=(node) do - _n_kwnew = node + _n_expr = node node.parent = self end - redef fun n_type=(node) + redef fun n_op=(node) do - _n_type = node + _n_op = node node.parent = self end - redef fun n_id=(node) - do - _n_id = node - if node != null then node.parent = self - end - redef fun n_args=(node) + redef fun n_expr2=(node) do - _n_args = node + _n_expr2 = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwnew) - v.enter_visit(_n_type) - v.enter_visit(_n_id) - v.enter_visit(_n_args) + v.enter_visit(_n_expr) + v.enter_visit(_n_op) + v.enter_visit(_n_expr2) end end -redef class AAttrExpr - private init empty_init do end - - init init_aattrexpr ( +redef class ACaretExpr + init init_acaretexpr ( n_expr: nullable AExpr, - n_id: nullable TAttrid + n_op: nullable TCaret, + n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self - _n_id = n_id.as(not null) - n_id.parent = self + _n_op = n_op.as(not null) + n_op.parent = self + _n_expr2 = n_expr2.as(not null) + n_expr2.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -4956,8 +4765,12 @@ redef class AAttrExpr n_expr = new_child.as(AExpr) return end - if _n_id == old_child then - n_id = new_child.as(TAttrid) + if _n_op == old_child then + n_op = new_child.as(TCaret) + return + end + if _n_expr2 == old_child then + n_expr2 = new_child.as(AExpr) return end end @@ -4967,9 +4780,14 @@ redef class AAttrExpr _n_expr = node node.parent = self end - redef fun n_id=(node) + redef fun n_op=(node) do - _n_id = node + _n_op = node + node.parent = self + end + redef fun n_expr2=(node) + do + _n_expr2 = node node.parent = self end @@ -4977,28 +4795,23 @@ redef class AAttrExpr redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) - v.enter_visit(_n_id) + v.enter_visit(_n_op) + v.enter_visit(_n_expr2) end end -redef class AAttrAssignExpr - private init empty_init do end - - init init_aattrassignexpr ( +redef class AAmpExpr + init init_aampexpr ( n_expr: nullable AExpr, - n_id: nullable TAttrid, - n_assign: nullable TAssign, - n_value: nullable AExpr + n_op: nullable TAmp, + n_expr2: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self - _n_id = n_id.as(not null) - n_id.parent = self - _n_assign = n_assign.as(not null) - n_assign.parent = self - _n_value = n_value.as(not null) - n_value.parent = self + _n_op = n_op.as(not null) + n_op.parent = self + _n_expr2 = n_expr2.as(not null) + n_expr2.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -5007,16 +4820,12 @@ redef class AAttrAssignExpr n_expr = new_child.as(AExpr) return end - if _n_id == old_child then - n_id = new_child.as(TAttrid) - return - end - if _n_assign == old_child then - n_assign = new_child.as(TAssign) + if _n_op == old_child then + n_op = new_child.as(TAmp) return end - if _n_value == old_child then - n_value = new_child.as(AExpr) + if _n_expr2 == old_child then + n_expr2 = new_child.as(AExpr) return end end @@ -5026,118 +4835,229 @@ redef class AAttrAssignExpr _n_expr = node node.parent = self end - redef fun n_id=(node) + redef fun n_op=(node) do - _n_id = node + _n_op = node node.parent = self end - redef fun n_assign=(node) + redef fun n_expr2=(node) do - _n_assign = node + _n_expr2 = node node.parent = self end - redef fun n_value=(node) + + + redef fun visit_all(v: Visitor) do - _n_value = node + v.enter_visit(_n_expr) + v.enter_visit(_n_op) + v.enter_visit(_n_expr2) + end +end +redef class AUminusExpr + init init_auminusexpr ( + n_op: nullable TMinus, + n_expr: nullable AExpr + ) + do + _n_op = n_op.as(not null) + n_op.parent = self + _n_expr = n_expr.as(not null) + n_expr.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_op == old_child then + n_op = new_child.as(TMinus) + return + end + if _n_expr == old_child then + n_expr = new_child.as(AExpr) + return + end + end + + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end + redef fun n_expr=(node) + do + _n_expr = node node.parent = self end redef fun visit_all(v: Visitor) do + v.enter_visit(_n_op) 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 - private init empty_init do end - - init init_aattrreassignexpr ( - n_expr: nullable AExpr, - n_id: nullable TAttrid, - n_assign_op: nullable AAssignOp, - n_value: nullable AExpr +redef class AUplusExpr + init init_auplusexpr ( + n_op: nullable TPlus, + n_expr: nullable AExpr ) do - empty_init + _n_op = n_op.as(not null) + n_op.parent = self _n_expr = n_expr.as(not null) n_expr.parent = self - _n_id = n_id.as(not null) - n_id.parent = self - _n_assign_op = n_assign_op.as(not null) - n_assign_op.parent = self - _n_value = n_value.as(not null) - n_value.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_expr == old_child then - n_expr = new_child.as(AExpr) + if _n_op == old_child then + n_op = new_child.as(TPlus) return end - if _n_id == old_child then - n_id = new_child.as(TAttrid) + if _n_expr == old_child then + n_expr = new_child.as(AExpr) return end - if _n_assign_op == old_child then - n_assign_op = new_child.as(AAssignOp) + end + + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end + redef fun n_expr=(node) + do + _n_expr = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_op) + v.enter_visit(_n_expr) + end +end +redef class AUtildeExpr + init init_autildeexpr ( + n_op: nullable TTilde, + n_expr: nullable AExpr + ) + do + _n_op = n_op.as(not null) + n_op.parent = self + _n_expr = n_expr.as(not null) + n_expr.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_op == old_child then + n_op = new_child.as(TTilde) return end - if _n_value == old_child then - n_value = new_child.as(AExpr) + if _n_expr == old_child then + n_expr = new_child.as(AExpr) return end end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun n_expr=(node) do _n_expr = node node.parent = self end - redef fun n_id=(node) + + + redef fun visit_all(v: Visitor) do - _n_id = node + v.enter_visit(_n_op) + v.enter_visit(_n_expr) + end +end +redef class ANewExpr + init init_anewexpr ( + n_kwnew: nullable TKwnew, + n_type: nullable AType, + n_qid: nullable AQid, + n_args: nullable AExprs + ) + do + _n_kwnew = n_kwnew.as(not null) + n_kwnew.parent = self + _n_type = n_type.as(not null) + n_type.parent = self + _n_qid = n_qid + if n_qid != null then n_qid.parent = self + _n_args = n_args.as(not null) + n_args.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_kwnew == old_child then + n_kwnew = new_child.as(TKwnew) + return + end + if _n_type == old_child then + n_type = new_child.as(AType) + return + end + if _n_qid == old_child then + n_qid = new_child.as(nullable AQid) + return + end + if _n_args == old_child then + n_args = new_child.as(AExprs) + return + end + end + + redef fun n_kwnew=(node) + do + _n_kwnew = node node.parent = self end - redef fun n_assign_op=(node) + redef fun n_type=(node) do - _n_assign_op = node + _n_type = node node.parent = self end - redef fun n_value=(node) + redef fun n_qid=(node) do - _n_value = node + _n_qid = node + if node != null then node.parent = self + end + redef fun n_args=(node) + do + _n_args = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_expr) - v.enter_visit(_n_id) - v.enter_visit(_n_assign_op) - v.enter_visit(_n_value) + v.enter_visit(_n_kwnew) + v.enter_visit(_n_type) + v.enter_visit(_n_qid) + v.enter_visit(_n_args) end end -redef class ACallExpr - private init empty_init do end - - init init_acallexpr ( +redef class AAttrExpr + init init_aattrexpr ( n_expr: nullable AExpr, - n_id: nullable TId, - n_args: nullable AExprs + n_id: nullable TAttrid ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self _n_id = n_id.as(not null) n_id.parent = self - _n_args = n_args.as(not null) - n_args.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -5147,11 +5067,7 @@ redef class ACallExpr return end if _n_id == old_child then - n_id = new_child.as(TId) - return - end - if _n_args == old_child then - n_args = new_child.as(AExprs) + n_id = new_child.as(TAttrid) return end end @@ -5166,38 +5082,26 @@ redef class ACallExpr _n_id = node node.parent = self end - redef fun n_args=(node) - do - _n_args = node - node.parent = self - end redef fun visit_all(v: Visitor) do v.enter_visit(_n_expr) v.enter_visit(_n_id) - v.enter_visit(_n_args) end end -redef class ACallAssignExpr - private init empty_init do end - - init init_acallassignexpr ( +redef class AAttrAssignExpr + init init_aattrassignexpr ( n_expr: nullable AExpr, - n_id: nullable TId, - n_args: nullable AExprs, + n_id: nullable TAttrid, n_assign: nullable TAssign, n_value: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self _n_id = n_id.as(not null) n_id.parent = self - _n_args = n_args.as(not null) - n_args.parent = self _n_assign = n_assign.as(not null) n_assign.parent = self _n_value = n_value.as(not null) @@ -5211,11 +5115,7 @@ redef class ACallAssignExpr return end if _n_id == old_child then - n_id = new_child.as(TId) - return - end - if _n_args == old_child then - n_args = new_child.as(AExprs) + n_id = new_child.as(TAttrid) return end if _n_assign == old_child then @@ -5238,11 +5138,6 @@ redef class ACallAssignExpr _n_id = node node.parent = self end - redef fun n_args=(node) - do - _n_args = node - node.parent = self - end redef fun n_assign=(node) do _n_assign = node @@ -5259,29 +5154,22 @@ redef class ACallAssignExpr do v.enter_visit(_n_expr) v.enter_visit(_n_id) - v.enter_visit(_n_args) v.enter_visit(_n_assign) v.enter_visit(_n_value) end end -redef class ACallReassignExpr - private init empty_init do end - - init init_acallreassignexpr ( +redef class AAttrReassignExpr + init init_aattrreassignexpr ( n_expr: nullable AExpr, - n_id: nullable TId, - n_args: nullable AExprs, + n_id: nullable TAttrid, n_assign_op: nullable AAssignOp, n_value: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self _n_id = n_id.as(not null) n_id.parent = self - _n_args = n_args.as(not null) - n_args.parent = self _n_assign_op = n_assign_op.as(not null) n_assign_op.parent = self _n_value = n_value.as(not null) @@ -5295,11 +5183,7 @@ redef class ACallReassignExpr return end if _n_id == old_child then - n_id = new_child.as(TId) - return - end - if _n_args == old_child then - n_args = new_child.as(AExprs) + n_id = new_child.as(TAttrid) return end if _n_assign_op == old_child then @@ -5322,11 +5206,6 @@ redef class ACallReassignExpr _n_id = node node.parent = self end - redef fun n_args=(node) - do - _n_args = node - node.parent = self - end redef fun n_assign_op=(node) do _n_assign_op = node @@ -5343,37 +5222,33 @@ redef class ACallReassignExpr do v.enter_visit(_n_expr) v.enter_visit(_n_id) - v.enter_visit(_n_args) v.enter_visit(_n_assign_op) v.enter_visit(_n_value) end end -redef class ASuperExpr - private init empty_init do end - - init init_asuperexpr ( - n_qualified: nullable AQualified, - n_kwsuper: nullable TKwsuper, +redef class ACallExpr + init init_acallexpr ( + n_expr: nullable AExpr, + n_qid: nullable AQid, n_args: nullable AExprs ) do - empty_init - _n_qualified = n_qualified - if n_qualified != null then n_qualified.parent = self - _n_kwsuper = n_kwsuper.as(not null) - n_kwsuper.parent = self + _n_expr = n_expr.as(not null) + n_expr.parent = self + _n_qid = n_qid.as(not null) + n_qid.parent = self _n_args = n_args.as(not null) n_args.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_qualified == old_child then - n_qualified = new_child.as(nullable AQualified) + if _n_expr == old_child then + n_expr = new_child.as(AExpr) return end - if _n_kwsuper == old_child then - n_kwsuper = new_child.as(TKwsuper) + if _n_qid == old_child then + n_qid = new_child.as(AQid) return end if _n_args == old_child then @@ -5382,14 +5257,14 @@ redef class ASuperExpr end end - redef fun n_qualified=(node) + redef fun n_expr=(node) do - _n_qualified = node - if node != null then node.parent = self + _n_expr = node + node.parent = self end - redef fun n_kwsuper=(node) + redef fun n_qid=(node) do - _n_kwsuper = node + _n_qid = node node.parent = self end redef fun n_args=(node) @@ -5401,21 +5276,235 @@ redef class ASuperExpr redef fun visit_all(v: Visitor) do - v.enter_visit(_n_qualified) - v.enter_visit(_n_kwsuper) + v.enter_visit(_n_expr) + v.enter_visit(_n_qid) v.enter_visit(_n_args) end end -redef class AInitExpr - private init empty_init do end +redef class ACallAssignExpr + init init_acallassignexpr ( + n_expr: nullable AExpr, + n_qid: nullable AQid, + n_args: nullable AExprs, + n_assign: nullable TAssign, + n_value: nullable AExpr + ) + do + _n_expr = n_expr.as(not null) + n_expr.parent = self + _n_qid = n_qid.as(not null) + n_qid.parent = self + _n_args = n_args.as(not null) + n_args.parent = self + _n_assign = n_assign.as(not null) + n_assign.parent = self + _n_value = n_value.as(not null) + n_value.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_expr == old_child then + n_expr = new_child.as(AExpr) + return + end + if _n_qid == old_child then + n_qid = new_child.as(AQid) + return + end + if _n_args == old_child then + n_args = new_child.as(AExprs) + return + end + if _n_assign == old_child then + n_assign = new_child.as(TAssign) + return + end + if _n_value == old_child then + n_value = new_child.as(AExpr) + return + end + end + + redef fun n_expr=(node) + do + _n_expr = node + node.parent = self + end + redef fun n_qid=(node) + do + _n_qid = node + node.parent = self + end + redef fun n_args=(node) + do + _n_args = node + node.parent = self + end + redef fun n_assign=(node) + do + _n_assign = node + node.parent = self + end + redef fun n_value=(node) + do + _n_value = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_expr) + v.enter_visit(_n_qid) + v.enter_visit(_n_args) + v.enter_visit(_n_assign) + v.enter_visit(_n_value) + end +end +redef class ACallReassignExpr + init init_acallreassignexpr ( + n_expr: nullable AExpr, + n_qid: nullable AQid, + n_args: nullable AExprs, + n_assign_op: nullable AAssignOp, + n_value: nullable AExpr + ) + do + _n_expr = n_expr.as(not null) + n_expr.parent = self + _n_qid = n_qid.as(not null) + n_qid.parent = self + _n_args = n_args.as(not null) + n_args.parent = self + _n_assign_op = n_assign_op.as(not null) + n_assign_op.parent = self + _n_value = n_value.as(not null) + n_value.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_expr == old_child then + n_expr = new_child.as(AExpr) + return + end + if _n_qid == old_child then + n_qid = new_child.as(AQid) + return + end + if _n_args == old_child then + n_args = new_child.as(AExprs) + return + end + if _n_assign_op == old_child then + n_assign_op = new_child.as(AAssignOp) + return + end + if _n_value == old_child then + n_value = new_child.as(AExpr) + return + end + end + + redef fun n_expr=(node) + do + _n_expr = node + node.parent = self + end + redef fun n_qid=(node) + do + _n_qid = node + node.parent = self + end + redef fun n_args=(node) + do + _n_args = node + node.parent = self + end + redef fun n_assign_op=(node) + do + _n_assign_op = node + node.parent = self + end + redef fun n_value=(node) + do + _n_value = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_expr) + v.enter_visit(_n_qid) + v.enter_visit(_n_args) + v.enter_visit(_n_assign_op) + v.enter_visit(_n_value) + end +end +redef class ASuperExpr + init init_asuperexpr ( + n_qualified: nullable AQualified, + n_kwsuper: nullable TKwsuper, + n_args: nullable AExprs + ) + do + _n_qualified = n_qualified + if n_qualified != null then n_qualified.parent = self + _n_kwsuper = n_kwsuper.as(not null) + n_kwsuper.parent = self + _n_args = n_args.as(not null) + n_args.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_qualified == old_child then + n_qualified = new_child.as(nullable AQualified) + return + end + if _n_kwsuper == old_child then + n_kwsuper = new_child.as(TKwsuper) + return + end + if _n_args == old_child then + n_args = new_child.as(AExprs) + return + end + end + + redef fun n_qualified=(node) + do + _n_qualified = node + if node != null then node.parent = self + end + redef fun n_kwsuper=(node) + do + _n_kwsuper = node + node.parent = self + end + redef fun n_args=(node) + do + _n_args = node + node.parent = self + end + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_qualified) + v.enter_visit(_n_kwsuper) + v.enter_visit(_n_args) + end +end +redef class AInitExpr init init_ainitexpr ( n_expr: nullable AExpr, n_kwinit: nullable TKwinit, n_args: nullable AExprs ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self _n_kwinit = n_kwinit.as(not null) @@ -5465,14 +5554,11 @@ redef class AInitExpr end end redef class ABraExpr - private init empty_init do end - init init_abraexpr ( n_expr: nullable AExpr, n_args: nullable AExprs ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self _n_args = n_args.as(not null) @@ -5510,8 +5596,6 @@ redef class ABraExpr end end redef class ABraAssignExpr - private init empty_init do end - init init_abraassignexpr ( n_expr: nullable AExpr, n_args: nullable AExprs, @@ -5519,7 +5603,6 @@ redef class ABraAssignExpr n_value: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self _n_args = n_args.as(not null) @@ -5581,8 +5664,6 @@ redef class ABraAssignExpr end end redef class ABraReassignExpr - private init empty_init do end - init init_abrareassignexpr ( n_expr: nullable AExpr, n_args: nullable AExprs, @@ -5590,7 +5671,6 @@ redef class ABraReassignExpr n_value: nullable AExpr ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self _n_args = n_args.as(not null) @@ -5652,13 +5732,10 @@ redef class ABraReassignExpr end end redef class AVarExpr - private init empty_init do end - init init_avarexpr ( n_id: nullable TId ) do - empty_init _n_id = n_id.as(not null) n_id.parent = self end @@ -5684,15 +5761,12 @@ redef class AVarExpr end end redef class AVarAssignExpr - private init empty_init do end - init init_avarassignexpr ( n_id: nullable TId, n_assign: nullable TAssign, n_value: nullable AExpr ) do - empty_init _n_id = n_id.as(not null) n_id.parent = self _n_assign = n_assign.as(not null) @@ -5742,15 +5816,12 @@ redef class AVarAssignExpr end end redef class AVarReassignExpr - private init empty_init do end - init init_avarreassignexpr ( n_id: nullable TId, n_assign_op: nullable AAssignOp, n_value: nullable AExpr ) do - empty_init _n_id = n_id.as(not null) n_id.parent = self _n_assign_op = n_assign_op.as(not null) @@ -5800,15 +5871,12 @@ redef class AVarReassignExpr end end redef class ARangeExpr - private init empty_init do end - init init_arangeexpr ( n_expr: nullable AExpr, n_expr2: nullable AExpr, n_annotations: nullable AAnnotations ) do - empty_init _n_expr = n_expr.as(not null) n_expr.parent = self _n_expr2 = n_expr2.as(not null) @@ -5858,21 +5926,21 @@ redef class ARangeExpr end end redef class ACrangeExpr - private init empty_init do end - init init_acrangeexpr ( n_obra: nullable TObra, n_expr: nullable AExpr, + n_dotdot: nullable TDotdot, n_expr2: nullable AExpr, n_cbra: nullable TCbra, n_annotations: nullable AAnnotations ) do - empty_init _n_obra = n_obra.as(not null) n_obra.parent = self _n_expr = n_expr.as(not null) n_expr.parent = self + _n_dotdot = n_dotdot.as(not null) + n_dotdot.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self _n_cbra = n_cbra.as(not null) @@ -5891,6 +5959,10 @@ redef class ACrangeExpr n_expr = new_child.as(AExpr) return end + if _n_dotdot == old_child then + n_dotdot = new_child.as(TDotdot) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -5915,6 +5987,11 @@ redef class ACrangeExpr _n_expr = node node.parent = self end + redef fun n_dotdot=(node) + do + _n_dotdot = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -5936,27 +6013,28 @@ redef class ACrangeExpr do v.enter_visit(_n_obra) v.enter_visit(_n_expr) + v.enter_visit(_n_dotdot) v.enter_visit(_n_expr2) v.enter_visit(_n_cbra) v.enter_visit(_n_annotations) end end redef class AOrangeExpr - private init empty_init do end - init init_aorangeexpr ( n_obra: nullable TObra, n_expr: nullable AExpr, + n_dotdot: nullable TDotdot, n_expr2: nullable AExpr, n_cbra: nullable TObra, n_annotations: nullable AAnnotations ) do - empty_init _n_obra = n_obra.as(not null) n_obra.parent = self _n_expr = n_expr.as(not null) n_expr.parent = self + _n_dotdot = n_dotdot.as(not null) + n_dotdot.parent = self _n_expr2 = n_expr2.as(not null) n_expr2.parent = self _n_cbra = n_cbra.as(not null) @@ -5975,6 +6053,10 @@ redef class AOrangeExpr n_expr = new_child.as(AExpr) return end + if _n_dotdot == old_child then + n_dotdot = new_child.as(TDotdot) + return + end if _n_expr2 == old_child then n_expr2 = new_child.as(AExpr) return @@ -5999,6 +6081,11 @@ redef class AOrangeExpr _n_expr = node node.parent = self end + redef fun n_dotdot=(node) + do + _n_dotdot = node + node.parent = self + end redef fun n_expr2=(node) do _n_expr2 = node @@ -6020,30 +6107,45 @@ redef class AOrangeExpr do v.enter_visit(_n_obra) v.enter_visit(_n_expr) + v.enter_visit(_n_dotdot) v.enter_visit(_n_expr2) v.enter_visit(_n_cbra) v.enter_visit(_n_annotations) end end redef class AArrayExpr - private init empty_init do end - init init_aarrayexpr ( - n_exprs: nullable AExprs, + n_obra: nullable TObra, + n_exprs: Collection[Object], # Should be Collection[AExpr] + n_type: nullable AType, + n_cbra: nullable TCbra, n_annotations: nullable AAnnotations ) do - empty_init - _n_exprs = n_exprs.as(not null) - n_exprs.parent = self + _n_obra = n_obra.as(not null) + n_obra.parent = self + self.n_exprs.unsafe_add_all(n_exprs) + _n_type = n_type + if n_type != null then n_type.parent = self + _n_cbra = n_cbra.as(not null) + n_cbra.parent = self _n_annotations = n_annotations if n_annotations != null then n_annotations.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_exprs == old_child then - n_exprs = new_child.as(AExprs) + if _n_obra == old_child then + n_obra = new_child.as(TObra) + return + end + if n_exprs.replace_child(old_child, new_child) then return + if _n_type == old_child then + n_type = new_child.as(nullable AType) + return + end + if _n_cbra == old_child then + n_cbra = new_child.as(TCbra) return end if _n_annotations == old_child then @@ -6052,9 +6154,19 @@ redef class AArrayExpr end end - redef fun n_exprs=(node) + redef fun n_obra=(node) + do + _n_obra = node + node.parent = self + end + redef fun n_type=(node) + do + _n_type = node + if node != null then node.parent = self + end + redef fun n_cbra=(node) do - _n_exprs = node + _n_cbra = node node.parent = self end redef fun n_annotations=(node) @@ -6066,19 +6178,19 @@ redef class AArrayExpr redef fun visit_all(v: Visitor) do - v.enter_visit(_n_exprs) + v.enter_visit(_n_obra) + n_exprs.visit_all(v) + v.enter_visit(_n_type) + v.enter_visit(_n_cbra) v.enter_visit(_n_annotations) end end redef class ASelfExpr - private init empty_init do end - init init_aselfexpr ( n_kwself: nullable TKwself, n_annotations: nullable AAnnotations ) do - empty_init _n_kwself = n_kwself.as(not null) n_kwself.parent = self _n_annotations = n_annotations @@ -6116,11 +6228,8 @@ redef class ASelfExpr end end redef class AImplicitSelfExpr - private init empty_init do end - init init_aimplicitselfexpr do - empty_init end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -6134,14 +6243,11 @@ redef class AImplicitSelfExpr end end redef class ATrueExpr - private init empty_init do end - init init_atrueexpr ( n_kwtrue: nullable TKwtrue, n_annotations: nullable AAnnotations ) do - empty_init _n_kwtrue = n_kwtrue.as(not null) n_kwtrue.parent = self _n_annotations = n_annotations @@ -6179,14 +6285,11 @@ redef class ATrueExpr end end redef class AFalseExpr - private init empty_init do end - init init_afalseexpr ( n_kwfalse: nullable TKwfalse, n_annotations: nullable AAnnotations ) do - empty_init _n_kwfalse = n_kwfalse.as(not null) n_kwfalse.parent = self _n_annotations = n_annotations @@ -6224,14 +6327,11 @@ redef class AFalseExpr end end redef class ANullExpr - private init empty_init do end - init init_anullexpr ( n_kwnull: nullable TKwnull, n_annotations: nullable AAnnotations ) do - empty_init _n_kwnull = n_kwnull.as(not null) n_kwnull.parent = self _n_annotations = n_annotations @@ -6268,25 +6368,22 @@ redef class ANullExpr v.enter_visit(_n_annotations) end end -redef class AIntExpr - private init empty_init do end - - init init_aintexpr ( - n_number: nullable TNumber, +redef class AIntegerExpr + init init_aintegerexpr ( + n_integer: nullable TInteger, n_annotations: nullable AAnnotations ) do - empty_init - _n_number = n_number.as(not null) - n_number.parent = self + _n_integer = n_integer.as(not null) + n_integer.parent = self _n_annotations = n_annotations if n_annotations != null then n_annotations.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_number == old_child then - n_number = new_child.as(TNumber) + if _n_integer == old_child then + n_integer = new_child.as(TInteger) return end if _n_annotations == old_child then @@ -6295,9 +6392,9 @@ redef class AIntExpr end end - redef fun n_number=(node) + redef fun n_integer=(node) do - _n_number = node + _n_integer = node node.parent = self end redef fun n_annotations=(node) @@ -6309,19 +6406,16 @@ redef class AIntExpr redef fun visit_all(v: Visitor) do - v.enter_visit(_n_number) + v.enter_visit(_n_integer) v.enter_visit(_n_annotations) end end redef class AFloatExpr - private init empty_init do end - init init_afloatexpr ( n_float: nullable TFloat, n_annotations: nullable AAnnotations ) do - empty_init _n_float = n_float.as(not null) n_float.parent = self _n_annotations = n_annotations @@ -6359,14 +6453,11 @@ redef class AFloatExpr end end redef class ACharExpr - private init empty_init do end - init init_acharexpr ( n_char: nullable TChar, n_annotations: nullable AAnnotations ) do - empty_init _n_char = n_char.as(not null) n_char.parent = self _n_annotations = n_annotations @@ -6375,230 +6466,811 @@ redef class ACharExpr redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_char == old_child then - n_char = new_child.as(TChar) + if _n_char == old_child then + n_char = new_child.as(TChar) + return + end + if _n_annotations == old_child then + n_annotations = new_child.as(nullable AAnnotations) + return + end + end + + redef fun n_char=(node) + do + _n_char = node + node.parent = self + end + redef fun n_annotations=(node) + do + _n_annotations = node + if node != null then node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_char) + v.enter_visit(_n_annotations) + end +end +redef class AStringExpr + init init_astringexpr ( + n_string: nullable TString, + n_annotations: nullable AAnnotations + ) + do + _n_string = n_string.as(not null) + n_string.parent = self + _n_annotations = n_annotations + if n_annotations != null then n_annotations.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_string == old_child then + n_string = new_child.as(TString) + return + end + if _n_annotations == old_child then + n_annotations = new_child.as(nullable AAnnotations) + return + end + end + + redef fun n_string=(node) + do + _n_string = node + node.parent = self + end + redef fun n_annotations=(node) + do + _n_annotations = node + if node != null then node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_string) + v.enter_visit(_n_annotations) + end +end +redef class AStartStringExpr + init init_astartstringexpr ( + n_string: nullable TStartString + ) + do + _n_string = n_string.as(not null) + n_string.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_string == old_child then + n_string = new_child.as(TStartString) + return + end + end + + redef fun n_string=(node) + do + _n_string = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_string) + end +end +redef class AMidStringExpr + init init_amidstringexpr ( + n_string: nullable TMidString + ) + do + _n_string = n_string.as(not null) + n_string.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_string == old_child then + n_string = new_child.as(TMidString) + return + end + end + + redef fun n_string=(node) + do + _n_string = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_string) + end +end +redef class AEndStringExpr + init init_aendstringexpr ( + n_string: nullable TEndString + ) + do + _n_string = n_string.as(not null) + n_string.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_string == old_child then + n_string = new_child.as(TEndString) + return + end + end + + redef fun n_string=(node) + do + _n_string = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_string) + end +end +redef class ASuperstringExpr + init init_asuperstringexpr ( + n_exprs: Collection[Object], # Should be Collection[AExpr] + n_annotations: nullable AAnnotations + ) + do + self.n_exprs.unsafe_add_all(n_exprs) + _n_annotations = n_annotations + if n_annotations != null then n_annotations.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if n_exprs.replace_child(old_child, new_child) then return + if _n_annotations == old_child then + n_annotations = new_child.as(nullable AAnnotations) + return + end + end + + redef fun n_annotations=(node) + do + _n_annotations = node + if node != null then node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + n_exprs.visit_all(v) + v.enter_visit(_n_annotations) + end +end +redef class AParExpr + init init_aparexpr ( + n_opar: nullable TOpar, + n_expr: nullable AExpr, + n_cpar: nullable TCpar, + n_annotations: nullable AAnnotations + ) + do + _n_opar = n_opar.as(not null) + n_opar.parent = self + _n_expr = n_expr.as(not null) + n_expr.parent = self + _n_cpar = n_cpar.as(not null) + n_cpar.parent = self + _n_annotations = n_annotations + if n_annotations != null then n_annotations.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_opar == old_child then + n_opar = new_child.as(TOpar) + return + end + if _n_expr == old_child then + n_expr = new_child.as(AExpr) + return + end + if _n_cpar == old_child then + n_cpar = new_child.as(TCpar) + return + end + if _n_annotations == old_child then + n_annotations = new_child.as(nullable AAnnotations) + return + end + end + + redef fun n_opar=(node) + do + _n_opar = node + node.parent = self + end + redef fun n_expr=(node) + do + _n_expr = node + node.parent = self + end + redef fun n_cpar=(node) + do + _n_cpar = node + node.parent = self + end + redef fun n_annotations=(node) + do + _n_annotations = node + if node != null then node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_opar) + v.enter_visit(_n_expr) + v.enter_visit(_n_cpar) + v.enter_visit(_n_annotations) + end +end +redef class AAsCastExpr + init init_aascastexpr ( + n_expr: nullable AExpr, + n_kwas: nullable TKwas, + n_opar: nullable TOpar, + n_type: nullable AType, + n_cpar: nullable TCpar + ) + do + _n_expr = n_expr.as(not null) + n_expr.parent = self + _n_kwas = n_kwas.as(not null) + n_kwas.parent = self + _n_opar = n_opar + if n_opar != null then n_opar.parent = self + _n_type = n_type.as(not null) + n_type.parent = self + _n_cpar = n_cpar + if n_cpar != null then n_cpar.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_expr == old_child then + n_expr = new_child.as(AExpr) + return + end + if _n_kwas == old_child then + n_kwas = new_child.as(TKwas) + return + end + if _n_opar == old_child then + n_opar = new_child.as(nullable TOpar) + return + end + if _n_type == old_child then + n_type = new_child.as(AType) + return + end + if _n_cpar == old_child then + n_cpar = new_child.as(nullable TCpar) + return + end + end + + redef fun n_expr=(node) + do + _n_expr = node + node.parent = self + end + redef fun n_kwas=(node) + do + _n_kwas = node + node.parent = self + end + redef fun n_opar=(node) + do + _n_opar = node + if node != null then node.parent = self + end + redef fun n_type=(node) + do + _n_type = node + node.parent = self + end + redef fun n_cpar=(node) + do + _n_cpar = node + if node != null then node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_expr) + v.enter_visit(_n_kwas) + v.enter_visit(_n_opar) + v.enter_visit(_n_type) + v.enter_visit(_n_cpar) + end +end +redef class AAsNotnullExpr + init init_aasnotnullexpr ( + n_expr: nullable AExpr, + n_kwas: nullable TKwas, + n_opar: nullable TOpar, + n_kwnot: nullable TKwnot, + n_kwnull: nullable TKwnull, + n_cpar: nullable TCpar + ) + do + _n_expr = n_expr.as(not null) + n_expr.parent = self + _n_kwas = n_kwas.as(not null) + n_kwas.parent = self + _n_opar = n_opar + if n_opar != null then n_opar.parent = self + _n_kwnot = n_kwnot.as(not null) + n_kwnot.parent = self + _n_kwnull = n_kwnull.as(not null) + n_kwnull.parent = self + _n_cpar = n_cpar + if n_cpar != null then n_cpar.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_expr == old_child then + n_expr = new_child.as(AExpr) + return + end + if _n_kwas == old_child then + n_kwas = new_child.as(TKwas) + return + end + if _n_opar == old_child then + n_opar = new_child.as(nullable TOpar) + return + end + if _n_kwnot == old_child then + n_kwnot = new_child.as(TKwnot) + return + end + if _n_kwnull == old_child then + n_kwnull = new_child.as(TKwnull) + return + end + if _n_cpar == old_child then + n_cpar = new_child.as(nullable TCpar) + return + end + end + + redef fun n_expr=(node) + do + _n_expr = node + node.parent = self + end + redef fun n_kwas=(node) + do + _n_kwas = node + node.parent = self + end + redef fun n_opar=(node) + do + _n_opar = node + if node != null then node.parent = self + end + redef fun n_kwnot=(node) + do + _n_kwnot = node + node.parent = self + end + redef fun n_kwnull=(node) + do + _n_kwnull = node + node.parent = self + end + redef fun n_cpar=(node) + do + _n_cpar = node + if node != null then node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_expr) + v.enter_visit(_n_kwas) + v.enter_visit(_n_opar) + v.enter_visit(_n_kwnot) + v.enter_visit(_n_kwnull) + v.enter_visit(_n_cpar) + end +end +redef class AIssetAttrExpr + init init_aissetattrexpr ( + n_kwisset: nullable TKwisset, + n_expr: nullable AExpr, + n_id: nullable TAttrid + ) + do + _n_kwisset = n_kwisset.as(not null) + n_kwisset.parent = self + _n_expr = n_expr.as(not null) + n_expr.parent = self + _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_kwisset == old_child then + n_kwisset = new_child.as(TKwisset) + return + end + if _n_expr == old_child then + n_expr = new_child.as(AExpr) + return + end + if _n_id == old_child then + n_id = new_child.as(TAttrid) + return + end + end + + redef fun n_kwisset=(node) + do + _n_kwisset = node + node.parent = self + end + redef fun n_expr=(node) + do + _n_expr = node + node.parent = self + end + redef fun n_id=(node) + do + _n_id = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_kwisset) + v.enter_visit(_n_expr) + v.enter_visit(_n_id) + end +end +redef class ADebugTypeExpr + init init_adebugtypeexpr ( + n_kwdebug: nullable TKwdebug, + n_kwtype: nullable TKwtype, + n_expr: nullable AExpr, + n_type: nullable AType + ) + do + _n_kwdebug = n_kwdebug.as(not null) + n_kwdebug.parent = self + _n_kwtype = n_kwtype.as(not null) + n_kwtype.parent = self + _n_expr = n_expr.as(not null) + n_expr.parent = self + _n_type = n_type.as(not null) + n_type.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_kwdebug == old_child then + n_kwdebug = new_child.as(TKwdebug) + return + end + if _n_kwtype == old_child then + n_kwtype = new_child.as(TKwtype) + return + end + if _n_expr == old_child then + n_expr = new_child.as(AExpr) + return + end + if _n_type == old_child then + n_type = new_child.as(AType) + return + end + end + + redef fun n_kwdebug=(node) + do + _n_kwdebug = node + node.parent = self + end + redef fun n_kwtype=(node) + do + _n_kwtype = node + node.parent = self + end + redef fun n_expr=(node) + do + _n_expr = node + node.parent = self + end + redef fun n_type=(node) + do + _n_type = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_kwdebug) + v.enter_visit(_n_kwtype) + v.enter_visit(_n_expr) + v.enter_visit(_n_type) + end +end +redef class AVarargExpr + init init_avarargexpr ( + n_expr: nullable AExpr, + n_dotdotdot: nullable TDotdotdot + ) + do + _n_expr = n_expr.as(not null) + n_expr.parent = self + _n_dotdotdot = n_dotdotdot.as(not null) + n_dotdotdot.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_expr == old_child then + n_expr = new_child.as(AExpr) + return + end + if _n_dotdotdot == old_child then + n_dotdotdot = new_child.as(TDotdotdot) + return + end + end + + redef fun n_expr=(node) + do + _n_expr = node + node.parent = self + end + redef fun n_dotdotdot=(node) + do + _n_dotdotdot = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_expr) + v.enter_visit(_n_dotdotdot) + end +end +redef class ANamedargExpr + init init_anamedargexpr ( + n_id: nullable TId, + n_assign: nullable TAssign, + n_expr: nullable AExpr + ) + do + _n_id = n_id.as(not null) + n_id.parent = self + _n_assign = n_assign.as(not null) + n_assign.parent = self + _n_expr = n_expr.as(not null) + n_expr.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_id == old_child then + n_id = new_child.as(TId) return end - if _n_annotations == old_child then - n_annotations = new_child.as(nullable AAnnotations) + if _n_assign == old_child then + n_assign = new_child.as(TAssign) + return + end + if _n_expr == old_child then + n_expr = new_child.as(AExpr) return end end - redef fun n_char=(node) + redef fun n_id=(node) do - _n_char = node + _n_id = node node.parent = self end - redef fun n_annotations=(node) + redef fun n_assign=(node) do - _n_annotations = node - if node != null then node.parent = self + _n_assign = node + node.parent = self + end + redef fun n_expr=(node) + do + _n_expr = node + node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_char) - v.enter_visit(_n_annotations) + v.enter_visit(_n_id) + v.enter_visit(_n_assign) + v.enter_visit(_n_expr) end end -redef class AStringExpr - private init empty_init do end - - init init_astringexpr ( - n_string: nullable TString, - n_annotations: nullable AAnnotations +redef class ATypeExpr + init init_atypeexpr ( + n_type: nullable AType ) do - empty_init - _n_string = n_string.as(not null) - n_string.parent = self - _n_annotations = n_annotations - if n_annotations != null then n_annotations.parent = self + _n_type = n_type.as(not null) + n_type.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_string == old_child then - n_string = new_child.as(TString) - return - end - if _n_annotations == old_child then - n_annotations = new_child.as(nullable AAnnotations) + if _n_type == old_child then + n_type = new_child.as(AType) return end end - redef fun n_string=(node) + redef fun n_type=(node) do - _n_string = node + _n_type = node node.parent = self end - redef fun n_annotations=(node) - do - _n_annotations = node - if node != null then node.parent = self - end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_string) - v.enter_visit(_n_annotations) + v.enter_visit(_n_type) end end -redef class AStartStringExpr - private init empty_init do end - - init init_astartstringexpr ( - n_string: nullable TStartString +redef class AMethidExpr + init init_amethidexpr ( + n_expr: nullable AExpr, + n_id: nullable AMethid ) do - empty_init - _n_string = n_string.as(not null) - n_string.parent = self + _n_expr = n_expr.as(not null) + n_expr.parent = self + _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_string == old_child then - n_string = new_child.as(TStartString) + if _n_expr == old_child then + n_expr = new_child.as(AExpr) + return + end + if _n_id == old_child then + n_id = new_child.as(AMethid) return end end - redef fun n_string=(node) + redef fun n_expr=(node) do - _n_string = node + _n_expr = node + node.parent = self + end + redef fun n_id=(node) + do + _n_id = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_string) + v.enter_visit(_n_expr) + v.enter_visit(_n_id) end end -redef class AMidStringExpr - private init empty_init do end - - init init_amidstringexpr ( - n_string: nullable TMidString +redef class AAtExpr + init init_aatexpr ( + n_annotations: nullable AAnnotations ) do - empty_init - _n_string = n_string.as(not null) - n_string.parent = self + _n_annotations = n_annotations.as(not null) + n_annotations.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_string == old_child then - n_string = new_child.as(TMidString) + if _n_annotations == old_child then + n_annotations = new_child.as(AAnnotations) return end end - redef fun n_string=(node) + redef fun n_annotations=(node) do - _n_string = node + _n_annotations = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_string) + v.enter_visit(_n_annotations) end end -redef class AEndStringExpr - private init empty_init do end - - init init_aendstringexpr ( - n_string: nullable TEndString +redef class AManyExpr + init init_amanyexpr ( + n_exprs: Collection[Object] # Should be Collection[AExpr] ) do - empty_init - _n_string = n_string.as(not null) - n_string.parent = self + self.n_exprs.unsafe_add_all(n_exprs) end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_string == old_child then - n_string = new_child.as(TEndString) - return - end + if n_exprs.replace_child(old_child, new_child) then return end - redef fun n_string=(node) - do - _n_string = node - node.parent = self - end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_string) + n_exprs.visit_all(v) end end -redef class ASuperstringExpr - private init empty_init do end - - init init_asuperstringexpr ( - n_exprs: Collection[Object], # Should be Collection[AExpr] - n_annotations: nullable AAnnotations +redef class AListExprs + init init_alistexprs ( + n_exprs: Collection[Object] # Should be Collection[AExpr] ) do - empty_init - _n_exprs.unsafe_add_all(n_exprs) - _n_annotations = n_annotations - if n_annotations != null then n_annotations.parent = self + self.n_exprs.unsafe_add_all(n_exprs) end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_exprs.replace_child(old_child, new_child) then return - if _n_annotations == old_child then - n_annotations = new_child.as(nullable AAnnotations) - return - end + if n_exprs.replace_child(old_child, new_child) then return end - redef fun n_annotations=(node) - do - _n_annotations = node - if node != null then node.parent = self - end redef fun visit_all(v: Visitor) do - _n_exprs.visit_all(v) - v.enter_visit(_n_annotations) + n_exprs.visit_all(v) end end -redef class AParExpr - private init empty_init do end - - init init_aparexpr ( +redef class AParExprs + init init_aparexprs ( n_opar: nullable TOpar, - n_expr: nullable AExpr, - n_cpar: nullable TCpar, - n_annotations: nullable AAnnotations + n_exprs: Collection[Object], # Should be Collection[AExpr] + n_cpar: nullable TCpar ) do - empty_init _n_opar = n_opar.as(not null) n_opar.parent = self - _n_expr = n_expr.as(not null) - n_expr.parent = self + self.n_exprs.unsafe_add_all(n_exprs) _n_cpar = n_cpar.as(not null) n_cpar.parent = self - _n_annotations = n_annotations - if n_annotations != null then n_annotations.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -6607,18 +7279,11 @@ redef class AParExpr n_opar = new_child.as(TOpar) return end - if _n_expr == old_child then - n_expr = new_child.as(AExpr) - return - end + if n_exprs.replace_child(old_child, new_child) then return if _n_cpar == old_child then n_cpar = new_child.as(TCpar) return end - if _n_annotations == old_child then - n_annotations = new_child.as(nullable AAnnotations) - return - end end redef fun n_opar=(node) @@ -6626,539 +7291,441 @@ redef class AParExpr _n_opar = node node.parent = self end - redef fun n_expr=(node) - do - _n_expr = node - node.parent = self - end redef fun n_cpar=(node) do _n_cpar = node node.parent = self end - redef fun n_annotations=(node) - do - _n_annotations = node - if node != null then node.parent = self - end redef fun visit_all(v: Visitor) do v.enter_visit(_n_opar) - v.enter_visit(_n_expr) + n_exprs.visit_all(v) v.enter_visit(_n_cpar) - v.enter_visit(_n_annotations) end end -redef class AAsCastExpr - private init empty_init do end - - init init_aascastexpr ( - n_expr: nullable AExpr, - n_kwas: nullable TKwas, - n_opar: nullable TOpar, - n_type: nullable AType, - n_cpar: nullable TCpar +redef class ABraExprs + init init_abraexprs ( + n_obra: nullable TObra, + n_exprs: Collection[Object], # Should be Collection[AExpr] + n_cbra: nullable TCbra ) do - empty_init - _n_expr = n_expr.as(not null) - n_expr.parent = self - _n_kwas = n_kwas.as(not null) - n_kwas.parent = self - _n_opar = n_opar.as(not null) - n_opar.parent = self - _n_type = n_type.as(not null) - n_type.parent = self - _n_cpar = n_cpar.as(not null) - n_cpar.parent = self + _n_obra = n_obra.as(not null) + n_obra.parent = self + self.n_exprs.unsafe_add_all(n_exprs) + _n_cbra = n_cbra.as(not null) + n_cbra.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_expr == old_child then - n_expr = new_child.as(AExpr) - return - end - if _n_kwas == old_child then - n_kwas = new_child.as(TKwas) - return - end - if _n_opar == old_child then - n_opar = new_child.as(TOpar) - return - end - if _n_type == old_child then - n_type = new_child.as(AType) + if _n_obra == old_child then + n_obra = new_child.as(TObra) return end - if _n_cpar == old_child then - n_cpar = new_child.as(TCpar) + if n_exprs.replace_child(old_child, new_child) then return + if _n_cbra == old_child then + n_cbra = new_child.as(TCbra) return end end - redef fun n_expr=(node) - do - _n_expr = node - node.parent = self - end - redef fun n_kwas=(node) - do - _n_kwas = node - node.parent = self - end - redef fun n_opar=(node) - do - _n_opar = node - node.parent = self - end - redef fun n_type=(node) + redef fun n_obra=(node) do - _n_type = node + _n_obra = node node.parent = self end - redef fun n_cpar=(node) + redef fun n_cbra=(node) do - _n_cpar = node + _n_cbra = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_expr) - v.enter_visit(_n_kwas) - v.enter_visit(_n_opar) - v.enter_visit(_n_type) - v.enter_visit(_n_cpar) + v.enter_visit(_n_obra) + n_exprs.visit_all(v) + v.enter_visit(_n_cbra) end end -redef class AAsNotnullExpr - private init empty_init do end - - init init_aasnotnullexpr ( - n_expr: nullable AExpr, - n_kwas: nullable TKwas, - n_opar: nullable TOpar, - n_kwnot: nullable TKwnot, - n_kwnull: nullable TKwnull, - n_cpar: nullable TCpar +redef class APlusAssignOp + init init_aplusassignop ( + n_op: nullable TPluseq ) do - empty_init - _n_expr = n_expr.as(not null) - n_expr.parent = self - _n_kwas = n_kwas.as(not null) - n_kwas.parent = self - _n_opar = n_opar.as(not null) - n_opar.parent = self - _n_kwnot = n_kwnot.as(not null) - n_kwnot.parent = self - _n_kwnull = n_kwnull.as(not null) - n_kwnull.parent = self - _n_cpar = n_cpar.as(not null) - n_cpar.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_expr == old_child then - n_expr = new_child.as(AExpr) - return - end - if _n_kwas == old_child then - n_kwas = new_child.as(TKwas) - return - end - if _n_opar == old_child then - n_opar = new_child.as(TOpar) - return - end - if _n_kwnot == old_child then - n_kwnot = new_child.as(TKwnot) - return - end - if _n_kwnull == old_child then - n_kwnull = new_child.as(TKwnull) - return - end - if _n_cpar == old_child then - n_cpar = new_child.as(TCpar) + if _n_op == old_child then + n_op = new_child.as(TPluseq) return end end - redef fun n_expr=(node) - do - _n_expr = node - node.parent = self - end - redef fun n_kwas=(node) + redef fun n_op=(node) do - _n_kwas = node + _n_op = node node.parent = self end - redef fun n_opar=(node) + + + redef fun visit_all(v: Visitor) do - _n_opar = node - node.parent = self + v.enter_visit(_n_op) end - redef fun n_kwnot=(node) +end +redef class AMinusAssignOp + init init_aminusassignop ( + n_op: nullable TMinuseq + ) do - _n_kwnot = node - node.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end - redef fun n_kwnull=(node) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_kwnull = node - node.parent = self + if _n_op == old_child then + n_op = new_child.as(TMinuseq) + return + end end - redef fun n_cpar=(node) + + redef fun n_op=(node) do - _n_cpar = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_expr) - v.enter_visit(_n_kwas) - v.enter_visit(_n_opar) - v.enter_visit(_n_kwnot) - v.enter_visit(_n_kwnull) - v.enter_visit(_n_cpar) + v.enter_visit(_n_op) end end -redef class AIssetAttrExpr - private init empty_init do end - - init init_aissetattrexpr ( - n_kwisset: nullable TKwisset, - n_expr: nullable AExpr, - n_id: nullable TAttrid +redef class AStarAssignOp + init init_astarassignop ( + n_op: nullable TStareq ) do - empty_init - _n_kwisset = n_kwisset.as(not null) - n_kwisset.parent = self - _n_expr = n_expr.as(not null) - n_expr.parent = self - _n_id = n_id.as(not null) - n_id.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_kwisset == old_child then - n_kwisset = new_child.as(TKwisset) - return - end - if _n_expr == old_child then - n_expr = new_child.as(AExpr) - return - end - if _n_id == old_child then - n_id = new_child.as(TAttrid) + if _n_op == old_child then + n_op = new_child.as(TStareq) return end end - redef fun n_kwisset=(node) + redef fun n_op=(node) do - _n_kwisset = node + _n_op = node node.parent = self end - redef fun n_expr=(node) + + + redef fun visit_all(v: Visitor) do - _n_expr = node - node.parent = self + v.enter_visit(_n_op) end - redef fun n_id=(node) +end +redef class ASlashAssignOp + init init_aslashassignop ( + n_op: nullable TSlasheq + ) do - _n_id = node + _n_op = n_op.as(not null) + n_op.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) + do + if _n_op == old_child then + n_op = new_child.as(TSlasheq) + return + end + end + + redef fun n_op=(node) + do + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwisset) - v.enter_visit(_n_expr) - v.enter_visit(_n_id) + v.enter_visit(_n_op) end end -redef class ADebugTypeExpr - private init empty_init do end - - init init_adebugtypeexpr ( - n_kwdebug: nullable TKwdebug, - n_kwtype: nullable TKwtype, - n_expr: nullable AExpr, - n_type: nullable AType +redef class APercentAssignOp + init init_apercentassignop ( + n_op: nullable TPercenteq ) do - empty_init - _n_kwdebug = n_kwdebug.as(not null) - n_kwdebug.parent = self - _n_kwtype = n_kwtype.as(not null) - n_kwtype.parent = self - _n_expr = n_expr.as(not null) - n_expr.parent = self - _n_type = n_type.as(not null) - n_type.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_kwdebug == old_child then - n_kwdebug = new_child.as(TKwdebug) - return - end - if _n_kwtype == old_child then - n_kwtype = new_child.as(TKwtype) - return - end - if _n_expr == old_child then - n_expr = new_child.as(AExpr) - return - end - if _n_type == old_child then - n_type = new_child.as(AType) + if _n_op == old_child then + n_op = new_child.as(TPercenteq) return end end - redef fun n_kwdebug=(node) + redef fun n_op=(node) do - _n_kwdebug = node + _n_op = node node.parent = self end - redef fun n_kwtype=(node) + + + redef fun visit_all(v: Visitor) do - _n_kwtype = node - node.parent = self + v.enter_visit(_n_op) end - redef fun n_expr=(node) +end +redef class AStarstarAssignOp + init init_astarstarassignop ( + n_op: nullable TStarstareq + ) do - _n_expr = node - node.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end - redef fun n_type=(node) + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_type = node + if _n_op == old_child then + n_op = new_child.as(TStarstareq) + return + end + end + + redef fun n_op=(node) + do + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_kwdebug) - v.enter_visit(_n_kwtype) - v.enter_visit(_n_expr) - v.enter_visit(_n_type) + v.enter_visit(_n_op) end end -redef class AListExprs - private init empty_init do end - - init init_alistexprs ( - n_exprs: Collection[Object] # Should be Collection[AExpr] +redef class APipeAssignOp + init init_apipeassignop ( + n_op: nullable TPipeeq ) do - empty_init - _n_exprs.unsafe_add_all(n_exprs) + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_exprs.replace_child(old_child, new_child) then return + if _n_op == old_child then + n_op = new_child.as(TPipeeq) + return + end end + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end redef fun visit_all(v: Visitor) do - _n_exprs.visit_all(v) + v.enter_visit(_n_op) end end -redef class AParExprs - private init empty_init do end - - init init_aparexprs ( - n_opar: nullable TOpar, - n_exprs: Collection[Object], # Should be Collection[AExpr] - n_cpar: nullable TCpar +redef class ACaretAssignOp + init init_acaretassignop ( + n_op: nullable TCareteq ) do - empty_init - _n_opar = n_opar.as(not null) - n_opar.parent = self - _n_exprs.unsafe_add_all(n_exprs) - _n_cpar = n_cpar.as(not null) - n_cpar.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_opar == old_child then - n_opar = new_child.as(TOpar) - return - end - if _n_exprs.replace_child(old_child, new_child) then return - if _n_cpar == old_child then - n_cpar = new_child.as(TCpar) + if _n_op == old_child then + n_op = new_child.as(TCareteq) return end end - redef fun n_opar=(node) - do - _n_opar = node - node.parent = self - end - redef fun n_cpar=(node) + redef fun n_op=(node) do - _n_cpar = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_opar) - _n_exprs.visit_all(v) - v.enter_visit(_n_cpar) + v.enter_visit(_n_op) end end -redef class ABraExprs - private init empty_init do end - - init init_abraexprs ( - n_obra: nullable TObra, - n_exprs: Collection[Object], # Should be Collection[AExpr] - n_cbra: nullable TCbra +redef class AAmpAssignOp + init init_aampassignop ( + n_op: nullable TAmpeq ) do - empty_init - _n_obra = n_obra.as(not null) - n_obra.parent = self - _n_exprs.unsafe_add_all(n_exprs) - _n_cbra = n_cbra.as(not null) - n_cbra.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_obra == old_child then - n_obra = new_child.as(TObra) - return - end - if _n_exprs.replace_child(old_child, new_child) then return - if _n_cbra == old_child then - n_cbra = new_child.as(TCbra) + if _n_op == old_child then + n_op = new_child.as(TAmpeq) return end end - redef fun n_obra=(node) + redef fun n_op=(node) + do + _n_op = node + node.parent = self + end + + + redef fun visit_all(v: Visitor) + do + v.enter_visit(_n_op) + end +end +redef class ALlAssignOp + init init_allassignop ( + n_op: nullable TLleq + ) + do + _n_op = n_op.as(not null) + n_op.parent = self + end + + redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - _n_obra = node - node.parent = self + if _n_op == old_child then + n_op = new_child.as(TLleq) + return + end end - redef fun n_cbra=(node) + + redef fun n_op=(node) do - _n_cbra = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_obra) - _n_exprs.visit_all(v) - v.enter_visit(_n_cbra) + v.enter_visit(_n_op) end end -redef class APlusAssignOp - private init empty_init do end - - init init_aplusassignop ( - n_pluseq: nullable TPluseq +redef class AGgAssignOp + init init_aggassignop ( + n_op: nullable TGgeq ) do - empty_init - _n_pluseq = n_pluseq.as(not null) - n_pluseq.parent = self + _n_op = n_op.as(not null) + n_op.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_pluseq == old_child then - n_pluseq = new_child.as(TPluseq) + if _n_op == old_child then + n_op = new_child.as(TGgeq) return end end - redef fun n_pluseq=(node) + redef fun n_op=(node) do - _n_pluseq = node + _n_op = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_pluseq) + v.enter_visit(_n_op) end end -redef class AMinusAssignOp - private init empty_init do end - - init init_aminusassignop ( - n_minuseq: nullable TMinuseq +redef class AForGroup + init init_aforgroup ( + n_ids: Collection[Object], # Should be Collection[TId] + n_kwin: nullable TKwin, + n_expr: nullable AExpr ) do - empty_init - _n_minuseq = n_minuseq.as(not null) - n_minuseq.parent = self + self.n_ids.unsafe_add_all(n_ids) + _n_kwin = n_kwin.as(not null) + n_kwin.parent = self + _n_expr = n_expr.as(not null) + n_expr.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_minuseq == old_child then - n_minuseq = new_child.as(TMinuseq) + if n_ids.replace_child(old_child, new_child) then return + if _n_kwin == old_child then + n_kwin = new_child.as(TKwin) + return + end + if _n_expr == old_child then + n_expr = new_child.as(AExpr) return end end - redef fun n_minuseq=(node) + redef fun n_kwin=(node) + do + _n_kwin = node + node.parent = self + end + redef fun n_expr=(node) do - _n_minuseq = node + _n_expr = node node.parent = self end redef fun visit_all(v: Visitor) do - v.enter_visit(_n_minuseq) + n_ids.visit_all(v) + v.enter_visit(_n_kwin) + v.enter_visit(_n_expr) end end redef class AModuleName - private init empty_init do end - init init_amodulename ( n_quad: nullable TQuad, n_path: Collection[Object], # Should be Collection[TId] n_id: nullable TId ) do - empty_init _n_quad = n_quad if n_quad != null then n_quad.parent = self - _n_path.unsafe_add_all(n_path) + self.n_path.unsafe_add_all(n_path) _n_id = n_id.as(not null) n_id.parent = self end @@ -7169,7 +7736,7 @@ redef class AModuleName n_quad = new_child.as(nullable TQuad) return end - if _n_path.replace_child(old_child, new_child) then return + if n_path.replace_child(old_child, new_child) then return if _n_id == old_child then n_id = new_child.as(TId) return @@ -7191,22 +7758,19 @@ redef class AModuleName redef fun visit_all(v: Visitor) do v.enter_visit(_n_quad) - _n_path.visit_all(v) + n_path.visit_all(v) v.enter_visit(_n_id) end end redef class AExternCalls - private init empty_init do end - init init_aexterncalls ( n_kwimport: nullable TKwimport, n_extern_calls: Collection[Object] # Should be Collection[AExternCall] ) do - empty_init _n_kwimport = n_kwimport.as(not null) n_kwimport.parent = self - _n_extern_calls.unsafe_add_all(n_extern_calls) + self.n_extern_calls.unsafe_add_all(n_extern_calls) end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -7215,7 +7779,7 @@ redef class AExternCalls n_kwimport = new_child.as(TKwimport) return end - if _n_extern_calls.replace_child(old_child, new_child) then return + if n_extern_calls.replace_child(old_child, new_child) then return end redef fun n_kwimport=(node) @@ -7228,15 +7792,12 @@ redef class AExternCalls redef fun visit_all(v: Visitor) do v.enter_visit(_n_kwimport) - _n_extern_calls.visit_all(v) + n_extern_calls.visit_all(v) end end redef class AExternCall - private init empty_init do end - init init_aexterncall do - empty_init end redef fun replace_child(old_child: ANode, new_child: nullable ANode) @@ -7250,13 +7811,10 @@ redef class AExternCall end end redef class ASuperExternCall - private init empty_init do end - init init_asuperexterncall ( n_kwsuper: nullable TKwsuper ) do - empty_init _n_kwsuper = n_kwsuper.as(not null) n_kwsuper.parent = self end @@ -7282,13 +7840,10 @@ redef class ASuperExternCall end end redef class ALocalPropExternCall - private init empty_init do end - init init_alocalpropexterncall ( n_methid: nullable AMethid ) do - empty_init _n_methid = n_methid.as(not null) n_methid.parent = self end @@ -7314,15 +7869,12 @@ redef class ALocalPropExternCall end end redef class AFullPropExternCall - private init empty_init do end - init init_afullpropexterncall ( n_type: nullable AType, n_dot: nullable TDot, n_methid: nullable AMethid ) do - empty_init _n_type = n_type.as(not null) n_type.parent = self _n_dot = n_dot @@ -7372,13 +7924,10 @@ redef class AFullPropExternCall end end redef class AInitPropExternCall - private init empty_init do end - init init_ainitpropexterncall ( n_type: nullable AType ) do - empty_init _n_type = n_type.as(not null) n_type.parent = self end @@ -7404,8 +7953,6 @@ redef class AInitPropExternCall end end redef class ACastAsExternCall - private init empty_init do end - init init_acastasexterncall ( n_from_type: nullable AType, n_dot: nullable TDot, @@ -7413,7 +7960,6 @@ redef class ACastAsExternCall n_to_type: nullable AType ) do - empty_init _n_from_type = n_from_type.as(not null) n_from_type.parent = self _n_dot = n_dot @@ -7475,15 +8021,12 @@ redef class ACastAsExternCall end end redef class AAsNullableExternCall - private init empty_init do end - init init_aasnullableexterncall ( n_type: nullable AType, n_kwas: nullable TKwas, n_kwnullable: nullable TKwnullable ) do - empty_init _n_type = n_type.as(not null) n_type.parent = self _n_kwas = n_kwas.as(not null) @@ -7533,8 +8076,6 @@ redef class AAsNullableExternCall end end redef class AAsNotNullableExternCall - private init empty_init do end - init init_aasnotnullableexterncall ( n_type: nullable AType, n_kwas: nullable TKwas, @@ -7542,7 +8083,6 @@ redef class AAsNotNullableExternCall n_kwnullable: nullable TKwnullable ) do - empty_init _n_type = n_type.as(not null) n_type.parent = self _n_kwas = n_kwas.as(not null) @@ -7604,14 +8144,11 @@ redef class AAsNotNullableExternCall end end redef class AInLanguage - private init empty_init do end - init init_ainlanguage ( n_kwin: nullable TKwin, n_string: nullable TString ) do - empty_init _n_kwin = n_kwin.as(not null) n_kwin.parent = self _n_string = n_string.as(not null) @@ -7649,14 +8186,11 @@ redef class AInLanguage end end redef class AExternCodeBlock - private init empty_init do end - init init_aexterncodeblock ( n_in_language: nullable AInLanguage, n_extern_code_segment: nullable TExternCodeSegment ) do - empty_init _n_in_language = n_in_language if n_in_language != null then n_in_language.parent = self _n_extern_code_segment = n_extern_code_segment.as(not null) @@ -7694,22 +8228,19 @@ redef class AExternCodeBlock 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 ) do - empty_init - _n_id.unsafe_add_all(n_id) + self.n_id.unsafe_add_all(n_id) _n_classid = n_classid if n_classid != null then n_classid.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_id.replace_child(old_child, new_child) then return + if n_id.replace_child(old_child, new_child) then return if _n_classid == old_child then n_classid = new_child.as(nullable TClassid) return @@ -7725,55 +8256,59 @@ redef class AQualified redef fun visit_all(v: Visitor) do - _n_id.visit_all(v) + n_id.visit_all(v) v.enter_visit(_n_classid) end end redef class ADoc - private init empty_init do end - init init_adoc ( n_comment: Collection[Object] # Should be Collection[TComment] ) do - empty_init - _n_comment.unsafe_add_all(n_comment) + self.n_comment.unsafe_add_all(n_comment) end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do - if _n_comment.replace_child(old_child, new_child) then return + if n_comment.replace_child(old_child, new_child) then return end redef fun visit_all(v: Visitor) do - _n_comment.visit_all(v) + n_comment.visit_all(v) end end redef class AAnnotations - private init empty_init do end - init init_aannotations ( + n_kwis: nullable TKwis, n_at: nullable TAt, n_opar: nullable TOpar, n_items: Collection[Object], # Should be Collection[AAnnotation] - n_cpar: nullable TCpar + n_cpar: nullable TCpar, + n_kwend: nullable TKwend ) do - empty_init + _n_kwis = n_kwis + if n_kwis != null then n_kwis.parent = self _n_at = n_at if n_at != null then n_at.parent = self _n_opar = n_opar if n_opar != null then n_opar.parent = self - _n_items.unsafe_add_all(n_items) + self.n_items.unsafe_add_all(n_items) _n_cpar = n_cpar if n_cpar != null then n_cpar.parent = self + _n_kwend = n_kwend + if n_kwend != null then n_kwend.parent = self end redef fun replace_child(old_child: ANode, new_child: nullable ANode) do + if _n_kwis == old_child then + n_kwis = new_child.as(nullable TKwis) + return + end if _n_at == old_child then n_at = new_child.as(nullable TAt) return @@ -7782,13 +8317,22 @@ redef class AAnnotations n_opar = new_child.as(nullable TOpar) return end - if _n_items.replace_child(old_child, new_child) then return + if n_items.replace_child(old_child, new_child) then return if _n_cpar == old_child then n_cpar = new_child.as(nullable TCpar) return end + if _n_kwend == old_child then + n_kwend = new_child.as(nullable TKwend) + return + end end + redef fun n_kwis=(node) + do + _n_kwis = node + if node != null then node.parent = self + end redef fun n_at=(node) do _n_at = node @@ -7804,33 +8348,46 @@ redef class AAnnotations _n_cpar = node if node != null then node.parent = self end + redef fun n_kwend=(node) + do + _n_kwend = node + if node != null then node.parent = self + end redef fun visit_all(v: Visitor) do + v.enter_visit(_n_kwis) v.enter_visit(_n_at) v.enter_visit(_n_opar) - _n_items.visit_all(v) + n_items.visit_all(v) v.enter_visit(_n_cpar) + v.enter_visit(_n_kwend) end end redef class AAnnotation - private init empty_init do end - init init_aannotation ( + n_doc: nullable ADoc, + n_kwredef: nullable TKwredef, + n_visibility: nullable AVisibility, n_atid: nullable AAtid, n_opar: nullable TOpar, - n_args: Collection[Object], # Should be Collection[AAtArg] + n_args: Collection[Object], # Should be Collection[AExpr] n_cpar: nullable TCpar, n_annotations: nullable AAnnotations ) do - empty_init + _n_doc = n_doc + if n_doc != null then n_doc.parent = self + _n_kwredef = n_kwredef + if n_kwredef != null then n_kwredef.parent = self + _n_visibility = n_visibility + if n_visibility != null then n_visibility.parent = self _n_atid = n_atid.as(not null) n_atid.parent = self _n_opar = n_opar if n_opar != null then n_opar.parent = self - _n_args.unsafe_add_all(n_args) + self.n_args.unsafe_add_all(n_args) _n_cpar = n_cpar if n_cpar != null then n_cpar.parent = self _n_annotations = n_annotations @@ -7839,6 +8396,18 @@ redef class AAnnotation redef fun replace_child(old_child: ANode, new_child: nullable ANode) do + if _n_doc == old_child then + n_doc = new_child.as(nullable ADoc) + return + end + if _n_kwredef == old_child then + n_kwredef = new_child.as(nullable TKwredef) + return + end + if _n_visibility == old_child then + n_visibility = new_child.as(nullable AVisibility) + return + end if _n_atid == old_child then n_atid = new_child.as(AAtid) return @@ -7847,7 +8416,7 @@ redef class AAnnotation n_opar = new_child.as(nullable TOpar) return end - if _n_args.replace_child(old_child, new_child) then return + if n_args.replace_child(old_child, new_child) then return if _n_cpar == old_child then n_cpar = new_child.as(nullable TCpar) return @@ -7858,6 +8427,21 @@ redef class AAnnotation end end + redef fun n_doc=(node) + do + _n_doc = node + if node != null then node.parent = self + end + redef fun n_kwredef=(node) + do + _n_kwredef = node + if node != null then node.parent = self + end + redef fun n_visibility=(node) + do + _n_visibility = node + if node != null then node.parent = self + end redef fun n_atid=(node) do _n_atid = node @@ -7882,117 +8466,21 @@ redef class AAnnotation redef fun visit_all(v: Visitor) do + v.enter_visit(_n_doc) + v.enter_visit(_n_kwredef) + v.enter_visit(_n_visibility) v.enter_visit(_n_atid) v.enter_visit(_n_opar) - _n_args.visit_all(v) + n_args.visit_all(v) v.enter_visit(_n_cpar) v.enter_visit(_n_annotations) end end -redef class ATypeAtArg - private init empty_init do end - - init init_atypeatarg ( - n_type: nullable AType - ) - do - empty_init - _n_type = n_type.as(not null) - n_type.parent = self - end - - redef fun replace_child(old_child: ANode, new_child: nullable ANode) - do - if _n_type == old_child then - n_type = new_child.as(AType) - return - end - end - - redef fun n_type=(node) - do - _n_type = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_type) - end -end -redef class AExprAtArg - private init empty_init do end - - init init_aexpratarg ( - n_expr: nullable AExpr - ) - do - empty_init - _n_expr = n_expr.as(not null) - n_expr.parent = self - end - - redef fun replace_child(old_child: ANode, new_child: nullable ANode) - do - if _n_expr == old_child then - n_expr = new_child.as(AExpr) - return - end - end - - redef fun n_expr=(node) - do - _n_expr = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_expr) - end -end -redef class AAtAtArg - private init empty_init do end - - init init_aatatarg ( - n_annotations: nullable AAnnotations - ) - do - empty_init - _n_annotations = n_annotations.as(not null) - n_annotations.parent = self - end - - redef fun replace_child(old_child: ANode, new_child: nullable ANode) - do - if _n_annotations == old_child then - n_annotations = new_child.as(AAnnotations) - return - end - end - - redef fun n_annotations=(node) - do - _n_annotations = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_annotations) - end -end redef class AIdAtid - private init empty_init do end - init init_aidatid ( n_id: nullable TId ) do - empty_init _n_id = n_id.as(not null) n_id.parent = self end @@ -8018,13 +8506,10 @@ redef class AIdAtid end end redef class AKwexternAtid - private init empty_init do end - init init_akwexternatid ( n_id: nullable TKwextern ) do - empty_init _n_id = n_id.as(not null) n_id.parent = self end @@ -8049,78 +8534,11 @@ redef class AKwexternAtid v.enter_visit(_n_id) end end -redef class AKwinternAtid - private init empty_init do end - - init init_akwinternatid ( - n_id: nullable TKwintern - ) - do - 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 - n_id = new_child.as(TKwintern) - return - end - end - - redef fun n_id=(node) - do - _n_id = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_id) - end -end -redef class AKwreadableAtid - private init empty_init do end - - init init_akwreadableatid ( - n_id: nullable TKwreadable - ) - do - 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 - n_id = new_child.as(TKwreadable) - return - end - end - - redef fun n_id=(node) - do - _n_id = node - node.parent = self - end - - - redef fun visit_all(v: Visitor) - do - v.enter_visit(_n_id) - end -end -redef class AKwwritableAtid - private init empty_init do end - - init init_akwwritableatid ( - n_id: nullable TKwwritable +redef class AKwabstractAtid + init init_akwabstractatid ( + n_id: nullable TKwabstract ) do - empty_init _n_id = n_id.as(not null) n_id.parent = self end @@ -8128,7 +8546,7 @@ redef class AKwwritableAtid redef fun replace_child(old_child: ANode, new_child: nullable ANode) do if _n_id == old_child then - n_id = new_child.as(TKwwritable) + n_id = new_child.as(TKwabstract) return end end @@ -8146,13 +8564,10 @@ redef class AKwwritableAtid end end redef class AKwimportAtid - private init empty_init do end - init init_akwimportatid ( n_id: nullable TKwimport ) do - empty_init _n_id = n_id.as(not null) n_id.parent = self end