#274-Intermediate Code - Abstract Syntaxic Tree

Started coding some stuff, finally to be replaced later.

src/Commons/access.py

@@ -53,7 +53,7 @@ def __init__(self) -> None:
         self.append( self._DEFAULT )
 
     #-------------------------------------------------------------------------
-    def add_level(self, access_qualif: Access = None):
+    def add_level(self, access_qualif: Access = None) -> None:
         self._current_level += 1
         try:
             self[ self._current_level ] = access_qualif or self._DEFAULT

src/IntermediateCode/ic_ast.py

@@ -31,10 +31,10 @@ class ICAst( UTTree ):
     """
     The class of Abstract Syntaxic Trees.
     Those trees are created by the Front-End Parser.
-    They are used by the Front-End Elaborator, when elaborating symbols
-    and types for instance.
-    They are used also by the types checker.
-    FInally, they are used by the Back-End Programming-Language Translators.
+    They are used by the Front-End Elaborator,  when elaborating symbols and 
+    types for instance.
+    They are used also by the types checker - i.e. the Elaborator.
+    Finally, they are used by the Back-End Programming-Language Translators.
     """   
     #-------------------------------------------------------------------------
     def __init__(self) -> None:

src/Utils/Trees/ut_tree_node.py

@@ -44,16 +44,26 @@ def __init__(self, parent: UTTreeNodeBase = None, children: list = None) -> None
         '''
         super().__init__( parent, children or [] )
 
+    #-------------------------------------------------------------------------
+    def __add__(self, new_child: UTTreeNodeBase) -> UTTreeNodeBase:
+        '''
+        Appends a new child to the list of children of this tree node.
+        Implementation of operator '+'.
+        '''
+        self.content.append( new_child )
+        return self
+
     #-------------------------------------------------------------------------
     def __iadd__(self, new_child: UTTreeNodeBase) -> UTTreeNodeBase:
         '''
         Appends a new child to the list of children of this tree node.
+        Implementation of operator '+='.
         '''
         self.content.append( new_child )
         return self
 
     #-------------------------------------------------------------------------
-    def walk(self):
+    def walk(self) -> UTTreeNodeBase:
         '''
         Walks through the tree passing through this node.
         Walk-through is depth-first implemented.

src/Utils/Trees/ut_tree_node_base.py

@@ -39,7 +39,12 @@ def __init__(self, parent=None, content=None) -> None:
                 A reference to the content to be associated with this tree node.
         '''
         self.parent  = parent
-        self.content = content
+        if content is None:
+            self.content = []
+        elif isinstance( content, list ):
+            self.content = content
+        else:
+            self.content = [ content ]
 
     #-------------------------------------------------------------------------
     def walk(self) -> None: