package minijava; import syntaxtree.*; import visitor.*; import java.util.*; /** * Provides default methods which visit each node in the tree in depth-first * order. Your visitors may extend this class. */ public class TypeCheckSimp implements GJVisitor> { private int offset; private void printNode(Node n, HashMap argu, boolean enter, TypeEnum consensus) { for (int i=0; i < this.offset; ++i) Utilities.print_filter(".", false); if (enter) Utilities.print_filter("Visiting ", false); else Utilities.print_filter("Leaving ", false); Utilities.print_filter(n.getClass().getSimpleName(), false); if (!enter) { if (consensus == TypeEnum.ERROR) Utilities.print_filter(" did not type check.", false); else Utilities.print_filter(" found type " + consensus, false); } Utilities.print_filter("", true); } public TypeInstance visit(NodeList n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = new TypeInstance(null, TypeEnum.CHECK); int _count=0; for ( Enumeration e = n.elements(); e.hasMoreElements(); ) { TypeInstance node = e.nextElement().accept(this,argu); e.nextElement().accept(this,argu); if (node.get_type() == TypeEnum.ERROR) ret = node; _count++; } this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } public TypeInstance visit(NodeListOptional n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret; if ( n.present() ) { ret = new TypeInstance(null, TypeEnum.CHECK); int _count=0; for ( Enumeration e = n.elements(); e.hasMoreElements(); ) { TypeInstance node = e.nextElement().accept(this,argu); if (node.get_type() == TypeEnum.ERROR) ret = node; _count++; } } else ret = new TypeInstance(null, TypeEnum.CHECK); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } // FIXME public TypeInstance visit(NodeOptional n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret; if ( n.present() ) ret = n.node.accept(this,argu); else ret = new TypeInstance(null, TypeEnum.CHECK); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } public TypeInstance visit(NodeSequence n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = new TypeInstance(null, TypeEnum.CHECK); int _count=0; for ( Enumeration e = n.elements(); e.hasMoreElements(); ) { TypeInstance node = e.nextElement().accept(this,argu); if (node.get_type() == TypeEnum.ERROR) ret = node; _count++; } this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } public TypeInstance visit(NodeToken n, HashMap argu) { // A fixed string token. '⌣' ++this.offset; // Utilities.print_filter("Node " + n.toString(), true); // this.printNode(n, argu, false, null); --this.offset; return null; } // // User-generated visitor methods below // /** * f0 -> MainClass() * f1 -> ( TypeDeclaration() )* * f2 -> */ public TypeInstance visit(Goal n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = n.f0.accept(this, argu); n.f1.accept(this, argu); n.f2.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> "class" * f1 -> Identifier() * f2 -> "{" * f3 -> "public" * f4 -> "static" * f5 -> "void" * f6 -> "main" * f7 -> "(" * f8 -> "String" * f9 -> "[" * f10 -> "]" * f11 -> Identifier() * f12 -> ")" * f13 -> "{" * f14 -> ( VarDeclaration() )* * f15 -> ( Statement() )* * f16 -> "}" * f17 -> "}" */ public TypeInstance visit(MainClass n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); TypeInstance name = n.f1.accept(this, argu); n.f2.accept(this, argu); n.f3.accept(this, argu); n.f4.accept(this, argu); n.f5.accept(this, argu); n.f6.accept(this, argu); n.f7.accept(this, argu); n.f8.accept(this, argu); n.f9.accept(this, argu); n.f10.accept(this, argu); // TypeInstance args = n.f11.accept(this, argu); // FIXME Type in the main class declaration uses an illegal minijava type? n.f12.accept(this, argu); n.f13.accept(this, argu); TypeInstance var_dec = n.f14.accept(this, argu); TypeInstance stmt = n.f15.accept(this, argu); n.f16.accept(this, argu); n.f17.accept(this, argu); this.printNode(n, argu, false, stmt.get_type()); --this.offset; return stmt; } /** * f0 -> ClassDeclaration() * | ClassExtendsDeclaration() */ public TypeInstance visit(TypeDeclaration n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = n.f0.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> "class" * f1 -> Identifier() * f2 -> "{" * f3 -> ( VarDeclaration() )* * f4 -> ( MethodDeclaration() )* * f5 -> "}" */ public TypeInstance visit(ClassDeclaration n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); TypeInstance id = n.f1.accept(this, argu); n.f2.accept(this, argu); TypeInstance vars = n.f3.accept(this, argu); TypeInstance mehs = n.f4.accept(this, argu); n.f5.accept(this, argu); TypeInstance ret = (id.get_type() == TypeEnum.classname && vars.has_checked() && mehs.has_checked()) ? new TypeInstance(null, TypeEnum.CHECK) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> "class" * f1 -> Identifier() * f2 -> "extends" * f3 -> Identifier() * f4 -> "{" * f5 -> ( VarDeclaration() )* * f6 -> ( MethodDeclaration() )* * f7 -> "}" */ public TypeInstance visit(ClassExtendsDeclaration n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); TypeInstance id = n.f1.accept(this, argu); n.f2.accept(this, argu); TypeInstance ext = n.f3.accept(this, argu); n.f4.accept(this, argu); TypeInstance vars = n.f5.accept(this, argu); TypeInstance mehs = n.f6.accept(this, argu); n.f7.accept(this, argu); TypeInstance ret = (id.get_type() == TypeEnum.classname && vars.has_checked() && mehs.has_checked()) ? new TypeInstance(null, TypeEnum.CHECK) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } // FIXME (this may be ST-only) /** * f0 -> Type() * f1 -> Identifier() * f2 -> ";" */ public TypeInstance visit(VarDeclaration n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = n.f0.accept(this, argu); n.f1.accept(this, argu); n.f2.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } // FIXME /** * f0 -> "public" * f1 -> Type() * f2 -> Identifier() * f3 -> "(" * f4 -> ( FormalParameterList() )? * f5 -> ")" * f6 -> "{" * f7 -> ( VarDeclaration() )* * f8 -> ( Statement() )* * f9 -> "return" * f10 -> Expression() * f11 -> ";" * f12 -> "}" */ public TypeInstance visit(MethodDeclaration n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); TypeInstance ret_type = n.f1.accept(this, argu); n.f2.accept(this, argu); n.f3.accept(this, argu); n.f4.accept(this, argu); n.f5.accept(this, argu); n.f6.accept(this, argu); n.f7.accept(this, argu); TypeInstance stmt = n.f8.accept(this, argu); n.f9.accept(this, argu); TypeInstance retur = n.f10.accept(this, argu); n.f11.accept(this, argu); n.f12.accept(this, argu); TypeInstance ret = (stmt.equal_type(ret_type) && stmt.has_checked()) ? new TypeInstance(null, TypeEnum.CHECK) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> FormalParameter() * f1 -> ( FormalParameterRest() )* */ public TypeInstance visit(FormalParameterList n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance _ret=null; TypeInstance para1 = n.f0.accept(this, argu); TypeInstance parar = n.f1.accept(this, argu); TypeInstance ret = (para1.has_checked() && parar.has_checked()) ? new TypeInstance(null, TypeEnum.CHECK) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> Type() * f1 -> Identifier() */ public TypeInstance visit(FormalParameter n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = n.f0.accept(this, argu); n.f1.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> "," * f1 -> FormalParameter() */ public TypeInstance visit(FormalParameterRest n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); TypeInstance ret = n.f1.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> ArrayType() * | BooleanType() * | IntegerType() * | Identifier() */ public TypeInstance visit(Type n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = n.f0.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> "int" * f1 -> "[" * f2 -> "]" */ public TypeInstance visit(ArrayType n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = new TypeInstance(null, TypeEnum.int_array); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> "boolean" */ public TypeInstance visit(BooleanType n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = new TypeInstance(null, TypeEnum.bool); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> "int" */ public TypeInstance visit(IntegerType n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = new TypeInstance(null, TypeEnum.integer); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> Block() * | AssignmentStatement() * | ArrayAssignmentStatement() * | IfStatement() * | WhileStatement() * | PrintStatement() */ public TypeInstance visit(Statement n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = n.f0.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> "{" * f1 -> ( Statement() )* * f2 -> "}" */ public TypeInstance visit(Block n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); TypeInstance ret = n.f1.accept(this, argu); n.f2.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } // FIXME FIXME FIXME // Given we only have a few types, what is a subtype of what? /** * [23]: Expression is a subtype of identifier, and e typechecks* * * f0 -> Identifier() * f1 -> "=" * f2 -> Expression() * f3 -> ";" */ public TypeInstance visit(AssignmentStatement n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance lhs = n.f0.accept(this, argu); n.f1.accept(this, argu); TypeInstance rhs = n.f2.accept(this, argu); n.f3.accept(this, argu); TypeInstance ret = (lhs.equal_type(rhs)) ? new TypeInstance(null, TypeEnum.CHECK) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } // FIXME (this may be done) /** * [24]: Identifier is an integer array, expressions are both integers * * f0 -> Identifier() * f1 -> "[" * f2 -> Expression() * f3 -> "]" * f4 -> "=" * f5 -> Expression() * f6 -> ";" */ public TypeInstance visit(ArrayAssignmentStatement n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance id = n.f0.accept(this, argu); n.f1.accept(this, argu); TypeInstance index = n.f2.accept(this, argu); n.f3.accept(this, argu); n.f4.accept(this, argu); TypeInstance value = n.f5.accept(this, argu); n.f6.accept(this, argu); TypeInstance ret = (id.get_type() == TypeEnum.int_array && index.get_type() == TypeEnum.integer && value.get_type() == TypeEnum.integer) ? new TypeInstance(null, TypeEnum.CHECK) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * DONE [25]: Expression is a bool, both statements type-check * * f0 -> "if" * f1 -> "(" * f2 -> Expression() * f3 -> ")" * f4 -> Statement() * f5 -> "else" * f6 -> Statement() */ public TypeInstance visit(IfStatement n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); n.f1.accept(this, argu); TypeInstance expr = n.f2.accept(this, argu); n.f3.accept(this, argu); TypeInstance stmt1 = n.f4.accept(this, argu); n.f5.accept(this, argu); TypeInstance stmt2 = n.f6.accept(this, argu); TypeInstance ret = (expr.get_type() == TypeEnum.bool && stmt1.get_type() == stmt2.get_type() && stmt1.has_checked()) ? new TypeInstance(null, TypeEnum.CHECK) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * DONE [26]: Expression is a bool, statement type-checks * * f0 -> "while" * f1 -> "(" * f2 -> Expression() * f3 -> ")" * f4 -> Statement() */ public TypeInstance visit(WhileStatement n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); n.f1.accept(this, argu); TypeInstance expr = n.f2.accept(this, argu); n.f3.accept(this, argu); TypeInstance stmt = n.f4.accept(this, argu); TypeInstance ret = (expr.get_type() == TypeEnum.bool && stmt.has_checked()) ? new TypeInstance(null, TypeEnum.CHECK) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * DONE [27]: Expression is an integer * * f0 -> "System.out.println" * f1 -> "(" * f2 -> Expression() * f3 -> ")" * f4 -> ";" */ public TypeInstance visit(PrintStatement n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); n.f1.accept(this, argu); TypeInstance ret = n.f2.accept(this, argu); n.f3.accept(this, argu); n.f4.accept(this, argu); ret = (ret.get_type() == TypeEnum.integer) ? new TypeInstance(null, TypeEnum.CHECK) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> AndExpression() * | CompareExpression() * | PlusExpression() * | MinusExpression() * | TimesExpression() * | ArrayLookup() * | ArrayLength() * | MessageSend() * | PrimaryExpression() */ public TypeInstance visit(Expression n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = n.f0.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * DONE [28]: If expressions are both booleans, return is a boolean * * f0 -> PrimaryExpression() * f1 -> "&&" * f2 -> PrimaryExpression() */ public TypeInstance visit(AndExpression n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance oper1 = n.f0.accept(this, argu); n.f1.accept(this, argu); TypeInstance oper2 = n.f2.accept(this, argu); TypeInstance ret = (oper1.get_type() == TypeEnum.bool && oper2.get_type() == TypeEnum.bool) ? new TypeInstance(null, TypeEnum.bool) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * DONE [29]: If expressions are both integers, return is a boolean * * f0 -> PrimaryExpression() * f1 -> "<" * f2 -> PrimaryExpression() */ public TypeInstance visit(CompareExpression n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance oper1 = n.f0.accept(this, argu); n.f1.accept(this, argu); TypeInstance oper2 = n.f2.accept(this, argu); TypeInstance ret = (oper1.get_type() == TypeEnum.integer && oper2.get_type() == TypeEnum.integer) ? new TypeInstance(null, TypeEnum.bool) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * DONE [30]: If expressions are both integers, return is an integer * * f0 -> PrimaryExpression() * f1 -> "+" * f2 -> PrimaryExpression() */ public TypeInstance visit(PlusExpression n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance oper1 = n.f0.accept(this, argu); n.f1.accept(this, argu); TypeInstance oper2 = n.f2.accept(this, argu); TypeInstance ret = (oper1.get_type() == TypeEnum.integer && oper2.get_type() == TypeEnum.integer) ? new TypeInstance(null, TypeEnum.integer) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * DONE [31]: If expressions are both integers, return is an integer * * f0 -> PrimaryExpression() * f1 -> "-" * f2 -> PrimaryExpression() */ public TypeInstance visit(MinusExpression n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance oper1 = n.f0.accept(this, argu); n.f1.accept(this, argu); TypeInstance oper2 = n.f2.accept(this, argu); TypeInstance ret = (oper1.get_type() == TypeEnum.integer && oper2.get_type() == TypeEnum.integer) ? new TypeInstance(null, TypeEnum.integer) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * DONE [32]: If expressions are both integers, return is an integer * * f0 -> PrimaryExpression() * f1 -> "*" * f2 -> PrimaryExpression() */ public TypeInstance visit(TimesExpression n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance oper1 = n.f0.accept(this, argu); n.f1.accept(this, argu); TypeInstance oper2 = n.f2.accept(this, argu); TypeInstance ret = (oper1.get_type() == TypeEnum.integer && oper2.get_type() == TypeEnum.integer) ? new TypeInstance(null, TypeEnum.integer) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * DONE [33]: If expr1 is an integer array and expr2 is an int, * return is an int * * f0 -> PrimaryExpression() * f1 -> "[" * f2 -> PrimaryExpression() * f3 -> "]" */ public TypeInstance visit(ArrayLookup n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance array = n.f0.accept(this, argu); n.f1.accept(this, argu); TypeInstance index = n.f2.accept(this, argu); n.f3.accept(this, argu); TypeInstance ret = (array.get_type() == TypeEnum.int_array && index.get_type() == TypeEnum.integer) ? new TypeInstance(null, TypeEnum.integer) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * DONE [34]: If expr1 is an integer array, return is an int * * f0 -> PrimaryExpression() * f1 -> "." * f2 -> "length" */ public TypeInstance visit(ArrayLength n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = n.f0.accept(this, argu); n.f1.accept(this, argu); n.f2.accept(this, argu); ret = (ret.get_type() == TypeEnum.int_array) ? new TypeInstance(null, TypeEnum.integer) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } // FIXME FIXME FIXME /** * [35]: * * f0 -> PrimaryExpression() * f1 -> "." * f2 -> Identifier() * f3 -> "(" * f4 -> ( ExpressionList() )? * f5 -> ")" */ public TypeInstance visit(MessageSend n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); n.f1.accept(this, argu); n.f2.accept(this, argu); n.f3.accept(this, argu); n.f4.accept(this, argu); n.f5.accept(this, argu); --this.offset; return new TypeInstance(null, TypeEnum.ERROR); } // FIXME /** * f0 -> Expression() * f1 -> ( ExpressionRest() )* */ public TypeInstance visit(ExpressionList n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance expr1 = n.f0.accept(this, argu); TypeInstance exprr = n.f1.accept(this, argu); TypeInstance ret = (expr1.has_checked() && exprr.has_checked()) ? new TypeInstance(null, TypeEnum.CHECK) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> "," * f1 -> Expression() */ public TypeInstance visit(ExpressionRest n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); TypeInstance ret = n.f1.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * f0 -> IntegerLiteral() * | TrueLiteral() * | FalseLiteral() * | Identifier() * | ThisExpression() * | ArrayAllocationExpression() * | AllocationExpression() * | NotExpression() * | BracketExpression() */ public TypeInstance visit(PrimaryExpression n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = n.f0.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * DONE [36]: return is an int * * * f0 -> */ public TypeInstance visit(IntegerLiteral n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); this.printNode(n, argu, false, TypeEnum.integer); --this.offset; return new TypeInstance(null, TypeEnum.integer); } /** * DONE [37]: return is a bool * * f0 -> "true" */ public TypeInstance visit(TrueLiteral n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); this.printNode(n, argu, false, TypeEnum.bool); --this.offset; return new TypeInstance(null, TypeEnum.bool); } /** * DONE [38]: return is a bool * * f0 -> "false" */ public TypeInstance visit(FalseLiteral n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); this.printNode(n, argu, false, TypeEnum.bool); --this.offset; return new TypeInstance(null, TypeEnum.bool); } // FIXME /** * [39]: id is a symbol in the current domain, return is id's type * * f0 -> */ public TypeInstance visit(Identifier n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); TypeInstance ret = (argu.get(n.f0.tokenImage) != null) ? argu.get(n.f0.tokenImage) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } // FIXME FIXME FIXME /** * [40]: method exists? but where is the token? * * f0 -> "this" */ public TypeInstance visit(ThisExpression n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); TypeInstance ret = new TypeInstance(null, TypeEnum.CHECK); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * DONE [41]: if expression is an integer, return is an int array * * f0 -> "new" * f1 -> "int" * f2 -> "[" * f3 -> Expression() * f4 -> "]" */ public TypeInstance visit(ArrayAllocationExpression n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); n.f1.accept(this, argu); n.f2.accept(this, argu); TypeInstance ret = n.f3.accept(this, argu); n.f4.accept(this, argu); ret = (ret.get_type() == TypeEnum.integer) ? new TypeInstance(null, TypeEnum.int_array) : new TypeInstance(null, TypeEnum.ERROR); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } // FIXME /** * [42]: * * f0 -> "new" * f1 -> Identifier() * f2 -> "(" * f3 -> ")" */ public TypeInstance visit(AllocationExpression n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); TypeInstance ret = n.f1.accept(this, argu); n.f2.accept(this, argu); n.f3.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } /** * [43]: if expression is a boolean, return is a boolean * * f0 -> "!" * f1 -> Expression() */ public TypeInstance visit(NotExpression n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); TypeInstance ret = n.f1.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return (ret.get_type() == TypeEnum.bool) ? ret : new TypeInstance(null, TypeEnum.ERROR); } /** * [44]: if e is a type, return is that same type * * f0 -> "(" * f1 -> Expression() * f2 -> ")" */ public TypeInstance visit(BracketExpression n, HashMap argu) { ++this.offset; this.printNode(n, argu, true, null); n.f0.accept(this, argu); TypeInstance ret = n.f1.accept(this, argu); n.f2.accept(this, argu); this.printNode(n, argu, false, ret.get_type()); --this.offset; return ret; } }