()
| 1333 | } |
| 1334 | |
| 1335 | final public void ConditionalAndExpression() throws ParseException { |
| 1336 | Token t=null; |
| 1337 | InclusiveOrExpression(); |
| 1338 | label_8: |
| 1339 | while (true) { |
| 1340 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1341 | case BOOL_AND: |
| 1342 | case BOOL_ANDX: |
| 1343 | ; |
| 1344 | break; |
| 1345 | default: |
| 1346 | jj_la1[31] = jj_gen; |
| 1347 | break label_8; |
| 1348 | } |
| 1349 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1350 | case BOOL_AND: |
| 1351 | t = jj_consume_token(BOOL_AND); |
| 1352 | break; |
| 1353 | case BOOL_ANDX: |
| 1354 | t = jj_consume_token(BOOL_ANDX); |
| 1355 | break; |
| 1356 | default: |
| 1357 | jj_la1[32] = jj_gen; |
| 1358 | jj_consume_token(-1); |
| 1359 | throw new ParseException(); |
| 1360 | } |
| 1361 | InclusiveOrExpression(); |
| 1362 | BSHBinaryExpression jjtn001 = new BSHBinaryExpression(JJTBINARYEXPRESSION); |
| 1363 | boolean jjtc001 = true; |
| 1364 | jjtree.openNodeScope(jjtn001); |
| 1365 | jjtreeOpenNodeScope(jjtn001); |
| 1366 | try { |
| 1367 | jjtree.closeNodeScope(jjtn001, 2); |
| 1368 | jjtc001 = false; |
| 1369 | jjtreeCloseNodeScope(jjtn001); |
| 1370 | jjtn001.kind = t.kind; |
| 1371 | } finally { |
| 1372 | if (jjtc001) { |
| 1373 | jjtree.closeNodeScope(jjtn001, 2); |
| 1374 | jjtreeCloseNodeScope(jjtn001); |
| 1375 | } |
| 1376 | } |
| 1377 | } |
| 1378 | } |
| 1379 | |
| 1380 | final public void InclusiveOrExpression() throws ParseException { |
| 1381 | Token t=null; |
no test coverage detected