Generate the code for all grammars
Generate the parser, lexer, treeparser, and token types in C++
Generate the parser, lexer, treeparser, and token types in CSharp
Generate the parser, lexer, and token types documentation
Generate the code for all grammars
Generate the code for all grammars
Generate the parser, lexer, treeparser, and token types in Java
Generate the parser, lexer, treeparser, and token types in Java
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate the code for a parser
Generate the lexer C++ files
Generate the lexer CSharp file
Generate the lexer TXT file
Generate the lexer HTML file
Generate the lexer HTML file
Generate the lexer Java file
Generate the lexer Java file
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate the code for a parser
Generate the parser C++ file
Generate the parser CSharp file
Generate the parser TXT file
Generate the parser HTML file
Generate the parser HTML file
Generate the parser Java file
Generate the parser Java file
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate the code for a parser
Generate the tree-parser C++ files
Generate the tree-parser CSharp file
Generate the tree-walker TXT file
Generate the tree-walker TXT file
Generate the tree-walker TXT file
Generate the tree-parser Java file
Generate the tree-parser Java file
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate a wildcard element
Generate a wildcard element
Generate a wildcard element
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate code for the given grammar element.
Generate all the bitsets to be used in the parser or lexer
Generate the raw bitset data like "long _tokenSet1_data[] = {...};"
and the BitSet object declarations like "BitSet _tokenSet1 = new BitSet(_tokenSet1_data);"
Note that most languages do not support object initialization inside a
class definition, so other code-generators may have to separate the
bitset declarations from the initializations (e.g., put the initializations
in the generated constructor instead).
Generate all the bitsets to be used in the parser or lexer
Generate the raw bitset data like "long _tokenSet1_data[] = {...};"
and the BitSet object declarations like "BitSet _tokenSet1 = new BitSet(_tokenSet1_data);"
Note that most languages do not support object initialization inside a
class definition, so other code-generators may have to separate the
bitset declarations from the initializations (e.g., put the initializations
in the generated constructor instead).
Generate all the bitsets to be used in the parser or lexer
Generate the raw bitset data like "long _tokenSet1_data[] = {...}"
and the BitSet object declarations like "BitSet _tokenSet1 = new BitSet(_tokenSet1_data)"
Note that most languages do not support object initialization inside a
class definition, so other code-generators may have to separate the
bitset declarations from the initializations (e.g., put the initializations
in the generated constructor instead).
Generate all the bitsets to be used in the parser or lexer
Generate the raw bitset data like "long _tokenSet1_data[] = {...};"
and the BitSet object declarations like
"BitSet _tokenSet1 = new BitSet(_tokenSet1_data);"
Note that most languages do not support object initialization inside a
class definition, so other code-generators may have to separate the
bitset declarations from the initializations (e.g., put the
initializations in the generated constructor instead).
Generate the initaction for a block, which may be a RuleBlock or a
plain AlternativeBLock.
Generate the init action for a block, which may be a RuleBlock or a
plain AlternativeBLock.
Generate the init action for a block, which may be a RuleBlock or a
plain AlternativeBLock.
Generate the init action for a block, which may be a RuleBlock or a
plain AlternativeBLock.
Generate the header for a block, which may be a RuleBlock or a
plain AlternativeBlock.
Generate the header for a block, which may be a RuleBlock or a
plain AlternativeBLock.
Generate the header for a block, which may be a RuleBlock or a
plain AlternativeBLock.
Generate the header for a block, which may be a RuleBlock or a
plain AlternativeBLock.
Generate the header for a block, which may be a RuleBlock or a
plain AlternativeBLock.
Generate a series of case statements that implement a BitSet test.
Generate a series of case statements that implement a BitSet test.
Generate a series of case statements that implement a BitSet test.
Generate a series of case statements that implement a BitSet test.
Generate common code for a block of alternatives; return a postscript
that needs to be generated at the end of the block.
Generate common code for a block of alternatives; return a postscript
that needs to be generated at the end of the block.
Generate common code for a block of alternatives; return a postscript
that needs to be generated at the end of the block.
Generate common code for a block of alternatives; return a postscript
that needs to be generated at the end of the block.
Generate common code for a block of alternatives; return a
postscript that needs to be generated at the end of the
block.
Generate common code for a block of alternatives; return a
postscript that needs to be generated at the end of the
block.
Generate common code for a block of alternatives; return a
postscript that needs to be generated at the end of the
block.
Generate diagnostics? (vs code)
Generate DocBook vs code?
Top-level call to generate the code for this grammar
Top-level call to generate the code
Top-level call to generate the code for this grammar
Top-level call to generate the code for this grammar
Generate a textual representation of the follow set
for a block.
Generate a textual representation of the follow set
for a block.
Generate a textual representation of the follow set
for a block.
Generate a header that is common to all CSharp files
Generate a header that is common to all TXT files
Generate a header that is common to all TXT files
Generate a header that is common to all TXT files
Generate a header that is common to all Java files
Generate a header that is common to all Python files
Generate a header that is common to all C++ files
Generate an automated test for Python CharScanner (sub)classes.
Generate a #line or // line depending on options
Generate a #line or // line depending on options
Generate a #line or // line depending on options
Generate a #line or // line depending on options
Generate the lookahead set for an alternate.
Generate the lookahead set for an alternate.
Generate the lookahead set for an alternate.
Generate a textual representation of the lookahead set
for a block.
Generate a textual representation of the lookahead set
for a block.
Generate a textual representation of the lookahead set
for a block.
Generate the nextToken() rule.
Generate the nextToken() rule.
Generate the nextToken rule.
Generate the nextToken rule.
Generate the nextToken rule.
Generate the nextToken() rule.
Generate the nextToken() rule.
Generate code for a named rule block
Generate code for a named rule block
Generate code for a named rule block
Write an array of Strings which are the semantic predicate
expressions.
Write an array of Strings which are the semantic predicate
expressions.
Write an array of Strings which are the semantic predicate
expressions.
Write an array of Strings which are the semantic predicate
expressions.
Generate the syntactic predicate.
Generate the syntactic predicate.
Generate the syntactic predicate.
Create and set Integer token type objects that map
to Java Class objects (which AST node to create).
Create and set Integer token type objects that map
to Java Class objects (which AST node to create).
Generate the token types as a text file for persistence across shared lexer/parser
Generate a static array containing the names of the tokens,
indexed by the token type values.
Generate a static array containing the names of the tokens,
indexed by the token type values.
Generate a static array containing the names of the tokens,
indexed by the token type values.
Generate a static array containing the names of the tokens,
indexed by the token type values.
Generate the token types C++ file
Generate the token types CSharp file
Generate the token types TXT file
Generate the token types TXT file
Generate the token types TXT file
Generate the token types Java file
Generate the token types Java file
Get the AST return value squirreled away in the parser
Get the AST return value squirreled away in the parser
Get a string for an expression to generate creation of an AST subtree.
Get a string for an expression to generate creation of an AST subtree.
Get a string for an expression to generate creation of an AST subtree.
Get a string for an expression to generate creation of an AST subtree.
Get a string for an expression to generate creation of an AST subtree.
Get a string for an expression to generate creation of an AST subtree.
Get a string for an expression to generate creation of an AST subtree.
Get a string for an expression to generate creation of an AST subtree.
Get a string for an expression to generate creating of an AST node
Get a string for an expression to generate creating of an AST node
Get a string for an expression to generate creating of an AST node
Get a string for an expression to generate creating of an AST node
Get a string for an expression to generate creating of an AST node
Get a string for an expression to generate creating of an AST node
Get a string for an expression to generate creating of an AST node
Get a string for an expression to generate creating of an AST node
Get a string for an expression to generate creating of an AST node
Returns a string expression that creates an AST node using the specified
AST constructor argument string.
Get a string for an expression to generate creating of an AST node.
Get a string for an expression to generate creating of an AST node.
For a given token type, what is the AST node object type to create
for it?
Given the index of a bitset in the bitset list, generate a unique name.
Given the index of a bitset in the bitset list, generate a unique name.
Return token's start column
Return the stream from tokens are being pulled at
the moment.
Returns the entire text input to the lexer.
Returns the entire text input to the lexer.
Returns the entire text input to the lexer.
Get the first child of this node; null if no children
Get the first child of this node; null if no children
Get the first child of this node; null if not children
Return a ptr to the hidden token appearing immediately after
token t in the input stream.
Return a ptr to the hidden token appearing immediately before
token t in the input stream.
Return the first hidden token if one appears
before any monitored token.
return the Tokenizer (needed by ParseView)
Determine the language used for this run of ANTLR
This was made a method so the subclass can override it
Get derivation and return how many you did (less than requested for
subtree roots.
Do a step-first walk, building up a buffer of tokens until
you've reached a particular step and print out any rule subroots
insteads of descending.
Get derivation and return how many you did (less than requested for
subtree roots.
Walk parse tree and return requested number of derivation steps.
Generate a lookahead test expression for an alternate.
Generate a lookahead test expression for an alternate.
Generate a lookahead test expression for an alternate.
Generate a lookahead test expression for an alternate.
Generate a depth==1 lookahead test expression given the BitSet.
Generate a depth==1 lookahead test expression given the BitSet.
Generate a depth==1 lookahead test expression given the BitSet.
Generate a depth==1 lookahead test expression given the BitSet.
Returns a clean error message (no line number/column information)
Returns a clean error message (no line number/column information)
Returns a clean error message (no line number/column information)
Returns a clean error message (no line number/column information)
Simple token manager doesn't have a name -- must be set externally
Get the name of the token manager
Get the next sibling in line after this one
Get the next sibling in line after this one
Get the next sibling in line after this one
Get number of children of this node; if leaf, returns 0
Get number of children of this node; if leaf, returns 0
How many children does this node have?
Returns the offset information for the token
Returns the offset information for the token
Returns the offset information for the token
Get the printwriter manager that manages output
Return an expression for testing a contiguous renage of elements
Return an expression for testing a contiguous renage of elements
Return an expression for testing a contiguous renage of elements
Return an expression for testing a contiguous renage of elements
Find ranges in a set element array.
Get the token text for this node
Get the token text for this node
Get the token text for this node
return a copy of the current text buffer
Get the token text for this node
Return an array of strings that maps token ID to it's text.
Get a token symbol by index
Get a token string by index
Get the TokenSymbol for a string
Get the TokenSymbol for a string
Get a token symbol by index
Get an enumerator over the symbol table
Get an enumerator over the symbol table
Helper method that returns the name of the interface/class/enum type for
token type constants.
If the user specifies a tokens{} section with heterogeneous
AST node types, then ANTLR generates code to fill
this mapping.
Get the token type for this node
Get the token type for this node
Get the token type for this node
Get the token type for this node
Get the token vocabulary (read-only).
Get the token vocabulary (read-only).
A Grammar holds a set of rules (which are stored
in a symbol table).
The grammar for which we generate code
A GrammarAnalyzer computes lookahead from Grammar (which contains
a grammar symbol table) and can then answer questions about the
grammar.
A GrammarAtom is either a token ref, a character ref, or string.
A GrammarElement is a generic node in our
data structure that holds a grammar in memory.
Stores header action, grammar preamble, file options, and
list of grammars in the file
A GrammarSymbol is a generic symbol that can be
added to the symbol table for a grammar.
Grows the set to a larger number of bits.
Are we guessing (guessing>0)?
Are we guessing (guessing>0)?