Package | Description |
---|---|
org.antlr.grammar.v3 | |
org.antlr.runtime.debug | |
org.antlr.runtime.tree | |
org.antlr.tool |
Modifier and Type | Class | 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 | Description |
---|---|---|
TreeParser[] |
ANTLRTreePrinter.getDelegates() |
|
TreeParser[] |
ANTLRv3Tree.getDelegates() |
|
TreeParser[] |
AssignTokenTypesWalker.getDelegates() |
|
TreeParser[] |
CodeGenTreeWalker.getDelegates() |
|
TreeParser[] |
DefineGrammarItemsWalker.getDelegates() |
|
TreeParser[] |
LeftRecursiveRuleWalker.getDelegates() |
|
TreeParser[] |
TreeToNFAConverter.getDelegates() |
Modifier and Type | Class | Description |
---|---|---|
class |
DebugTreeParser |
Modifier and Type | Class | 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 | Description |
---|---|---|
class |
AssignTokenTypesBehavior |
Move all of the functionality from assign.types.g grammar file.
|
class |
LeftRecursiveRuleAnalyzer |
Copyright © 1992–2018 ANTLR. All rights reserved.