Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
com.hotels.styx.server.routing.ConditionParser Maven / Gradle / Ivy
// Generated from com/hotels/styx/server/routing/Condition.g4 by ANTLR 4.5.1
package com.hotels.styx.server.routing;
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 ConditionParser extends Parser {
static { RuntimeMetaData.checkVersion("4.5.1", RuntimeMetaData.VERSION); }
protected static final DFA[] _decisionToDFA;
protected static final PredictionContextCache _sharedContextCache =
new PredictionContextCache();
public static final int
T__0=1, T__1=2, T__2=3, T__3=4, T__4=5, DQUOTED_STRING=6, QUOTED_STRING=7,
AND=8, OR=9, NOT=10, SQUOTE=11, DQUOTE=12, ID=13, WS=14;
public static final int
RULE_expression = 0, RULE_stringComparison = 1, RULE_stringExpression = 2,
RULE_function = 3, RULE_arglist = 4, RULE_string = 5;
public static final String[] ruleNames = {
"expression", "stringComparison", "stringExpression", "function", "arglist",
"string"
};
private static final String[] _LITERAL_NAMES = {
null, "'('", "')'", "'=~'", "'=='", "','", null, null, "'AND'", "'OR'",
"'NOT'"
};
private static final String[] _SYMBOLIC_NAMES = {
null, null, null, null, null, null, "DQUOTED_STRING", "QUOTED_STRING",
"AND", "OR", "NOT", "SQUOTE", "DQUOTE", "ID", "WS"
};
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 "Condition.g4"; }
@Override
public String[] getRuleNames() { return ruleNames; }
@Override
public String getSerializedATN() { return _serializedATN; }
@Override
public ATN getATN() { return _ATN; }
public ConditionParser(TokenStream input) {
super(input);
_interp = new ParserATNSimulator(this,_ATN,_decisionToDFA,_sharedContextCache);
}
public static class ExpressionContext extends ParserRuleContext {
public ExpressionContext(ParserRuleContext parent, int invokingState) {
super(parent, invokingState);
}
@Override public int getRuleIndex() { return RULE_expression; }
public ExpressionContext() { }
public void copyFrom(ExpressionContext ctx) {
super.copyFrom(ctx);
}
}
public static class AndExpressionContext extends ExpressionContext {
public List expression() {
return getRuleContexts(ExpressionContext.class);
}
public ExpressionContext expression(int i) {
return getRuleContext(ExpressionContext.class,i);
}
public TerminalNode AND() { return getToken(ConditionParser.AND, 0); }
public AndExpressionContext(ExpressionContext ctx) { copyFrom(ctx); }
@Override
public void enterRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).enterAndExpression(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).exitAndExpression(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof ConditionVisitor ) return ((ConditionVisitor)visitor).visitAndExpression(this);
else return visitor.visitChildren(this);
}
}
public static class StringCompareExpressionContext extends ExpressionContext {
public StringComparisonContext stringComparison() {
return getRuleContext(StringComparisonContext.class,0);
}
public StringCompareExpressionContext(ExpressionContext ctx) { copyFrom(ctx); }
@Override
public void enterRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).enterStringCompareExpression(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).exitStringCompareExpression(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof ConditionVisitor ) return ((ConditionVisitor)visitor).visitStringCompareExpression(this);
else return visitor.visitChildren(this);
}
}
public static class NotExpressionContext extends ExpressionContext {
public TerminalNode NOT() { return getToken(ConditionParser.NOT, 0); }
public ExpressionContext expression() {
return getRuleContext(ExpressionContext.class,0);
}
public NotExpressionContext(ExpressionContext ctx) { copyFrom(ctx); }
@Override
public void enterRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).enterNotExpression(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).exitNotExpression(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof ConditionVisitor ) return ((ConditionVisitor)visitor).visitNotExpression(this);
else return visitor.visitChildren(this);
}
}
public static class OrExpressionContext extends ExpressionContext {
public List expression() {
return getRuleContexts(ExpressionContext.class);
}
public ExpressionContext expression(int i) {
return getRuleContext(ExpressionContext.class,i);
}
public TerminalNode OR() { return getToken(ConditionParser.OR, 0); }
public OrExpressionContext(ExpressionContext ctx) { copyFrom(ctx); }
@Override
public void enterRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).enterOrExpression(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).exitOrExpression(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof ConditionVisitor ) return ((ConditionVisitor)visitor).visitOrExpression(this);
else return visitor.visitChildren(this);
}
}
public static class SubExpressionContext extends ExpressionContext {
public ExpressionContext expression() {
return getRuleContext(ExpressionContext.class,0);
}
public SubExpressionContext(ExpressionContext ctx) { copyFrom(ctx); }
@Override
public void enterRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).enterSubExpression(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).exitSubExpression(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof ConditionVisitor ) return ((ConditionVisitor)visitor).visitSubExpression(this);
else return visitor.visitChildren(this);
}
}
public final ExpressionContext expression() throws RecognitionException {
return expression(0);
}
private ExpressionContext expression(int _p) throws RecognitionException {
ParserRuleContext _parentctx = _ctx;
int _parentState = getState();
ExpressionContext _localctx = new ExpressionContext(_ctx, _parentState);
ExpressionContext _prevctx = _localctx;
int _startState = 0;
enterRecursionRule(_localctx, 0, RULE_expression, _p);
try {
int _alt;
enterOuterAlt(_localctx, 1);
{
setState(20);
switch (_input.LA(1)) {
case NOT:
{
_localctx = new NotExpressionContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(13);
match(NOT);
setState(14);
expression(5);
}
break;
case T__0:
{
_localctx = new SubExpressionContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(15);
match(T__0);
setState(16);
expression(0);
setState(17);
match(T__1);
}
break;
case DQUOTED_STRING:
case QUOTED_STRING:
case ID:
{
_localctx = new StringCompareExpressionContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(19);
stringComparison();
}
break;
default:
throw new NoViableAltException(this);
}
_ctx.stop = _input.LT(-1);
setState(30);
_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 ) {
if ( _parseListeners!=null ) triggerExitRuleEvent();
_prevctx = _localctx;
{
setState(28);
switch ( getInterpreter().adaptivePredict(_input,1,_ctx) ) {
case 1:
{
_localctx = new AndExpressionContext(new ExpressionContext(_parentctx, _parentState));
pushNewRecursionContext(_localctx, _startState, RULE_expression);
setState(22);
if (!(precpred(_ctx, 4))) throw new FailedPredicateException(this, "precpred(_ctx, 4)");
setState(23);
match(AND);
setState(24);
expression(5);
}
break;
case 2:
{
_localctx = new OrExpressionContext(new ExpressionContext(_parentctx, _parentState));
pushNewRecursionContext(_localctx, _startState, RULE_expression);
setState(25);
if (!(precpred(_ctx, 3))) throw new FailedPredicateException(this, "precpred(_ctx, 3)");
setState(26);
match(OR);
setState(27);
expression(4);
}
break;
}
}
}
setState(32);
_errHandler.sync(this);
_alt = getInterpreter().adaptivePredict(_input,2,_ctx);
}
}
}
catch (RecognitionException re) {
_localctx.exception = re;
_errHandler.reportError(this, re);
_errHandler.recover(this, re);
}
finally {
unrollRecursionContexts(_parentctx);
}
return _localctx;
}
public static class StringComparisonContext extends ParserRuleContext {
public StringComparisonContext(ParserRuleContext parent, int invokingState) {
super(parent, invokingState);
}
@Override public int getRuleIndex() { return RULE_stringComparison; }
public StringComparisonContext() { }
public void copyFrom(StringComparisonContext ctx) {
super.copyFrom(ctx);
}
}
public static class StringEqualsStringContext extends StringComparisonContext {
public List stringExpression() {
return getRuleContexts(StringExpressionContext.class);
}
public StringExpressionContext stringExpression(int i) {
return getRuleContext(StringExpressionContext.class,i);
}
public StringEqualsStringContext(StringComparisonContext ctx) { copyFrom(ctx); }
@Override
public void enterRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).enterStringEqualsString(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).exitStringEqualsString(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof ConditionVisitor ) return ((ConditionVisitor)visitor).visitStringEqualsString(this);
else return visitor.visitChildren(this);
}
}
public static class StringIsPresentContext extends StringComparisonContext {
public StringExpressionContext stringExpression() {
return getRuleContext(StringExpressionContext.class,0);
}
public StringIsPresentContext(StringComparisonContext ctx) { copyFrom(ctx); }
@Override
public void enterRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).enterStringIsPresent(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).exitStringIsPresent(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof ConditionVisitor ) return ((ConditionVisitor)visitor).visitStringIsPresent(this);
else return visitor.visitChildren(this);
}
}
public static class StringMatchesRegexpContext extends StringComparisonContext {
public StringExpressionContext stringExpression() {
return getRuleContext(StringExpressionContext.class,0);
}
public StringContext string() {
return getRuleContext(StringContext.class,0);
}
public StringMatchesRegexpContext(StringComparisonContext ctx) { copyFrom(ctx); }
@Override
public void enterRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).enterStringMatchesRegexp(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).exitStringMatchesRegexp(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof ConditionVisitor ) return ((ConditionVisitor)visitor).visitStringMatchesRegexp(this);
else return visitor.visitChildren(this);
}
}
public final StringComparisonContext stringComparison() throws RecognitionException {
StringComparisonContext _localctx = new StringComparisonContext(_ctx, getState());
enterRule(_localctx, 2, RULE_stringComparison);
try {
setState(42);
switch ( getInterpreter().adaptivePredict(_input,3,_ctx) ) {
case 1:
_localctx = new StringMatchesRegexpContext(_localctx);
enterOuterAlt(_localctx, 1);
{
setState(33);
stringExpression();
setState(34);
match(T__2);
setState(35);
string();
}
break;
case 2:
_localctx = new StringEqualsStringContext(_localctx);
enterOuterAlt(_localctx, 2);
{
setState(37);
stringExpression();
setState(38);
match(T__3);
setState(39);
stringExpression();
}
break;
case 3:
_localctx = new StringIsPresentContext(_localctx);
enterOuterAlt(_localctx, 3);
{
setState(41);
stringExpression();
}
break;
}
}
catch (RecognitionException re) {
_localctx.exception = re;
_errHandler.reportError(this, re);
_errHandler.recover(this, re);
}
finally {
exitRule();
}
return _localctx;
}
public static class StringExpressionContext extends ParserRuleContext {
public FunctionContext function() {
return getRuleContext(FunctionContext.class,0);
}
public StringContext string() {
return getRuleContext(StringContext.class,0);
}
public StringExpressionContext(ParserRuleContext parent, int invokingState) {
super(parent, invokingState);
}
@Override public int getRuleIndex() { return RULE_stringExpression; }
@Override
public void enterRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).enterStringExpression(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).exitStringExpression(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof ConditionVisitor ) return ((ConditionVisitor)visitor).visitStringExpression(this);
else return visitor.visitChildren(this);
}
}
public final StringExpressionContext stringExpression() throws RecognitionException {
StringExpressionContext _localctx = new StringExpressionContext(_ctx, getState());
enterRule(_localctx, 4, RULE_stringExpression);
try {
setState(46);
switch (_input.LA(1)) {
case ID:
enterOuterAlt(_localctx, 1);
{
setState(44);
function();
}
break;
case DQUOTED_STRING:
case QUOTED_STRING:
enterOuterAlt(_localctx, 2);
{
setState(45);
string();
}
break;
default:
throw new NoViableAltException(this);
}
}
catch (RecognitionException re) {
_localctx.exception = re;
_errHandler.reportError(this, re);
_errHandler.recover(this, re);
}
finally {
exitRule();
}
return _localctx;
}
public static class FunctionContext extends ParserRuleContext {
public TerminalNode ID() { return getToken(ConditionParser.ID, 0); }
public ArglistContext arglist() {
return getRuleContext(ArglistContext.class,0);
}
public FunctionContext(ParserRuleContext parent, int invokingState) {
super(parent, invokingState);
}
@Override public int getRuleIndex() { return RULE_function; }
@Override
public void enterRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).enterFunction(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).exitFunction(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof ConditionVisitor ) return ((ConditionVisitor)visitor).visitFunction(this);
else return visitor.visitChildren(this);
}
}
public final FunctionContext function() throws RecognitionException {
FunctionContext _localctx = new FunctionContext(_ctx, getState());
enterRule(_localctx, 6, RULE_function);
try {
setState(65);
switch ( getInterpreter().adaptivePredict(_input,5,_ctx) ) {
case 1:
enterOuterAlt(_localctx, 1);
{
setState(48);
match(ID);
setState(49);
match(T__0);
setState(50);
arglist();
setState(51);
match(T__1);
}
break;
case 2:
enterOuterAlt(_localctx, 2);
{
setState(53);
match(ID);
setState(54);
match(T__0);
setState(55);
arglist();
notifyErrorListeners("Missing closing parenthesis");
}
break;
case 3:
enterOuterAlt(_localctx, 3);
{
setState(58);
match(ID);
setState(59);
match(T__0);
setState(60);
arglist();
setState(61);
match(T__1);
setState(62);
match(T__1);
notifyErrorListeners("Too many closing parentheses");
}
break;
}
}
catch (RecognitionException re) {
_localctx.exception = re;
_errHandler.reportError(this, re);
_errHandler.recover(this, re);
}
finally {
exitRule();
}
return _localctx;
}
public static class ArglistContext extends ParserRuleContext {
public List string() {
return getRuleContexts(StringContext.class);
}
public StringContext string(int i) {
return getRuleContext(StringContext.class,i);
}
public ArglistContext(ParserRuleContext parent, int invokingState) {
super(parent, invokingState);
}
@Override public int getRuleIndex() { return RULE_arglist; }
@Override
public void enterRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).enterArglist(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).exitArglist(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof ConditionVisitor ) return ((ConditionVisitor)visitor).visitArglist(this);
else return visitor.visitChildren(this);
}
}
public final ArglistContext arglist() throws RecognitionException {
ArglistContext _localctx = new ArglistContext(_ctx, getState());
enterRule(_localctx, 8, RULE_arglist);
try {
int _alt;
enterOuterAlt(_localctx, 1);
{
setState(75);
switch ( getInterpreter().adaptivePredict(_input,7,_ctx) ) {
case 1:
{
setState(67);
string();
setState(72);
_errHandler.sync(this);
_alt = getInterpreter().adaptivePredict(_input,6,_ctx);
while ( _alt!=2 && _alt!=org.antlr.v4.runtime.atn.ATN.INVALID_ALT_NUMBER ) {
if ( _alt==1 ) {
{
{
setState(68);
match(T__4);
setState(69);
string();
}
}
}
setState(74);
_errHandler.sync(this);
_alt = getInterpreter().adaptivePredict(_input,6,_ctx);
}
}
break;
}
}
}
catch (RecognitionException re) {
_localctx.exception = re;
_errHandler.reportError(this, re);
_errHandler.recover(this, re);
}
finally {
exitRule();
}
return _localctx;
}
public static class StringContext extends ParserRuleContext {
public TerminalNode QUOTED_STRING() { return getToken(ConditionParser.QUOTED_STRING, 0); }
public TerminalNode DQUOTED_STRING() { return getToken(ConditionParser.DQUOTED_STRING, 0); }
public StringContext(ParserRuleContext parent, int invokingState) {
super(parent, invokingState);
}
@Override public int getRuleIndex() { return RULE_string; }
@Override
public void enterRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).enterString(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if ( listener instanceof ConditionListener ) ((ConditionListener)listener).exitString(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if ( visitor instanceof ConditionVisitor ) return ((ConditionVisitor)visitor).visitString(this);
else return visitor.visitChildren(this);
}
}
public final StringContext string() throws RecognitionException {
StringContext _localctx = new StringContext(_ctx, getState());
enterRule(_localctx, 10, RULE_string);
int _la;
try {
enterOuterAlt(_localctx, 1);
{
setState(77);
_la = _input.LA(1);
if ( !(_la==DQUOTED_STRING || _la==QUOTED_STRING) ) {
_errHandler.recoverInline(this);
} else {
consume();
}
}
}
catch (RecognitionException re) {
_localctx.exception = re;
_errHandler.reportError(this, re);
_errHandler.recover(this, re);
}
finally {
exitRule();
}
return _localctx;
}
public boolean sempred(RuleContext _localctx, int ruleIndex, int predIndex) {
switch (ruleIndex) {
case 0:
return expression_sempred((ExpressionContext)_localctx, predIndex);
}
return true;
}
private boolean expression_sempred(ExpressionContext _localctx, int predIndex) {
switch (predIndex) {
case 0:
return precpred(_ctx, 4);
case 1:
return precpred(_ctx, 3);
}
return true;
}
public static final String _serializedATN =
"\3\u0430\ud6d1\u8206\uad2d\u4417\uaef1\u8d80\uaadd\3\20R\4\2\t\2\4\3\t"+
"\3\4\4\t\4\4\5\t\5\4\6\t\6\4\7\t\7\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\5\2"+
"\27\n\2\3\2\3\2\3\2\3\2\3\2\3\2\7\2\37\n\2\f\2\16\2\"\13\2\3\3\3\3\3\3"+
"\3\3\3\3\3\3\3\3\3\3\3\3\5\3-\n\3\3\4\3\4\5\4\61\n\4\3\5\3\5\3\5\3\5\3"+
"\5\3\5\3\5\3\5\3\5\3\5\3\5\3\5\3\5\3\5\3\5\3\5\3\5\5\5D\n\5\3\6\3\6\3"+
"\6\7\6I\n\6\f\6\16\6L\13\6\5\6N\n\6\3\7\3\7\3\7\2\3\2\b\2\4\6\b\n\f\2"+
"\3\3\2\b\tV\2\26\3\2\2\2\4,\3\2\2\2\6\60\3\2\2\2\bC\3\2\2\2\nM\3\2\2\2"+
"\fO\3\2\2\2\16\17\b\2\1\2\17\20\7\f\2\2\20\27\5\2\2\7\21\22\7\3\2\2\22"+
"\23\5\2\2\2\23\24\7\4\2\2\24\27\3\2\2\2\25\27\5\4\3\2\26\16\3\2\2\2\26"+
"\21\3\2\2\2\26\25\3\2\2\2\27 \3\2\2\2\30\31\f\6\2\2\31\32\7\n\2\2\32\37"+
"\5\2\2\7\33\34\f\5\2\2\34\35\7\13\2\2\35\37\5\2\2\6\36\30\3\2\2\2\36\33"+
"\3\2\2\2\37\"\3\2\2\2 \36\3\2\2\2 !\3\2\2\2!\3\3\2\2\2\" \3\2\2\2#$\5"+
"\6\4\2$%\7\5\2\2%&\5\f\7\2&-\3\2\2\2\'(\5\6\4\2()\7\6\2\2)*\5\6\4\2*-"+
"\3\2\2\2+-\5\6\4\2,#\3\2\2\2,\'\3\2\2\2,+\3\2\2\2-\5\3\2\2\2.\61\5\b\5"+
"\2/\61\5\f\7\2\60.\3\2\2\2\60/\3\2\2\2\61\7\3\2\2\2\62\63\7\17\2\2\63"+
"\64\7\3\2\2\64\65\5\n\6\2\65\66\7\4\2\2\66D\3\2\2\2\678\7\17\2\289\7\3"+
"\2\29:\5\n\6\2:;\b\5\1\2;D\3\2\2\2<=\7\17\2\2=>\7\3\2\2>?\5\n\6\2?@\7"+
"\4\2\2@A\7\4\2\2AB\b\5\1\2BD\3\2\2\2C\62\3\2\2\2C\67\3\2\2\2C<\3\2\2\2"+
"D\t\3\2\2\2EJ\5\f\7\2FG\7\7\2\2GI\5\f\7\2HF\3\2\2\2IL\3\2\2\2JH\3\2\2"+
"\2JK\3\2\2\2KN\3\2\2\2LJ\3\2\2\2ME\3\2\2\2MN\3\2\2\2N\13\3\2\2\2OP\t\2"+
"\2\2P\r\3\2\2\2\n\26\36 ,\60CJM";
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);
}
}
}
