|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
| Class Summary | |
|---|---|
| ActionLabel | |
| DecisionProbe | Collection of information about what is wrong with a decision as discovered while building the DFA predictor. |
| DFA | A DFA (converted from a grammar's NFA). |
| DFAOptimizer | A module to perform optimizations on DFAs. |
| DFAState | A DFA state represents a set of possible NFA configurations. |
| Label | A state machine transition label. |
| LL1Analyzer | Created by IntelliJ IDEA. |
| LL1DFA | A special DFA that is exactly LL(1) or LL(1) with backtracking mode predicates to resolve edge set collisions. |
| LookaheadSet | An LL(1) lookahead set; contains a set of token types and a "hasEOF" condition when the set contains EOF. |
| NFA | An NFA (collection of NFAStates) constructed from a grammar. |
| NFAConfiguration | An NFA state, predicted alt, and syntactic/semantic context. |
| NFAContext | A tree node for tracking the call chains for NFAs that invoke other NFAs. |
| NFAConversionThread | Convert all decisions i..j inclusive in a thread |
| NFAState | A state within an NFA. |
| NFAToDFAConverter | Code that embodies the NFA conversion to DFA. |
| PredicateLabel | |
| RuleClosureTransition | A transition used to reference another rule. |
| SemanticContext | A binary tree structure used to record the semantic context in which an NFA configuration is valid. |
| SemanticContext.AND | |
| SemanticContext.NOT | |
| SemanticContext.OR | |
| SemanticContext.Predicate | |
| SemanticContext.TruePredicate | |
| State | A generic state machine state. |
| StateCluster | A Cluster object points to the left/right (start and end) states of a state machine. |
| Transition | A generic transition between any two state machine states. |
| Exception Summary | |
|---|---|
| AnalysisRecursionOverflowException | An NFA configuration context stack overflowed. |
| AnalysisTimeoutException | Analysis took too long; bail out of entire DFA construction. |
| NonLLStarDecisionException | Used to abort DFA construction when we find non-LL(*) decision; i.e., a decision that has recursion in more than a single alt. |
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||