Introduction to recursive function

progs/test.py

@@ -1,6 +1,2 @@
 def unibo(a):
-    if a == 3:
-        print("UNIBO")
-
-a = 3
-unibo(a)
+    unibo(a)

src/ast/nodes/BlockNode.java

@@ -3,6 +3,8 @@
 import java.util.ArrayList;
 
 import ast.types.*;
+import semanticanalysis.SemanticError;
+import semanticanalysis.SymbolTable;
 
 /**
  * Node for `block` statement of the grammar.
@@ -13,6 +15,19 @@ public BlockNode(ArrayList<Node> childs) {
         super(childs);
     }
 
+    @Override
+    public ArrayList<SemanticError> checkSemantics(SymbolTable ST, int _nesting) {
+        ArrayList<SemanticError> errors = new ArrayList<SemanticError>();
+
+        // Check semantics for each child
+        for (Node child : childs) {
+            errors.addAll(child.checkSemantics(ST, _nesting));
+        }
+
+        return errors;
+    }
+
+
     @Override
     public Type typeCheck() {
         return new VoidType();

src/ast/nodes/FuncdefNode.java

@@ -33,6 +33,8 @@ public ArrayList<SemanticError> checkSemantics(SymbolTable ST, int _nesting) {
 
         ST.add(HM);
 
+        ST.insert(this.name.toString(), this.block.typeCheck(), _nesting + 1, "");
+
         if (paramlist != null) {
             errors.addAll(paramlist.checkSemantics(ST, _nesting + 1));
         }