Package | Description |
---|---|
org.antlr.grammar.v3 | |
org.antlr.runtime.debug | |
org.antlr.runtime.tree | |
org.antlr.tool |
Modifier and Type | Class and Description |
---|---|
class |
ANTLRTreePrinter
Print out a grammar (no pretty printing).
|
class |
ANTLRv3Tree
ANTLR v3 tree grammar to walk trees created by ANTLRv3.g
|
class |
AssignTokenTypesWalker
[Warning: TJP says that this is probably out of date as of 11/19/2005,
but since it's probably still useful, I'll leave in.
|
class |
CodeGenTreeWalker
Walk a grammar and generate code by gradually building up
a bigger and bigger ST.
|
class |
DefineGrammarItemsWalker |
class |
LeftRecursiveRuleWalker
Find left-recursive rules
|
class |
TreeToNFAConverter
Build an NFA from a tree representing an ANTLR grammar.
|
Modifier and Type | Method and Description |
---|---|
TreeParser[] |
DefineGrammarItemsWalker.getDelegates() |
TreeParser[] |
LeftRecursiveRuleWalker.getDelegates() |
TreeParser[] |
AssignTokenTypesWalker.getDelegates() |
TreeParser[] |
ANTLRv3Tree.getDelegates() |
TreeParser[] |
ANTLRTreePrinter.getDelegates() |
TreeParser[] |
TreeToNFAConverter.getDelegates() |
TreeParser[] |
CodeGenTreeWalker.getDelegates() |
Modifier and Type | Class and Description |
---|---|
class |
DebugTreeParser |
Modifier and Type | Class and Description |
---|---|
class |
TreeFilter
Cut-n-paste from material I'm not using in the book anymore (edit later
to make sense):
Now, how are we going to test these tree patterns against every
subtree in our original tree? In what order should we visit nodes?
For this application, it turns out we need a simple ``apply once''
rule application strategy and a ``down then up'' tree traversal
strategy.
|
class |
TreeRewriter |
Modifier and Type | Class and Description |
---|---|
class |
AssignTokenTypesBehavior
Move all of the functionality from assign.types.g grammar file.
|
class |
LeftRecursiveRuleAnalyzer |
Copyright © 1992–2015 ANTLR. All rights reserved.