package typecheck;

import java.util.*;

import syntaxtree.*;

public class Scope {
    private Map<Symbol, Binder> table = new HashMap<>();
    private Scope parent;
    private Node bind;

    public Scope(Node b) {
        parent = null;
        bind = b;
    }

    public Scope(Scope p, Node b) {
        parent = p;
        bind = b;
    }

    public void add(Symbol sy, Node t, Scope sc) {
        table.put(sy, new Binder(sy, t, sc));
    }

    public Binder lookup(Symbol s) {
        Binder b = table.get(s);

        if (b != null)
            return b;
        // Lookup recursively
        else if (parent != null)
            return parent.lookup(s);
        else
            return null;
    }

    public Binder lookupLocal(Symbol s) {
        Binder b = table.get(s);

        if (b != null)
            return b;
        else
            return null;
    }

    public Scope getParent() {
        return parent;
    }

    public Node getNodeBound() {
        return bind;
    }
}

@@ -121,16 +121,22 @@
 e = new 
+Linked
 HashMap%3C

Change table in Scope to LinkedHashMap to keep the insertion order.