()
| 1378 | } |
| 1379 | |
| 1380 | final public void InclusiveOrExpression() throws ParseException { |
| 1381 | Token t=null; |
| 1382 | ExclusiveOrExpression(); |
| 1383 | label_9: |
| 1384 | while (true) { |
| 1385 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1386 | case BIT_OR: |
| 1387 | case BIT_ORX: |
| 1388 | ; |
| 1389 | break; |
| 1390 | default: |
| 1391 | jj_la1[33] = jj_gen; |
| 1392 | break label_9; |
| 1393 | } |
| 1394 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1395 | case BIT_OR: |
| 1396 | t = jj_consume_token(BIT_OR); |
| 1397 | break; |
| 1398 | case BIT_ORX: |
| 1399 | t = jj_consume_token(BIT_ORX); |
| 1400 | break; |
| 1401 | default: |
| 1402 | jj_la1[34] = jj_gen; |
| 1403 | jj_consume_token(-1); |
| 1404 | throw new ParseException(); |
| 1405 | } |
| 1406 | ExclusiveOrExpression(); |
| 1407 | BSHBinaryExpression jjtn001 = new BSHBinaryExpression(JJTBINARYEXPRESSION); |
| 1408 | boolean jjtc001 = true; |
| 1409 | jjtree.openNodeScope(jjtn001); |
| 1410 | jjtreeOpenNodeScope(jjtn001); |
| 1411 | try { |
| 1412 | jjtree.closeNodeScope(jjtn001, 2); |
| 1413 | jjtc001 = false; |
| 1414 | jjtreeCloseNodeScope(jjtn001); |
| 1415 | jjtn001.kind = t.kind; |
| 1416 | } finally { |
| 1417 | if (jjtc001) { |
| 1418 | jjtree.closeNodeScope(jjtn001, 2); |
| 1419 | jjtreeCloseNodeScope(jjtn001); |
| 1420 | } |
| 1421 | } |
| 1422 | } |
| 1423 | } |
| 1424 | |
| 1425 | final public void ExclusiveOrExpression() throws ParseException { |
| 1426 | Token t=null; |
no test coverage detected