| Package | Description |
|---|---|
| org.antlr.runtime | |
| org.antlr.runtime.debug | |
| org.antlr.runtime.tree |
| 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 |
Copyright © 1992–2019 ANTLR. All rights reserved.