Lines Matching refs:lookahead
45 * (using the current state and the current lookahead Symbol as indexes) to
51 * table is consulted (using the new state and current lookahead Symbol as
269 /** The current lookahead Symbol. */
415 * @param cur_token the current lookahead Symbol.
427 * @param cur_token the current lookahead Symbol.
845 * found, then we fail. Next a small number of "lookahead" or "parse
851 * to "parse ahead" though the buffered lookahead Symbols. The "parse ahead"
875 /* read ahead to create lookahead we can parse multiple times */
889 if (lookahead[0].sym == EOF_sym())
904 /* do the real parse (including actions) across the lookahead */
982 protected Symbol lookahead[];
984 /** Position in lookahead input buffer used for "parse ahead". */
989 /** Read from input to establish our buffer of "parse ahead" lookahead
994 /* create the lookahead array */
995 lookahead = new Symbol[error_sync_size()];
1000 lookahead[i] = cur_token;
1010 /** Return the current lookahead in our error "parse ahead" buffer. */
1011 protected Symbol cur_err_token() { return lookahead[lookahead_pos]; }
1036 lookahead[i-1] = lookahead[i];
1040 lookahead[error_sync_size()-1] = cur_token;
1049 * stack configuration using stored lookahead input and a virtual parse
1051 * lookahead input without error. This basically simulates the action of
1066 /* parse until we fail or get past the lookahead input */
1119 /** Parse forward using stored lookahead Symbols. In this case we have
1120 * already verified that parsing will make it through the stored lookahead
1151 /* continue until we accept or have read all lookahead input */