nl.uu.cs.ape.parserSLTLx.sltlx2cnf.SLTLxParser Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of APE Show documentation
Show all versions of APE Show documentation
APE is a command line tool and an API for the automated exploration of possible computational pipelines (workflows) from large collections of computational tools.
The newest version!
// Generated from SLTLx.g4 by ANTLR 4.10.1
package nl.uu.cs.ape.parserSLTLx.sltlx2cnf;
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 SLTLxParser extends Parser {
static {
RuntimeMetaData.checkVersion("4.10.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, BIN_CONNECTIVE = 5, UN_MODAL = 6, BIN_MODAL = 7,
TRUE = 8, LPAREN = 9, RPAREN = 10, VARIABLE = 11, CONSTANT = 12, R_REL = 13, SLTL_UNTIL = 14,
SLTL_GLOBALLY = 15, SLTL_FINALLY = 16, SLTL_NEXT = 17, OR = 18, AND = 19, IMPL = 20,
EQUIVALENT = 21, EQUAL = 22, NOT = 23, EXISTS = 24, FORALL = 25, ENDLINE = 26, WHITESPACE = 27;
public static final int RULE_condition = 0, RULE_formula = 1, RULE_module = 2, RULE_vars = 3;
private static String[] makeRuleNames() {
return new String[] {
"condition", "formula", "module", "vars"
};
}
public static final String[] ruleNames = makeRuleNames();
private static String[] makeLiteralNames() {
return new String[] {
null, "'<'", "'>'", "','", "';'", null, null, null, "'true'", "'('",
"')'", null, null, "'R'", "'U'", "'G'", "'F'", "'X'", "'|'", "'&'", "'->'",
"'<->'", "'='", "'!'", "'Exists'", "'Forall'"
};
}
private static final String[] _LITERAL_NAMES = makeLiteralNames();
private static String[] makeSymbolicNames() {
return new String[] {
null, null, null, null, null, "BIN_CONNECTIVE", "UN_MODAL", "BIN_MODAL",
"TRUE", "LPAREN", "RPAREN", "VARIABLE", "CONSTANT", "R_REL", "SLTL_UNTIL",
"SLTL_GLOBALLY", "SLTL_FINALLY", "SLTL_NEXT", "OR", "AND", "IMPL", "EQUIVALENT",
"EQUAL", "NOT", "EXISTS", "FORALL", "ENDLINE", "WHITESPACE"
};
}
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 "SLTLx.g4";
}
@Override
public String[] getRuleNames() {
return ruleNames;
}
@Override
public String getSerializedATN() {
return _serializedATN;
}
@Override
public ATN getATN() {
return _ATN;
}
public SLTLxParser(TokenStream input) {
super(input);
_interp = new ParserATNSimulator(this, _ATN, _decisionToDFA, _sharedContextCache);
}
public static class ConditionContext extends ParserRuleContext {
public List formula() {
return getRuleContexts(FormulaContext.class);
}
public FormulaContext formula(int i) {
return getRuleContext(FormulaContext.class, i);
}
public TerminalNode EOF() {
return getToken(SLTLxParser.EOF, 0);
}
public List ENDLINE() {
return getTokens(SLTLxParser.ENDLINE);
}
public TerminalNode ENDLINE(int i) {
return getToken(SLTLxParser.ENDLINE, i);
}
public ConditionContext(ParserRuleContext parent, int invokingState) {
super(parent, invokingState);
}
@Override
public int getRuleIndex() {
return RULE_condition;
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterCondition(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitCondition(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitCondition(this);
else
return visitor.visitChildren(this);
}
}
public final ConditionContext condition() throws RecognitionException {
ConditionContext _localctx = new ConditionContext(_ctx, getState());
enterRule(_localctx, 0, RULE_condition);
int _la;
try {
int _alt;
enterOuterAlt(_localctx, 1);
{
setState(8);
formula(0);
setState(13);
_errHandler.sync(this);
_alt = getInterpreter().adaptivePredict(_input, 0, _ctx);
while (_alt != 2 && _alt != org.antlr.v4.runtime.atn.ATN.INVALID_ALT_NUMBER) {
if (_alt == 1) {
{
{
setState(9);
match(ENDLINE);
setState(10);
formula(0);
}
}
}
setState(15);
_errHandler.sync(this);
_alt = getInterpreter().adaptivePredict(_input, 0, _ctx);
}
setState(19);
_errHandler.sync(this);
_la = _input.LA(1);
while (_la == ENDLINE) {
{
{
setState(16);
match(ENDLINE);
}
}
setState(21);
_errHandler.sync(this);
_la = _input.LA(1);
}
setState(22);
match(EOF);
}
} catch (RecognitionException re) {
_localctx.exception = re;
_errHandler.reportError(this, re);
_errHandler.recover(this, re);
} finally {
exitRule();
}
return _localctx;
}
public static class FormulaContext extends ParserRuleContext {
public FormulaContext(ParserRuleContext parent, int invokingState) {
super(parent, invokingState);
}
@Override
public int getRuleIndex() {
return RULE_formula;
}
public FormulaContext() {
}
public void copyFrom(FormulaContext ctx) {
super.copyFrom(ctx);
}
}
public static class ToolRefContext extends FormulaContext {
public ModuleContext module() {
return getRuleContext(ModuleContext.class, 0);
}
public FormulaContext formula() {
return getRuleContext(FormulaContext.class, 0);
}
public ToolRefContext(FormulaContext ctx) {
copyFrom(ctx);
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterToolRef(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitToolRef(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitToolRef(this);
else
return visitor.visitChildren(this);
}
}
public static class UnaryModalContext extends FormulaContext {
public TerminalNode UN_MODAL() {
return getToken(SLTLxParser.UN_MODAL, 0);
}
public FormulaContext formula() {
return getRuleContext(FormulaContext.class, 0);
}
public UnaryModalContext(FormulaContext ctx) {
copyFrom(ctx);
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterUnaryModal(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitUnaryModal(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitUnaryModal(this);
else
return visitor.visitChildren(this);
}
}
public static class NegUnaryContext extends FormulaContext {
public TerminalNode NOT() {
return getToken(SLTLxParser.NOT, 0);
}
public FormulaContext formula() {
return getRuleContext(FormulaContext.class, 0);
}
public NegUnaryContext(FormulaContext ctx) {
copyFrom(ctx);
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterNegUnary(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitNegUnary(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitNegUnary(this);
else
return visitor.visitChildren(this);
}
}
public static class R_relationContext extends FormulaContext {
public TerminalNode R_REL() {
return getToken(SLTLxParser.R_REL, 0);
}
public TerminalNode LPAREN() {
return getToken(SLTLxParser.LPAREN, 0);
}
public List VARIABLE() {
return getTokens(SLTLxParser.VARIABLE);
}
public TerminalNode VARIABLE(int i) {
return getToken(SLTLxParser.VARIABLE, i);
}
public TerminalNode RPAREN() {
return getToken(SLTLxParser.RPAREN, 0);
}
public R_relationContext(FormulaContext ctx) {
copyFrom(ctx);
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterR_relation(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitR_relation(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitR_relation(this);
else
return visitor.visitChildren(this);
}
}
public static class BinaryBoolContext extends FormulaContext {
public List formula() {
return getRuleContexts(FormulaContext.class);
}
public FormulaContext formula(int i) {
return getRuleContext(FormulaContext.class, i);
}
public TerminalNode BIN_CONNECTIVE() {
return getToken(SLTLxParser.BIN_CONNECTIVE, 0);
}
public BinaryBoolContext(FormulaContext ctx) {
copyFrom(ctx);
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterBinaryBool(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitBinaryBool(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitBinaryBool(this);
else
return visitor.visitChildren(this);
}
}
public static class FunctionContext extends FormulaContext {
public TerminalNode CONSTANT() {
return getToken(SLTLxParser.CONSTANT, 0);
}
public TerminalNode LPAREN() {
return getToken(SLTLxParser.LPAREN, 0);
}
public TerminalNode VARIABLE() {
return getToken(SLTLxParser.VARIABLE, 0);
}
public TerminalNode RPAREN() {
return getToken(SLTLxParser.RPAREN, 0);
}
public FunctionContext(FormulaContext ctx) {
copyFrom(ctx);
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterFunction(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitFunction(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitFunction(this);
else
return visitor.visitChildren(this);
}
}
public static class ForallContext extends FormulaContext {
public TerminalNode FORALL() {
return getToken(SLTLxParser.FORALL, 0);
}
public TerminalNode LPAREN() {
return getToken(SLTLxParser.LPAREN, 0);
}
public TerminalNode VARIABLE() {
return getToken(SLTLxParser.VARIABLE, 0);
}
public TerminalNode RPAREN() {
return getToken(SLTLxParser.RPAREN, 0);
}
public FormulaContext formula() {
return getRuleContext(FormulaContext.class, 0);
}
public ForallContext(FormulaContext ctx) {
copyFrom(ctx);
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterForall(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitForall(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitForall(this);
else
return visitor.visitChildren(this);
}
}
public static class TrueContext extends FormulaContext {
public TerminalNode TRUE() {
return getToken(SLTLxParser.TRUE, 0);
}
public TrueContext(FormulaContext ctx) {
copyFrom(ctx);
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterTrue(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitTrue(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitTrue(this);
else
return visitor.visitChildren(this);
}
}
public static class ExistsContext extends FormulaContext {
public TerminalNode EXISTS() {
return getToken(SLTLxParser.EXISTS, 0);
}
public TerminalNode LPAREN() {
return getToken(SLTLxParser.LPAREN, 0);
}
public TerminalNode VARIABLE() {
return getToken(SLTLxParser.VARIABLE, 0);
}
public TerminalNode RPAREN() {
return getToken(SLTLxParser.RPAREN, 0);
}
public FormulaContext formula() {
return getRuleContext(FormulaContext.class, 0);
}
public ExistsContext(FormulaContext ctx) {
copyFrom(ctx);
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterExists(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitExists(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitExists(this);
else
return visitor.visitChildren(this);
}
}
public static class BinaryModalContext extends FormulaContext {
public List formula() {
return getRuleContexts(FormulaContext.class);
}
public FormulaContext formula(int i) {
return getRuleContext(FormulaContext.class, i);
}
public TerminalNode BIN_MODAL() {
return getToken(SLTLxParser.BIN_MODAL, 0);
}
public BinaryModalContext(FormulaContext ctx) {
copyFrom(ctx);
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterBinaryModal(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitBinaryModal(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitBinaryModal(this);
else
return visitor.visitChildren(this);
}
}
public static class BracketsContext extends FormulaContext {
public TerminalNode LPAREN() {
return getToken(SLTLxParser.LPAREN, 0);
}
public FormulaContext formula() {
return getRuleContext(FormulaContext.class, 0);
}
public TerminalNode RPAREN() {
return getToken(SLTLxParser.RPAREN, 0);
}
public BracketsContext(FormulaContext ctx) {
copyFrom(ctx);
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterBrackets(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitBrackets(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitBrackets(this);
else
return visitor.visitChildren(this);
}
}
public static class VarEqContext extends FormulaContext {
public List VARIABLE() {
return getTokens(SLTLxParser.VARIABLE);
}
public TerminalNode VARIABLE(int i) {
return getToken(SLTLxParser.VARIABLE, i);
}
public TerminalNode EQUAL() {
return getToken(SLTLxParser.EQUAL, 0);
}
public VarEqContext(FormulaContext ctx) {
copyFrom(ctx);
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterVarEq(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitVarEq(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitVarEq(this);
else
return visitor.visitChildren(this);
}
}
public final FormulaContext formula() throws RecognitionException {
return formula(0);
}
private FormulaContext formula(int _p) throws RecognitionException {
ParserRuleContext _parentctx = _ctx;
int _parentState = getState();
FormulaContext _localctx = new FormulaContext(_ctx, _parentState);
FormulaContext _prevctx = _localctx;
int _startState = 2;
enterRecursionRule(_localctx, 2, RULE_formula, _p);
try {
int _alt;
enterOuterAlt(_localctx, 1);
{
setState(62);
_errHandler.sync(this);
switch (_input.LA(1)) {
case TRUE: {
_localctx = new TrueContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(25);
match(TRUE);
}
break;
case LPAREN: {
_localctx = new BracketsContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(26);
match(LPAREN);
setState(27);
formula(0);
setState(28);
match(RPAREN);
}
break;
case T__0: {
_localctx = new ToolRefContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(30);
match(T__0);
setState(31);
module();
setState(32);
match(T__1);
setState(33);
formula(10);
}
break;
case CONSTANT: {
_localctx = new FunctionContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(35);
match(CONSTANT);
setState(36);
match(LPAREN);
setState(37);
match(VARIABLE);
setState(38);
match(RPAREN);
}
break;
case VARIABLE: {
_localctx = new VarEqContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(39);
match(VARIABLE);
setState(40);
match(EQUAL);
setState(41);
match(VARIABLE);
}
break;
case NOT: {
_localctx = new NegUnaryContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(42);
match(NOT);
setState(43);
formula(7);
}
break;
case FORALL: {
_localctx = new ForallContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(44);
match(FORALL);
setState(45);
match(LPAREN);
setState(46);
match(VARIABLE);
setState(47);
match(RPAREN);
setState(48);
formula(6);
}
break;
case EXISTS: {
_localctx = new ExistsContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(49);
match(EXISTS);
setState(50);
match(LPAREN);
setState(51);
match(VARIABLE);
setState(52);
match(RPAREN);
setState(53);
formula(5);
}
break;
case UN_MODAL: {
_localctx = new UnaryModalContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(54);
match(UN_MODAL);
setState(55);
formula(4);
}
break;
case R_REL: {
_localctx = new R_relationContext(_localctx);
_ctx = _localctx;
_prevctx = _localctx;
setState(56);
match(R_REL);
setState(57);
match(LPAREN);
setState(58);
match(VARIABLE);
setState(59);
match(T__2);
setState(60);
match(VARIABLE);
setState(61);
match(RPAREN);
}
break;
default:
throw new NoViableAltException(this);
}
_ctx.stop = _input.LT(-1);
setState(72);
_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(70);
_errHandler.sync(this);
switch (getInterpreter().adaptivePredict(_input, 3, _ctx)) {
case 1: {
_localctx = new BinaryBoolContext(new FormulaContext(_parentctx, _parentState));
pushNewRecursionContext(_localctx, _startState, RULE_formula);
setState(64);
if (!(precpred(_ctx, 3)))
throw new FailedPredicateException(this, "precpred(_ctx, 3)");
setState(65);
match(BIN_CONNECTIVE);
setState(66);
formula(4);
}
break;
case 2: {
_localctx = new BinaryModalContext(new FormulaContext(_parentctx, _parentState));
pushNewRecursionContext(_localctx, _startState, RULE_formula);
setState(67);
if (!(precpred(_ctx, 2)))
throw new FailedPredicateException(this, "precpred(_ctx, 2)");
setState(68);
match(BIN_MODAL);
setState(69);
formula(3);
}
break;
}
}
}
setState(74);
_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 static class ModuleContext extends ParserRuleContext {
public TerminalNode CONSTANT() {
return getToken(SLTLxParser.CONSTANT, 0);
}
public TerminalNode LPAREN() {
return getToken(SLTLxParser.LPAREN, 0);
}
public List vars() {
return getRuleContexts(VarsContext.class);
}
public VarsContext vars(int i) {
return getRuleContext(VarsContext.class, i);
}
public TerminalNode RPAREN() {
return getToken(SLTLxParser.RPAREN, 0);
}
public ModuleContext(ParserRuleContext parent, int invokingState) {
super(parent, invokingState);
}
@Override
public int getRuleIndex() {
return RULE_module;
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterModule(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitModule(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitModule(this);
else
return visitor.visitChildren(this);
}
}
public final ModuleContext module() throws RecognitionException {
ModuleContext _localctx = new ModuleContext(_ctx, getState());
enterRule(_localctx, 4, RULE_module);
try {
enterOuterAlt(_localctx, 1);
{
setState(75);
match(CONSTANT);
setState(76);
match(LPAREN);
setState(77);
vars();
setState(78);
match(T__3);
setState(79);
vars();
setState(80);
match(RPAREN);
}
} catch (RecognitionException re) {
_localctx.exception = re;
_errHandler.reportError(this, re);
_errHandler.recover(this, re);
} finally {
exitRule();
}
return _localctx;
}
public static class VarsContext extends ParserRuleContext {
public List VARIABLE() {
return getTokens(SLTLxParser.VARIABLE);
}
public TerminalNode VARIABLE(int i) {
return getToken(SLTLxParser.VARIABLE, i);
}
public VarsContext(ParserRuleContext parent, int invokingState) {
super(parent, invokingState);
}
@Override
public int getRuleIndex() {
return RULE_vars;
}
@Override
public void enterRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).enterVars(this);
}
@Override
public void exitRule(ParseTreeListener listener) {
if (listener instanceof SLTLxListener)
((SLTLxListener) listener).exitVars(this);
}
@Override
public T accept(ParseTreeVisitor visitor) {
if (visitor instanceof SLTLxVisitor)
return ((SLTLxVisitor) visitor).visitVars(this);
else
return visitor.visitChildren(this);
}
}
public final VarsContext vars() throws RecognitionException {
VarsContext _localctx = new VarsContext(_ctx, getState());
enterRule(_localctx, 6, RULE_vars);
int _la;
try {
enterOuterAlt(_localctx, 1);
{
setState(90);
_errHandler.sync(this);
_la = _input.LA(1);
if (_la == VARIABLE) {
{
setState(82);
match(VARIABLE);
setState(87);
_errHandler.sync(this);
_la = _input.LA(1);
while (_la == T__2) {
{
{
setState(83);
match(T__2);
setState(84);
match(VARIABLE);
}
}
setState(89);
_errHandler.sync(this);
_la = _input.LA(1);
}
}
}
}
} 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 1:
return formula_sempred((FormulaContext) _localctx, predIndex);
}
return true;
}
private boolean formula_sempred(FormulaContext _localctx, int predIndex) {
switch (predIndex) {
case 0:
return precpred(_ctx, 3);
case 1:
return precpred(_ctx, 2);
}
return true;
}
public static final String _serializedATN = "\u0004\u0001\u001b]\u0002\u0000\u0007\u0000\u0002\u0001\u0007\u0001\u0002"
+
"\u0002\u0007\u0002\u0002\u0003\u0007\u0003\u0001\u0000\u0001\u0000\u0001" +
"\u0000\u0005\u0000\f\b\u0000\n\u0000\f\u0000\u000f\t\u0000\u0001\u0000" +
"\u0005\u0000\u0012\b\u0000\n\u0000\f\u0000\u0015\t\u0000\u0001\u0000\u0001" +
"\u0000\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001" +
"\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001" +
"\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001" +
"\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001" +
"\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001" +
"\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001" +
"\u0001\u0001\u0001\u0001\u0001\u0003\u0001?\b\u0001\u0001\u0001\u0001" +
"\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0001\u0005\u0001G\b" +
"\u0001\n\u0001\f\u0001J\t\u0001\u0001\u0002\u0001\u0002\u0001\u0002\u0001" +
"\u0002\u0001\u0002\u0001\u0002\u0001\u0002\u0001\u0003\u0001\u0003\u0001" +
"\u0003\u0005\u0003V\b\u0003\n\u0003\f\u0003Y\t\u0003\u0003\u0003[\b\u0003" +
"\u0001\u0003\u0000\u0001\u0002\u0004\u0000\u0002\u0004\u0006\u0000\u0000" +
"g\u0000\b\u0001\u0000\u0000\u0000\u0002>\u0001\u0000\u0000\u0000\u0004" +
"K\u0001\u0000\u0000\u0000\u0006Z\u0001\u0000\u0000\u0000\b\r\u0003\u0002" +
"\u0001\u0000\t\n\u0005\u001a\u0000\u0000\n\f\u0003\u0002\u0001\u0000\u000b" +
"\t\u0001\u0000\u0000\u0000\f\u000f\u0001\u0000\u0000\u0000\r\u000b\u0001" +
"\u0000\u0000\u0000\r\u000e\u0001\u0000\u0000\u0000\u000e\u0013\u0001\u0000" +
"\u0000\u0000\u000f\r\u0001\u0000\u0000\u0000\u0010\u0012\u0005\u001a\u0000" +
"\u0000\u0011\u0010\u0001\u0000\u0000\u0000\u0012\u0015\u0001\u0000\u0000" +
"\u0000\u0013\u0011\u0001\u0000\u0000\u0000\u0013\u0014\u0001\u0000\u0000" +
"\u0000\u0014\u0016\u0001\u0000\u0000\u0000\u0015\u0013\u0001\u0000\u0000" +
"\u0000\u0016\u0017\u0005\u0000\u0000\u0001\u0017\u0001\u0001\u0000\u0000" +
"\u0000\u0018\u0019\u0006\u0001\uffff\uffff\u0000\u0019?\u0005\b\u0000" +
"\u0000\u001a\u001b\u0005\t\u0000\u0000\u001b\u001c\u0003\u0002\u0001\u0000" +
"\u001c\u001d\u0005\n\u0000\u0000\u001d?\u0001\u0000\u0000\u0000\u001e" +
"\u001f\u0005\u0001\u0000\u0000\u001f \u0003\u0004\u0002\u0000 !\u0005" +
"\u0002\u0000\u0000!\"\u0003\u0002\u0001\n\"?\u0001\u0000\u0000\u0000#" +
"$\u0005\f\u0000\u0000$%\u0005\t\u0000\u0000%&\u0005\u000b\u0000\u0000" +
"&?\u0005\n\u0000\u0000\'(\u0005\u000b\u0000\u0000()\u0005\u0016\u0000" +
"\u0000)?\u0005\u000b\u0000\u0000*+\u0005\u0017\u0000\u0000+?\u0003\u0002" +
"\u0001\u0007,-\u0005\u0019\u0000\u0000-.\u0005\t\u0000\u0000./\u0005\u000b" +
"\u0000\u0000/0\u0005\n\u0000\u00000?\u0003\u0002\u0001\u000612\u0005\u0018" +
"\u0000\u000023\u0005\t\u0000\u000034\u0005\u000b\u0000\u000045\u0005\n" +
"\u0000\u00005?\u0003\u0002\u0001\u000567\u0005\u0006\u0000\u00007?\u0003" +
"\u0002\u0001\u000489\u0005\r\u0000\u00009:\u0005\t\u0000\u0000:;\u0005" +
"\u000b\u0000\u0000;<\u0005\u0003\u0000\u0000<=\u0005\u000b\u0000\u0000" +
"=?\u0005\n\u0000\u0000>\u0018\u0001\u0000\u0000\u0000>\u001a\u0001\u0000" +
"\u0000\u0000>\u001e\u0001\u0000\u0000\u0000>#\u0001\u0000\u0000\u0000" +
">\'\u0001\u0000\u0000\u0000>*\u0001\u0000\u0000\u0000>,\u0001\u0000\u0000" +
"\u0000>1\u0001\u0000\u0000\u0000>6\u0001\u0000\u0000\u0000>8\u0001\u0000" +
"\u0000\u0000?H\u0001\u0000\u0000\u0000@A\n\u0003\u0000\u0000AB\u0005\u0005" +
"\u0000\u0000BG\u0003\u0002\u0001\u0004CD\n\u0002\u0000\u0000DE\u0005\u0007" +
"\u0000\u0000EG\u0003\u0002\u0001\u0003F@\u0001\u0000\u0000\u0000FC\u0001" +
"\u0000\u0000\u0000GJ\u0001\u0000\u0000\u0000HF\u0001\u0000\u0000\u0000" +
"HI\u0001\u0000\u0000\u0000I\u0003\u0001\u0000\u0000\u0000JH\u0001\u0000" +
"\u0000\u0000KL\u0005\f\u0000\u0000LM\u0005\t\u0000\u0000MN\u0003\u0006" +
"\u0003\u0000NO\u0005\u0004\u0000\u0000OP\u0003\u0006\u0003\u0000PQ\u0005" +
"\n\u0000\u0000Q\u0005\u0001\u0000\u0000\u0000RW\u0005\u000b\u0000\u0000" +
"ST\u0005\u0003\u0000\u0000TV\u0005\u000b\u0000\u0000US\u0001\u0000\u0000" +
"\u0000VY\u0001\u0000\u0000\u0000WU\u0001\u0000\u0000\u0000WX\u0001\u0000" +
"\u0000\u0000X[\u0001\u0000\u0000\u0000YW\u0001\u0000\u0000\u0000ZR\u0001" +
"\u0000\u0000\u0000Z[\u0001\u0000\u0000\u0000[\u0007\u0001\u0000\u0000" +
"\u0000\u0007\r\u0013>FHWZ";
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);
}
}
}