Searched refs:lookaheads (Results 1 – 11 of 11) sorted by relevance
30 Value_t *lookaheads; variable145 lookaheads = NEW2(nstates + 1, Value_t); in initialize_LA()150 lookaheads[i] = (Value_t) k; in initialize_LA()155 lookaheads[nstates] = (Value_t) k; in initialize_LA()452 i = lookaheads[stateno]; in add_lookback_edge()453 k = lookaheads[stateno + 1]; in add_lookback_edge()539 n = lookaheads[nstates]; in compute_lookaheads()
5 lookaheads developed by Tom Pennello and Frank DeRemer. The algorithm is
59 larno = (unsigned)lookaheads[stateno]; in graph_state()
115 m = lookaheads[stateno]; in add_reductions()116 n = lookaheads[stateno + 1]; in add_reductions()
369 extern Value_t *lookaheads;
1093 FREE(lookaheads); in output_actions()
383 unsigned int lookaheads; member
780 if (pfile->lookaheads) in _cpp_lex_token()782 pfile->lookaheads--; in _cpp_lex_token()
1208 pfile->lookaheads += count; in _cpp_backup_tokens()
3746 (_cpp_handle_diretive): Don't save to lookaheads3750 (funlike_invocation_p): Don't save to lookaheads4036 and releasing lookaheads.
11143 (struct cpp_reader): Remove old lookahead stuff, add lookaheads.11147 (cpp_destroy): Don't free lookaheads.