| Package | Description |
|---|---|
| com.sonar.sslr.api | |
| com.sonar.sslr.api.flow | |
| com.sonar.sslr.api.symbol | |
| com.sonar.sslr.impl | |
| com.sonar.sslr.impl.ast | |
| com.sonar.sslr.impl.channel | |
| com.sonar.sslr.impl.matcher | |
| com.sonarsource.cobol.api | |
| com.sonarsource.cobol.api.ast | |
| com.sonarsource.cobol.api.flow | |
| com.sonarsource.cobol.api.issue | |
| com.sonarsource.cobol.api.lexer | |
| com.sonarsource.cobol.api.symbol | |
| org.sonar.sslr.ast | |
| org.sonar.sslr.grammar |
API to define Parsing Expression Grammar.
|
| org.sonar.sslr.internal.ast.select | |
| org.sonar.sslr.internal.grammar |
Internals of Grammar API.
|
| org.sonar.sslr.internal.matchers |
Internals of Parser.
|
| org.sonar.sslr.internal.vm | |
| org.sonar.sslr.internal.vm.lexerful |
Members of this package must not be used from outside of SSLR.
|
| org.sonar.sslr.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.
|
| 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
Use
LexerfulGrammarBuilder to create instances of this class. |
| LexerOutput |
| Offsets |
| PreprocessingDirective
Deprecated.
in 1.20, use your own preprocessor API instead.
|
| Preprocessor2
A Preprocessor can be used to modify the content of the LexerOuput before launching the parser.
|
| PreprocessorAction
Deprecated.
in 1.20, use your own preprocessor API instead.
|
| RecognitionException
This class is not intended to be instantiated or subclassed by clients.
|
| RecognitionExceptionListener
Deprecated.
in 1.19, use
com.sonar.sslr.squid.AstScannerExceptionHandler from the SSLR Squid Bridge (2.3) |
| Rule
This interface is not intended to be implemented by clients.
|
| 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
Use
LexerfulGrammarBuilder to create instances of this class. |
| LexerOutput |
| Preprocessor
Deprecated.
in 1.20, use your own preprocessor API instead.
|
| Preprocessor2
A Preprocessor can be used to modify the content of the LexerOuput before launching the parser.
|
| RecognitionExceptionListener
Deprecated.
in 1.19, use
com.sonar.sslr.squid.AstScannerExceptionHandler from the SSLR Squid Bridge (2.3) |
| Rule
This interface is not intended to be implemented by clients.
|
| 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.
|
| 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
Use
LexerfulGrammarBuilder to create instances of this class. |
| Rule
This interface is not intended to be implemented by clients.
|
| 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
Use
LexerfulGrammarBuilder to create instances of this class. |
| Rule
This interface is not intended to be implemented by clients.
|
| 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 |
|---|
| 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 |
|---|
| 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.
|
| 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.
|
| Class and Description |
|---|
| 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
Use
LexerfulGrammarBuilder to create instances of this class. |
| 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.
|
| 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
Use
LexerfulGrammarBuilder to create instances of this class. |
| Rule
This interface is not intended to be implemented by clients.
|
| 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 |
|---|
| 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
This interface is not intended to be implemented by clients.
|
| Token
Tokens are string of character like an identifier, a literal, an integer, ...
|
| TokenType |
| Trivia.TriviaKind |
| Class and Description |
|---|
| 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.
|
| Grammar
Use
LexerfulGrammarBuilder to create instances of this class. |
| Rule
This interface is not intended to be implemented by clients.
|
| Token
Tokens are string of character like an identifier, a literal, an integer, ...
|
| TokenType |
Copyright © 2009–2017 SonarSource. All rights reserved.