spring-filter.2.1.6.source-code.FilterParser Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of spring-filter Show documentation
Show all versions of spring-filter Show documentation
Dynamically filters JPA entities with a simple query syntax. Provides JPA/Hibernate predicates and Spring specifications.
The newest version!
// Generated from Filter.g4 by ANTLR 4.9.3
package com.turkraft.springfilter.parser;
import org.antlr.v4.runtime.atn.*;
import org.antlr.v4.runtime.dfa.DFA;
import org.antlr.v4.runtime.*;
import org.antlr.v4.runtime.misc.*;
import org.antlr.v4.runtime.tree.*;
import java.util.List;
import java.util.Iterator;
import java.util.ArrayList;
@SuppressWarnings({"all", "warnings", "unchecked", "unused", "cast"})
public class FilterParser extends Parser {
static { RuntimeMetaData.checkVersion("4.9.3", RuntimeMetaData.VERSION); }
protected static final DFA[] _decisionToDFA;
protected static final PredictionContextCache _sharedContextCache =
new PredictionContextCache();
public static final int
LIKE=1, EQUAL=2, NOT_EQUAL=3, GREATER_THAN=4, GREATER_THAN_OR_EQUAL=5,
LESS_THAN=6, LESS_THAN_OR_EQUAL=7, AND=8, OR=9, NOT=10, IN=11, IS_NULL=12,
IS_NOT_NULL=13, IS_EMPTY=14, IS_NOT_EMPTY=15, TRUE=16, FALSE=17, DOT=18,
COMMA=19, LPAREN=20, RPAREN=21, ID=22, NUMBER=23, STRING=24, WS=25;
public static final int
RULE_filter = 0, RULE_predicate = 1;
private static String[] makeRuleNames() {
return new String[] {
"filter", "predicate"
};
}
public static final String[] ruleNames = makeRuleNames();
private static String[] makeLiteralNames() {
return new String[] {
null, "'~'", "':'", "'!'", "'>'", "'>:'", "'<'", "'<:'", null, null,
null, null, null, null, null, null, null, null, "'.'", "','", "'('",
"')'"
};
}
private static final String[] _LITERAL_NAMES = makeLiteralNames();
private static String[] makeSymbolicNames() {
return new String[] {
null, "LIKE", "EQUAL", "NOT_EQUAL", "GREATER_THAN", "GREATER_THAN_OR_EQUAL",
"LESS_THAN", "LESS_THAN_OR_EQUAL", "AND", "OR", "NOT", "IN", "IS_NULL",
"IS_NOT_NULL", "IS_EMPTY", "IS_NOT_EMPTY", "TRUE", "FALSE", "DOT", "COMMA",
"LPAREN", "RPAREN", "ID", "NUMBER", "STRING", "WS"
};
}
private static final String[] _SYMBOLIC_NAMES = makeSymbolicNames();
public static final Vocabulary VOCABULARY = new VocabularyImpl(_LITERAL_NAMES, _SYMBOLIC_NAMES);
/**
* @deprecated Use {@link #VOCABULARY} instead.
*/
@Deprecated
public static final String[] tokenNames;
static {
tokenNames = new String[_SYMBOLIC_NAMES.length];
for (int i = 0; i < tokenNames.length; i++) {
tokenNames[i] = VOCABULARY.getLiteralName(i);
if (tokenNames[i] == null) {
tokenNames[i] = VOCABULARY.getSymbolicName(i);
}
if (tokenNames[i] == null) {
tokenNames[i] = "";
}
}
}
@Override
@Deprecated
public String[] getTokenNames() {
return tokenNames;
}
@Override
public Vocabulary getVocabulary() {
return VOCABULARY;
}
@Override
public String getGrammarFileName() { return "Filter.g4"; }
@Override
public String[] getRuleNames() { return ruleNames; }
@Override
public String getSerializedATN() { return _serializedATN; }
@Override
public ATN getATN() { return _ATN; }
public FilterParser(TokenStream input) {
super(input);
_interp = new ParserATNSimulator(this,_ATN,_decisionToDFA,_sharedContextCache);
}
public static class FilterContext extends Filter {
public PredicateContext predicate() {
return getRuleContext(PredicateContext.class,0);
}
public TerminalNode EOF() { return getToken(FilterParser.EOF, 0); }
public FilterContext(ParserRuleContext parent, int invokingState) {
super(parent, invokingState);
}
@Override public int getRuleIndex() { return RULE_filter; }
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof FilterVisitor ) return ((FilterVisitor)visitor).visitFilter(this);
else return visitor.visitChildren(this);
}
}
public final FilterContext filter() throws RecognitionException {
FilterContext _localctx = new FilterContext(_ctx, getState());
enterRule(_localctx, 0, RULE_filter);
try {
enterOuterAlt(_localctx, 1);
{
setState(4);
predicate(0);
setState(5);
match(EOF);
}
}
catch (RecognitionException re) {
_localctx.exception = re;
_errHandler.reportError(this, re);
_errHandler.recover(this, re);
}
finally {
exitRule();
}
return _localctx;
}
public static class PredicateContext extends Filter {
public PredicateContext(ParserRuleContext parent, int invokingState) {
super(parent, invokingState);
}
@Override public int getRuleIndex() { return RULE_predicate; }
public PredicateContext() { }
public void copyFrom(PredicateContext ctx) {
super.copyFrom(ctx);
}
}
public static class InputContext extends PredicateContext {
public TerminalNode STRING() { return getToken(FilterParser.STRING, 0); }
public TerminalNode NUMBER() { return getToken(FilterParser.NUMBER, 0); }
public TerminalNode TRUE() { return getToken(FilterParser.TRUE, 0); }
public TerminalNode FALSE() { return getToken(FilterParser.FALSE, 0); }
public InputContext(PredicateContext ctx) { copyFrom(ctx); }
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof FilterVisitor ) return ((FilterVisitor)visitor).visitInput(this);
else return visitor.visitChildren(this);
}
}
public static class FieldContext extends PredicateContext {
public List ID() { return getTokens(FilterParser.ID); }
public TerminalNode ID(int i) {
return getToken(FilterParser.ID, i);
}
public List DOT() { return getTokens(FilterParser.DOT); }
public TerminalNode DOT(int i) {
return getToken(FilterParser.DOT, i);
}
public FieldContext(PredicateContext ctx) { copyFrom(ctx); }
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof FilterVisitor ) return ((FilterVisitor)visitor).visitField(this);
else return visitor.visitChildren(this);
}
}
public static class PrefixContext extends PredicateContext {
public PredicateContext left;
public Token operator;
public PredicateContext predicate() {
return getRuleContext(PredicateContext.class,0);
}
public TerminalNode IS_NULL() { return getToken(FilterParser.IS_NULL, 0); }
public TerminalNode IS_NOT_NULL() { return getToken(FilterParser.IS_NOT_NULL, 0); }
public TerminalNode IS_EMPTY() { return getToken(FilterParser.IS_EMPTY, 0); }
public TerminalNode IS_NOT_EMPTY() { return getToken(FilterParser.IS_NOT_EMPTY, 0); }
public PrefixContext(PredicateContext ctx) { copyFrom(ctx); }
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof FilterVisitor ) return ((FilterVisitor)visitor).visitPrefix(this);
else return visitor.visitChildren(this);
}
}
public static class FunctionContext extends PredicateContext {
public PredicateContext predicate;
public List arguments = new ArrayList();
public TerminalNode ID() { return getToken(FilterParser.ID, 0); }
public TerminalNode LPAREN() { return getToken(FilterParser.LPAREN, 0); }
public TerminalNode RPAREN() { return getToken(FilterParser.RPAREN, 0); }
public List predicate() {
return getRuleContexts(PredicateContext.class);
}
public PredicateContext predicate(int i) {
return getRuleContext(PredicateContext.class,i);
}
public List COMMA() { return getTokens(FilterParser.COMMA); }
public TerminalNode COMMA(int i) {
return getToken(FilterParser.COMMA, i);
}
public FunctionContext(PredicateContext ctx) { copyFrom(ctx); }
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof FilterVisitor ) return ((FilterVisitor)visitor).visitFunction(this);
else return visitor.visitChildren(this);
}
}
public static class PostfixContext extends PredicateContext {
public Token operator;
public PredicateContext right;
public TerminalNode NOT() { return getToken(FilterParser.NOT, 0); }
public PredicateContext predicate() {
return getRuleContext(PredicateContext.class,0);
}
public PostfixContext(PredicateContext ctx) { copyFrom(ctx); }
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof FilterVisitor ) return ((FilterVisitor)visitor).visitPostfix(this);
else return visitor.visitChildren(this);
}
}
public static class InfixContext extends PredicateContext {
public PredicateContext left;
public Token operator;
public PredicateContext right;
public PredicateContext predicate;
public List arguments = new ArrayList();
public List predicate() {
return getRuleContexts(PredicateContext.class);
}
public PredicateContext predicate(int i) {
return getRuleContext(PredicateContext.class,i);
}
public TerminalNode LIKE() { return getToken(FilterParser.LIKE, 0); }
public TerminalNode EQUAL() { return getToken(FilterParser.EQUAL, 0); }
public TerminalNode NOT_EQUAL() { return getToken(FilterParser.NOT_EQUAL, 0); }
public TerminalNode GREATER_THAN() { return getToken(FilterParser.GREATER_THAN, 0); }
public TerminalNode GREATER_THAN_OR_EQUAL() { return getToken(FilterParser.GREATER_THAN_OR_EQUAL, 0); }
public TerminalNode LESS_THAN() { return getToken(FilterParser.LESS_THAN, 0); }
public TerminalNode LESS_THAN_OR_EQUAL() { return getToken(FilterParser.LESS_THAN_OR_EQUAL, 0); }
public TerminalNode AND() { return getToken(FilterParser.AND, 0); }
public TerminalNode OR() { return getToken(FilterParser.OR, 0); }
public TerminalNode LPAREN() { return getToken(FilterParser.LPAREN, 0); }
public TerminalNode RPAREN() { return getToken(FilterParser.RPAREN, 0); }
public TerminalNode IN() { return getToken(FilterParser.IN, 0); }
public List COMMA() { return getTokens(FilterParser.COMMA); }
public TerminalNode COMMA(int i) {
return getToken(FilterParser.COMMA, i);
}
public InfixContext(PredicateContext ctx) { copyFrom(ctx); }
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof FilterVisitor ) return ((FilterVisitor)visitor).visitInfix(this);
else return visitor.visitChildren(this);
}
}
public static class PriorityContext extends PredicateContext {
public TerminalNode LPAREN() { return getToken(FilterParser.LPAREN, 0); }
public PredicateContext predicate() {
return getRuleContext(PredicateContext.class,0);
}
public TerminalNode RPAREN() { return getToken(FilterParser.RPAREN, 0); }
public PriorityContext(PredicateContext ctx) { copyFrom(ctx); }
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof FilterVisitor ) return ((FilterVisitor)visitor).visitPriority(this);
else return visitor.visitChildren(this);
}
}
public final PredicateContext predicate() throws RecognitionException {
return predicate(0);
}
private PredicateContext predicate(int _p) throws RecognitionException {
ParserRuleContext _parentctx = _ctx;
int _parentState = getState();
PredicateContext _localctx = new PredicateContext(_ctx, _parentState);
PredicateContext _prevctx = _localctx;
int _startState = 2;
enterRecursionRule(_localctx, 2, RULE_predicate, _p);
int _la;
try {
int _alt;
enterOuterAlt(_localctx, 1);
{
setState(36);
_errHandler.sync(this);
switch ( getInterpreter().adaptivePredict(_input,3,_ctx) ) {
case 1:
{
_localctx = new PostfixContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(8);
((PostfixContext)_localctx).operator = match(NOT);
setState(9);
((PostfixContext)_localctx).right = predicate(7);
}
break;
case 2:
{
_localctx = new PriorityContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(10);
match(LPAREN);
setState(11);
predicate(0);
setState(12);
match(RPAREN);
}
break;
case 3:
{
_localctx = new FunctionContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(14);
match(ID);
setState(15);
match(LPAREN);
setState(24);
_errHandler.sync(this);
_la = _input.LA(1);
if ((((_la) & ~0x3f) == 0 && ((1L << _la) & ((1L << NOT) | (1L << TRUE) | (1L << FALSE) | (1L << LPAREN) | (1L << ID) | (1L << NUMBER) | (1L << STRING))) != 0)) {
{
setState(16);
((FunctionContext)_localctx).predicate = predicate(0);
((FunctionContext)_localctx).arguments.add(((FunctionContext)_localctx).predicate);
setState(21);
_errHandler.sync(this);
_la = _input.LA(1);
while (_la==COMMA) {
{
{
setState(17);
match(COMMA);
setState(18);
((FunctionContext)_localctx).predicate = predicate(0);
((FunctionContext)_localctx).arguments.add(((FunctionContext)_localctx).predicate);
}
}
setState(23);
_errHandler.sync(this);
_la = _input.LA(1);
}
}
}
setState(26);
match(RPAREN);
}
break;
case 4:
{
_localctx = new FieldContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(27);
match(ID);
setState(32);
_errHandler.sync(this);
_alt = getInterpreter().adaptivePredict(_input,2,_ctx);
while ( _alt!=2 && _alt!=org.antlr.v4.runtime.atn.ATN.INVALID_ALT_NUMBER ) {
if ( _alt==1 ) {
{
{
setState(28);
match(DOT);
setState(29);
match(ID);
}
}
}
setState(34);
_errHandler.sync(this);
_alt = getInterpreter().adaptivePredict(_input,2,_ctx);
}
}
break;
case 5:
{
_localctx = new InputContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(35);
_la = _input.LA(1);
if ( !((((_la) & ~0x3f) == 0 && ((1L << _la) & ((1L << TRUE) | (1L << FALSE) | (1L << NUMBER) | (1L << STRING))) != 0)) ) {
_errHandler.recoverInline(this);
}
else {
if ( _input.LA(1)==Token.EOF ) matchedEOF = true;
_errHandler.reportMatch(this);
consume();
}
}
break;
}
_ctx.stop = _input.LT(-1);
setState(68);
_errHandler.sync(this);
_alt = getInterpreter().adaptivePredict(_input,7,_ctx);
while ( _alt!=2 && _alt!=org.antlr.v4.runtime.atn.ATN.INVALID_ALT_NUMBER ) {
if ( _alt==1 ) {
if ( _parseListeners!=null ) triggerExitRuleEvent();
_prevctx = _localctx;
{
setState(66);
_errHandler.sync(this);
switch ( getInterpreter().adaptivePredict(_input,6,_ctx) ) {
case 1:
{
_localctx = new InfixContext(new PredicateContext(_parentctx, _parentState));
((InfixContext)_localctx).left = _prevctx;
pushNewRecursionContext(_localctx, _startState, RULE_predicate);
setState(38);
if (!(precpred(_ctx, 10))) throw new FailedPredicateException(this, "precpred(_ctx, 10)");
setState(39);
((InfixContext)_localctx).operator = _input.LT(1);
_la = _input.LA(1);
if ( !((((_la) & ~0x3f) == 0 && ((1L << _la) & ((1L << LIKE) | (1L << EQUAL) | (1L << NOT_EQUAL) | (1L << GREATER_THAN) | (1L << GREATER_THAN_OR_EQUAL) | (1L << LESS_THAN) | (1L << LESS_THAN_OR_EQUAL))) != 0)) ) {
((InfixContext)_localctx).operator = (Token)_errHandler.recoverInline(this);
}
else {
if ( _input.LA(1)==Token.EOF ) matchedEOF = true;
_errHandler.reportMatch(this);
consume();
}
setState(40);
((InfixContext)_localctx).right = predicate(11);
}
break;
case 2:
{
_localctx = new InfixContext(new PredicateContext(_parentctx, _parentState));
((InfixContext)_localctx).left = _prevctx;
pushNewRecursionContext(_localctx, _startState, RULE_predicate);
setState(41);
if (!(precpred(_ctx, 6))) throw new FailedPredicateException(this, "precpred(_ctx, 6)");
setState(42);
((InfixContext)_localctx).operator = match(AND);
setState(43);
((InfixContext)_localctx).right = predicate(7);
}
break;
case 3:
{
_localctx = new InfixContext(new PredicateContext(_parentctx, _parentState));
((InfixContext)_localctx).left = _prevctx;
pushNewRecursionContext(_localctx, _startState, RULE_predicate);
setState(44);
if (!(precpred(_ctx, 5))) throw new FailedPredicateException(this, "precpred(_ctx, 5)");
setState(45);
((InfixContext)_localctx).operator = match(OR);
setState(46);
((InfixContext)_localctx).right = predicate(6);
}
break;
case 4:
{
_localctx = new InfixContext(new PredicateContext(_parentctx, _parentState));
((InfixContext)_localctx).left = _prevctx;
pushNewRecursionContext(_localctx, _startState, RULE_predicate);
setState(47);
if (!(precpred(_ctx, 9))) throw new FailedPredicateException(this, "precpred(_ctx, 9)");
setState(48);
((InfixContext)_localctx).operator = match(IN);
setState(49);
match(LPAREN);
setState(58);
_errHandler.sync(this);
_la = _input.LA(1);
do {
{
{
setState(50);
((InfixContext)_localctx).predicate = predicate(0);
((InfixContext)_localctx).arguments.add(((InfixContext)_localctx).predicate);
setState(55);
_errHandler.sync(this);
_la = _input.LA(1);
while (_la==COMMA) {
{
{
setState(51);
match(COMMA);
setState(52);
((InfixContext)_localctx).predicate = predicate(0);
((InfixContext)_localctx).arguments.add(((InfixContext)_localctx).predicate);
}
}
setState(57);
_errHandler.sync(this);
_la = _input.LA(1);
}
}
}
setState(60);
_errHandler.sync(this);
_la = _input.LA(1);
} while ( (((_la) & ~0x3f) == 0 && ((1L << _la) & ((1L << NOT) | (1L << TRUE) | (1L << FALSE) | (1L << LPAREN) | (1L << ID) | (1L << NUMBER) | (1L << STRING))) != 0) );
setState(62);
match(RPAREN);
}
break;
case 5:
{
_localctx = new PrefixContext(new PredicateContext(_parentctx, _parentState));
((PrefixContext)_localctx).left = _prevctx;
pushNewRecursionContext(_localctx, _startState, RULE_predicate);
setState(64);
if (!(precpred(_ctx, 8))) throw new FailedPredicateException(this, "precpred(_ctx, 8)");
setState(65);
((PrefixContext)_localctx).operator = _input.LT(1);
_la = _input.LA(1);
if ( !((((_la) & ~0x3f) == 0 && ((1L << _la) & ((1L << IS_NULL) | (1L << IS_NOT_NULL) | (1L << IS_EMPTY) | (1L << IS_NOT_EMPTY))) != 0)) ) {
((PrefixContext)_localctx).operator = (Token)_errHandler.recoverInline(this);
}
else {
if ( _input.LA(1)==Token.EOF ) matchedEOF = true;
_errHandler.reportMatch(this);
consume();
}
}
break;
}
}
}
setState(70);
_errHandler.sync(this);
_alt = getInterpreter().adaptivePredict(_input,7,_ctx);
}
}
}
catch (RecognitionException re) {
_localctx.exception = re;
_errHandler.reportError(this, re);
_errHandler.recover(this, re);
}
finally {
unrollRecursionContexts(_parentctx);
}
return _localctx;
}
public boolean sempred(RuleContext _localctx, int ruleIndex, int predIndex) {
switch (ruleIndex) {
case 1:
return predicate_sempred((PredicateContext)_localctx, predIndex);
}
return true;
}
private boolean predicate_sempred(PredicateContext _localctx, int predIndex) {
switch (predIndex) {
case 0:
return precpred(_ctx, 10);
case 1:
return precpred(_ctx, 6);
case 2:
return precpred(_ctx, 5);
case 3:
return precpred(_ctx, 9);
case 4:
return precpred(_ctx, 8);
}
return true;
}
public static final String _serializedATN =
"\3\u608b\ua72a\u8133\ub9ed\u417c\u3be7\u7786\u5964\3\33J\4\2\t\2\4\3\t"+
"\3\3\2\3\2\3\2\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\7\3\26"+
"\n\3\f\3\16\3\31\13\3\5\3\33\n\3\3\3\3\3\3\3\3\3\7\3!\n\3\f\3\16\3$\13"+
"\3\3\3\5\3\'\n\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3\3"+
"\3\3\3\7\38\n\3\f\3\16\3;\13\3\6\3=\n\3\r\3\16\3>\3\3\3\3\3\3\3\3\7\3"+
"E\n\3\f\3\16\3H\13\3\3\3\2\3\4\4\2\4\2\5\4\2\22\23\31\32\3\2\3\t\3\2\16"+
"\21\2U\2\6\3\2\2\2\4&\3\2\2\2\6\7\5\4\3\2\7\b\7\2\2\3\b\3\3\2\2\2\t\n"+
"\b\3\1\2\n\13\7\f\2\2\13\'\5\4\3\t\f\r\7\26\2\2\r\16\5\4\3\2\16\17\7\27"+
"\2\2\17\'\3\2\2\2\20\21\7\30\2\2\21\32\7\26\2\2\22\27\5\4\3\2\23\24\7"+
"\25\2\2\24\26\5\4\3\2\25\23\3\2\2\2\26\31\3\2\2\2\27\25\3\2\2\2\27\30"+
"\3\2\2\2\30\33\3\2\2\2\31\27\3\2\2\2\32\22\3\2\2\2\32\33\3\2\2\2\33\34"+
"\3\2\2\2\34\'\7\27\2\2\35\"\7\30\2\2\36\37\7\24\2\2\37!\7\30\2\2 \36\3"+
"\2\2\2!$\3\2\2\2\" \3\2\2\2\"#\3\2\2\2#\'\3\2\2\2$\"\3\2\2\2%\'\t\2\2"+
"\2&\t\3\2\2\2&\f\3\2\2\2&\20\3\2\2\2&\35\3\2\2\2&%\3\2\2\2\'F\3\2\2\2"+
"()\f\f\2\2)*\t\3\2\2*E\5\4\3\r+,\f\b\2\2,-\7\n\2\2-E\5\4\3\t./\f\7\2\2"+
"/\60\7\13\2\2\60E\5\4\3\b\61\62\f\13\2\2\62\63\7\r\2\2\63<\7\26\2\2\64"+
"9\5\4\3\2\65\66\7\25\2\2\668\5\4\3\2\67\65\3\2\2\28;\3\2\2\29\67\3\2\2"+
"\29:\3\2\2\2:=\3\2\2\2;9\3\2\2\2<\64\3\2\2\2=>\3\2\2\2><\3\2\2\2>?\3\2"+
"\2\2?@\3\2\2\2@A\7\27\2\2AE\3\2\2\2BC\f\n\2\2CE\t\4\2\2D(\3\2\2\2D+\3"+
"\2\2\2D.\3\2\2\2D\61\3\2\2\2DB\3\2\2\2EH\3\2\2\2FD\3\2\2\2FG\3\2\2\2G"+
"\5\3\2\2\2HF\3\2\2\2\n\27\32\"&9>DF";
public static final ATN _ATN =
new ATNDeserializer().deserialize(_serializedATN.toCharArray());
static {
_decisionToDFA = new DFA[_ATN.getNumberOfDecisions()];
for (int i = 0; i < _ATN.getNumberOfDecisions(); i++) {
_decisionToDFA[i] = new DFA(_ATN.getDecisionState(i), i);
}
}
} © 2015 - 2025 Weber Informatics LLC | Privacy Policy