()
| 1705 | } |
| 1706 | |
| 1707 | final public void AdditiveExpression() throws ParseException { |
| 1708 | Token t = null; |
| 1709 | MultiplicativeExpression(); |
| 1710 | label_15: |
| 1711 | while (true) { |
| 1712 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1713 | case PLUS: |
| 1714 | case MINUS: |
| 1715 | ; |
| 1716 | break; |
| 1717 | default: |
| 1718 | jj_la1[45] = jj_gen; |
| 1719 | break label_15; |
| 1720 | } |
| 1721 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1722 | case PLUS: |
| 1723 | t = jj_consume_token(PLUS); |
| 1724 | break; |
| 1725 | case MINUS: |
| 1726 | t = jj_consume_token(MINUS); |
| 1727 | break; |
| 1728 | default: |
| 1729 | jj_la1[46] = jj_gen; |
| 1730 | jj_consume_token(-1); |
| 1731 | throw new ParseException(); |
| 1732 | } |
| 1733 | MultiplicativeExpression(); |
| 1734 | BSHBinaryExpression jjtn001 = new BSHBinaryExpression(JJTBINARYEXPRESSION); |
| 1735 | boolean jjtc001 = true; |
| 1736 | jjtree.openNodeScope(jjtn001); |
| 1737 | jjtreeOpenNodeScope(jjtn001); |
| 1738 | try { |
| 1739 | jjtree.closeNodeScope(jjtn001, 2); |
| 1740 | jjtc001 = false; |
| 1741 | jjtreeCloseNodeScope(jjtn001); |
| 1742 | jjtn001.kind = t.kind; |
| 1743 | } finally { |
| 1744 | if (jjtc001) { |
| 1745 | jjtree.closeNodeScope(jjtn001, 2); |
| 1746 | jjtreeCloseNodeScope(jjtn001); |
| 1747 | } |
| 1748 | } |
| 1749 | } |
| 1750 | } |
| 1751 | |
| 1752 | final public void MultiplicativeExpression() throws ParseException { |
| 1753 | Token t = null; |
no test coverage detected