Lines Matching defs:from

64  * from the start rule. If we get a conflict using full context, then we can
77  * We could cache results from full context to predicted alternative easily and
79  * of visible predicates from the ATN start state changes depending on the
432      * does the state have a conflict that would prevent us from
436      *      - add an edge from previous DFA state to potentially new DFA state, D,
871          *     from
1008              * because any configurations potentially added from that list are
1042      * Return a configuration set containing only the configurations from
1049      * state to see if a rule stop state is reachable from the configuration via
1055      *                                      epsilon-only transitions from each
1061      *                      from `configs` which are in a rule stop state.
1189      * Sam's fix: each config has flag indicating if it has returned from
1230      * reference `'a'` in `letterA` is reachable from the left edge
1234      * which stepped out to `prog` (and then back in to `statement` from being
1420      * the parser from successfully parsing the decision rule, which helps
1428      *                                        from the paper or the parser stack
1431      * @return int The value to return from {@see ParserATNSimulator::adaptivePredict()},
1671                     // While we have context to pop back from, we may have
1822      * from one of these cases:
1856      * closure starting at edges[0], edges[1] emanating from
1884      * Looking through expr from left edge of stat only has to confirm
2117             $this->log[] = \sprintf('Config from pred transition=%s', (string) $c);
2178             $this->log[] = \sprintf('Config from pred transition=%s', (string) $c);
2239     [1|1|[], 1|2|[], 8|3|[]]. This can come about from grammar:
2322      * present in the DFA. If `from` is `null`, or if `t` is outside the
2331      * @param DFAState|null $from The source state for the edge
2339     protected function addDFAEdge(DFA $dfa, ?DFAState $from, int $t, ?DFAState $to) : ?DFAState
2342             $this->log[] = \sprintf('EDGE %s -> %s upon %s', (string) $from, (string) $to, $this->getTokenName($t));
2351         if ($from === null || $t < -1 || $t > $this->atn->maxTokenType) {
2355         if ($from->edges === null) {
2356             $from->edges = new \SplFixedArray($this->atn->maxTokenType + 1 + 1);
2359         $from->edges[$t + 1] = $to;