Lines Matching full:alternative

98      * configuration sets don't resolve to the same alternative (e.g.
110      * unless we see a state that only has one alternative associated with it.
119      * node because alternative to has another way to continue, via `[6|2|[]]`.
126      * However, alternative 3 will be able to continue and so we do not stop
247      * uncertainty as to which alternative we will ultimately pick, after
249      * that everything is going to resolve to the same minimum alternative. That
263      * You can compute the alternative subsets in one pass as follows:
278      * the union of these alternative subsets is a singleton, then no amount of
279      * more lookahead will help us. We will always pick that alternative. If,
280      * however, there is more than one alternative, then we are uncertain which
281      * alternative to predict and must continue looking for resolution. We may
305      * associated with lowest alternative `i`vis the superset, then `i` is the
308      * configuration for `j` is not in conflict with alternative `i`. The algorithm
319      * Continue if union of resolved alternative sets from non-conflicting and
320      * conflicting alternative subsets has more than one alternative. We are
321      * uncertain about which alternative to predict.
332      * - no conflicts and more than 1 alternative in set => continue
355      * have more than one alternative and all `A_i` are the same. If
371      * Determines if every alternative subset in `altsets` contains more
372      * than one alternative.
374      * @param array<BitSet> $altsets a collection of alternative subsets
385      * Determines if any single alternative subset in `altsets` contains
386      * exactly one alternative.
388      * @param array<BitSet> $altsets a collection of alternative subsets
405      * Determines if any single alternative subset in `altsets` contains
406      * more than one alternative.
408      * @param array<BitSet> $altsets a collection of alternative subsets
425      * Determines if every alternative subset in `altsets` is equivalent.
427      * @param array<BitSet> $altsets a collection of alternative subsets
448      * Returns the unique alternative predicted by all alternative subsets in
449      * `altsets`. If no such alternative exists, this method returns
452      * @param array<BitSet> $altsets a collection of alternative subsets
467      * alternative subsets. This method returns the union of each {@see BitSet}
470      * @param array<BitSet> $altsets a collection of alternative subsets.