Lines Matching refs:token
31 /* Define a structure to hold a (keyword, token) pair */
34 u_short token; /* Associated Token */
35 follby followedby; /* nonzero indicates the next token(s)
263 char followedby; /* Forces next token(s) to T_String */
273 * array with one entry per token, and shrinking the char value to
283 char * symb[1024]; /* map token ID to symbolic name */
357 u_short token;
369 * token number for its terminal state, so the token identifier
376 token = ntp_keywords[i].token;
377 if (1 > token || token >= COUNTOF(sst)) {
383 token);
386 sst[token].finishes_token = token;
441 "entry %d finishes token %d\n",
458 * using the spelling of the keyword as its T_* token
511 * This function takes a suffix of a keyword, the token to be returned on
518 u_short token,
584 sst[my_state].finishes_token = (u_short)token;
587 if (sst[token].finishes_token != (u_short)token) {
590 token, symbname(token));
593 /* relocate so token id is sst[] index */
594 if (my_state != token) {
595 sst[token] = sst[my_state];
600 my_state = token;
610 token,
618 /* Define a function that takes a list of (keyword, token) values and
636 ntp_keywords[i].token,
654 /* sort ntp_keywords in token ID order */
658 lowest_id = ntp_keywords[0].token;
659 highest_id = ntp_keywords[COUNTOF(ntp_keywords) - 1].token;
669 while (id < ntp_keywords[i].token) {
696 if (p1->token == p2->token)
699 if (p1->token < p2->token)
720 * populate_symb() - populate symb[] lookup array with symbolic token
731 int token;
740 if (2 == sscanf(line, "#define %s %d", name, &token)
741 && 'T' == name[0] && '_' == name[1] && token >= 0
742 && token < COUNTOF(symb)) {
744 symb[token] = estrdup(name);
759 u_short token
764 if (token < COUNTOF(symb) && symb[token] != NULL) {
765 name = symb[token];
768 snprintf(name, LIB_BUFLENGTH, "%d", token);