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.10 2007-05-01 12:12:34 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 static void ccl_pquery_indent(WRBUF w, struct ccl_rpn_node *p, int indent);
88 static void ccl_pquery_complex(WRBUF w, struct ccl_rpn_node *p, int indent)
90 int sep_char = indent == -1 ? ' ' : '\n';
91 int next_indent = indent == -1 ? indent : indent+1;
95 wrbuf_puts(w, "@and");
101 wrbuf_puts(w, "@not");
104 if (p->u.p[2] && p->u.p[2]->kind == CCL_RPN_TERM)
106 const char *cp = p->u.p[2]->u.t.term;
107 /* exlusion distance ordered relation which-code unit-code */
110 /* word order specified */
111 if (isdigit(((const unsigned char *) cp)[1]))
112 wrbuf_printf(w, "@prox 0 %s 1 2 k 2", cp+1);
114 wrbuf_printf(w, "@prox 0 1 1 2 k 2");
118 /* word order not specified */
119 if (isdigit(((const unsigned char *) cp)[1]))
120 wrbuf_printf(w, "@prox 0 %s 0 2 k 2", cp+1);
122 wrbuf_printf(w, "@prox 0 1 0 2 k 2");
126 wrbuf_puts(w, "@prox 0 2 0 1 k 2");
129 wrbuf_puts(w, "@ bad op (unknown)");
131 wrbuf_putc(w, sep_char);
132 ccl_pquery_indent(w, p->u.p[0], next_indent);
133 ccl_pquery_indent(w, p->u.p[1], next_indent);
136 static void ccl_prterm(WRBUF w, const char *term)
139 wrbuf_puts(w, "\"\"");
142 const char *cp = term;
145 if (*cp == ' ' || *cp == '\\')
153 static void ccl_pquery_indent(WRBUF w, struct ccl_rpn_node *p, int indent)
155 struct ccl_rpn_attr *att;
162 for (i = 0; i < indent; i++)
171 ccl_pquery_complex(w, p, indent);
174 wrbuf_puts(w, "@set ");
175 ccl_prterm(w, p->u.setname);
180 for (att = p->u.t.attr_list; att; att = att->next)
183 wrbuf_puts(w, "@attr ");
186 wrbuf_puts(w, att->set);
191 case CCL_RPN_ATTR_NUMERIC:
192 sprintf(tmpattr, "%d=%d ", att->type, att->value.numeric);
193 wrbuf_puts(w, tmpattr);
195 case CCL_RPN_ATTR_STRING:
196 sprintf(tmpattr, "%d=", att->type);
197 wrbuf_puts(w, tmpattr);
198 wrbuf_puts(w, att->value.str);
203 ccl_prterm(w, p->u.t.term);
210 void ccl_pquery(WRBUF w, struct ccl_rpn_node *p)
212 ccl_pquery_indent(w, p, -1);
215 void ccl_pr_tree(struct ccl_rpn_node *rpn, FILE *fd_out)
217 WRBUF w = wrbuf_alloc();
219 ccl_pquery_indent(w, rpn, 0);
221 fputs(wrbuf_cstr(w), fd_out);
228 * indent-tabs-mode: nil
230 * vim: shiftwidth=4 tabstop=8 expandtab