CL_AST.java

Go to the documentation of this file.

import org.antlr.runtime.tree.*;
import org.antlr.runtime.Token;

final class CL_AST extends CommonTree {

    private TypeTree tipus;

    private boolean esReferenciable;

    CL_AST(Token t) {
        super(t);
        tipus = new TypeTree();
        esReferenciable = false;
    }

    //  // El metodo dupNode() no es neceario porque en este
    //  // compilador no se reescribe el AST:
    //  public Tree dupNode() {
    //      return new CL_AST(this);
    //  }

    TypeTree getTypeTree() {
        return tipus;
    }

    void setTypeTree(TypeTree t) {
        tipus = t;
    }

    void setTypeTree(int type) {
        tipus = new TypeTree(type);
    }

    void setTypeError() {
        tipus = new TypeTree(TypeCheck.TypeError);
    }

    boolean getReferenciable() {
        return esReferenciable;
    }

    void setReferenciable(boolean b) {
        esReferenciable = b;
    }

    public CL_AST getChild(int i) {
        return (CL_AST) super.getChild(i);
    }

    private String toNodeString() {
        switch (getType()) {
        case CLParser.IDENT:
        case CLParser.INT_CONST:
        case CLParser.STRING_CONST:
            return CLParser.tokenNames[getType()].toLowerCase() + "(" + getText() + ")";
        default:
            return getText();
        }
    }

    @Override
    public String toString() {
        String s = toNodeString();
        if (tipus.isTypeUndefined()) {
            return s;
        } else {
            s = s + "    <" + tipus.toStringTree() + ">";
            if (esReferenciable) {
                s = s + "    [R]";
            }
            return s;
        }
    }

    static private void toIndentedTreeString(CL_AST t, String s, StringBuffer sb) {
        if (t != null) {
            sb.append(t.toString() + "\n");
            if (t.getChildCount() > 0) {
                CL_AST child;
                String s1;
                for (int i = 0; i < t.getChildCount(); i++) {
                    sb.append(s + "  \\__");
                    child = (CL_AST) t.getChild(i);
                    if (i < t.getChildCount() - 1) {
                        s1 = s + "  |";
                    } else {
                        s1 = s + "   ";
                    }
                    for (int j = 0; j < child.toNodeString().length(); j++) {
                        s1 = s1 + " ";
                    }
                    toIndentedTreeString(child, s1, sb);
                }
            }
        }
    }

    static String toIndentedTreeString(CL_AST t) {
        StringBuffer sb = new StringBuffer();
        String s1 = "";
        for (int j = 0; j < new String("program").length() - 2; j++) {
            s1 = s1 + " ";
        }
        toIndentedTreeString(t, s1, sb);
        return sb.toString();
    }

}