link-grammar-5.8.0/link-grammar/parse/prune.c
/**
 * This returns TRUE if the right table of word w contains
 * a connector that can match to c.  shallow tells if c is shallow.
 */
This returns TRUE if the right table of word w contains
a connector that can match to c.  shallow tells if c is shallow.
This returns TRUE if the right table of word w contains a connector that can match to c . shallow tells if c is shallow .
static bool
right_table_search(prune_context *pc, int w, Connector *c,
                   bool shallow, int word_c)
{
	power_table *pt = pc->pt;
	unsigned int size = pt->r_table_size[w];
	C_list **e = get_power_table_entry(size, pt->r_table[w], c);
	for (C_list *cl = *e; cl != NULL; cl = cl->next)
	{
		if (!shallow && !cl->c->shallow) return false;
		if (possible_connection(pc, cl->c, c, w, word_c))
			return true;
	}
	return false;
}
static bool right_table_search ( prune_context * pc , int w , Connector * c , bool shallow , int word_c ) { power_table * pt = pc -> pt ; unsigned int size = pt -> r_table_size [ w ] ; C_list * * e = get_power_table_entry ( size , pt -> r_table [ w ] , c ) ; for ( C_list * cl = * e ; cl != NULL ; cl = cl -> next ) { if ( ! shallow && ! cl -> c -> shallow ) return false ; if ( possible_connection ( pc , cl -> c , c , w , word_c ) ) return true ; } return false ; }
This returns TRUE if the right table of word w contains
 a connector that can match to c.  shallow tells if c is shallow.
This returns TRUE if the right table of word w contains a connector that can match to c . shallow tells if c is shallow .
/* Two deep connectors can't work */