All Classes and Interfaces
Class
Description
This is a char buffer stream that is loaded from a file
all at once when you construct the object.
A kind of ReaderStream that pulls from an InputStream.
Vacuum all input from a Reader and then treat it like a StringStream.
A pretty quick CharStream that pulls all data from an array
directly.
A generic recognizer that can handle recognizers generated from
lexer, parser, and tree grammars.
A generic tree implementation with no payload.
A TreeAdaptor that works with any Tree implementation.
A stripped-down version of org.antlr.misc.BitSet that is just
good enough to handle runtime requirements such as FOLLOW sets
for automatic error recovery.
A blank listener that does nothing; useful for real classes so
they don't have to have lots of blank methods and are less
sensitive to updates to debug interface.
Buffer all input tokens but do on-demand fetching of new tokens from
lexer.
A buffered stream of tree nodes.
A source of characters for an ANTLR lexer
When walking ahead with cyclic DFA or for syntactic predicates,
we need to record the state of the input stream (char index,
line, etc...) so that we can rewind the state after scanning ahead.
A Token object like we'd use in ANTLR 2.x; has an actual string created
and associated with this object.
A node representing erroneous token range in token stream
The most common stream of tokens where every token is buffered up
and tokens are filtered for a certain channel (the parser will only
see these tokens).
A tree node that is wrapper for a Token object.
A TreeAdaptor that works with any Tree implementation.
Broadcast debug events to multiple listeners.
All debugging events that a recognizer can trigger.
A simple event repeater (proxy) that delegates all functionality to the
listener sent into the ctor.
A proxy debug event listener that forwards events over a socket to
a debugger (or any other listener) using a simple text-based protocol;
one event per line.
A TreeAdaptor proxy that fires debugging events to a DebugEventListener
delegate and uses the TreeAdaptor delegate to do the actual work.
Debug any tree node stream.
A DFA implemented as a set of transition tables.
A utility class to generate DOT diagrams (graphviz) from
arbitrary trees.
Sometimes we need to map a key to a value but key is two pieces of data.
The recognizer did not match anything for a (..)+ loop.
A semantic predicate failed during validation.
A queue that can dequeue and get(i) in O(1) and grow arbitrarily large.
A dynamic array that uses int not Integer objects.
A simple stream of integers used when all I care about is the char
or token type sequence (such as interpretation).
The most common stream of tokens is one where every token is buffered up
and tokens are prefiltered for a certain channel (the parser will only
see these tokens and cannot change the filter channel number during the
parse).
A lexer is recognizer that draws input symbols from a character stream.
A lookahead queue that knows how to mark/release locations in the buffer for
backtracking purposes.
A mismatched char or Token or tree node
We were expecting a token but it's not found.
A parser for TokenStreams.
Rules that return more than a single value must return an object
containing all the values.
A record of the rules used to match a token sequence.
This parser listener tracks rule entry/exit and token matches
to build a simple parse tree using ParseTree nodes.
Using the debug event interface, track what is happening in the parser
and record statistics about the runtime.
The root of the ANTLR exception hierarchy.
The set of fields needed by an abstract recognizer to recognize input
and recover from errors etc...
Base class for all exceptions thrown during AST rewrite construction.
No elements within a (...)+ in a rewrite rule
Ref to ID or expr but no tokens in ID stream or subtrees in expr stream
A generic list of elements tracked in an alternative to be used in
a -> rewrite rule.
Queues up nodes matched on left side of -> in a tree parser.
Rules can return start/stop info as well as possible trees and templates
Stats routines needed by profiler etc...
Useful for dumping out the input stream after doing some
augmentation or other manipulations.
A source of tokens must provide a sequence of tokens via nextToken()
and also must reveal it's source of characters; CommonToken's text is
computed from a CharStream; it only store indices into the char stream.
A stream of tokens accessing tokens from a TokenSource
Print out (most of) the events...
The default tracer mimics the traceParser behavior of ANTLR 2.x.
What does a tree look like? ANTLR has a number of support classes
such as CommonTreeNodeStream that work on these kinds of trees.
How to create and navigate trees.
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.
Return a node stream from a doubly-linked tree whose nodes
know what child index they are.
A stream of tree nodes, accessing nodes from a tree of some kind
A parser for a stream of tree nodes.
This is identical to the
ParserRuleReturnScope except that
the start property is a tree nodes not Token object
when you are parsing trees.Do a depth first walk of a tree, applying pre() and post() actions
as we discover and finish nodes.
How to execute code for node t when a visitor visits node t.
Build and navigate trees with this object.
When using %label:TOKENNAME in a tree for parse(), we must
track the label.
This adaptor creates TreePattern objects for use during scan()
A token stream that pulls tokens from the code source on-demand and
without tracking a complete buffer of the tokens.
An extra token while parsing a TokenStream