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.
46 \brief Header with public definitions for CCL.
52 * $Id: ccl.h,v 1.23 2005-06-25 15:46:01 adam Exp $
56 * Revision 1.10 1996/01/08 08:41:22 adam
59 * Revision 1.9 1995/07/20 08:15:16 adam
60 * Bug fix: Token value for comma and OR were the same!
62 * Revision 1.8 1995/07/11 12:28:34 adam
63 * New function: ccl_token_simple (split into simple tokens) and
64 * ccl_token_del (delete tokens).
66 * Revision 1.7 1995/05/16 09:39:38 adam
69 * Revision 1.6 1995/05/11 14:04:03 adam
70 * Changes in the reading of qualifier(s). New function: ccl_qual_fitem.
71 * New variable ccl_case_sensitive, which controls whether reserved
72 * words and field names are case sensitive or not.
74 * Revision 1.5 1995/02/23 08:32:11 adam
77 * Revision 1.3 1995/02/16 13:20:10 adam
80 * Revision 1.2 1995/02/15 17:43:08 adam
81 * Minor changes to the ccl interface. Bug fix in iso2709 module.
83 * Revision 1.1 1995/02/14 19:55:21 adam
84 * Header files ccl.h/cclp.h are gone! They have been merged an
85 * moved to ../include/ccl.h.
92 #include <yaz/yconfig.h>
94 #include <yaz/xmalloc.h>
95 #include <yaz/wrbuf.h>
99 /* CCL error numbers */
101 #define CCL_ERR_TERM_EXPECTED 1
102 #define CCL_ERR_RP_EXPECTED 2
103 #define CCL_ERR_SETNAME_EXPECTED 3
104 #define CCL_ERR_OP_EXPECTED 4
105 #define CCL_ERR_BAD_RP 5
106 #define CCL_ERR_UNKNOWN_QUAL 6
107 #define CCL_ERR_DOUBLE_QUAL 7
108 #define CCL_ERR_EQ_EXPECTED 8
109 #define CCL_ERR_BAD_RELATION 9
110 #define CCL_ERR_TRUNC_NOT_LEFT 10
111 #define CCL_ERR_TRUNC_NOT_BOTH 11
112 #define CCL_ERR_TRUNC_NOT_RIGHT 12
114 /** attribute node (type, value) pair as used in RPN */
115 struct ccl_rpn_attr {
117 struct ccl_rpn_attr *next;
120 /** attribute type, Bib-1: 1=use, 2=relation, 3=position, .. */
122 /** attribute value type (numeric or string) */
124 #define CCL_RPN_ATTR_NUMERIC 1
125 #define CCL_RPN_ATTR_STRING 2
127 /** numeric attribute value */
129 /** string attribute value */
134 #define CCL_RPN_AND 1
136 #define CCL_RPN_NOT 3
137 #define CCL_RPN_TERM 4
138 #define CCL_RPN_SET 5
139 #define CCL_RPN_PROX 6
141 /** RPN tree structure node */
142 struct ccl_rpn_node {
143 /** RPN tree node type */
146 /** Boolean including proximity 0=left, 2=right, 3=prox parms */
147 struct ccl_rpn_node *p[3];
148 /** Attributes + Term */
151 struct ccl_rpn_attr *attr_list;
158 typedef struct ccl_qualifiers *CCL_bibset;
165 1-6 relation (<, <=, =, >=, >, <>)
171 3 any position in field
174 0 word/phrase auto select
181 100 date (un-normalized)
182 101 name (normalized)
183 102 name (un-normalized)
188 #define CCL_BIB1_USE 1
189 #define CCL_BIB1_REL 2
190 #define CCL_BIB1_POS 3
191 #define CCL_BIB1_STR 4
192 #define CCL_BIB1_TRU 5
193 #define CCL_BIB1_COM 6
195 #define CCL_BIB1_STR_WP (-1)
196 #define CCL_BIB1_STR_AND_LIST (-2)
197 #define CCL_BIB1_STR_OR_LIST (-3)
198 #define CCL_BIB1_REL_ORDER (-1)
199 #define CCL_BIB1_REL_PORDER (-2)
201 #define CCL_BIB1_TRU_CAN_LEFT (-1)
202 #define CCL_BIB1_TRU_CAN_RIGHT (-2)
203 #define CCL_BIB1_TRU_CAN_BOTH (-3)
204 #define CCL_BIB1_TRU_CAN_NONE (-4)
206 #define CCL_TOK_EOL 0
207 #define CCL_TOK_TERM 1
208 #define CCL_TOK_REL 2
210 #define CCL_TOK_PROX 4
213 #define CCL_TOK_COMMA 7
214 #define CCL_TOK_AND 8
216 #define CCL_TOK_NOT 10
217 #define CCL_TOK_SET 11
222 size_t len; /* length of name below */
223 const char *name; /* string / name of token */
224 struct ccl_token *next;
225 struct ccl_token *prev;
226 const char *ws_prefix_buf; /* leading white space buf */
227 size_t ws_prefix_len; /* leading white space len */
231 struct ccl_qualifier {
234 struct ccl_qualifier **sub;
235 struct ccl_rpn_attr *attr_list;
236 struct ccl_qualifier *next;
239 /** CCL parser structure */
241 /** current lookahead token */
242 struct ccl_token *look_token;
244 /** holds error code if error occur */
246 /** if error occurs, this holds position (starting from 0). */
247 const char *error_pos;
249 /** current bibset */
252 /** names of and operator */
254 /** names of or operator */
256 /** names of not operator */
258 /** names of set operator */
260 /** 1=CCL parser is case sensitive, 0=case insensitive */
261 int ccl_case_sensitive;
264 typedef struct ccl_parser *CCL_parser;
267 * Splits CCL command string into individual tokens using
271 struct ccl_token *ccl_parser_tokenize (CCL_parser cclp, const char *command);
274 * Splits CCL command string into tokens using temporary parser.
276 * Use ccl_parser_tokenize instead and provide a parser - it is
277 * more flexible and efficient.
280 struct ccl_token *ccl_tokenize (const char *command);
286 void ccl_token_del (struct ccl_token *list);
289 * Add single token after a given onde.
292 struct ccl_token *ccl_token_add (struct ccl_token *at);
295 * Parses a CCL Find command in a simple C string. Returns CCL parse
296 * tree node describing RPN if parsing is successful. If parsing is
297 * unsuccesful, NULL is returned and error and pos is set accordingly.
300 struct ccl_rpn_node *ccl_find_str (CCL_bibset bibset,
301 const char *str, int *error, int *pos);
304 * Parses CCL Find command from a list of CCL tokens. Otherwise similar to
308 struct ccl_rpn_node *ccl_find (CCL_bibset abibset, struct ccl_token *list,
309 int *error, const char **pos);
312 * Parses a CCL Find command from a list of CCL tokens and given a CCL
313 * parser. Otherwise similar to ccl_find_str.
316 struct ccl_rpn_node *ccl_parser_find (CCL_parser cclp, struct ccl_token *list);
318 /** Set names for AND operator in parser */
320 void ccl_parser_set_op_and (CCL_parser p, const char *op);
322 /** Set names for OR operator in parser */
324 void ccl_parser_set_op_or (CCL_parser p, const char *op);
326 /** Set names for ANDNOT operator in parser */
328 void ccl_parser_set_op_not (CCL_parser p, const char *op);
330 /** Set names for ResultSet in parser */
332 void ccl_parser_set_op_set (CCL_parser p, const char *op);
334 /** Set case sensitivity for parser */
336 void ccl_parser_set_case (CCL_parser p, int case_sensitivity_flag);
338 /** Return english-readable error message for CCL parser error number */
340 const char *ccl_err_msg (int ccl_errno);
342 /** Delete RPN tree returned by ccl_find */
344 void ccl_rpn_delete (struct ccl_rpn_node *rpn);
346 /** Dump RPN tree in readable format to fd_out */
348 void ccl_pr_tree (struct ccl_rpn_node *rpn, FILE *fd_out);
350 /** Add qualifier and supply attribute pairs for it */
352 void ccl_qual_add (CCL_bibset b, const char *name, int no, int *attr);
354 /** Add qualifier and supply attributes pairs+attribute set for it */
356 void ccl_qual_add_set (CCL_bibset b, const char *name, int no,
357 int *type, int *value, char **svalue, char **attsets);
359 /** Add special qualifier */
361 void ccl_qual_add_special (CCL_bibset bibset, const char *n, const char *v);
363 /** Add combo qualifier */
365 void ccl_qual_add_combi (CCL_bibset b, const char *n, const char *names);
367 /** Read CCL qualifier list spec from file inf */
369 void ccl_qual_file (CCL_bibset bibset, FILE *inf);
371 /** Read CCL qualifier list spec from file inf */
373 int ccl_qual_fname (CCL_bibset bibset, const char *fname);
375 /** Add CCL qualifier as buf spec (multiple lines). */
377 void ccl_qual_buf(CCL_bibset bibset, const char *buf);
379 /** Add CCL qualifier as line spec. Note: line is _modified_ */
381 void ccl_qual_line(CCL_bibset bibset, char *line);
383 /* Add CCL qualifier by using qual_name + value pair */
385 void ccl_qual_fitem (CCL_bibset bibset, const char *value,
386 const char *qual_name);
388 /** Make CCL qualifier set */
390 CCL_bibset ccl_qual_mk (void);
392 /** Delete CCL qualifier set */
394 void ccl_qual_rm (CCL_bibset *b);
396 /** Char-to-upper function */
397 extern int (*ccl_toupper)(int c);
399 /** CCL version of ccl_stricmp */
401 int ccl_stricmp (const char *s1, const char *s2);
403 /** CCL version of ccl_memicmp */
405 int ccl_memicmp (const char *s1, const char *s2, size_t n);
407 /** Search for qualifier 'name' in set 'b'. */
409 struct ccl_rpn_attr *ccl_qual_search (CCL_parser cclp, const char *name,
410 size_t len, int seq);
412 /** Create CCL parser */
414 CCL_parser ccl_parser_create (void);
416 /** Destroy CCL parser */
418 void ccl_parser_destroy (CCL_parser p);
420 /** String dup utility (ala strdup) */
422 char *ccl_strdup (const char *str);
424 /** Search for special qualifier */
426 const char *ccl_qual_search_special (CCL_bibset b,
428 /** Pretty-print CCL RPN node tree to WRBUF */
430 void ccl_pquery (WRBUF w, struct ccl_rpn_node *p);
433 #define ccl_assert(x) ;
443 * indent-tabs-mode: nil
445 * vim: shiftwidth=4 tabstop=8 expandtab