public final KeywordContext keyword() throws RecognitionException { KeywordContext _localctx = new KeywordContext(_ctx, getState()); enterRule(_localctx, 150, RULE_keyword); int _la; try { enterOuterAlt(_localctx, 1); { setState(1680); _la = _input.LA(1); if ( !(((((_la - 29)) & ~0x3f) == 0 && ((1L << (_la - 29)) & ((1L << (K_ABORT - 29)) | (1L << (K_ACTION - 29)) | (1L << (K_ADD - 29)) | (1L << (K_AFTER - 29)) | (1L << (K_ALL - 29)) | (1L << (K_ALTER - 29)) | (1L << (K_ANALYZE - 29)) | (1L << (K_AND - 29)) | (1L << (K_AS - 29)) | (1L << (K_ASC - 29)) | (1L << (K_ATTACH - 29)) | (1L << (K_AUTOINCREMENT - 29)) | (1L << (K_BEFORE - 29)) | (1L << (K_BEGIN - 29)) | (1L << (K_BETWEEN - 29)) | (1L << (K_BY - 29)) | (1L << (K_CASCADE - 29)) | (1L << (K_CASE - 29)) | (1L << (K_CAST - 29)) | (1L << (K_CHECK - 29)) | (1L << (K_COLLATE - 29)) | (1L << (K_COLUMN - 29)) | (1L << (K_COMMIT - 29)) | (1L << (K_CONFLICT - 29)) | (1L << (K_CONSTRAINT - 29)) | (1L << (K_CREATE - 29)) | (1L << (K_CROSS - 29)) | (1L << (K_CURRENT_DATE - 29)) | (1L << (K_CURRENT_TIME - 29)) | (1L << (K_CURRENT_TIMESTAMP - 29)) | (1L << (K_DATABASE - 29)) | (1L << (K_DEFAULT - 29)) | (1L << (K_DEFERRABLE - 29)) | (1L << (K_DEFERRED - 29)) | (1L << (K_DELETE - 29)) | (1L << (K_DESC - 29)) | (1L << (K_DETACH - 29)) | (1L << (K_DISTINCT - 29)) | (1L << (K_DROP - 29)) | (1L << (K_EACH - 29)) | (1L << (K_ELSE - 29)) | (1L << (K_END - 29)) | (1L << (K_ESCAPE - 29)) | (1L << (K_EXCEPT - 29)) | (1L << (K_EXCLUSIVE - 29)) | (1L << (K_EXISTS - 29)) | (1L << (K_EXPLAIN - 29)) | (1L << (K_FAIL - 29)) | (1L << (K_FOR - 29)) | (1L << (K_FOREIGN - 29)) | (1L << (K_FROM - 29)) | (1L << (K_FULL - 29)) | (1L << (K_GLOB - 29)) | (1L << (K_GROUP - 29)) | (1L << (K_HAVING - 29)) | (1L << (K_IF - 29)) | (1L << (K_IGNORE - 29)) | (1L << (K_IMMEDIATE - 29)) | (1L << (K_IN - 29)) | (1L << (K_INDEX - 29)) | (1L << (K_INDEXED - 29)) | (1L << (K_INITIALLY - 29)) | (1L << (K_INNER - 29)) | (1L << (K_INSERT - 29)))) != 0) || ((((_la - 93)) & ~0x3f) == 0 && ((1L << (_la - 93)) & ((1L << (K_INSTEAD - 93)) | (1L << (K_INTERSECT - 93)) | (1L << (K_INTO - 93)) | (1L << (K_IS - 93)) | (1L << (K_ISNULL - 93)) | (1L << (K_JOIN - 93)) | (1L << (K_KEY - 93)) | (1L << (K_LEFT - 93)) | (1L << (K_LIKE - 93)) | (1L << (K_LIMIT - 93)) | (1L << (K_MATCH - 93)) | (1L << (K_NATURAL - 93)) | (1L << (K_NO - 93)) | (1L << (K_NOT - 93)) | (1L << (K_NOTNULL - 93)) | (1L << (K_NULL - 93)) | (1L << (K_OF - 93)) | (1L << (K_OFFSET - 93)) | (1L << (K_ON - 93)) | (1L << (K_OR - 93)) | (1L << (K_ORDER - 93)) | (1L << (K_OUTER - 93)) | (1L << (K_PLAN - 93)) | (1L << (K_PRAGMA - 93)) | (1L << (K_PRIMARY - 93)) | (1L << (K_QUERY - 93)) | (1L << (K_RAISE - 93)) | (1L << (K_RECURSIVE - 93)) | (1L << (K_REFERENCES - 93)) | (1L << (K_REGEXP - 93)) | (1L << (K_REINDEX - 93)) | (1L << (K_RELEASE - 93)) | (1L << (K_RENAME - 93)) | (1L << (K_REPLACE - 93)) | (1L << (K_RESTRICT - 93)) | (1L << (K_RIGHT - 93)) | (1L << (K_ROLLBACK - 93)) | (1L << (K_ROW - 93)) | (1L << (K_SAVEPOINT - 93)) | (1L << (K_SELECT - 93)) | (1L << (K_SET - 93)) | (1L << (K_TABLE - 93)) | (1L << (K_TEMP - 93)) | (1L << (K_TEMPORARY - 93)) | (1L << (K_THEN - 93)) | (1L << (K_TO - 93)) | (1L << (K_TRANSACTION - 93)) | (1L << (K_TRIGGER - 93)) | (1L << (K_UNION - 93)) | (1L << (K_UNIQUE - 93)) | (1L << (K_UPDATE - 93)) | (1L << (K_USING - 93)) | (1L << (K_VACUUM - 93)) | (1L << (K_VALUES - 93)) | (1L << (K_VIEW - 93)) | (1L << (K_VIRTUAL - 93)) | (1L << (K_WHEN - 93)) | (1L << (K_WHERE - 93)) | (1L << (K_WITH - 93)) | (1L << (K_WITHOUT - 93)))) != 0)) ) { _errHandler.recoverInline(this); } else { if ( _input.LA(1)==Token.EOF ) matchedEOF = true; _errHandler.reportMatch(this); consume(); } } } catch (RecognitionException re) { _localctx.exception = re; _errHandler.reportError(this, re); _errHandler.recover(this, re); } finally { exitRule(); } return _localctx; }
public final KeywordContext keyword() throws RecognitionException { KeywordContext _localctx = new KeywordContext(_ctx, getState()); enterRule(_localctx, 156, RULE_keyword); int _la; try { enterOuterAlt(_localctx, 1); { setState(1708); _la = _input.LA(1); if ( !(((((_la - 31)) & ~0x3f) == 0 && ((1L << (_la - 31)) & ((1L << (K_ABORT - 31)) | (1L << (K_ACTION - 31)) | (1L << (K_ADD - 31)) | (1L << (K_AFTER - 31)) | (1L << (K_ALL - 31)) | (1L << (K_ALTER - 31)) | (1L << (K_ANALYZE - 31)) | (1L << (K_AND - 31)) | (1L << (K_AS - 31)) | (1L << (K_ASC - 31)) | (1L << (K_ATTACH - 31)) | (1L << (K_AUTOINCREMENT - 31)) | (1L << (K_BEFORE - 31)) | (1L << (K_BEGIN - 31)) | (1L << (K_BETWEEN - 31)) | (1L << (K_BY - 31)) | (1L << (K_CASCADE - 31)) | (1L << (K_CASE - 31)) | (1L << (K_CAST - 31)) | (1L << (K_CHECK - 31)) | (1L << (K_COLLATE - 31)) | (1L << (K_COLUMN - 31)) | (1L << (K_COMMIT - 31)) | (1L << (K_CONFLICT - 31)) | (1L << (K_CONSTRAINT - 31)) | (1L << (K_CREATE - 31)) | (1L << (K_CROSS - 31)) | (1L << (K_CURRENT_DATE - 31)) | (1L << (K_CURRENT_TIME - 31)) | (1L << (K_CURRENT_TIMESTAMP - 31)) | (1L << (K_DATABASE - 31)) | (1L << (K_DEFAULT - 31)) | (1L << (K_DEFERRABLE - 31)) | (1L << (K_DEFERRED - 31)) | (1L << (K_DELETE - 31)) | (1L << (K_DESC - 31)) | (1L << (K_DETACH - 31)) | (1L << (K_DISTINCT - 31)) | (1L << (K_DROP - 31)) | (1L << (K_EACH - 31)) | (1L << (K_ELSE - 31)) | (1L << (K_END - 31)) | (1L << (K_ESCAPE - 31)) | (1L << (K_EXCEPT - 31)) | (1L << (K_EXCLUSIVE - 31)) | (1L << (K_EXISTS - 31)) | (1L << (K_EXPLAIN - 31)) | (1L << (K_FAIL - 31)) | (1L << (K_FOR - 31)) | (1L << (K_FOREIGN - 31)) | (1L << (K_FROM - 31)) | (1L << (K_FULL - 31)) | (1L << (K_GLOB - 31)) | (1L << (K_GROUP - 31)) | (1L << (K_HAVING - 31)) | (1L << (K_IF - 31)) | (1L << (K_IGNORE - 31)) | (1L << (K_IMMEDIATE - 31)) | (1L << (K_IN - 31)) | (1L << (K_INDEX - 31)) | (1L << (K_INDEXED - 31)) | (1L << (K_INITIALLY - 31)) | (1L << (K_INNER - 31)) | (1L << (K_INSERT - 31)))) != 0) || ((((_la - 95)) & ~0x3f) == 0 && ((1L << (_la - 95)) & ((1L << (K_INSTEAD - 95)) | (1L << (K_INTERSECT - 95)) | (1L << (K_INTO - 95)) | (1L << (K_IS - 95)) | (1L << (K_ISNULL - 95)) | (1L << (K_JOIN - 95)) | (1L << (K_KEY - 95)) | (1L << (K_LEFT - 95)) | (1L << (K_LIKE - 95)) | (1L << (K_LIMIT - 95)) | (1L << (K_MATCH - 95)) | (1L << (K_NATURAL - 95)) | (1L << (K_NO - 95)) | (1L << (K_NOT - 95)) | (1L << (K_NOTNULL - 95)) | (1L << (K_NULL - 95)) | (1L << (K_OF - 95)) | (1L << (K_OFFSET - 95)) | (1L << (K_ON - 95)) | (1L << (K_OR - 95)) | (1L << (K_ORDER - 95)) | (1L << (K_OUTER - 95)) | (1L << (K_PLAN - 95)) | (1L << (K_PRAGMA - 95)) | (1L << (K_PRIMARY - 95)) | (1L << (K_QUERY - 95)) | (1L << (K_RAISE - 95)) | (1L << (K_RECURSIVE - 95)) | (1L << (K_REFERENCES - 95)) | (1L << (K_REGEXP - 95)) | (1L << (K_REINDEX - 95)) | (1L << (K_RELEASE - 95)) | (1L << (K_RENAME - 95)) | (1L << (K_REPLACE - 95)) | (1L << (K_RESTRICT - 95)) | (1L << (K_RIGHT - 95)) | (1L << (K_ROLLBACK - 95)) | (1L << (K_ROW - 95)) | (1L << (K_SAVEPOINT - 95)) | (1L << (K_SELECT - 95)) | (1L << (K_SET - 95)) | (1L << (K_TABLE - 95)) | (1L << (K_TEMP - 95)) | (1L << (K_TEMPORARY - 95)) | (1L << (K_THEN - 95)) | (1L << (K_TO - 95)) | (1L << (K_TRANSACTION - 95)) | (1L << (K_TRIGGER - 95)) | (1L << (K_UNION - 95)) | (1L << (K_UNIQUE - 95)) | (1L << (K_UPDATE - 95)) | (1L << (K_USING - 95)) | (1L << (K_VACUUM - 95)) | (1L << (K_VALUES - 95)) | (1L << (K_VIEW - 95)) | (1L << (K_VIRTUAL - 95)) | (1L << (K_WHEN - 95)) | (1L << (K_WHERE - 95)) | (1L << (K_WITH - 95)) | (1L << (K_WITHOUT - 95)))) != 0)) ) { _errHandler.recoverInline(this); } else { if ( _input.LA(1)==Token.EOF ) matchedEOF = true; _errHandler.reportMatch(this); consume(); } } } catch (RecognitionException re) { _localctx.exception = re; _errHandler.reportError(this, re); _errHandler.recover(this, re); } finally { exitRule(); } return _localctx; }