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.12 2007-04-30 11:33:49 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;
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 = ccl_qual_get_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)
490 fprintf(stderr, "[%s %.*s]",
491 ccl_qual_get_name(qa[0]), src_len, src_str);
493 if (i && cclp->look_token->ws_prefix_len)
495 size_t len = strlen(p->u.t.term);
496 memcpy(p->u.t.term + len, cclp->look_token->ws_prefix_buf,
497 cclp->look_token->ws_prefix_len);
498 p->u.t.term[len + cclp->look_token->ws_prefix_len] = '\0';
500 strxcat(p->u.t.term, src_str, src_len);
503 if (left_trunc && right_trunc)
505 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH,
508 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
512 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 3);
514 else if (right_trunc)
516 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT,
519 cclp->error_code = CCL_ERR_TRUNC_NOT_RIGHT;
523 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 1);
527 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT,
530 cclp->error_code = CCL_ERR_TRUNC_NOT_LEFT;
534 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 2);
538 if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE,
540 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 100);
546 cclp->error_code = CCL_ERR_TERM_EXPECTED;
550 static struct ccl_rpn_node *search_term(CCL_parser cclp, ccl_qualifier_t *qa)
552 static int list[] = {CCL_TOK_TERM, CCL_TOK_COMMA, -1};
553 return search_term_x(cclp, qa, list, 0);
557 struct ccl_rpn_node *qualifiers_order(CCL_parser cclp,
558 ccl_qualifier_t *ap, char *attset)
561 struct ccl_rpn_node *p;
563 if (cclp->look_token->len == 1)
565 if (cclp->look_token->name[0] == '<')
567 else if (cclp->look_token->name[0] == '=')
569 else if (cclp->look_token->name[0] == '>')
572 else if (cclp->look_token->len == 2)
574 if (!memcmp(cclp->look_token->name, "<=", 2))
576 else if (!memcmp(cclp->look_token->name, ">=", 2))
578 else if (!memcmp(cclp->look_token->name, "<>", 2))
583 cclp->error_code = CCL_ERR_BAD_RELATION;
586 ADVANCE; /* skip relation */
588 qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, 0))
590 /* allow - inside term and treat it as range _always_ */
591 /* relation is =. Extract "embedded" - to separate terms */
592 if (KIND == CCL_TOK_TERM)
595 for (i = 0; i<cclp->look_token->len; i++)
597 if (cclp->look_token->name[i] == '-')
601 if (cclp->look_token->len > 1 && i == 0)
603 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
605 ntoken->kind = CCL_TOK_TERM;
606 ntoken->name = cclp->look_token->name + 1;
607 ntoken->len = cclp->look_token->len - 1;
609 cclp->look_token->len = 1;
610 cclp->look_token->name = "-";
612 else if (cclp->look_token->len > 1 && i == cclp->look_token->len-1)
614 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
616 ntoken->kind = CCL_TOK_TERM;
620 (cclp->look_token->len)--;
622 else if (cclp->look_token->len > 2 && i < cclp->look_token->len)
624 struct ccl_token *ntoken1 = ccl_token_add(cclp->look_token);
625 struct ccl_token *ntoken2 = ccl_token_add(ntoken1);
627 ntoken1->kind = CCL_TOK_TERM; /* generate - */
631 ntoken2->kind = CCL_TOK_TERM; /* generate yy */
632 ntoken2->name = cclp->look_token->name + (i+1);
633 ntoken2->len = cclp->look_token->len - (i+1);
635 cclp->look_token->len = i; /* adjust xx */
637 else if (i == cclp->look_token->len &&
638 cclp->look_token->next &&
639 cclp->look_token->next->kind == CCL_TOK_TERM &&
640 cclp->look_token->next->len > 1 &&
641 cclp->look_token->next->name[0] == '-')
644 /* we _know_ that xx does not have - in it */
645 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
647 ntoken->kind = CCL_TOK_TERM; /* generate - */
651 (ntoken->next->name)++; /* adjust yy */
652 (ntoken->next->len)--;
658 KIND == CCL_TOK_TERM &&
659 cclp->look_token->next && cclp->look_token->next->len == 1 &&
660 cclp->look_token->next->name[0] == '-')
662 struct ccl_rpn_node *p1;
663 if (!(p1 = search_term(cclp, ap)))
665 ADVANCE; /* skip '-' */
666 if (KIND == CCL_TOK_TERM) /* = term - term ? */
668 struct ccl_rpn_node *p2;
670 if (!(p2 = search_term(cclp, ap)))
675 p = ccl_rpn_node_create(CCL_RPN_AND);
677 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
679 ccl_add_attr_numeric(p2, attset, CCL_BIB1_REL, 2);
684 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
689 cclp->look_token->len == 1 &&
690 cclp->look_token->name[0] == '-') /* = - term ? */
693 if (!(p = search_term(cclp, ap)))
695 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, 2);
698 else if (KIND == CCL_TOK_LP)
701 if (!(p = find_spec(cclp, ap)))
703 if (KIND != CCL_TOK_RP)
705 cclp->error_code = CCL_ERR_RP_EXPECTED;
714 if (!(p = search_terms(cclp, ap)))
716 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, rel);
719 cclp->error_code = CCL_ERR_TERM_EXPECTED;
724 struct ccl_rpn_node *qualifier_relation(CCL_parser cclp, ccl_qualifier_t *ap)
727 struct ccl_rpn_node *p;
729 if (qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_ORDER, &attset)
730 || qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, &attset))
731 return qualifiers_order(cclp, ap, attset);
733 /* unordered relation */
734 if (KIND != CCL_TOK_EQ)
736 cclp->error_code = CCL_ERR_EQ_EXPECTED;
740 if (KIND == CCL_TOK_LP)
743 if (!(p = find_spec(cclp, ap)))
747 if (KIND != CCL_TOK_RP)
749 cclp->error_code = CCL_ERR_RP_EXPECTED;
756 p = search_terms(cclp, ap);
761 * qualifier_list: Parse CCL qualifiers and search terms.
763 * la: Token pointer to RELATION token.
764 * qa: Qualifier attributes already applied.
765 * return: pointer to node(s); NULL on error.
767 static struct ccl_rpn_node *qualifier_list(CCL_parser cclp, struct ccl_token *la,
770 struct ccl_token *lookahead = cclp->look_token;
771 struct ccl_token *look_start = cclp->look_token;
773 struct ccl_rpn_node *node = 0;
774 const char *field_str;
782 cclp->error_code = CCL_ERR_DOUBLE_QUAL;
786 for (lookahead = cclp->look_token; lookahead != la;
787 lookahead=lookahead->next)
790 for (i=0; qa[i]; i++)
792 ap = (ccl_qualifier_t *)xmalloc((no ? (no+1) : 2) * sizeof(*ap));
795 field_str = ccl_qual_search_special(cclp->bibset, "field");
798 if (!strcmp(field_str, "or"))
800 else if (!strcmp(field_str, "merge"))
805 /* consider each field separately and OR */
806 lookahead = look_start;
807 while (lookahead != la)
811 while ((ap[0] = ccl_qual_search(cclp, lookahead->name,
812 lookahead->len, seq)) != 0)
814 struct ccl_rpn_node *node_sub;
815 cclp->look_token = la;
817 node_sub = qualifier_relation(cclp, ap);
820 ccl_rpn_delete(node);
826 struct ccl_rpn_node *node_this =
827 ccl_rpn_node_create(CCL_RPN_OR);
828 node_this->u.p[0] = node;
829 node_this->u.p[1] = node_sub;
838 cclp->look_token = lookahead;
839 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
843 lookahead = lookahead->next;
844 if (lookahead->kind == CCL_TOK_COMMA)
845 lookahead = lookahead->next;
850 /* merge attributes from ALL fields - including inherited ones */
853 struct ccl_rpn_node *node_sub;
855 lookahead = look_start;
856 for (i = 0; lookahead != la; i++)
858 ap[i] = ccl_qual_search(cclp, lookahead->name,
859 lookahead->len, seq);
862 if (!ap[i] && seq > 0)
863 ap[i] = ccl_qual_search(cclp, lookahead->name,
867 cclp->look_token = lookahead;
868 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
872 lookahead = lookahead->next;
873 if (lookahead->kind == CCL_TOK_COMMA)
874 lookahead = lookahead->next;
878 ccl_qualifier_t *qa0 = qa;
888 cclp->look_token = lookahead;
890 node_sub = qualifier_relation(cclp, ap);
893 ccl_rpn_delete(node);
898 struct ccl_rpn_node *node_this =
899 ccl_rpn_node_create(CCL_RPN_OR);
900 node_this->u.p[0] = node;
901 node_this->u.p[1] = node_sub;
915 * search_terms: Parse CCL search terms - including proximity.
917 * qa: Qualifier attributes already applied.
918 * return: pointer to node(s); NULL on error.
920 static struct ccl_rpn_node *search_terms(CCL_parser cclp, ccl_qualifier_t *qa)
922 static int list[] = {
923 CCL_TOK_TERM, CCL_TOK_COMMA,CCL_TOK_EQ, CCL_TOK_REL, CCL_TOK_SET, -1};
924 struct ccl_rpn_node *p1, *p2, *pn;
925 p1 = search_term_x(cclp, qa, list, 1);
930 if (KIND == CCL_TOK_PROX)
932 struct ccl_rpn_node *p_prox = 0;
933 /* ! word order specified */
934 /* % word order not specified */
935 p_prox = ccl_rpn_node_create(CCL_RPN_TERM);
936 p_prox->u.t.term = (char *) xmalloc(1 + cclp->look_token->len);
937 memcpy(p_prox->u.t.term, cclp->look_token->name,
938 cclp->look_token->len);
939 p_prox->u.t.term[cclp->look_token->len] = 0;
940 p_prox->u.t.attr_list = 0;
943 p2 = search_term_x(cclp, qa, list, 1);
949 pn = ccl_rpn_node_create(CCL_RPN_PROX);
955 else if (is_term_ok(KIND, list))
957 p2 = search_term_x(cclp, qa, list, 1);
963 pn = ccl_rpn_node_create(CCL_RPN_PROX);
976 * search_elements: Parse CCL search elements
978 * qa: Qualifier attributes already applied.
979 * return: pointer to node(s); NULL on error.
981 static struct ccl_rpn_node *search_elements(CCL_parser cclp,
984 struct ccl_rpn_node *p1;
985 struct ccl_token *lookahead;
986 if (KIND == CCL_TOK_LP)
989 p1 = find_spec(cclp, qa);
992 if (KIND != CCL_TOK_RP)
994 cclp->error_code = CCL_ERR_RP_EXPECTED;
1001 else if (KIND == CCL_TOK_SET)
1004 if (KIND == CCL_TOK_EQ)
1006 if (KIND != CCL_TOK_TERM)
1008 cclp->error_code = CCL_ERR_SETNAME_EXPECTED;
1011 p1 = ccl_rpn_node_create(CCL_RPN_SET);
1012 p1->u.setname = copy_token_name(cclp->look_token);
1016 lookahead = cclp->look_token;
1018 while (lookahead->kind==CCL_TOK_TERM)
1020 lookahead = lookahead->next;
1021 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
1022 return qualifier_list(cclp, lookahead, qa);
1023 if (lookahead->kind != CCL_TOK_COMMA)
1025 lookahead = lookahead->next;
1028 return search_terms(cclp, qa);
1031 ccl_qualifier_t qa[2];
1032 struct ccl_rpn_node *node = 0;
1034 lookahead = cclp->look_token;
1037 for(seq = 0; ;seq++)
1039 struct ccl_rpn_node *node_sub;
1040 qa[0] = ccl_qual_search(cclp, "term", 4, seq);
1044 cclp->look_token = lookahead;
1046 node_sub = search_terms(cclp, qa);
1049 ccl_rpn_delete(node);
1054 struct ccl_rpn_node *node_this =
1055 ccl_rpn_node_create(CCL_RPN_OR);
1056 node_this->u.p[0] = node;
1057 node_this->u.p[1] = node_sub;
1058 node_this->u.p[2] = 0;
1065 node = search_terms(cclp, 0);
1071 * find_spec: Parse CCL find specification
1073 * qa: Qualifier attributes already applied.
1074 * return: pointer to node(s); NULL on error.
1076 static struct ccl_rpn_node *find_spec(CCL_parser cclp, ccl_qualifier_t *qa)
1078 struct ccl_rpn_node *p1, *p2, *pn;
1079 if (!(p1 = search_elements(cclp, qa)))
1087 p2 = search_elements(cclp, qa);
1093 pn = ccl_rpn_node_create(CCL_RPN_AND);
1101 p2 = search_elements(cclp, qa);
1107 pn = ccl_rpn_node_create(CCL_RPN_OR);
1115 p2 = search_elements(cclp, qa);
1121 pn = ccl_rpn_node_create(CCL_RPN_NOT);
1133 struct ccl_rpn_node *ccl_parser_find_str(CCL_parser cclp, const char *str)
1135 struct ccl_rpn_node *p;
1136 struct ccl_token *list = ccl_parser_tokenize(cclp, str);
1137 p = ccl_parser_find_token(cclp, list);
1138 ccl_token_del(list);
1142 struct ccl_rpn_node *ccl_parser_find_token(CCL_parser cclp,
1143 struct ccl_token *list)
1145 struct ccl_rpn_node *p;
1147 cclp->look_token = list;
1148 p = find_spec(cclp, NULL);
1149 if (p && KIND != CCL_TOK_EOL)
1151 if (KIND == CCL_TOK_RP)
1152 cclp->error_code = CCL_ERR_BAD_RP;
1154 cclp->error_code = CCL_ERR_OP_EXPECTED;
1158 cclp->error_pos = cclp->look_token->name;
1160 cclp->error_code = CCL_ERR_OK;
1162 cclp->error_code = cclp->error_code;
1167 * ccl_find_str: Parse CCL find - string representation
1168 * bibset: Bibset to be used for the parsing
1169 * str: String to be parsed
1170 * error: Pointer to integer. Holds error no. on completion.
1171 * pos: Pointer to char position. Holds approximate error position.
1172 * return: RPN tree on successful completion; NULL otherwise.
1174 struct ccl_rpn_node *ccl_find_str(CCL_bibset bibset, const char *str,
1175 int *error, int *pos)
1177 CCL_parser cclp = ccl_parser_create(bibset);
1178 struct ccl_token *list;
1179 struct ccl_rpn_node *p;
1181 list = ccl_parser_tokenize(cclp, str);
1182 p = ccl_parser_find_token(cclp, list);
1184 *error = cclp->error_code;
1186 *pos = cclp->error_pos - str;
1187 ccl_parser_destroy(cclp);
1188 ccl_token_del(list);
1194 * indent-tabs-mode: nil
1196 * vim: shiftwidth=4 tabstop=8 expandtab