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.13 2007-04-30 19:55:40 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;
210 * ccl_rpn_delete: Delete RPN tree.
211 * rpn: Pointer to tree.
213 void ccl_rpn_delete(struct ccl_rpn_node *rpn)
215 struct ccl_rpn_attr *attr, *attr1;
223 ccl_rpn_delete(rpn->u.p[0]);
224 ccl_rpn_delete(rpn->u.p[1]);
227 xfree(rpn->u.t.term);
228 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
231 if (attr->kind == CCL_RPN_ATTR_STRING)
232 xfree(attr->value.str);
239 xfree(rpn->u.setname);
242 ccl_rpn_delete(rpn->u.p[0]);
243 ccl_rpn_delete(rpn->u.p[1]);
244 ccl_rpn_delete(rpn->u.p[2]);
250 static struct ccl_rpn_node *find_spec(CCL_parser cclp, ccl_qualifier_t *qa);
252 static int is_term_ok(int look, int *list)
254 for (;*list >= 0; list++)
260 static struct ccl_rpn_node *search_terms(CCL_parser cclp, ccl_qualifier_t *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,
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;
326 const char *t_default[2];
329 ccl_qual_search_special(cclp->bibset, "truncation");
330 if (!truncation_aliases)
332 truncation_aliases = t_default;
337 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_AND_LIST, 0))
339 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_OR_LIST, 0))
343 struct ccl_rpn_node *p;
349 int relation_value = -1;
350 int position_value = -1;
351 int structure_value = -1;
352 int truncation_value = -1;
353 int completeness_value = -1;
356 if (and_list || or_list || !multi)
359 /* ignore commas when dealing with and-lists .. */
360 if (and_list && lookahead && lookahead->kind == CCL_TOK_COMMA)
362 lookahead = lookahead->next;
366 /* go through each TERM token. If no truncation attribute is yet
367 met, then look for left/right truncation markers (?) and
368 set left_trunc/right_trunc/mid_trunc accordingly */
369 for (no = 0; no < max && is_term_ok(lookahead->kind, term_list); no++)
371 for (i = 0; i<lookahead->len; i++)
372 if (lookahead->name[i] == ' ')
374 else if (strchr(truncation_aliases[0], lookahead->name[i]))
376 if (no == 0 && i == 0 && lookahead->len >= 1)
378 else if (!is_term_ok(lookahead->next->kind, term_list) &&
379 i == lookahead->len-1 && i >= 1)
384 len += 1+lookahead->len+lookahead->ws_prefix_len;
385 lookahead = lookahead->next;
389 break; /* no more terms . stop . */
391 /* create the term node, but wait a moment before adding the term */
392 p = ccl_rpn_node_create(CCL_RPN_TERM);
393 p->u.t.attr_list = NULL;
396 /* go through all attributes and add them to the attribute list */
397 for (i=0; qa && qa[i]; i++)
399 struct ccl_rpn_attr *attr;
401 for (attr = ccl_qual_get_attr(qa[i]); attr; attr = attr->next)
404 case CCL_RPN_ATTR_STRING:
405 ccl_add_attr_string(p, attr->set, attr->type,
408 case CCL_RPN_ATTR_NUMERIC:
409 if (attr->value.numeric > 0)
410 { /* deal only with REAL attributes (positive) */
414 if (relation_value != -1)
416 relation_value = attr->value.numeric;
419 if (position_value != -1)
421 position_value = attr->value.numeric;
424 if (structure_value != -1)
426 structure_value = attr->value.numeric;
429 if (truncation_value != -1)
431 truncation_value = attr->value.numeric;
432 left_trunc = right_trunc = mid_trunc = 0;
435 if (completeness_value != -1)
437 completeness_value = attr->value.numeric;
440 ccl_add_attr_numeric(p, attr->set, attr->type,
441 attr->value.numeric);
445 /* len now holds the number of characters in the RPN term */
446 /* no holds the number of CCL tokens (1 or more) */
448 if (structure_value == -1 &&
449 qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_WP, &attset))
450 { /* no structure attribute met. Apply either structure attribute
451 WORD or PHRASE depending on number of CCL tokens */
452 if (no == 1 && no_spaces == 0)
453 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 2);
455 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 1);
458 /* make the RPN token */
459 p->u.t.term = (char *)xmalloc(len);
460 ccl_assert(p->u.t.term);
461 p->u.t.term[0] = '\0';
462 for (i = 0; i<no; i++)
464 const char *src_str = cclp->look_token->name;
465 size_t src_len = cclp->look_token->len;
467 if (i == 0 && left_trunc)
472 if (i == no-1 && right_trunc)
474 if (!ccl_qual_match_stop(cclp->bibset, qa, src_str, src_len))
477 fprintf(stderr, "[%s %.*s]",
478 ccl_qual_get_name(qa[0]), src_len, src_str);
480 if (p->u.t.term[0] && cclp->look_token->ws_prefix_len)
482 size_t len = strlen(p->u.t.term);
483 memcpy(p->u.t.term + len, cclp->look_token->ws_prefix_buf,
484 cclp->look_token->ws_prefix_len);
485 p->u.t.term[len + cclp->look_token->ws_prefix_len] = '\0';
487 strxcat(p->u.t.term, src_str, src_len);
492 if (p->u.t.term[0] == 0)
498 /* make the top node point to us.. */
501 struct ccl_rpn_node *tmp;
504 tmp = ccl_rpn_node_create(CCL_RPN_OR);
506 tmp = ccl_rpn_node_create(CCL_RPN_AND);
508 tmp = ccl_rpn_node_create(CCL_RPN_AND);
518 if (left_trunc && right_trunc)
520 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH,
523 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
527 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 3);
529 else if (right_trunc)
531 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT,
534 cclp->error_code = CCL_ERR_TRUNC_NOT_RIGHT;
538 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 1);
542 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT,
545 cclp->error_code = CCL_ERR_TRUNC_NOT_LEFT;
549 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 2);
553 if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE,
555 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 100);
561 cclp->error_code = CCL_ERR_TERM_EXPECTED;
565 static struct ccl_rpn_node *search_term(CCL_parser cclp, ccl_qualifier_t *qa)
567 static int list[] = {CCL_TOK_TERM, CCL_TOK_COMMA, -1};
568 return search_term_x(cclp, qa, list, 0);
572 struct ccl_rpn_node *qualifiers_order(CCL_parser cclp,
573 ccl_qualifier_t *ap, char *attset)
576 struct ccl_rpn_node *p;
578 if (cclp->look_token->len == 1)
580 if (cclp->look_token->name[0] == '<')
582 else if (cclp->look_token->name[0] == '=')
584 else if (cclp->look_token->name[0] == '>')
587 else if (cclp->look_token->len == 2)
589 if (!memcmp(cclp->look_token->name, "<=", 2))
591 else if (!memcmp(cclp->look_token->name, ">=", 2))
593 else if (!memcmp(cclp->look_token->name, "<>", 2))
598 cclp->error_code = CCL_ERR_BAD_RELATION;
601 ADVANCE; /* skip relation */
603 qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, 0))
605 /* allow - inside term and treat it as range _always_ */
606 /* relation is =. Extract "embedded" - to separate terms */
607 if (KIND == CCL_TOK_TERM)
610 for (i = 0; i<cclp->look_token->len; i++)
612 if (cclp->look_token->name[i] == '-')
616 if (cclp->look_token->len > 1 && i == 0)
618 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
620 ntoken->kind = CCL_TOK_TERM;
621 ntoken->name = cclp->look_token->name + 1;
622 ntoken->len = cclp->look_token->len - 1;
624 cclp->look_token->len = 1;
625 cclp->look_token->name = "-";
627 else if (cclp->look_token->len > 1 && i == cclp->look_token->len-1)
629 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
631 ntoken->kind = CCL_TOK_TERM;
635 (cclp->look_token->len)--;
637 else if (cclp->look_token->len > 2 && i < cclp->look_token->len)
639 struct ccl_token *ntoken1 = ccl_token_add(cclp->look_token);
640 struct ccl_token *ntoken2 = ccl_token_add(ntoken1);
642 ntoken1->kind = CCL_TOK_TERM; /* generate - */
646 ntoken2->kind = CCL_TOK_TERM; /* generate yy */
647 ntoken2->name = cclp->look_token->name + (i+1);
648 ntoken2->len = cclp->look_token->len - (i+1);
650 cclp->look_token->len = i; /* adjust xx */
652 else if (i == cclp->look_token->len &&
653 cclp->look_token->next &&
654 cclp->look_token->next->kind == CCL_TOK_TERM &&
655 cclp->look_token->next->len > 1 &&
656 cclp->look_token->next->name[0] == '-')
659 /* we _know_ that xx does not have - in it */
660 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
662 ntoken->kind = CCL_TOK_TERM; /* generate - */
666 (ntoken->next->name)++; /* adjust yy */
667 (ntoken->next->len)--;
673 KIND == CCL_TOK_TERM &&
674 cclp->look_token->next && cclp->look_token->next->len == 1 &&
675 cclp->look_token->next->name[0] == '-')
677 struct ccl_rpn_node *p1;
678 if (!(p1 = search_term(cclp, ap)))
680 ADVANCE; /* skip '-' */
681 if (KIND == CCL_TOK_TERM) /* = term - term ? */
683 struct ccl_rpn_node *p2;
685 if (!(p2 = search_term(cclp, ap)))
690 p = ccl_rpn_node_create(CCL_RPN_AND);
692 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
694 ccl_add_attr_numeric(p2, attset, CCL_BIB1_REL, 2);
699 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
704 cclp->look_token->len == 1 &&
705 cclp->look_token->name[0] == '-') /* = - term ? */
708 if (!(p = search_term(cclp, ap)))
710 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, 2);
713 else if (KIND == CCL_TOK_LP)
716 if (!(p = find_spec(cclp, ap)))
718 if (KIND != CCL_TOK_RP)
720 cclp->error_code = CCL_ERR_RP_EXPECTED;
729 if (!(p = search_terms(cclp, ap)))
731 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, rel);
734 cclp->error_code = CCL_ERR_TERM_EXPECTED;
739 struct ccl_rpn_node *qualifier_relation(CCL_parser cclp, ccl_qualifier_t *ap)
742 struct ccl_rpn_node *p;
744 if (qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_ORDER, &attset)
745 || qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, &attset))
746 return qualifiers_order(cclp, ap, attset);
748 /* unordered relation */
749 if (KIND != CCL_TOK_EQ)
751 cclp->error_code = CCL_ERR_EQ_EXPECTED;
755 if (KIND == CCL_TOK_LP)
758 if (!(p = find_spec(cclp, ap)))
762 if (KIND != CCL_TOK_RP)
764 cclp->error_code = CCL_ERR_RP_EXPECTED;
771 p = search_terms(cclp, ap);
776 * qualifier_list: Parse CCL qualifiers and search terms.
778 * la: Token pointer to RELATION token.
779 * qa: Qualifier attributes already applied.
780 * return: pointer to node(s); NULL on error.
782 static struct ccl_rpn_node *qualifier_list(CCL_parser cclp,
783 struct ccl_token *la,
786 struct ccl_token *lookahead = cclp->look_token;
787 struct ccl_token *look_start = cclp->look_token;
789 struct ccl_rpn_node *node = 0;
790 const char **field_str;
798 cclp->error_code = CCL_ERR_DOUBLE_QUAL;
802 for (lookahead = cclp->look_token; lookahead != la;
803 lookahead=lookahead->next)
806 for (i=0; qa[i]; i++)
808 ap = (ccl_qualifier_t *)xmalloc((no ? (no+1) : 2) * sizeof(*ap));
811 field_str = ccl_qual_search_special(cclp->bibset, "field");
814 if (!strcmp(field_str[0], "or"))
816 else if (!strcmp(field_str[0], "merge"))
821 /* consider each field separately and OR */
822 lookahead = look_start;
823 while (lookahead != la)
827 while ((ap[0] = ccl_qual_search(cclp, lookahead->name,
828 lookahead->len, seq)) != 0)
830 struct ccl_rpn_node *node_sub;
831 cclp->look_token = la;
833 node_sub = qualifier_relation(cclp, ap);
836 ccl_rpn_delete(node);
842 struct ccl_rpn_node *node_this =
843 ccl_rpn_node_create(CCL_RPN_OR);
844 node_this->u.p[0] = node;
845 node_this->u.p[1] = node_sub;
854 cclp->look_token = lookahead;
855 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
859 lookahead = lookahead->next;
860 if (lookahead->kind == CCL_TOK_COMMA)
861 lookahead = lookahead->next;
866 /* merge attributes from ALL fields - including inherited ones */
869 struct ccl_rpn_node *node_sub;
871 lookahead = look_start;
872 for (i = 0; lookahead != la; i++)
874 ap[i] = ccl_qual_search(cclp, lookahead->name,
875 lookahead->len, seq);
878 if (!ap[i] && seq > 0)
879 ap[i] = ccl_qual_search(cclp, lookahead->name,
883 cclp->look_token = lookahead;
884 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
888 lookahead = lookahead->next;
889 if (lookahead->kind == CCL_TOK_COMMA)
890 lookahead = lookahead->next;
894 ccl_qualifier_t *qa0 = qa;
904 cclp->look_token = lookahead;
906 node_sub = qualifier_relation(cclp, ap);
909 ccl_rpn_delete(node);
914 struct ccl_rpn_node *node_this =
915 ccl_rpn_node_create(CCL_RPN_OR);
916 node_this->u.p[0] = node;
917 node_this->u.p[1] = node_sub;
931 * search_terms: Parse CCL search terms - including proximity.
933 * qa: Qualifier attributes already applied.
934 * return: pointer to node(s); NULL on error.
936 static struct ccl_rpn_node *search_terms(CCL_parser cclp, ccl_qualifier_t *qa)
938 static int list[] = {
939 CCL_TOK_TERM, CCL_TOK_COMMA,CCL_TOK_EQ, CCL_TOK_REL, CCL_TOK_SET, -1};
940 struct ccl_rpn_node *p1, *p2, *pn;
941 p1 = search_term_x(cclp, qa, list, 1);
946 if (KIND == CCL_TOK_PROX)
948 struct ccl_rpn_node *p_prox = 0;
949 /* ! word order specified */
950 /* % word order not specified */
951 p_prox = ccl_rpn_node_create(CCL_RPN_TERM);
952 p_prox->u.t.term = (char *) xmalloc(1 + cclp->look_token->len);
953 memcpy(p_prox->u.t.term, cclp->look_token->name,
954 cclp->look_token->len);
955 p_prox->u.t.term[cclp->look_token->len] = 0;
956 p_prox->u.t.attr_list = 0;
959 p2 = search_term_x(cclp, qa, list, 1);
965 pn = ccl_rpn_node_create(CCL_RPN_PROX);
971 else if (is_term_ok(KIND, list))
973 p2 = search_term_x(cclp, qa, list, 1);
979 pn = ccl_rpn_node_create(CCL_RPN_PROX);
992 * search_elements: Parse CCL search elements
994 * qa: Qualifier attributes already applied.
995 * return: pointer to node(s); NULL on error.
997 static struct ccl_rpn_node *search_elements(CCL_parser cclp,
1000 struct ccl_rpn_node *p1;
1001 struct ccl_token *lookahead;
1002 if (KIND == CCL_TOK_LP)
1005 p1 = find_spec(cclp, qa);
1008 if (KIND != CCL_TOK_RP)
1010 cclp->error_code = CCL_ERR_RP_EXPECTED;
1017 else if (KIND == CCL_TOK_SET)
1020 if (KIND == CCL_TOK_EQ)
1022 if (KIND != CCL_TOK_TERM)
1024 cclp->error_code = CCL_ERR_SETNAME_EXPECTED;
1027 p1 = ccl_rpn_node_create(CCL_RPN_SET);
1028 p1->u.setname = copy_token_name(cclp->look_token);
1032 lookahead = cclp->look_token;
1034 while (lookahead->kind==CCL_TOK_TERM)
1036 lookahead = lookahead->next;
1037 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
1038 return qualifier_list(cclp, lookahead, qa);
1039 if (lookahead->kind != CCL_TOK_COMMA)
1041 lookahead = lookahead->next;
1044 return search_terms(cclp, qa);
1047 ccl_qualifier_t qa[2];
1048 struct ccl_rpn_node *node = 0;
1050 lookahead = cclp->look_token;
1053 for(seq = 0; ;seq++)
1055 struct ccl_rpn_node *node_sub;
1056 qa[0] = ccl_qual_search(cclp, "term", 4, seq);
1060 cclp->look_token = lookahead;
1062 node_sub = search_terms(cclp, qa);
1065 ccl_rpn_delete(node);
1070 struct ccl_rpn_node *node_this =
1071 ccl_rpn_node_create(CCL_RPN_OR);
1072 node_this->u.p[0] = node;
1073 node_this->u.p[1] = node_sub;
1074 node_this->u.p[2] = 0;
1081 node = search_terms(cclp, 0);
1087 * find_spec: Parse CCL find specification
1089 * qa: Qualifier attributes already applied.
1090 * return: pointer to node(s); NULL on error.
1092 static struct ccl_rpn_node *find_spec(CCL_parser cclp, ccl_qualifier_t *qa)
1094 struct ccl_rpn_node *p1, *p2, *pn;
1095 if (!(p1 = search_elements(cclp, qa)))
1103 p2 = search_elements(cclp, qa);
1109 pn = ccl_rpn_node_create(CCL_RPN_AND);
1117 p2 = search_elements(cclp, qa);
1123 pn = ccl_rpn_node_create(CCL_RPN_OR);
1131 p2 = search_elements(cclp, qa);
1137 pn = ccl_rpn_node_create(CCL_RPN_NOT);
1149 struct ccl_rpn_node *ccl_parser_find_str(CCL_parser cclp, const char *str)
1151 struct ccl_rpn_node *p;
1152 struct ccl_token *list = ccl_parser_tokenize(cclp, str);
1153 p = ccl_parser_find_token(cclp, list);
1154 ccl_token_del(list);
1158 struct ccl_rpn_node *ccl_parser_find_token(CCL_parser cclp,
1159 struct ccl_token *list)
1161 struct ccl_rpn_node *p;
1163 cclp->look_token = list;
1164 p = find_spec(cclp, NULL);
1165 if (p && KIND != CCL_TOK_EOL)
1167 if (KIND == CCL_TOK_RP)
1168 cclp->error_code = CCL_ERR_BAD_RP;
1170 cclp->error_code = CCL_ERR_OP_EXPECTED;
1174 cclp->error_pos = cclp->look_token->name;
1176 cclp->error_code = CCL_ERR_OK;
1178 cclp->error_code = cclp->error_code;
1183 * ccl_find_str: Parse CCL find - string representation
1184 * bibset: Bibset to be used for the parsing
1185 * str: String to be parsed
1186 * error: Pointer to integer. Holds error no. on completion.
1187 * pos: Pointer to char position. Holds approximate error position.
1188 * return: RPN tree on successful completion; NULL otherwise.
1190 struct ccl_rpn_node *ccl_find_str(CCL_bibset bibset, const char *str,
1191 int *error, int *pos)
1193 CCL_parser cclp = ccl_parser_create(bibset);
1194 struct ccl_token *list;
1195 struct ccl_rpn_node *p;
1197 list = ccl_parser_tokenize(cclp, str);
1198 p = ccl_parser_find_token(cclp, list);
1200 *error = cclp->error_code;
1202 *pos = cclp->error_pos - str;
1203 ccl_parser_destroy(cclp);
1204 ccl_token_del(list);
1210 * indent-tabs-mode: nil
1212 * vim: shiftwidth=4 tabstop=8 expandtab