/*************************************************************************//*                                                                       *//*                  Language Technologies Institute                      *//*                     Carnegie Mellon University                        *//*                        Copyright (c) 2000                             *//*                        All Rights Reserved.                           *//*                                                                       *//*  Permission is hereby granted, free of charge, to use and distribute  *//*  this software and its documentation without restriction, including   *//*  without limitation the rights to use, copy, modify, merge, publish,  *//*  distribute, sublicense, and/or sell copies of this work, and to      *//*  permit persons to whom this work is furnished to do so, subject to   *//*  the following conditions:                                            *//*   1. The code must retain the above copyright notice, this list of    *//*      conditions and the following disclaimer.                         *//*   2. Any modifications must be clearly marked as such.                *//*   3. Original authors' names are not deleted.                         *//*   4. The authors' names are not used to endorse or promote products   *//*      derived from this software without specific prior written        *//*      permission.                                                      *//*                                                                       *//*  CARNEGIE MELLON UNIVERSITY AND THE CONTRIBUTORS TO THIS WORK         *//*  DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING      *//*  ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT   *//*  SHALL CARNEGIE MELLON UNIVERSITY NOR THE CONTRIBUTORS BE LIABLE      *//*  FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES    *//*  WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN   *//*  AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,          *//*  ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF       *//*  THIS SOFTWARE.                                                       *//*                                                                       *//*************************************************************************//*             Author:  Alan W Black (awb@cs.cmu.edu)                    *//*               Date:  January 2000                                     *//*************************************************************************//*                                                                       *//*  CART tree support                                                    *//*                                                                       *//*************************************************************************/ #include "cst_regex.h"#include "cst_cart.h" CST_VAL_REGISTER_TYPE_NODEL(cart,cst_cart) /* Make this 1 if you want to debug some cart calls */#define CART_DEBUG 0 #define cst_cart_node_n(P,TREE) ((TREE)->rule_table[P]) void delete_cart(cst_cart *cart){    /* have to compensate for previous over-zealous consting */    /* It is assume that given carts, can be freed (i.e. they aren't in */    /* in the data segment */    int i;     if (cart == NULL)        return;     for (i=0; cart->rule_table[i].val; i++)        delete_val((cst_val *)(void *)cart->rule_table[i].val);    cst_free((void *)cart->rule_table);     for (i=0; cart->feat_table[i]; i++)        cst_free((void *)cart->feat_table[i]);    cst_free((void *)cart->feat_table);     cst_free(cart);     return;} #define cst_cart_node_val(n,tree) (cst_cart_node_n(n,tree).val)#define cst_cart_node_op(n,tree) (cst_cart_node_n(n,tree).op)#define cst_cart_node_feat(n,tree) (tree->feat_table[cst_cart_node_n(n,tree).feat])#define cst_cart_node_yes(n,tree) (n+1)#define cst_cart_node_no(n,tree) (cst_cart_node_n(n,tree).no_node) #if CART_DEBUGstatic void cart_print_node(int n, const cst_cart *tree){    printf("%s ",cst_cart_node_feat(n,tree));    if (cst_cart_node_op(n,tree) == CST_CART_OP_IS)	printf("IS ");    else if (cst_cart_node_op(n,tree) == CST_CART_OP_LESS)	printf("< ");    else if (cst_cart_node_op(n,tree) == CST_CART_OP_GREATER)	printf("> ");    else if (cst_cart_node_op(n,tree) == CST_CART_OP_IN)	printf("IN ");    else if (cst_cart_node_op(n,tree) == CST_CART_OP_MATCHES)	printf("MATCHES ");    else	printf("*%d* ",cst_cart_node_op(n,tree));    val_print(stdout,cst_cart_node_val(n,tree));    printf("\n");}#endif const cst_val *cart_interpret(cst_item *item, const cst_cart *tree){    /* Tree interpretation */    const cst_val *v=0;    const cst_val *tree_val;    const char *tree_feat = "";    cst_features *fcache;    int r=0;    int node=0;     fcache = new_features_local(item_utt(item)->ctx);     while (cst_cart_node_op(node,tree) != CST_CART_OP_LEAF)    {#if CART_DEBUG 	cart_print_node(node,tree);#endif	tree_feat = cst_cart_node_feat(node,tree); 	v = get_param_val(fcache,tree_feat,0);	if (v == 0)	{	    v = ffeature(item,tree_feat);	    feat_set(fcache,tree_feat,v);	} #if CART_DEBUG	val_print(stdout,v); printf("\n");#endif	tree_val = cst_cart_node_val(node,tree);	if (cst_cart_node_op(node,tree) == CST_CART_OP_IS)        {            /* printf("awb_debug %d %d\n",CST_VAL_TYPE(v),CST_VAL_TYPE(tree_val));*/	    r = val_equal(v,tree_val);        }	else if (cst_cart_node_op(node,tree) == CST_CART_OP_LESS)	    r = val_less(v,tree_val);	else if (cst_cart_node_op(node,tree) == CST_CART_OP_GREATER)	    r = val_greater(v,tree_val);	else if (cst_cart_node_op(node,tree) == CST_CART_OP_IN)	    r = val_member(v,tree_val);	else if (cst_cart_node_op(node,tree) == CST_CART_OP_MATCHES)	    r = cst_regex_match(cst_regex_table[val_int(tree_val)],				val_string(v));	else	{	    cst_errmsg("cart_interpret_question: unknown op type %d\n",		       cst_cart_node_op(node,tree));	    cst_error();	} 	if (r)	{   /* Oh yes it is */#if CART_DEBUG            printf("   YES\n");#endif	    node = cst_cart_node_yes(node,tree);	}	else	{   /* Oh no it isn't */#if CART_DEBUG            printf("   NO\n");#endif	    node = cst_cart_node_no(node,tree);	}    }     delete_features(fcache);     return cst_cart_node_val(node,tree);	 }