()
| 1456 | } |
| 1457 | |
| 1458 | final public void AndExpression() throws ParseException { |
| 1459 | Token t=null; |
| 1460 | EqualityExpression(); |
| 1461 | label_11: |
| 1462 | while (true) { |
| 1463 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1464 | case BIT_AND: |
| 1465 | case BIT_ANDX: |
| 1466 | ; |
| 1467 | break; |
| 1468 | default: |
| 1469 | jj_la1[36] = jj_gen; |
| 1470 | break label_11; |
| 1471 | } |
| 1472 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1473 | case BIT_AND: |
| 1474 | t = jj_consume_token(BIT_AND); |
| 1475 | break; |
| 1476 | case BIT_ANDX: |
| 1477 | t = jj_consume_token(BIT_ANDX); |
| 1478 | break; |
| 1479 | default: |
| 1480 | jj_la1[37] = jj_gen; |
| 1481 | jj_consume_token(-1); |
| 1482 | throw new ParseException(); |
| 1483 | } |
| 1484 | EqualityExpression(); |
| 1485 | BSHBinaryExpression jjtn001 = new BSHBinaryExpression(JJTBINARYEXPRESSION); |
| 1486 | boolean jjtc001 = true; |
| 1487 | jjtree.openNodeScope(jjtn001); |
| 1488 | jjtreeOpenNodeScope(jjtn001); |
| 1489 | try { |
| 1490 | jjtree.closeNodeScope(jjtn001, 2); |
| 1491 | jjtc001 = false; |
| 1492 | jjtreeCloseNodeScope(jjtn001); |
| 1493 | jjtn001.kind = t.kind; |
| 1494 | } finally { |
| 1495 | if (jjtc001) { |
| 1496 | jjtree.closeNodeScope(jjtn001, 2); |
| 1497 | jjtreeCloseNodeScope(jjtn001); |
| 1498 | } |
| 1499 | } |
| 1500 | } |
| 1501 | } |
| 1502 | |
| 1503 | final public void EqualityExpression() throws ParseException { |
| 1504 | Token t = null; |
no test coverage detected