Package | Description |
---|---|
org.antlr.grammar.v3 | |
org.antlr.gunit | |
org.antlr.gunit.swingui.parsers | |
org.antlr.runtime | |
org.antlr.runtime.debug | |
org.antlr.runtime.tree | |
org.antlr.tool |
Modifier and Type | Class | Description |
---|---|---|
class |
ActionAnalysis |
We need to set Rule.referencedPredefinedRuleAttributes before
code generation.
|
class |
ActionTranslator |
|
class |
ANTLRLexer |
|
class |
ANTLRParser |
Read in an ANTLR grammar and build an AST.
|
class |
ANTLRTreePrinter |
Print out a grammar (no pretty printing).
|
class |
ANTLRv3Lexer |
|
class |
ANTLRv3Parser |
ANTLR v3 grammar written in ANTLR v3 with AST construction
|
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.
|
Constructor | Description |
---|---|
DFA2(BaseRecognizer recognizer) |
|
DFA22(BaseRecognizer recognizer) |
|
DFA25(BaseRecognizer recognizer) |
|
DFA48(BaseRecognizer recognizer) |
|
DFA81(BaseRecognizer recognizer) |
|
DFA9(BaseRecognizer recognizer) |
Modifier and Type | Class | Description |
---|---|---|
class |
gUnitLexer |
|
class |
gUnitParser |
Constructor | Description |
---|---|
DFA14(BaseRecognizer recognizer) |
Modifier and Type | Class | Description |
---|---|---|
class |
ANTLRv3Lexer |
|
class |
ANTLRv3Parser |
ANTLR v3 grammar written in ANTLR v3 with AST construction
|
class |
StGUnitLexer |
|
class |
StGUnitParser |
Constructor | Description |
---|---|
DFA13(BaseRecognizer recognizer) |
|
DFA2(BaseRecognizer recognizer) |
|
DFA22(BaseRecognizer recognizer) |
|
DFA72(BaseRecognizer recognizer) |
Modifier and Type | Class | Description |
---|---|---|
class |
Lexer |
A lexer is recognizer that draws input symbols from a character stream.
|
class |
Parser |
A parser for TokenStreams.
|
Modifier and Type | Field | Description |
---|---|---|
protected BaseRecognizer |
DFA.recognizer |
Which recognizer encloses this DFA? Needed to check backtracking
|
Modifier and Type | Class | Description |
---|---|---|
class |
DebugParser |
|
class |
DebugTreeParser |
Modifier and Type | Field | Description |
---|---|---|
protected BaseRecognizer |
DebugEventSocketProxy.recognizer |
Who am i debugging?
|
Constructor | Description |
---|---|
DebugEventSocketProxy(BaseRecognizer recognizer,
int port,
TreeAdaptor adaptor) |
|
DebugEventSocketProxy(BaseRecognizer recognizer,
TreeAdaptor adaptor) |
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 |
TreeParser |
A parser for a stream of tree nodes.
|
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.