T_NUM
if (arglist->u.expr.left->t != T_NUM &&
if (arglist->u.expr.right->t != T_NUM &&
if ((arglist->u.expr.left->t == T_NUM) &&
if ((arglist->u.expr.right->t == T_NUM) &&
if (np->t == T_NUM)
if (np->t != T_NUM)
if (np->t != T_NUM && np->t != T_FUNC)
case T_NUM:
case T_NUM:
if (np->u.name.child->t != T_NUM &&
np->u.name.child->t != T_NUM) {
case T_NUM:
L_DECL(T_NUM);
case T_NUM:
case T_NUM: return L_T_NUM;
case T_NUM:
case T_NUM:
case T_NUM:
struct node *ret = newnode(T_NUM, file, line);
ASSERT(rhs->u.name.child->t == T_NUM);
numn = newnode(T_NUM, NULL, 0);
case T_NUM: /* num (ull internally) */
if (np1f->u.name.child->t == T_NUM &&
if (np1t->u.name.child->t == T_NUM &&
newnode(T_NUM, np->file, np->line);
newnode(T_NUM, np->file, np->line);
newnp = newnode(T_NUM, np->file, np->line);
newnode(T_NUM, np->file, np->line);
case T_NUM:
newnp = newnode(T_NUM, np->file, np->line);
if (np1->u.name.child->t == T_NUM &&
case T_NUM:
if (lhs->u.name.child && lhs->u.name.child->t == T_NUM) {
if (rhs->u.name.child && rhs->u.name.child->t == T_NUM) {
ASSERT(nN->t == T_NUM);
if (nc->u.name.child == NULL || nc->u.name.child->t != T_NUM)
case T_NUM:
case T_NUM:
np->u.name.child->t == T_NUM)
namep->u.name.child->t == T_NUM)
if (np1->u.name.child->t == T_NUM &&
case T_NUM:
newnode(T_NUM, file, line);
newnp->u.name.child = newnode(T_NUM, oldepname->file,
npref->u.name.child->t != T_NUM) {
case T_NUM:
nrhs = newnode(T_NUM, orhs->file, orhs->line);
cpnode->u.name.child = newnode(T_NUM, NULL, 0);
else if (norknp->t == T_NUM)
cpnode->u.name.child = newnode(T_NUM, NULL, 0);
np->u.name.child->t == T_NUM) {
case T_NUM:
case T_NUM:
if (type == T_NUM)
ret = T_NUM;
if ((type == T_NUM) || (type == T_VAR)) {
exp = setop1(op, type == T_NUM ? num : 0, stk, flag);
if (type == T_NUM) {