Lines Matching full:token
757 // Ideally, token parser would be a nice class... Once, when I have
959 // enabling rules to start with a non-token character a < b
1003 // that case we would have to complicate the token hasher, which I do not
1105 and negative), a reset token, a baseCE, nextCE, and previousCE. The lists and
1107 2 As you process, you keep a LAST pointer that points to the last token you
1115 // Unfortunately, this won't work, as we store addresses of lhs in token
1329 // a new reset token with constructed name
1332 // We need to construct a new token which will be the anchor
1541 /* if the token was a variable top, we're gonna put it in */
1550 // if both of them are in effect for a token, they are combined.
1557 } else if(sourceToken->expansion == 0) { /* if there is no expansion, implicit is just added to the token */
1573 // if the previous token was a reset before, the strength of this
1574 // token must match the strength of before. Otherwise we have an
1588 /* if the previous token was also a reset, */
