6 public class SemanticCheck {
10 public SemanticCheck(State state, TypeUtil tu) {
15 public void semanticCheck() {
16 SymbolTable classtable=state.getClassSymbolTable();
17 Iterator it=classtable.getDescriptorsIterator();
18 // Do descriptors first
20 ClassDescriptor cd=(ClassDescriptor)it.next();
21 System.out.println("Checking class: "+cd);
22 //Set superclass link up
23 if (cd.getSuper()!=null) {
24 cd.setSuper(typeutil.getClass(cd.getSuper()));
25 // Link together Field, Method, and Flag tables so classes
26 // inherit these from their superclasses
27 cd.getFieldTable().setParent(cd.getSuperDesc().getFieldTable());
28 cd.getMethodTable().setParent(cd.getSuperDesc().getMethodTable());
29 cd.getFlagTable().setParent(cd.getSuperDesc().getFlagTable());
32 /* Check to see that fields are well typed */
33 for(Iterator field_it=cd.getFields();field_it.hasNext();) {
34 FieldDescriptor fd=(FieldDescriptor)field_it.next();
35 System.out.println("Checking field: "+fd);
39 for(Iterator method_it=cd.getMethods();method_it.hasNext();) {
40 MethodDescriptor md=(MethodDescriptor)method_it.next();
45 it=classtable.getDescriptorsIterator();
46 // Do descriptors first
48 ClassDescriptor cd=(ClassDescriptor)it.next();
49 for(Iterator method_it=cd.getMethods();method_it.hasNext();) {
50 MethodDescriptor md=(MethodDescriptor)method_it.next();
51 checkMethodBody(cd,md);
55 for(Iterator task_it=state.getTaskSymbolTable().getDescriptorsIterator();task_it.hasNext();) {
56 TaskDescriptor td=(TaskDescriptor)task_it.next();
63 public void checkTypeDescriptor(TypeDescriptor td) {
67 String name=td.toString();
68 ClassDescriptor field_cd=(ClassDescriptor)state.getClassSymbolTable().get(name);
70 throw new Error("Undefined class "+name);
71 td.setClassDescriptor(field_cd);
77 public void checkField(ClassDescriptor cd, FieldDescriptor fd) {
78 checkTypeDescriptor(fd.getType());
81 public void checkFlagEffects(TaskDescriptor td, Vector vfe) {
82 for(int i=0;i<vfe.size();i++) {
83 FlagEffects fe=(FlagEffects) vfe.get(i);
84 String varname=fe.getName();
85 //Make sure the variable is declared as a parameter to the task
86 VarDescriptor vd=(VarDescriptor)td.getParameterTable().get(varname);
88 throw new Error("Parameter "+varname+" in Flag Effects not declared");
91 //Make sure it correspods to a class
92 TypeDescriptor type_d=vd.getType();
93 if (!type_d.isClass())
94 throw new Error("Cannot have non-object argument for flag_effect");
96 ClassDescriptor cd=type_d.getClassDesc();
97 for(int j=0;j<fe.numEffects();j++) {
98 FlagEffect flag=fe.getEffect(j);
99 String name=flag.getName();
100 FlagDescriptor flag_d=(FlagDescriptor)cd.getFlagTable().get(name);
101 //Make sure the flag is declared
103 throw new Error("Flag descriptor "+name+" undefined in class: "+cd.getSymbol());
104 flag.setFlag(flag_d);
109 public void checkTask(TaskDescriptor td) {
110 for(int i=0;i<td.numParameters();i++) {
111 /* Check that parameter is well typed */
112 TypeDescriptor param_type=td.getParamType(i);
113 checkTypeDescriptor(param_type);
115 /* Check the parameter's flag expression is well formed */
116 FlagExpressionNode fen=td.getFlag(td.getParameter(i));
117 if (!param_type.isClass())
118 throw new Error("Cannot have non-object argument to a task");
119 ClassDescriptor cd=param_type.getClassDesc();
120 checkFlagExpressionNode(cd, fen);
121 checkFlagEffects(td, td.getFlagEffects());
123 /* Check that the task code is valid */
124 BlockNode bn=state.getMethodBody(td);
125 checkBlockNode(td, td.getParameterTable(),bn);
129 public void checkFlagExpressionNode(ClassDescriptor cd, FlagExpressionNode fen) {
131 case Kind.FlagOpNode:
133 FlagOpNode fon=(FlagOpNode)fen;
134 checkFlagExpressionNode(cd, fon.getLeft());
135 if (fon.getRight()!=null)
136 checkFlagExpressionNode(cd, fon.getRight());
141 FlagNode fn=(FlagNode)fen;
142 String name=fn.getFlagName();
143 FlagDescriptor fd=(FlagDescriptor)cd.getFlagTable().get(name);
145 throw new Error("Undeclared flag: "+name);
150 throw new Error("Unrecognized FlagExpressionNode");
154 public void checkMethod(ClassDescriptor cd, MethodDescriptor md) {
155 /* Check return type */
156 if (!md.isConstructor())
157 if (!md.getReturnType().isVoid())
158 checkTypeDescriptor(md.getReturnType());
160 for(int i=0;i<md.numParameters();i++) {
161 TypeDescriptor param_type=md.getParamType(i);
162 checkTypeDescriptor(param_type);
164 /* Link the naming environments */
165 if (!md.isStatic()) /* Fields aren't accessible directly in a static method, so don't link in this table */
166 md.getParameterTable().setParent(cd.getFieldTable());
168 if (!md.isStatic()) {
169 VarDescriptor thisvd=new VarDescriptor(new TypeDescriptor(cd),"this");
174 public void checkMethodBody(ClassDescriptor cd, MethodDescriptor md) {
175 System.out.println("Processing method:"+md);
176 BlockNode bn=state.getMethodBody(md);
177 checkBlockNode(md, md.getParameterTable(),bn);
180 public void checkBlockNode(Descriptor md, SymbolTable nametable, BlockNode bn) {
181 /* Link in the naming environment */
182 bn.getVarTable().setParent(nametable);
183 for(int i=0;i<bn.size();i++) {
184 BlockStatementNode bsn=bn.get(i);
185 checkBlockStatementNode(md, bn.getVarTable(),bsn);
189 public void checkBlockStatementNode(Descriptor md, SymbolTable nametable, BlockStatementNode bsn) {
191 case Kind.BlockExpressionNode:
192 checkBlockExpressionNode(md, nametable,(BlockExpressionNode)bsn);
195 case Kind.DeclarationNode:
196 checkDeclarationNode(md, nametable, (DeclarationNode)bsn);
199 case Kind.IfStatementNode:
200 checkIfStatementNode(md, nametable, (IfStatementNode)bsn);
204 checkLoopNode(md, nametable, (LoopNode)bsn);
207 case Kind.ReturnNode:
208 checkReturnNode(md, nametable, (ReturnNode)bsn);
211 case Kind.TaskExitNode:
212 checkTaskExitNode(md, nametable, (TaskExitNode)bsn);
215 case Kind.SubBlockNode:
216 checkSubBlockNode(md, nametable, (SubBlockNode)bsn);
222 void checkBlockExpressionNode(Descriptor md, SymbolTable nametable, BlockExpressionNode ben) {
223 checkExpressionNode(md, nametable, ben.getExpression(), null);
226 void checkDeclarationNode(Descriptor md, SymbolTable nametable, DeclarationNode dn) {
227 VarDescriptor vd=dn.getVarDescriptor();
228 checkTypeDescriptor(vd.getType());
229 Descriptor d=nametable.get(vd.getSymbol());
231 (d instanceof FieldDescriptor)) {
234 throw new Error(vd.getSymbol()+" defined a second time");
235 if (dn.getExpression()!=null)
236 checkExpressionNode(md, nametable, dn.getExpression(), vd.getType());
239 void checkSubBlockNode(Descriptor md, SymbolTable nametable, SubBlockNode sbn) {
240 checkBlockNode(md, nametable, sbn.getBlockNode());
243 void checkReturnNode(Descriptor d, SymbolTable nametable, ReturnNode rn) {
244 if (d instanceof TaskDescriptor)
245 throw new Error("Illegal return appears in Task: "+d.getSymbol());
246 MethodDescriptor md=(MethodDescriptor)d;
247 if (rn.getReturnExpression()!=null)
248 checkExpressionNode(md, nametable, rn.getReturnExpression(), md.getReturnType());
250 if (md.getReturnType()!=null&&!md.getReturnType().isVoid())
251 throw new Error("Need to return something for "+md);
254 void checkTaskExitNode(Descriptor md, SymbolTable nametable, TaskExitNode ten) {
255 if (md instanceof MethodDescriptor)
256 throw new Error("Illegal taskexit appears in Method: "+md.getSymbol());
257 checkFlagEffects((TaskDescriptor)md, ten.getFlagEffects());
260 void checkIfStatementNode(Descriptor md, SymbolTable nametable, IfStatementNode isn) {
261 checkExpressionNode(md, nametable, isn.getCondition(), new TypeDescriptor(TypeDescriptor.BOOLEAN));
262 checkBlockNode(md, nametable, isn.getTrueBlock());
263 if (isn.getFalseBlock()!=null)
264 checkBlockNode(md, nametable, isn.getFalseBlock());
267 void checkExpressionNode(Descriptor md, SymbolTable nametable, ExpressionNode en, TypeDescriptor td) {
269 case Kind.AssignmentNode:
270 checkAssignmentNode(md,nametable,(AssignmentNode)en,td);
273 checkCastNode(md,nametable,(CastNode)en,td);
275 case Kind.CreateObjectNode:
276 checkCreateObjectNode(md,nametable,(CreateObjectNode)en,td);
278 case Kind.FieldAccessNode:
279 checkFieldAccessNode(md,nametable,(FieldAccessNode)en,td);
281 case Kind.ArrayAccessNode:
282 checkArrayAccessNode(md,nametable,(ArrayAccessNode)en,td);
284 case Kind.LiteralNode:
285 checkLiteralNode(md,nametable,(LiteralNode)en,td);
287 case Kind.MethodInvokeNode:
288 checkMethodInvokeNode(md,nametable,(MethodInvokeNode)en,td);
291 checkNameNode(md,nametable,(NameNode)en,td);
294 checkOpNode(md,nametable,(OpNode)en,td);
300 void checkCastNode(Descriptor md, SymbolTable nametable, CastNode cn, TypeDescriptor td) {
301 /* Get type descriptor */
302 if (cn.getType()==null) {
303 NameDescriptor typenamed=cn.getTypeName().getName();
304 String typename=typenamed.toString();
305 TypeDescriptor ntd=new TypeDescriptor(typeutil.getClass(typename));
309 /* Check the type descriptor */
310 TypeDescriptor cast_type=cn.getType();
311 checkTypeDescriptor(cast_type);
315 if (!typeutil.isSuperorType(td,cast_type))
316 throw new Error("Cast node returns "+cast_type+", but need "+td);
319 ExpressionNode en=cn.getExpression();
320 checkExpressionNode(md, nametable, en, null);
321 TypeDescriptor etd=en.getType();
322 if (typeutil.isSuperorType(cast_type,etd)) /* Cast trivially succeeds */
325 if (typeutil.isSuperorType(etd,cast_type)) /* Cast may succeed */
328 /* Different branches */
329 /* TODO: change if add interfaces */
330 throw new Error("Cast will always fail\n"+cn.printNode(0));
333 void checkFieldAccessNode(Descriptor md, SymbolTable nametable, FieldAccessNode fan, TypeDescriptor td) {
334 ExpressionNode left=fan.getExpression();
335 checkExpressionNode(md,nametable,left,null);
336 TypeDescriptor ltd=left.getType();
337 String fieldname=fan.getFieldName();
339 FieldDescriptor fd=null;
340 if (ltd.isArray()&&fieldname.equals("length"))
341 fd=FieldDescriptor.arrayLength;
343 fd=(FieldDescriptor) ltd.getClassDesc().getFieldTable().get(fieldname);
345 throw new Error("Unknown field "+fieldname);
348 if (!typeutil.isSuperorType(td,fan.getType()))
349 throw new Error("Field node returns "+fan.getType()+", but need "+td);
352 void checkArrayAccessNode(Descriptor md, SymbolTable nametable, ArrayAccessNode aan, TypeDescriptor td) {
353 ExpressionNode left=aan.getExpression();
354 checkExpressionNode(md,nametable,left,null);
356 checkExpressionNode(md,nametable,aan.getIndex(),new TypeDescriptor(TypeDescriptor.INT));
357 TypeDescriptor ltd=left.getType();
360 if (!typeutil.isSuperorType(td,aan.getType()))
361 throw new Error("Field node returns "+aan.getType()+", but need "+td);
364 void checkLiteralNode(Descriptor md, SymbolTable nametable, LiteralNode ln, TypeDescriptor td) {
365 /* Resolve the type */
366 Object o=ln.getValue();
367 if (ln.getTypeString().equals("null")) {
368 ln.setType(new TypeDescriptor(TypeDescriptor.NULL));
369 } else if (o instanceof Integer) {
370 ln.setType(new TypeDescriptor(TypeDescriptor.INT));
371 } else if (o instanceof Long) {
372 ln.setType(new TypeDescriptor(TypeDescriptor.LONG));
373 } else if (o instanceof Float) {
374 ln.setType(new TypeDescriptor(TypeDescriptor.FLOAT));
375 } else if (o instanceof Boolean) {
376 ln.setType(new TypeDescriptor(TypeDescriptor.BOOLEAN));
377 } else if (o instanceof Double) {
378 ln.setType(new TypeDescriptor(TypeDescriptor.DOUBLE));
379 } else if (o instanceof Character) {
380 ln.setType(new TypeDescriptor(TypeDescriptor.CHAR));
381 } else if (o instanceof String) {
382 ln.setType(new TypeDescriptor(typeutil.getClass(TypeUtil.StringClass)));
386 if (!typeutil.isSuperorType(td,ln.getType()))
387 throw new Error("Field node returns "+ln.getType()+", but need "+td);
390 void checkNameNode(Descriptor md, SymbolTable nametable, NameNode nn, TypeDescriptor td) {
391 NameDescriptor nd=nn.getName();
392 if (nd.getBase()!=null) {
394 /* Rewrite NameNode */
395 ExpressionNode en=translateNameDescriptorintoExpression(nd);
396 nn.setExpression(en);
397 checkExpressionNode(md,nametable,en,td);
399 String varname=nd.toString();
400 Descriptor d=(Descriptor)nametable.get(varname);
402 throw new Error("Name "+varname+" undefined");
404 if (d instanceof VarDescriptor) {
405 nn.setVar((VarDescriptor)d);
406 } else if (d instanceof FieldDescriptor) {
407 nn.setField((FieldDescriptor)d);
408 nn.setVar((VarDescriptor)nametable.get("this")); /* Need a pointer to this */
411 if (!typeutil.isSuperorType(td,nn.getType()))
412 throw new Error("Field node returns "+nn.getType()+", but need "+td);
416 void checkAssignmentNode(Descriptor md, SymbolTable nametable, AssignmentNode an, TypeDescriptor td) {
417 checkExpressionNode(md, nametable, an.getSrc() ,td);
418 //TODO: Need check on validity of operation here
419 if (!((an.getDest() instanceof FieldAccessNode)||
420 (an.getDest() instanceof ArrayAccessNode)||
421 (an.getDest() instanceof NameNode)))
422 throw new Error("Bad lside in "+an.printNode(0));
423 checkExpressionNode(md, nametable, an.getDest(), null);
424 if (!typeutil.isSuperorType(an.getDest().getType(),an.getSrc().getType())) {
425 throw new Error("Type of rside ("+an.getSrc().getType()+") not compatible with type of lside ("+an.getDest().getType()+")"+an.printNode(0));
429 void checkLoopNode(Descriptor md, SymbolTable nametable, LoopNode ln) {
430 if (ln.getType()==LoopNode.WHILELOOP||ln.getType()==LoopNode.DOWHILELOOP) {
431 checkExpressionNode(md, nametable, ln.getCondition(), new TypeDescriptor(TypeDescriptor.BOOLEAN));
432 checkBlockNode(md, nametable, ln.getBody());
435 /* Link in the initializer naming environment */
436 BlockNode bn=ln.getInitializer();
437 bn.getVarTable().setParent(nametable);
438 for(int i=0;i<bn.size();i++) {
439 BlockStatementNode bsn=bn.get(i);
440 checkBlockStatementNode(md, bn.getVarTable(),bsn);
442 //check the condition
443 checkExpressionNode(md, bn.getVarTable(), ln.getCondition(), new TypeDescriptor(TypeDescriptor.BOOLEAN));
444 checkBlockNode(md, bn.getVarTable(), ln.getBody());
445 checkBlockNode(md, bn.getVarTable(), ln.getUpdate());
450 void checkCreateObjectNode(Descriptor md, SymbolTable nametable, CreateObjectNode con, TypeDescriptor td) {
451 TypeDescriptor[] tdarray=new TypeDescriptor[con.numArgs()];
452 for(int i=0;i<con.numArgs();i++) {
453 ExpressionNode en=con.getArg(i);
454 checkExpressionNode(md,nametable,en,null);
455 tdarray[i]=en.getType();
458 TypeDescriptor typetolookin=con.getType();
459 checkTypeDescriptor(typetolookin);
460 if ((!typetolookin.isClass())&&(!typetolookin.isArray()))
461 throw new Error("Can't allocate primitive type:"+con.printNode(0));
463 if (!typetolookin.isArray()) {
464 //Array's don't need constructor calls
465 ClassDescriptor classtolookin=typetolookin.getClassDesc();
466 System.out.println("Looking for "+typetolookin.getSymbol());
467 System.out.println(classtolookin.getMethodTable());
469 Set methoddescriptorset=classtolookin.getMethodTable().getSet(typetolookin.getSymbol());
470 MethodDescriptor bestmd=null;
472 for(Iterator methodit=methoddescriptorset.iterator();methodit.hasNext();) {
473 MethodDescriptor currmd=(MethodDescriptor)methodit.next();
474 /* Need correct number of parameters */
475 System.out.println("Examining: "+currmd);
476 if (con.numArgs()!=currmd.numParameters())
478 for(int i=0;i<con.numArgs();i++) {
479 if (!typeutil.isSuperorType(currmd.getParamType(i),tdarray[i]))
482 /* Method okay so far */
486 if (isMoreSpecific(currmd,bestmd)) {
488 } else if (!isMoreSpecific(bestmd, currmd))
489 throw new Error("No method is most specific");
491 /* Is this more specific than bestmd */
495 throw new Error("No method found for "+con.printNode(0));
496 con.setConstructor(bestmd);
501 /** Check to see if md1 is more specific than md2... Informally
502 if md2 could always be called given the arguments passed into
505 boolean isMoreSpecific(MethodDescriptor md1, MethodDescriptor md2) {
506 /* Checks if md1 is more specific than md2 */
507 if (md1.numParameters()!=md2.numParameters())
509 for(int i=0;i<md1.numParameters();i++) {
510 if (!typeutil.isSuperorType(md2.getParamType(i), md1.getParamType(i)))
513 if (!typeutil.isSuperorType(md2.getReturnType(), md1.getReturnType()))
518 ExpressionNode translateNameDescriptorintoExpression(NameDescriptor nd) {
519 String id=nd.getIdentifier();
520 NameDescriptor base=nd.getBase();
522 return new NameNode(nd);
524 return new FieldAccessNode(translateNameDescriptorintoExpression(base),id);
528 void checkMethodInvokeNode(Descriptor md, SymbolTable nametable, MethodInvokeNode min, TypeDescriptor td) {
529 /*Typecheck subexpressions
530 and get types for expressions*/
532 TypeDescriptor[] tdarray=new TypeDescriptor[min.numArgs()];
533 for(int i=0;i<min.numArgs();i++) {
534 ExpressionNode en=min.getArg(i);
535 checkExpressionNode(md,nametable,en,null);
536 tdarray[i]=en.getType();
538 TypeDescriptor typetolookin=null;
539 if (min.getExpression()!=null) {
540 checkExpressionNode(md,nametable,min.getExpression(),null);
541 typetolookin=min.getExpression().getType();
542 } else if (min.getBaseName()!=null) {
543 String rootname=min.getBaseName().getRoot();
544 if (nametable.get(rootname)!=null) {
545 //we have an expression
546 min.setExpression(translateNameDescriptorintoExpression(min.getBaseName()));
547 checkExpressionNode(md, nametable, min.getExpression(), null);
548 typetolookin=min.getExpression().getType();
551 ClassDescriptor cd=typeutil.getClass(min.getBaseName().getSymbol());
553 throw new Error(min.getBaseName()+" undefined");
554 typetolookin=new TypeDescriptor(cd);
556 } else if (md instanceof MethodDescriptor) {
557 typetolookin=new TypeDescriptor(((MethodDescriptor)md).getClassDesc());
559 /* If this a task descriptor we throw an error at this point */
560 throw new Error("Unknown method call to "+min.getMethodName()+"in task"+md.getSymbol());
562 if (!typetolookin.isClass())
564 ClassDescriptor classtolookin=typetolookin.getClassDesc();
565 System.out.println("Method name="+min.getMethodName());
566 Set methoddescriptorset=classtolookin.getMethodTable().getSet(min.getMethodName());
567 MethodDescriptor bestmd=null;
569 for(Iterator methodit=methoddescriptorset.iterator();methodit.hasNext();) {
570 MethodDescriptor currmd=(MethodDescriptor)methodit.next();
571 /* Need correct number of parameters */
572 if (min.numArgs()!=currmd.numParameters())
574 for(int i=0;i<min.numArgs();i++) {
575 if (!typeutil.isSuperorType(currmd.getParamType(i),tdarray[i]))
578 /* Method okay so far */
582 if (isMoreSpecific(currmd,bestmd)) {
584 } else if (!isMoreSpecific(bestmd, currmd))
585 throw new Error("No method is most specific");
587 /* Is this more specific than bestmd */
591 throw new Error("No method found for :"+min.printNode(0));
592 min.setMethod(bestmd);
593 /* Check whether we need to set this parameter to implied this */
594 if (!bestmd.isStatic()) {
595 if (min.getExpression()==null) {
596 ExpressionNode en=new NameNode(new NameDescriptor("this"));
597 min.setExpression(en);
598 checkExpressionNode(md, nametable, min.getExpression(), null);
605 void checkOpNode(Descriptor md, SymbolTable nametable, OpNode on, TypeDescriptor td) {
606 checkExpressionNode(md, nametable, on.getLeft(), null);
607 if (on.getRight()!=null)
608 checkExpressionNode(md, nametable, on.getRight(), null);
609 TypeDescriptor ltd=on.getLeft().getType();
610 TypeDescriptor rtd=on.getRight()!=null?on.getRight().getType():null;
611 TypeDescriptor lefttype=null;
612 TypeDescriptor righttype=null;
613 Operation op=on.getOp();
616 case Operation.LOGIC_OR:
617 case Operation.LOGIC_AND:
618 if (!(ltd.isBoolean()&&rtd.isBoolean()))
622 on.setRightType(rtd);
623 on.setType(new TypeDescriptor(TypeDescriptor.BOOLEAN));
626 case Operation.BIT_OR:
627 case Operation.BIT_XOR:
628 case Operation.BIT_AND:
629 // 5.6.2 Binary Numeric Promotion
630 //TODO unboxing of reference objects
631 if (ltd.isDouble()||rtd.isDouble())
633 else if (ltd.isFloat()||rtd.isFloat())
635 else if (ltd.isLong()||rtd.isLong())
636 lefttype=new TypeDescriptor(TypeDescriptor.LONG);
638 lefttype=new TypeDescriptor(TypeDescriptor.INT);
641 on.setLeftType(lefttype);
642 on.setRightType(righttype);
643 on.setType(lefttype);
646 case Operation.EQUAL:
647 case Operation.NOTEQUAL:
648 // 5.6.2 Binary Numeric Promotion
649 //TODO unboxing of reference objects
650 if (ltd.isBoolean()||rtd.isBoolean()) {
651 if (!(ltd.isBoolean()&&rtd.isBoolean()))
653 righttype=lefttype=new TypeDescriptor(TypeDescriptor.BOOLEAN);
654 } else if (ltd.isPtr()||rtd.isPtr()) {
655 if (!(ltd.isPtr()&&rtd.isPtr()))
659 } else if (ltd.isDouble()||rtd.isDouble())
660 righttype=lefttype=new TypeDescriptor(TypeDescriptor.DOUBLE);
661 else if (ltd.isFloat()||rtd.isFloat())
662 righttype=lefttype=new TypeDescriptor(TypeDescriptor.FLOAT);
663 else if (ltd.isLong()||rtd.isLong())
664 righttype=lefttype=new TypeDescriptor(TypeDescriptor.LONG);
666 righttype=lefttype=new TypeDescriptor(TypeDescriptor.INT);
668 on.setLeftType(lefttype);
669 on.setRightType(righttype);
670 on.setType(new TypeDescriptor(TypeDescriptor.BOOLEAN));
679 // 5.6.2 Binary Numeric Promotion
680 //TODO unboxing of reference objects
681 if (!ltd.isNumber()||!rtd.isNumber())
684 if (ltd.isDouble()||rtd.isDouble())
685 lefttype=new TypeDescriptor(TypeDescriptor.DOUBLE);
686 else if (ltd.isFloat()||rtd.isFloat())
687 lefttype=new TypeDescriptor(TypeDescriptor.FLOAT);
688 else if (ltd.isLong()||rtd.isLong())
689 lefttype=new TypeDescriptor(TypeDescriptor.LONG);
691 lefttype=new TypeDescriptor(TypeDescriptor.INT);
693 on.setLeftType(lefttype);
694 on.setRightType(righttype);
695 on.setType(new TypeDescriptor(TypeDescriptor.BOOLEAN));
699 //TODO: Need special case for strings eventually
706 // 5.6.2 Binary Numeric Promotion
707 //TODO unboxing of reference objects
708 if (!ltd.isNumber()||!rtd.isNumber())
709 throw new Error("Error in "+on.printNode(0));
711 if (ltd.isDouble()||rtd.isDouble())
712 lefttype=new TypeDescriptor(TypeDescriptor.DOUBLE);
713 else if (ltd.isFloat()||rtd.isFloat())
714 lefttype=new TypeDescriptor(TypeDescriptor.FLOAT);
715 else if (ltd.isLong()||rtd.isLong())
716 lefttype=new TypeDescriptor(TypeDescriptor.LONG);
718 lefttype=new TypeDescriptor(TypeDescriptor.INT);
720 on.setLeftType(lefttype);
721 on.setRightType(righttype);
722 on.setType(lefttype);
725 case Operation.LEFTSHIFT:
726 case Operation.RIGHTSHIFT:
727 if (!rtd.isIntegerType())
729 //5.6.1 Unary Numeric Promotion
730 if (rtd.isByte()||rtd.isShort()||rtd.isInt())
731 righttype=new TypeDescriptor(TypeDescriptor.INT);
735 on.setRightType(righttype);
736 if (!ltd.isIntegerType())
738 case Operation.UNARYPLUS:
739 case Operation.UNARYMINUS:
740 case Operation.POSTINC:
741 case Operation.POSTDEC:
742 case Operation.PREINC:
743 case Operation.PREDEC:
746 //5.6.1 Unary Numeric Promotion
747 if (ltd.isByte()||ltd.isShort()||ltd.isInt())
748 lefttype=new TypeDescriptor(TypeDescriptor.INT);
751 on.setLeftType(lefttype);
752 on.setType(lefttype);
761 if (!typeutil.isSuperorType(td, on.getType())) {
762 System.out.println(td);
763 System.out.println(on.getType());
764 throw new Error("Type of rside not compatible with type of lside"+on.printNode(0));