42 fprintf(
features,
"---- Unifications and Features ----\n\n");
44 fprintf(
features,
"add feature: %d\n\n",Aadd);
46 fprintf(
features,
"unify: %d\n",Aunif);
67 void rec_print_feat(n)
73 rec_print_feat(n->left);
81 rec_print_feat(n->right);
88 void print_features(u)
107 same=check_equal(u->left,v) &&
109 check_equal(u->right,v);
117 void arity_unify(u,v)
150 void arity_merge(u,v)
ptr_node find(long comp, char *keystr, ptr_node tree)
find