Lines Matching full:lookahead
862 // * Choice nodes have 1-character lookahead.
2379 // Alternative 0 is the negative lookahead, alternative 1 is what comes
2391 // Alternative 0 is the negative lookahead, alternative 1 is what comes
2938 // Alternative 0 is the negative lookahead, alternative 1 is what comes
2947 // If the negative lookahead is always going to fail then
3071 BoyerMooreLookahead* lookahead = bm_info(not_at_start);
3072 if (lookahead == NULL) {
3086 if (lookahead->at(0)->is_non_word())
3088 if (lookahead->at(0)->is_word())
3671 // Find the longest range of lookahead that has the fewest number of different
4005 BoyerMooreLookahead* lookahead = bm_info(not_at_start);
4006 if (lookahead == NULL) {
4021 skip_was_emitted = lookahead->EmitSkipInstructions(macro_assembler);
5023 // lookahead in one side and an end-of-input on the other side.
5024 // We need two registers for the lookahead.
5100 // We use a ChoiceNode for a negative lookahead because it has most of
5101 // the characteristics we need. It has the body of the lookahead as its
5102 // first alternative and the expression after the lookahead of the second
5107 // for a negative lookahead. The NegativeLookaheadChoiceNode is a special
