# 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
n_classkind: nullable AClasskind,
n_id: nullable TClassid,
n_formaldefs: Collection[Object], # Should be Collection[AFormaldef]
- n_annotations: nullable AAnnotations,
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
)
_n_id = n_id
if n_id != null then n_id.parent = self
self.n_formaldefs.unsafe_add_all(n_formaldefs)
- _n_annotations = n_annotations
- if n_annotations != null then n_annotations.parent = self
_n_extern_code_block = n_extern_code_block
if n_extern_code_block != null then n_extern_code_block.parent = self
- self.n_superclasses.unsafe_add_all(n_superclasses)
self.n_propdefs.unsafe_add_all(n_propdefs)
_n_kwend = n_kwend.as(not null)
n_kwend.parent = self
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)
- 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_kwend == old_child then
n_kwend = new_child.as(TKwend)
_n_id = 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_extern_code_block=(node)
do
_n_extern_code_block = node
v.enter_visit(_n_classkind)
v.enter_visit(_n_id)
n_formaldefs.visit_all(v)
- v.enter_visit(_n_annotations)
v.enter_visit(_n_extern_code_block)
- n_superclasses.visit_all(v)
n_propdefs.visit_all(v)
v.enter_visit(_n_kwend)
end
v.enter_visit(_n_annotations)
end
end
-redef class ASuperclass
- init init_asuperclass (
- n_kwsuper: nullable TKwsuper,
- n_type: nullable AType,
- n_annotations: nullable AAnnotations
- )
- do
- _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
init init_aattrpropdef (
n_doc: nullable ADoc,
v.enter_visit(_n_block)
end
end
+redef class ASuperPropdef
+ init init_asuperpropdef (
+ n_doc: nullable ADoc,
+ n_kwredef: nullable TKwredef,
+ n_visibility: nullable AVisibility,
+ n_kwsuper: nullable TKwsuper,
+ n_type: nullable AType,
+ n_annotations: nullable AAnnotations
+ )
+ do
+ _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_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_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_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_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_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_doc)
+ v.enter_visit(_n_kwredef)
+ v.enter_visit(_n_visibility)
+ v.enter_visit(_n_kwsuper)
+ v.enter_visit(_n_type)
+ v.enter_visit(_n_annotations)
+ end
+end
+redef class AAnnotPropdef
+ init init_aannotpropdef (
+ 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[AExpr]
+ n_cpar: nullable TCpar,
+ n_annotations: nullable AAnnotations
+ )
+ do
+ _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
+ 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
+ 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(nullable AVisibility)
+ return
+ end
+ if _n_atid == old_child then
+ n_atid = new_child.as(AAtid)
+ return
+ end
+ if _n_opar == old_child then
+ n_opar = new_child.as(nullable TOpar)
+ return
+ end
+ 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
+ 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
+ node.parent = self
+ 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_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_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)
+ v.enter_visit(_n_cpar)
+ v.enter_visit(_n_annotations)
+ end
+end
redef class AIdMethid
init init_aidmethid (
n_id: nullable TId
n_annotations: nullable AAnnotations
)
do
- _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
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
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
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
+ end
+ 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_kwwith=(node)
+ do
+ _n_kwwith = node
+ node.parent = self
+ end
+ redef fun n_expr=(node)
+ do
+ _n_expr = 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_kwwith)
+ v.enter_visit(_n_expr)
+ v.enter_visit(_n_kwdo)
+ v.enter_visit(_n_block)
+ v.enter_visit(_n_label)
+ end
+end
redef class AAssertExpr
init init_aassertexpr (
n_kwassert: nullable TKwassert,
redef class AOrExpr
init init_aorexpr (
n_expr: nullable AExpr,
+ n_op: nullable TKwor,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_aandexpr (
n_expr: nullable AExpr,
+ n_op: nullable TKwand,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_aorelseexpr (
n_expr: nullable AExpr,
+ n_op: nullable TKwor,
+ n_kwelse: nullable TKwelse,
n_expr2: nullable AExpr
)
do
_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
n_expr = new_child.as(AExpr)
return
end
+ if _n_op == old_child then
+ n_op = new_child.as(TKwor)
+ return
+ 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
_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
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
init init_aimpliesexpr (
n_expr: nullable AExpr,
+ n_op: nullable TKwimplies,
n_expr2: nullable AExpr
)
do
_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
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
_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
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 AEqExpr
init init_aeqexpr (
n_expr: nullable AExpr,
+ n_op: nullable TEq,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_aneexpr (
n_expr: nullable AExpr,
+ n_op: nullable TNe,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_altexpr (
n_expr: nullable AExpr,
+ n_op: nullable TLt,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_aleexpr (
n_expr: nullable AExpr,
+ n_op: nullable TLe,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_allexpr (
n_expr: nullable AExpr,
+ n_op: nullable TLl,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_agtexpr (
n_expr: nullable AExpr,
+ n_op: nullable TGt,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_ageexpr (
n_expr: nullable AExpr,
+ n_op: nullable TGe,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_aggexpr (
n_expr: nullable AExpr,
+ n_op: nullable TGg,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_aisaexpr (
n_expr: nullable AExpr,
+ n_kwisa: nullable TKwisa,
n_type: nullable AType
)
do
_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
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
_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
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
init init_aplusexpr (
n_expr: nullable AExpr,
+ n_op: nullable TPlus,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_aminusexpr (
n_expr: nullable AExpr,
+ n_op: nullable TMinus,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_astarshipexpr (
n_expr: nullable AExpr,
+ n_op: nullable TStarship,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_astarexpr (
n_expr: nullable AExpr,
+ n_op: nullable TStar,
n_expr2: nullable AExpr
)
do
_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
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
_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
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 AStarstarExpr
init init_astarstarexpr (
n_expr: nullable AExpr,
+ n_op: nullable TStarstar,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_aslashexpr (
n_expr: nullable AExpr,
+ n_op: nullable TSlash,
n_expr2: nullable AExpr
)
do
_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
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
_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
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
init init_apercentexpr (
n_expr: nullable AExpr,
+ n_op: nullable TPercent,
n_expr2: nullable AExpr
)
do
_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
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
_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
redef fun visit_all(v: Visitor)
do
v.enter_visit(_n_expr)
+ v.enter_visit(_n_op)
v.enter_visit(_n_expr2)
end
end
v.enter_visit(_n_expr)
end
end
+redef class AUplusExpr
+ init init_auplusexpr (
+ n_plus: nullable TPlus,
+ n_expr: nullable AExpr
+ )
+ do
+ _n_plus = n_plus.as(not null)
+ n_plus.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_plus == old_child then
+ n_plus = new_child.as(TPlus)
+ return
+ end
+ if _n_expr == old_child then
+ n_expr = new_child.as(AExpr)
+ return
+ end
+ end
+
+ redef fun n_plus=(node)
+ do
+ _n_plus = 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_plus)
+ v.enter_visit(_n_expr)
+ end
+end
redef class ANewExpr
init init_anewexpr (
n_kwnew: nullable TKwnew,
redef class AArrayExpr
init init_aarrayexpr (
n_obra: nullable TObra,
- n_exprs: nullable AExprs,
+ n_exprs: Collection[Object], # Should be Collection[AExpr]
n_type: nullable AType,
n_cbra: nullable TCbra,
n_annotations: nullable AAnnotations
do
_n_obra = n_obra.as(not null)
n_obra.parent = self
- _n_exprs = n_exprs.as(not null)
- n_exprs.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_obra = new_child.as(TObra)
return
end
- if _n_exprs == old_child then
- n_exprs = new_child.as(AExprs)
- 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
_n_obra = node
node.parent = self
end
- redef fun n_exprs=(node)
- do
- _n_exprs = node
- node.parent = self
- end
redef fun n_type=(node)
do
_n_type = node
redef fun visit_all(v: Visitor)
do
v.enter_visit(_n_obra)
- v.enter_visit(_n_exprs)
+ n_exprs.visit_all(v)
v.enter_visit(_n_type)
v.enter_visit(_n_cbra)
v.enter_visit(_n_annotations)
end
redef class APlusAssignOp
init init_aplusassignop (
- n_pluseq: nullable TPluseq
+ n_op: nullable TPluseq
)
do
- _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(TPluseq)
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
init init_aminusassignop (
- n_minuseq: nullable TMinuseq
+ n_op: nullable TMinuseq
+ )
+ 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(TMinuseq)
+ 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_op)
+ end
+end
+redef class AStarAssignOp
+ init init_astarassignop (
+ n_op: nullable TStareq
+ )
+ 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(TStareq)
+ 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_op)
+ end
+end
+redef class ASlashAssignOp
+ init init_aslashassignop (
+ n_op: nullable TSlasheq
+ )
+ 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(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_op)
+ end
+end
+redef class APercentAssignOp
+ init init_apercentassignop (
+ n_op: nullable TPercenteq
+ )
+ 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(TPercenteq)
+ 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_op)
+ end
+end
+redef class AStarstarAssignOp
+ init init_astarstarassignop (
+ n_op: nullable TStarstareq
+ )
+ 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(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_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
+ if _n_op == old_child then
+ n_op = new_child.as(TLleq)
+ 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_op)
+ end
+end
+redef class AGgAssignOp
+ init init_aggassignop (
+ n_op: nullable TGgeq
)
do
- _n_minuseq = n_minuseq.as(not null)
- n_minuseq.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_minuseq == old_child then
- n_minuseq = new_child.as(TMinuseq)
+ if _n_op == old_child then
+ n_op = new_child.as(TGgeq)
return
end
end
- redef fun n_minuseq=(node)
+ redef fun n_op=(node)
do
- _n_minuseq = node
+ _n_op = node
node.parent = self
end
redef fun visit_all(v: Visitor)
do
- v.enter_visit(_n_minuseq)
+ v.enter_visit(_n_op)
end
end
redef class AModuleName
nitlanguage / nit.git / blobdiff