Lines Matching refs:d
83 * memory. The goal is not to create the world's fastest parser anyway. I'd like
315 for ($d = 0, $count = \count($this->decisionToDFA); $d < $count; $d++) {
316 $decisionState = $this->atn->getDecisionState($d);
319 $this->decisionToDFA[$d] = new DFA($decisionState, $d);
330 'adaptivePredict decision %d exec LA(1)==%s line %d:%d',
363 'predictATN decision %d exec LA(1)==%s, outerContext=%s',
465 'execATN decision %d exec LA(1)==%s line %d:%d',
668 'SLL altSubSets=[%s], previous=%s, configs=%s, predict=%d, allSubsetsConflict=%s, conflictingAlts=%s',
738 // OR'd together like {p}? || NONE == NONE. If neither alt has preds,
804 'LL altSubSets=%s, predict=%d, resolvesToJustOneViableAlt=%d',
1560 $this->log[] = \sprintf('PREDICT %d', $pair->alt);
1836 * a. empty (we'd fall out of expr to do a global FOLLOW which could
1855 * decision point, decision d=2, compute-start-state performs
2059 $this->log[] = \sprintf('ACTION edge %d:%d', $t->ruleIndex, $t->actionIndex);
2074 'PRED (collectPredicates=%s) %d>=_p, ctx dependent=true',
2132 'PRED (collectPredicates=%s) %d:%d, ctx dependent=%s',
2280 return \sprintf('%s<%d>', $displayName, $t);
2426 'reportAttemptingFullContext decision = %d:%s, input = %s',
2457 'reportContextSensitivity decision = %d:%s, input = %s',