Lines Matching defs:LL
33 * {@see PredictionMode::LL()} prediction mode), or it will report a syntax
38 * {@see PredictionMode::LL()} prediction abilities to complete successfully.
46 * The LL(*) prediction mode. This prediction mode allows the current parser
60 public const LL = 1;
63 * The LL(*) prediction mode with exact ambiguity detection. In addition to
64 * the correctness guarantees provided by the {@see PredictionMode::LL}
85 * - The usual SLL+LL fallback upon SLL conflict
86 * - Pure SLL without LL fallback
88 * COMBINED SLL+LL PARSING
90 * When LL-fallback is enabled upon SLL conflict, correct predictions are
92 * method. Due to the substantially higher cost of LL prediction, the
93 * prediction should only fall back to LL when the additional lookahead
96 * Assuming combined SLL+LL parsing, an SLL configuration set with only
97 * conflicting subsets should fall back to full LL, even if the
103 * Here's the prediction termination rule them: SLL (for SLL+LL parsing)
105 * full LL keeps going when there is uncertainty.
138 * PREDICATES IN SLL+LL PARSING
142 * semantic situations. In contrast, full LL evaluates predicates collected
179 // contexts if we can fail over to full LL; costs more time
195 // pure SLL or combined SLL+LL mode parsing
244 * Full LL prediction termination.
292 * predicates are evaluated on-the-fly for full LL prediction, ensuring that
356 * `A={{1,2}, {1,3}}`, then regular LL prediction would terminate