Those are useless: the priorities are already known within the data
structure without those extra nodes.
Signed-off-by: Etienne Bergeron <etienneb@google.com>
Signed-off-by: Mathieu Desnoyers <mathieu.desnoyers@efficios.com>
UNARY_SIGNED_CONSTANT,
UNARY_UNSIGNED_CONSTANT,
UNARY_SBRAC,
- UNARY_NESTED,
} type;
union {
/*
int64_t signed_constant;
uint64_t unsigned_constant;
struct ctf_node *sbrac_exp;
- struct ctf_node *nested_exp;
} u;
enum {
UNARY_LINK_UNKNOWN = 0,
}
| LPAREN unary_expression RPAREN
{
- $$ = make_node(scanner, NODE_UNARY_EXPRESSION);
- $$->u.unary_expression.type = UNARY_NESTED;
- $$->u.unary_expression.u.nested_exp = $2;
+ $$ = $2;
}
| postfix_expression LSBRAC unary_expression RSBRAC
{
if (ret)
return ret;
break;
- case UNARY_NESTED:
- node->u.unary_expression.u.nested_exp->parent = node;
- ret = ctf_visitor_unary_expression(fd, depth + 1,
- node->u.unary_expression.u.nested_exp);
- if (ret)
- return ret;
- break;
case UNARY_UNKNOWN:
default:
print_tabs(fd, depth);
fprintf(fd, "</unary_expression_sbrac>\n");
break;
- case UNARY_NESTED:
- print_tabs(fd, depth);
- fprintf(fd, "<unary_expression_nested>\n");
- ret = ctf_visitor_print_unary_expression(fd, depth + 1,
- node->u.unary_expression.u.nested_exp);
- if (ret)
- return ret;
- print_tabs(fd, depth);
- fprintf(fd, "</unary_expression_nested>\n");
- break;
case UNARY_UNKNOWN:
default: