T_ARROW
ASSERT(np->t == T_ARROW);
if (lhs->t == T_ARROW) {
case T_ARROW:
ASSERTinfo(np->t == T_ARROW, ptree_nodetype2str(np->t));
if (np->u.arrow.lhs->t != T_ARROW &&
ASSERTinfo(np->t == T_EVENT || np->t == T_LIST || np->t == T_ARROW,
} else if (np->t == T_ARROW) {
case T_ARROW:
case T_ARROW:
case T_ARROW:
L_DECL(T_ARROW);
case T_ARROW:
case T_ARROW: return L_T_ARROW;
else if (np->t == T_ARROW)
if (np->t == T_ARROW) {
case T_ARROW:
case T_ARROW:
case T_ARROW:
ret = newnode(T_ARROW,
case T_ARROW: /* lhs (N)->(K) rhs */
if (src->t == T_ARROW) {
case T_ARROW:
if (anp->u.arrow.lhs->t == T_ARROW) {
case T_ARROW:
ASSERTeq(anp->t, T_ARROW, ptree_nodetype2str);
if (slst->t == T_ARROW) {