All Downloads are FREE. Search and download functionalities are using the official Maven repository.

acanvasio.expretau.expretau-parser.1.1.0.source-code.ExpretauParser Maven / Gradle / Ivy

// Generated from ExpretauParser.g4 by ANTLR 4.8

package io.github.datacanvasio.expretau.antlr4;

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 ExpretauParser extends Parser {
	static { RuntimeMetaData.checkVersion("4.8", RuntimeMetaData.VERSION); }

	protected static final DFA[] _decisionToDFA;
	protected static final PredictionContextCache _sharedContextCache =
		new PredictionContextCache();
	public static final int
		INT=1, REAL=2, STR=3, BOOL=4, ADD=5, SUB=6, MUL=7, DIV=8, LT=9, LE=10, 
		EQ=11, GT=12, GE=13, NE=14, AND=15, OR=16, NOT=17, STARTSWITH=18, ENDSWITH=19, 
		CONTAINS=20, MATCHES=21, ID=22, WS=23, NL=24, LPAR=25, RPAR=26, COMMA=27, 
		DOT=28, LBRCK=29, RBRCK=30;
	public static final int
		RULE_expr = 0;
	private static String[] makeRuleNames() {
		return new String[] {
			"expr"
		};
	}
	public static final String[] ruleNames = makeRuleNames();

	private static String[] makeLiteralNames() {
		return new String[] {
			null, null, null, null, null, "'+'", "'-'", "'*'", "'/'", "'<'", "'<='", 
			null, "'>'", "'>='", null, null, null, null, "'startsWith'", "'endsWith'", 
			"'contains'", "'matches'", null, null, null, "'('", "')'", "','", "'.'", 
			"'['", "']'"
		};
	}
	private static final String[] _LITERAL_NAMES = makeLiteralNames();
	private static String[] makeSymbolicNames() {
		return new String[] {
			null, "INT", "REAL", "STR", "BOOL", "ADD", "SUB", "MUL", "DIV", "LT", 
			"LE", "EQ", "GT", "GE", "NE", "AND", "OR", "NOT", "STARTSWITH", "ENDSWITH", 
			"CONTAINS", "MATCHES", "ID", "WS", "NL", "LPAR", "RPAR", "COMMA", "DOT", 
			"LBRCK", "RBRCK"
		};
	}
	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 "ExpretauParser.g4"; }

	@Override
	public String[] getRuleNames() { return ruleNames; }

	@Override
	public String getSerializedATN() { return _serializedATN; }

	@Override
	public ATN getATN() { return _ATN; }

	public ExpretauParser(TokenStream input) {
		super(input);
		_interp = new ParserATNSimulator(this,_ATN,_decisionToDFA,_sharedContextCache);
	}

	public static class ExprContext extends ParserRuleContext {
		public ExprContext(ParserRuleContext parent, int invokingState) {
			super(parent, invokingState);
		}
		@Override public int getRuleIndex() { return RULE_expr; }
	 
		public ExprContext() { }
		public void copyFrom(ExprContext ctx) {
			super.copyFrom(ctx);
		}
	}
	public static class OrContext extends ExprContext {
		public Token op;
		public List expr() {
			return getRuleContexts(ExprContext.class);
		}
		public ExprContext expr(int i) {
			return getRuleContext(ExprContext.class,i);
		}
		public TerminalNode OR() { return getToken(ExpretauParser.OR, 0); }
		public OrContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitOr(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class MulDivContext extends ExprContext {
		public Token op;
		public List expr() {
			return getRuleContexts(ExprContext.class);
		}
		public ExprContext expr(int i) {
			return getRuleContext(ExprContext.class,i);
		}
		public TerminalNode MUL() { return getToken(ExpretauParser.MUL, 0); }
		public TerminalNode DIV() { return getToken(ExpretauParser.DIV, 0); }
		public MulDivContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitMulDiv(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class AddSubContext extends ExprContext {
		public Token op;
		public List expr() {
			return getRuleContexts(ExprContext.class);
		}
		public ExprContext expr(int i) {
			return getRuleContext(ExprContext.class,i);
		}
		public TerminalNode ADD() { return getToken(ExpretauParser.ADD, 0); }
		public TerminalNode SUB() { return getToken(ExpretauParser.SUB, 0); }
		public AddSubContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitAddSub(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class VarContext extends ExprContext {
		public TerminalNode ID() { return getToken(ExpretauParser.ID, 0); }
		public VarContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitVar(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class PosNegContext extends ExprContext {
		public Token op;
		public ExprContext expr() {
			return getRuleContext(ExprContext.class,0);
		}
		public TerminalNode ADD() { return getToken(ExpretauParser.ADD, 0); }
		public TerminalNode SUB() { return getToken(ExpretauParser.SUB, 0); }
		public PosNegContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitPosNeg(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class StringOpContext extends ExprContext {
		public Token op;
		public List expr() {
			return getRuleContexts(ExprContext.class);
		}
		public ExprContext expr(int i) {
			return getRuleContext(ExprContext.class,i);
		}
		public TerminalNode STARTSWITH() { return getToken(ExpretauParser.STARTSWITH, 0); }
		public TerminalNode ENDSWITH() { return getToken(ExpretauParser.ENDSWITH, 0); }
		public TerminalNode CONTAINS() { return getToken(ExpretauParser.CONTAINS, 0); }
		public TerminalNode MATCHES() { return getToken(ExpretauParser.MATCHES, 0); }
		public StringOpContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitStringOp(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class IndexContext extends ExprContext {
		public List expr() {
			return getRuleContexts(ExprContext.class);
		}
		public ExprContext expr(int i) {
			return getRuleContext(ExprContext.class,i);
		}
		public TerminalNode LBRCK() { return getToken(ExpretauParser.LBRCK, 0); }
		public TerminalNode RBRCK() { return getToken(ExpretauParser.RBRCK, 0); }
		public IndexContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitIndex(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class IntContext extends ExprContext {
		public TerminalNode INT() { return getToken(ExpretauParser.INT, 0); }
		public IntContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitInt(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class StrContext extends ExprContext {
		public TerminalNode STR() { return getToken(ExpretauParser.STR, 0); }
		public StrContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitStr(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class NotContext extends ExprContext {
		public Token op;
		public ExprContext expr() {
			return getRuleContext(ExprContext.class,0);
		}
		public TerminalNode NOT() { return getToken(ExpretauParser.NOT, 0); }
		public NotContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitNot(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class RelationContext extends ExprContext {
		public Token op;
		public List expr() {
			return getRuleContexts(ExprContext.class);
		}
		public ExprContext expr(int i) {
			return getRuleContext(ExprContext.class,i);
		}
		public TerminalNode LT() { return getToken(ExpretauParser.LT, 0); }
		public TerminalNode LE() { return getToken(ExpretauParser.LE, 0); }
		public TerminalNode EQ() { return getToken(ExpretauParser.EQ, 0); }
		public TerminalNode GT() { return getToken(ExpretauParser.GT, 0); }
		public TerminalNode GE() { return getToken(ExpretauParser.GE, 0); }
		public TerminalNode NE() { return getToken(ExpretauParser.NE, 0); }
		public RelationContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitRelation(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class StrIndexContext extends ExprContext {
		public ExprContext expr() {
			return getRuleContext(ExprContext.class,0);
		}
		public TerminalNode DOT() { return getToken(ExpretauParser.DOT, 0); }
		public TerminalNode ID() { return getToken(ExpretauParser.ID, 0); }
		public StrIndexContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitStrIndex(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class BoolContext extends ExprContext {
		public TerminalNode BOOL() { return getToken(ExpretauParser.BOOL, 0); }
		public BoolContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitBool(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class AndContext extends ExprContext {
		public Token op;
		public List expr() {
			return getRuleContexts(ExprContext.class);
		}
		public ExprContext expr(int i) {
			return getRuleContext(ExprContext.class,i);
		}
		public TerminalNode AND() { return getToken(ExpretauParser.AND, 0); }
		public AndContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitAnd(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class ParsContext extends ExprContext {
		public TerminalNode LPAR() { return getToken(ExpretauParser.LPAR, 0); }
		public ExprContext expr() {
			return getRuleContext(ExprContext.class,0);
		}
		public TerminalNode RPAR() { return getToken(ExpretauParser.RPAR, 0); }
		public ParsContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitPars(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class RealContext extends ExprContext {
		public TerminalNode REAL() { return getToken(ExpretauParser.REAL, 0); }
		public RealContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitReal(this);
			else return visitor.visitChildren(this);
		}
	}
	public static class FunContext extends ExprContext {
		public Token fun;
		public TerminalNode LPAR() { return getToken(ExpretauParser.LPAR, 0); }
		public TerminalNode RPAR() { return getToken(ExpretauParser.RPAR, 0); }
		public TerminalNode ID() { return getToken(ExpretauParser.ID, 0); }
		public List expr() {
			return getRuleContexts(ExprContext.class);
		}
		public ExprContext expr(int i) {
			return getRuleContext(ExprContext.class,i);
		}
		public List COMMA() { return getTokens(ExpretauParser.COMMA); }
		public TerminalNode COMMA(int i) {
			return getToken(ExpretauParser.COMMA, i);
		}
		public FunContext(ExprContext ctx) { copyFrom(ctx); }
		@Override
		public  T accept(ParseTreeVisitor visitor) {
			if ( visitor instanceof ExpretauParserVisitor ) return ((ExpretauParserVisitor)visitor).visitFun(this);
			else return visitor.visitChildren(this);
		}
	}

	public final ExprContext expr() throws RecognitionException {
		return expr(0);
	}

	private ExprContext expr(int _p) throws RecognitionException {
		ParserRuleContext _parentctx = _ctx;
		int _parentState = getState();
		ExprContext _localctx = new ExprContext(_ctx, _parentState);
		ExprContext _prevctx = _localctx;
		int _startState = 0;
		enterRecursionRule(_localctx, 0, RULE_expr, _p);
		int _la;
		try {
			int _alt;
			enterOuterAlt(_localctx, 1);
			{
			setState(29);
			_errHandler.sync(this);
			switch ( getInterpreter().adaptivePredict(_input,2,_ctx) ) {
			case 1:
				{
				_localctx = new IntContext(_localctx);
				_ctx = _localctx;
				_prevctx = _localctx;

				setState(3);
				match(INT);
				}
				break;
			case 2:
				{
				_localctx = new RealContext(_localctx);
				_ctx = _localctx;
				_prevctx = _localctx;
				setState(4);
				match(REAL);
				}
				break;
			case 3:
				{
				_localctx = new StrContext(_localctx);
				_ctx = _localctx;
				_prevctx = _localctx;
				setState(5);
				match(STR);
				}
				break;
			case 4:
				{
				_localctx = new BoolContext(_localctx);
				_ctx = _localctx;
				_prevctx = _localctx;
				setState(6);
				match(BOOL);
				}
				break;
			case 5:
				{
				_localctx = new VarContext(_localctx);
				_ctx = _localctx;
				_prevctx = _localctx;
				setState(7);
				match(ID);
				}
				break;
			case 6:
				{
				_localctx = new ParsContext(_localctx);
				_ctx = _localctx;
				_prevctx = _localctx;
				setState(8);
				match(LPAR);
				setState(9);
				expr(0);
				setState(10);
				match(RPAR);
				}
				break;
			case 7:
				{
				_localctx = new FunContext(_localctx);
				_ctx = _localctx;
				_prevctx = _localctx;
				setState(12);
				((FunContext)_localctx).fun = match(ID);
				setState(13);
				match(LPAR);
				setState(22);
				_errHandler.sync(this);
				_la = _input.LA(1);
				if ((((_la) & ~0x3f) == 0 && ((1L << _la) & ((1L << INT) | (1L << REAL) | (1L << STR) | (1L << BOOL) | (1L << ADD) | (1L << SUB) | (1L << NOT) | (1L << ID) | (1L << LPAR))) != 0)) {
					{
					setState(14);
					expr(0);
					setState(19);
					_errHandler.sync(this);
					_la = _input.LA(1);
					while (_la==COMMA) {
						{
						{
						setState(15);
						match(COMMA);
						setState(16);
						expr(0);
						}
						}
						setState(21);
						_errHandler.sync(this);
						_la = _input.LA(1);
					}
					}
				}

				setState(24);
				match(RPAR);
				}
				break;
			case 8:
				{
				_localctx = new PosNegContext(_localctx);
				_ctx = _localctx;
				_prevctx = _localctx;
				setState(25);
				((PosNegContext)_localctx).op = _input.LT(1);
				_la = _input.LA(1);
				if ( !(_la==ADD || _la==SUB) ) {
					((PosNegContext)_localctx).op = (Token)_errHandler.recoverInline(this);
				}
				else {
					if ( _input.LA(1)==Token.EOF ) matchedEOF = true;
					_errHandler.reportMatch(this);
					consume();
				}
				setState(26);
				expr(8);
				}
				break;
			case 9:
				{
				_localctx = new NotContext(_localctx);
				_ctx = _localctx;
				_prevctx = _localctx;
				setState(27);
				((NotContext)_localctx).op = match(NOT);
				setState(28);
				expr(3);
				}
				break;
			}
			_ctx.stop = _input.LT(-1);
			setState(59);
			_errHandler.sync(this);
			_alt = getInterpreter().adaptivePredict(_input,4,_ctx);
			while ( _alt!=2 && _alt!=org.antlr.v4.runtime.atn.ATN.INVALID_ALT_NUMBER ) {
				if ( _alt==1 ) {
					if ( _parseListeners!=null ) triggerExitRuleEvent();
					_prevctx = _localctx;
					{
					setState(57);
					_errHandler.sync(this);
					switch ( getInterpreter().adaptivePredict(_input,3,_ctx) ) {
					case 1:
						{
						_localctx = new MulDivContext(new ExprContext(_parentctx, _parentState));
						pushNewRecursionContext(_localctx, _startState, RULE_expr);
						setState(31);
						if (!(precpred(_ctx, 7))) throw new FailedPredicateException(this, "precpred(_ctx, 7)");
						setState(32);
						((MulDivContext)_localctx).op = _input.LT(1);
						_la = _input.LA(1);
						if ( !(_la==MUL || _la==DIV) ) {
							((MulDivContext)_localctx).op = (Token)_errHandler.recoverInline(this);
						}
						else {
							if ( _input.LA(1)==Token.EOF ) matchedEOF = true;
							_errHandler.reportMatch(this);
							consume();
						}
						setState(33);
						expr(8);
						}
						break;
					case 2:
						{
						_localctx = new AddSubContext(new ExprContext(_parentctx, _parentState));
						pushNewRecursionContext(_localctx, _startState, RULE_expr);
						setState(34);
						if (!(precpred(_ctx, 6))) throw new FailedPredicateException(this, "precpred(_ctx, 6)");
						setState(35);
						((AddSubContext)_localctx).op = _input.LT(1);
						_la = _input.LA(1);
						if ( !(_la==ADD || _la==SUB) ) {
							((AddSubContext)_localctx).op = (Token)_errHandler.recoverInline(this);
						}
						else {
							if ( _input.LA(1)==Token.EOF ) matchedEOF = true;
							_errHandler.reportMatch(this);
							consume();
						}
						setState(36);
						expr(7);
						}
						break;
					case 3:
						{
						_localctx = new RelationContext(new ExprContext(_parentctx, _parentState));
						pushNewRecursionContext(_localctx, _startState, RULE_expr);
						setState(37);
						if (!(precpred(_ctx, 5))) throw new FailedPredicateException(this, "precpred(_ctx, 5)");
						setState(38);
						((RelationContext)_localctx).op = _input.LT(1);
						_la = _input.LA(1);
						if ( !((((_la) & ~0x3f) == 0 && ((1L << _la) & ((1L << LT) | (1L << LE) | (1L << EQ) | (1L << GT) | (1L << GE) | (1L << NE))) != 0)) ) {
							((RelationContext)_localctx).op = (Token)_errHandler.recoverInline(this);
						}
						else {
							if ( _input.LA(1)==Token.EOF ) matchedEOF = true;
							_errHandler.reportMatch(this);
							consume();
						}
						setState(39);
						expr(6);
						}
						break;
					case 4:
						{
						_localctx = new StringOpContext(new ExprContext(_parentctx, _parentState));
						pushNewRecursionContext(_localctx, _startState, RULE_expr);
						setState(40);
						if (!(precpred(_ctx, 4))) throw new FailedPredicateException(this, "precpred(_ctx, 4)");
						setState(41);
						((StringOpContext)_localctx).op = _input.LT(1);
						_la = _input.LA(1);
						if ( !((((_la) & ~0x3f) == 0 && ((1L << _la) & ((1L << STARTSWITH) | (1L << ENDSWITH) | (1L << CONTAINS) | (1L << MATCHES))) != 0)) ) {
							((StringOpContext)_localctx).op = (Token)_errHandler.recoverInline(this);
						}
						else {
							if ( _input.LA(1)==Token.EOF ) matchedEOF = true;
							_errHandler.reportMatch(this);
							consume();
						}
						setState(42);
						expr(5);
						}
						break;
					case 5:
						{
						_localctx = new AndContext(new ExprContext(_parentctx, _parentState));
						pushNewRecursionContext(_localctx, _startState, RULE_expr);
						setState(43);
						if (!(precpred(_ctx, 2))) throw new FailedPredicateException(this, "precpred(_ctx, 2)");
						setState(44);
						((AndContext)_localctx).op = match(AND);
						setState(45);
						expr(3);
						}
						break;
					case 6:
						{
						_localctx = new OrContext(new ExprContext(_parentctx, _parentState));
						pushNewRecursionContext(_localctx, _startState, RULE_expr);
						setState(46);
						if (!(precpred(_ctx, 1))) throw new FailedPredicateException(this, "precpred(_ctx, 1)");
						setState(47);
						((OrContext)_localctx).op = match(OR);
						setState(48);
						expr(2);
						}
						break;
					case 7:
						{
						_localctx = new StrIndexContext(new ExprContext(_parentctx, _parentState));
						pushNewRecursionContext(_localctx, _startState, RULE_expr);
						setState(49);
						if (!(precpred(_ctx, 10))) throw new FailedPredicateException(this, "precpred(_ctx, 10)");
						setState(50);
						match(DOT);
						setState(51);
						match(ID);
						}
						break;
					case 8:
						{
						_localctx = new IndexContext(new ExprContext(_parentctx, _parentState));
						pushNewRecursionContext(_localctx, _startState, RULE_expr);
						setState(52);
						if (!(precpred(_ctx, 9))) throw new FailedPredicateException(this, "precpred(_ctx, 9)");
						setState(53);
						match(LBRCK);
						setState(54);
						expr(0);
						setState(55);
						match(RBRCK);
						}
						break;
					}
					} 
				}
				setState(61);
				_errHandler.sync(this);
				_alt = getInterpreter().adaptivePredict(_input,4,_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 0:
			return expr_sempred((ExprContext)_localctx, predIndex);
		}
		return true;
	}
	private boolean expr_sempred(ExprContext _localctx, int predIndex) {
		switch (predIndex) {
		case 0:
			return precpred(_ctx, 7);
		case 1:
			return precpred(_ctx, 6);
		case 2:
			return precpred(_ctx, 5);
		case 3:
			return precpred(_ctx, 4);
		case 4:
			return precpred(_ctx, 2);
		case 5:
			return precpred(_ctx, 1);
		case 6:
			return precpred(_ctx, 10);
		case 7:
			return precpred(_ctx, 9);
		}
		return true;
	}

	public static final String _serializedATN =
		"\3\u608b\ua72a\u8133\ub9ed\u417c\u3be7\u7786\u5964\3 A\4\2\t\2\3\2\3\2"+
		"\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\7\2\24\n\2\f\2\16"+
		"\2\27\13\2\5\2\31\n\2\3\2\3\2\3\2\3\2\3\2\5\2 \n\2\3\2\3\2\3\2\3\2\3\2"+
		"\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3\2\3"+
		"\2\3\2\3\2\3\2\7\2<\n\2\f\2\16\2?\13\2\3\2\2\3\2\3\2\2\6\3\2\7\b\3\2\t"+
		"\n\3\2\13\20\3\2\24\27\2Q\2\37\3\2\2\2\4\5\b\2\1\2\5 \7\3\2\2\6 \7\4\2"+
		"\2\7 \7\5\2\2\b \7\6\2\2\t \7\30\2\2\n\13\7\33\2\2\13\f\5\2\2\2\f\r\7"+
		"\34\2\2\r \3\2\2\2\16\17\7\30\2\2\17\30\7\33\2\2\20\25\5\2\2\2\21\22\7"+
		"\35\2\2\22\24\5\2\2\2\23\21\3\2\2\2\24\27\3\2\2\2\25\23\3\2\2\2\25\26"+
		"\3\2\2\2\26\31\3\2\2\2\27\25\3\2\2\2\30\20\3\2\2\2\30\31\3\2\2\2\31\32"+
		"\3\2\2\2\32 \7\34\2\2\33\34\t\2\2\2\34 \5\2\2\n\35\36\7\23\2\2\36 \5\2"+
		"\2\5\37\4\3\2\2\2\37\6\3\2\2\2\37\7\3\2\2\2\37\b\3\2\2\2\37\t\3\2\2\2"+
		"\37\n\3\2\2\2\37\16\3\2\2\2\37\33\3\2\2\2\37\35\3\2\2\2 =\3\2\2\2!\"\f"+
		"\t\2\2\"#\t\3\2\2#<\5\2\2\n$%\f\b\2\2%&\t\2\2\2&<\5\2\2\t\'(\f\7\2\2("+
		")\t\4\2\2)<\5\2\2\b*+\f\6\2\2+,\t\5\2\2,<\5\2\2\7-.\f\4\2\2./\7\21\2\2"+
		"/<\5\2\2\5\60\61\f\3\2\2\61\62\7\22\2\2\62<\5\2\2\4\63\64\f\f\2\2\64\65"+
		"\7\36\2\2\65<\7\30\2\2\66\67\f\13\2\2\678\7\37\2\289\5\2\2\29:\7 \2\2"+
		":<\3\2\2\2;!\3\2\2\2;$\3\2\2\2;\'\3\2\2\2;*\3\2\2\2;-\3\2\2\2;\60\3\2"+
		"\2\2;\63\3\2\2\2;\66\3\2\2\2\3\2\2\2>\3\3\2\2\2"+
		"?=\3\2\2\2\7\25\30\37;=";
	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