254   public void byte_code(InstructionList il, MethodGen method, ConstantPoolGen cp) {  in byte_code()  argument
255     exprs[0].byte_code(il, method, cp);  in byte_code()
259         il.append(InstructionConstants.INEG);  in byte_code()
261         il.append(new PUSH(cp, 1)); ASTFunDecl.push(); // Push TRUE  in byte_code()
262         il.append(InstructionConstants.IXOR); ASTFunDecl.pop();  in byte_code()
268       exprs[1].byte_code(il, method, cp);  in byte_code()
271       case PLUS:  il.append(InstructionConstants.IADD); ASTFunDecl.pop();  break;  in byte_code()
272       case MINUS: il.append(InstructionConstants.ISUB); ASTFunDecl.pop();  break;  in byte_code()
273       case MULT:  il.append(InstructionConstants.IMUL); ASTFunDecl.pop();  break;  in byte_code()
274       case DIV:   il.append(InstructionConstants.IDIV); ASTFunDecl.pop();  break;  in byte_code()
275       case AND:   il.append(InstructionConstants.IAND); ASTFunDecl.pop();  break;  in byte_code()
276       case OR:    il.append(InstructionConstants.IOR);  ASTFunDecl.pop();  break;  in byte_code()
279       case EQ:    bh = il.append(new IF_ICMPNE(null)); ASTFunDecl.pop(2); break;  in byte_code()
280       case LEQ:   bh = il.append(new IF_ICMPGT(null)); ASTFunDecl.pop(2); break;  in byte_code()
281       case GEQ:   bh = il.append(new IF_ICMPLT(null)); ASTFunDecl.pop(2); break;  in byte_code()
282       case NEQ:   bh = il.append(new IF_ICMPEQ(null)); ASTFunDecl.pop(2); break;  in byte_code()
283       case LT:    bh = il.append(new IF_ICMPGE(null)); ASTFunDecl.pop(2); break;  in byte_code()
284       case GT:    bh = il.append(new IF_ICMPLE(null)); ASTFunDecl.pop(2); break;  in byte_code()
292         il.append(new PUSH(cp, 1));  in byte_code()
293         g = il.append(new GOTO(null));  in byte_code()
294         bh.setTarget(il.append(new PUSH(cp, 0)));  in byte_code()
295         g.setTarget(il.append(InstructionConstants.NOP)); // May be optimized away later  in byte_code()