Uses of Class
org.antlr.tool.GrammarAST
Packages that use GrammarAST
-
Uses of GrammarAST in org.antlr.analysis
Fields in org.antlr.analysis declared as GrammarASTModifier and TypeFieldDescriptionActionLabel.actionASTNFAState.associatedASTNodeAssociate this NFAState with the corresponding GrammarAST node from which this node was created.SemanticContext.Predicate.predicateASTThe AST node in tree created from the grammar holding the predicateMethods in org.antlr.analysis that return GrammarASTModifier and TypeMethodDescriptionDFA.getDecisionASTNode()What GrammarAST node (derived from the grammar) is this DFA associated with? It will point to the start of a block or the loop back of a (...)+ block etc...Methods in org.antlr.analysis with parameters of type GrammarASTModifier and TypeMethodDescriptionvoidNFAState.setDecisionASTNode(GrammarAST decisionASTNode) What AST node is associated with this NFAState? When you set the AST node, I set the node to point back to this NFA state.Constructors in org.antlr.analysis with parameters of type GrammarASTModifierConstructorDescriptionActionLabel(GrammarAST actionAST) Predicate(GrammarAST predicate) PredicateLabel(GrammarAST predicateASTNode) Make a semantic predicate label -
Uses of GrammarAST in org.antlr.codegen
Methods in org.antlr.codegen with parameters of type GrammarASTModifier and TypeMethodDescriptionvoidCodeGenerator.generateLocalFOLLOW(GrammarAST referencedElementNode, String referencedElementName, String enclosingRuleName, int elementIndex) Error recovery in ANTLR recognizers.CodeGenerator.translateAction(String ruleName, GrammarAST actionTree) List<org.stringtemplate.v4.ST> CodeGenerator.translateArgAction(String ruleName, GrammarAST actionTree) Translate an action like [3,"foo",a[3]] and return a List of the translated actions. -
Uses of GrammarAST in org.antlr.grammar.v3
Subclasses of GrammarAST in org.antlr.grammar.v3Fields in org.antlr.grammar.v3 declared as GrammarASTModifier and TypeFieldDescriptionprotected static GrammarASTAssignTokenTypesWalker.charAliasprotected static GrammarASTAssignTokenTypesWalker.charAlias2protected GrammarASTANTLRParser.currentBlockASTprotected GrammarASTDefineGrammarItemsWalker.currentRewriteBlockprotected GrammarASTDefineGrammarItemsWalker.currentRewriteRuleprotected GrammarASTDefineGrammarItemsWalker.rootprotected static GrammarASTAssignTokenTypesWalker.stringAliasprotected static GrammarASTAssignTokenTypesWalker.stringAlias2(package private) GrammarASTANTLRParser.action_return.tree(package private) GrammarASTANTLRParser.actions_return.tree(package private) GrammarASTANTLRParser.actionScopeName_return.tree(package private) GrammarASTANTLRParser.alternative_return.tree(package private) GrammarASTANTLRParser.atom_return.tree(package private) GrammarASTANTLRParser.attrScope_return.tree(package private) GrammarASTANTLRParser.attrScopes_return.tree(package private) GrammarASTANTLRParser.block_return.tree(package private) GrammarASTANTLRParser.defaultNodeOption_return.tree(package private) GrammarASTANTLRParser.delegateGrammar_return.tree(package private) GrammarASTANTLRParser.delegateGrammars_return.tree(package private) GrammarASTANTLRParser.ebnf_return.tree(package private) GrammarASTANTLRParser.ebnfSuffix_return.tree(package private) GrammarASTANTLRParser.element_return.tree(package private) GrammarASTANTLRParser.elementNoOptionSpec_return.tree(package private) GrammarASTANTLRParser.elementOption_return.tree(package private) GrammarASTANTLRParser.elementOptionId_return.tree(package private) GrammarASTANTLRParser.elementOptions_return.tree(package private) GrammarASTANTLRParser.exceptionGroup_return.tree(package private) GrammarASTANTLRParser.exceptionHandler_return.tree(package private) GrammarASTANTLRParser.finallyClause_return.tree(package private) GrammarASTANTLRParser.grammar__return.tree(package private) GrammarASTANTLRParser.grammarType_return.tree(package private) GrammarASTANTLRParser.id_return.tree(package private) GrammarASTANTLRParser.idList_return.tree(package private) GrammarASTANTLRParser.label_return.tree(package private) GrammarASTANTLRParser.notSet_return.tree(package private) GrammarASTANTLRParser.notTerminal_return.tree(package private) GrammarASTANTLRParser.option_return.tree(package private) GrammarASTANTLRParser.optionsSpec_return.tree(package private) GrammarASTANTLRParser.optionValue_return.tree(package private) GrammarASTANTLRParser.range_return.tree(package private) GrammarASTANTLRParser.rewrite_alternative_return.tree(package private) GrammarASTANTLRParser.rewrite_atom_return.tree(package private) GrammarASTANTLRParser.rewrite_block_return.tree(package private) GrammarASTANTLRParser.rewrite_ebnf_return.tree(package private) GrammarASTANTLRParser.rewrite_element_return.tree(package private) GrammarASTANTLRParser.rewrite_indirect_template_head_return.tree(package private) GrammarASTANTLRParser.rewrite_return.tree(package private) GrammarASTANTLRParser.rewrite_template_arg_return.tree(package private) GrammarASTANTLRParser.rewrite_template_args_return.tree(package private) GrammarASTANTLRParser.rewrite_template_head_return.tree(package private) GrammarASTANTLRParser.rewrite_template_return.tree(package private) GrammarASTANTLRParser.rewrite_tree_return.tree(package private) GrammarASTANTLRParser.rewrite_with_sempred_return.tree(package private) GrammarASTANTLRParser.rule_return.tree(package private) GrammarASTANTLRParser.ruleAction_return.tree(package private) GrammarASTANTLRParser.ruleActions_return.tree(package private) GrammarASTANTLRParser.ruleAltList_return.tree(package private) GrammarASTANTLRParser.ruleref_return.tree(package private) GrammarASTANTLRParser.rules_return.tree(package private) GrammarASTANTLRParser.ruleScopeSpec_return.tree(package private) GrammarASTANTLRParser.terminal_return.tree(package private) GrammarASTANTLRParser.throwsSpec_return.tree(package private) GrammarASTANTLRParser.tokenSpec_return.tree(package private) GrammarASTANTLRParser.tokensSpec_return.tree(package private) GrammarASTANTLRParser.tree__return.tree(package private) GrammarASTANTLRParser.treeRoot_return.treeFields in org.antlr.grammar.v3 with type parameters of type GrammarASTModifier and TypeFieldDescription(package private) HashMap<GrammarAST, GrammarAST> DefineGrammarItemsWalker.AttributeScopeActions_scope.actions(package private) HashMap<GrammarAST, GrammarAST> DefineGrammarItemsWalker.AttributeScopeActions_scope.actionsMethods in org.antlr.grammar.v3 that return GrammarASTModifier and TypeMethodDescriptionprotected GrammarASTANTLRParser.createBlockFromDupAlt(GrammarAST alt) Create a copy of the alt and make it into a BLOCK; all actions, labels, tree operators, rewrites are removed.static GrammarASTANTLRParser.createSimpleRuleAST(String name, GrammarAST block, boolean fragment) protected GrammarASTANTLRParser.createSynSemPredFromBlock(GrammarAST synpredBlockAST, int synpredTokenType) ANTLRParser.action_return.getTree()ANTLRParser.actions_return.getTree()ANTLRParser.actionScopeName_return.getTree()ANTLRParser.alternative_return.getTree()ANTLRParser.atom_return.getTree()ANTLRParser.attrScope_return.getTree()ANTLRParser.attrScopes_return.getTree()ANTLRParser.block_return.getTree()ANTLRParser.defaultNodeOption_return.getTree()ANTLRParser.delegateGrammar_return.getTree()ANTLRParser.delegateGrammars_return.getTree()ANTLRParser.ebnf_return.getTree()ANTLRParser.ebnfSuffix_return.getTree()ANTLRParser.element_return.getTree()ANTLRParser.elementNoOptionSpec_return.getTree()ANTLRParser.elementOption_return.getTree()ANTLRParser.elementOptionId_return.getTree()ANTLRParser.elementOptions_return.getTree()ANTLRParser.exceptionGroup_return.getTree()ANTLRParser.exceptionHandler_return.getTree()ANTLRParser.finallyClause_return.getTree()ANTLRParser.grammar__return.getTree()ANTLRParser.grammarType_return.getTree()ANTLRParser.id_return.getTree()ANTLRParser.idList_return.getTree()ANTLRParser.label_return.getTree()ANTLRParser.notSet_return.getTree()ANTLRParser.notTerminal_return.getTree()ANTLRParser.option_return.getTree()ANTLRParser.optionsSpec_return.getTree()ANTLRParser.optionValue_return.getTree()ANTLRParser.range_return.getTree()ANTLRParser.rewrite_alternative_return.getTree()ANTLRParser.rewrite_atom_return.getTree()ANTLRParser.rewrite_block_return.getTree()ANTLRParser.rewrite_ebnf_return.getTree()ANTLRParser.rewrite_element_return.getTree()ANTLRParser.rewrite_indirect_template_head_return.getTree()ANTLRParser.rewrite_return.getTree()ANTLRParser.rewrite_template_arg_return.getTree()ANTLRParser.rewrite_template_args_return.getTree()ANTLRParser.rewrite_template_head_return.getTree()ANTLRParser.rewrite_template_return.getTree()ANTLRParser.rewrite_tree_return.getTree()ANTLRParser.rewrite_with_sempred_return.getTree()ANTLRParser.rule_return.getTree()ANTLRParser.ruleAction_return.getTree()ANTLRParser.ruleActions_return.getTree()ANTLRParser.ruleAltList_return.getTree()ANTLRParser.ruleref_return.getTree()ANTLRParser.rules_return.getTree()ANTLRParser.ruleScopeSpec_return.getTree()ANTLRParser.terminal_return.getTree()ANTLRParser.throwsSpec_return.getTree()ANTLRParser.tokenSpec_return.getTree()ANTLRParser.tokensSpec_return.getTree()ANTLRParser.tree__return.getTree()ANTLRParser.treeRoot_return.getTree()protected GrammarASTANTLRParser.setToBlockWithSet(GrammarAST b) final GrammarASTLeftRecursiveRuleWalker.token()Methods in org.antlr.grammar.v3 with parameters of type GrammarASTModifier and TypeMethodDescriptionprotected voidAssignTokenTypesWalker.alias(GrammarAST t, GrammarAST s) CodeGenTreeWalker.alternative(GrammarAST label) CodeGenTreeWalker.atom(GrammarAST scope, GrammarAST label, GrammarAST astSuffix) final voidDefineGrammarItemsWalker.atom(GrammarAST scope_) voidLeftRecursiveRuleWalker.binaryAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) private ANTLRTreePrinter.block_returnANTLRTreePrinter.block(GrammarAST t, boolean forceParens) CodeGenTreeWalker.block(String blockTemplateName, DFA dfa, GrammarAST label) voidANTLRParser.cleanup(GrammarAST root) final intANTLRTreePrinter.countAltsForBlock(GrammarAST t) protected GrammarASTANTLRParser.createBlockFromDupAlt(GrammarAST alt) Create a copy of the alt and make it into a BLOCK; all actions, labels, tree operators, rewrites are removed.static GrammarASTANTLRParser.createSimpleRuleAST(String name, GrammarAST block, boolean fragment) protected GrammarASTANTLRParser.createSynSemPredFromBlock(GrammarAST synpredBlockAST, int synpredTokenType) ANTLRParser.defaultNodeOption(GrammarAST terminalAST) CodeGenTreeWalker.ebnf(GrammarAST label) ANTLRParser.ebnfSuffix(GrammarAST elemAST, boolean inRewrite) CodeGenTreeWalker.element(GrammarAST label, GrammarAST astSuffix) ANTLRParser.elementOption(GrammarAST terminalAST) ANTLRParser.elementOptions(GrammarAST terminalAST) protected final org.stringtemplate.v4.STCodeGenTreeWalker.getRuleElementST(String name, String ruleTargetName, GrammarAST elementAST, GrammarAST ast_suffix, String label) protected final StringCodeGenTreeWalker.getSTSuffix(GrammarAST elementAST, GrammarAST ast_suffix, String label) Return a non-empty template name suffix if the token is to be tracked, added to a tree, or both.protected final org.stringtemplate.v4.STCodeGenTreeWalker.getTokenElementST(String name, String elementName, GrammarAST elementAST, GrammarAST ast_suffix, String label) protected final org.stringtemplate.v4.STCodeGenTreeWalker.getWildcardST(GrammarAST elementAST, GrammarAST ast_suffix, String label) private booleanTreeToNFAConverter.hasElementOptions(GrammarAST node) final org.stringtemplate.v4.STCodeGenTreeWalker.notElement(GrammarAST n, GrammarAST label, GrammarAST astSuffix) voidLeftRecursiveRuleWalker.otherAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) voidLeftRecursiveRuleWalker.prefixAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) protected voidANTLRParser.prefixWithSynPred(GrammarAST alt) Rewrite alt to have a synpred as first element; (xxx)=>xxx but only if they didn't specify one manually.final org.stringtemplate.v4.STCodeGenTreeWalker.set(GrammarAST label, GrammarAST astSuffix) voidLeftRecursiveRuleWalker.setReturnValues(GrammarAST t) final IntSetTreeToNFAConverter.setRule(GrammarAST t) protected GrammarASTANTLRParser.setToBlockWithSet(GrammarAST b) voidLeftRecursiveRuleWalker.setTokenPrec(GrammarAST t, int alt) voidLeftRecursiveRuleWalker.suffixAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) voidLeftRecursiveRuleWalker.ternaryAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) final intTreeToNFAConverter.testBlockAsSet(GrammarAST t) final intTreeToNFAConverter.testSetRule(GrammarAST t) protected final voidDefineGrammarItemsWalker.trackInlineAction(GrammarAST actionAST) protected voidAssignTokenTypesWalker.trackString(GrammarAST t) protected voidAssignTokenTypesWalker.trackToken(GrammarAST t) protected voidAssignTokenTypesWalker.trackTokenRule(GrammarAST t, GrammarAST modifier, GrammarAST block) Method parameters in org.antlr.grammar.v3 with type arguments of type GrammarASTModifier and TypeMethodDescriptionCodeGenTreeWalker.getTokenTypesAsTargetLabels(Collection<GrammarAST> refs) Convert rewrite AST lists to target labels listConstructors in org.antlr.grammar.v3 with parameters of type GrammarASTModifierConstructorDescriptionActionAnalysis(Grammar grammar, String ruleName, GrammarAST actionAST) ActionTranslator(CodeGenerator generator, String ruleName, GrammarAST actionAST) -
Uses of GrammarAST in org.antlr.tool
Fields in org.antlr.tool declared as GrammarASTModifier and TypeFieldDescriptionRule.argActionASTFor convenience, track the argument def AST action node if anyGrammar.Decision.blockASTprivate static final GrammarASTGrammarAST.DescendantDownNodeprivate static final GrammarASTGrammarAST.DescendantUpNodeGrammar.LabelElementPair.elementRefRule.EORNodeprotected GrammarASTGrammar.grammarTreeAn AST that records entire input grammar with all rules.LeftRecursiveRuleAnalyzer.retvalsRule.treeThe AST representing the whole ruleFields in org.antlr.tool with type parameters of type GrammarASTModifier and TypeFieldDescriptionAttributeScope.actionsGrammar.blocksWithSemPredsTrack decisions with syn preds specified for reporting.Grammar.blocksWithSynPredsTrack decisions with syn preds specified for reporting.protected List<GrammarAST> Rule.inlineActionsTrack all executable actions other than named actions like @init.protected LinkedHashMap<String, GrammarAST> Grammar.nameToSynpredASTMapWhen we read in a grammar, we track the list of syntactic predicates and build faux rules for them later.GrammarAST.rewriteRefsDeepGrammarAST.rewriteRefsShallowIf this is a BLOCK node for a rewrite rule, track referenced elements here.protected Set<GrammarAST> Grammar.ruleRefsThe unique set of all rule references in any rule; set of tree node objects so two refs to same rule can exist but at different line/position.protected Set<GrammarAST> Grammar.scopedRuleRefsMethods in org.antlr.tool that return GrammarASTModifier and TypeMethodDescriptionGrammar.addArtificialMatchTokensRule(GrammarAST grammarAST, List<String> ruleNames, List<String> delegateNames, boolean filterMode) Parse a rule we add artificially that is a list of the other lexer rules like this: "Tokens : ID | INT | SEMI ;" nextToken() will invoke this to set the current token.static GrammarASTGrammarAST.dup(org.antlr.runtime.tree.Tree t) static GrammarASTGrammarAST.dupTree(GrammarAST t) static GrammarASTGrammarAST.dupTreeNoActions(GrammarAST t, GrammarAST parent) Duplicate a tree, assuming this is a root node of a tree-- duplicate that node and what's below; ignore siblings of root node.GrammarAST.findFirstType(int ttype) protected GrammarASTGrammar.findFirstTypeOutsideRewrite(GrammarAST block, BitSet types) GrammarAST.getBlockALT(int i) GrammarAST.getChildrenAsArray()Grammar.getDecisionBlockAST(int decision) Grammar.getGrammarTree()GrammarAST.getLastChild()GrammarAST.getLastSibling()GrammarAST.getNextSibling()Grammar.getSyntacticPredicate(String name) Grammar.parseArtificialRule(String ruleText) LeftRecursiveRuleAnalyzer.replaceLastRuleRef(GrammarAST t, String name) LeftRecursiveRuleAnalyzer.replaceRuleRefs(GrammarAST t, String name) Methods in org.antlr.tool that return types with arguments of type GrammarASTModifier and TypeMethodDescriptionGrammarAST.findAllType(int ttype) protected List<? extends GrammarAST> Grammar.getArtificialRulesForSyntacticPredicates(LinkedHashMap<String, GrammarAST> nameToSynpredASTMap) for any syntactic predicates, we need to define rules for them; they will get defined automatically like any other rule.private static List<GrammarAST> GrammarAST.getChildrenForDupTree(GrammarAST t) Rule.getInlineActions()Rule.getRuleRefsInAlt(String ref, int outerAltNum) Grammar.getSyntacticPredicates()Rule.getTokenRefsInAlt(String ref, int outerAltNum) Methods in org.antlr.tool with parameters of type GrammarASTModifier and TypeMethodDescriptionGrammar.addArtificialMatchTokensRule(GrammarAST grammarAST, List<String> ruleNames, List<String> delegateNames, boolean filterMode) Parse a rule we add artificially that is a list of the other lexer rules like this: "Tokens : ID | INT | SEMI ;" nextToken() will invoke this to set the current token.voidGrammar.addRule(GrammarAST grammarTree, GrammarAST t) protected voidAssignTokenTypesBehavior.alias(GrammarAST t, GrammarAST s) voidGrammarSerializerFoo.alt(GrammarAST alt) voidGrammar.altReferencesRule(String enclosingRuleName, GrammarAST refScopeAST, GrammarAST refAST, int outerAltNum) Track a rule reference within an outermost alt of a rule.voidGrammar.altReferencesTokenID(String ruleName, GrammarAST refAST, int outerAltNum) Track a token reference within an outermost alt of a rule.voidLeftRecursiveRuleAnalyzer.binaryAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) static booleanGrammarReport.blockHasSynPred(GrammarAST blockAST) NFAFactory.build_Action(GrammarAST action) Build what amounts to an epsilon transition with an action.NFAFactory.build_Atom(int label, GrammarAST associatedAST) From label A build Graph o-A->oNFAFactory.build_Atom(GrammarAST atomAST) NFAFactory.build_CharLiteralAtom(GrammarAST charLiteralAST) From char 'c' build StateCluster o-intValue(c)->oNFAFactory.build_SemanticPredicate(GrammarAST pred) Build what amounts to an epsilon transition with a semantic predicate action.NFAFactory.build_Set(IntSet set, GrammarAST associatedAST) From set build single edge graph o->o-set->o.NFAFactory.build_StringLiteralAtom(GrammarAST stringLiteralAST) For a non-lexer, just build a simple token reference atom.NFAFactory.build_Wildcard(GrammarAST associatedAST) Build an atom with all possible values in its labelNFAFactory.build_WildcardTree(GrammarAST associatedAST) Build a subrule matching ^(.voidGrammarSerializerFoo.charLiteral(GrammarAST t) voidGrammar.checkRuleReference(GrammarAST scopeAST, GrammarAST refAST, GrammarAST argsAST, String currentRuleName) voidGrammarSanity.checkRuleReference(GrammarAST scopeAST, GrammarAST refAST, GrammarAST argsAST, String currentRuleName) protected voidGrammar.defineLabel(Rule r, org.antlr.runtime.Token label, GrammarAST element, int type) Define a label defined in a rule r; check the validity then ask the Rule object to actually define it.voidRule.defineLabel(org.antlr.runtime.Token label, GrammarAST elementRef, int type) voidGrammar.defineLexerRuleFoundInParser(org.antlr.runtime.Token ruleToken, GrammarAST ruleAST) final voidAttributeScope.defineNamedAction(GrammarAST nameAST, GrammarAST actionAST) Given @scope::name {action} define it for this attribute scope.voidGrammar.defineNamedAction(GrammarAST ampersandAST, String scope, GrammarAST nameAST, GrammarAST actionAST) Given @scope::name {action} define it for this grammar.voidRule.defineNamedAction(GrammarAST ampersandAST, GrammarAST nameAST, GrammarAST actionAST) Given @scope::name {action} define it for this grammar.voidGrammar.defineRule(org.antlr.runtime.Token ruleToken, String modifier, Map<String, Object> options, GrammarAST tree, GrammarAST argActionAST, int numAlts) Define a new rule.voidGrammar.defineRuleListLabel(String ruleName, org.antlr.runtime.Token label, GrammarAST element) voidGrammar.defineRuleRefLabel(String ruleName, org.antlr.runtime.Token label, GrammarAST ruleRef) Grammar.defineSyntacticPredicate(GrammarAST blockAST, String currentRuleName) Define a new predicate and get back its name for use in building a semantic predicate reference to the syn pred.voidGrammar.defineTokenListLabel(String ruleName, org.antlr.runtime.Token label, GrammarAST element) voidGrammar.defineTokenRefLabel(String ruleName, org.antlr.runtime.Token label, GrammarAST tokenRef) voidGrammar.defineWildcardTreeLabel(String ruleName, org.antlr.runtime.Token label, GrammarAST tokenRef) voidGrammar.defineWildcardTreeListLabel(String ruleName, org.antlr.runtime.Token label, GrammarAST tokenRef) static GrammarASTGrammarAST.dupTree(GrammarAST t) static GrammarASTGrammarAST.dupTreeNoActions(GrammarAST t, GrammarAST parent) Duplicate a tree, assuming this is a root node of a tree-- duplicate that node and what's below; ignore siblings of root node.voidGrammarSanity.ensureAltIsSimpleNodeOrTree(GrammarAST altAST, GrammarAST elementAST, int outerAltNum) Rules in tree grammar that use -> rewrites and are spitting out templates via output=template and then use rewrite=true must only use -> on alts that are simple nodes or trees or single rule refs that match either nodes or trees.protected GrammarASTGrammar.findFirstTypeOutsideRewrite(GrammarAST block, BitSet types) Grammar.getBlockOption(GrammarAST blockAST, String key) private static List<GrammarAST> GrammarAST.getChildrenForDupTree(GrammarAST t) Grammar.grammarTreeToString(GrammarAST t) Grammar.grammarTreeToString(GrammarAST t, boolean showActions) static booleanLeftRecursiveRuleAnalyzer.hasImmediateRecursiveRuleRefs(GrammarAST t, String ruleName) voidGrammar.importGrammar(GrammarAST grammarNameAST, String label) Import the rules/tokens of a delegate grammar.intGrammar.importTokenVocabulary(GrammarAST tokenVocabOptionAST, String vocabName) Load a vocab file <vocabName>.tokens and return max token type found.booleanGrammar.isEmptyRule(GrammarAST block) Rules like "a : ;" and "a : {...} ;" should not generate try/catch blocks for RecognitionException.protected booleanGrammarSanity.isNextNonActionElementEOA(GrammarAST t) booleanGrammar.isValidSet(TreeToNFAConverter nfabuilder, GrammarAST t) Given set tree like ( SET A B ), check that A and B are both valid sets themselves, else we must tree like a BLOCKvoidLeftRecursiveRuleAnalyzer.otherAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) voidLeftRecursiveRuleAnalyzer.prefixAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) LeftRecursiveRuleAnalyzer.replaceLastRuleRef(GrammarAST t, String name) LeftRecursiveRuleAnalyzer.replaceRuleRefs(GrammarAST t, String name) voidGrammarSerializerFoo.ruleRef(GrammarAST t) voidGrammar.setDecisionBlockAST(int decision, GrammarAST blockAST) voidGrammar.setGrammarTree(GrammarAST value) voidLeftRecursiveRuleAnalyzer.setReturnValues(GrammarAST t) voidGrammar.setRuleAST(String ruleName, GrammarAST t) voidLeftRecursiveRuleAnalyzer.setTokenPrec(GrammarAST t, int alt) voidLeftRecursiveRuleAnalyzer.stripLeftRecursion(GrammarAST altAST) voidLeftRecursiveRuleAnalyzer.stripSynPred(GrammarAST altAST) voidLeftRecursiveRuleAnalyzer.suffixAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) voidLeftRecursiveRuleAnalyzer.ternaryAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) Convert e ? e : e → ? e : e_[nextPrec]LeftRecursiveRuleAnalyzer.text(GrammarAST t) voidGrammarSerializerFoo.token(GrammarAST t) voidRule.trackInlineAction(GrammarAST actionAST) voidRule.trackRuleReferenceInAlt(GrammarAST refAST, int outerAltNum) protected voidAssignTokenTypesBehavior.trackString(GrammarAST t) Track string literals (could be in tokens{} section)protected voidAssignTokenTypesBehavior.trackToken(GrammarAST t) voidRule.trackTokenReferenceInAlt(GrammarAST refAST, int outerAltNum) Track a token ID or literal like '+' and "void" as having been referenced somewhere within the alts (not rewrite sections) of a rule.protected voidAssignTokenTypesBehavior.trackTokenRule(GrammarAST t, GrammarAST modifier, GrammarAST block) voidGrammar.translateLeftRecursiveRule(GrammarAST ruleAST) voidGrammarSerializerFoo.wildcard(GrammarAST t) Method parameters in org.antlr.tool with type arguments of type GrammarASTModifier and TypeMethodDescriptionvoidGrammarAST._findAllType(int ttype, List<GrammarAST> nodes) protected List<? extends GrammarAST> Grammar.getArtificialRulesForSyntacticPredicates(LinkedHashMap<String, GrammarAST> nameToSynpredASTMap) for any syntactic predicates, we need to define rules for them; they will get defined automatically like any other rule.Grammar.getLabels(Set<GrammarAST> rewriteElements, int labelType) Given a set of all rewrite elements on right of ->, filter for label types such as Grammar.TOKEN_LABEL, Grammar.TOKEN_LIST_LABEL, ...Constructors in org.antlr.tool with parameters of type GrammarASTModifierConstructorDescriptionLabelElementPair(org.antlr.runtime.Token label, GrammarAST elementRef)