()
| 1799 | } |
| 1800 | |
| 1801 | final public void UnaryExpression() throws ParseException { |
| 1802 | Token t = null; |
| 1803 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1804 | case PLUS: |
| 1805 | case MINUS: |
| 1806 | switch ((jj_ntk==-1)?jj_ntk():jj_ntk) { |
| 1807 | case PLUS: |
| 1808 | t = jj_consume_token(PLUS); |
| 1809 | break; |
| 1810 | case MINUS: |
| 1811 | t = jj_consume_token(MINUS); |
| 1812 | break; |
| 1813 | default: |
| 1814 | jj_la1[49] = jj_gen; |
| 1815 | jj_consume_token(-1); |
| 1816 | throw new ParseException(); |
| 1817 | } |
| 1818 | UnaryExpression(); |
| 1819 | BSHUnaryExpression jjtn001 = new BSHUnaryExpression(JJTUNARYEXPRESSION); |
| 1820 | boolean jjtc001 = true; |
| 1821 | jjtree.openNodeScope(jjtn001); |
| 1822 | jjtreeOpenNodeScope(jjtn001); |
| 1823 | try { |
| 1824 | jjtree.closeNodeScope(jjtn001, 1); |
| 1825 | jjtc001 = false; |
| 1826 | jjtreeCloseNodeScope(jjtn001); |
| 1827 | jjtn001.kind = t.kind; |
| 1828 | } finally { |
| 1829 | if (jjtc001) { |
| 1830 | jjtree.closeNodeScope(jjtn001, 1); |
| 1831 | jjtreeCloseNodeScope(jjtn001); |
| 1832 | } |
| 1833 | } |
| 1834 | break; |
| 1835 | case INCR: |
| 1836 | PreIncrementExpression(); |
| 1837 | break; |
| 1838 | case DECR: |
| 1839 | PreDecrementExpression(); |
| 1840 | break; |
| 1841 | case BOOLEAN: |
| 1842 | case BYTE: |
| 1843 | case CHAR: |
| 1844 | case DOUBLE: |
| 1845 | case FALSE: |
| 1846 | case FLOAT: |
| 1847 | case INT: |
| 1848 | case LONG: |
| 1849 | case NEW: |
| 1850 | case NULL: |
| 1851 | case SHORT: |
| 1852 | case TRUE: |
| 1853 | case VOID: |
| 1854 | case INTEGER_LITERAL: |
| 1855 | case FLOATING_POINT_LITERAL: |
| 1856 | case CHARACTER_LITERAL: |
| 1857 | case STRING_LITERAL: |
| 1858 | case LONG_STRING_LITERAL: |
no test coverage detected