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.14 2007-05-01 12:22:11 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(ccl_qualifier_t *qa, int type, int value,
138 for (i = 0; qa[i]; i++)
140 struct ccl_rpn_attr *q = ccl_qual_get_attr(qa[i]);
143 if (q->type == type && q->kind == CCL_RPN_ATTR_NUMERIC &&
144 q->value.numeric == value)
157 * strxcat: concatenate strings.
158 * n: Null-terminated Destination string
159 * src: Source string to be appended (not null-terminated)
160 * len: Length of source string.
162 static void strxcat(char *n, const char *src, int len)
172 * copy_token_name: Return copy of CCL token name
173 * tp: Pointer to token info.
174 * return: malloc(3) allocated copy of token name.
176 static char *copy_token_name(struct ccl_token *tp)
178 char *str = (char *)xmalloc(tp->len + 1);
180 memcpy(str, tp->name, tp->len);
186 * mk_node: Create RPN node.
187 * kind: Type of node.
188 * return: pointer to allocated node.
190 struct ccl_rpn_node *ccl_rpn_node_create(enum ccl_rpn_kind kind)
192 struct ccl_rpn_node *p;
193 p = (struct ccl_rpn_node *)xmalloc(sizeof(*p));
200 p->u.t.attr_list = 0;
211 * ccl_rpn_delete: Delete RPN tree.
212 * rpn: Pointer to tree.
214 void ccl_rpn_delete(struct ccl_rpn_node *rpn)
216 struct ccl_rpn_attr *attr, *attr1;
224 ccl_rpn_delete(rpn->u.p[0]);
225 ccl_rpn_delete(rpn->u.p[1]);
228 xfree(rpn->u.t.term);
229 xfree(rpn->u.t.qual);
230 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
233 if (attr->kind == CCL_RPN_ATTR_STRING)
234 xfree(attr->value.str);
241 xfree(rpn->u.setname);
244 ccl_rpn_delete(rpn->u.p[0]);
245 ccl_rpn_delete(rpn->u.p[1]);
246 ccl_rpn_delete(rpn->u.p[2]);
252 static struct ccl_rpn_node *find_spec(CCL_parser cclp, ccl_qualifier_t *qa);
254 static int is_term_ok(int look, int *list)
256 for (;*list >= 0; list++)
262 static struct ccl_rpn_node *search_terms(CCL_parser cclp, ccl_qualifier_t *qa);
264 static struct ccl_rpn_attr *add_attr_node(struct ccl_rpn_node *p,
265 const char *set, int type)
267 struct ccl_rpn_attr *n;
269 n = (struct ccl_rpn_attr *)xmalloc(sizeof(*n));
272 n->set = xstrdup(set);
276 n->next = p->u.t.attr_list;
277 p->u.t.attr_list = n;
283 * add_attr_numeric: Add attribute (type/value) to RPN term node.
284 * p: RPN node of type term.
285 * type: Type of attribute
286 * value: Value of attribute
287 * set: Attribute set name
289 void ccl_add_attr_numeric(struct ccl_rpn_node *p, const char *set,
292 struct ccl_rpn_attr *n;
294 n = add_attr_node(p, set, type);
295 n->kind = CCL_RPN_ATTR_NUMERIC;
296 n->value.numeric = value;
299 void ccl_add_attr_string(struct ccl_rpn_node *p, const char *set,
300 int type, char *value)
302 struct ccl_rpn_attr *n;
304 n = add_attr_node(p, set, type);
305 n->kind = CCL_RPN_ATTR_STRING;
306 n->value.str = xstrdup(value);
311 * search_term: Parse CCL search term.
313 * qa: Qualifier attributes already applied.
314 * term_list: tokens we accept as terms in context
315 * multi: whether we accept "multiple" tokens
316 * return: pointer to node(s); NULL on error.
318 static struct ccl_rpn_node *search_term_x(CCL_parser cclp,
320 int *term_list, int multi)
322 struct ccl_rpn_node *p_top = 0;
323 struct ccl_token *lookahead = cclp->look_token;
327 const char **truncation_aliases;
328 const char *t_default[2];
331 ccl_qual_search_special(cclp->bibset, "truncation");
332 if (!truncation_aliases)
334 truncation_aliases = t_default;
339 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_AND_LIST, 0))
341 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_OR_LIST, 0))
345 struct ccl_rpn_node *p;
351 int relation_value = -1;
352 int position_value = -1;
353 int structure_value = -1;
354 int truncation_value = -1;
355 int completeness_value = -1;
358 if (and_list || or_list || !multi)
361 /* ignore commas when dealing with and-lists .. */
362 if (and_list && lookahead && lookahead->kind == CCL_TOK_COMMA)
364 lookahead = lookahead->next;
368 /* go through each TERM token. If no truncation attribute is yet
369 met, then look for left/right truncation markers (?) and
370 set left_trunc/right_trunc/mid_trunc accordingly */
371 for (no = 0; no < max && is_term_ok(lookahead->kind, term_list); no++)
373 for (i = 0; i<lookahead->len; i++)
374 if (lookahead->name[i] == ' ')
376 else if (strchr(truncation_aliases[0], lookahead->name[i]))
378 if (no == 0 && i == 0 && lookahead->len >= 1)
380 else if (!is_term_ok(lookahead->next->kind, term_list) &&
381 i == lookahead->len-1 && i >= 1)
386 len += 1+lookahead->len+lookahead->ws_prefix_len;
387 lookahead = lookahead->next;
391 break; /* no more terms . stop . */
393 /* create the term node, but wait a moment before adding the term */
394 p = ccl_rpn_node_create(CCL_RPN_TERM);
395 p->u.t.attr_list = NULL;
399 const char *n = ccl_qual_get_name(qa[0]);
401 p->u.t.qual = xstrdup(n);
404 /* go through all attributes and add them to the attribute list */
405 for (i=0; qa && qa[i]; i++)
407 struct ccl_rpn_attr *attr;
409 for (attr = ccl_qual_get_attr(qa[i]); attr; attr = attr->next)
412 case CCL_RPN_ATTR_STRING:
413 ccl_add_attr_string(p, attr->set, attr->type,
416 case CCL_RPN_ATTR_NUMERIC:
417 if (attr->value.numeric > 0)
418 { /* deal only with REAL attributes (positive) */
422 if (relation_value != -1)
424 relation_value = attr->value.numeric;
427 if (position_value != -1)
429 position_value = attr->value.numeric;
432 if (structure_value != -1)
434 structure_value = attr->value.numeric;
437 if (truncation_value != -1)
439 truncation_value = attr->value.numeric;
440 left_trunc = right_trunc = mid_trunc = 0;
443 if (completeness_value != -1)
445 completeness_value = attr->value.numeric;
448 ccl_add_attr_numeric(p, attr->set, attr->type,
449 attr->value.numeric);
453 /* len now holds the number of characters in the RPN term */
454 /* no holds the number of CCL tokens (1 or more) */
456 if (structure_value == -1 &&
457 qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_WP, &attset))
458 { /* no structure attribute met. Apply either structure attribute
459 WORD or PHRASE depending on number of CCL tokens */
460 if (no == 1 && no_spaces == 0)
461 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 2);
463 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 1);
466 /* make the RPN token */
467 p->u.t.term = (char *)xmalloc(len);
468 ccl_assert(p->u.t.term);
469 p->u.t.term[0] = '\0';
470 for (i = 0; i<no; i++)
472 const char *src_str = cclp->look_token->name;
473 size_t src_len = cclp->look_token->len;
475 if (i == 0 && left_trunc)
480 if (i == no-1 && right_trunc)
482 if (p->u.t.term[0] && cclp->look_token->ws_prefix_len)
484 size_t len = strlen(p->u.t.term);
485 memcpy(p->u.t.term + len, cclp->look_token->ws_prefix_buf,
486 cclp->look_token->ws_prefix_len);
487 p->u.t.term[len + cclp->look_token->ws_prefix_len] = '\0';
489 strxcat(p->u.t.term, src_str, src_len);
493 /* make the top node point to us.. */
496 struct ccl_rpn_node *tmp;
499 tmp = ccl_rpn_node_create(CCL_RPN_OR);
501 tmp = ccl_rpn_node_create(CCL_RPN_AND);
503 tmp = ccl_rpn_node_create(CCL_RPN_AND);
513 if (left_trunc && right_trunc)
515 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH,
518 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
522 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 3);
524 else if (right_trunc)
526 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT,
529 cclp->error_code = CCL_ERR_TRUNC_NOT_RIGHT;
533 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 1);
537 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT,
540 cclp->error_code = CCL_ERR_TRUNC_NOT_LEFT;
544 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 2);
548 if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE,
550 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 100);
556 cclp->error_code = CCL_ERR_TERM_EXPECTED;
560 static struct ccl_rpn_node *search_term(CCL_parser cclp, ccl_qualifier_t *qa)
562 static int list[] = {CCL_TOK_TERM, CCL_TOK_COMMA, -1};
563 return search_term_x(cclp, qa, list, 0);
567 struct ccl_rpn_node *qualifiers_order(CCL_parser cclp,
568 ccl_qualifier_t *ap, char *attset)
571 struct ccl_rpn_node *p;
573 if (cclp->look_token->len == 1)
575 if (cclp->look_token->name[0] == '<')
577 else if (cclp->look_token->name[0] == '=')
579 else if (cclp->look_token->name[0] == '>')
582 else if (cclp->look_token->len == 2)
584 if (!memcmp(cclp->look_token->name, "<=", 2))
586 else if (!memcmp(cclp->look_token->name, ">=", 2))
588 else if (!memcmp(cclp->look_token->name, "<>", 2))
593 cclp->error_code = CCL_ERR_BAD_RELATION;
596 ADVANCE; /* skip relation */
598 qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, 0))
600 /* allow - inside term and treat it as range _always_ */
601 /* relation is =. Extract "embedded" - to separate terms */
602 if (KIND == CCL_TOK_TERM)
605 for (i = 0; i<cclp->look_token->len; i++)
607 if (cclp->look_token->name[i] == '-')
611 if (cclp->look_token->len > 1 && i == 0)
613 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
615 ntoken->kind = CCL_TOK_TERM;
616 ntoken->name = cclp->look_token->name + 1;
617 ntoken->len = cclp->look_token->len - 1;
619 cclp->look_token->len = 1;
620 cclp->look_token->name = "-";
622 else if (cclp->look_token->len > 1 && i == cclp->look_token->len-1)
624 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
626 ntoken->kind = CCL_TOK_TERM;
630 (cclp->look_token->len)--;
632 else if (cclp->look_token->len > 2 && i < cclp->look_token->len)
634 struct ccl_token *ntoken1 = ccl_token_add(cclp->look_token);
635 struct ccl_token *ntoken2 = ccl_token_add(ntoken1);
637 ntoken1->kind = CCL_TOK_TERM; /* generate - */
641 ntoken2->kind = CCL_TOK_TERM; /* generate yy */
642 ntoken2->name = cclp->look_token->name + (i+1);
643 ntoken2->len = cclp->look_token->len - (i+1);
645 cclp->look_token->len = i; /* adjust xx */
647 else if (i == cclp->look_token->len &&
648 cclp->look_token->next &&
649 cclp->look_token->next->kind == CCL_TOK_TERM &&
650 cclp->look_token->next->len > 1 &&
651 cclp->look_token->next->name[0] == '-')
654 /* we _know_ that xx does not have - in it */
655 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
657 ntoken->kind = CCL_TOK_TERM; /* generate - */
661 (ntoken->next->name)++; /* adjust yy */
662 (ntoken->next->len)--;
668 KIND == CCL_TOK_TERM &&
669 cclp->look_token->next && cclp->look_token->next->len == 1 &&
670 cclp->look_token->next->name[0] == '-')
672 struct ccl_rpn_node *p1;
673 if (!(p1 = search_term(cclp, ap)))
675 ADVANCE; /* skip '-' */
676 if (KIND == CCL_TOK_TERM) /* = term - term ? */
678 struct ccl_rpn_node *p2;
680 if (!(p2 = search_term(cclp, ap)))
685 p = ccl_rpn_node_create(CCL_RPN_AND);
687 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
689 ccl_add_attr_numeric(p2, attset, CCL_BIB1_REL, 2);
694 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
699 cclp->look_token->len == 1 &&
700 cclp->look_token->name[0] == '-') /* = - term ? */
703 if (!(p = search_term(cclp, ap)))
705 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, 2);
708 else if (KIND == CCL_TOK_LP)
711 if (!(p = find_spec(cclp, ap)))
713 if (KIND != CCL_TOK_RP)
715 cclp->error_code = CCL_ERR_RP_EXPECTED;
724 if (!(p = search_terms(cclp, ap)))
726 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, rel);
729 cclp->error_code = CCL_ERR_TERM_EXPECTED;
734 struct ccl_rpn_node *qualifier_relation(CCL_parser cclp, ccl_qualifier_t *ap)
737 struct ccl_rpn_node *p;
739 if (qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_ORDER, &attset)
740 || qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, &attset))
741 return qualifiers_order(cclp, ap, attset);
743 /* unordered relation */
744 if (KIND != CCL_TOK_EQ)
746 cclp->error_code = CCL_ERR_EQ_EXPECTED;
750 if (KIND == CCL_TOK_LP)
753 if (!(p = find_spec(cclp, ap)))
757 if (KIND != CCL_TOK_RP)
759 cclp->error_code = CCL_ERR_RP_EXPECTED;
766 p = search_terms(cclp, ap);
771 * qualifier_list: Parse CCL qualifiers and search terms.
773 * la: Token pointer to RELATION token.
774 * qa: Qualifier attributes already applied.
775 * return: pointer to node(s); NULL on error.
777 static struct ccl_rpn_node *qualifier_list(CCL_parser cclp,
778 struct ccl_token *la,
781 struct ccl_token *lookahead = cclp->look_token;
782 struct ccl_token *look_start = cclp->look_token;
784 struct ccl_rpn_node *node = 0;
785 const char **field_str;
793 cclp->error_code = CCL_ERR_DOUBLE_QUAL;
797 for (lookahead = cclp->look_token; lookahead != la;
798 lookahead=lookahead->next)
801 for (i=0; qa[i]; i++)
803 ap = (ccl_qualifier_t *)xmalloc((no ? (no+1) : 2) * sizeof(*ap));
806 field_str = ccl_qual_search_special(cclp->bibset, "field");
809 if (!strcmp(field_str[0], "or"))
811 else if (!strcmp(field_str[0], "merge"))
816 /* consider each field separately and OR */
817 lookahead = look_start;
818 while (lookahead != la)
822 while ((ap[0] = ccl_qual_search(cclp, lookahead->name,
823 lookahead->len, seq)) != 0)
825 struct ccl_rpn_node *node_sub;
826 cclp->look_token = la;
828 node_sub = qualifier_relation(cclp, ap);
831 ccl_rpn_delete(node);
837 struct ccl_rpn_node *node_this =
838 ccl_rpn_node_create(CCL_RPN_OR);
839 node_this->u.p[0] = node;
840 node_this->u.p[1] = node_sub;
849 cclp->look_token = lookahead;
850 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
854 lookahead = lookahead->next;
855 if (lookahead->kind == CCL_TOK_COMMA)
856 lookahead = lookahead->next;
861 /* merge attributes from ALL fields - including inherited ones */
864 struct ccl_rpn_node *node_sub;
866 lookahead = look_start;
867 for (i = 0; lookahead != la; i++)
869 ap[i] = ccl_qual_search(cclp, lookahead->name,
870 lookahead->len, seq);
873 if (!ap[i] && seq > 0)
874 ap[i] = ccl_qual_search(cclp, lookahead->name,
878 cclp->look_token = lookahead;
879 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
883 lookahead = lookahead->next;
884 if (lookahead->kind == CCL_TOK_COMMA)
885 lookahead = lookahead->next;
889 ccl_qualifier_t *qa0 = qa;
899 cclp->look_token = lookahead;
901 node_sub = qualifier_relation(cclp, ap);
904 ccl_rpn_delete(node);
909 struct ccl_rpn_node *node_this =
910 ccl_rpn_node_create(CCL_RPN_OR);
911 node_this->u.p[0] = node;
912 node_this->u.p[1] = node_sub;
926 * search_terms: Parse CCL search terms - including proximity.
928 * qa: Qualifier attributes already applied.
929 * return: pointer to node(s); NULL on error.
931 static struct ccl_rpn_node *search_terms(CCL_parser cclp, ccl_qualifier_t *qa)
933 static int list[] = {
934 CCL_TOK_TERM, CCL_TOK_COMMA,CCL_TOK_EQ, CCL_TOK_REL, CCL_TOK_SET, -1};
935 struct ccl_rpn_node *p1, *p2, *pn;
936 p1 = search_term_x(cclp, qa, list, 1);
941 if (KIND == CCL_TOK_PROX)
943 struct ccl_rpn_node *p_prox = 0;
944 /* ! word order specified */
945 /* % word order not specified */
946 p_prox = ccl_rpn_node_create(CCL_RPN_TERM);
947 p_prox->u.t.term = (char *) xmalloc(1 + cclp->look_token->len);
948 memcpy(p_prox->u.t.term, cclp->look_token->name,
949 cclp->look_token->len);
950 p_prox->u.t.term[cclp->look_token->len] = 0;
951 p_prox->u.t.attr_list = 0;
954 p2 = search_term_x(cclp, qa, list, 1);
960 pn = ccl_rpn_node_create(CCL_RPN_PROX);
966 else if (is_term_ok(KIND, list))
968 p2 = search_term_x(cclp, qa, list, 1);
974 pn = ccl_rpn_node_create(CCL_RPN_PROX);
987 * search_elements: Parse CCL search elements
989 * qa: Qualifier attributes already applied.
990 * return: pointer to node(s); NULL on error.
992 static struct ccl_rpn_node *search_elements(CCL_parser cclp,
995 struct ccl_rpn_node *p1;
996 struct ccl_token *lookahead;
997 if (KIND == CCL_TOK_LP)
1000 p1 = find_spec(cclp, qa);
1003 if (KIND != CCL_TOK_RP)
1005 cclp->error_code = CCL_ERR_RP_EXPECTED;
1012 else if (KIND == CCL_TOK_SET)
1015 if (KIND == CCL_TOK_EQ)
1017 if (KIND != CCL_TOK_TERM)
1019 cclp->error_code = CCL_ERR_SETNAME_EXPECTED;
1022 p1 = ccl_rpn_node_create(CCL_RPN_SET);
1023 p1->u.setname = copy_token_name(cclp->look_token);
1027 lookahead = cclp->look_token;
1029 while (lookahead->kind==CCL_TOK_TERM)
1031 lookahead = lookahead->next;
1032 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
1033 return qualifier_list(cclp, lookahead, qa);
1034 if (lookahead->kind != CCL_TOK_COMMA)
1036 lookahead = lookahead->next;
1039 return search_terms(cclp, qa);
1042 ccl_qualifier_t qa[2];
1043 struct ccl_rpn_node *node = 0;
1045 lookahead = cclp->look_token;
1048 for(seq = 0; ;seq++)
1050 struct ccl_rpn_node *node_sub;
1051 qa[0] = ccl_qual_search(cclp, "term", 4, seq);
1055 cclp->look_token = lookahead;
1057 node_sub = search_terms(cclp, qa);
1060 ccl_rpn_delete(node);
1065 struct ccl_rpn_node *node_this =
1066 ccl_rpn_node_create(CCL_RPN_OR);
1067 node_this->u.p[0] = node;
1068 node_this->u.p[1] = node_sub;
1069 node_this->u.p[2] = 0;
1076 node = search_terms(cclp, 0);
1082 * find_spec: Parse CCL find specification
1084 * qa: Qualifier attributes already applied.
1085 * return: pointer to node(s); NULL on error.
1087 static struct ccl_rpn_node *find_spec(CCL_parser cclp, ccl_qualifier_t *qa)
1089 struct ccl_rpn_node *p1, *p2, *pn;
1090 if (!(p1 = search_elements(cclp, qa)))
1098 p2 = search_elements(cclp, qa);
1104 pn = ccl_rpn_node_create(CCL_RPN_AND);
1112 p2 = search_elements(cclp, qa);
1118 pn = ccl_rpn_node_create(CCL_RPN_OR);
1126 p2 = search_elements(cclp, qa);
1132 pn = ccl_rpn_node_create(CCL_RPN_NOT);
1144 struct ccl_rpn_node *ccl_parser_find_str(CCL_parser cclp, const char *str)
1146 struct ccl_rpn_node *p;
1147 struct ccl_token *list = ccl_parser_tokenize(cclp, str);
1148 p = ccl_parser_find_token(cclp, list);
1149 ccl_token_del(list);
1153 struct ccl_rpn_node *ccl_parser_find_token(CCL_parser cclp,
1154 struct ccl_token *list)
1156 struct ccl_rpn_node *p;
1158 cclp->look_token = list;
1159 p = find_spec(cclp, NULL);
1160 if (p && KIND != CCL_TOK_EOL)
1162 if (KIND == CCL_TOK_RP)
1163 cclp->error_code = CCL_ERR_BAD_RP;
1165 cclp->error_code = CCL_ERR_OP_EXPECTED;
1169 cclp->error_pos = cclp->look_token->name;
1171 cclp->error_code = CCL_ERR_OK;
1173 cclp->error_code = cclp->error_code;
1178 * ccl_find_str: Parse CCL find - string representation
1179 * bibset: Bibset to be used for the parsing
1180 * str: String to be parsed
1181 * error: Pointer to integer. Holds error no. on completion.
1182 * pos: Pointer to char position. Holds approximate error position.
1183 * return: RPN tree on successful completion; NULL otherwise.
1185 struct ccl_rpn_node *ccl_find_str(CCL_bibset bibset, const char *str,
1186 int *error, int *pos)
1188 CCL_parser cclp = ccl_parser_create(bibset);
1189 struct ccl_token *list;
1190 struct ccl_rpn_node *p;
1192 list = ccl_parser_tokenize(cclp, str);
1193 p = ccl_parser_find_token(cclp, list);
1195 *error = cclp->error_code;
1197 *pos = cclp->error_pos - str;
1198 ccl_parser_destroy(cclp);
1199 ccl_token_del(list);
1206 * indent-tabs-mode: nil
1208 * vim: shiftwidth=4 tabstop=8 expandtab