nl.uu.cs.ape.parserSLTLx.sltlx2cnf.SLTLxVisitor 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.
// Generated from SLTLx.g4 by ANTLR 4.10.1
package nl.uu.cs.ape.parserSLTLx.sltlx2cnf;
import org.antlr.v4.runtime.tree.ParseTreeVisitor;
/**
* This interface defines a complete generic visitor for a parse tree produced
* by {@link SLTLxParser}.
*
* @param The return type of the visit operation. Use {@link Void} for
* operations with no return type.
*/
public interface SLTLxVisitor extends ParseTreeVisitor {
/**
* Visit a parse tree produced by {@link SLTLxParser#condition}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitCondition(SLTLxParser.ConditionContext ctx);
/**
* Visit a parse tree produced by the {@code toolRef}
* labeled alternative in {@link SLTLxParser#formula}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitToolRef(SLTLxParser.ToolRefContext ctx);
/**
* Visit a parse tree produced by the {@code unaryModal}
* labeled alternative in {@link SLTLxParser#formula}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitUnaryModal(SLTLxParser.UnaryModalContext ctx);
/**
* Visit a parse tree produced by the {@code negUnary}
* labeled alternative in {@link SLTLxParser#formula}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitNegUnary(SLTLxParser.NegUnaryContext ctx);
/**
* Visit a parse tree produced by the {@code r_relation}
* labeled alternative in {@link SLTLxParser#formula}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitR_relation(SLTLxParser.R_relationContext ctx);
/**
* Visit a parse tree produced by the {@code binaryBool}
* labeled alternative in {@link SLTLxParser#formula}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitBinaryBool(SLTLxParser.BinaryBoolContext ctx);
/**
* Visit a parse tree produced by the {@code function}
* labeled alternative in {@link SLTLxParser#formula}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitFunction(SLTLxParser.FunctionContext ctx);
/**
* Visit a parse tree produced by the {@code forall}
* labeled alternative in {@link SLTLxParser#formula}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitForall(SLTLxParser.ForallContext ctx);
/**
* Visit a parse tree produced by the {@code true}
* labeled alternative in {@link SLTLxParser#formula}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitTrue(SLTLxParser.TrueContext ctx);
/**
* Visit a parse tree produced by the {@code exists}
* labeled alternative in {@link SLTLxParser#formula}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitExists(SLTLxParser.ExistsContext ctx);
/**
* Visit a parse tree produced by the {@code binaryModal}
* labeled alternative in {@link SLTLxParser#formula}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitBinaryModal(SLTLxParser.BinaryModalContext ctx);
/**
* Visit a parse tree produced by the {@code brackets}
* labeled alternative in {@link SLTLxParser#formula}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitBrackets(SLTLxParser.BracketsContext ctx);
/**
* Visit a parse tree produced by the {@code varEq}
* labeled alternative in {@link SLTLxParser#formula}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitVarEq(SLTLxParser.VarEqContext ctx);
/**
* Visit a parse tree produced by {@link SLTLxParser#module}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitModule(SLTLxParser.ModuleContext ctx);
/**
* Visit a parse tree produced by {@link SLTLxParser#vars}.
*
* @param ctx the parse tree
* @return the visitor result
*/
T visitVars(SLTLxParser.VarsContext ctx);
}