+ Node *node = (Node *) malloc (sizeof (Node));
+ node->term.isNterm = 0;
+ node->term.parents = 0;
+ node->term.text = text;
+ return node;
+}
+
+static void
+free_node (Node *node)
+{
+ if (!node)
+ return;
+ node->nodeInfo.parents -= 1;
+ /* Free only if 0 (last parent) or -1 (no parents). */
+ if (node->nodeInfo.parents > 0)
+ return;
+ if (node->nodeInfo.isNterm == 1)
+ {
+ free_node (node->nterm.children[0]);
+ free_node (node->nterm.children[1]);
+ free_node (node->nterm.children[2]);
+ }
+ else
+ free (node->term.text);
+ free (node);
+}
+
+static char *
+node_to_string (Node *node)
+{
+ char *child0;
+ char *child1;
+ char *child2;
+ char *buffer;
+ if (!node)
+ {
+ buffer = (char *) malloc (1);
+ buffer[0] = 0;
+ }
+ else if (node->nodeInfo.isNterm == 1)
+ {
+ child0 = node_to_string (node->nterm.children[0]);
+ child1 = node_to_string (node->nterm.children[1]);
+ child2 = node_to_string (node->nterm.children[2]);
+ buffer = (char *) malloc (strlen (node->nterm.form) + strlen (child0)
+ + strlen (child1) + strlen (child2) + 1);
+ sprintf (buffer, node->nterm.form, child0, child1, child2);
+ free (child0);
+ free (child1);
+ free (child2);
+ }
+ else
+ buffer = strdup (node->term.text);
+ return buffer;
+}
+
+]]
+m4_bmatch([$2], [stmtMerge],
+[[static YYSTYPE
+stmtMerge (YYSTYPE x0, YYSTYPE x1)
+{
+ return new_nterm ("<OR>(%s,%s)", x0, x1, YY_NULL);