| Name | Description |
|---|---|
| AAST | This class represents the Attributed Abstract Syntax Tree corresponding to an input LEX file. |
| AAST.ReParser | NESTED CLASS This is a hand-written, recursive descent parser. No error recovery attempted, instead an exception is thrown and the parse abandoned. The exception catch handler transforms the exception into a regular error diagnostic. |
| Binary | |
| CharacterUtilities | This class supplies character escape utilities for project. |
| GplexInternalException | |
| Leaf | |
| LexCategory | |
| PredicateLeaf | |
| RegExDFS | |
| RegExException | |
| RegExTree | Abstract class for AST representing regular expressions. Concrete subclasses correspond to --- binary trees (context, alternation and concatenation) unary trees (closure, finite repetition and anchored patterns) leaf nodes (chars, char classes, literal strings and the eof marker) |
| RuleBuffer | |
| RuleDesc | |
| StartState | |
| StartStateScope | This class models the nested start-state scopes. |
| StringInterpretException | |
| StringUtilities | |
| Unary |