|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use BaseRecognizer | |
---|---|
org.antlr.runtime | |
org.antlr.runtime.debug | |
org.antlr.runtime.tree |
Uses of BaseRecognizer in org.antlr.runtime |
---|
Subclasses of BaseRecognizer in org.antlr.runtime | |
---|---|
class |
Lexer
A lexer is recognizer that draws input symbols from a character stream. |
class |
Parser
A parser for TokenStreams. |
Fields in org.antlr.runtime declared as BaseRecognizer | |
---|---|
protected BaseRecognizer |
DFA.recognizer
Which recognizer encloses this DFA? Needed to check backtracking |
Uses of BaseRecognizer in org.antlr.runtime.debug |
---|
Subclasses of BaseRecognizer in org.antlr.runtime.debug | |
---|---|
class |
DebugParser
|
class |
DebugTreeParser
|
Fields in org.antlr.runtime.debug declared as BaseRecognizer | |
---|---|
protected BaseRecognizer |
DebugEventSocketProxy.recognizer
Who am i debugging? |
Constructors in org.antlr.runtime.debug with parameters of type BaseRecognizer | |
---|---|
DebugEventSocketProxy(BaseRecognizer recognizer,
int port,
TreeAdaptor adaptor)
|
|
DebugEventSocketProxy(BaseRecognizer recognizer,
TreeAdaptor adaptor)
|
Uses of BaseRecognizer in org.antlr.runtime.tree |
---|
Subclasses of BaseRecognizer in org.antlr.runtime.tree | |
---|---|
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
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |