1 /* This file is part of the YAZ toolkit.
2 * Copyright (C) 1995-2011 Index Data
3 * See the file LICENSE for details.
7 * \brief Implements parsing of a CCL FIND query.
9 * This source file implements parsing of a CCL Query (ISO8777).
10 * The parser uses predictive parsing, but it does several tokens
11 * of lookahead in the handling of relational operations.. So
12 * it's not really pure.
24 /* returns type of current lookahead */
25 #define KIND (cclp->look_token->kind)
27 /* move one token forward */
28 #define ADVANCE cclp->look_token = cclp->look_token->next
31 * qual_val_type: test for existance of attribute type/value pair.
33 * type: Type of attribute to search for
34 * value: Value of attribute to seach for
35 * return: 1 if found; 0 otherwise.
37 static int qual_val_type(ccl_qualifier_t *qa, int type, int value,
44 for (i = 0; qa[i]; i++)
46 struct ccl_rpn_attr *q = ccl_qual_get_attr(qa[i]);
49 if (q->type == type && q->kind == CCL_RPN_ATTR_NUMERIC &&
50 q->value.numeric == value)
63 * strxcat: concatenate strings.
64 * n: Null-terminated Destination string
65 * src: Source string to be appended (not null-terminated)
66 * len: Length of source string.
68 static void strxcat(char *n, const char *src, int len)
78 * copy_token_name: Return copy of CCL token name
79 * tp: Pointer to token info.
80 * return: malloc(3) allocated copy of token name.
82 static char *copy_token_name(struct ccl_token *tp)
84 char *str = (char *)xmalloc(tp->len + 1);
86 memcpy(str, tp->name, tp->len);
92 * mk_node: Create RPN node.
94 * return: pointer to allocated node.
96 struct ccl_rpn_node *ccl_rpn_node_create(enum ccl_rpn_kind kind)
98 struct ccl_rpn_node *p;
99 p = (struct ccl_rpn_node *)xmalloc(sizeof(*p));
106 p->u.t.attr_list = 0;
117 * ccl_rpn_delete: Delete RPN tree.
118 * rpn: Pointer to tree.
120 void ccl_rpn_delete(struct ccl_rpn_node *rpn)
122 struct ccl_rpn_attr *attr, *attr1;
130 ccl_rpn_delete(rpn->u.p[0]);
131 ccl_rpn_delete(rpn->u.p[1]);
134 xfree(rpn->u.t.term);
135 xfree(rpn->u.t.qual);
136 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
139 if (attr->kind == CCL_RPN_ATTR_STRING)
140 xfree(attr->value.str);
147 xfree(rpn->u.setname);
150 ccl_rpn_delete(rpn->u.p[0]);
151 ccl_rpn_delete(rpn->u.p[1]);
152 ccl_rpn_delete(rpn->u.p[2]);
158 static struct ccl_rpn_node *find_spec(CCL_parser cclp, ccl_qualifier_t *qa);
160 static int is_term_ok(int look, int *list)
162 for (;*list >= 0; list++)
168 static struct ccl_rpn_node *search_terms(CCL_parser cclp, ccl_qualifier_t *qa);
170 static struct ccl_rpn_attr *add_attr_node(struct ccl_rpn_node *p,
171 const char *set, int type)
173 struct ccl_rpn_attr *n;
175 n = (struct ccl_rpn_attr *)xmalloc(sizeof(*n));
178 n->set = xstrdup(set);
182 n->next = p->u.t.attr_list;
183 p->u.t.attr_list = n;
189 * add_attr_numeric: Add attribute (type/value) to RPN term node.
190 * p: RPN node of type term.
191 * type: Type of attribute
192 * value: Value of attribute
193 * set: Attribute set name
195 void ccl_add_attr_numeric(struct ccl_rpn_node *p, const char *set,
198 struct ccl_rpn_attr *n;
200 n = add_attr_node(p, set, type);
201 n->kind = CCL_RPN_ATTR_NUMERIC;
202 n->value.numeric = value;
205 void ccl_add_attr_string(struct ccl_rpn_node *p, const char *set,
206 int type, char *value)
208 struct ccl_rpn_attr *n;
210 n = add_attr_node(p, set, type);
211 n->kind = CCL_RPN_ATTR_STRING;
212 n->value.str = xstrdup(value);
216 #define REGEX_CHARS "^[]{}()|.*+?!$"
217 #define CCL_CHARS "#?\\"
219 * search_term: Parse CCL search term.
221 * qa: Qualifier attributes already applied.
222 * term_list: tokens we accept as terms in context
223 * multi: whether we accept "multiple" tokens
224 * return: pointer to node(s); NULL on error.
226 static struct ccl_rpn_node *search_term_x(CCL_parser cclp,
228 int *term_list, int multi)
230 struct ccl_rpn_node *p_top = 0;
231 struct ccl_token *lookahead = cclp->look_token;
235 const char **truncation_aliases;
236 const char *t_default[2];
239 ccl_qual_search_special(cclp->bibset, "truncation");
240 if (!truncation_aliases)
242 truncation_aliases = t_default;
247 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_AND_LIST, 0))
249 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_OR_LIST, 0))
253 struct ccl_rpn_node *p;
256 int relation_value = -1;
257 int position_value = -1;
258 int structure_value = -1;
259 int truncation_value = -1;
260 int completeness_value = -1;
267 if (and_list || or_list || !multi)
270 /* ignore commas when dealing with and-lists .. */
271 if (and_list && lookahead && lookahead->kind == CCL_TOK_COMMA)
273 lookahead = lookahead->next;
277 /* go through each TERM token. If no truncation attribute is yet
278 met, then look for left/right truncation markers (?) and
279 set left_trunc/right_trunc/mid_trunc accordingly */
280 for (no = 0; no < max && is_term_ok(lookahead->kind, term_list); no++)
282 for (i = 0; i<lookahead->len; i++)
283 if (lookahead->name[i] == ' ')
285 len += 1+lookahead->len+lookahead->ws_prefix_len;
286 lookahead = lookahead->next;
290 break; /* no more terms . stop . */
292 /* create the term node, but wait a moment before adding the term */
293 p = ccl_rpn_node_create(CCL_RPN_TERM);
294 p->u.t.attr_list = NULL;
298 const char *n = ccl_qual_get_name(qa[0]);
300 p->u.t.qual = xstrdup(n);
303 /* go through all attributes and add them to the attribute list */
304 for (i=0; qa && qa[i]; i++)
306 struct ccl_rpn_attr *attr;
308 for (attr = ccl_qual_get_attr(qa[i]); attr; attr = attr->next)
311 case CCL_RPN_ATTR_STRING:
312 ccl_add_attr_string(p, attr->set, attr->type,
315 case CCL_RPN_ATTR_NUMERIC:
316 if (attr->value.numeric > 0)
317 { /* deal only with REAL attributes (positive) */
321 if (relation_value != -1)
323 relation_value = attr->value.numeric;
326 if (position_value != -1)
328 position_value = attr->value.numeric;
331 if (structure_value != -1)
333 structure_value = attr->value.numeric;
336 if (truncation_value != -1)
338 truncation_value = attr->value.numeric;
341 if (completeness_value != -1)
343 completeness_value = attr->value.numeric;
346 ccl_add_attr_numeric(p, attr->set, attr->type,
347 attr->value.numeric);
351 /* len now holds the number of characters in the RPN term */
352 /* no holds the number of CCL tokens (1 or more) */
354 if (structure_value == -1 &&
355 qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_WP, &attset))
356 { /* no structure attribute met. Apply either structure attribute
357 WORD or PHRASE depending on number of CCL tokens */
358 if (no == 1 && no_spaces == 0)
359 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 2);
361 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 1);
364 if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_REGEX,
367 regex_trunc = 1; /* regex trunc (102) allowed */
369 else if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_Z3958,
372 z3958_trunc = 1; /* Z39.58 trunc (CCL) trunc allowed */
375 /* make the RPN token */
376 p->u.t.term = (char *)xmalloc(len * 2 + 2);
377 ccl_assert(p->u.t.term);
378 p->u.t.term[0] = '\0';
379 for (i = 0; i<no; i++)
381 const char *src_str = cclp->look_token->name;
382 size_t src_len = cclp->look_token->len;
386 if (p->u.t.term[0] && cclp->look_token->ws_prefix_len)
388 size_t len = strlen(p->u.t.term);
389 memcpy(p->u.t.term + len, cclp->look_token->ws_prefix_buf,
390 cclp->look_token->ws_prefix_len);
391 p->u.t.term[len + cclp->look_token->ws_prefix_len] = '\0';
393 for (j = 0; j < src_len; j++)
395 if (j > 0 && src_str[j-1] == '\\')
397 if (regex_trunc && strchr(REGEX_CHARS "\\", src_str[j]))
400 strcat(p->u.t.term, "\\");
402 else if (z3958_trunc && strchr(CCL_CHARS "\\", src_str[j]))
405 strcat(p->u.t.term, "\\");
407 strxcat(p->u.t.term, src_str + j, 1);
409 else if (src_str[j] == '"')
410 quote_mode = !quote_mode;
411 else if (!quote_mode && src_str[j] == '?')
415 strcat(p->u.t.term, ".*");
416 regex_trunc = 2; /* regex trunc is really needed */
418 else if (z3958_trunc)
420 strcat(p->u.t.term, "?");
423 else if (i == 0 && j == 0)
425 else if (i == no - 1 && j == src_len - 1)
429 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
434 else if (!quote_mode && src_str[j] == '#')
438 strcat(p->u.t.term, ".");
439 regex_trunc = 2; /* regex trunc is really needed */
441 else if (z3958_trunc)
443 strcat(p->u.t.term, "#");
448 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
453 else if (src_str[j] != '\\')
455 if (regex_trunc && strchr(REGEX_CHARS, src_str[j]))
458 strcat(p->u.t.term, "\\");
460 else if (z3958_trunc && strchr(CCL_CHARS, src_str[j]))
463 strcat(p->u.t.term, "\\");
465 strxcat(p->u.t.term, src_str + j, 1);
471 /* make the top node point to us.. */
474 struct ccl_rpn_node *tmp;
477 tmp = ccl_rpn_node_create(CCL_RPN_OR);
479 tmp = ccl_rpn_node_create(CCL_RPN_AND);
481 tmp = ccl_rpn_node_create(CCL_RPN_AND);
491 if (left_trunc && right_trunc)
493 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH,
496 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
500 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 3);
502 else if (right_trunc)
504 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT,
507 cclp->error_code = CCL_ERR_TRUNC_NOT_RIGHT;
511 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 1);
515 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT,
518 cclp->error_code = CCL_ERR_TRUNC_NOT_LEFT;
522 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 2);
524 else if (regex_trunc == 2)
526 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 102);
528 else if (z3958_trunc == 2)
530 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 104);
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, ccl_qualifier_t *qa)
548 static int list[] = {CCL_TOK_TERM, CCL_TOK_COMMA, -1};
549 return search_term_x(cclp, qa, list, 0);
553 struct ccl_rpn_node *qualifiers_order(CCL_parser cclp,
554 ccl_qualifier_t *ap, char *attset)
557 struct ccl_rpn_node *p;
559 if (cclp->look_token->len == 1)
561 if (cclp->look_token->name[0] == '<')
563 else if (cclp->look_token->name[0] == '=')
565 else if (cclp->look_token->name[0] == '>')
568 else if (cclp->look_token->len == 2)
570 if (!memcmp(cclp->look_token->name, "<=", 2))
572 else if (!memcmp(cclp->look_token->name, ">=", 2))
574 else if (!memcmp(cclp->look_token->name, "<>", 2))
579 cclp->error_code = CCL_ERR_BAD_RELATION;
582 ADVANCE; /* skip relation */
584 qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, 0))
586 /* allow - inside term and treat it as range _always_ */
587 /* relation is =. Extract "embedded" - to separate terms */
588 if (KIND == CCL_TOK_TERM)
591 for (i = 0; i<cclp->look_token->len; i++)
593 if (cclp->look_token->name[i] == '-')
597 if (cclp->look_token->len > 1 && i == 0)
599 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
601 ntoken->kind = CCL_TOK_TERM;
602 ntoken->name = cclp->look_token->name + 1;
603 ntoken->len = cclp->look_token->len - 1;
605 cclp->look_token->len = 1;
606 cclp->look_token->name = "-";
608 else if (cclp->look_token->len > 1 && i == cclp->look_token->len-1)
610 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
612 ntoken->kind = CCL_TOK_TERM;
616 (cclp->look_token->len)--;
618 else if (cclp->look_token->len > 2 && i < cclp->look_token->len)
620 struct ccl_token *ntoken1 = ccl_token_add(cclp->look_token);
621 struct ccl_token *ntoken2 = ccl_token_add(ntoken1);
623 ntoken1->kind = CCL_TOK_TERM; /* generate - */
627 ntoken2->kind = CCL_TOK_TERM; /* generate yy */
628 ntoken2->name = cclp->look_token->name + (i+1);
629 ntoken2->len = cclp->look_token->len - (i+1);
631 cclp->look_token->len = i; /* adjust xx */
633 else if (i == cclp->look_token->len &&
634 cclp->look_token->next &&
635 cclp->look_token->next->kind == CCL_TOK_TERM &&
636 cclp->look_token->next->len > 1 &&
637 cclp->look_token->next->name[0] == '-')
640 /* we _know_ that xx does not have - in it */
641 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
643 ntoken->kind = CCL_TOK_TERM; /* generate - */
647 (ntoken->next->name)++; /* adjust yy */
648 (ntoken->next->len)--;
654 KIND == CCL_TOK_TERM &&
655 cclp->look_token->next && cclp->look_token->next->len == 1 &&
656 cclp->look_token->next->name[0] == '-')
658 struct ccl_rpn_node *p1;
659 if (!(p1 = search_term(cclp, ap)))
661 ADVANCE; /* skip '-' */
662 if (KIND == CCL_TOK_TERM) /* = term - term ? */
664 struct ccl_rpn_node *p2;
666 if (!(p2 = search_term(cclp, ap)))
671 p = ccl_rpn_node_create(CCL_RPN_AND);
673 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
675 ccl_add_attr_numeric(p2, attset, CCL_BIB1_REL, 2);
680 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
685 cclp->look_token->len == 1 &&
686 cclp->look_token->name[0] == '-') /* = - term ? */
689 if (!(p = search_term(cclp, ap)))
691 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, 2);
694 else if (KIND == CCL_TOK_LP)
697 if (!(p = find_spec(cclp, ap)))
699 if (KIND != CCL_TOK_RP)
701 cclp->error_code = CCL_ERR_RP_EXPECTED;
710 if (!(p = search_terms(cclp, ap)))
712 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, rel);
715 cclp->error_code = CCL_ERR_TERM_EXPECTED;
720 struct ccl_rpn_node *qualifier_relation(CCL_parser cclp, ccl_qualifier_t *ap)
723 struct ccl_rpn_node *p;
725 if (qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_ORDER, &attset)
726 || qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, &attset))
727 return qualifiers_order(cclp, ap, attset);
729 /* unordered relation */
730 if (KIND != CCL_TOK_EQ)
732 cclp->error_code = CCL_ERR_EQ_EXPECTED;
736 if (KIND == CCL_TOK_LP)
739 if (!(p = find_spec(cclp, ap)))
743 if (KIND != CCL_TOK_RP)
745 cclp->error_code = CCL_ERR_RP_EXPECTED;
752 p = search_terms(cclp, ap);
757 * qualifier_list: Parse CCL qualifiers and search terms.
759 * la: Token pointer to RELATION token.
760 * qa: Qualifier attributes already applied.
761 * return: pointer to node(s); NULL on error.
763 static struct ccl_rpn_node *qualifier_list(CCL_parser cclp,
764 struct ccl_token *la,
767 struct ccl_token *lookahead = cclp->look_token;
768 struct ccl_token *look_start = cclp->look_token;
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 = (ccl_qualifier_t *)xmalloc((no ? (no+1) : 2) * sizeof(*ap));
792 field_str = ccl_qual_search_special(cclp->bibset, "field");
795 if (!strcmp(field_str[0], "or"))
797 else if (!strcmp(field_str[0], "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 = qualifier_relation(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 ccl_qualifier_t *qa0 = qa;
885 cclp->look_token = lookahead;
887 node_sub = qualifier_relation(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, ccl_qualifier_t *qa)
919 static int list[] = {
920 CCL_TOK_TERM, CCL_TOK_COMMA,CCL_TOK_EQ, CCL_TOK_REL, CCL_TOK_SET, -1};
921 struct ccl_rpn_node *p1, *p2, *pn;
922 p1 = search_term_x(cclp, qa, list, 1);
927 if (KIND == CCL_TOK_PROX)
929 struct ccl_rpn_node *p_prox = 0;
930 /* ! word order specified */
931 /* % word order not specified */
932 p_prox = ccl_rpn_node_create(CCL_RPN_TERM);
933 p_prox->u.t.term = (char *) xmalloc(1 + cclp->look_token->len);
934 memcpy(p_prox->u.t.term, cclp->look_token->name,
935 cclp->look_token->len);
936 p_prox->u.t.term[cclp->look_token->len] = 0;
937 p_prox->u.t.attr_list = 0;
940 p2 = search_term_x(cclp, qa, list, 1);
946 pn = ccl_rpn_node_create(CCL_RPN_PROX);
952 else if (is_term_ok(KIND, list))
954 p2 = search_term_x(cclp, qa, list, 1);
960 pn = ccl_rpn_node_create(CCL_RPN_PROX);
973 * search_elements: Parse CCL search elements
975 * qa: Qualifier attributes already applied.
976 * return: pointer to node(s); NULL on error.
978 static struct ccl_rpn_node *search_elements(CCL_parser cclp,
981 struct ccl_rpn_node *p1;
982 struct ccl_token *lookahead;
983 if (KIND == CCL_TOK_LP)
986 p1 = find_spec(cclp, qa);
989 if (KIND != CCL_TOK_RP)
991 cclp->error_code = CCL_ERR_RP_EXPECTED;
998 else if (KIND == CCL_TOK_SET)
1001 if (KIND == CCL_TOK_EQ)
1003 if (KIND != CCL_TOK_TERM)
1005 cclp->error_code = CCL_ERR_SETNAME_EXPECTED;
1008 p1 = ccl_rpn_node_create(CCL_RPN_SET);
1009 p1->u.setname = copy_token_name(cclp->look_token);
1013 lookahead = cclp->look_token;
1015 while (lookahead->kind==CCL_TOK_TERM)
1017 lookahead = lookahead->next;
1018 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
1019 return qualifier_list(cclp, lookahead, qa);
1020 if (lookahead->kind != CCL_TOK_COMMA)
1022 lookahead = lookahead->next;
1025 return search_terms(cclp, qa);
1028 ccl_qualifier_t qa[2];
1029 struct ccl_rpn_node *node = 0;
1031 lookahead = cclp->look_token;
1034 for(seq = 0; ;seq++)
1036 struct ccl_rpn_node *node_sub;
1037 qa[0] = ccl_qual_search(cclp, "term", 4, seq);
1041 cclp->look_token = lookahead;
1043 node_sub = search_terms(cclp, qa);
1046 ccl_rpn_delete(node);
1051 struct ccl_rpn_node *node_this =
1052 ccl_rpn_node_create(CCL_RPN_OR);
1053 node_this->u.p[0] = node;
1054 node_this->u.p[1] = node_sub;
1055 node_this->u.p[2] = 0;
1062 node = search_terms(cclp, 0);
1068 * find_spec: Parse CCL find specification
1070 * qa: Qualifier attributes already applied.
1071 * return: pointer to node(s); NULL on error.
1073 static struct ccl_rpn_node *find_spec(CCL_parser cclp, ccl_qualifier_t *qa)
1075 struct ccl_rpn_node *p1, *p2, *pn;
1076 if (!(p1 = search_elements(cclp, qa)))
1084 p2 = search_elements(cclp, qa);
1090 pn = ccl_rpn_node_create(CCL_RPN_AND);
1098 p2 = search_elements(cclp, qa);
1104 pn = ccl_rpn_node_create(CCL_RPN_OR);
1112 p2 = search_elements(cclp, qa);
1118 pn = ccl_rpn_node_create(CCL_RPN_NOT);
1130 struct ccl_rpn_node *ccl_parser_find_str(CCL_parser cclp, const char *str)
1132 struct ccl_rpn_node *p;
1133 struct ccl_token *list = ccl_parser_tokenize(cclp, str);
1134 p = ccl_parser_find_token(cclp, list);
1135 ccl_token_del(list);
1139 struct ccl_rpn_node *ccl_parser_find_token(CCL_parser cclp,
1140 struct ccl_token *list)
1142 struct ccl_rpn_node *p;
1144 cclp->look_token = list;
1145 p = find_spec(cclp, NULL);
1146 if (p && KIND != CCL_TOK_EOL)
1148 if (KIND == CCL_TOK_RP)
1149 cclp->error_code = CCL_ERR_BAD_RP;
1151 cclp->error_code = CCL_ERR_OP_EXPECTED;
1155 cclp->error_pos = cclp->look_token->name;
1157 cclp->error_code = CCL_ERR_OK;
1159 cclp->error_code = cclp->error_code;
1164 * ccl_find_str: Parse CCL find - string representation
1165 * bibset: Bibset to be used for the parsing
1166 * str: String to be parsed
1167 * error: Pointer to integer. Holds error no. on completion.
1168 * pos: Pointer to char position. Holds approximate error position.
1169 * return: RPN tree on successful completion; NULL otherwise.
1171 struct ccl_rpn_node *ccl_find_str(CCL_bibset bibset, const char *str,
1172 int *error, int *pos)
1174 CCL_parser cclp = ccl_parser_create(bibset);
1175 struct ccl_token *list;
1176 struct ccl_rpn_node *p;
1178 list = ccl_parser_tokenize(cclp, str);
1179 p = ccl_parser_find_token(cclp, list);
1181 *error = cclp->error_code;
1183 *pos = cclp->error_pos - str;
1184 ccl_parser_destroy(cclp);
1185 ccl_token_del(list);
1192 * c-file-style: "Stroustrup"
1193 * indent-tabs-mode: nil
1195 * vim: shiftwidth=4 tabstop=8 expandtab