codegen while implemented, test added

src/ast/Python3VisitorImpl.java

@@ -504,7 +504,6 @@ public Node visitFor_stmt(For_stmtContext ctx) {
     }
 
     private void optimizeWithThird(BlockNode block, int lineStart, int lineStop, int index) {
-        int counter = 0;
         ArrayList<Node> stms = block.getChilds();
         for (var e : stms) {
             if (e instanceof SimpleStmtsNode) {
@@ -543,7 +542,6 @@ private void optimizeWithThird(BlockNode block, int lineStart, int lineStop, int
                                         rewriter.replace(firstToken, lastToken, newVar);
                                     }
                                 }
-                                counter++;
                             }
                         }
                     }

src/ast/nodes/WhileStmtNode.java

@@ -4,6 +4,7 @@
 import java.util.ArrayList;
 import semanticanalysis.SemanticError;
 import semanticanalysis.SymbolTable;
+import codegen.Label;
 
 /**
  * Node for the `while_stmt` statement of the grammar.
@@ -33,12 +34,21 @@ public Type typeCheck() {
         return new VoidType();
     }
 
-    /**
-     * NOTE: It is not a part for this project.
-     */
     @Override
     public String codeGeneration() {
-        return "";
+        String startLabel = Label.newBasic("start");
+        String endLabel = Label.newBasic("end");
+
+        String exprS = expr.codeGeneration();
+        String blockS = block.codeGeneration();
+
+        return startLabel + ":\n" +
+                exprS +
+                "storei T1 0\n" +
+                "beq A0 T1 " + endLabel + "\n" +
+                blockS +
+                "b " + startLabel + "\n" +
+                endLabel + ":\n";
     }
 
     @Override

src/codegen/Label.java

@@ -41,6 +41,6 @@ public static String newFun(String base) {
 
 
     public static String newVar() {
-        return "_tmp" + (varDefCount++);
+        return "tmp" + (varDefCount++);
     }
 }

test/2f.py

@@ -3,8 +3,8 @@
 counter = 1
 result = 1
 
-while n - 1 == counter:
+while n - 1 != counter:
     result = result * counter
-    counter = counter - 1
+    counter = counter + 1
 
 print(result)

test/2g-fibonacci.py

@@ -0,0 +1,13 @@
+n = 9
+
+a = 0
+b = 1
+c = 0
+i = 0
+while i < n - 2:
+    c = a + b
+    a = b
+    b = c
+    i = i + 1
+
+print(c)