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 parsing of a CCL FIND query.
49 * This source file implements parsing of a CCL Query (ISO8777).
50 * The parser uses predictive parsing, but it does several tokens
51 * of lookahead in the handling of relational operations.. So
52 * it's not really pure.
56 /* CCL find (to rpn conversion)
59 * $Id: cclfind.c,v 1.11 2007-04-26 21:45:17 adam Exp $
63 * Revision 1.16 1996/01/08 08:41:13 adam
64 * Removed unused function.
66 * Revision 1.15 1995/07/20 08:14:34 adam
67 * Qualifiers were observed too often. Instead tokens are treated as
68 * qualifiers only when separated by comma.
70 * Revision 1.14 1995/05/16 09:39:26 adam
73 * Revision 1.13 1995/04/17 09:31:42 adam
74 * Improved handling of qualifiers. Aliases or reserved words.
76 * Revision 1.12 1995/03/20 15:27:43 adam
79 * Revision 1.11 1995/02/23 08:31:59 adam
82 * Revision 1.9 1995/02/16 13:20:06 adam
85 * Revision 1.8 1995/02/14 19:59:42 adam
86 * Removed a syntax error.
88 * Revision 1.7 1995/02/14 19:55:10 adam
89 * Header files ccl.h/cclp.h are gone! They have been merged an
90 * moved to ../include/ccl.h.
91 * Node kind(s) in ccl_rpn_node have changed names.
93 * Revision 1.6 1995/02/14 16:20:55 adam
94 * Qualifiers are read from a file now.
96 * Revision 1.5 1995/02/14 14:12:41 adam
97 * Ranges for ordered qualfiers implemented (e.g. pd=1980-1990).
99 * Revision 1.4 1995/02/14 13:16:29 adam
100 * Left and/or right truncation implemented.
102 * Revision 1.3 1995/02/14 10:25:56 adam
103 * The constructions 'qualifier rel term ...' implemented.
105 * Revision 1.2 1995/02/13 15:15:07 adam
106 * Added handling of qualifiers. Not finished yet.
108 * Revision 1.1 1995/02/13 12:35:20 adam
109 * First version of CCL. Qualifiers aren't handled yet.
118 /* returns type of current lookahead */
119 #define KIND (cclp->look_token->kind)
121 /* move one token forward */
122 #define ADVANCE cclp->look_token = cclp->look_token->next
125 * qual_val_type: test for existance of attribute type/value pair.
126 * qa: Attribute array
127 * type: Type of attribute to search for
128 * value: Value of attribute to seach for
129 * return: 1 if found; 0 otherwise.
131 static int qual_val_type (struct ccl_rpn_attr **qa, int type, int value,
135 struct ccl_rpn_attr *q;
139 for (i = 0; (q=qa[i]); i++)
142 if (q->type == type && q->kind == CCL_RPN_ATTR_NUMERIC &&
143 q->value.numeric == value)
155 * strxcat: concatenate strings.
156 * n: Null-terminated Destination string
157 * src: Source string to be appended (not null-terminated)
158 * len: Length of source string.
160 static void strxcat (char *n, const char *src, int len)
170 * copy_token_name: Return copy of CCL token name
171 * tp: Pointer to token info.
172 * return: malloc(3) allocated copy of token name.
174 static char *copy_token_name (struct ccl_token *tp)
176 char *str = (char *)xmalloc (tp->len + 1);
178 memcpy (str, tp->name, tp->len);
184 * mk_node: Create RPN node.
185 * kind: Type of node.
186 * return: pointer to allocated node.
188 struct ccl_rpn_node *ccl_rpn_node_create(enum ccl_rpn_kind kind)
190 struct ccl_rpn_node *p;
191 p = (struct ccl_rpn_node *)xmalloc (sizeof(*p));
198 p->u.t.attr_list = 0;
208 * ccl_rpn_delete: Delete RPN tree.
209 * rpn: Pointer to tree.
211 void ccl_rpn_delete (struct ccl_rpn_node *rpn)
213 struct ccl_rpn_attr *attr, *attr1;
221 ccl_rpn_delete (rpn->u.p[0]);
222 ccl_rpn_delete (rpn->u.p[1]);
225 xfree (rpn->u.t.term);
226 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
229 if (attr->kind == CCL_RPN_ATTR_STRING)
230 xfree(attr->value.str);
237 xfree (rpn->u.setname);
240 ccl_rpn_delete (rpn->u.p[0]);
241 ccl_rpn_delete (rpn->u.p[1]);
242 ccl_rpn_delete (rpn->u.p[2]);
248 static struct ccl_rpn_node *find_spec (CCL_parser cclp,
249 struct ccl_rpn_attr **qa);
251 static int is_term_ok (int look, int *list)
253 for (;*list >= 0; list++)
259 static struct ccl_rpn_node *search_terms (CCL_parser cclp,
260 struct ccl_rpn_attr **qa);
262 static struct ccl_rpn_attr *add_attr_node (struct ccl_rpn_node *p,
263 const char *set, int type)
265 struct ccl_rpn_attr *n;
267 n = (struct ccl_rpn_attr *)xmalloc (sizeof(*n));
270 n->set = xstrdup(set);
274 n->next = p->u.t.attr_list;
275 p->u.t.attr_list = n;
281 * add_attr_numeric: Add attribute (type/value) to RPN term node.
282 * p: RPN node of type term.
283 * type: Type of attribute
284 * value: Value of attribute
285 * set: Attribute set name
287 void ccl_add_attr_numeric(struct ccl_rpn_node *p, const char *set,
290 struct ccl_rpn_attr *n;
292 n = add_attr_node(p, set, type);
293 n->kind = CCL_RPN_ATTR_NUMERIC;
294 n->value.numeric = value;
297 void ccl_add_attr_string(struct ccl_rpn_node *p, const char *set,
298 int type, char *value)
300 struct ccl_rpn_attr *n;
302 n = add_attr_node(p, set, type);
303 n->kind = CCL_RPN_ATTR_STRING;
304 n->value.str = xstrdup(value);
309 * search_term: Parse CCL search term.
311 * qa: Qualifier attributes already applied.
312 * term_list: tokens we accept as terms in context
313 * multi: whether we accept "multiple" tokens
314 * return: pointer to node(s); NULL on error.
316 static struct ccl_rpn_node *search_term_x (CCL_parser cclp,
317 struct ccl_rpn_attr **qa,
318 int *term_list, int multi)
320 struct ccl_rpn_node *p_top = 0;
321 struct ccl_token *lookahead = cclp->look_token;
325 const char *truncation_aliases;
328 ccl_qual_search_special(cclp->bibset, "truncation");
329 if (!truncation_aliases)
330 truncation_aliases = "?";
332 if (qual_val_type (qa, CCL_BIB1_STR, CCL_BIB1_STR_AND_LIST, 0))
334 if (qual_val_type (qa, CCL_BIB1_STR, CCL_BIB1_STR_OR_LIST, 0))
338 struct ccl_rpn_node *p;
344 int relation_value = -1;
345 int position_value = -1;
346 int structure_value = -1;
347 int truncation_value = -1;
348 int completeness_value = -1;
351 if (and_list || or_list || !multi)
354 /* ignore commas when dealing with and-lists .. */
355 if (and_list && lookahead && lookahead->kind == CCL_TOK_COMMA)
357 lookahead = lookahead->next;
361 /* go through each TERM token. If no truncation attribute is yet
362 met, then look for left/right truncation markers (?) and
363 set left_trunc/right_trunc/mid_trunc accordingly */
364 for (no = 0; no < max && is_term_ok(lookahead->kind, term_list); no++)
366 for (i = 0; i<lookahead->len; i++)
367 if (lookahead->name[i] == ' ')
369 else if (strchr(truncation_aliases, lookahead->name[i]))
371 if (no == 0 && i == 0 && lookahead->len >= 1)
373 else if (!is_term_ok(lookahead->next->kind, term_list) &&
374 i == lookahead->len-1 && i >= 1)
379 len += 1+lookahead->len+lookahead->ws_prefix_len;
380 lookahead = lookahead->next;
384 break; /* no more terms . stop . */
390 p = ccl_rpn_node_create(CCL_RPN_OR);
392 p = ccl_rpn_node_create(CCL_RPN_AND);
394 p = ccl_rpn_node_create(CCL_RPN_AND);
399 /* create the term node, but wait a moment before adding the term */
400 p = ccl_rpn_node_create(CCL_RPN_TERM);
401 p->u.t.attr_list = NULL;
404 /* make the top node point to us.. */
411 /* go through all attributes and add them to the attribute list */
412 for (i=0; qa && qa[i]; i++)
414 struct ccl_rpn_attr *attr;
416 for (attr = qa[i]; attr; attr = attr->next)
419 case CCL_RPN_ATTR_STRING:
420 ccl_add_attr_string(p, attr->set, attr->type,
423 case CCL_RPN_ATTR_NUMERIC:
424 if (attr->value.numeric > 0)
425 { /* deal only with REAL attributes (positive) */
429 if (relation_value != -1)
431 relation_value = attr->value.numeric;
434 if (position_value != -1)
436 position_value = attr->value.numeric;
439 if (structure_value != -1)
441 structure_value = attr->value.numeric;
444 if (truncation_value != -1)
446 truncation_value = attr->value.numeric;
447 left_trunc = right_trunc = mid_trunc = 0;
450 if (completeness_value != -1)
452 completeness_value = attr->value.numeric;
455 ccl_add_attr_numeric(p, attr->set, attr->type,
456 attr->value.numeric);
460 /* len now holds the number of characters in the RPN term */
461 /* no holds the number of CCL tokens (1 or more) */
463 if (structure_value == -1 &&
464 qual_val_type (qa, CCL_BIB1_STR, CCL_BIB1_STR_WP, &attset))
465 { /* no structure attribute met. Apply either structure attribute
466 WORD or PHRASE depending on number of CCL tokens */
467 if (no == 1 && no_spaces == 0)
468 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 2);
470 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 1);
473 /* make the RPN token */
474 p->u.t.term = (char *)xmalloc (len);
475 ccl_assert (p->u.t.term);
476 p->u.t.term[0] = '\0';
477 for (i = 0; i<no; i++)
479 const char *src_str = cclp->look_token->name;
480 int src_len = cclp->look_token->len;
482 if (i == 0 && left_trunc)
487 if (i == no-1 && right_trunc)
489 if (i && cclp->look_token->ws_prefix_len)
491 size_t len = strlen(p->u.t.term);
492 memcpy(p->u.t.term + len, cclp->look_token->ws_prefix_buf,
493 cclp->look_token->ws_prefix_len);
494 p->u.t.term[len + cclp->look_token->ws_prefix_len] = '\0';
496 strxcat (p->u.t.term, src_str, src_len);
499 if (left_trunc && right_trunc)
501 if (!qual_val_type (qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH,
504 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
508 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 3);
510 else if (right_trunc)
512 if (!qual_val_type (qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT,
515 cclp->error_code = CCL_ERR_TRUNC_NOT_RIGHT;
519 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 1);
523 if (!qual_val_type (qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT,
526 cclp->error_code = CCL_ERR_TRUNC_NOT_LEFT;
530 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 2);
534 if (qual_val_type (qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE,
536 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 100);
542 cclp->error_code = CCL_ERR_TERM_EXPECTED;
546 static struct ccl_rpn_node *search_term (CCL_parser cclp,
547 struct ccl_rpn_attr **qa)
549 static int list[] = {CCL_TOK_TERM, CCL_TOK_COMMA, -1};
550 return search_term_x(cclp, qa, list, 0);
554 struct ccl_rpn_node *qualifiers_order (CCL_parser cclp,
555 struct ccl_rpn_attr **ap, char *attset)
558 struct ccl_rpn_node *p;
560 if (cclp->look_token->len == 1)
562 if (cclp->look_token->name[0] == '<')
564 else if (cclp->look_token->name[0] == '=')
566 else if (cclp->look_token->name[0] == '>')
569 else if (cclp->look_token->len == 2)
571 if (!memcmp (cclp->look_token->name, "<=", 2))
573 else if (!memcmp (cclp->look_token->name, ">=", 2))
575 else if (!memcmp (cclp->look_token->name, "<>", 2))
580 cclp->error_code = CCL_ERR_BAD_RELATION;
583 ADVANCE; /* skip relation */
585 qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, 0))
587 /* allow - inside term and treat it as range _always_ */
588 /* relation is =. Extract "embedded" - to separate terms */
589 if (KIND == CCL_TOK_TERM)
592 for (i = 0; i<cclp->look_token->len; i++)
594 if (cclp->look_token->name[i] == '-')
598 if (cclp->look_token->len > 1 && i == 0)
600 struct ccl_token *ntoken = ccl_token_add (cclp->look_token);
602 ntoken->kind = CCL_TOK_TERM;
603 ntoken->name = cclp->look_token->name + 1;
604 ntoken->len = cclp->look_token->len - 1;
606 cclp->look_token->len = 1;
607 cclp->look_token->name = "-";
609 else if (cclp->look_token->len > 1 && i == cclp->look_token->len-1)
611 struct ccl_token *ntoken = ccl_token_add (cclp->look_token);
613 ntoken->kind = CCL_TOK_TERM;
617 (cclp->look_token->len)--;
619 else if (cclp->look_token->len > 2 && i < cclp->look_token->len)
621 struct ccl_token *ntoken1 = ccl_token_add (cclp->look_token);
622 struct ccl_token *ntoken2 = ccl_token_add (ntoken1);
624 ntoken1->kind = CCL_TOK_TERM; /* generate - */
628 ntoken2->kind = CCL_TOK_TERM; /* generate yy */
629 ntoken2->name = cclp->look_token->name + (i+1);
630 ntoken2->len = cclp->look_token->len - (i+1);
632 cclp->look_token->len = i; /* adjust xx */
634 else if (i == cclp->look_token->len &&
635 cclp->look_token->next &&
636 cclp->look_token->next->kind == CCL_TOK_TERM &&
637 cclp->look_token->next->len > 1 &&
638 cclp->look_token->next->name[0] == '-')
641 /* we _know_ that xx does not have - in it */
642 struct ccl_token *ntoken = ccl_token_add (cclp->look_token);
644 ntoken->kind = CCL_TOK_TERM; /* generate - */
648 (ntoken->next->name)++; /* adjust yy */
649 (ntoken->next->len)--;
655 KIND == CCL_TOK_TERM &&
656 cclp->look_token->next && cclp->look_token->next->len == 1 &&
657 cclp->look_token->next->name[0] == '-')
659 struct ccl_rpn_node *p1;
660 if (!(p1 = search_term (cclp, ap)))
662 ADVANCE; /* skip '-' */
663 if (KIND == CCL_TOK_TERM) /* = term - term ? */
665 struct ccl_rpn_node *p2;
667 if (!(p2 = search_term (cclp, ap)))
672 p = ccl_rpn_node_create(CCL_RPN_AND);
674 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
676 ccl_add_attr_numeric(p2, attset, CCL_BIB1_REL, 2);
681 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
686 cclp->look_token->len == 1 &&
687 cclp->look_token->name[0] == '-') /* = - term ? */
690 if (!(p = search_term (cclp, ap)))
692 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, 2);
695 else if (KIND == CCL_TOK_LP)
698 if (!(p = find_spec (cclp, ap)))
700 if (KIND != CCL_TOK_RP)
702 cclp->error_code = CCL_ERR_RP_EXPECTED;
711 if (!(p = search_terms (cclp, ap)))
713 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, rel);
716 cclp->error_code = CCL_ERR_TERM_EXPECTED;
721 struct ccl_rpn_node *qualifiers2 (CCL_parser cclp, struct ccl_rpn_attr **ap)
724 struct ccl_rpn_node *p;
726 if (qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_ORDER, &attset)
727 || qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, &attset))
728 return qualifiers_order(cclp, ap, attset);
730 /* unordered relation */
731 if (KIND != CCL_TOK_EQ)
733 cclp->error_code = CCL_ERR_EQ_EXPECTED;
737 if (KIND == CCL_TOK_LP)
740 if (!(p = find_spec (cclp, ap)))
744 if (KIND != CCL_TOK_RP)
746 cclp->error_code = CCL_ERR_RP_EXPECTED;
753 p = search_terms (cclp, ap);
758 * qualifiers1: Parse CCL qualifiers and search terms.
760 * la: Token pointer to RELATION token.
761 * qa: Qualifier attributes already applied.
762 * return: pointer to node(s); NULL on error.
764 static struct ccl_rpn_node *qualifiers1 (CCL_parser cclp, struct ccl_token *la,
765 struct ccl_rpn_attr **qa)
767 struct ccl_token *lookahead = cclp->look_token;
768 struct ccl_token *look_start = cclp->look_token;
769 struct ccl_rpn_attr **ap;
770 struct ccl_rpn_node *node = 0;
771 const char *field_str;
779 cclp->error_code = CCL_ERR_DOUBLE_QUAL;
783 for (lookahead = cclp->look_token; lookahead != la;
784 lookahead=lookahead->next)
787 for (i=0; qa[i]; i++)
789 ap = (struct ccl_rpn_attr **)xmalloc ((no ? (no+1) : 2) * sizeof(*ap));
792 field_str = ccl_qual_search_special(cclp->bibset, "field");
795 if (!strcmp (field_str, "or"))
797 else if (!strcmp (field_str, "merge"))
802 /* consider each field separately and OR */
803 lookahead = look_start;
804 while (lookahead != la)
808 while ((ap[0] = ccl_qual_search (cclp, lookahead->name,
809 lookahead->len, seq)) != 0)
811 struct ccl_rpn_node *node_sub;
812 cclp->look_token = la;
814 node_sub = qualifiers2(cclp, ap);
817 ccl_rpn_delete (node);
823 struct ccl_rpn_node *node_this =
824 ccl_rpn_node_create(CCL_RPN_OR);
825 node_this->u.p[0] = node;
826 node_this->u.p[1] = node_sub;
835 cclp->look_token = lookahead;
836 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
840 lookahead = lookahead->next;
841 if (lookahead->kind == CCL_TOK_COMMA)
842 lookahead = lookahead->next;
847 /* merge attributes from ALL fields - including inherited ones */
850 struct ccl_rpn_node *node_sub;
852 lookahead = look_start;
853 for (i = 0; lookahead != la; i++)
855 ap[i] = ccl_qual_search (cclp, lookahead->name,
856 lookahead->len, seq);
859 if (!ap[i] && seq > 0)
860 ap[i] = ccl_qual_search (cclp, lookahead->name,
864 cclp->look_token = lookahead;
865 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
869 lookahead = lookahead->next;
870 if (lookahead->kind == CCL_TOK_COMMA)
871 lookahead = lookahead->next;
875 struct ccl_rpn_attr **qa0 = qa;
885 cclp->look_token = lookahead;
887 node_sub = qualifiers2(cclp, ap);
890 ccl_rpn_delete (node);
895 struct ccl_rpn_node *node_this =
896 ccl_rpn_node_create(CCL_RPN_OR);
897 node_this->u.p[0] = node;
898 node_this->u.p[1] = node_sub;
912 * search_terms: Parse CCL search terms - including proximity.
914 * qa: Qualifier attributes already applied.
915 * return: pointer to node(s); NULL on error.
917 static struct ccl_rpn_node *search_terms (CCL_parser cclp,
918 struct ccl_rpn_attr **qa)
920 static int list[] = {
921 CCL_TOK_TERM, CCL_TOK_COMMA,CCL_TOK_EQ, CCL_TOK_REL, CCL_TOK_SET, -1};
922 struct ccl_rpn_node *p1, *p2, *pn;
923 p1 = search_term_x (cclp, qa, list, 1);
928 if (KIND == CCL_TOK_PROX)
930 struct ccl_rpn_node *p_prox = 0;
931 /* ! word order specified */
932 /* % word order not specified */
933 p_prox = ccl_rpn_node_create(CCL_RPN_TERM);
934 p_prox->u.t.term = (char *) xmalloc(1 + cclp->look_token->len);
935 memcpy(p_prox->u.t.term, cclp->look_token->name,
936 cclp->look_token->len);
937 p_prox->u.t.term[cclp->look_token->len] = 0;
938 p_prox->u.t.attr_list = 0;
941 p2 = search_term_x (cclp, qa, list, 1);
947 pn = ccl_rpn_node_create(CCL_RPN_PROX);
953 else if (is_term_ok(KIND, list))
955 p2 = search_term_x (cclp, qa, list, 1);
961 pn = ccl_rpn_node_create(CCL_RPN_PROX);
974 * search_elements: Parse CCL search elements
976 * qa: Qualifier attributes already applied.
977 * return: pointer to node(s); NULL on error.
979 static struct ccl_rpn_node *search_elements (CCL_parser cclp,
980 struct ccl_rpn_attr **qa)
982 struct ccl_rpn_node *p1;
983 struct ccl_token *lookahead;
984 if (KIND == CCL_TOK_LP)
987 p1 = find_spec (cclp, qa);
990 if (KIND != CCL_TOK_RP)
992 cclp->error_code = CCL_ERR_RP_EXPECTED;
999 else if (KIND == CCL_TOK_SET)
1002 if (KIND == CCL_TOK_EQ)
1004 if (KIND != CCL_TOK_TERM)
1006 cclp->error_code = CCL_ERR_SETNAME_EXPECTED;
1009 p1 = ccl_rpn_node_create(CCL_RPN_SET);
1010 p1->u.setname = copy_token_name (cclp->look_token);
1014 lookahead = cclp->look_token;
1016 while (lookahead->kind==CCL_TOK_TERM)
1018 lookahead = lookahead->next;
1019 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
1020 return qualifiers1 (cclp, lookahead, qa);
1021 if (lookahead->kind != CCL_TOK_COMMA)
1023 lookahead = lookahead->next;
1026 return search_terms (cclp, qa);
1029 struct ccl_rpn_attr *qa[2];
1030 struct ccl_rpn_node *node = 0;
1032 lookahead = cclp->look_token;
1035 for(seq = 0; ;seq++)
1037 struct ccl_rpn_node *node_sub;
1038 qa[0] = ccl_qual_search(cclp, "term", 4, seq);
1042 cclp->look_token = lookahead;
1044 node_sub = search_terms (cclp, qa);
1047 ccl_rpn_delete (node);
1052 struct ccl_rpn_node *node_this =
1053 ccl_rpn_node_create(CCL_RPN_OR);
1054 node_this->u.p[0] = node;
1055 node_this->u.p[1] = node_sub;
1056 node_this->u.p[2] = 0;
1063 node = search_terms (cclp, 0);
1069 * find_spec: Parse CCL find specification
1071 * qa: Qualifier attributes already applied.
1072 * return: pointer to node(s); NULL on error.
1074 static struct ccl_rpn_node *find_spec (CCL_parser cclp,
1075 struct ccl_rpn_attr **qa)
1077 struct ccl_rpn_node *p1, *p2, *pn;
1078 if (!(p1 = search_elements (cclp, qa)))
1086 p2 = search_elements (cclp, qa);
1089 ccl_rpn_delete (p1);
1092 pn = ccl_rpn_node_create(CCL_RPN_AND);
1100 p2 = search_elements (cclp, qa);
1103 ccl_rpn_delete (p1);
1106 pn = ccl_rpn_node_create(CCL_RPN_OR);
1114 p2 = search_elements (cclp, qa);
1117 ccl_rpn_delete (p1);
1120 pn = ccl_rpn_node_create(CCL_RPN_NOT);
1132 struct ccl_rpn_node *ccl_parser_find_str(CCL_parser cclp, const char *str)
1134 struct ccl_rpn_node *p;
1135 struct ccl_token *list = ccl_parser_tokenize(cclp, str);
1136 p = ccl_parser_find_token(cclp, list);
1137 ccl_token_del(list);
1141 struct ccl_rpn_node *ccl_parser_find_token(CCL_parser cclp,
1142 struct ccl_token *list)
1144 struct ccl_rpn_node *p;
1146 cclp->look_token = list;
1147 p = find_spec (cclp, NULL);
1148 if (p && KIND != CCL_TOK_EOL)
1150 if (KIND == CCL_TOK_RP)
1151 cclp->error_code = CCL_ERR_BAD_RP;
1153 cclp->error_code = CCL_ERR_OP_EXPECTED;
1157 cclp->error_pos = cclp->look_token->name;
1159 cclp->error_code = CCL_ERR_OK;
1161 cclp->error_code = cclp->error_code;
1166 * ccl_find_str: Parse CCL find - string representation
1167 * bibset: Bibset to be used for the parsing
1168 * str: String to be parsed
1169 * error: Pointer to integer. Holds error no. on completion.
1170 * pos: Pointer to char position. Holds approximate error position.
1171 * return: RPN tree on successful completion; NULL otherwise.
1173 struct ccl_rpn_node *ccl_find_str(CCL_bibset bibset, const char *str,
1174 int *error, int *pos)
1176 CCL_parser cclp = ccl_parser_create (bibset);
1177 struct ccl_token *list;
1178 struct ccl_rpn_node *p;
1180 list = ccl_parser_tokenize (cclp, str);
1181 p = ccl_parser_find_token(cclp, list);
1183 *error = cclp->error_code;
1185 *pos = cclp->error_pos - str;
1186 ccl_parser_destroy (cclp);
1187 ccl_token_del (list);
1193 * indent-tabs-mode: nil
1195 * vim: shiftwidth=4 tabstop=8 expandtab