v.enter_visit(_n_assign)
end
end
+redef class AQid
+ init init_aqid (
+ n_qualified: nullable AQualified,
+ n_id: nullable TId
+ )
+ do
+ _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_qualified == old_child then
+ n_qualified = new_child.as(nullable AQualified)
+ return
+ end
+ if _n_id == old_child then
+ n_id = new_child.as(TId)
+ return
+ end
+ end
+
+ redef fun n_qualified=(node)
+ do
+ _n_qualified = node
+ if node != null then 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_qualified)
+ v.enter_visit(_n_id)
+ end
+end
redef class ASignature
init init_asignature (
n_opar: nullable TOpar,
init init_anewexpr (
n_kwnew: nullable TKwnew,
n_type: nullable AType,
- n_id: nullable TId,
+ n_qid: nullable AQid,
n_args: nullable AExprs
)
do
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_qid = n_qid
+ if n_qid != null then n_qid.parent = self
_n_args = n_args.as(not null)
n_args.parent = self
end
n_type = new_child.as(AType)
return
end
- if _n_id == old_child then
- n_id = new_child.as(nullable TId)
+ if _n_qid == old_child then
+ n_qid = new_child.as(nullable AQid)
return
end
if _n_args == old_child then
_n_type = node
node.parent = self
end
- redef fun n_id=(node)
+ redef fun n_qid=(node)
do
- _n_id = node
+ _n_qid = node
if node != null then node.parent = self
end
redef fun n_args=(node)
do
v.enter_visit(_n_kwnew)
v.enter_visit(_n_type)
- v.enter_visit(_n_id)
+ v.enter_visit(_n_qid)
v.enter_visit(_n_args)
end
end
redef class ACallExpr
init init_acallexpr (
n_expr: nullable AExpr,
- n_id: nullable TId,
+ n_qid: nullable AQid,
n_args: nullable AExprs
)
do
_n_expr = n_expr.as(not null)
n_expr.parent = self
- _n_id = n_id.as(not null)
- n_id.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
n_expr = new_child.as(AExpr)
return
end
- if _n_id == old_child then
- n_id = new_child.as(TId)
+ if _n_qid == old_child then
+ n_qid = new_child.as(AQid)
return
end
if _n_args == old_child then
_n_expr = node
node.parent = self
end
- redef fun n_id=(node)
+ redef fun n_qid=(node)
do
- _n_id = node
+ _n_qid = node
node.parent = self
end
redef fun n_args=(node)
redef fun visit_all(v: Visitor)
do
v.enter_visit(_n_expr)
- v.enter_visit(_n_id)
+ v.enter_visit(_n_qid)
v.enter_visit(_n_args)
end
end
redef class ACallAssignExpr
init init_acallassignexpr (
n_expr: nullable AExpr,
- n_id: nullable TId,
+ 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_id = n_id.as(not null)
- n_id.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_expr = new_child.as(AExpr)
return
end
- if _n_id == old_child then
- n_id = new_child.as(TId)
+ if _n_qid == old_child then
+ n_qid = new_child.as(AQid)
return
end
if _n_args == old_child then
_n_expr = node
node.parent = self
end
- redef fun n_id=(node)
+ redef fun n_qid=(node)
do
- _n_id = node
+ _n_qid = node
node.parent = self
end
redef fun n_args=(node)
redef fun visit_all(v: Visitor)
do
v.enter_visit(_n_expr)
- v.enter_visit(_n_id)
+ v.enter_visit(_n_qid)
v.enter_visit(_n_args)
v.enter_visit(_n_assign)
v.enter_visit(_n_value)
redef class ACallReassignExpr
init init_acallreassignexpr (
n_expr: nullable AExpr,
- n_id: nullable TId,
+ 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_id = n_id.as(not null)
- n_id.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_expr = new_child.as(AExpr)
return
end
- if _n_id == old_child then
- n_id = new_child.as(TId)
+ if _n_qid == old_child then
+ n_qid = new_child.as(AQid)
return
end
if _n_args == old_child then
_n_expr = node
node.parent = self
end
- redef fun n_id=(node)
+ redef fun n_qid=(node)
do
- _n_id = node
+ _n_qid = node
node.parent = self
end
redef fun n_args=(node)
redef fun visit_all(v: Visitor)
do
v.enter_visit(_n_expr)
- v.enter_visit(_n_id)
+ v.enter_visit(_n_qid)
v.enter_visit(_n_args)
v.enter_visit(_n_assign_op)
v.enter_visit(_n_value)
v.enter_visit(_n_annotations)
end
end
-redef class ADecIntExpr
- init init_adecintexpr (
- n_number: nullable TNumber,
- n_annotations: nullable AAnnotations
- )
- do
- _n_number = n_number.as(not null)
- n_number.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)
- return
- end
- if _n_annotations == old_child then
- n_annotations = new_child.as(nullable AAnnotations)
- return
- end
- end
-
- redef fun n_number=(node)
- do
- _n_number = 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_number)
- v.enter_visit(_n_annotations)
- end
-end
-redef class AHexIntExpr
- init init_ahexintexpr (
- n_hex_number: nullable THexNumber,
- n_annotations: nullable AAnnotations
- )
- do
- _n_hex_number = n_hex_number.as(not null)
- n_hex_number.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_hex_number == old_child then
- n_hex_number = new_child.as(THexNumber)
- return
- end
- if _n_annotations == old_child then
- n_annotations = new_child.as(nullable AAnnotations)
- return
- end
- end
-
- redef fun n_hex_number=(node)
- do
- _n_hex_number = 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_hex_number)
- v.enter_visit(_n_annotations)
- end
-end
-redef class ABinIntExpr
- init init_abinintexpr (
- n_bin_number: nullable TBinNumber,
- n_annotations: nullable AAnnotations
- )
- do
- _n_bin_number = n_bin_number.as(not null)
- n_bin_number.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_bin_number == old_child then
- n_bin_number = new_child.as(TBinNumber)
- return
- end
- if _n_annotations == old_child then
- n_annotations = new_child.as(nullable AAnnotations)
- return
- end
- end
-
- redef fun n_bin_number=(node)
- do
- _n_bin_number = 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_bin_number)
- v.enter_visit(_n_annotations)
- end
-end
-redef class AOctIntExpr
- init init_aoctintexpr (
- n_oct_number: nullable TOctNumber,
+redef class AIntegerExpr
+ init init_aintegerexpr (
+ n_integer: nullable TInteger,
n_annotations: nullable AAnnotations
)
do
- _n_oct_number = n_oct_number.as(not null)
- n_oct_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_oct_number == old_child then
- n_oct_number = new_child.as(TOctNumber)
+ if _n_integer == old_child then
+ n_integer = new_child.as(TInteger)
return
end
if _n_annotations == old_child then
end
end
- redef fun n_oct_number=(node)
+ redef fun n_integer=(node)
do
- _n_oct_number = node
+ _n_integer = node
node.parent = self
end
redef fun n_annotations=(node)
redef fun visit_all(v: Visitor)
do
- v.enter_visit(_n_oct_number)
+ v.enter_visit(_n_integer)
v.enter_visit(_n_annotations)
end
end