All Downloads are FREE. Search and download functionalities are using the official Maven repository.
Please wait. This can take some minutes ...
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.
persistence.antlr.ANTLRGrammarParseBehavior Maven / Gradle / Ivy
package persistence.antlr;
/* ANTLR Translator Generator
* Project led by Terence Parr at http://www.jGuru.com
* Software rights: http://www.antlr.org/license.html
*
*/
import persistence.antlr.collections.impl.BitSet;
public interface ANTLRGrammarParseBehavior {
public void abortGrammar();
public void beginAlt(boolean doAST_);
public void beginChildList();
// Exception handling
public void beginExceptionGroup();
public void beginExceptionSpec(Token label);
public void beginSubRule(Token label, Token start, boolean not);
// Trees
public void beginTree(Token tok) throws SemanticException;
public void defineRuleName(Token r, String access, boolean ruleAST, String docComment) throws SemanticException;
public void defineToken(Token tokname, Token tokliteral);
public void endAlt();
public void endChildList();
public void endExceptionGroup();
public void endExceptionSpec();
public void endGrammar();
public void endOptions();
public void endRule(String r);
public void endSubRule();
public void endTree();
public void hasError();
public void noASTSubRule();
public void oneOrMoreSubRule();
public void optionalSubRule();
public void refAction(Token action);
public void refArgAction(Token action);
public void setUserExceptions(String thr);
public void refCharLiteral(Token lit, Token label, boolean inverted, int autoGenType, boolean lastInRule);
public void refCharRange(Token t1, Token t2, Token label, int autoGenType, boolean lastInRule);
public void refElementOption(Token option, Token value);
public void refTokensSpecElementOption(Token tok, Token option, Token value);
public void refExceptionHandler(Token exTypeAndName, Token action);
public void refHeaderAction(Token name, Token act);
public void refInitAction(Token action);
public void refMemberAction(Token act);
public void refPreambleAction(Token act);
public void refReturnAction(Token returnAction);
public void refRule(Token idAssign, Token r, Token label, Token arg, int autoGenType);
public void refSemPred(Token pred);
public void refStringLiteral(Token lit, Token label, int autoGenType, boolean lastInRule);
public void refToken(Token assignId, Token t, Token label, Token args,
boolean inverted, int autoGenType, boolean lastInRule);
public void refTokenRange(Token t1, Token t2, Token label, int autoGenType, boolean lastInRule);
// Tree specifiers
public void refTreeSpecifier(Token treeSpec);
public void refWildcard(Token t, Token label, int autoGenType);
public void setArgOfRuleRef(Token argaction);
public void setCharVocabulary(BitSet b);
// Options
public void setFileOption(Token key, Token value, String filename);
public void setGrammarOption(Token key, Token value);
public void setRuleOption(Token key, Token value);
public void setSubruleOption(Token key, Token value);
public void startLexer(String file, Token name, String superClass, String doc);
// Flow control for grammars
public void startParser(String file, Token name, String superClass, String doc);
public void startTreeWalker(String file, Token name, String superClass, String doc);
public void synPred();
public void zeroOrMoreSubRule();
}