T_LIST
case T_LIST:
arglist->t != T_LIST &&
arglist->t != T_LIST &&
if (arglist->t == T_LIST &&
if (arglist->t == T_LIST &&
(arglist->t != T_LIST ||
if (arglist->t == T_LIST &&
if (arglist->t != T_LIST ||
if (arglist->t == T_LIST &&
if (lhs->u.arrow.rhs->t == T_LIST) {
case T_LIST:
np->u.arrow.lhs->t != T_LIST &&
} else if (np->t == T_LIST) {
ASSERTinfo(np->t == T_EVENT || np->t == T_LIST || np->t == T_ARROW,
} else if (np->t == T_LIST) {
case T_LIST:
case T_LIST:
case T_LIST:
if (lhs->t == T_LIST) {
if (rhs->t == T_LIST) {
else if (np->t == T_LIST) {
{ $$ = tree_expr(T_LIST, $1, $2); }
{ $$ = tree_expr(T_LIST, $1, $3); }
{ $$ = tree_expr(T_LIST, $1, $3); }
{ $$ = tree_expr(T_LIST, $1, $3); }
{ $$ = tree_expr(T_LIST, $1, $3); }
L_DECL(T_LIST);
case T_LIST:
(np->u.expr.left->t != T_LIST ||
case T_LIST: return L_T_LIST;
np->t == T_LIST) {
case T_LIST:
case T_LIST:
case T_LIST:
} else if (np->t == T_LIST) {
case T_LIST: /* comma-separated list */
if (np->t == T_LIST) {
case T_LIST:
ASSERTinfo(np->t == T_LIST, ptree_nodetype2str(np->t));
ASSERTinfo(np->t == T_LIST, ptree_nodetype2str(np->t));
case T_LIST:
case T_LIST:
case T_LIST:
case T_LIST:
case T_LIST:
if (slst->t == T_LIST) {
if (dlst->t == T_LIST) {
case T_LIST:
case T_LIST:
case T_LIST:
case T_LIST:
ASSERT(np->t == T_LIST);