Ready for Release 0.40.3

Author: cpp-tutor

Driver.d

@@ -19,7 +19,8 @@ int main(const string[] args) {
     }
     auto symtab = new SymbolTable(cast(Edition)edition);
     auto lexer = new LexerImpl(symtab);
-    stderr.writeln("BASIC The ", to!string(symtab.edition), symtab.edition > MAX_SUPPORTED_EDITION ? " (not yet implemented)" : "");
+    stderr.writeln("BASIC The ", to!string(symtab.edition),
+        symtab.edition > MAX_SUPPORTED_EDITION ? " (not yet implemented)" : "");
     auto head = new Node(symtab);
     auto parser = new Parser(lexer, symtab, head);
     auto msg = collectExceptionMsg(parser.parse());

Expr.d

@@ -2,11 +2,11 @@ import std.stdio : writeln, write;
 import Node : Node;
 import SymbolTable : SymbolTable, Edition;
 
-public enum Op { Add, Sub, Mul, Div, Exp, Neg };
+public enum Op { Add, Sub, Mul, Div, Exp, Neg }
 public immutable int number_fp_regs = 8;
 
 class Expr : Node {
-    protected enum Register { Available, InUse, Reserved };
+    protected enum Register { Available, InUse, Reserved }
     static private Register[number_fp_regs] regs;
     static void clearRegs() {
         regs[0] = regs[1] = Register.Reserved; // d0, d1, s0, s1, s2, s3
@@ -17,7 +17,7 @@ class Expr : Node {
         }
     }
     static int allocateReg() {
-        for (int r = regs.length - 1; r >= 0; --r) {
+        for (int r = number_fp_regs - 1; r >= 0; --r) {
             if (regs[r] == Register.Available) {
                 regs[r] = Register.InUse;
                 return r;

Node.d

@@ -481,17 +481,17 @@ class For : Node {
         if (stack.length == 0) {
             return -1;
         }
-        int id = stack[$ - 1];
+        int popped = stack[$ - 1];
         stack = stack[0 .. $ - 1];
-        return id;
+        return popped;
     }
     static int popID() {
         if (ident_stack.length == 0) {
             return -1;
         }
-        int id = ident_stack[$ - 1];
+        int popped_id = ident_stack[$ - 1];
         ident_stack = ident_stack[0 .. $ - 1];
-        return id;
+        return popped_id;
     }
     this(int i, Expr b, Expr e, Expr s) {
         left = new Node(new Node(b, e), s);