T_EVENT
if (arglist->t != T_EVENT) {
ASSERTinfo(np->t == T_EVENT, ptree_nodetype2str(np->t));
case T_EVENT:
np->u.arrow.lhs->t != T_EVENT) {
else if (np->t == T_EVENT) {
if (np->t != T_EVENT)
if (np->t != T_EVENT)
case T_EVENT:
ASSERTinfo(np->t == T_EVENT || np->t == T_LIST || np->t == T_ARROW,
if (np->t == T_EVENT) {
case T_EVENT:
case T_EVENT:
ASSERT(engnp->t == T_EVENT);
if (arrow->u.arrow.lhs->u.arrow.rhs->t != T_EVENT)
case T_EVENT:
ASSERT(lhs->t == T_EVENT);
ASSERT(rhs->t == T_EVENT);
if (np->t == T_EVENT) {
{ $$ = tree_decl(T_EVENT, $2, $3, $1.file, $1.line); }
L_DECL(T_EVENT);
case T_EVENT:
case T_EVENT: return L_T_EVENT;
else if (np->t == T_EVENT)
ASSERT(serd->t == T_EVENT);
case T_EVENT:
ASSERTinfo(np1->t == T_EVENT, ptree_nodetype2str(np1->t));
ASSERTinfo(np2->t == T_EVENT, ptree_nodetype2str(np2->t));
case T_EVENT:
case T_EVENT:
case T_EVENT:
ret = newnode(T_EVENT, ename->file, ename->line);
case T_EVENT:
case T_EVENT: /* class@path{expr} */
case T_EVENT:
ASSERTinfo(np->t == T_EVENT, ptree_nodetype2str(np->t));
ASSERTinfo(snp->t == T_EVENT, ptree_nodetype2str(snp->t));
np = newnode(T_EVENT, NULL, 0);
case T_EVENT:
case T_EVENT:
case T_EVENT: {
case T_EVENT:
ASSERTeq(fromev->t, T_EVENT, ptree_nodetype2str);
ASSERTeq(toev->t, T_EVENT, ptree_nodetype2str);
ret = newnode(T_EVENT, oldnode->file, oldnode->line);
ASSERT(orhs->t == T_EVENT);
case T_EVENT:
searcheventnode.t = T_EVENT;
ASSERTeq(np->t, T_EVENT, ptree_nodetype2str);
case T_EVENT:
case T_EVENT: