2 * Copyright (c) 1995, the EUROPAGATE consortium (see below).
4 * The EUROPAGATE consortium members are:
6 * University College Dublin
7 * Danmarks Teknologiske Videnscenter
8 * An Chomhairle Leabharlanna
9 * Consejo Superior de Investigaciones Cientificas
11 * Permission to use, copy, modify, distribute, and sell this software and
12 * its documentation, in whole or in part, for any purpose, is hereby granted,
15 * 1. This copyright and permission notice appear in all copies of the
16 * software and its documentation. Notices of copyright or attribution
17 * which appear at the beginning of any file must remain unchanged.
19 * 2. The names of EUROPAGATE or the project partners may not be used to
20 * endorse or promote products derived from this software without specific
21 * prior written permission.
23 * 3. Users of this software (implementors and gateway operators) agree to
24 * inform the EUROPAGATE consortium of their use of the software. This
25 * information will be used to evaluate the EUROPAGATE project and the
26 * software, and to plan further developments. The consortium may use
27 * the information in later publications.
29 * 4. Users of this software agree to make their best efforts, when
30 * documenting their use of the software, to acknowledge the EUROPAGATE
31 * consortium, and the role played by the software in their work.
33 * THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT WARRANTY OF ANY KIND,
34 * EXPRESS, IMPLIED, OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
35 * WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
36 * IN NO EVENT SHALL THE EUROPAGATE CONSORTIUM OR ITS MEMBERS BE LIABLE
37 * FOR ANY SPECIAL, INCIDENTAL, INDIRECT OR CONSEQUENTIAL DAMAGES OF
38 * ANY KIND, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA
39 * OR PROFITS, WHETHER OR NOT ADVISED OF THE POSSIBILITY OF DAMAGE, AND
40 * ON ANY THEORY OF LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE
41 * USE OR PERFORMANCE OF THIS SOFTWARE.
47 * \brief Implements CCL parse tree printing
49 * This source file implements functions to parse and print
50 * a CCL node tree (as a result of parsing).
53 /* CCL print rpn tree - infix notation
56 * $Id: cclptree.c,v 1.3 2004-10-15 00:18:59 adam Exp $
60 * Revision 1.6 1995/05/16 09:39:26 adam
63 * Revision 1.5 1995/02/23 08:31:59 adam
66 * Revision 1.3 1995/02/15 17:42:16 adam
67 * Minor changes of the api of this module. FILE* argument added
70 * Revision 1.2 1995/02/14 19:55:11 adam
71 * Header files ccl.h/cclp.h are gone! They have been merged an
72 * moved to ../include/ccl.h.
73 * Node kind(s) in ccl_rpn_node have changed names.
75 * Revision 1.1 1995/02/14 10:25:56 adam
76 * The constructions 'qualifier rel term ...' implemented.
86 void fprintSpaces(int indent,FILE * fd_out)
89 sprintf(buf,"%%%d.s",indent);
90 fprintf(fd_out,buf," ");
93 void ccl_pr_tree_as_qrpn(struct ccl_rpn_node *rpn, FILE *fd_out, int indent)
95 if(indent>0) fprintSpaces(indent,fd_out);
99 if (rpn->u.t.attr_list)
101 struct ccl_rpn_attr *attr;
102 for (attr = rpn->u.t.attr_list; attr; attr = attr->next)
105 fprintf(fd_out, "@attr %s ", attr->set);
107 fprintf(fd_out, "@attr ");
110 case CCL_RPN_ATTR_NUMERIC:
111 fprintf (fd_out, "%d=%d ", attr->type,
112 attr->value.numeric);
114 case CCL_RPN_ATTR_STRING:
115 fprintf (fd_out, "%d=%s ", attr->type,
120 fprintf (fd_out, "\"%s\"\n", rpn->u.t.term);
123 fprintf (fd_out, "@and \n");
124 ccl_pr_tree_as_qrpn (rpn->u.p[0], fd_out,indent+2);
125 ccl_pr_tree_as_qrpn (rpn->u.p[1], fd_out,indent+2);
128 fprintf (fd_out, "@or \n");
129 ccl_pr_tree_as_qrpn (rpn->u.p[0], fd_out,indent+2);
130 ccl_pr_tree_as_qrpn (rpn->u.p[1], fd_out,indent+2);
133 fprintf (fd_out, "@not ");
134 ccl_pr_tree_as_qrpn (rpn->u.p[0], fd_out,indent+2);
135 ccl_pr_tree_as_qrpn (rpn->u.p[1], fd_out,indent+2);
138 fprintf (fd_out, "set=%s ", rpn->u.setname);
141 if (rpn->u.p[2] && rpn->u.p[2]->kind == CCL_RPN_TERM)
143 const char *cp = rpn->u.p[2]->u.t.term;
144 /* exlusion distance ordered relation which-code unit-code */
147 /* word order specified */
149 fprintf(fd_out, "@prox 0 %s 1 2 known 2", cp+1);
151 fprintf(fd_out, "@prox 0 1 1 2 known 2");
155 /* word order not specified */
157 fprintf(fd_out, "@prox 0 %s 0 2 known 2", cp+1);
159 fprintf(fd_out, "@prox 0 1 0 2 known 2");
162 ccl_pr_tree_as_qrpn (rpn->u.p[0], fd_out,indent+2);
163 ccl_pr_tree_as_qrpn (rpn->u.p[1], fd_out,indent+2);
166 fprintf(stderr,"Internal Error Unknown ccl_rpn node type %d\n",rpn->kind);
171 void ccl_pr_tree (struct ccl_rpn_node *rpn, FILE *fd_out)
173 ccl_pr_tree_as_qrpn(rpn,fd_out,0);
177 static void ccl_pquery_complex (WRBUF w, struct ccl_rpn_node *p)
182 wrbuf_puts(w, "@and ");
185 wrbuf_puts(w, "@or ");
188 wrbuf_puts(w, "@not ");
191 if (p->u.p[2] && p->u.p[2]->kind == CCL_RPN_TERM)
193 const char *cp = p->u.p[2]->u.t.term;
194 /* exlusion distance ordered relation which-code unit-code */
197 /* word order specified */
199 wrbuf_printf(w, "@prox 0 %s 1 2 k 2 ", cp+1);
201 wrbuf_printf(w, "@prox 0 1 1 2 k 2 ");
205 /* word order not specified */
207 wrbuf_printf(w, "@prox 0 %s 0 2 k 2 ", cp+1);
209 wrbuf_printf(w, "@prox 0 1 0 2 k 2 ");
213 wrbuf_puts(w, "@prox 0 2 0 1 k 2 ");
216 wrbuf_puts(w, "@ bad op (unknown) ");
218 ccl_pquery(w, p->u.p[0]);
219 ccl_pquery(w, p->u.p[1]);
222 void ccl_pquery (WRBUF w, struct ccl_rpn_node *p)
224 struct ccl_rpn_attr *att;
233 ccl_pquery_complex (w, p);
236 wrbuf_puts (w, "@set ");
237 wrbuf_puts (w, p->u.setname);
241 for (att = p->u.t.attr_list; att; att = att->next)
244 wrbuf_puts (w, "@attr ");
247 wrbuf_puts (w, att->set);
252 case CCL_RPN_ATTR_NUMERIC:
253 sprintf(tmpattr, "%d=%d ", att->type, att->value.numeric);
254 wrbuf_puts (w, tmpattr);
256 case CCL_RPN_ATTR_STRING:
257 sprintf(tmpattr, "%d=", att->type);
258 wrbuf_puts (w, tmpattr);
259 wrbuf_puts(w, att->value.str);
264 for (cp = p->u.t.term; *cp; cp++)
266 if (*cp == ' ' || *cp == '\\')
267 wrbuf_putc (w, '\\');