Lines Matching full:we
43 * DFA did not have a previous accept state. In this case, we use the
206 // As we move src->trg, src->trg, we keep track of the previous trg to
208 // If the previous target was already part of the DFA, we might
211 // creating a DFA state. Once we know s!=null, we check to see if
212 // the DFA state has an edge already for t. If so, we can just reuse
216 // computing reach/closure sets. Technically, once we know that
217 // we have a previously added DFA state, we could jump over to
299 // if we don't find an existing DFA state
304 // we got nowhere on t from s
306 // we got nowhere on t, don't throw out this knowledge; it'd
311 // stop when we can't match any more char
356 * we can reach upon input `t`. Parameter `reach` is a return parameter.
583 // Track traversing semantic predicates. If we traverse,
584 // we cannot add a DFA state for this "reach" computation
598 // states reached by traversing predicates. Since this is when we
599 // test them, we cannot cash the DFA state target of ID.
629 // additional modifications are needed before we can support
736 * TJP notes: next time through the DFA, we see a pred again and eval.
738 * state, we can continue in pure DFA mode from there.
777 * an ATN rule stop state. Later, when traversing the DFA, we will know