26012602260326042605260626072608260926102611
types[i][1], types[i][2], fCounter)); } break; case '=': // less equal for (int i = operatorNumber - 1; i >= 0; i--) { push(new LessEqualOperator(types[i][1], types[i][2], fCounter)); } break; default: unrecognized = true;