/** * Get the precedence level for the top-most precedence rule. * * @return The precedence level for the top-most precedence rule, or -1 if * the parser context is not nested within a precedence rule. */ public final int getPrecedence() { if (_precedenceStack.isEmpty()) { return -1; } return _precedenceStack.peek(); }
public int popMode() { if ( _modeStack.isEmpty() ) throw new EmptyStackException(); if ( LexerATNSimulator.debug ) System.out.println("popMode back to "+ _modeStack.peek()); mode( _modeStack.pop() ); return _mode; }
/** * Get the precedence level for the top-most precedence rule. * * @return The precedence level for the top-most precedence rule, or -1 if * the parser context is not nested within a precedence rule. */ public final int getPrecedence() { if (_precedenceStack.isEmpty()) { return -1; } return _precedenceStack.peek(); }
/** * Get the precedence level for the top-most precedence rule. * * @return The precedence level for the top-most precedence rule, or -1 if * the parser context is not nested within a precedence rule. */ public final int getPrecedence() { if (_precedenceStack.isEmpty()) { return -1; } return _precedenceStack.peek(); }
/** * Get the precedence level for the top-most precedence rule. * * @return The precedence level for the top-most precedence rule, or -1 if * the parser context is not nested within a precedence rule. */ public final int getPrecedence() { if (_precedenceStack.isEmpty()) { return -1; } return _precedenceStack.peek(); }
/** * Get the precedence level for the top-most precedence rule. * * @return The precedence level for the top-most precedence rule, or -1 if * the parser context is not nested within a precedence rule. */ public final int getPrecedence() { if (_precedenceStack.isEmpty()) { return -1; } return _precedenceStack.peek(); }
public int popMode() { if ( _modeStack.isEmpty() ) throw new EmptyStackException(); if ( LexerATNSimulator.debug ) System.out.println("popMode back to "+ _modeStack.peek()); mode( _modeStack.pop() ); return _mode; }
public int popMode() { if ( _modeStack.isEmpty() ) throw new EmptyStackException(); if ( LexerATNSimulator.debug ) System.out.println("popMode back to "+ _modeStack.peek()); mode( _modeStack.pop() ); return _mode; }
public int popMode() { if ( _modeStack.isEmpty() ) throw new EmptyStackException(); if ( LexerATNSimulator.debug ) System.out.println("popMode back to "+ _modeStack.peek()); mode( _modeStack.pop() ); return _mode; }
public int popMode() { if ( _modeStack.isEmpty() ) throw new EmptyStackException(); if ( LexerATNSimulator.debug ) System.out.println("popMode back to "+ _modeStack.peek()); mode( _modeStack.pop() ); return _mode; }
@Override protected ANTLRLexerState getLexerState(Lexer lexer) { if (lexer._modeStack.isEmpty()) { return new ANTLRLexerState(lexer._mode, null); } return new ANTLRLexerState(lexer._mode, lexer._modeStack); }
/** * Get a {@code ANTLRLexerState} instance representing the current state * of the specified lexer. * * @param lexer The lexer. * @return A {@code ANTLRLexerState} instance containing the current state of the lexer. */ protected ANTLRLexerState getLexerState(Lexer lexer) { if (lexer._modeStack.isEmpty()) { return new ANTLRLexerState(lexer._mode, null); } return new ANTLRLexerState(lexer._mode, lexer._modeStack); }
@Override protected ANTLRv4LexerState getLexerState(Lexer lexer) { if (lexer._modeStack.isEmpty()) { return new ANTLRv4LexerState(lexer._mode, null, ((ANTLRv4Lexer)lexer).getCurrentRuleType()); } return new ANTLRv4LexerState(lexer._mode, lexer._modeStack, ((ANTLRv4Lexer)lexer).getCurrentRuleType()); } }