Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
AstNodeBrowser |
AstNodeSkippingPolicy
Specific Ast node types that can tell whether they should be skipped from being attached to the AST or not.
|
AstNodeType
Each AST Node has a type which can be for instance the Rule of a Grammar, a language keyword or a language special token like a WORD.
|
AstVisitor |
CommentAnalyser |
Comments
Utility class to manipulate comment tokens
|
GenericTokenType |
Grammar |
LexerOutput |
PreprocessingDirective |
Preprocessor2
A Preprocessor can be used to modify the content of the LexerOuput before launching the parser.
|
PreprocessorAction
This class encapsulates the actions to be performed by a preprocessor.
|
RecognitionException
If a parsing error is encountered, an exception which implements this RecognitionException is thrown by the Parser.
|
RecognitionExceptionListener
A RecognitionExceptionListener must be used to be notified of parsing error
|
Rule
A Rule describes a context free grammar syntactic rule.
|
Token
Tokens are string of character like an identifier, a literal, an integer, ...
|
Token.Builder |
TokenType |
Trivia |
Trivia.TriviaKind |
Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
Grammar |
LexerOutput |
Preprocessor
A preprocessor is a component which can alter the stream of Token and Trivia.
The supported operations are injection and deletion. |
Preprocessor2
A Preprocessor can be used to modify the content of the LexerOuput before launching the parser.
|
RecognitionException
If a parsing error is encountered, an exception which implements this RecognitionException is thrown by the Parser.
|
RecognitionExceptionListener
A RecognitionExceptionListener must be used to be notified of parsing error
|
Rule
A Rule describes a context free grammar syntactic rule.
|
Token
Tokens are string of character like an identifier, a literal, an integer, ...
|
Trivia |
Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
AstNodeSkippingPolicy
Specific Ast node types that can tell whether they should be skipped from being attached to the AST or not.
|
AstNodeType
Each AST Node has a type which can be for instance the Rule of a Grammar, a language keyword or a language special token like a WORD.
|
AstVisitor |
Class and Description |
---|
TokenType |
Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
Token
Tokens are string of character like an identifier, a literal, an integer, ...
|
Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
AstNodeSkippingPolicy
Specific Ast node types that can tell whether they should be skipped from being attached to the AST or not.
|
AstNodeType
Each AST Node has a type which can be for instance the Rule of a Grammar, a language keyword or a language special token like a WORD.
|
Grammar |
Rule
A Rule describes a context free grammar syntactic rule.
|
Token
Tokens are string of character like an identifier, a literal, an integer, ...
|
TokenType |
Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
AstNodeType
Each AST Node has a type which can be for instance the Rule of a Grammar, a language keyword or a language special token like a WORD.
|
Grammar |
Rule
A Rule describes a context free grammar syntactic rule.
|
TokenType |
Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
AstNodeType
Each AST Node has a type which can be for instance the Rule of a Grammar, a language keyword or a language special token like a WORD.
|
AstVisitor |
Comments
Utility class to manipulate comment tokens
|
Token
Tokens are string of character like an identifier, a literal, an integer, ...
|
Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
Class and Description |
---|
Preprocessor2
A Preprocessor can be used to modify the content of the LexerOuput before launching the parser.
|
Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
Token
Tokens are string of character like an identifier, a literal, an integer, ...
|
Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
AstNodeSkippingPolicy
Specific Ast node types that can tell whether they should be skipped from being attached to the AST or not.
|
AstNodeType
Each AST Node has a type which can be for instance the Rule of a Grammar, a language keyword or a language special token like a WORD.
|
Rule
A Rule describes a context free grammar syntactic rule.
|
TokenType |
Class and Description |
---|
AstNode
the parser is in charge to construct an abstract syntax tree (AST) which is a tree representation of the abstract syntactic structure of
source code.
|
Grammar |
Rule
A Rule describes a context free grammar syntactic rule.
|
Token
Tokens are string of character like an identifier, a literal, an integer, ...
|
TokenType |
Copyright © 2012 SonarSource. All Rights Reserved.