Lines Matching refs:lookahead
20 * (using the current state and the current lookahead token as indexes) to
26 * table is consulted (using the new state and current lookahead token as
236 /** The current lookahead token. */
355 * @param cur_token the current lookahead token.
367 * @param cur_token the current lookahead token.
745 * found, then we fail. Next a small number of "lookahead" or "parse
751 * to "parse ahead" though the buffered lookahead tokens. The "parse ahead"
775 /* read ahead to create lookahead we can parse multiple times */
789 if (lookahead[0].sym == EOF_sym())
804 /* do the real parse (including actions) across the lookahead */
876 /** Lookahead tokens used for attempting error recovery "parse aheads". */
877 protected token lookahead[];
879 /** Position in lookahead input buffer used for "parse ahead". */
884 /** Read from input to establish our buffer of "parse ahead" lookahead
889 /* create the lookahead array */
890 lookahead = new token[error_sync_size()];
895 lookahead[i] = cur_token;
905 /** Return the current lookahead in our error "parse ahead" buffer. */
906 protected token cur_err_token() { return lookahead[lookahead_pos]; }
931 lookahead[i-1] = lookahead[i];
935 lookahead[error_sync_size()-1] = cur_token;
944 * stack configuration using stored lookahead input and a virtual parse
946 * lookahead input without error. This basically simulates the action of
961 /* parse until we fail or get past the lookahead input */
1014 /** Parse forward using stored lookahead symbols. In this case we have
1015 * already verified that parsing will make it through the stored lookahead
1046 /* continue until we accept or have read all lookahead input */
