()
| 1501 | } |
| 1502 | |
| 1503 | final public void EqualityExpression() throws ParseException { |
| 1504 | Token t = null; |
| 1505 | InstanceOfExpression(); |
| 1506 | label_12: |
| 1507 | while (true) { |
| 1508 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1509 | case EQ: |
| 1510 | case NE: |
| 1511 | ; |
| 1512 | break; |
| 1513 | default: |
| 1514 | jj_la1[38] = jj_gen; |
| 1515 | break label_12; |
| 1516 | } |
| 1517 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1518 | case EQ: |
| 1519 | t = jj_consume_token(EQ); |
| 1520 | break; |
| 1521 | case NE: |
| 1522 | t = jj_consume_token(NE); |
| 1523 | break; |
| 1524 | default: |
| 1525 | jj_la1[39] = jj_gen; |
| 1526 | jj_consume_token(-1); |
| 1527 | throw new ParseException(); |
| 1528 | } |
| 1529 | InstanceOfExpression(); |
| 1530 | BSHBinaryExpression jjtn001 = new BSHBinaryExpression(JJTBINARYEXPRESSION); |
| 1531 | boolean jjtc001 = true; |
| 1532 | jjtree.openNodeScope(jjtn001); |
| 1533 | jjtreeOpenNodeScope(jjtn001); |
| 1534 | try { |
| 1535 | jjtree.closeNodeScope(jjtn001, 2); |
| 1536 | jjtc001 = false; |
| 1537 | jjtreeCloseNodeScope(jjtn001); |
| 1538 | jjtn001.kind = t.kind; |
| 1539 | } finally { |
| 1540 | if (jjtc001) { |
| 1541 | jjtree.closeNodeScope(jjtn001, 2); |
| 1542 | jjtreeCloseNodeScope(jjtn001); |
| 1543 | } |
| 1544 | } |
| 1545 | } |
| 1546 | } |
| 1547 | |
| 1548 | final public void InstanceOfExpression() throws ParseException { |
| 1549 | Token t = null; |
no test coverage detected