parser: regenerate with comprehension arrays
[nit.git] / src / parser / parser_prod.nit
1 # Production AST nodes full definition.
2 # This file was generated by SableCC (http://www.sablecc.org/).
3 module parser_prod
4
5 import lexer
6 intrude import parser_nodes
7 private import tables
8
9 redef class AModule
10 init init_amodule (
11 n_moduledecl: nullable AModuledecl,
12 n_imports: Collection[Object], # Should be Collection[AImport]
13 n_extern_code_blocks: Collection[Object], # Should be Collection[AExternCodeBlock]
14 n_classdefs: Collection[Object] # Should be Collection[AClassdef]
15 )
16 do
17 _n_moduledecl = n_moduledecl
18 if n_moduledecl != null then n_moduledecl.parent = self
19 self.n_imports.unsafe_add_all(n_imports)
20 self.n_extern_code_blocks.unsafe_add_all(n_extern_code_blocks)
21 self.n_classdefs.unsafe_add_all(n_classdefs)
22 end
23
24 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
25 do
26 if _n_moduledecl == old_child then
27 n_moduledecl = new_child.as(nullable AModuledecl)
28 return
29 end
30 if n_imports.replace_child(old_child, new_child) then return
31 if n_extern_code_blocks.replace_child(old_child, new_child) then return
32 if n_classdefs.replace_child(old_child, new_child) then return
33 end
34
35 redef fun n_moduledecl=(node)
36 do
37 _n_moduledecl = node
38 if node != null then node.parent = self
39 end
40
41
42 redef fun visit_all(v: Visitor)
43 do
44 v.enter_visit(_n_moduledecl)
45 n_imports.visit_all(v)
46 n_extern_code_blocks.visit_all(v)
47 n_classdefs.visit_all(v)
48 end
49 end
50 redef class AModuledecl
51 init init_amoduledecl (
52 n_doc: nullable ADoc,
53 n_kwredef: nullable TKwredef,
54 n_visibility: nullable AVisibility,
55 n_kwmodule: nullable TKwmodule,
56 n_name: nullable AModuleName,
57 n_annotations: nullable AAnnotations
58 )
59 do
60 _n_doc = n_doc
61 if n_doc != null then n_doc.parent = self
62 _n_kwredef = n_kwredef
63 if n_kwredef != null then n_kwredef.parent = self
64 _n_visibility = n_visibility.as(not null)
65 n_visibility.parent = self
66 _n_kwmodule = n_kwmodule.as(not null)
67 n_kwmodule.parent = self
68 _n_name = n_name.as(not null)
69 n_name.parent = self
70 _n_annotations = n_annotations
71 if n_annotations != null then n_annotations.parent = self
72 end
73
74 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
75 do
76 if _n_doc == old_child then
77 n_doc = new_child.as(nullable ADoc)
78 return
79 end
80 if _n_kwredef == old_child then
81 n_kwredef = new_child.as(nullable TKwredef)
82 return
83 end
84 if _n_visibility == old_child then
85 n_visibility = new_child.as(AVisibility)
86 return
87 end
88 if _n_kwmodule == old_child then
89 n_kwmodule = new_child.as(TKwmodule)
90 return
91 end
92 if _n_name == old_child then
93 n_name = new_child.as(AModuleName)
94 return
95 end
96 if _n_annotations == old_child then
97 n_annotations = new_child.as(nullable AAnnotations)
98 return
99 end
100 end
101
102 redef fun n_doc=(node)
103 do
104 _n_doc = node
105 if node != null then node.parent = self
106 end
107 redef fun n_kwredef=(node)
108 do
109 _n_kwredef = node
110 if node != null then node.parent = self
111 end
112 redef fun n_visibility=(node)
113 do
114 _n_visibility = node
115 node.parent = self
116 end
117 redef fun n_kwmodule=(node)
118 do
119 _n_kwmodule = node
120 node.parent = self
121 end
122 redef fun n_name=(node)
123 do
124 _n_name = node
125 node.parent = self
126 end
127 redef fun n_annotations=(node)
128 do
129 _n_annotations = node
130 if node != null then node.parent = self
131 end
132
133
134 redef fun visit_all(v: Visitor)
135 do
136 v.enter_visit(_n_doc)
137 v.enter_visit(_n_kwredef)
138 v.enter_visit(_n_visibility)
139 v.enter_visit(_n_kwmodule)
140 v.enter_visit(_n_name)
141 v.enter_visit(_n_annotations)
142 end
143 end
144 redef class AStdImport
145 init init_astdimport (
146 n_visibility: nullable AVisibility,
147 n_kwimport: nullable TKwimport,
148 n_name: nullable AModuleName,
149 n_annotations: nullable AAnnotations
150 )
151 do
152 _n_visibility = n_visibility.as(not null)
153 n_visibility.parent = self
154 _n_kwimport = n_kwimport.as(not null)
155 n_kwimport.parent = self
156 _n_name = n_name.as(not null)
157 n_name.parent = self
158 _n_annotations = n_annotations
159 if n_annotations != null then n_annotations.parent = self
160 end
161
162 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
163 do
164 if _n_visibility == old_child then
165 n_visibility = new_child.as(AVisibility)
166 return
167 end
168 if _n_kwimport == old_child then
169 n_kwimport = new_child.as(TKwimport)
170 return
171 end
172 if _n_name == old_child then
173 n_name = new_child.as(AModuleName)
174 return
175 end
176 if _n_annotations == old_child then
177 n_annotations = new_child.as(nullable AAnnotations)
178 return
179 end
180 end
181
182 redef fun n_visibility=(node)
183 do
184 _n_visibility = node
185 node.parent = self
186 end
187 redef fun n_kwimport=(node)
188 do
189 _n_kwimport = node
190 node.parent = self
191 end
192 redef fun n_name=(node)
193 do
194 _n_name = node
195 node.parent = self
196 end
197 redef fun n_annotations=(node)
198 do
199 _n_annotations = node
200 if node != null then node.parent = self
201 end
202
203
204 redef fun visit_all(v: Visitor)
205 do
206 v.enter_visit(_n_visibility)
207 v.enter_visit(_n_kwimport)
208 v.enter_visit(_n_name)
209 v.enter_visit(_n_annotations)
210 end
211 end
212 redef class ANoImport
213 init init_anoimport (
214 n_visibility: nullable AVisibility,
215 n_kwimport: nullable TKwimport,
216 n_kwend: nullable TKwend
217 )
218 do
219 _n_visibility = n_visibility.as(not null)
220 n_visibility.parent = self
221 _n_kwimport = n_kwimport.as(not null)
222 n_kwimport.parent = self
223 _n_kwend = n_kwend.as(not null)
224 n_kwend.parent = self
225 end
226
227 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
228 do
229 if _n_visibility == old_child then
230 n_visibility = new_child.as(AVisibility)
231 return
232 end
233 if _n_kwimport == old_child then
234 n_kwimport = new_child.as(TKwimport)
235 return
236 end
237 if _n_kwend == old_child then
238 n_kwend = new_child.as(TKwend)
239 return
240 end
241 end
242
243 redef fun n_visibility=(node)
244 do
245 _n_visibility = node
246 node.parent = self
247 end
248 redef fun n_kwimport=(node)
249 do
250 _n_kwimport = node
251 node.parent = self
252 end
253 redef fun n_kwend=(node)
254 do
255 _n_kwend = node
256 node.parent = self
257 end
258
259
260 redef fun visit_all(v: Visitor)
261 do
262 v.enter_visit(_n_visibility)
263 v.enter_visit(_n_kwimport)
264 v.enter_visit(_n_kwend)
265 end
266 end
267 redef class APublicVisibility
268 init init_apublicvisibility (
269 n_kwpublic: nullable TKwpublic
270 )
271 do
272 _n_kwpublic = n_kwpublic
273 if n_kwpublic != null then n_kwpublic.parent = self
274 end
275
276 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
277 do
278 if _n_kwpublic == old_child then
279 n_kwpublic = new_child.as(nullable TKwpublic)
280 return
281 end
282 end
283
284 redef fun n_kwpublic=(node)
285 do
286 _n_kwpublic = node
287 if node != null then node.parent = self
288 end
289
290
291 redef fun visit_all(v: Visitor)
292 do
293 v.enter_visit(_n_kwpublic)
294 end
295 end
296 redef class APrivateVisibility
297 init init_aprivatevisibility (
298 n_kwprivate: nullable TKwprivate
299 )
300 do
301 _n_kwprivate = n_kwprivate.as(not null)
302 n_kwprivate.parent = self
303 end
304
305 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
306 do
307 if _n_kwprivate == old_child then
308 n_kwprivate = new_child.as(TKwprivate)
309 return
310 end
311 end
312
313 redef fun n_kwprivate=(node)
314 do
315 _n_kwprivate = node
316 node.parent = self
317 end
318
319
320 redef fun visit_all(v: Visitor)
321 do
322 v.enter_visit(_n_kwprivate)
323 end
324 end
325 redef class AProtectedVisibility
326 init init_aprotectedvisibility (
327 n_kwprotected: nullable TKwprotected
328 )
329 do
330 _n_kwprotected = n_kwprotected.as(not null)
331 n_kwprotected.parent = self
332 end
333
334 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
335 do
336 if _n_kwprotected == old_child then
337 n_kwprotected = new_child.as(TKwprotected)
338 return
339 end
340 end
341
342 redef fun n_kwprotected=(node)
343 do
344 _n_kwprotected = node
345 node.parent = self
346 end
347
348
349 redef fun visit_all(v: Visitor)
350 do
351 v.enter_visit(_n_kwprotected)
352 end
353 end
354 redef class AIntrudeVisibility
355 init init_aintrudevisibility (
356 n_kwintrude: nullable TKwintrude
357 )
358 do
359 _n_kwintrude = n_kwintrude.as(not null)
360 n_kwintrude.parent = self
361 end
362
363 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
364 do
365 if _n_kwintrude == old_child then
366 n_kwintrude = new_child.as(TKwintrude)
367 return
368 end
369 end
370
371 redef fun n_kwintrude=(node)
372 do
373 _n_kwintrude = node
374 node.parent = self
375 end
376
377
378 redef fun visit_all(v: Visitor)
379 do
380 v.enter_visit(_n_kwintrude)
381 end
382 end
383 redef class AStdClassdef
384 init init_astdclassdef (
385 n_doc: nullable ADoc,
386 n_kwredef: nullable TKwredef,
387 n_visibility: nullable AVisibility,
388 n_classkind: nullable AClasskind,
389 n_id: nullable TClassid,
390 n_formaldefs: Collection[Object], # Should be Collection[AFormaldef]
391 n_annotations: nullable AAnnotations,
392 n_extern_code_block: nullable AExternCodeBlock,
393 n_superclasses: Collection[Object], # Should be Collection[ASuperclass]
394 n_propdefs: Collection[Object], # Should be Collection[APropdef]
395 n_kwend: nullable TKwend
396 )
397 do
398 _n_doc = n_doc
399 if n_doc != null then n_doc.parent = self
400 _n_kwredef = n_kwredef
401 if n_kwredef != null then n_kwredef.parent = self
402 _n_visibility = n_visibility.as(not null)
403 n_visibility.parent = self
404 _n_classkind = n_classkind.as(not null)
405 n_classkind.parent = self
406 _n_id = n_id
407 if n_id != null then n_id.parent = self
408 self.n_formaldefs.unsafe_add_all(n_formaldefs)
409 _n_annotations = n_annotations
410 if n_annotations != null then n_annotations.parent = self
411 _n_extern_code_block = n_extern_code_block
412 if n_extern_code_block != null then n_extern_code_block.parent = self
413 self.n_superclasses.unsafe_add_all(n_superclasses)
414 self.n_propdefs.unsafe_add_all(n_propdefs)
415 _n_kwend = n_kwend.as(not null)
416 n_kwend.parent = self
417 end
418
419 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
420 do
421 if _n_doc == old_child then
422 n_doc = new_child.as(nullable ADoc)
423 return
424 end
425 if _n_kwredef == old_child then
426 n_kwredef = new_child.as(nullable TKwredef)
427 return
428 end
429 if _n_visibility == old_child then
430 n_visibility = new_child.as(AVisibility)
431 return
432 end
433 if _n_classkind == old_child then
434 n_classkind = new_child.as(AClasskind)
435 return
436 end
437 if _n_id == old_child then
438 n_id = new_child.as(nullable TClassid)
439 return
440 end
441 if n_formaldefs.replace_child(old_child, new_child) then return
442 if _n_annotations == old_child then
443 n_annotations = new_child.as(nullable AAnnotations)
444 return
445 end
446 if _n_extern_code_block == old_child then
447 n_extern_code_block = new_child.as(nullable AExternCodeBlock)
448 return
449 end
450 if n_superclasses.replace_child(old_child, new_child) then return
451 if n_propdefs.replace_child(old_child, new_child) then return
452 if _n_kwend == old_child then
453 n_kwend = new_child.as(TKwend)
454 return
455 end
456 end
457
458 redef fun n_doc=(node)
459 do
460 _n_doc = node
461 if node != null then node.parent = self
462 end
463 redef fun n_kwredef=(node)
464 do
465 _n_kwredef = node
466 if node != null then node.parent = self
467 end
468 redef fun n_visibility=(node)
469 do
470 _n_visibility = node
471 node.parent = self
472 end
473 redef fun n_classkind=(node)
474 do
475 _n_classkind = node
476 node.parent = self
477 end
478 redef fun n_id=(node)
479 do
480 _n_id = node
481 if node != null then node.parent = self
482 end
483 redef fun n_annotations=(node)
484 do
485 _n_annotations = node
486 if node != null then node.parent = self
487 end
488 redef fun n_extern_code_block=(node)
489 do
490 _n_extern_code_block = node
491 if node != null then node.parent = self
492 end
493 redef fun n_kwend=(node)
494 do
495 _n_kwend = node
496 node.parent = self
497 end
498
499
500 redef fun visit_all(v: Visitor)
501 do
502 v.enter_visit(_n_doc)
503 v.enter_visit(_n_kwredef)
504 v.enter_visit(_n_visibility)
505 v.enter_visit(_n_classkind)
506 v.enter_visit(_n_id)
507 n_formaldefs.visit_all(v)
508 v.enter_visit(_n_annotations)
509 v.enter_visit(_n_extern_code_block)
510 n_superclasses.visit_all(v)
511 n_propdefs.visit_all(v)
512 v.enter_visit(_n_kwend)
513 end
514 end
515 redef class ATopClassdef
516 init init_atopclassdef (
517 n_propdefs: Collection[Object] # Should be Collection[APropdef]
518 )
519 do
520 self.n_propdefs.unsafe_add_all(n_propdefs)
521 end
522
523 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
524 do
525 if n_propdefs.replace_child(old_child, new_child) then return
526 end
527
528
529
530 redef fun visit_all(v: Visitor)
531 do
532 n_propdefs.visit_all(v)
533 end
534 end
535 redef class AMainClassdef
536 init init_amainclassdef (
537 n_propdefs: Collection[Object] # Should be Collection[APropdef]
538 )
539 do
540 self.n_propdefs.unsafe_add_all(n_propdefs)
541 end
542
543 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
544 do
545 if n_propdefs.replace_child(old_child, new_child) then return
546 end
547
548
549
550 redef fun visit_all(v: Visitor)
551 do
552 n_propdefs.visit_all(v)
553 end
554 end
555 redef class AConcreteClasskind
556 init init_aconcreteclasskind (
557 n_kwclass: nullable TKwclass
558 )
559 do
560 _n_kwclass = n_kwclass.as(not null)
561 n_kwclass.parent = self
562 end
563
564 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
565 do
566 if _n_kwclass == old_child then
567 n_kwclass = new_child.as(TKwclass)
568 return
569 end
570 end
571
572 redef fun n_kwclass=(node)
573 do
574 _n_kwclass = node
575 node.parent = self
576 end
577
578
579 redef fun visit_all(v: Visitor)
580 do
581 v.enter_visit(_n_kwclass)
582 end
583 end
584 redef class AAbstractClasskind
585 init init_aabstractclasskind (
586 n_kwabstract: nullable TKwabstract,
587 n_kwclass: nullable TKwclass
588 )
589 do
590 _n_kwabstract = n_kwabstract.as(not null)
591 n_kwabstract.parent = self
592 _n_kwclass = n_kwclass.as(not null)
593 n_kwclass.parent = self
594 end
595
596 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
597 do
598 if _n_kwabstract == old_child then
599 n_kwabstract = new_child.as(TKwabstract)
600 return
601 end
602 if _n_kwclass == old_child then
603 n_kwclass = new_child.as(TKwclass)
604 return
605 end
606 end
607
608 redef fun n_kwabstract=(node)
609 do
610 _n_kwabstract = node
611 node.parent = self
612 end
613 redef fun n_kwclass=(node)
614 do
615 _n_kwclass = node
616 node.parent = self
617 end
618
619
620 redef fun visit_all(v: Visitor)
621 do
622 v.enter_visit(_n_kwabstract)
623 v.enter_visit(_n_kwclass)
624 end
625 end
626 redef class AInterfaceClasskind
627 init init_ainterfaceclasskind (
628 n_kwinterface: nullable TKwinterface
629 )
630 do
631 _n_kwinterface = n_kwinterface.as(not null)
632 n_kwinterface.parent = self
633 end
634
635 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
636 do
637 if _n_kwinterface == old_child then
638 n_kwinterface = new_child.as(TKwinterface)
639 return
640 end
641 end
642
643 redef fun n_kwinterface=(node)
644 do
645 _n_kwinterface = node
646 node.parent = self
647 end
648
649
650 redef fun visit_all(v: Visitor)
651 do
652 v.enter_visit(_n_kwinterface)
653 end
654 end
655 redef class AEnumClasskind
656 init init_aenumclasskind (
657 n_kwenum: nullable TKwenum
658 )
659 do
660 _n_kwenum = n_kwenum.as(not null)
661 n_kwenum.parent = self
662 end
663
664 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
665 do
666 if _n_kwenum == old_child then
667 n_kwenum = new_child.as(TKwenum)
668 return
669 end
670 end
671
672 redef fun n_kwenum=(node)
673 do
674 _n_kwenum = node
675 node.parent = self
676 end
677
678
679 redef fun visit_all(v: Visitor)
680 do
681 v.enter_visit(_n_kwenum)
682 end
683 end
684 redef class AExternClasskind
685 init init_aexternclasskind (
686 n_kwextern: nullable TKwextern,
687 n_kwclass: nullable TKwclass
688 )
689 do
690 _n_kwextern = n_kwextern.as(not null)
691 n_kwextern.parent = self
692 _n_kwclass = n_kwclass
693 if n_kwclass != null then n_kwclass.parent = self
694 end
695
696 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
697 do
698 if _n_kwextern == old_child then
699 n_kwextern = new_child.as(TKwextern)
700 return
701 end
702 if _n_kwclass == old_child then
703 n_kwclass = new_child.as(nullable TKwclass)
704 return
705 end
706 end
707
708 redef fun n_kwextern=(node)
709 do
710 _n_kwextern = node
711 node.parent = self
712 end
713 redef fun n_kwclass=(node)
714 do
715 _n_kwclass = node
716 if node != null then node.parent = self
717 end
718
719
720 redef fun visit_all(v: Visitor)
721 do
722 v.enter_visit(_n_kwextern)
723 v.enter_visit(_n_kwclass)
724 end
725 end
726 redef class AFormaldef
727 init init_aformaldef (
728 n_id: nullable TClassid,
729 n_type: nullable AType,
730 n_annotations: nullable AAnnotations
731 )
732 do
733 _n_id = n_id.as(not null)
734 n_id.parent = self
735 _n_type = n_type
736 if n_type != null then n_type.parent = self
737 _n_annotations = n_annotations
738 if n_annotations != null then n_annotations.parent = self
739 end
740
741 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
742 do
743 if _n_id == old_child then
744 n_id = new_child.as(TClassid)
745 return
746 end
747 if _n_type == old_child then
748 n_type = new_child.as(nullable AType)
749 return
750 end
751 if _n_annotations == old_child then
752 n_annotations = new_child.as(nullable AAnnotations)
753 return
754 end
755 end
756
757 redef fun n_id=(node)
758 do
759 _n_id = node
760 node.parent = self
761 end
762 redef fun n_type=(node)
763 do
764 _n_type = node
765 if node != null then node.parent = self
766 end
767 redef fun n_annotations=(node)
768 do
769 _n_annotations = node
770 if node != null then node.parent = self
771 end
772
773
774 redef fun visit_all(v: Visitor)
775 do
776 v.enter_visit(_n_id)
777 v.enter_visit(_n_type)
778 v.enter_visit(_n_annotations)
779 end
780 end
781 redef class ASuperclass
782 init init_asuperclass (
783 n_kwsuper: nullable TKwsuper,
784 n_type: nullable AType,
785 n_annotations: nullable AAnnotations
786 )
787 do
788 _n_kwsuper = n_kwsuper.as(not null)
789 n_kwsuper.parent = self
790 _n_type = n_type.as(not null)
791 n_type.parent = self
792 _n_annotations = n_annotations
793 if n_annotations != null then n_annotations.parent = self
794 end
795
796 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
797 do
798 if _n_kwsuper == old_child then
799 n_kwsuper = new_child.as(TKwsuper)
800 return
801 end
802 if _n_type == old_child then
803 n_type = new_child.as(AType)
804 return
805 end
806 if _n_annotations == old_child then
807 n_annotations = new_child.as(nullable AAnnotations)
808 return
809 end
810 end
811
812 redef fun n_kwsuper=(node)
813 do
814 _n_kwsuper = node
815 node.parent = self
816 end
817 redef fun n_type=(node)
818 do
819 _n_type = node
820 node.parent = self
821 end
822 redef fun n_annotations=(node)
823 do
824 _n_annotations = node
825 if node != null then node.parent = self
826 end
827
828
829 redef fun visit_all(v: Visitor)
830 do
831 v.enter_visit(_n_kwsuper)
832 v.enter_visit(_n_type)
833 v.enter_visit(_n_annotations)
834 end
835 end
836 redef class AAttrPropdef
837 init init_aattrpropdef (
838 n_doc: nullable ADoc,
839 n_kwredef: nullable TKwredef,
840 n_visibility: nullable AVisibility,
841 n_kwvar: nullable TKwvar,
842 n_id2: nullable TId,
843 n_type: nullable AType,
844 n_expr: nullable AExpr,
845 n_annotations: nullable AAnnotations,
846 n_block: nullable AExpr
847 )
848 do
849 _n_doc = n_doc
850 if n_doc != null then n_doc.parent = self
851 _n_kwredef = n_kwredef
852 if n_kwredef != null then n_kwredef.parent = self
853 _n_visibility = n_visibility.as(not null)
854 n_visibility.parent = self
855 _n_kwvar = n_kwvar.as(not null)
856 n_kwvar.parent = self
857 _n_id2 = n_id2.as(not null)
858 n_id2.parent = self
859 _n_type = n_type
860 if n_type != null then n_type.parent = self
861 _n_expr = n_expr
862 if n_expr != null then n_expr.parent = self
863 _n_annotations = n_annotations
864 if n_annotations != null then n_annotations.parent = self
865 _n_block = n_block
866 if n_block != null then n_block.parent = self
867 end
868
869 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
870 do
871 if _n_doc == old_child then
872 n_doc = new_child.as(nullable ADoc)
873 return
874 end
875 if _n_kwredef == old_child then
876 n_kwredef = new_child.as(nullable TKwredef)
877 return
878 end
879 if _n_visibility == old_child then
880 n_visibility = new_child.as(AVisibility)
881 return
882 end
883 if _n_kwvar == old_child then
884 n_kwvar = new_child.as(TKwvar)
885 return
886 end
887 if _n_id2 == old_child then
888 n_id2 = new_child.as(TId)
889 return
890 end
891 if _n_type == old_child then
892 n_type = new_child.as(nullable AType)
893 return
894 end
895 if _n_expr == old_child then
896 n_expr = new_child.as(nullable AExpr)
897 return
898 end
899 if _n_annotations == old_child then
900 n_annotations = new_child.as(nullable AAnnotations)
901 return
902 end
903 if _n_block == old_child then
904 n_block = new_child.as(nullable AExpr)
905 return
906 end
907 end
908
909 redef fun n_doc=(node)
910 do
911 _n_doc = node
912 if node != null then node.parent = self
913 end
914 redef fun n_kwredef=(node)
915 do
916 _n_kwredef = node
917 if node != null then node.parent = self
918 end
919 redef fun n_visibility=(node)
920 do
921 _n_visibility = node
922 node.parent = self
923 end
924 redef fun n_kwvar=(node)
925 do
926 _n_kwvar = node
927 node.parent = self
928 end
929 redef fun n_id2=(node)
930 do
931 _n_id2 = node
932 node.parent = self
933 end
934 redef fun n_type=(node)
935 do
936 _n_type = node
937 if node != null then node.parent = self
938 end
939 redef fun n_expr=(node)
940 do
941 _n_expr = node
942 if node != null then node.parent = self
943 end
944 redef fun n_annotations=(node)
945 do
946 _n_annotations = node
947 if node != null then node.parent = self
948 end
949 redef fun n_block=(node)
950 do
951 _n_block = node
952 if node != null then node.parent = self
953 end
954
955
956 redef fun visit_all(v: Visitor)
957 do
958 v.enter_visit(_n_doc)
959 v.enter_visit(_n_kwredef)
960 v.enter_visit(_n_visibility)
961 v.enter_visit(_n_kwvar)
962 v.enter_visit(_n_id2)
963 v.enter_visit(_n_type)
964 v.enter_visit(_n_expr)
965 v.enter_visit(_n_annotations)
966 v.enter_visit(_n_block)
967 end
968 end
969 redef class AMainMethPropdef
970 init init_amainmethpropdef (
971 n_kwredef: nullable TKwredef,
972 n_block: nullable AExpr
973 )
974 do
975 _n_kwredef = n_kwredef
976 if n_kwredef != null then n_kwredef.parent = self
977 _n_block = n_block
978 if n_block != null then n_block.parent = self
979 end
980
981 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
982 do
983 if _n_kwredef == old_child then
984 n_kwredef = new_child.as(nullable TKwredef)
985 return
986 end
987 if _n_block == old_child then
988 n_block = new_child.as(nullable AExpr)
989 return
990 end
991 end
992
993 redef fun n_kwredef=(node)
994 do
995 _n_kwredef = node
996 if node != null then node.parent = self
997 end
998 redef fun n_block=(node)
999 do
1000 _n_block = node
1001 if node != null then node.parent = self
1002 end
1003
1004
1005 redef fun visit_all(v: Visitor)
1006 do
1007 v.enter_visit(_n_kwredef)
1008 v.enter_visit(_n_block)
1009 end
1010 end
1011 redef class ATypePropdef
1012 init init_atypepropdef (
1013 n_doc: nullable ADoc,
1014 n_kwredef: nullable TKwredef,
1015 n_visibility: nullable AVisibility,
1016 n_kwtype: nullable TKwtype,
1017 n_id: nullable TClassid,
1018 n_type: nullable AType,
1019 n_annotations: nullable AAnnotations
1020 )
1021 do
1022 _n_doc = n_doc
1023 if n_doc != null then n_doc.parent = self
1024 _n_kwredef = n_kwredef
1025 if n_kwredef != null then n_kwredef.parent = self
1026 _n_visibility = n_visibility.as(not null)
1027 n_visibility.parent = self
1028 _n_kwtype = n_kwtype.as(not null)
1029 n_kwtype.parent = self
1030 _n_id = n_id.as(not null)
1031 n_id.parent = self
1032 _n_type = n_type.as(not null)
1033 n_type.parent = self
1034 _n_annotations = n_annotations
1035 if n_annotations != null then n_annotations.parent = self
1036 end
1037
1038 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1039 do
1040 if _n_doc == old_child then
1041 n_doc = new_child.as(nullable ADoc)
1042 return
1043 end
1044 if _n_kwredef == old_child then
1045 n_kwredef = new_child.as(nullable TKwredef)
1046 return
1047 end
1048 if _n_visibility == old_child then
1049 n_visibility = new_child.as(AVisibility)
1050 return
1051 end
1052 if _n_kwtype == old_child then
1053 n_kwtype = new_child.as(TKwtype)
1054 return
1055 end
1056 if _n_id == old_child then
1057 n_id = new_child.as(TClassid)
1058 return
1059 end
1060 if _n_type == old_child then
1061 n_type = new_child.as(AType)
1062 return
1063 end
1064 if _n_annotations == old_child then
1065 n_annotations = new_child.as(nullable AAnnotations)
1066 return
1067 end
1068 end
1069
1070 redef fun n_doc=(node)
1071 do
1072 _n_doc = node
1073 if node != null then node.parent = self
1074 end
1075 redef fun n_kwredef=(node)
1076 do
1077 _n_kwredef = node
1078 if node != null then node.parent = self
1079 end
1080 redef fun n_visibility=(node)
1081 do
1082 _n_visibility = node
1083 node.parent = self
1084 end
1085 redef fun n_kwtype=(node)
1086 do
1087 _n_kwtype = node
1088 node.parent = self
1089 end
1090 redef fun n_id=(node)
1091 do
1092 _n_id = node
1093 node.parent = self
1094 end
1095 redef fun n_type=(node)
1096 do
1097 _n_type = node
1098 node.parent = self
1099 end
1100 redef fun n_annotations=(node)
1101 do
1102 _n_annotations = node
1103 if node != null then node.parent = self
1104 end
1105
1106
1107 redef fun visit_all(v: Visitor)
1108 do
1109 v.enter_visit(_n_doc)
1110 v.enter_visit(_n_kwredef)
1111 v.enter_visit(_n_visibility)
1112 v.enter_visit(_n_kwtype)
1113 v.enter_visit(_n_id)
1114 v.enter_visit(_n_type)
1115 v.enter_visit(_n_annotations)
1116 end
1117 end
1118 redef class AMethPropdef
1119 init init_amethpropdef (
1120 n_doc: nullable ADoc,
1121 n_kwredef: nullable TKwredef,
1122 n_visibility: nullable AVisibility,
1123 n_kwmeth: nullable TKwmeth,
1124 n_kwinit: nullable TKwinit,
1125 n_kwnew: nullable TKwnew,
1126 n_methid: nullable AMethid,
1127 n_signature: nullable ASignature,
1128 n_annotations: nullable AAnnotations,
1129 n_extern_calls: nullable AExternCalls,
1130 n_extern_code_block: nullable AExternCodeBlock,
1131 n_block: nullable AExpr
1132 )
1133 do
1134 _n_doc = n_doc
1135 if n_doc != null then n_doc.parent = self
1136 _n_kwredef = n_kwredef
1137 if n_kwredef != null then n_kwredef.parent = self
1138 _n_visibility = n_visibility.as(not null)
1139 n_visibility.parent = self
1140 _n_kwmeth = n_kwmeth
1141 if n_kwmeth != null then n_kwmeth.parent = self
1142 _n_kwinit = n_kwinit
1143 if n_kwinit != null then n_kwinit.parent = self
1144 _n_kwnew = n_kwnew
1145 if n_kwnew != null then n_kwnew.parent = self
1146 _n_methid = n_methid
1147 if n_methid != null then n_methid.parent = self
1148 _n_signature = n_signature.as(not null)
1149 n_signature.parent = self
1150 _n_annotations = n_annotations
1151 if n_annotations != null then n_annotations.parent = self
1152 _n_extern_calls = n_extern_calls
1153 if n_extern_calls != null then n_extern_calls.parent = self
1154 _n_extern_code_block = n_extern_code_block
1155 if n_extern_code_block != null then n_extern_code_block.parent = self
1156 _n_block = n_block
1157 if n_block != null then n_block.parent = self
1158 end
1159
1160 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1161 do
1162 if _n_doc == old_child then
1163 n_doc = new_child.as(nullable ADoc)
1164 return
1165 end
1166 if _n_kwredef == old_child then
1167 n_kwredef = new_child.as(nullable TKwredef)
1168 return
1169 end
1170 if _n_visibility == old_child then
1171 n_visibility = new_child.as(AVisibility)
1172 return
1173 end
1174 if _n_kwmeth == old_child then
1175 n_kwmeth = new_child.as(nullable TKwmeth)
1176 return
1177 end
1178 if _n_kwinit == old_child then
1179 n_kwinit = new_child.as(nullable TKwinit)
1180 return
1181 end
1182 if _n_kwnew == old_child then
1183 n_kwnew = new_child.as(nullable TKwnew)
1184 return
1185 end
1186 if _n_methid == old_child then
1187 n_methid = new_child.as(nullable AMethid)
1188 return
1189 end
1190 if _n_signature == old_child then
1191 n_signature = new_child.as(ASignature)
1192 return
1193 end
1194 if _n_annotations == old_child then
1195 n_annotations = new_child.as(nullable AAnnotations)
1196 return
1197 end
1198 if _n_extern_calls == old_child then
1199 n_extern_calls = new_child.as(nullable AExternCalls)
1200 return
1201 end
1202 if _n_extern_code_block == old_child then
1203 n_extern_code_block = new_child.as(nullable AExternCodeBlock)
1204 return
1205 end
1206 if _n_block == old_child then
1207 n_block = new_child.as(nullable AExpr)
1208 return
1209 end
1210 end
1211
1212 redef fun n_doc=(node)
1213 do
1214 _n_doc = node
1215 if node != null then node.parent = self
1216 end
1217 redef fun n_kwredef=(node)
1218 do
1219 _n_kwredef = node
1220 if node != null then node.parent = self
1221 end
1222 redef fun n_visibility=(node)
1223 do
1224 _n_visibility = node
1225 node.parent = self
1226 end
1227 redef fun n_kwmeth=(node)
1228 do
1229 _n_kwmeth = node
1230 if node != null then node.parent = self
1231 end
1232 redef fun n_kwinit=(node)
1233 do
1234 _n_kwinit = node
1235 if node != null then node.parent = self
1236 end
1237 redef fun n_kwnew=(node)
1238 do
1239 _n_kwnew = node
1240 if node != null then node.parent = self
1241 end
1242 redef fun n_methid=(node)
1243 do
1244 _n_methid = node
1245 if node != null then node.parent = self
1246 end
1247 redef fun n_signature=(node)
1248 do
1249 _n_signature = node
1250 node.parent = self
1251 end
1252 redef fun n_annotations=(node)
1253 do
1254 _n_annotations = node
1255 if node != null then node.parent = self
1256 end
1257 redef fun n_extern_calls=(node)
1258 do
1259 _n_extern_calls = node
1260 if node != null then node.parent = self
1261 end
1262 redef fun n_extern_code_block=(node)
1263 do
1264 _n_extern_code_block = node
1265 if node != null then node.parent = self
1266 end
1267 redef fun n_block=(node)
1268 do
1269 _n_block = node
1270 if node != null then node.parent = self
1271 end
1272
1273
1274 redef fun visit_all(v: Visitor)
1275 do
1276 v.enter_visit(_n_doc)
1277 v.enter_visit(_n_kwredef)
1278 v.enter_visit(_n_visibility)
1279 v.enter_visit(_n_kwmeth)
1280 v.enter_visit(_n_kwinit)
1281 v.enter_visit(_n_kwnew)
1282 v.enter_visit(_n_methid)
1283 v.enter_visit(_n_signature)
1284 v.enter_visit(_n_annotations)
1285 v.enter_visit(_n_extern_calls)
1286 v.enter_visit(_n_extern_code_block)
1287 v.enter_visit(_n_block)
1288 end
1289 end
1290 redef class AIdMethid
1291 init init_aidmethid (
1292 n_id: nullable TId
1293 )
1294 do
1295 _n_id = n_id.as(not null)
1296 n_id.parent = self
1297 end
1298
1299 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1300 do
1301 if _n_id == old_child then
1302 n_id = new_child.as(TId)
1303 return
1304 end
1305 end
1306
1307 redef fun n_id=(node)
1308 do
1309 _n_id = node
1310 node.parent = self
1311 end
1312
1313
1314 redef fun visit_all(v: Visitor)
1315 do
1316 v.enter_visit(_n_id)
1317 end
1318 end
1319 redef class APlusMethid
1320 init init_aplusmethid (
1321 n_plus: nullable TPlus
1322 )
1323 do
1324 _n_plus = n_plus.as(not null)
1325 n_plus.parent = self
1326 end
1327
1328 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1329 do
1330 if _n_plus == old_child then
1331 n_plus = new_child.as(TPlus)
1332 return
1333 end
1334 end
1335
1336 redef fun n_plus=(node)
1337 do
1338 _n_plus = node
1339 node.parent = self
1340 end
1341
1342
1343 redef fun visit_all(v: Visitor)
1344 do
1345 v.enter_visit(_n_plus)
1346 end
1347 end
1348 redef class AMinusMethid
1349 init init_aminusmethid (
1350 n_minus: nullable TMinus
1351 )
1352 do
1353 _n_minus = n_minus.as(not null)
1354 n_minus.parent = self
1355 end
1356
1357 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1358 do
1359 if _n_minus == old_child then
1360 n_minus = new_child.as(TMinus)
1361 return
1362 end
1363 end
1364
1365 redef fun n_minus=(node)
1366 do
1367 _n_minus = node
1368 node.parent = self
1369 end
1370
1371
1372 redef fun visit_all(v: Visitor)
1373 do
1374 v.enter_visit(_n_minus)
1375 end
1376 end
1377 redef class AStarMethid
1378 init init_astarmethid (
1379 n_star: nullable TStar
1380 )
1381 do
1382 _n_star = n_star.as(not null)
1383 n_star.parent = self
1384 end
1385
1386 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1387 do
1388 if _n_star == old_child then
1389 n_star = new_child.as(TStar)
1390 return
1391 end
1392 end
1393
1394 redef fun n_star=(node)
1395 do
1396 _n_star = node
1397 node.parent = self
1398 end
1399
1400
1401 redef fun visit_all(v: Visitor)
1402 do
1403 v.enter_visit(_n_star)
1404 end
1405 end
1406 redef class AStarstarMethid
1407 init init_astarstarmethid (
1408 n_starstar: nullable TStarstar
1409 )
1410 do
1411 _n_starstar = n_starstar.as(not null)
1412 n_starstar.parent = self
1413 end
1414
1415 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1416 do
1417 if _n_starstar == old_child then
1418 n_starstar = new_child.as(TStarstar)
1419 return
1420 end
1421 end
1422
1423 redef fun n_starstar=(node)
1424 do
1425 _n_starstar = node
1426 node.parent = self
1427 end
1428
1429
1430 redef fun visit_all(v: Visitor)
1431 do
1432 v.enter_visit(_n_starstar)
1433 end
1434 end
1435 redef class ASlashMethid
1436 init init_aslashmethid (
1437 n_slash: nullable TSlash
1438 )
1439 do
1440 _n_slash = n_slash.as(not null)
1441 n_slash.parent = self
1442 end
1443
1444 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1445 do
1446 if _n_slash == old_child then
1447 n_slash = new_child.as(TSlash)
1448 return
1449 end
1450 end
1451
1452 redef fun n_slash=(node)
1453 do
1454 _n_slash = node
1455 node.parent = self
1456 end
1457
1458
1459 redef fun visit_all(v: Visitor)
1460 do
1461 v.enter_visit(_n_slash)
1462 end
1463 end
1464 redef class APercentMethid
1465 init init_apercentmethid (
1466 n_percent: nullable TPercent
1467 )
1468 do
1469 _n_percent = n_percent.as(not null)
1470 n_percent.parent = self
1471 end
1472
1473 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1474 do
1475 if _n_percent == old_child then
1476 n_percent = new_child.as(TPercent)
1477 return
1478 end
1479 end
1480
1481 redef fun n_percent=(node)
1482 do
1483 _n_percent = node
1484 node.parent = self
1485 end
1486
1487
1488 redef fun visit_all(v: Visitor)
1489 do
1490 v.enter_visit(_n_percent)
1491 end
1492 end
1493 redef class AEqMethid
1494 init init_aeqmethid (
1495 n_eq: nullable TEq
1496 )
1497 do
1498 _n_eq = n_eq.as(not null)
1499 n_eq.parent = self
1500 end
1501
1502 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1503 do
1504 if _n_eq == old_child then
1505 n_eq = new_child.as(TEq)
1506 return
1507 end
1508 end
1509
1510 redef fun n_eq=(node)
1511 do
1512 _n_eq = node
1513 node.parent = self
1514 end
1515
1516
1517 redef fun visit_all(v: Visitor)
1518 do
1519 v.enter_visit(_n_eq)
1520 end
1521 end
1522 redef class ANeMethid
1523 init init_anemethid (
1524 n_ne: nullable TNe
1525 )
1526 do
1527 _n_ne = n_ne.as(not null)
1528 n_ne.parent = self
1529 end
1530
1531 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1532 do
1533 if _n_ne == old_child then
1534 n_ne = new_child.as(TNe)
1535 return
1536 end
1537 end
1538
1539 redef fun n_ne=(node)
1540 do
1541 _n_ne = node
1542 node.parent = self
1543 end
1544
1545
1546 redef fun visit_all(v: Visitor)
1547 do
1548 v.enter_visit(_n_ne)
1549 end
1550 end
1551 redef class ALeMethid
1552 init init_alemethid (
1553 n_le: nullable TLe
1554 )
1555 do
1556 _n_le = n_le.as(not null)
1557 n_le.parent = self
1558 end
1559
1560 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1561 do
1562 if _n_le == old_child then
1563 n_le = new_child.as(TLe)
1564 return
1565 end
1566 end
1567
1568 redef fun n_le=(node)
1569 do
1570 _n_le = node
1571 node.parent = self
1572 end
1573
1574
1575 redef fun visit_all(v: Visitor)
1576 do
1577 v.enter_visit(_n_le)
1578 end
1579 end
1580 redef class AGeMethid
1581 init init_agemethid (
1582 n_ge: nullable TGe
1583 )
1584 do
1585 _n_ge = n_ge.as(not null)
1586 n_ge.parent = self
1587 end
1588
1589 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1590 do
1591 if _n_ge == old_child then
1592 n_ge = new_child.as(TGe)
1593 return
1594 end
1595 end
1596
1597 redef fun n_ge=(node)
1598 do
1599 _n_ge = node
1600 node.parent = self
1601 end
1602
1603
1604 redef fun visit_all(v: Visitor)
1605 do
1606 v.enter_visit(_n_ge)
1607 end
1608 end
1609 redef class ALtMethid
1610 init init_altmethid (
1611 n_lt: nullable TLt
1612 )
1613 do
1614 _n_lt = n_lt.as(not null)
1615 n_lt.parent = self
1616 end
1617
1618 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1619 do
1620 if _n_lt == old_child then
1621 n_lt = new_child.as(TLt)
1622 return
1623 end
1624 end
1625
1626 redef fun n_lt=(node)
1627 do
1628 _n_lt = node
1629 node.parent = self
1630 end
1631
1632
1633 redef fun visit_all(v: Visitor)
1634 do
1635 v.enter_visit(_n_lt)
1636 end
1637 end
1638 redef class AGtMethid
1639 init init_agtmethid (
1640 n_gt: nullable TGt
1641 )
1642 do
1643 _n_gt = n_gt.as(not null)
1644 n_gt.parent = self
1645 end
1646
1647 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1648 do
1649 if _n_gt == old_child then
1650 n_gt = new_child.as(TGt)
1651 return
1652 end
1653 end
1654
1655 redef fun n_gt=(node)
1656 do
1657 _n_gt = node
1658 node.parent = self
1659 end
1660
1661
1662 redef fun visit_all(v: Visitor)
1663 do
1664 v.enter_visit(_n_gt)
1665 end
1666 end
1667 redef class ALlMethid
1668 init init_allmethid (
1669 n_ll: nullable TLl
1670 )
1671 do
1672 _n_ll = n_ll.as(not null)
1673 n_ll.parent = self
1674 end
1675
1676 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1677 do
1678 if _n_ll == old_child then
1679 n_ll = new_child.as(TLl)
1680 return
1681 end
1682 end
1683
1684 redef fun n_ll=(node)
1685 do
1686 _n_ll = node
1687 node.parent = self
1688 end
1689
1690
1691 redef fun visit_all(v: Visitor)
1692 do
1693 v.enter_visit(_n_ll)
1694 end
1695 end
1696 redef class AGgMethid
1697 init init_aggmethid (
1698 n_gg: nullable TGg
1699 )
1700 do
1701 _n_gg = n_gg.as(not null)
1702 n_gg.parent = self
1703 end
1704
1705 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1706 do
1707 if _n_gg == old_child then
1708 n_gg = new_child.as(TGg)
1709 return
1710 end
1711 end
1712
1713 redef fun n_gg=(node)
1714 do
1715 _n_gg = node
1716 node.parent = self
1717 end
1718
1719
1720 redef fun visit_all(v: Visitor)
1721 do
1722 v.enter_visit(_n_gg)
1723 end
1724 end
1725 redef class ABraMethid
1726 init init_abramethid (
1727 n_obra: nullable TObra,
1728 n_cbra: nullable TCbra
1729 )
1730 do
1731 _n_obra = n_obra.as(not null)
1732 n_obra.parent = self
1733 _n_cbra = n_cbra.as(not null)
1734 n_cbra.parent = self
1735 end
1736
1737 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1738 do
1739 if _n_obra == old_child then
1740 n_obra = new_child.as(TObra)
1741 return
1742 end
1743 if _n_cbra == old_child then
1744 n_cbra = new_child.as(TCbra)
1745 return
1746 end
1747 end
1748
1749 redef fun n_obra=(node)
1750 do
1751 _n_obra = node
1752 node.parent = self
1753 end
1754 redef fun n_cbra=(node)
1755 do
1756 _n_cbra = node
1757 node.parent = self
1758 end
1759
1760
1761 redef fun visit_all(v: Visitor)
1762 do
1763 v.enter_visit(_n_obra)
1764 v.enter_visit(_n_cbra)
1765 end
1766 end
1767 redef class AStarshipMethid
1768 init init_astarshipmethid (
1769 n_starship: nullable TStarship
1770 )
1771 do
1772 _n_starship = n_starship.as(not null)
1773 n_starship.parent = self
1774 end
1775
1776 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1777 do
1778 if _n_starship == old_child then
1779 n_starship = new_child.as(TStarship)
1780 return
1781 end
1782 end
1783
1784 redef fun n_starship=(node)
1785 do
1786 _n_starship = node
1787 node.parent = self
1788 end
1789
1790
1791 redef fun visit_all(v: Visitor)
1792 do
1793 v.enter_visit(_n_starship)
1794 end
1795 end
1796 redef class AAssignMethid
1797 init init_aassignmethid (
1798 n_id: nullable TId,
1799 n_assign: nullable TAssign
1800 )
1801 do
1802 _n_id = n_id.as(not null)
1803 n_id.parent = self
1804 _n_assign = n_assign.as(not null)
1805 n_assign.parent = self
1806 end
1807
1808 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1809 do
1810 if _n_id == old_child then
1811 n_id = new_child.as(TId)
1812 return
1813 end
1814 if _n_assign == old_child then
1815 n_assign = new_child.as(TAssign)
1816 return
1817 end
1818 end
1819
1820 redef fun n_id=(node)
1821 do
1822 _n_id = node
1823 node.parent = self
1824 end
1825 redef fun n_assign=(node)
1826 do
1827 _n_assign = node
1828 node.parent = self
1829 end
1830
1831
1832 redef fun visit_all(v: Visitor)
1833 do
1834 v.enter_visit(_n_id)
1835 v.enter_visit(_n_assign)
1836 end
1837 end
1838 redef class ABraassignMethid
1839 init init_abraassignmethid (
1840 n_obra: nullable TObra,
1841 n_cbra: nullable TCbra,
1842 n_assign: nullable TAssign
1843 )
1844 do
1845 _n_obra = n_obra.as(not null)
1846 n_obra.parent = self
1847 _n_cbra = n_cbra.as(not null)
1848 n_cbra.parent = self
1849 _n_assign = n_assign.as(not null)
1850 n_assign.parent = self
1851 end
1852
1853 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1854 do
1855 if _n_obra == old_child then
1856 n_obra = new_child.as(TObra)
1857 return
1858 end
1859 if _n_cbra == old_child then
1860 n_cbra = new_child.as(TCbra)
1861 return
1862 end
1863 if _n_assign == old_child then
1864 n_assign = new_child.as(TAssign)
1865 return
1866 end
1867 end
1868
1869 redef fun n_obra=(node)
1870 do
1871 _n_obra = node
1872 node.parent = self
1873 end
1874 redef fun n_cbra=(node)
1875 do
1876 _n_cbra = node
1877 node.parent = self
1878 end
1879 redef fun n_assign=(node)
1880 do
1881 _n_assign = node
1882 node.parent = self
1883 end
1884
1885
1886 redef fun visit_all(v: Visitor)
1887 do
1888 v.enter_visit(_n_obra)
1889 v.enter_visit(_n_cbra)
1890 v.enter_visit(_n_assign)
1891 end
1892 end
1893 redef class ASignature
1894 init init_asignature (
1895 n_opar: nullable TOpar,
1896 n_params: Collection[Object], # Should be Collection[AParam]
1897 n_cpar: nullable TCpar,
1898 n_type: nullable AType
1899 )
1900 do
1901 _n_opar = n_opar
1902 if n_opar != null then n_opar.parent = self
1903 self.n_params.unsafe_add_all(n_params)
1904 _n_cpar = n_cpar
1905 if n_cpar != null then n_cpar.parent = self
1906 _n_type = n_type
1907 if n_type != null then n_type.parent = self
1908 end
1909
1910 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1911 do
1912 if _n_opar == old_child then
1913 n_opar = new_child.as(nullable TOpar)
1914 return
1915 end
1916 if n_params.replace_child(old_child, new_child) then return
1917 if _n_cpar == old_child then
1918 n_cpar = new_child.as(nullable TCpar)
1919 return
1920 end
1921 if _n_type == old_child then
1922 n_type = new_child.as(nullable AType)
1923 return
1924 end
1925 end
1926
1927 redef fun n_opar=(node)
1928 do
1929 _n_opar = node
1930 if node != null then node.parent = self
1931 end
1932 redef fun n_cpar=(node)
1933 do
1934 _n_cpar = node
1935 if node != null then node.parent = self
1936 end
1937 redef fun n_type=(node)
1938 do
1939 _n_type = node
1940 if node != null then node.parent = self
1941 end
1942
1943
1944 redef fun visit_all(v: Visitor)
1945 do
1946 v.enter_visit(_n_opar)
1947 n_params.visit_all(v)
1948 v.enter_visit(_n_cpar)
1949 v.enter_visit(_n_type)
1950 end
1951 end
1952 redef class AParam
1953 init init_aparam (
1954 n_id: nullable TId,
1955 n_type: nullable AType,
1956 n_dotdotdot: nullable TDotdotdot,
1957 n_annotations: nullable AAnnotations
1958 )
1959 do
1960 _n_id = n_id.as(not null)
1961 n_id.parent = self
1962 _n_type = n_type
1963 if n_type != null then n_type.parent = self
1964 _n_dotdotdot = n_dotdotdot
1965 if n_dotdotdot != null then n_dotdotdot.parent = self
1966 _n_annotations = n_annotations
1967 if n_annotations != null then n_annotations.parent = self
1968 end
1969
1970 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
1971 do
1972 if _n_id == old_child then
1973 n_id = new_child.as(TId)
1974 return
1975 end
1976 if _n_type == old_child then
1977 n_type = new_child.as(nullable AType)
1978 return
1979 end
1980 if _n_dotdotdot == old_child then
1981 n_dotdotdot = new_child.as(nullable TDotdotdot)
1982 return
1983 end
1984 if _n_annotations == old_child then
1985 n_annotations = new_child.as(nullable AAnnotations)
1986 return
1987 end
1988 end
1989
1990 redef fun n_id=(node)
1991 do
1992 _n_id = node
1993 node.parent = self
1994 end
1995 redef fun n_type=(node)
1996 do
1997 _n_type = node
1998 if node != null then node.parent = self
1999 end
2000 redef fun n_dotdotdot=(node)
2001 do
2002 _n_dotdotdot = node
2003 if node != null then node.parent = self
2004 end
2005 redef fun n_annotations=(node)
2006 do
2007 _n_annotations = node
2008 if node != null then node.parent = self
2009 end
2010
2011
2012 redef fun visit_all(v: Visitor)
2013 do
2014 v.enter_visit(_n_id)
2015 v.enter_visit(_n_type)
2016 v.enter_visit(_n_dotdotdot)
2017 v.enter_visit(_n_annotations)
2018 end
2019 end
2020 redef class AType
2021 init init_atype (
2022 n_kwnullable: nullable TKwnullable,
2023 n_id: nullable TClassid,
2024 n_types: Collection[Object], # Should be Collection[AType]
2025 n_annotations: nullable AAnnotations
2026 )
2027 do
2028 _n_kwnullable = n_kwnullable
2029 if n_kwnullable != null then n_kwnullable.parent = self
2030 _n_id = n_id.as(not null)
2031 n_id.parent = self
2032 self.n_types.unsafe_add_all(n_types)
2033 _n_annotations = n_annotations
2034 if n_annotations != null then n_annotations.parent = self
2035 end
2036
2037 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2038 do
2039 if _n_kwnullable == old_child then
2040 n_kwnullable = new_child.as(nullable TKwnullable)
2041 return
2042 end
2043 if _n_id == old_child then
2044 n_id = new_child.as(TClassid)
2045 return
2046 end
2047 if n_types.replace_child(old_child, new_child) then return
2048 if _n_annotations == old_child then
2049 n_annotations = new_child.as(nullable AAnnotations)
2050 return
2051 end
2052 end
2053
2054 redef fun n_kwnullable=(node)
2055 do
2056 _n_kwnullable = node
2057 if node != null then node.parent = self
2058 end
2059 redef fun n_id=(node)
2060 do
2061 _n_id = node
2062 node.parent = self
2063 end
2064 redef fun n_annotations=(node)
2065 do
2066 _n_annotations = node
2067 if node != null then node.parent = self
2068 end
2069
2070
2071 redef fun visit_all(v: Visitor)
2072 do
2073 v.enter_visit(_n_kwnullable)
2074 v.enter_visit(_n_id)
2075 n_types.visit_all(v)
2076 v.enter_visit(_n_annotations)
2077 end
2078 end
2079 redef class ALabel
2080 init init_alabel (
2081 n_kwlabel: nullable TKwlabel,
2082 n_id: nullable TId
2083 )
2084 do
2085 _n_kwlabel = n_kwlabel.as(not null)
2086 n_kwlabel.parent = self
2087 _n_id = n_id
2088 if n_id != null then n_id.parent = self
2089 end
2090
2091 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2092 do
2093 if _n_kwlabel == old_child then
2094 n_kwlabel = new_child.as(TKwlabel)
2095 return
2096 end
2097 if _n_id == old_child then
2098 n_id = new_child.as(nullable TId)
2099 return
2100 end
2101 end
2102
2103 redef fun n_kwlabel=(node)
2104 do
2105 _n_kwlabel = node
2106 node.parent = self
2107 end
2108 redef fun n_id=(node)
2109 do
2110 _n_id = node
2111 if node != null then node.parent = self
2112 end
2113
2114
2115 redef fun visit_all(v: Visitor)
2116 do
2117 v.enter_visit(_n_kwlabel)
2118 v.enter_visit(_n_id)
2119 end
2120 end
2121 redef class ABlockExpr
2122 init init_ablockexpr (
2123 n_expr: Collection[Object], # Should be Collection[AExpr]
2124 n_kwend: nullable TKwend
2125 )
2126 do
2127 self.n_expr.unsafe_add_all(n_expr)
2128 _n_kwend = n_kwend
2129 if n_kwend != null then n_kwend.parent = self
2130 end
2131
2132 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2133 do
2134 if n_expr.replace_child(old_child, new_child) then return
2135 if _n_kwend == old_child then
2136 n_kwend = new_child.as(nullable TKwend)
2137 return
2138 end
2139 end
2140
2141 redef fun n_kwend=(node)
2142 do
2143 _n_kwend = node
2144 if node != null then node.parent = self
2145 end
2146
2147
2148 redef fun visit_all(v: Visitor)
2149 do
2150 n_expr.visit_all(v)
2151 v.enter_visit(_n_kwend)
2152 end
2153 end
2154 redef class AVardeclExpr
2155 init init_avardeclexpr (
2156 n_kwvar: nullable TKwvar,
2157 n_id: nullable TId,
2158 n_type: nullable AType,
2159 n_assign: nullable TAssign,
2160 n_expr: nullable AExpr,
2161 n_annotations: nullable AAnnotations
2162 )
2163 do
2164 _n_kwvar = n_kwvar.as(not null)
2165 n_kwvar.parent = self
2166 _n_id = n_id.as(not null)
2167 n_id.parent = self
2168 _n_type = n_type
2169 if n_type != null then n_type.parent = self
2170 _n_assign = n_assign
2171 if n_assign != null then n_assign.parent = self
2172 _n_expr = n_expr
2173 if n_expr != null then n_expr.parent = self
2174 _n_annotations = n_annotations
2175 if n_annotations != null then n_annotations.parent = self
2176 end
2177
2178 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2179 do
2180 if _n_kwvar == old_child then
2181 n_kwvar = new_child.as(TKwvar)
2182 return
2183 end
2184 if _n_id == old_child then
2185 n_id = new_child.as(TId)
2186 return
2187 end
2188 if _n_type == old_child then
2189 n_type = new_child.as(nullable AType)
2190 return
2191 end
2192 if _n_assign == old_child then
2193 n_assign = new_child.as(nullable TAssign)
2194 return
2195 end
2196 if _n_expr == old_child then
2197 n_expr = new_child.as(nullable AExpr)
2198 return
2199 end
2200 if _n_annotations == old_child then
2201 n_annotations = new_child.as(nullable AAnnotations)
2202 return
2203 end
2204 end
2205
2206 redef fun n_kwvar=(node)
2207 do
2208 _n_kwvar = node
2209 node.parent = self
2210 end
2211 redef fun n_id=(node)
2212 do
2213 _n_id = node
2214 node.parent = self
2215 end
2216 redef fun n_type=(node)
2217 do
2218 _n_type = node
2219 if node != null then node.parent = self
2220 end
2221 redef fun n_assign=(node)
2222 do
2223 _n_assign = node
2224 if node != null then node.parent = self
2225 end
2226 redef fun n_expr=(node)
2227 do
2228 _n_expr = node
2229 if node != null then node.parent = self
2230 end
2231 redef fun n_annotations=(node)
2232 do
2233 _n_annotations = node
2234 if node != null then node.parent = self
2235 end
2236
2237
2238 redef fun visit_all(v: Visitor)
2239 do
2240 v.enter_visit(_n_kwvar)
2241 v.enter_visit(_n_id)
2242 v.enter_visit(_n_type)
2243 v.enter_visit(_n_assign)
2244 v.enter_visit(_n_expr)
2245 v.enter_visit(_n_annotations)
2246 end
2247 end
2248 redef class AReturnExpr
2249 init init_areturnexpr (
2250 n_kwreturn: nullable TKwreturn,
2251 n_expr: nullable AExpr
2252 )
2253 do
2254 _n_kwreturn = n_kwreturn
2255 if n_kwreturn != null then n_kwreturn.parent = self
2256 _n_expr = n_expr
2257 if n_expr != null then n_expr.parent = self
2258 end
2259
2260 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2261 do
2262 if _n_kwreturn == old_child then
2263 n_kwreturn = new_child.as(nullable TKwreturn)
2264 return
2265 end
2266 if _n_expr == old_child then
2267 n_expr = new_child.as(nullable AExpr)
2268 return
2269 end
2270 end
2271
2272 redef fun n_kwreturn=(node)
2273 do
2274 _n_kwreturn = node
2275 if node != null then node.parent = self
2276 end
2277 redef fun n_expr=(node)
2278 do
2279 _n_expr = node
2280 if node != null then node.parent = self
2281 end
2282
2283
2284 redef fun visit_all(v: Visitor)
2285 do
2286 v.enter_visit(_n_kwreturn)
2287 v.enter_visit(_n_expr)
2288 end
2289 end
2290 redef class ABreakExpr
2291 init init_abreakexpr (
2292 n_kwbreak: nullable TKwbreak,
2293 n_label: nullable ALabel
2294 )
2295 do
2296 _n_kwbreak = n_kwbreak.as(not null)
2297 n_kwbreak.parent = self
2298 _n_label = n_label
2299 if n_label != null then n_label.parent = self
2300 end
2301
2302 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2303 do
2304 if _n_kwbreak == old_child then
2305 n_kwbreak = new_child.as(TKwbreak)
2306 return
2307 end
2308 if _n_label == old_child then
2309 n_label = new_child.as(nullable ALabel)
2310 return
2311 end
2312 end
2313
2314 redef fun n_kwbreak=(node)
2315 do
2316 _n_kwbreak = node
2317 node.parent = self
2318 end
2319 redef fun n_label=(node)
2320 do
2321 _n_label = node
2322 if node != null then node.parent = self
2323 end
2324
2325
2326 redef fun visit_all(v: Visitor)
2327 do
2328 v.enter_visit(_n_kwbreak)
2329 v.enter_visit(_n_label)
2330 end
2331 end
2332 redef class AAbortExpr
2333 init init_aabortexpr (
2334 n_kwabort: nullable TKwabort
2335 )
2336 do
2337 _n_kwabort = n_kwabort.as(not null)
2338 n_kwabort.parent = self
2339 end
2340
2341 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2342 do
2343 if _n_kwabort == old_child then
2344 n_kwabort = new_child.as(TKwabort)
2345 return
2346 end
2347 end
2348
2349 redef fun n_kwabort=(node)
2350 do
2351 _n_kwabort = node
2352 node.parent = self
2353 end
2354
2355
2356 redef fun visit_all(v: Visitor)
2357 do
2358 v.enter_visit(_n_kwabort)
2359 end
2360 end
2361 redef class AContinueExpr
2362 init init_acontinueexpr (
2363 n_kwcontinue: nullable TKwcontinue,
2364 n_label: nullable ALabel
2365 )
2366 do
2367 _n_kwcontinue = n_kwcontinue
2368 if n_kwcontinue != null then n_kwcontinue.parent = self
2369 _n_label = n_label
2370 if n_label != null then n_label.parent = self
2371 end
2372
2373 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2374 do
2375 if _n_kwcontinue == old_child then
2376 n_kwcontinue = new_child.as(nullable TKwcontinue)
2377 return
2378 end
2379 if _n_label == old_child then
2380 n_label = new_child.as(nullable ALabel)
2381 return
2382 end
2383 end
2384
2385 redef fun n_kwcontinue=(node)
2386 do
2387 _n_kwcontinue = node
2388 if node != null then node.parent = self
2389 end
2390 redef fun n_label=(node)
2391 do
2392 _n_label = node
2393 if node != null then node.parent = self
2394 end
2395
2396
2397 redef fun visit_all(v: Visitor)
2398 do
2399 v.enter_visit(_n_kwcontinue)
2400 v.enter_visit(_n_label)
2401 end
2402 end
2403 redef class ADoExpr
2404 init init_adoexpr (
2405 n_kwdo: nullable TKwdo,
2406 n_block: nullable AExpr,
2407 n_label: nullable ALabel
2408 )
2409 do
2410 _n_kwdo = n_kwdo.as(not null)
2411 n_kwdo.parent = self
2412 _n_block = n_block
2413 if n_block != null then n_block.parent = self
2414 _n_label = n_label
2415 if n_label != null then n_label.parent = self
2416 end
2417
2418 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2419 do
2420 if _n_kwdo == old_child then
2421 n_kwdo = new_child.as(TKwdo)
2422 return
2423 end
2424 if _n_block == old_child then
2425 n_block = new_child.as(nullable AExpr)
2426 return
2427 end
2428 if _n_label == old_child then
2429 n_label = new_child.as(nullable ALabel)
2430 return
2431 end
2432 end
2433
2434 redef fun n_kwdo=(node)
2435 do
2436 _n_kwdo = node
2437 node.parent = self
2438 end
2439 redef fun n_block=(node)
2440 do
2441 _n_block = node
2442 if node != null then node.parent = self
2443 end
2444 redef fun n_label=(node)
2445 do
2446 _n_label = node
2447 if node != null then node.parent = self
2448 end
2449
2450
2451 redef fun visit_all(v: Visitor)
2452 do
2453 v.enter_visit(_n_kwdo)
2454 v.enter_visit(_n_block)
2455 v.enter_visit(_n_label)
2456 end
2457 end
2458 redef class AIfExpr
2459 init init_aifexpr (
2460 n_kwif: nullable TKwif,
2461 n_expr: nullable AExpr,
2462 n_then: nullable AExpr,
2463 n_else: nullable AExpr
2464 )
2465 do
2466 _n_kwif = n_kwif.as(not null)
2467 n_kwif.parent = self
2468 _n_expr = n_expr.as(not null)
2469 n_expr.parent = self
2470 _n_then = n_then
2471 if n_then != null then n_then.parent = self
2472 _n_else = n_else
2473 if n_else != null then n_else.parent = self
2474 end
2475
2476 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2477 do
2478 if _n_kwif == old_child then
2479 n_kwif = new_child.as(TKwif)
2480 return
2481 end
2482 if _n_expr == old_child then
2483 n_expr = new_child.as(AExpr)
2484 return
2485 end
2486 if _n_then == old_child then
2487 n_then = new_child.as(nullable AExpr)
2488 return
2489 end
2490 if _n_else == old_child then
2491 n_else = new_child.as(nullable AExpr)
2492 return
2493 end
2494 end
2495
2496 redef fun n_kwif=(node)
2497 do
2498 _n_kwif = node
2499 node.parent = self
2500 end
2501 redef fun n_expr=(node)
2502 do
2503 _n_expr = node
2504 node.parent = self
2505 end
2506 redef fun n_then=(node)
2507 do
2508 _n_then = node
2509 if node != null then node.parent = self
2510 end
2511 redef fun n_else=(node)
2512 do
2513 _n_else = node
2514 if node != null then node.parent = self
2515 end
2516
2517
2518 redef fun visit_all(v: Visitor)
2519 do
2520 v.enter_visit(_n_kwif)
2521 v.enter_visit(_n_expr)
2522 v.enter_visit(_n_then)
2523 v.enter_visit(_n_else)
2524 end
2525 end
2526 redef class AIfexprExpr
2527 init init_aifexprexpr (
2528 n_kwif: nullable TKwif,
2529 n_expr: nullable AExpr,
2530 n_kwthen: nullable TKwthen,
2531 n_then: nullable AExpr,
2532 n_kwelse: nullable TKwelse,
2533 n_else: nullable AExpr
2534 )
2535 do
2536 _n_kwif = n_kwif.as(not null)
2537 n_kwif.parent = self
2538 _n_expr = n_expr.as(not null)
2539 n_expr.parent = self
2540 _n_kwthen = n_kwthen.as(not null)
2541 n_kwthen.parent = self
2542 _n_then = n_then.as(not null)
2543 n_then.parent = self
2544 _n_kwelse = n_kwelse.as(not null)
2545 n_kwelse.parent = self
2546 _n_else = n_else.as(not null)
2547 n_else.parent = self
2548 end
2549
2550 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2551 do
2552 if _n_kwif == old_child then
2553 n_kwif = new_child.as(TKwif)
2554 return
2555 end
2556 if _n_expr == old_child then
2557 n_expr = new_child.as(AExpr)
2558 return
2559 end
2560 if _n_kwthen == old_child then
2561 n_kwthen = new_child.as(TKwthen)
2562 return
2563 end
2564 if _n_then == old_child then
2565 n_then = new_child.as(AExpr)
2566 return
2567 end
2568 if _n_kwelse == old_child then
2569 n_kwelse = new_child.as(TKwelse)
2570 return
2571 end
2572 if _n_else == old_child then
2573 n_else = new_child.as(AExpr)
2574 return
2575 end
2576 end
2577
2578 redef fun n_kwif=(node)
2579 do
2580 _n_kwif = node
2581 node.parent = self
2582 end
2583 redef fun n_expr=(node)
2584 do
2585 _n_expr = node
2586 node.parent = self
2587 end
2588 redef fun n_kwthen=(node)
2589 do
2590 _n_kwthen = node
2591 node.parent = self
2592 end
2593 redef fun n_then=(node)
2594 do
2595 _n_then = node
2596 node.parent = self
2597 end
2598 redef fun n_kwelse=(node)
2599 do
2600 _n_kwelse = node
2601 node.parent = self
2602 end
2603 redef fun n_else=(node)
2604 do
2605 _n_else = node
2606 node.parent = self
2607 end
2608
2609
2610 redef fun visit_all(v: Visitor)
2611 do
2612 v.enter_visit(_n_kwif)
2613 v.enter_visit(_n_expr)
2614 v.enter_visit(_n_kwthen)
2615 v.enter_visit(_n_then)
2616 v.enter_visit(_n_kwelse)
2617 v.enter_visit(_n_else)
2618 end
2619 end
2620 redef class AWhileExpr
2621 init init_awhileexpr (
2622 n_kwwhile: nullable TKwwhile,
2623 n_expr: nullable AExpr,
2624 n_kwdo: nullable TKwdo,
2625 n_block: nullable AExpr,
2626 n_label: nullable ALabel
2627 )
2628 do
2629 _n_kwwhile = n_kwwhile.as(not null)
2630 n_kwwhile.parent = self
2631 _n_expr = n_expr.as(not null)
2632 n_expr.parent = self
2633 _n_kwdo = n_kwdo.as(not null)
2634 n_kwdo.parent = self
2635 _n_block = n_block
2636 if n_block != null then n_block.parent = self
2637 _n_label = n_label
2638 if n_label != null then n_label.parent = self
2639 end
2640
2641 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2642 do
2643 if _n_kwwhile == old_child then
2644 n_kwwhile = new_child.as(TKwwhile)
2645 return
2646 end
2647 if _n_expr == old_child then
2648 n_expr = new_child.as(AExpr)
2649 return
2650 end
2651 if _n_kwdo == old_child then
2652 n_kwdo = new_child.as(TKwdo)
2653 return
2654 end
2655 if _n_block == old_child then
2656 n_block = new_child.as(nullable AExpr)
2657 return
2658 end
2659 if _n_label == old_child then
2660 n_label = new_child.as(nullable ALabel)
2661 return
2662 end
2663 end
2664
2665 redef fun n_kwwhile=(node)
2666 do
2667 _n_kwwhile = node
2668 node.parent = self
2669 end
2670 redef fun n_expr=(node)
2671 do
2672 _n_expr = node
2673 node.parent = self
2674 end
2675 redef fun n_kwdo=(node)
2676 do
2677 _n_kwdo = node
2678 node.parent = self
2679 end
2680 redef fun n_block=(node)
2681 do
2682 _n_block = node
2683 if node != null then node.parent = self
2684 end
2685 redef fun n_label=(node)
2686 do
2687 _n_label = node
2688 if node != null then node.parent = self
2689 end
2690
2691
2692 redef fun visit_all(v: Visitor)
2693 do
2694 v.enter_visit(_n_kwwhile)
2695 v.enter_visit(_n_expr)
2696 v.enter_visit(_n_kwdo)
2697 v.enter_visit(_n_block)
2698 v.enter_visit(_n_label)
2699 end
2700 end
2701 redef class ALoopExpr
2702 init init_aloopexpr (
2703 n_kwloop: nullable TKwloop,
2704 n_block: nullable AExpr,
2705 n_label: nullable ALabel
2706 )
2707 do
2708 _n_kwloop = n_kwloop.as(not null)
2709 n_kwloop.parent = self
2710 _n_block = n_block
2711 if n_block != null then n_block.parent = self
2712 _n_label = n_label
2713 if n_label != null then n_label.parent = self
2714 end
2715
2716 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2717 do
2718 if _n_kwloop == old_child then
2719 n_kwloop = new_child.as(TKwloop)
2720 return
2721 end
2722 if _n_block == old_child then
2723 n_block = new_child.as(nullable AExpr)
2724 return
2725 end
2726 if _n_label == old_child then
2727 n_label = new_child.as(nullable ALabel)
2728 return
2729 end
2730 end
2731
2732 redef fun n_kwloop=(node)
2733 do
2734 _n_kwloop = node
2735 node.parent = self
2736 end
2737 redef fun n_block=(node)
2738 do
2739 _n_block = node
2740 if node != null then node.parent = self
2741 end
2742 redef fun n_label=(node)
2743 do
2744 _n_label = node
2745 if node != null then node.parent = self
2746 end
2747
2748
2749 redef fun visit_all(v: Visitor)
2750 do
2751 v.enter_visit(_n_kwloop)
2752 v.enter_visit(_n_block)
2753 v.enter_visit(_n_label)
2754 end
2755 end
2756 redef class AForExpr
2757 init init_aforexpr (
2758 n_kwfor: nullable TKwfor,
2759 n_ids: Collection[Object], # Should be Collection[TId]
2760 n_expr: nullable AExpr,
2761 n_kwdo: nullable TKwdo,
2762 n_block: nullable AExpr,
2763 n_label: nullable ALabel
2764 )
2765 do
2766 _n_kwfor = n_kwfor.as(not null)
2767 n_kwfor.parent = self
2768 self.n_ids.unsafe_add_all(n_ids)
2769 _n_expr = n_expr.as(not null)
2770 n_expr.parent = self
2771 _n_kwdo = n_kwdo.as(not null)
2772 n_kwdo.parent = self
2773 _n_block = n_block
2774 if n_block != null then n_block.parent = self
2775 _n_label = n_label
2776 if n_label != null then n_label.parent = self
2777 end
2778
2779 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2780 do
2781 if _n_kwfor == old_child then
2782 n_kwfor = new_child.as(TKwfor)
2783 return
2784 end
2785 if n_ids.replace_child(old_child, new_child) then return
2786 if _n_expr == old_child then
2787 n_expr = new_child.as(AExpr)
2788 return
2789 end
2790 if _n_kwdo == old_child then
2791 n_kwdo = new_child.as(TKwdo)
2792 return
2793 end
2794 if _n_block == old_child then
2795 n_block = new_child.as(nullable AExpr)
2796 return
2797 end
2798 if _n_label == old_child then
2799 n_label = new_child.as(nullable ALabel)
2800 return
2801 end
2802 end
2803
2804 redef fun n_kwfor=(node)
2805 do
2806 _n_kwfor = node
2807 node.parent = self
2808 end
2809 redef fun n_expr=(node)
2810 do
2811 _n_expr = node
2812 node.parent = self
2813 end
2814 redef fun n_kwdo=(node)
2815 do
2816 _n_kwdo = node
2817 node.parent = self
2818 end
2819 redef fun n_block=(node)
2820 do
2821 _n_block = node
2822 if node != null then node.parent = self
2823 end
2824 redef fun n_label=(node)
2825 do
2826 _n_label = node
2827 if node != null then node.parent = self
2828 end
2829
2830
2831 redef fun visit_all(v: Visitor)
2832 do
2833 v.enter_visit(_n_kwfor)
2834 n_ids.visit_all(v)
2835 v.enter_visit(_n_expr)
2836 v.enter_visit(_n_kwdo)
2837 v.enter_visit(_n_block)
2838 v.enter_visit(_n_label)
2839 end
2840 end
2841 redef class AAssertExpr
2842 init init_aassertexpr (
2843 n_kwassert: nullable TKwassert,
2844 n_id: nullable TId,
2845 n_expr: nullable AExpr,
2846 n_else: nullable AExpr
2847 )
2848 do
2849 _n_kwassert = n_kwassert.as(not null)
2850 n_kwassert.parent = self
2851 _n_id = n_id
2852 if n_id != null then n_id.parent = self
2853 _n_expr = n_expr.as(not null)
2854 n_expr.parent = self
2855 _n_else = n_else
2856 if n_else != null then n_else.parent = self
2857 end
2858
2859 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2860 do
2861 if _n_kwassert == old_child then
2862 n_kwassert = new_child.as(TKwassert)
2863 return
2864 end
2865 if _n_id == old_child then
2866 n_id = new_child.as(nullable TId)
2867 return
2868 end
2869 if _n_expr == old_child then
2870 n_expr = new_child.as(AExpr)
2871 return
2872 end
2873 if _n_else == old_child then
2874 n_else = new_child.as(nullable AExpr)
2875 return
2876 end
2877 end
2878
2879 redef fun n_kwassert=(node)
2880 do
2881 _n_kwassert = node
2882 node.parent = self
2883 end
2884 redef fun n_id=(node)
2885 do
2886 _n_id = node
2887 if node != null then node.parent = self
2888 end
2889 redef fun n_expr=(node)
2890 do
2891 _n_expr = node
2892 node.parent = self
2893 end
2894 redef fun n_else=(node)
2895 do
2896 _n_else = node
2897 if node != null then node.parent = self
2898 end
2899
2900
2901 redef fun visit_all(v: Visitor)
2902 do
2903 v.enter_visit(_n_kwassert)
2904 v.enter_visit(_n_id)
2905 v.enter_visit(_n_expr)
2906 v.enter_visit(_n_else)
2907 end
2908 end
2909 redef class AOnceExpr
2910 init init_aonceexpr (
2911 n_kwonce: nullable TKwonce,
2912 n_expr: nullable AExpr
2913 )
2914 do
2915 _n_kwonce = n_kwonce.as(not null)
2916 n_kwonce.parent = self
2917 _n_expr = n_expr.as(not null)
2918 n_expr.parent = self
2919 end
2920
2921 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2922 do
2923 if _n_kwonce == old_child then
2924 n_kwonce = new_child.as(TKwonce)
2925 return
2926 end
2927 if _n_expr == old_child then
2928 n_expr = new_child.as(AExpr)
2929 return
2930 end
2931 end
2932
2933 redef fun n_kwonce=(node)
2934 do
2935 _n_kwonce = node
2936 node.parent = self
2937 end
2938 redef fun n_expr=(node)
2939 do
2940 _n_expr = node
2941 node.parent = self
2942 end
2943
2944
2945 redef fun visit_all(v: Visitor)
2946 do
2947 v.enter_visit(_n_kwonce)
2948 v.enter_visit(_n_expr)
2949 end
2950 end
2951 redef class ASendExpr
2952 init init_asendexpr (
2953 n_expr: nullable AExpr
2954 )
2955 do
2956 _n_expr = n_expr.as(not null)
2957 n_expr.parent = self
2958 end
2959
2960 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2961 do
2962 if _n_expr == old_child then
2963 n_expr = new_child.as(AExpr)
2964 return
2965 end
2966 end
2967
2968 redef fun n_expr=(node)
2969 do
2970 _n_expr = node
2971 node.parent = self
2972 end
2973
2974
2975 redef fun visit_all(v: Visitor)
2976 do
2977 v.enter_visit(_n_expr)
2978 end
2979 end
2980 redef class ABinopExpr
2981 init init_abinopexpr (
2982 n_expr: nullable AExpr,
2983 n_expr2: nullable AExpr
2984 )
2985 do
2986 _n_expr = n_expr.as(not null)
2987 n_expr.parent = self
2988 _n_expr2 = n_expr2.as(not null)
2989 n_expr2.parent = self
2990 end
2991
2992 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
2993 do
2994 if _n_expr == old_child then
2995 n_expr = new_child.as(AExpr)
2996 return
2997 end
2998 if _n_expr2 == old_child then
2999 n_expr2 = new_child.as(AExpr)
3000 return
3001 end
3002 end
3003
3004 redef fun n_expr=(node)
3005 do
3006 _n_expr = node
3007 node.parent = self
3008 end
3009 redef fun n_expr2=(node)
3010 do
3011 _n_expr2 = node
3012 node.parent = self
3013 end
3014
3015
3016 redef fun visit_all(v: Visitor)
3017 do
3018 v.enter_visit(_n_expr)
3019 v.enter_visit(_n_expr2)
3020 end
3021 end
3022 redef class AOrExpr
3023 init init_aorexpr (
3024 n_expr: nullable AExpr,
3025 n_expr2: nullable AExpr
3026 )
3027 do
3028 _n_expr = n_expr.as(not null)
3029 n_expr.parent = self
3030 _n_expr2 = n_expr2.as(not null)
3031 n_expr2.parent = self
3032 end
3033
3034 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3035 do
3036 if _n_expr == old_child then
3037 n_expr = new_child.as(AExpr)
3038 return
3039 end
3040 if _n_expr2 == old_child then
3041 n_expr2 = new_child.as(AExpr)
3042 return
3043 end
3044 end
3045
3046 redef fun n_expr=(node)
3047 do
3048 _n_expr = node
3049 node.parent = self
3050 end
3051 redef fun n_expr2=(node)
3052 do
3053 _n_expr2 = node
3054 node.parent = self
3055 end
3056
3057
3058 redef fun visit_all(v: Visitor)
3059 do
3060 v.enter_visit(_n_expr)
3061 v.enter_visit(_n_expr2)
3062 end
3063 end
3064 redef class AAndExpr
3065 init init_aandexpr (
3066 n_expr: nullable AExpr,
3067 n_expr2: nullable AExpr
3068 )
3069 do
3070 _n_expr = n_expr.as(not null)
3071 n_expr.parent = self
3072 _n_expr2 = n_expr2.as(not null)
3073 n_expr2.parent = self
3074 end
3075
3076 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3077 do
3078 if _n_expr == old_child then
3079 n_expr = new_child.as(AExpr)
3080 return
3081 end
3082 if _n_expr2 == old_child then
3083 n_expr2 = new_child.as(AExpr)
3084 return
3085 end
3086 end
3087
3088 redef fun n_expr=(node)
3089 do
3090 _n_expr = node
3091 node.parent = self
3092 end
3093 redef fun n_expr2=(node)
3094 do
3095 _n_expr2 = node
3096 node.parent = self
3097 end
3098
3099
3100 redef fun visit_all(v: Visitor)
3101 do
3102 v.enter_visit(_n_expr)
3103 v.enter_visit(_n_expr2)
3104 end
3105 end
3106 redef class AOrElseExpr
3107 init init_aorelseexpr (
3108 n_expr: nullable AExpr,
3109 n_expr2: nullable AExpr
3110 )
3111 do
3112 _n_expr = n_expr.as(not null)
3113 n_expr.parent = self
3114 _n_expr2 = n_expr2.as(not null)
3115 n_expr2.parent = self
3116 end
3117
3118 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3119 do
3120 if _n_expr == old_child then
3121 n_expr = new_child.as(AExpr)
3122 return
3123 end
3124 if _n_expr2 == old_child then
3125 n_expr2 = new_child.as(AExpr)
3126 return
3127 end
3128 end
3129
3130 redef fun n_expr=(node)
3131 do
3132 _n_expr = node
3133 node.parent = self
3134 end
3135 redef fun n_expr2=(node)
3136 do
3137 _n_expr2 = node
3138 node.parent = self
3139 end
3140
3141
3142 redef fun visit_all(v: Visitor)
3143 do
3144 v.enter_visit(_n_expr)
3145 v.enter_visit(_n_expr2)
3146 end
3147 end
3148 redef class AImpliesExpr
3149 init init_aimpliesexpr (
3150 n_expr: nullable AExpr,
3151 n_expr2: nullable AExpr
3152 )
3153 do
3154 _n_expr = n_expr.as(not null)
3155 n_expr.parent = self
3156 _n_expr2 = n_expr2.as(not null)
3157 n_expr2.parent = self
3158 end
3159
3160 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3161 do
3162 if _n_expr == old_child then
3163 n_expr = new_child.as(AExpr)
3164 return
3165 end
3166 if _n_expr2 == old_child then
3167 n_expr2 = new_child.as(AExpr)
3168 return
3169 end
3170 end
3171
3172 redef fun n_expr=(node)
3173 do
3174 _n_expr = node
3175 node.parent = self
3176 end
3177 redef fun n_expr2=(node)
3178 do
3179 _n_expr2 = node
3180 node.parent = self
3181 end
3182
3183
3184 redef fun visit_all(v: Visitor)
3185 do
3186 v.enter_visit(_n_expr)
3187 v.enter_visit(_n_expr2)
3188 end
3189 end
3190 redef class ANotExpr
3191 init init_anotexpr (
3192 n_kwnot: nullable TKwnot,
3193 n_expr: nullable AExpr
3194 )
3195 do
3196 _n_kwnot = n_kwnot.as(not null)
3197 n_kwnot.parent = self
3198 _n_expr = n_expr.as(not null)
3199 n_expr.parent = self
3200 end
3201
3202 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3203 do
3204 if _n_kwnot == old_child then
3205 n_kwnot = new_child.as(TKwnot)
3206 return
3207 end
3208 if _n_expr == old_child then
3209 n_expr = new_child.as(AExpr)
3210 return
3211 end
3212 end
3213
3214 redef fun n_kwnot=(node)
3215 do
3216 _n_kwnot = node
3217 node.parent = self
3218 end
3219 redef fun n_expr=(node)
3220 do
3221 _n_expr = node
3222 node.parent = self
3223 end
3224
3225
3226 redef fun visit_all(v: Visitor)
3227 do
3228 v.enter_visit(_n_kwnot)
3229 v.enter_visit(_n_expr)
3230 end
3231 end
3232 redef class AEqExpr
3233 init init_aeqexpr (
3234 n_expr: nullable AExpr,
3235 n_expr2: nullable AExpr
3236 )
3237 do
3238 _n_expr = n_expr.as(not null)
3239 n_expr.parent = self
3240 _n_expr2 = n_expr2.as(not null)
3241 n_expr2.parent = self
3242 end
3243
3244 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3245 do
3246 if _n_expr == old_child then
3247 n_expr = new_child.as(AExpr)
3248 return
3249 end
3250 if _n_expr2 == old_child then
3251 n_expr2 = new_child.as(AExpr)
3252 return
3253 end
3254 end
3255
3256 redef fun n_expr=(node)
3257 do
3258 _n_expr = node
3259 node.parent = self
3260 end
3261 redef fun n_expr2=(node)
3262 do
3263 _n_expr2 = node
3264 node.parent = self
3265 end
3266
3267
3268 redef fun visit_all(v: Visitor)
3269 do
3270 v.enter_visit(_n_expr)
3271 v.enter_visit(_n_expr2)
3272 end
3273 end
3274 redef class ANeExpr
3275 init init_aneexpr (
3276 n_expr: nullable AExpr,
3277 n_expr2: nullable AExpr
3278 )
3279 do
3280 _n_expr = n_expr.as(not null)
3281 n_expr.parent = self
3282 _n_expr2 = n_expr2.as(not null)
3283 n_expr2.parent = self
3284 end
3285
3286 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3287 do
3288 if _n_expr == old_child then
3289 n_expr = new_child.as(AExpr)
3290 return
3291 end
3292 if _n_expr2 == old_child then
3293 n_expr2 = new_child.as(AExpr)
3294 return
3295 end
3296 end
3297
3298 redef fun n_expr=(node)
3299 do
3300 _n_expr = node
3301 node.parent = self
3302 end
3303 redef fun n_expr2=(node)
3304 do
3305 _n_expr2 = node
3306 node.parent = self
3307 end
3308
3309
3310 redef fun visit_all(v: Visitor)
3311 do
3312 v.enter_visit(_n_expr)
3313 v.enter_visit(_n_expr2)
3314 end
3315 end
3316 redef class ALtExpr
3317 init init_altexpr (
3318 n_expr: nullable AExpr,
3319 n_expr2: nullable AExpr
3320 )
3321 do
3322 _n_expr = n_expr.as(not null)
3323 n_expr.parent = self
3324 _n_expr2 = n_expr2.as(not null)
3325 n_expr2.parent = self
3326 end
3327
3328 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3329 do
3330 if _n_expr == old_child then
3331 n_expr = new_child.as(AExpr)
3332 return
3333 end
3334 if _n_expr2 == old_child then
3335 n_expr2 = new_child.as(AExpr)
3336 return
3337 end
3338 end
3339
3340 redef fun n_expr=(node)
3341 do
3342 _n_expr = node
3343 node.parent = self
3344 end
3345 redef fun n_expr2=(node)
3346 do
3347 _n_expr2 = node
3348 node.parent = self
3349 end
3350
3351
3352 redef fun visit_all(v: Visitor)
3353 do
3354 v.enter_visit(_n_expr)
3355 v.enter_visit(_n_expr2)
3356 end
3357 end
3358 redef class ALeExpr
3359 init init_aleexpr (
3360 n_expr: nullable AExpr,
3361 n_expr2: nullable AExpr
3362 )
3363 do
3364 _n_expr = n_expr.as(not null)
3365 n_expr.parent = self
3366 _n_expr2 = n_expr2.as(not null)
3367 n_expr2.parent = self
3368 end
3369
3370 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3371 do
3372 if _n_expr == old_child then
3373 n_expr = new_child.as(AExpr)
3374 return
3375 end
3376 if _n_expr2 == old_child then
3377 n_expr2 = new_child.as(AExpr)
3378 return
3379 end
3380 end
3381
3382 redef fun n_expr=(node)
3383 do
3384 _n_expr = node
3385 node.parent = self
3386 end
3387 redef fun n_expr2=(node)
3388 do
3389 _n_expr2 = node
3390 node.parent = self
3391 end
3392
3393
3394 redef fun visit_all(v: Visitor)
3395 do
3396 v.enter_visit(_n_expr)
3397 v.enter_visit(_n_expr2)
3398 end
3399 end
3400 redef class ALlExpr
3401 init init_allexpr (
3402 n_expr: nullable AExpr,
3403 n_expr2: nullable AExpr
3404 )
3405 do
3406 _n_expr = n_expr.as(not null)
3407 n_expr.parent = self
3408 _n_expr2 = n_expr2.as(not null)
3409 n_expr2.parent = self
3410 end
3411
3412 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3413 do
3414 if _n_expr == old_child then
3415 n_expr = new_child.as(AExpr)
3416 return
3417 end
3418 if _n_expr2 == old_child then
3419 n_expr2 = new_child.as(AExpr)
3420 return
3421 end
3422 end
3423
3424 redef fun n_expr=(node)
3425 do
3426 _n_expr = node
3427 node.parent = self
3428 end
3429 redef fun n_expr2=(node)
3430 do
3431 _n_expr2 = node
3432 node.parent = self
3433 end
3434
3435
3436 redef fun visit_all(v: Visitor)
3437 do
3438 v.enter_visit(_n_expr)
3439 v.enter_visit(_n_expr2)
3440 end
3441 end
3442 redef class AGtExpr
3443 init init_agtexpr (
3444 n_expr: nullable AExpr,
3445 n_expr2: nullable AExpr
3446 )
3447 do
3448 _n_expr = n_expr.as(not null)
3449 n_expr.parent = self
3450 _n_expr2 = n_expr2.as(not null)
3451 n_expr2.parent = self
3452 end
3453
3454 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3455 do
3456 if _n_expr == old_child then
3457 n_expr = new_child.as(AExpr)
3458 return
3459 end
3460 if _n_expr2 == old_child then
3461 n_expr2 = new_child.as(AExpr)
3462 return
3463 end
3464 end
3465
3466 redef fun n_expr=(node)
3467 do
3468 _n_expr = node
3469 node.parent = self
3470 end
3471 redef fun n_expr2=(node)
3472 do
3473 _n_expr2 = node
3474 node.parent = self
3475 end
3476
3477
3478 redef fun visit_all(v: Visitor)
3479 do
3480 v.enter_visit(_n_expr)
3481 v.enter_visit(_n_expr2)
3482 end
3483 end
3484 redef class AGeExpr
3485 init init_ageexpr (
3486 n_expr: nullable AExpr,
3487 n_expr2: nullable AExpr
3488 )
3489 do
3490 _n_expr = n_expr.as(not null)
3491 n_expr.parent = self
3492 _n_expr2 = n_expr2.as(not null)
3493 n_expr2.parent = self
3494 end
3495
3496 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3497 do
3498 if _n_expr == old_child then
3499 n_expr = new_child.as(AExpr)
3500 return
3501 end
3502 if _n_expr2 == old_child then
3503 n_expr2 = new_child.as(AExpr)
3504 return
3505 end
3506 end
3507
3508 redef fun n_expr=(node)
3509 do
3510 _n_expr = node
3511 node.parent = self
3512 end
3513 redef fun n_expr2=(node)
3514 do
3515 _n_expr2 = node
3516 node.parent = self
3517 end
3518
3519
3520 redef fun visit_all(v: Visitor)
3521 do
3522 v.enter_visit(_n_expr)
3523 v.enter_visit(_n_expr2)
3524 end
3525 end
3526 redef class AGgExpr
3527 init init_aggexpr (
3528 n_expr: nullable AExpr,
3529 n_expr2: nullable AExpr
3530 )
3531 do
3532 _n_expr = n_expr.as(not null)
3533 n_expr.parent = self
3534 _n_expr2 = n_expr2.as(not null)
3535 n_expr2.parent = self
3536 end
3537
3538 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3539 do
3540 if _n_expr == old_child then
3541 n_expr = new_child.as(AExpr)
3542 return
3543 end
3544 if _n_expr2 == old_child then
3545 n_expr2 = new_child.as(AExpr)
3546 return
3547 end
3548 end
3549
3550 redef fun n_expr=(node)
3551 do
3552 _n_expr = node
3553 node.parent = self
3554 end
3555 redef fun n_expr2=(node)
3556 do
3557 _n_expr2 = node
3558 node.parent = self
3559 end
3560
3561
3562 redef fun visit_all(v: Visitor)
3563 do
3564 v.enter_visit(_n_expr)
3565 v.enter_visit(_n_expr2)
3566 end
3567 end
3568 redef class AIsaExpr
3569 init init_aisaexpr (
3570 n_expr: nullable AExpr,
3571 n_type: nullable AType
3572 )
3573 do
3574 _n_expr = n_expr.as(not null)
3575 n_expr.parent = self
3576 _n_type = n_type.as(not null)
3577 n_type.parent = self
3578 end
3579
3580 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3581 do
3582 if _n_expr == old_child then
3583 n_expr = new_child.as(AExpr)
3584 return
3585 end
3586 if _n_type == old_child then
3587 n_type = new_child.as(AType)
3588 return
3589 end
3590 end
3591
3592 redef fun n_expr=(node)
3593 do
3594 _n_expr = node
3595 node.parent = self
3596 end
3597 redef fun n_type=(node)
3598 do
3599 _n_type = node
3600 node.parent = self
3601 end
3602
3603
3604 redef fun visit_all(v: Visitor)
3605 do
3606 v.enter_visit(_n_expr)
3607 v.enter_visit(_n_type)
3608 end
3609 end
3610 redef class APlusExpr
3611 init init_aplusexpr (
3612 n_expr: nullable AExpr,
3613 n_expr2: nullable AExpr
3614 )
3615 do
3616 _n_expr = n_expr.as(not null)
3617 n_expr.parent = self
3618 _n_expr2 = n_expr2.as(not null)
3619 n_expr2.parent = self
3620 end
3621
3622 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3623 do
3624 if _n_expr == old_child then
3625 n_expr = new_child.as(AExpr)
3626 return
3627 end
3628 if _n_expr2 == old_child then
3629 n_expr2 = new_child.as(AExpr)
3630 return
3631 end
3632 end
3633
3634 redef fun n_expr=(node)
3635 do
3636 _n_expr = node
3637 node.parent = self
3638 end
3639 redef fun n_expr2=(node)
3640 do
3641 _n_expr2 = node
3642 node.parent = self
3643 end
3644
3645
3646 redef fun visit_all(v: Visitor)
3647 do
3648 v.enter_visit(_n_expr)
3649 v.enter_visit(_n_expr2)
3650 end
3651 end
3652 redef class AMinusExpr
3653 init init_aminusexpr (
3654 n_expr: nullable AExpr,
3655 n_expr2: nullable AExpr
3656 )
3657 do
3658 _n_expr = n_expr.as(not null)
3659 n_expr.parent = self
3660 _n_expr2 = n_expr2.as(not null)
3661 n_expr2.parent = self
3662 end
3663
3664 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3665 do
3666 if _n_expr == old_child then
3667 n_expr = new_child.as(AExpr)
3668 return
3669 end
3670 if _n_expr2 == old_child then
3671 n_expr2 = new_child.as(AExpr)
3672 return
3673 end
3674 end
3675
3676 redef fun n_expr=(node)
3677 do
3678 _n_expr = node
3679 node.parent = self
3680 end
3681 redef fun n_expr2=(node)
3682 do
3683 _n_expr2 = node
3684 node.parent = self
3685 end
3686
3687
3688 redef fun visit_all(v: Visitor)
3689 do
3690 v.enter_visit(_n_expr)
3691 v.enter_visit(_n_expr2)
3692 end
3693 end
3694 redef class AStarshipExpr
3695 init init_astarshipexpr (
3696 n_expr: nullable AExpr,
3697 n_expr2: nullable AExpr
3698 )
3699 do
3700 _n_expr = n_expr.as(not null)
3701 n_expr.parent = self
3702 _n_expr2 = n_expr2.as(not null)
3703 n_expr2.parent = self
3704 end
3705
3706 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3707 do
3708 if _n_expr == old_child then
3709 n_expr = new_child.as(AExpr)
3710 return
3711 end
3712 if _n_expr2 == old_child then
3713 n_expr2 = new_child.as(AExpr)
3714 return
3715 end
3716 end
3717
3718 redef fun n_expr=(node)
3719 do
3720 _n_expr = node
3721 node.parent = self
3722 end
3723 redef fun n_expr2=(node)
3724 do
3725 _n_expr2 = node
3726 node.parent = self
3727 end
3728
3729
3730 redef fun visit_all(v: Visitor)
3731 do
3732 v.enter_visit(_n_expr)
3733 v.enter_visit(_n_expr2)
3734 end
3735 end
3736 redef class AStarExpr
3737 init init_astarexpr (
3738 n_expr: nullable AExpr,
3739 n_expr2: nullable AExpr
3740 )
3741 do
3742 _n_expr = n_expr.as(not null)
3743 n_expr.parent = self
3744 _n_expr2 = n_expr2.as(not null)
3745 n_expr2.parent = self
3746 end
3747
3748 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3749 do
3750 if _n_expr == old_child then
3751 n_expr = new_child.as(AExpr)
3752 return
3753 end
3754 if _n_expr2 == old_child then
3755 n_expr2 = new_child.as(AExpr)
3756 return
3757 end
3758 end
3759
3760 redef fun n_expr=(node)
3761 do
3762 _n_expr = node
3763 node.parent = self
3764 end
3765 redef fun n_expr2=(node)
3766 do
3767 _n_expr2 = node
3768 node.parent = self
3769 end
3770
3771
3772 redef fun visit_all(v: Visitor)
3773 do
3774 v.enter_visit(_n_expr)
3775 v.enter_visit(_n_expr2)
3776 end
3777 end
3778 redef class AStarstarExpr
3779 init init_astarstarexpr (
3780 n_expr: nullable AExpr,
3781 n_expr2: nullable AExpr
3782 )
3783 do
3784 _n_expr = n_expr.as(not null)
3785 n_expr.parent = self
3786 _n_expr2 = n_expr2.as(not null)
3787 n_expr2.parent = self
3788 end
3789
3790 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3791 do
3792 if _n_expr == old_child then
3793 n_expr = new_child.as(AExpr)
3794 return
3795 end
3796 if _n_expr2 == old_child then
3797 n_expr2 = new_child.as(AExpr)
3798 return
3799 end
3800 end
3801
3802 redef fun n_expr=(node)
3803 do
3804 _n_expr = node
3805 node.parent = self
3806 end
3807 redef fun n_expr2=(node)
3808 do
3809 _n_expr2 = node
3810 node.parent = self
3811 end
3812
3813
3814 redef fun visit_all(v: Visitor)
3815 do
3816 v.enter_visit(_n_expr)
3817 v.enter_visit(_n_expr2)
3818 end
3819 end
3820 redef class ASlashExpr
3821 init init_aslashexpr (
3822 n_expr: nullable AExpr,
3823 n_expr2: nullable AExpr
3824 )
3825 do
3826 _n_expr = n_expr.as(not null)
3827 n_expr.parent = self
3828 _n_expr2 = n_expr2.as(not null)
3829 n_expr2.parent = self
3830 end
3831
3832 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3833 do
3834 if _n_expr == old_child then
3835 n_expr = new_child.as(AExpr)
3836 return
3837 end
3838 if _n_expr2 == old_child then
3839 n_expr2 = new_child.as(AExpr)
3840 return
3841 end
3842 end
3843
3844 redef fun n_expr=(node)
3845 do
3846 _n_expr = node
3847 node.parent = self
3848 end
3849 redef fun n_expr2=(node)
3850 do
3851 _n_expr2 = node
3852 node.parent = self
3853 end
3854
3855
3856 redef fun visit_all(v: Visitor)
3857 do
3858 v.enter_visit(_n_expr)
3859 v.enter_visit(_n_expr2)
3860 end
3861 end
3862 redef class APercentExpr
3863 init init_apercentexpr (
3864 n_expr: nullable AExpr,
3865 n_expr2: nullable AExpr
3866 )
3867 do
3868 _n_expr = n_expr.as(not null)
3869 n_expr.parent = self
3870 _n_expr2 = n_expr2.as(not null)
3871 n_expr2.parent = self
3872 end
3873
3874 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3875 do
3876 if _n_expr == old_child then
3877 n_expr = new_child.as(AExpr)
3878 return
3879 end
3880 if _n_expr2 == old_child then
3881 n_expr2 = new_child.as(AExpr)
3882 return
3883 end
3884 end
3885
3886 redef fun n_expr=(node)
3887 do
3888 _n_expr = node
3889 node.parent = self
3890 end
3891 redef fun n_expr2=(node)
3892 do
3893 _n_expr2 = node
3894 node.parent = self
3895 end
3896
3897
3898 redef fun visit_all(v: Visitor)
3899 do
3900 v.enter_visit(_n_expr)
3901 v.enter_visit(_n_expr2)
3902 end
3903 end
3904 redef class AUminusExpr
3905 init init_auminusexpr (
3906 n_minus: nullable TMinus,
3907 n_expr: nullable AExpr
3908 )
3909 do
3910 _n_minus = n_minus.as(not null)
3911 n_minus.parent = self
3912 _n_expr = n_expr.as(not null)
3913 n_expr.parent = self
3914 end
3915
3916 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3917 do
3918 if _n_minus == old_child then
3919 n_minus = new_child.as(TMinus)
3920 return
3921 end
3922 if _n_expr == old_child then
3923 n_expr = new_child.as(AExpr)
3924 return
3925 end
3926 end
3927
3928 redef fun n_minus=(node)
3929 do
3930 _n_minus = node
3931 node.parent = self
3932 end
3933 redef fun n_expr=(node)
3934 do
3935 _n_expr = node
3936 node.parent = self
3937 end
3938
3939
3940 redef fun visit_all(v: Visitor)
3941 do
3942 v.enter_visit(_n_minus)
3943 v.enter_visit(_n_expr)
3944 end
3945 end
3946 redef class ANewExpr
3947 init init_anewexpr (
3948 n_kwnew: nullable TKwnew,
3949 n_type: nullable AType,
3950 n_id: nullable TId,
3951 n_args: nullable AExprs
3952 )
3953 do
3954 _n_kwnew = n_kwnew.as(not null)
3955 n_kwnew.parent = self
3956 _n_type = n_type.as(not null)
3957 n_type.parent = self
3958 _n_id = n_id
3959 if n_id != null then n_id.parent = self
3960 _n_args = n_args.as(not null)
3961 n_args.parent = self
3962 end
3963
3964 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
3965 do
3966 if _n_kwnew == old_child then
3967 n_kwnew = new_child.as(TKwnew)
3968 return
3969 end
3970 if _n_type == old_child then
3971 n_type = new_child.as(AType)
3972 return
3973 end
3974 if _n_id == old_child then
3975 n_id = new_child.as(nullable TId)
3976 return
3977 end
3978 if _n_args == old_child then
3979 n_args = new_child.as(AExprs)
3980 return
3981 end
3982 end
3983
3984 redef fun n_kwnew=(node)
3985 do
3986 _n_kwnew = node
3987 node.parent = self
3988 end
3989 redef fun n_type=(node)
3990 do
3991 _n_type = node
3992 node.parent = self
3993 end
3994 redef fun n_id=(node)
3995 do
3996 _n_id = node
3997 if node != null then node.parent = self
3998 end
3999 redef fun n_args=(node)
4000 do
4001 _n_args = node
4002 node.parent = self
4003 end
4004
4005
4006 redef fun visit_all(v: Visitor)
4007 do
4008 v.enter_visit(_n_kwnew)
4009 v.enter_visit(_n_type)
4010 v.enter_visit(_n_id)
4011 v.enter_visit(_n_args)
4012 end
4013 end
4014 redef class AAttrExpr
4015 init init_aattrexpr (
4016 n_expr: nullable AExpr,
4017 n_id: nullable TAttrid
4018 )
4019 do
4020 _n_expr = n_expr.as(not null)
4021 n_expr.parent = self
4022 _n_id = n_id.as(not null)
4023 n_id.parent = self
4024 end
4025
4026 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4027 do
4028 if _n_expr == old_child then
4029 n_expr = new_child.as(AExpr)
4030 return
4031 end
4032 if _n_id == old_child then
4033 n_id = new_child.as(TAttrid)
4034 return
4035 end
4036 end
4037
4038 redef fun n_expr=(node)
4039 do
4040 _n_expr = node
4041 node.parent = self
4042 end
4043 redef fun n_id=(node)
4044 do
4045 _n_id = node
4046 node.parent = self
4047 end
4048
4049
4050 redef fun visit_all(v: Visitor)
4051 do
4052 v.enter_visit(_n_expr)
4053 v.enter_visit(_n_id)
4054 end
4055 end
4056 redef class AAttrAssignExpr
4057 init init_aattrassignexpr (
4058 n_expr: nullable AExpr,
4059 n_id: nullable TAttrid,
4060 n_assign: nullable TAssign,
4061 n_value: nullable AExpr
4062 )
4063 do
4064 _n_expr = n_expr.as(not null)
4065 n_expr.parent = self
4066 _n_id = n_id.as(not null)
4067 n_id.parent = self
4068 _n_assign = n_assign.as(not null)
4069 n_assign.parent = self
4070 _n_value = n_value.as(not null)
4071 n_value.parent = self
4072 end
4073
4074 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4075 do
4076 if _n_expr == old_child then
4077 n_expr = new_child.as(AExpr)
4078 return
4079 end
4080 if _n_id == old_child then
4081 n_id = new_child.as(TAttrid)
4082 return
4083 end
4084 if _n_assign == old_child then
4085 n_assign = new_child.as(TAssign)
4086 return
4087 end
4088 if _n_value == old_child then
4089 n_value = new_child.as(AExpr)
4090 return
4091 end
4092 end
4093
4094 redef fun n_expr=(node)
4095 do
4096 _n_expr = node
4097 node.parent = self
4098 end
4099 redef fun n_id=(node)
4100 do
4101 _n_id = node
4102 node.parent = self
4103 end
4104 redef fun n_assign=(node)
4105 do
4106 _n_assign = node
4107 node.parent = self
4108 end
4109 redef fun n_value=(node)
4110 do
4111 _n_value = node
4112 node.parent = self
4113 end
4114
4115
4116 redef fun visit_all(v: Visitor)
4117 do
4118 v.enter_visit(_n_expr)
4119 v.enter_visit(_n_id)
4120 v.enter_visit(_n_assign)
4121 v.enter_visit(_n_value)
4122 end
4123 end
4124 redef class AAttrReassignExpr
4125 init init_aattrreassignexpr (
4126 n_expr: nullable AExpr,
4127 n_id: nullable TAttrid,
4128 n_assign_op: nullable AAssignOp,
4129 n_value: nullable AExpr
4130 )
4131 do
4132 _n_expr = n_expr.as(not null)
4133 n_expr.parent = self
4134 _n_id = n_id.as(not null)
4135 n_id.parent = self
4136 _n_assign_op = n_assign_op.as(not null)
4137 n_assign_op.parent = self
4138 _n_value = n_value.as(not null)
4139 n_value.parent = self
4140 end
4141
4142 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4143 do
4144 if _n_expr == old_child then
4145 n_expr = new_child.as(AExpr)
4146 return
4147 end
4148 if _n_id == old_child then
4149 n_id = new_child.as(TAttrid)
4150 return
4151 end
4152 if _n_assign_op == old_child then
4153 n_assign_op = new_child.as(AAssignOp)
4154 return
4155 end
4156 if _n_value == old_child then
4157 n_value = new_child.as(AExpr)
4158 return
4159 end
4160 end
4161
4162 redef fun n_expr=(node)
4163 do
4164 _n_expr = node
4165 node.parent = self
4166 end
4167 redef fun n_id=(node)
4168 do
4169 _n_id = node
4170 node.parent = self
4171 end
4172 redef fun n_assign_op=(node)
4173 do
4174 _n_assign_op = node
4175 node.parent = self
4176 end
4177 redef fun n_value=(node)
4178 do
4179 _n_value = node
4180 node.parent = self
4181 end
4182
4183
4184 redef fun visit_all(v: Visitor)
4185 do
4186 v.enter_visit(_n_expr)
4187 v.enter_visit(_n_id)
4188 v.enter_visit(_n_assign_op)
4189 v.enter_visit(_n_value)
4190 end
4191 end
4192 redef class ACallExpr
4193 init init_acallexpr (
4194 n_expr: nullable AExpr,
4195 n_id: nullable TId,
4196 n_args: nullable AExprs
4197 )
4198 do
4199 _n_expr = n_expr.as(not null)
4200 n_expr.parent = self
4201 _n_id = n_id.as(not null)
4202 n_id.parent = self
4203 _n_args = n_args.as(not null)
4204 n_args.parent = self
4205 end
4206
4207 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4208 do
4209 if _n_expr == old_child then
4210 n_expr = new_child.as(AExpr)
4211 return
4212 end
4213 if _n_id == old_child then
4214 n_id = new_child.as(TId)
4215 return
4216 end
4217 if _n_args == old_child then
4218 n_args = new_child.as(AExprs)
4219 return
4220 end
4221 end
4222
4223 redef fun n_expr=(node)
4224 do
4225 _n_expr = node
4226 node.parent = self
4227 end
4228 redef fun n_id=(node)
4229 do
4230 _n_id = node
4231 node.parent = self
4232 end
4233 redef fun n_args=(node)
4234 do
4235 _n_args = node
4236 node.parent = self
4237 end
4238
4239
4240 redef fun visit_all(v: Visitor)
4241 do
4242 v.enter_visit(_n_expr)
4243 v.enter_visit(_n_id)
4244 v.enter_visit(_n_args)
4245 end
4246 end
4247 redef class ACallAssignExpr
4248 init init_acallassignexpr (
4249 n_expr: nullable AExpr,
4250 n_id: nullable TId,
4251 n_args: nullable AExprs,
4252 n_assign: nullable TAssign,
4253 n_value: nullable AExpr
4254 )
4255 do
4256 _n_expr = n_expr.as(not null)
4257 n_expr.parent = self
4258 _n_id = n_id.as(not null)
4259 n_id.parent = self
4260 _n_args = n_args.as(not null)
4261 n_args.parent = self
4262 _n_assign = n_assign.as(not null)
4263 n_assign.parent = self
4264 _n_value = n_value.as(not null)
4265 n_value.parent = self
4266 end
4267
4268 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4269 do
4270 if _n_expr == old_child then
4271 n_expr = new_child.as(AExpr)
4272 return
4273 end
4274 if _n_id == old_child then
4275 n_id = new_child.as(TId)
4276 return
4277 end
4278 if _n_args == old_child then
4279 n_args = new_child.as(AExprs)
4280 return
4281 end
4282 if _n_assign == old_child then
4283 n_assign = new_child.as(TAssign)
4284 return
4285 end
4286 if _n_value == old_child then
4287 n_value = new_child.as(AExpr)
4288 return
4289 end
4290 end
4291
4292 redef fun n_expr=(node)
4293 do
4294 _n_expr = node
4295 node.parent = self
4296 end
4297 redef fun n_id=(node)
4298 do
4299 _n_id = node
4300 node.parent = self
4301 end
4302 redef fun n_args=(node)
4303 do
4304 _n_args = node
4305 node.parent = self
4306 end
4307 redef fun n_assign=(node)
4308 do
4309 _n_assign = node
4310 node.parent = self
4311 end
4312 redef fun n_value=(node)
4313 do
4314 _n_value = node
4315 node.parent = self
4316 end
4317
4318
4319 redef fun visit_all(v: Visitor)
4320 do
4321 v.enter_visit(_n_expr)
4322 v.enter_visit(_n_id)
4323 v.enter_visit(_n_args)
4324 v.enter_visit(_n_assign)
4325 v.enter_visit(_n_value)
4326 end
4327 end
4328 redef class ACallReassignExpr
4329 init init_acallreassignexpr (
4330 n_expr: nullable AExpr,
4331 n_id: nullable TId,
4332 n_args: nullable AExprs,
4333 n_assign_op: nullable AAssignOp,
4334 n_value: nullable AExpr
4335 )
4336 do
4337 _n_expr = n_expr.as(not null)
4338 n_expr.parent = self
4339 _n_id = n_id.as(not null)
4340 n_id.parent = self
4341 _n_args = n_args.as(not null)
4342 n_args.parent = self
4343 _n_assign_op = n_assign_op.as(not null)
4344 n_assign_op.parent = self
4345 _n_value = n_value.as(not null)
4346 n_value.parent = self
4347 end
4348
4349 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4350 do
4351 if _n_expr == old_child then
4352 n_expr = new_child.as(AExpr)
4353 return
4354 end
4355 if _n_id == old_child then
4356 n_id = new_child.as(TId)
4357 return
4358 end
4359 if _n_args == old_child then
4360 n_args = new_child.as(AExprs)
4361 return
4362 end
4363 if _n_assign_op == old_child then
4364 n_assign_op = new_child.as(AAssignOp)
4365 return
4366 end
4367 if _n_value == old_child then
4368 n_value = new_child.as(AExpr)
4369 return
4370 end
4371 end
4372
4373 redef fun n_expr=(node)
4374 do
4375 _n_expr = node
4376 node.parent = self
4377 end
4378 redef fun n_id=(node)
4379 do
4380 _n_id = node
4381 node.parent = self
4382 end
4383 redef fun n_args=(node)
4384 do
4385 _n_args = node
4386 node.parent = self
4387 end
4388 redef fun n_assign_op=(node)
4389 do
4390 _n_assign_op = node
4391 node.parent = self
4392 end
4393 redef fun n_value=(node)
4394 do
4395 _n_value = node
4396 node.parent = self
4397 end
4398
4399
4400 redef fun visit_all(v: Visitor)
4401 do
4402 v.enter_visit(_n_expr)
4403 v.enter_visit(_n_id)
4404 v.enter_visit(_n_args)
4405 v.enter_visit(_n_assign_op)
4406 v.enter_visit(_n_value)
4407 end
4408 end
4409 redef class ASuperExpr
4410 init init_asuperexpr (
4411 n_qualified: nullable AQualified,
4412 n_kwsuper: nullable TKwsuper,
4413 n_args: nullable AExprs
4414 )
4415 do
4416 _n_qualified = n_qualified
4417 if n_qualified != null then n_qualified.parent = self
4418 _n_kwsuper = n_kwsuper.as(not null)
4419 n_kwsuper.parent = self
4420 _n_args = n_args.as(not null)
4421 n_args.parent = self
4422 end
4423
4424 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4425 do
4426 if _n_qualified == old_child then
4427 n_qualified = new_child.as(nullable AQualified)
4428 return
4429 end
4430 if _n_kwsuper == old_child then
4431 n_kwsuper = new_child.as(TKwsuper)
4432 return
4433 end
4434 if _n_args == old_child then
4435 n_args = new_child.as(AExprs)
4436 return
4437 end
4438 end
4439
4440 redef fun n_qualified=(node)
4441 do
4442 _n_qualified = node
4443 if node != null then node.parent = self
4444 end
4445 redef fun n_kwsuper=(node)
4446 do
4447 _n_kwsuper = node
4448 node.parent = self
4449 end
4450 redef fun n_args=(node)
4451 do
4452 _n_args = node
4453 node.parent = self
4454 end
4455
4456
4457 redef fun visit_all(v: Visitor)
4458 do
4459 v.enter_visit(_n_qualified)
4460 v.enter_visit(_n_kwsuper)
4461 v.enter_visit(_n_args)
4462 end
4463 end
4464 redef class AInitExpr
4465 init init_ainitexpr (
4466 n_expr: nullable AExpr,
4467 n_kwinit: nullable TKwinit,
4468 n_args: nullable AExprs
4469 )
4470 do
4471 _n_expr = n_expr.as(not null)
4472 n_expr.parent = self
4473 _n_kwinit = n_kwinit.as(not null)
4474 n_kwinit.parent = self
4475 _n_args = n_args.as(not null)
4476 n_args.parent = self
4477 end
4478
4479 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4480 do
4481 if _n_expr == old_child then
4482 n_expr = new_child.as(AExpr)
4483 return
4484 end
4485 if _n_kwinit == old_child then
4486 n_kwinit = new_child.as(TKwinit)
4487 return
4488 end
4489 if _n_args == old_child then
4490 n_args = new_child.as(AExprs)
4491 return
4492 end
4493 end
4494
4495 redef fun n_expr=(node)
4496 do
4497 _n_expr = node
4498 node.parent = self
4499 end
4500 redef fun n_kwinit=(node)
4501 do
4502 _n_kwinit = node
4503 node.parent = self
4504 end
4505 redef fun n_args=(node)
4506 do
4507 _n_args = node
4508 node.parent = self
4509 end
4510
4511
4512 redef fun visit_all(v: Visitor)
4513 do
4514 v.enter_visit(_n_expr)
4515 v.enter_visit(_n_kwinit)
4516 v.enter_visit(_n_args)
4517 end
4518 end
4519 redef class ABraExpr
4520 init init_abraexpr (
4521 n_expr: nullable AExpr,
4522 n_args: nullable AExprs
4523 )
4524 do
4525 _n_expr = n_expr.as(not null)
4526 n_expr.parent = self
4527 _n_args = n_args.as(not null)
4528 n_args.parent = self
4529 end
4530
4531 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4532 do
4533 if _n_expr == old_child then
4534 n_expr = new_child.as(AExpr)
4535 return
4536 end
4537 if _n_args == old_child then
4538 n_args = new_child.as(AExprs)
4539 return
4540 end
4541 end
4542
4543 redef fun n_expr=(node)
4544 do
4545 _n_expr = node
4546 node.parent = self
4547 end
4548 redef fun n_args=(node)
4549 do
4550 _n_args = node
4551 node.parent = self
4552 end
4553
4554
4555 redef fun visit_all(v: Visitor)
4556 do
4557 v.enter_visit(_n_expr)
4558 v.enter_visit(_n_args)
4559 end
4560 end
4561 redef class ABraAssignExpr
4562 init init_abraassignexpr (
4563 n_expr: nullable AExpr,
4564 n_args: nullable AExprs,
4565 n_assign: nullable TAssign,
4566 n_value: nullable AExpr
4567 )
4568 do
4569 _n_expr = n_expr.as(not null)
4570 n_expr.parent = self
4571 _n_args = n_args.as(not null)
4572 n_args.parent = self
4573 _n_assign = n_assign.as(not null)
4574 n_assign.parent = self
4575 _n_value = n_value.as(not null)
4576 n_value.parent = self
4577 end
4578
4579 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4580 do
4581 if _n_expr == old_child then
4582 n_expr = new_child.as(AExpr)
4583 return
4584 end
4585 if _n_args == old_child then
4586 n_args = new_child.as(AExprs)
4587 return
4588 end
4589 if _n_assign == old_child then
4590 n_assign = new_child.as(TAssign)
4591 return
4592 end
4593 if _n_value == old_child then
4594 n_value = new_child.as(AExpr)
4595 return
4596 end
4597 end
4598
4599 redef fun n_expr=(node)
4600 do
4601 _n_expr = node
4602 node.parent = self
4603 end
4604 redef fun n_args=(node)
4605 do
4606 _n_args = node
4607 node.parent = self
4608 end
4609 redef fun n_assign=(node)
4610 do
4611 _n_assign = node
4612 node.parent = self
4613 end
4614 redef fun n_value=(node)
4615 do
4616 _n_value = node
4617 node.parent = self
4618 end
4619
4620
4621 redef fun visit_all(v: Visitor)
4622 do
4623 v.enter_visit(_n_expr)
4624 v.enter_visit(_n_args)
4625 v.enter_visit(_n_assign)
4626 v.enter_visit(_n_value)
4627 end
4628 end
4629 redef class ABraReassignExpr
4630 init init_abrareassignexpr (
4631 n_expr: nullable AExpr,
4632 n_args: nullable AExprs,
4633 n_assign_op: nullable AAssignOp,
4634 n_value: nullable AExpr
4635 )
4636 do
4637 _n_expr = n_expr.as(not null)
4638 n_expr.parent = self
4639 _n_args = n_args.as(not null)
4640 n_args.parent = self
4641 _n_assign_op = n_assign_op.as(not null)
4642 n_assign_op.parent = self
4643 _n_value = n_value.as(not null)
4644 n_value.parent = self
4645 end
4646
4647 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4648 do
4649 if _n_expr == old_child then
4650 n_expr = new_child.as(AExpr)
4651 return
4652 end
4653 if _n_args == old_child then
4654 n_args = new_child.as(AExprs)
4655 return
4656 end
4657 if _n_assign_op == old_child then
4658 n_assign_op = new_child.as(AAssignOp)
4659 return
4660 end
4661 if _n_value == old_child then
4662 n_value = new_child.as(AExpr)
4663 return
4664 end
4665 end
4666
4667 redef fun n_expr=(node)
4668 do
4669 _n_expr = node
4670 node.parent = self
4671 end
4672 redef fun n_args=(node)
4673 do
4674 _n_args = node
4675 node.parent = self
4676 end
4677 redef fun n_assign_op=(node)
4678 do
4679 _n_assign_op = node
4680 node.parent = self
4681 end
4682 redef fun n_value=(node)
4683 do
4684 _n_value = node
4685 node.parent = self
4686 end
4687
4688
4689 redef fun visit_all(v: Visitor)
4690 do
4691 v.enter_visit(_n_expr)
4692 v.enter_visit(_n_args)
4693 v.enter_visit(_n_assign_op)
4694 v.enter_visit(_n_value)
4695 end
4696 end
4697 redef class AVarExpr
4698 init init_avarexpr (
4699 n_id: nullable TId
4700 )
4701 do
4702 _n_id = n_id.as(not null)
4703 n_id.parent = self
4704 end
4705
4706 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4707 do
4708 if _n_id == old_child then
4709 n_id = new_child.as(TId)
4710 return
4711 end
4712 end
4713
4714 redef fun n_id=(node)
4715 do
4716 _n_id = node
4717 node.parent = self
4718 end
4719
4720
4721 redef fun visit_all(v: Visitor)
4722 do
4723 v.enter_visit(_n_id)
4724 end
4725 end
4726 redef class AVarAssignExpr
4727 init init_avarassignexpr (
4728 n_id: nullable TId,
4729 n_assign: nullable TAssign,
4730 n_value: nullable AExpr
4731 )
4732 do
4733 _n_id = n_id.as(not null)
4734 n_id.parent = self
4735 _n_assign = n_assign.as(not null)
4736 n_assign.parent = self
4737 _n_value = n_value.as(not null)
4738 n_value.parent = self
4739 end
4740
4741 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4742 do
4743 if _n_id == old_child then
4744 n_id = new_child.as(TId)
4745 return
4746 end
4747 if _n_assign == old_child then
4748 n_assign = new_child.as(TAssign)
4749 return
4750 end
4751 if _n_value == old_child then
4752 n_value = new_child.as(AExpr)
4753 return
4754 end
4755 end
4756
4757 redef fun n_id=(node)
4758 do
4759 _n_id = node
4760 node.parent = self
4761 end
4762 redef fun n_assign=(node)
4763 do
4764 _n_assign = node
4765 node.parent = self
4766 end
4767 redef fun n_value=(node)
4768 do
4769 _n_value = node
4770 node.parent = self
4771 end
4772
4773
4774 redef fun visit_all(v: Visitor)
4775 do
4776 v.enter_visit(_n_id)
4777 v.enter_visit(_n_assign)
4778 v.enter_visit(_n_value)
4779 end
4780 end
4781 redef class AVarReassignExpr
4782 init init_avarreassignexpr (
4783 n_id: nullable TId,
4784 n_assign_op: nullable AAssignOp,
4785 n_value: nullable AExpr
4786 )
4787 do
4788 _n_id = n_id.as(not null)
4789 n_id.parent = self
4790 _n_assign_op = n_assign_op.as(not null)
4791 n_assign_op.parent = self
4792 _n_value = n_value.as(not null)
4793 n_value.parent = self
4794 end
4795
4796 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4797 do
4798 if _n_id == old_child then
4799 n_id = new_child.as(TId)
4800 return
4801 end
4802 if _n_assign_op == old_child then
4803 n_assign_op = new_child.as(AAssignOp)
4804 return
4805 end
4806 if _n_value == old_child then
4807 n_value = new_child.as(AExpr)
4808 return
4809 end
4810 end
4811
4812 redef fun n_id=(node)
4813 do
4814 _n_id = node
4815 node.parent = self
4816 end
4817 redef fun n_assign_op=(node)
4818 do
4819 _n_assign_op = node
4820 node.parent = self
4821 end
4822 redef fun n_value=(node)
4823 do
4824 _n_value = node
4825 node.parent = self
4826 end
4827
4828
4829 redef fun visit_all(v: Visitor)
4830 do
4831 v.enter_visit(_n_id)
4832 v.enter_visit(_n_assign_op)
4833 v.enter_visit(_n_value)
4834 end
4835 end
4836 redef class ARangeExpr
4837 init init_arangeexpr (
4838 n_expr: nullable AExpr,
4839 n_expr2: nullable AExpr,
4840 n_annotations: nullable AAnnotations
4841 )
4842 do
4843 _n_expr = n_expr.as(not null)
4844 n_expr.parent = self
4845 _n_expr2 = n_expr2.as(not null)
4846 n_expr2.parent = self
4847 _n_annotations = n_annotations
4848 if n_annotations != null then n_annotations.parent = self
4849 end
4850
4851 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4852 do
4853 if _n_expr == old_child then
4854 n_expr = new_child.as(AExpr)
4855 return
4856 end
4857 if _n_expr2 == old_child then
4858 n_expr2 = new_child.as(AExpr)
4859 return
4860 end
4861 if _n_annotations == old_child then
4862 n_annotations = new_child.as(nullable AAnnotations)
4863 return
4864 end
4865 end
4866
4867 redef fun n_expr=(node)
4868 do
4869 _n_expr = node
4870 node.parent = self
4871 end
4872 redef fun n_expr2=(node)
4873 do
4874 _n_expr2 = node
4875 node.parent = self
4876 end
4877 redef fun n_annotations=(node)
4878 do
4879 _n_annotations = node
4880 if node != null then node.parent = self
4881 end
4882
4883
4884 redef fun visit_all(v: Visitor)
4885 do
4886 v.enter_visit(_n_expr)
4887 v.enter_visit(_n_expr2)
4888 v.enter_visit(_n_annotations)
4889 end
4890 end
4891 redef class ACrangeExpr
4892 init init_acrangeexpr (
4893 n_obra: nullable TObra,
4894 n_expr: nullable AExpr,
4895 n_expr2: nullable AExpr,
4896 n_cbra: nullable TCbra,
4897 n_annotations: nullable AAnnotations
4898 )
4899 do
4900 _n_obra = n_obra.as(not null)
4901 n_obra.parent = self
4902 _n_expr = n_expr.as(not null)
4903 n_expr.parent = self
4904 _n_expr2 = n_expr2.as(not null)
4905 n_expr2.parent = self
4906 _n_cbra = n_cbra.as(not null)
4907 n_cbra.parent = self
4908 _n_annotations = n_annotations
4909 if n_annotations != null then n_annotations.parent = self
4910 end
4911
4912 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4913 do
4914 if _n_obra == old_child then
4915 n_obra = new_child.as(TObra)
4916 return
4917 end
4918 if _n_expr == old_child then
4919 n_expr = new_child.as(AExpr)
4920 return
4921 end
4922 if _n_expr2 == old_child then
4923 n_expr2 = new_child.as(AExpr)
4924 return
4925 end
4926 if _n_cbra == old_child then
4927 n_cbra = new_child.as(TCbra)
4928 return
4929 end
4930 if _n_annotations == old_child then
4931 n_annotations = new_child.as(nullable AAnnotations)
4932 return
4933 end
4934 end
4935
4936 redef fun n_obra=(node)
4937 do
4938 _n_obra = node
4939 node.parent = self
4940 end
4941 redef fun n_expr=(node)
4942 do
4943 _n_expr = node
4944 node.parent = self
4945 end
4946 redef fun n_expr2=(node)
4947 do
4948 _n_expr2 = node
4949 node.parent = self
4950 end
4951 redef fun n_cbra=(node)
4952 do
4953 _n_cbra = node
4954 node.parent = self
4955 end
4956 redef fun n_annotations=(node)
4957 do
4958 _n_annotations = node
4959 if node != null then node.parent = self
4960 end
4961
4962
4963 redef fun visit_all(v: Visitor)
4964 do
4965 v.enter_visit(_n_obra)
4966 v.enter_visit(_n_expr)
4967 v.enter_visit(_n_expr2)
4968 v.enter_visit(_n_cbra)
4969 v.enter_visit(_n_annotations)
4970 end
4971 end
4972 redef class AOrangeExpr
4973 init init_aorangeexpr (
4974 n_obra: nullable TObra,
4975 n_expr: nullable AExpr,
4976 n_expr2: nullable AExpr,
4977 n_cbra: nullable TObra,
4978 n_annotations: nullable AAnnotations
4979 )
4980 do
4981 _n_obra = n_obra.as(not null)
4982 n_obra.parent = self
4983 _n_expr = n_expr.as(not null)
4984 n_expr.parent = self
4985 _n_expr2 = n_expr2.as(not null)
4986 n_expr2.parent = self
4987 _n_cbra = n_cbra.as(not null)
4988 n_cbra.parent = self
4989 _n_annotations = n_annotations
4990 if n_annotations != null then n_annotations.parent = self
4991 end
4992
4993 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
4994 do
4995 if _n_obra == old_child then
4996 n_obra = new_child.as(TObra)
4997 return
4998 end
4999 if _n_expr == old_child then
5000 n_expr = new_child.as(AExpr)
5001 return
5002 end
5003 if _n_expr2 == old_child then
5004 n_expr2 = new_child.as(AExpr)
5005 return
5006 end
5007 if _n_cbra == old_child then
5008 n_cbra = new_child.as(TObra)
5009 return
5010 end
5011 if _n_annotations == old_child then
5012 n_annotations = new_child.as(nullable AAnnotations)
5013 return
5014 end
5015 end
5016
5017 redef fun n_obra=(node)
5018 do
5019 _n_obra = node
5020 node.parent = self
5021 end
5022 redef fun n_expr=(node)
5023 do
5024 _n_expr = node
5025 node.parent = self
5026 end
5027 redef fun n_expr2=(node)
5028 do
5029 _n_expr2 = node
5030 node.parent = self
5031 end
5032 redef fun n_cbra=(node)
5033 do
5034 _n_cbra = node
5035 node.parent = self
5036 end
5037 redef fun n_annotations=(node)
5038 do
5039 _n_annotations = node
5040 if node != null then node.parent = self
5041 end
5042
5043
5044 redef fun visit_all(v: Visitor)
5045 do
5046 v.enter_visit(_n_obra)
5047 v.enter_visit(_n_expr)
5048 v.enter_visit(_n_expr2)
5049 v.enter_visit(_n_cbra)
5050 v.enter_visit(_n_annotations)
5051 end
5052 end
5053 redef class AArrayExpr
5054 init init_aarrayexpr (
5055 n_obra: nullable TObra,
5056 n_exprs: Collection[Object], # Should be Collection[AExpr]
5057 n_type: nullable AType,
5058 n_cbra: nullable TCbra,
5059 n_annotations: nullable AAnnotations
5060 )
5061 do
5062 _n_obra = n_obra.as(not null)
5063 n_obra.parent = self
5064 self.n_exprs.unsafe_add_all(n_exprs)
5065 _n_type = n_type
5066 if n_type != null then n_type.parent = self
5067 _n_cbra = n_cbra.as(not null)
5068 n_cbra.parent = self
5069 _n_annotations = n_annotations
5070 if n_annotations != null then n_annotations.parent = self
5071 end
5072
5073 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5074 do
5075 if _n_obra == old_child then
5076 n_obra = new_child.as(TObra)
5077 return
5078 end
5079 if n_exprs.replace_child(old_child, new_child) then return
5080 if _n_type == old_child then
5081 n_type = new_child.as(nullable AType)
5082 return
5083 end
5084 if _n_cbra == old_child then
5085 n_cbra = new_child.as(TCbra)
5086 return
5087 end
5088 if _n_annotations == old_child then
5089 n_annotations = new_child.as(nullable AAnnotations)
5090 return
5091 end
5092 end
5093
5094 redef fun n_obra=(node)
5095 do
5096 _n_obra = node
5097 node.parent = self
5098 end
5099 redef fun n_type=(node)
5100 do
5101 _n_type = node
5102 if node != null then node.parent = self
5103 end
5104 redef fun n_cbra=(node)
5105 do
5106 _n_cbra = node
5107 node.parent = self
5108 end
5109 redef fun n_annotations=(node)
5110 do
5111 _n_annotations = node
5112 if node != null then node.parent = self
5113 end
5114
5115
5116 redef fun visit_all(v: Visitor)
5117 do
5118 v.enter_visit(_n_obra)
5119 n_exprs.visit_all(v)
5120 v.enter_visit(_n_type)
5121 v.enter_visit(_n_cbra)
5122 v.enter_visit(_n_annotations)
5123 end
5124 end
5125 redef class ASelfExpr
5126 init init_aselfexpr (
5127 n_kwself: nullable TKwself,
5128 n_annotations: nullable AAnnotations
5129 )
5130 do
5131 _n_kwself = n_kwself.as(not null)
5132 n_kwself.parent = self
5133 _n_annotations = n_annotations
5134 if n_annotations != null then n_annotations.parent = self
5135 end
5136
5137 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5138 do
5139 if _n_kwself == old_child then
5140 n_kwself = new_child.as(TKwself)
5141 return
5142 end
5143 if _n_annotations == old_child then
5144 n_annotations = new_child.as(nullable AAnnotations)
5145 return
5146 end
5147 end
5148
5149 redef fun n_kwself=(node)
5150 do
5151 _n_kwself = node
5152 node.parent = self
5153 end
5154 redef fun n_annotations=(node)
5155 do
5156 _n_annotations = node
5157 if node != null then node.parent = self
5158 end
5159
5160
5161 redef fun visit_all(v: Visitor)
5162 do
5163 v.enter_visit(_n_kwself)
5164 v.enter_visit(_n_annotations)
5165 end
5166 end
5167 redef class AImplicitSelfExpr
5168 init init_aimplicitselfexpr
5169 do
5170 end
5171
5172 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5173 do
5174 end
5175
5176
5177
5178 redef fun visit_all(v: Visitor)
5179 do
5180 end
5181 end
5182 redef class ATrueExpr
5183 init init_atrueexpr (
5184 n_kwtrue: nullable TKwtrue,
5185 n_annotations: nullable AAnnotations
5186 )
5187 do
5188 _n_kwtrue = n_kwtrue.as(not null)
5189 n_kwtrue.parent = self
5190 _n_annotations = n_annotations
5191 if n_annotations != null then n_annotations.parent = self
5192 end
5193
5194 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5195 do
5196 if _n_kwtrue == old_child then
5197 n_kwtrue = new_child.as(TKwtrue)
5198 return
5199 end
5200 if _n_annotations == old_child then
5201 n_annotations = new_child.as(nullable AAnnotations)
5202 return
5203 end
5204 end
5205
5206 redef fun n_kwtrue=(node)
5207 do
5208 _n_kwtrue = node
5209 node.parent = self
5210 end
5211 redef fun n_annotations=(node)
5212 do
5213 _n_annotations = node
5214 if node != null then node.parent = self
5215 end
5216
5217
5218 redef fun visit_all(v: Visitor)
5219 do
5220 v.enter_visit(_n_kwtrue)
5221 v.enter_visit(_n_annotations)
5222 end
5223 end
5224 redef class AFalseExpr
5225 init init_afalseexpr (
5226 n_kwfalse: nullable TKwfalse,
5227 n_annotations: nullable AAnnotations
5228 )
5229 do
5230 _n_kwfalse = n_kwfalse.as(not null)
5231 n_kwfalse.parent = self
5232 _n_annotations = n_annotations
5233 if n_annotations != null then n_annotations.parent = self
5234 end
5235
5236 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5237 do
5238 if _n_kwfalse == old_child then
5239 n_kwfalse = new_child.as(TKwfalse)
5240 return
5241 end
5242 if _n_annotations == old_child then
5243 n_annotations = new_child.as(nullable AAnnotations)
5244 return
5245 end
5246 end
5247
5248 redef fun n_kwfalse=(node)
5249 do
5250 _n_kwfalse = node
5251 node.parent = self
5252 end
5253 redef fun n_annotations=(node)
5254 do
5255 _n_annotations = node
5256 if node != null then node.parent = self
5257 end
5258
5259
5260 redef fun visit_all(v: Visitor)
5261 do
5262 v.enter_visit(_n_kwfalse)
5263 v.enter_visit(_n_annotations)
5264 end
5265 end
5266 redef class ANullExpr
5267 init init_anullexpr (
5268 n_kwnull: nullable TKwnull,
5269 n_annotations: nullable AAnnotations
5270 )
5271 do
5272 _n_kwnull = n_kwnull.as(not null)
5273 n_kwnull.parent = self
5274 _n_annotations = n_annotations
5275 if n_annotations != null then n_annotations.parent = self
5276 end
5277
5278 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5279 do
5280 if _n_kwnull == old_child then
5281 n_kwnull = new_child.as(TKwnull)
5282 return
5283 end
5284 if _n_annotations == old_child then
5285 n_annotations = new_child.as(nullable AAnnotations)
5286 return
5287 end
5288 end
5289
5290 redef fun n_kwnull=(node)
5291 do
5292 _n_kwnull = node
5293 node.parent = self
5294 end
5295 redef fun n_annotations=(node)
5296 do
5297 _n_annotations = node
5298 if node != null then node.parent = self
5299 end
5300
5301
5302 redef fun visit_all(v: Visitor)
5303 do
5304 v.enter_visit(_n_kwnull)
5305 v.enter_visit(_n_annotations)
5306 end
5307 end
5308 redef class ADecIntExpr
5309 init init_adecintexpr (
5310 n_number: nullable TNumber,
5311 n_annotations: nullable AAnnotations
5312 )
5313 do
5314 _n_number = n_number.as(not null)
5315 n_number.parent = self
5316 _n_annotations = n_annotations
5317 if n_annotations != null then n_annotations.parent = self
5318 end
5319
5320 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5321 do
5322 if _n_number == old_child then
5323 n_number = new_child.as(TNumber)
5324 return
5325 end
5326 if _n_annotations == old_child then
5327 n_annotations = new_child.as(nullable AAnnotations)
5328 return
5329 end
5330 end
5331
5332 redef fun n_number=(node)
5333 do
5334 _n_number = node
5335 node.parent = self
5336 end
5337 redef fun n_annotations=(node)
5338 do
5339 _n_annotations = node
5340 if node != null then node.parent = self
5341 end
5342
5343
5344 redef fun visit_all(v: Visitor)
5345 do
5346 v.enter_visit(_n_number)
5347 v.enter_visit(_n_annotations)
5348 end
5349 end
5350 redef class AHexIntExpr
5351 init init_ahexintexpr (
5352 n_hex_number: nullable THexNumber,
5353 n_annotations: nullable AAnnotations
5354 )
5355 do
5356 _n_hex_number = n_hex_number.as(not null)
5357 n_hex_number.parent = self
5358 _n_annotations = n_annotations
5359 if n_annotations != null then n_annotations.parent = self
5360 end
5361
5362 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5363 do
5364 if _n_hex_number == old_child then
5365 n_hex_number = new_child.as(THexNumber)
5366 return
5367 end
5368 if _n_annotations == old_child then
5369 n_annotations = new_child.as(nullable AAnnotations)
5370 return
5371 end
5372 end
5373
5374 redef fun n_hex_number=(node)
5375 do
5376 _n_hex_number = node
5377 node.parent = self
5378 end
5379 redef fun n_annotations=(node)
5380 do
5381 _n_annotations = node
5382 if node != null then node.parent = self
5383 end
5384
5385
5386 redef fun visit_all(v: Visitor)
5387 do
5388 v.enter_visit(_n_hex_number)
5389 v.enter_visit(_n_annotations)
5390 end
5391 end
5392 redef class AFloatExpr
5393 init init_afloatexpr (
5394 n_float: nullable TFloat,
5395 n_annotations: nullable AAnnotations
5396 )
5397 do
5398 _n_float = n_float.as(not null)
5399 n_float.parent = self
5400 _n_annotations = n_annotations
5401 if n_annotations != null then n_annotations.parent = self
5402 end
5403
5404 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5405 do
5406 if _n_float == old_child then
5407 n_float = new_child.as(TFloat)
5408 return
5409 end
5410 if _n_annotations == old_child then
5411 n_annotations = new_child.as(nullable AAnnotations)
5412 return
5413 end
5414 end
5415
5416 redef fun n_float=(node)
5417 do
5418 _n_float = node
5419 node.parent = self
5420 end
5421 redef fun n_annotations=(node)
5422 do
5423 _n_annotations = node
5424 if node != null then node.parent = self
5425 end
5426
5427
5428 redef fun visit_all(v: Visitor)
5429 do
5430 v.enter_visit(_n_float)
5431 v.enter_visit(_n_annotations)
5432 end
5433 end
5434 redef class ACharExpr
5435 init init_acharexpr (
5436 n_char: nullable TChar,
5437 n_annotations: nullable AAnnotations
5438 )
5439 do
5440 _n_char = n_char.as(not null)
5441 n_char.parent = self
5442 _n_annotations = n_annotations
5443 if n_annotations != null then n_annotations.parent = self
5444 end
5445
5446 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5447 do
5448 if _n_char == old_child then
5449 n_char = new_child.as(TChar)
5450 return
5451 end
5452 if _n_annotations == old_child then
5453 n_annotations = new_child.as(nullable AAnnotations)
5454 return
5455 end
5456 end
5457
5458 redef fun n_char=(node)
5459 do
5460 _n_char = node
5461 node.parent = self
5462 end
5463 redef fun n_annotations=(node)
5464 do
5465 _n_annotations = node
5466 if node != null then node.parent = self
5467 end
5468
5469
5470 redef fun visit_all(v: Visitor)
5471 do
5472 v.enter_visit(_n_char)
5473 v.enter_visit(_n_annotations)
5474 end
5475 end
5476 redef class AStringExpr
5477 init init_astringexpr (
5478 n_string: nullable TString,
5479 n_annotations: nullable AAnnotations
5480 )
5481 do
5482 _n_string = n_string.as(not null)
5483 n_string.parent = self
5484 _n_annotations = n_annotations
5485 if n_annotations != null then n_annotations.parent = self
5486 end
5487
5488 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5489 do
5490 if _n_string == old_child then
5491 n_string = new_child.as(TString)
5492 return
5493 end
5494 if _n_annotations == old_child then
5495 n_annotations = new_child.as(nullable AAnnotations)
5496 return
5497 end
5498 end
5499
5500 redef fun n_string=(node)
5501 do
5502 _n_string = node
5503 node.parent = self
5504 end
5505 redef fun n_annotations=(node)
5506 do
5507 _n_annotations = node
5508 if node != null then node.parent = self
5509 end
5510
5511
5512 redef fun visit_all(v: Visitor)
5513 do
5514 v.enter_visit(_n_string)
5515 v.enter_visit(_n_annotations)
5516 end
5517 end
5518 redef class AStartStringExpr
5519 init init_astartstringexpr (
5520 n_string: nullable TStartString
5521 )
5522 do
5523 _n_string = n_string.as(not null)
5524 n_string.parent = self
5525 end
5526
5527 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5528 do
5529 if _n_string == old_child then
5530 n_string = new_child.as(TStartString)
5531 return
5532 end
5533 end
5534
5535 redef fun n_string=(node)
5536 do
5537 _n_string = node
5538 node.parent = self
5539 end
5540
5541
5542 redef fun visit_all(v: Visitor)
5543 do
5544 v.enter_visit(_n_string)
5545 end
5546 end
5547 redef class AMidStringExpr
5548 init init_amidstringexpr (
5549 n_string: nullable TMidString
5550 )
5551 do
5552 _n_string = n_string.as(not null)
5553 n_string.parent = self
5554 end
5555
5556 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5557 do
5558 if _n_string == old_child then
5559 n_string = new_child.as(TMidString)
5560 return
5561 end
5562 end
5563
5564 redef fun n_string=(node)
5565 do
5566 _n_string = node
5567 node.parent = self
5568 end
5569
5570
5571 redef fun visit_all(v: Visitor)
5572 do
5573 v.enter_visit(_n_string)
5574 end
5575 end
5576 redef class AEndStringExpr
5577 init init_aendstringexpr (
5578 n_string: nullable TEndString
5579 )
5580 do
5581 _n_string = n_string.as(not null)
5582 n_string.parent = self
5583 end
5584
5585 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5586 do
5587 if _n_string == old_child then
5588 n_string = new_child.as(TEndString)
5589 return
5590 end
5591 end
5592
5593 redef fun n_string=(node)
5594 do
5595 _n_string = node
5596 node.parent = self
5597 end
5598
5599
5600 redef fun visit_all(v: Visitor)
5601 do
5602 v.enter_visit(_n_string)
5603 end
5604 end
5605 redef class ASuperstringExpr
5606 init init_asuperstringexpr (
5607 n_exprs: Collection[Object], # Should be Collection[AExpr]
5608 n_annotations: nullable AAnnotations
5609 )
5610 do
5611 self.n_exprs.unsafe_add_all(n_exprs)
5612 _n_annotations = n_annotations
5613 if n_annotations != null then n_annotations.parent = self
5614 end
5615
5616 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5617 do
5618 if n_exprs.replace_child(old_child, new_child) then return
5619 if _n_annotations == old_child then
5620 n_annotations = new_child.as(nullable AAnnotations)
5621 return
5622 end
5623 end
5624
5625 redef fun n_annotations=(node)
5626 do
5627 _n_annotations = node
5628 if node != null then node.parent = self
5629 end
5630
5631
5632 redef fun visit_all(v: Visitor)
5633 do
5634 n_exprs.visit_all(v)
5635 v.enter_visit(_n_annotations)
5636 end
5637 end
5638 redef class AParExpr
5639 init init_aparexpr (
5640 n_opar: nullable TOpar,
5641 n_expr: nullable AExpr,
5642 n_cpar: nullable TCpar,
5643 n_annotations: nullable AAnnotations
5644 )
5645 do
5646 _n_opar = n_opar.as(not null)
5647 n_opar.parent = self
5648 _n_expr = n_expr.as(not null)
5649 n_expr.parent = self
5650 _n_cpar = n_cpar.as(not null)
5651 n_cpar.parent = self
5652 _n_annotations = n_annotations
5653 if n_annotations != null then n_annotations.parent = self
5654 end
5655
5656 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5657 do
5658 if _n_opar == old_child then
5659 n_opar = new_child.as(TOpar)
5660 return
5661 end
5662 if _n_expr == old_child then
5663 n_expr = new_child.as(AExpr)
5664 return
5665 end
5666 if _n_cpar == old_child then
5667 n_cpar = new_child.as(TCpar)
5668 return
5669 end
5670 if _n_annotations == old_child then
5671 n_annotations = new_child.as(nullable AAnnotations)
5672 return
5673 end
5674 end
5675
5676 redef fun n_opar=(node)
5677 do
5678 _n_opar = node
5679 node.parent = self
5680 end
5681 redef fun n_expr=(node)
5682 do
5683 _n_expr = node
5684 node.parent = self
5685 end
5686 redef fun n_cpar=(node)
5687 do
5688 _n_cpar = node
5689 node.parent = self
5690 end
5691 redef fun n_annotations=(node)
5692 do
5693 _n_annotations = node
5694 if node != null then node.parent = self
5695 end
5696
5697
5698 redef fun visit_all(v: Visitor)
5699 do
5700 v.enter_visit(_n_opar)
5701 v.enter_visit(_n_expr)
5702 v.enter_visit(_n_cpar)
5703 v.enter_visit(_n_annotations)
5704 end
5705 end
5706 redef class AAsCastExpr
5707 init init_aascastexpr (
5708 n_expr: nullable AExpr,
5709 n_kwas: nullable TKwas,
5710 n_opar: nullable TOpar,
5711 n_type: nullable AType,
5712 n_cpar: nullable TCpar
5713 )
5714 do
5715 _n_expr = n_expr.as(not null)
5716 n_expr.parent = self
5717 _n_kwas = n_kwas.as(not null)
5718 n_kwas.parent = self
5719 _n_opar = n_opar
5720 if n_opar != null then n_opar.parent = self
5721 _n_type = n_type.as(not null)
5722 n_type.parent = self
5723 _n_cpar = n_cpar
5724 if n_cpar != null then n_cpar.parent = self
5725 end
5726
5727 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5728 do
5729 if _n_expr == old_child then
5730 n_expr = new_child.as(AExpr)
5731 return
5732 end
5733 if _n_kwas == old_child then
5734 n_kwas = new_child.as(TKwas)
5735 return
5736 end
5737 if _n_opar == old_child then
5738 n_opar = new_child.as(nullable TOpar)
5739 return
5740 end
5741 if _n_type == old_child then
5742 n_type = new_child.as(AType)
5743 return
5744 end
5745 if _n_cpar == old_child then
5746 n_cpar = new_child.as(nullable TCpar)
5747 return
5748 end
5749 end
5750
5751 redef fun n_expr=(node)
5752 do
5753 _n_expr = node
5754 node.parent = self
5755 end
5756 redef fun n_kwas=(node)
5757 do
5758 _n_kwas = node
5759 node.parent = self
5760 end
5761 redef fun n_opar=(node)
5762 do
5763 _n_opar = node
5764 if node != null then node.parent = self
5765 end
5766 redef fun n_type=(node)
5767 do
5768 _n_type = node
5769 node.parent = self
5770 end
5771 redef fun n_cpar=(node)
5772 do
5773 _n_cpar = node
5774 if node != null then node.parent = self
5775 end
5776
5777
5778 redef fun visit_all(v: Visitor)
5779 do
5780 v.enter_visit(_n_expr)
5781 v.enter_visit(_n_kwas)
5782 v.enter_visit(_n_opar)
5783 v.enter_visit(_n_type)
5784 v.enter_visit(_n_cpar)
5785 end
5786 end
5787 redef class AAsNotnullExpr
5788 init init_aasnotnullexpr (
5789 n_expr: nullable AExpr,
5790 n_kwas: nullable TKwas,
5791 n_opar: nullable TOpar,
5792 n_kwnot: nullable TKwnot,
5793 n_kwnull: nullable TKwnull,
5794 n_cpar: nullable TCpar
5795 )
5796 do
5797 _n_expr = n_expr.as(not null)
5798 n_expr.parent = self
5799 _n_kwas = n_kwas.as(not null)
5800 n_kwas.parent = self
5801 _n_opar = n_opar
5802 if n_opar != null then n_opar.parent = self
5803 _n_kwnot = n_kwnot.as(not null)
5804 n_kwnot.parent = self
5805 _n_kwnull = n_kwnull.as(not null)
5806 n_kwnull.parent = self
5807 _n_cpar = n_cpar
5808 if n_cpar != null then n_cpar.parent = self
5809 end
5810
5811 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5812 do
5813 if _n_expr == old_child then
5814 n_expr = new_child.as(AExpr)
5815 return
5816 end
5817 if _n_kwas == old_child then
5818 n_kwas = new_child.as(TKwas)
5819 return
5820 end
5821 if _n_opar == old_child then
5822 n_opar = new_child.as(nullable TOpar)
5823 return
5824 end
5825 if _n_kwnot == old_child then
5826 n_kwnot = new_child.as(TKwnot)
5827 return
5828 end
5829 if _n_kwnull == old_child then
5830 n_kwnull = new_child.as(TKwnull)
5831 return
5832 end
5833 if _n_cpar == old_child then
5834 n_cpar = new_child.as(nullable TCpar)
5835 return
5836 end
5837 end
5838
5839 redef fun n_expr=(node)
5840 do
5841 _n_expr = node
5842 node.parent = self
5843 end
5844 redef fun n_kwas=(node)
5845 do
5846 _n_kwas = node
5847 node.parent = self
5848 end
5849 redef fun n_opar=(node)
5850 do
5851 _n_opar = node
5852 if node != null then node.parent = self
5853 end
5854 redef fun n_kwnot=(node)
5855 do
5856 _n_kwnot = node
5857 node.parent = self
5858 end
5859 redef fun n_kwnull=(node)
5860 do
5861 _n_kwnull = node
5862 node.parent = self
5863 end
5864 redef fun n_cpar=(node)
5865 do
5866 _n_cpar = node
5867 if node != null then node.parent = self
5868 end
5869
5870
5871 redef fun visit_all(v: Visitor)
5872 do
5873 v.enter_visit(_n_expr)
5874 v.enter_visit(_n_kwas)
5875 v.enter_visit(_n_opar)
5876 v.enter_visit(_n_kwnot)
5877 v.enter_visit(_n_kwnull)
5878 v.enter_visit(_n_cpar)
5879 end
5880 end
5881 redef class AIssetAttrExpr
5882 init init_aissetattrexpr (
5883 n_kwisset: nullable TKwisset,
5884 n_expr: nullable AExpr,
5885 n_id: nullable TAttrid
5886 )
5887 do
5888 _n_kwisset = n_kwisset.as(not null)
5889 n_kwisset.parent = self
5890 _n_expr = n_expr.as(not null)
5891 n_expr.parent = self
5892 _n_id = n_id.as(not null)
5893 n_id.parent = self
5894 end
5895
5896 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5897 do
5898 if _n_kwisset == old_child then
5899 n_kwisset = new_child.as(TKwisset)
5900 return
5901 end
5902 if _n_expr == old_child then
5903 n_expr = new_child.as(AExpr)
5904 return
5905 end
5906 if _n_id == old_child then
5907 n_id = new_child.as(TAttrid)
5908 return
5909 end
5910 end
5911
5912 redef fun n_kwisset=(node)
5913 do
5914 _n_kwisset = node
5915 node.parent = self
5916 end
5917 redef fun n_expr=(node)
5918 do
5919 _n_expr = node
5920 node.parent = self
5921 end
5922 redef fun n_id=(node)
5923 do
5924 _n_id = node
5925 node.parent = self
5926 end
5927
5928
5929 redef fun visit_all(v: Visitor)
5930 do
5931 v.enter_visit(_n_kwisset)
5932 v.enter_visit(_n_expr)
5933 v.enter_visit(_n_id)
5934 end
5935 end
5936 redef class ADebugTypeExpr
5937 init init_adebugtypeexpr (
5938 n_kwdebug: nullable TKwdebug,
5939 n_kwtype: nullable TKwtype,
5940 n_expr: nullable AExpr,
5941 n_type: nullable AType
5942 )
5943 do
5944 _n_kwdebug = n_kwdebug.as(not null)
5945 n_kwdebug.parent = self
5946 _n_kwtype = n_kwtype.as(not null)
5947 n_kwtype.parent = self
5948 _n_expr = n_expr.as(not null)
5949 n_expr.parent = self
5950 _n_type = n_type.as(not null)
5951 n_type.parent = self
5952 end
5953
5954 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
5955 do
5956 if _n_kwdebug == old_child then
5957 n_kwdebug = new_child.as(TKwdebug)
5958 return
5959 end
5960 if _n_kwtype == old_child then
5961 n_kwtype = new_child.as(TKwtype)
5962 return
5963 end
5964 if _n_expr == old_child then
5965 n_expr = new_child.as(AExpr)
5966 return
5967 end
5968 if _n_type == old_child then
5969 n_type = new_child.as(AType)
5970 return
5971 end
5972 end
5973
5974 redef fun n_kwdebug=(node)
5975 do
5976 _n_kwdebug = node
5977 node.parent = self
5978 end
5979 redef fun n_kwtype=(node)
5980 do
5981 _n_kwtype = node
5982 node.parent = self
5983 end
5984 redef fun n_expr=(node)
5985 do
5986 _n_expr = node
5987 node.parent = self
5988 end
5989 redef fun n_type=(node)
5990 do
5991 _n_type = node
5992 node.parent = self
5993 end
5994
5995
5996 redef fun visit_all(v: Visitor)
5997 do
5998 v.enter_visit(_n_kwdebug)
5999 v.enter_visit(_n_kwtype)
6000 v.enter_visit(_n_expr)
6001 v.enter_visit(_n_type)
6002 end
6003 end
6004 redef class AVarargExpr
6005 init init_avarargexpr (
6006 n_expr: nullable AExpr,
6007 n_dotdotdot: nullable TDotdotdot
6008 )
6009 do
6010 _n_expr = n_expr.as(not null)
6011 n_expr.parent = self
6012 _n_dotdotdot = n_dotdotdot.as(not null)
6013 n_dotdotdot.parent = self
6014 end
6015
6016 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6017 do
6018 if _n_expr == old_child then
6019 n_expr = new_child.as(AExpr)
6020 return
6021 end
6022 if _n_dotdotdot == old_child then
6023 n_dotdotdot = new_child.as(TDotdotdot)
6024 return
6025 end
6026 end
6027
6028 redef fun n_expr=(node)
6029 do
6030 _n_expr = node
6031 node.parent = self
6032 end
6033 redef fun n_dotdotdot=(node)
6034 do
6035 _n_dotdotdot = node
6036 node.parent = self
6037 end
6038
6039
6040 redef fun visit_all(v: Visitor)
6041 do
6042 v.enter_visit(_n_expr)
6043 v.enter_visit(_n_dotdotdot)
6044 end
6045 end
6046 redef class ATypeExpr
6047 init init_atypeexpr (
6048 n_type: nullable AType
6049 )
6050 do
6051 _n_type = n_type.as(not null)
6052 n_type.parent = self
6053 end
6054
6055 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6056 do
6057 if _n_type == old_child then
6058 n_type = new_child.as(AType)
6059 return
6060 end
6061 end
6062
6063 redef fun n_type=(node)
6064 do
6065 _n_type = node
6066 node.parent = self
6067 end
6068
6069
6070 redef fun visit_all(v: Visitor)
6071 do
6072 v.enter_visit(_n_type)
6073 end
6074 end
6075 redef class AMethidExpr
6076 init init_amethidexpr (
6077 n_expr: nullable AExpr,
6078 n_id: nullable AMethid
6079 )
6080 do
6081 _n_expr = n_expr.as(not null)
6082 n_expr.parent = self
6083 _n_id = n_id.as(not null)
6084 n_id.parent = self
6085 end
6086
6087 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6088 do
6089 if _n_expr == old_child then
6090 n_expr = new_child.as(AExpr)
6091 return
6092 end
6093 if _n_id == old_child then
6094 n_id = new_child.as(AMethid)
6095 return
6096 end
6097 end
6098
6099 redef fun n_expr=(node)
6100 do
6101 _n_expr = node
6102 node.parent = self
6103 end
6104 redef fun n_id=(node)
6105 do
6106 _n_id = node
6107 node.parent = self
6108 end
6109
6110
6111 redef fun visit_all(v: Visitor)
6112 do
6113 v.enter_visit(_n_expr)
6114 v.enter_visit(_n_id)
6115 end
6116 end
6117 redef class AAtExpr
6118 init init_aatexpr (
6119 n_annotations: nullable AAnnotations
6120 )
6121 do
6122 _n_annotations = n_annotations.as(not null)
6123 n_annotations.parent = self
6124 end
6125
6126 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6127 do
6128 if _n_annotations == old_child then
6129 n_annotations = new_child.as(AAnnotations)
6130 return
6131 end
6132 end
6133
6134 redef fun n_annotations=(node)
6135 do
6136 _n_annotations = node
6137 node.parent = self
6138 end
6139
6140
6141 redef fun visit_all(v: Visitor)
6142 do
6143 v.enter_visit(_n_annotations)
6144 end
6145 end
6146 redef class AManyExpr
6147 init init_amanyexpr (
6148 n_exprs: Collection[Object] # Should be Collection[AExpr]
6149 )
6150 do
6151 self.n_exprs.unsafe_add_all(n_exprs)
6152 end
6153
6154 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6155 do
6156 if n_exprs.replace_child(old_child, new_child) then return
6157 end
6158
6159
6160
6161 redef fun visit_all(v: Visitor)
6162 do
6163 n_exprs.visit_all(v)
6164 end
6165 end
6166 redef class AListExprs
6167 init init_alistexprs (
6168 n_exprs: Collection[Object] # Should be Collection[AExpr]
6169 )
6170 do
6171 self.n_exprs.unsafe_add_all(n_exprs)
6172 end
6173
6174 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6175 do
6176 if n_exprs.replace_child(old_child, new_child) then return
6177 end
6178
6179
6180
6181 redef fun visit_all(v: Visitor)
6182 do
6183 n_exprs.visit_all(v)
6184 end
6185 end
6186 redef class AParExprs
6187 init init_aparexprs (
6188 n_opar: nullable TOpar,
6189 n_exprs: Collection[Object], # Should be Collection[AExpr]
6190 n_cpar: nullable TCpar
6191 )
6192 do
6193 _n_opar = n_opar.as(not null)
6194 n_opar.parent = self
6195 self.n_exprs.unsafe_add_all(n_exprs)
6196 _n_cpar = n_cpar.as(not null)
6197 n_cpar.parent = self
6198 end
6199
6200 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6201 do
6202 if _n_opar == old_child then
6203 n_opar = new_child.as(TOpar)
6204 return
6205 end
6206 if n_exprs.replace_child(old_child, new_child) then return
6207 if _n_cpar == old_child then
6208 n_cpar = new_child.as(TCpar)
6209 return
6210 end
6211 end
6212
6213 redef fun n_opar=(node)
6214 do
6215 _n_opar = node
6216 node.parent = self
6217 end
6218 redef fun n_cpar=(node)
6219 do
6220 _n_cpar = node
6221 node.parent = self
6222 end
6223
6224
6225 redef fun visit_all(v: Visitor)
6226 do
6227 v.enter_visit(_n_opar)
6228 n_exprs.visit_all(v)
6229 v.enter_visit(_n_cpar)
6230 end
6231 end
6232 redef class ABraExprs
6233 init init_abraexprs (
6234 n_obra: nullable TObra,
6235 n_exprs: Collection[Object], # Should be Collection[AExpr]
6236 n_cbra: nullable TCbra
6237 )
6238 do
6239 _n_obra = n_obra.as(not null)
6240 n_obra.parent = self
6241 self.n_exprs.unsafe_add_all(n_exprs)
6242 _n_cbra = n_cbra.as(not null)
6243 n_cbra.parent = self
6244 end
6245
6246 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6247 do
6248 if _n_obra == old_child then
6249 n_obra = new_child.as(TObra)
6250 return
6251 end
6252 if n_exprs.replace_child(old_child, new_child) then return
6253 if _n_cbra == old_child then
6254 n_cbra = new_child.as(TCbra)
6255 return
6256 end
6257 end
6258
6259 redef fun n_obra=(node)
6260 do
6261 _n_obra = node
6262 node.parent = self
6263 end
6264 redef fun n_cbra=(node)
6265 do
6266 _n_cbra = node
6267 node.parent = self
6268 end
6269
6270
6271 redef fun visit_all(v: Visitor)
6272 do
6273 v.enter_visit(_n_obra)
6274 n_exprs.visit_all(v)
6275 v.enter_visit(_n_cbra)
6276 end
6277 end
6278 redef class APlusAssignOp
6279 init init_aplusassignop (
6280 n_pluseq: nullable TPluseq
6281 )
6282 do
6283 _n_pluseq = n_pluseq.as(not null)
6284 n_pluseq.parent = self
6285 end
6286
6287 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6288 do
6289 if _n_pluseq == old_child then
6290 n_pluseq = new_child.as(TPluseq)
6291 return
6292 end
6293 end
6294
6295 redef fun n_pluseq=(node)
6296 do
6297 _n_pluseq = node
6298 node.parent = self
6299 end
6300
6301
6302 redef fun visit_all(v: Visitor)
6303 do
6304 v.enter_visit(_n_pluseq)
6305 end
6306 end
6307 redef class AMinusAssignOp
6308 init init_aminusassignop (
6309 n_minuseq: nullable TMinuseq
6310 )
6311 do
6312 _n_minuseq = n_minuseq.as(not null)
6313 n_minuseq.parent = self
6314 end
6315
6316 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6317 do
6318 if _n_minuseq == old_child then
6319 n_minuseq = new_child.as(TMinuseq)
6320 return
6321 end
6322 end
6323
6324 redef fun n_minuseq=(node)
6325 do
6326 _n_minuseq = node
6327 node.parent = self
6328 end
6329
6330
6331 redef fun visit_all(v: Visitor)
6332 do
6333 v.enter_visit(_n_minuseq)
6334 end
6335 end
6336 redef class AModuleName
6337 init init_amodulename (
6338 n_quad: nullable TQuad,
6339 n_path: Collection[Object], # Should be Collection[TId]
6340 n_id: nullable TId
6341 )
6342 do
6343 _n_quad = n_quad
6344 if n_quad != null then n_quad.parent = self
6345 self.n_path.unsafe_add_all(n_path)
6346 _n_id = n_id.as(not null)
6347 n_id.parent = self
6348 end
6349
6350 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6351 do
6352 if _n_quad == old_child then
6353 n_quad = new_child.as(nullable TQuad)
6354 return
6355 end
6356 if n_path.replace_child(old_child, new_child) then return
6357 if _n_id == old_child then
6358 n_id = new_child.as(TId)
6359 return
6360 end
6361 end
6362
6363 redef fun n_quad=(node)
6364 do
6365 _n_quad = node
6366 if node != null then node.parent = self
6367 end
6368 redef fun n_id=(node)
6369 do
6370 _n_id = node
6371 node.parent = self
6372 end
6373
6374
6375 redef fun visit_all(v: Visitor)
6376 do
6377 v.enter_visit(_n_quad)
6378 n_path.visit_all(v)
6379 v.enter_visit(_n_id)
6380 end
6381 end
6382 redef class AExternCalls
6383 init init_aexterncalls (
6384 n_kwimport: nullable TKwimport,
6385 n_extern_calls: Collection[Object] # Should be Collection[AExternCall]
6386 )
6387 do
6388 _n_kwimport = n_kwimport.as(not null)
6389 n_kwimport.parent = self
6390 self.n_extern_calls.unsafe_add_all(n_extern_calls)
6391 end
6392
6393 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6394 do
6395 if _n_kwimport == old_child then
6396 n_kwimport = new_child.as(TKwimport)
6397 return
6398 end
6399 if n_extern_calls.replace_child(old_child, new_child) then return
6400 end
6401
6402 redef fun n_kwimport=(node)
6403 do
6404 _n_kwimport = node
6405 node.parent = self
6406 end
6407
6408
6409 redef fun visit_all(v: Visitor)
6410 do
6411 v.enter_visit(_n_kwimport)
6412 n_extern_calls.visit_all(v)
6413 end
6414 end
6415 redef class AExternCall
6416 init init_aexterncall
6417 do
6418 end
6419
6420 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6421 do
6422 end
6423
6424
6425
6426 redef fun visit_all(v: Visitor)
6427 do
6428 end
6429 end
6430 redef class ASuperExternCall
6431 init init_asuperexterncall (
6432 n_kwsuper: nullable TKwsuper
6433 )
6434 do
6435 _n_kwsuper = n_kwsuper.as(not null)
6436 n_kwsuper.parent = self
6437 end
6438
6439 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6440 do
6441 if _n_kwsuper == old_child then
6442 n_kwsuper = new_child.as(TKwsuper)
6443 return
6444 end
6445 end
6446
6447 redef fun n_kwsuper=(node)
6448 do
6449 _n_kwsuper = node
6450 node.parent = self
6451 end
6452
6453
6454 redef fun visit_all(v: Visitor)
6455 do
6456 v.enter_visit(_n_kwsuper)
6457 end
6458 end
6459 redef class ALocalPropExternCall
6460 init init_alocalpropexterncall (
6461 n_methid: nullable AMethid
6462 )
6463 do
6464 _n_methid = n_methid.as(not null)
6465 n_methid.parent = self
6466 end
6467
6468 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6469 do
6470 if _n_methid == old_child then
6471 n_methid = new_child.as(AMethid)
6472 return
6473 end
6474 end
6475
6476 redef fun n_methid=(node)
6477 do
6478 _n_methid = node
6479 node.parent = self
6480 end
6481
6482
6483 redef fun visit_all(v: Visitor)
6484 do
6485 v.enter_visit(_n_methid)
6486 end
6487 end
6488 redef class AFullPropExternCall
6489 init init_afullpropexterncall (
6490 n_type: nullable AType,
6491 n_dot: nullable TDot,
6492 n_methid: nullable AMethid
6493 )
6494 do
6495 _n_type = n_type.as(not null)
6496 n_type.parent = self
6497 _n_dot = n_dot
6498 if n_dot != null then n_dot.parent = self
6499 _n_methid = n_methid.as(not null)
6500 n_methid.parent = self
6501 end
6502
6503 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6504 do
6505 if _n_type == old_child then
6506 n_type = new_child.as(AType)
6507 return
6508 end
6509 if _n_dot == old_child then
6510 n_dot = new_child.as(nullable TDot)
6511 return
6512 end
6513 if _n_methid == old_child then
6514 n_methid = new_child.as(AMethid)
6515 return
6516 end
6517 end
6518
6519 redef fun n_type=(node)
6520 do
6521 _n_type = node
6522 node.parent = self
6523 end
6524 redef fun n_dot=(node)
6525 do
6526 _n_dot = node
6527 if node != null then node.parent = self
6528 end
6529 redef fun n_methid=(node)
6530 do
6531 _n_methid = node
6532 node.parent = self
6533 end
6534
6535
6536 redef fun visit_all(v: Visitor)
6537 do
6538 v.enter_visit(_n_type)
6539 v.enter_visit(_n_dot)
6540 v.enter_visit(_n_methid)
6541 end
6542 end
6543 redef class AInitPropExternCall
6544 init init_ainitpropexterncall (
6545 n_type: nullable AType
6546 )
6547 do
6548 _n_type = n_type.as(not null)
6549 n_type.parent = self
6550 end
6551
6552 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6553 do
6554 if _n_type == old_child then
6555 n_type = new_child.as(AType)
6556 return
6557 end
6558 end
6559
6560 redef fun n_type=(node)
6561 do
6562 _n_type = node
6563 node.parent = self
6564 end
6565
6566
6567 redef fun visit_all(v: Visitor)
6568 do
6569 v.enter_visit(_n_type)
6570 end
6571 end
6572 redef class ACastAsExternCall
6573 init init_acastasexterncall (
6574 n_from_type: nullable AType,
6575 n_dot: nullable TDot,
6576 n_kwas: nullable TKwas,
6577 n_to_type: nullable AType
6578 )
6579 do
6580 _n_from_type = n_from_type.as(not null)
6581 n_from_type.parent = self
6582 _n_dot = n_dot
6583 if n_dot != null then n_dot.parent = self
6584 _n_kwas = n_kwas.as(not null)
6585 n_kwas.parent = self
6586 _n_to_type = n_to_type.as(not null)
6587 n_to_type.parent = self
6588 end
6589
6590 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6591 do
6592 if _n_from_type == old_child then
6593 n_from_type = new_child.as(AType)
6594 return
6595 end
6596 if _n_dot == old_child then
6597 n_dot = new_child.as(nullable TDot)
6598 return
6599 end
6600 if _n_kwas == old_child then
6601 n_kwas = new_child.as(TKwas)
6602 return
6603 end
6604 if _n_to_type == old_child then
6605 n_to_type = new_child.as(AType)
6606 return
6607 end
6608 end
6609
6610 redef fun n_from_type=(node)
6611 do
6612 _n_from_type = node
6613 node.parent = self
6614 end
6615 redef fun n_dot=(node)
6616 do
6617 _n_dot = node
6618 if node != null then node.parent = self
6619 end
6620 redef fun n_kwas=(node)
6621 do
6622 _n_kwas = node
6623 node.parent = self
6624 end
6625 redef fun n_to_type=(node)
6626 do
6627 _n_to_type = node
6628 node.parent = self
6629 end
6630
6631
6632 redef fun visit_all(v: Visitor)
6633 do
6634 v.enter_visit(_n_from_type)
6635 v.enter_visit(_n_dot)
6636 v.enter_visit(_n_kwas)
6637 v.enter_visit(_n_to_type)
6638 end
6639 end
6640 redef class AAsNullableExternCall
6641 init init_aasnullableexterncall (
6642 n_type: nullable AType,
6643 n_kwas: nullable TKwas,
6644 n_kwnullable: nullable TKwnullable
6645 )
6646 do
6647 _n_type = n_type.as(not null)
6648 n_type.parent = self
6649 _n_kwas = n_kwas.as(not null)
6650 n_kwas.parent = self
6651 _n_kwnullable = n_kwnullable.as(not null)
6652 n_kwnullable.parent = self
6653 end
6654
6655 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6656 do
6657 if _n_type == old_child then
6658 n_type = new_child.as(AType)
6659 return
6660 end
6661 if _n_kwas == old_child then
6662 n_kwas = new_child.as(TKwas)
6663 return
6664 end
6665 if _n_kwnullable == old_child then
6666 n_kwnullable = new_child.as(TKwnullable)
6667 return
6668 end
6669 end
6670
6671 redef fun n_type=(node)
6672 do
6673 _n_type = node
6674 node.parent = self
6675 end
6676 redef fun n_kwas=(node)
6677 do
6678 _n_kwas = node
6679 node.parent = self
6680 end
6681 redef fun n_kwnullable=(node)
6682 do
6683 _n_kwnullable = node
6684 node.parent = self
6685 end
6686
6687
6688 redef fun visit_all(v: Visitor)
6689 do
6690 v.enter_visit(_n_type)
6691 v.enter_visit(_n_kwas)
6692 v.enter_visit(_n_kwnullable)
6693 end
6694 end
6695 redef class AAsNotNullableExternCall
6696 init init_aasnotnullableexterncall (
6697 n_type: nullable AType,
6698 n_kwas: nullable TKwas,
6699 n_kwnot: nullable TKwnot,
6700 n_kwnullable: nullable TKwnullable
6701 )
6702 do
6703 _n_type = n_type.as(not null)
6704 n_type.parent = self
6705 _n_kwas = n_kwas.as(not null)
6706 n_kwas.parent = self
6707 _n_kwnot = n_kwnot.as(not null)
6708 n_kwnot.parent = self
6709 _n_kwnullable = n_kwnullable.as(not null)
6710 n_kwnullable.parent = self
6711 end
6712
6713 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6714 do
6715 if _n_type == old_child then
6716 n_type = new_child.as(AType)
6717 return
6718 end
6719 if _n_kwas == old_child then
6720 n_kwas = new_child.as(TKwas)
6721 return
6722 end
6723 if _n_kwnot == old_child then
6724 n_kwnot = new_child.as(TKwnot)
6725 return
6726 end
6727 if _n_kwnullable == old_child then
6728 n_kwnullable = new_child.as(TKwnullable)
6729 return
6730 end
6731 end
6732
6733 redef fun n_type=(node)
6734 do
6735 _n_type = node
6736 node.parent = self
6737 end
6738 redef fun n_kwas=(node)
6739 do
6740 _n_kwas = node
6741 node.parent = self
6742 end
6743 redef fun n_kwnot=(node)
6744 do
6745 _n_kwnot = node
6746 node.parent = self
6747 end
6748 redef fun n_kwnullable=(node)
6749 do
6750 _n_kwnullable = node
6751 node.parent = self
6752 end
6753
6754
6755 redef fun visit_all(v: Visitor)
6756 do
6757 v.enter_visit(_n_type)
6758 v.enter_visit(_n_kwas)
6759 v.enter_visit(_n_kwnot)
6760 v.enter_visit(_n_kwnullable)
6761 end
6762 end
6763 redef class AInLanguage
6764 init init_ainlanguage (
6765 n_kwin: nullable TKwin,
6766 n_string: nullable TString
6767 )
6768 do
6769 _n_kwin = n_kwin.as(not null)
6770 n_kwin.parent = self
6771 _n_string = n_string.as(not null)
6772 n_string.parent = self
6773 end
6774
6775 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6776 do
6777 if _n_kwin == old_child then
6778 n_kwin = new_child.as(TKwin)
6779 return
6780 end
6781 if _n_string == old_child then
6782 n_string = new_child.as(TString)
6783 return
6784 end
6785 end
6786
6787 redef fun n_kwin=(node)
6788 do
6789 _n_kwin = node
6790 node.parent = self
6791 end
6792 redef fun n_string=(node)
6793 do
6794 _n_string = node
6795 node.parent = self
6796 end
6797
6798
6799 redef fun visit_all(v: Visitor)
6800 do
6801 v.enter_visit(_n_kwin)
6802 v.enter_visit(_n_string)
6803 end
6804 end
6805 redef class AExternCodeBlock
6806 init init_aexterncodeblock (
6807 n_in_language: nullable AInLanguage,
6808 n_extern_code_segment: nullable TExternCodeSegment
6809 )
6810 do
6811 _n_in_language = n_in_language
6812 if n_in_language != null then n_in_language.parent = self
6813 _n_extern_code_segment = n_extern_code_segment.as(not null)
6814 n_extern_code_segment.parent = self
6815 end
6816
6817 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6818 do
6819 if _n_in_language == old_child then
6820 n_in_language = new_child.as(nullable AInLanguage)
6821 return
6822 end
6823 if _n_extern_code_segment == old_child then
6824 n_extern_code_segment = new_child.as(TExternCodeSegment)
6825 return
6826 end
6827 end
6828
6829 redef fun n_in_language=(node)
6830 do
6831 _n_in_language = node
6832 if node != null then node.parent = self
6833 end
6834 redef fun n_extern_code_segment=(node)
6835 do
6836 _n_extern_code_segment = node
6837 node.parent = self
6838 end
6839
6840
6841 redef fun visit_all(v: Visitor)
6842 do
6843 v.enter_visit(_n_in_language)
6844 v.enter_visit(_n_extern_code_segment)
6845 end
6846 end
6847 redef class AQualified
6848 init init_aqualified (
6849 n_id: Collection[Object], # Should be Collection[TId]
6850 n_classid: nullable TClassid
6851 )
6852 do
6853 self.n_id.unsafe_add_all(n_id)
6854 _n_classid = n_classid
6855 if n_classid != null then n_classid.parent = self
6856 end
6857
6858 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6859 do
6860 if n_id.replace_child(old_child, new_child) then return
6861 if _n_classid == old_child then
6862 n_classid = new_child.as(nullable TClassid)
6863 return
6864 end
6865 end
6866
6867 redef fun n_classid=(node)
6868 do
6869 _n_classid = node
6870 if node != null then node.parent = self
6871 end
6872
6873
6874 redef fun visit_all(v: Visitor)
6875 do
6876 n_id.visit_all(v)
6877 v.enter_visit(_n_classid)
6878 end
6879 end
6880 redef class ADoc
6881 init init_adoc (
6882 n_comment: Collection[Object] # Should be Collection[TComment]
6883 )
6884 do
6885 self.n_comment.unsafe_add_all(n_comment)
6886 end
6887
6888 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6889 do
6890 if n_comment.replace_child(old_child, new_child) then return
6891 end
6892
6893
6894
6895 redef fun visit_all(v: Visitor)
6896 do
6897 n_comment.visit_all(v)
6898 end
6899 end
6900 redef class AAnnotations
6901 init init_aannotations (
6902 n_at: nullable TAt,
6903 n_opar: nullable TOpar,
6904 n_items: Collection[Object], # Should be Collection[AAnnotation]
6905 n_cpar: nullable TCpar
6906 )
6907 do
6908 _n_at = n_at
6909 if n_at != null then n_at.parent = self
6910 _n_opar = n_opar
6911 if n_opar != null then n_opar.parent = self
6912 self.n_items.unsafe_add_all(n_items)
6913 _n_cpar = n_cpar
6914 if n_cpar != null then n_cpar.parent = self
6915 end
6916
6917 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6918 do
6919 if _n_at == old_child then
6920 n_at = new_child.as(nullable TAt)
6921 return
6922 end
6923 if _n_opar == old_child then
6924 n_opar = new_child.as(nullable TOpar)
6925 return
6926 end
6927 if n_items.replace_child(old_child, new_child) then return
6928 if _n_cpar == old_child then
6929 n_cpar = new_child.as(nullable TCpar)
6930 return
6931 end
6932 end
6933
6934 redef fun n_at=(node)
6935 do
6936 _n_at = node
6937 if node != null then node.parent = self
6938 end
6939 redef fun n_opar=(node)
6940 do
6941 _n_opar = node
6942 if node != null then node.parent = self
6943 end
6944 redef fun n_cpar=(node)
6945 do
6946 _n_cpar = node
6947 if node != null then node.parent = self
6948 end
6949
6950
6951 redef fun visit_all(v: Visitor)
6952 do
6953 v.enter_visit(_n_at)
6954 v.enter_visit(_n_opar)
6955 n_items.visit_all(v)
6956 v.enter_visit(_n_cpar)
6957 end
6958 end
6959 redef class AAnnotation
6960 init init_aannotation (
6961 n_doc: nullable ADoc,
6962 n_kwredef: nullable TKwredef,
6963 n_visibility: nullable AVisibility,
6964 n_atid: nullable AAtid,
6965 n_opar: nullable TOpar,
6966 n_args: Collection[Object], # Should be Collection[AExpr]
6967 n_cpar: nullable TCpar,
6968 n_annotations: nullable AAnnotations
6969 )
6970 do
6971 _n_doc = n_doc
6972 if n_doc != null then n_doc.parent = self
6973 _n_kwredef = n_kwredef
6974 if n_kwredef != null then n_kwredef.parent = self
6975 _n_visibility = n_visibility
6976 if n_visibility != null then n_visibility.parent = self
6977 _n_atid = n_atid.as(not null)
6978 n_atid.parent = self
6979 _n_opar = n_opar
6980 if n_opar != null then n_opar.parent = self
6981 self.n_args.unsafe_add_all(n_args)
6982 _n_cpar = n_cpar
6983 if n_cpar != null then n_cpar.parent = self
6984 _n_annotations = n_annotations
6985 if n_annotations != null then n_annotations.parent = self
6986 end
6987
6988 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
6989 do
6990 if _n_doc == old_child then
6991 n_doc = new_child.as(nullable ADoc)
6992 return
6993 end
6994 if _n_kwredef == old_child then
6995 n_kwredef = new_child.as(nullable TKwredef)
6996 return
6997 end
6998 if _n_visibility == old_child then
6999 n_visibility = new_child.as(nullable AVisibility)
7000 return
7001 end
7002 if _n_atid == old_child then
7003 n_atid = new_child.as(AAtid)
7004 return
7005 end
7006 if _n_opar == old_child then
7007 n_opar = new_child.as(nullable TOpar)
7008 return
7009 end
7010 if n_args.replace_child(old_child, new_child) then return
7011 if _n_cpar == old_child then
7012 n_cpar = new_child.as(nullable TCpar)
7013 return
7014 end
7015 if _n_annotations == old_child then
7016 n_annotations = new_child.as(nullable AAnnotations)
7017 return
7018 end
7019 end
7020
7021 redef fun n_doc=(node)
7022 do
7023 _n_doc = node
7024 if node != null then node.parent = self
7025 end
7026 redef fun n_kwredef=(node)
7027 do
7028 _n_kwredef = node
7029 if node != null then node.parent = self
7030 end
7031 redef fun n_visibility=(node)
7032 do
7033 _n_visibility = node
7034 if node != null then node.parent = self
7035 end
7036 redef fun n_atid=(node)
7037 do
7038 _n_atid = node
7039 node.parent = self
7040 end
7041 redef fun n_opar=(node)
7042 do
7043 _n_opar = node
7044 if node != null then node.parent = self
7045 end
7046 redef fun n_cpar=(node)
7047 do
7048 _n_cpar = node
7049 if node != null then node.parent = self
7050 end
7051 redef fun n_annotations=(node)
7052 do
7053 _n_annotations = node
7054 if node != null then node.parent = self
7055 end
7056
7057
7058 redef fun visit_all(v: Visitor)
7059 do
7060 v.enter_visit(_n_doc)
7061 v.enter_visit(_n_kwredef)
7062 v.enter_visit(_n_visibility)
7063 v.enter_visit(_n_atid)
7064 v.enter_visit(_n_opar)
7065 n_args.visit_all(v)
7066 v.enter_visit(_n_cpar)
7067 v.enter_visit(_n_annotations)
7068 end
7069 end
7070 redef class AIdAtid
7071 init init_aidatid (
7072 n_id: nullable TId
7073 )
7074 do
7075 _n_id = n_id.as(not null)
7076 n_id.parent = self
7077 end
7078
7079 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
7080 do
7081 if _n_id == old_child then
7082 n_id = new_child.as(TId)
7083 return
7084 end
7085 end
7086
7087 redef fun n_id=(node)
7088 do
7089 _n_id = node
7090 node.parent = self
7091 end
7092
7093
7094 redef fun visit_all(v: Visitor)
7095 do
7096 v.enter_visit(_n_id)
7097 end
7098 end
7099 redef class AKwexternAtid
7100 init init_akwexternatid (
7101 n_id: nullable TKwextern
7102 )
7103 do
7104 _n_id = n_id.as(not null)
7105 n_id.parent = self
7106 end
7107
7108 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
7109 do
7110 if _n_id == old_child then
7111 n_id = new_child.as(TKwextern)
7112 return
7113 end
7114 end
7115
7116 redef fun n_id=(node)
7117 do
7118 _n_id = node
7119 node.parent = self
7120 end
7121
7122
7123 redef fun visit_all(v: Visitor)
7124 do
7125 v.enter_visit(_n_id)
7126 end
7127 end
7128 redef class AKwabstractAtid
7129 init init_akwabstractatid (
7130 n_id: nullable TKwabstract
7131 )
7132 do
7133 _n_id = n_id.as(not null)
7134 n_id.parent = self
7135 end
7136
7137 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
7138 do
7139 if _n_id == old_child then
7140 n_id = new_child.as(TKwabstract)
7141 return
7142 end
7143 end
7144
7145 redef fun n_id=(node)
7146 do
7147 _n_id = node
7148 node.parent = self
7149 end
7150
7151
7152 redef fun visit_all(v: Visitor)
7153 do
7154 v.enter_visit(_n_id)
7155 end
7156 end
7157 redef class AKwimportAtid
7158 init init_akwimportatid (
7159 n_id: nullable TKwimport
7160 )
7161 do
7162 _n_id = n_id.as(not null)
7163 n_id.parent = self
7164 end
7165
7166 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
7167 do
7168 if _n_id == old_child then
7169 n_id = new_child.as(TKwimport)
7170 return
7171 end
7172 end
7173
7174 redef fun n_id=(node)
7175 do
7176 _n_id = node
7177 node.parent = self
7178 end
7179
7180
7181 redef fun visit_all(v: Visitor)
7182 do
7183 v.enter_visit(_n_id)
7184 end
7185 end
7186
7187 redef class Start
7188 redef fun replace_child(old_child: ANode, new_child: nullable ANode)
7189 do
7190 if _n_base == old_child then
7191 if new_child == null then
7192 else
7193 new_child.parent = self
7194 assert new_child isa AModule
7195 _n_base = new_child
7196 end
7197 old_child.parent = null
7198 return
7199 end
7200 end
7201
7202 redef fun visit_all(v: Visitor)
7203 do
7204 if _n_base != null then
7205 v.enter_visit(_n_base.as(not null))
7206 end
7207 v.enter_visit(_n_eof)
7208 end
7209 end