1 /* This file is part of the YAZ toolkit.
2 * Copyright (C) 1995-2012 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);
215 static size_t cmp_operator(const char **aliases, const char *input)
217 for (; *aliases; aliases++)
219 const char *cp = *aliases;
221 for (i = 0; *cp && *cp == input[i]; i++, cp++)
229 #define REGEX_CHARS "^[]{}()|.*+?!$"
230 #define CCL_CHARS "#?\\"
232 * search_term: Parse CCL search term.
234 * qa: Qualifier attributes already applied.
235 * term_list: tokens we accept as terms in context
236 * multi: whether we accept "multiple" tokens
237 * return: pointer to node(s); NULL on error.
239 static struct ccl_rpn_node *search_term_x(CCL_parser cclp,
241 int *term_list, int multi)
243 struct ccl_rpn_node *p_top = 0;
244 struct ccl_token *lookahead = cclp->look_token;
248 const char **truncation_aliases;
249 const char *t_default[2];
252 ccl_qual_search_special(cclp->bibset, "truncation");
253 if (!truncation_aliases)
255 truncation_aliases = t_default;
260 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_AND_LIST, 0))
262 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_OR_LIST, 0))
266 struct ccl_rpn_node *p;
269 int relation_value = -1;
270 int position_value = -1;
271 int structure_value = -1;
272 int truncation_value = -1;
273 int completeness_value = -1;
280 if (and_list || or_list || !multi)
283 /* ignore commas when dealing with and-lists .. */
284 if (and_list && lookahead && lookahead->kind == CCL_TOK_COMMA)
286 lookahead = lookahead->next;
290 /* go through each TERM token. If no truncation attribute is yet
291 met, then look for left/right truncation markers (?) and
292 set left_trunc/right_trunc/mid_trunc accordingly */
293 for (no = 0; no < max && is_term_ok(lookahead->kind, term_list); no++)
295 for (i = 0; i<lookahead->len; i++)
296 if (lookahead->name[i] == ' ')
298 len += 1+lookahead->len+lookahead->ws_prefix_len;
299 lookahead = lookahead->next;
303 break; /* no more terms . stop . */
305 /* create the term node, but wait a moment before adding the term */
306 p = ccl_rpn_node_create(CCL_RPN_TERM);
307 p->u.t.attr_list = NULL;
311 const char *n = ccl_qual_get_name(qa[0]);
313 p->u.t.qual = xstrdup(n);
316 /* go through all attributes and add them to the attribute list */
317 for (i=0; qa && qa[i]; i++)
319 struct ccl_rpn_attr *attr;
321 for (attr = ccl_qual_get_attr(qa[i]); attr; attr = attr->next)
324 case CCL_RPN_ATTR_STRING:
325 ccl_add_attr_string(p, attr->set, attr->type,
328 case CCL_RPN_ATTR_NUMERIC:
329 if (attr->value.numeric > 0)
330 { /* deal only with REAL attributes (positive) */
334 if (relation_value != -1)
336 relation_value = attr->value.numeric;
339 if (position_value != -1)
341 position_value = attr->value.numeric;
344 if (structure_value != -1)
346 structure_value = attr->value.numeric;
349 if (truncation_value != -1)
351 truncation_value = attr->value.numeric;
354 if (completeness_value != -1)
356 completeness_value = attr->value.numeric;
359 ccl_add_attr_numeric(p, attr->set, attr->type,
360 attr->value.numeric);
364 /* len now holds the number of characters in the RPN term */
365 /* no holds the number of CCL tokens (1 or more) */
367 if (structure_value == -1 &&
368 qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_WP, &attset))
369 { /* no structure attribute met. Apply either structure attribute
370 WORD or PHRASE depending on number of CCL tokens */
371 if (no == 1 && no_spaces == 0)
372 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 2);
374 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 1);
377 if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_REGEX,
380 regex_trunc = 1; /* regex trunc (102) allowed */
382 else if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_Z3958,
385 z3958_trunc = 1; /* Z39.58 trunc (CCL) trunc allowed */
388 /* make the RPN token */
389 p->u.t.term = (char *)xmalloc(len * 2 + 2);
390 ccl_assert(p->u.t.term);
391 p->u.t.term[0] = '\0';
392 for (i = 0; i<no; i++)
394 const char *src_str = cclp->look_token->name;
395 size_t src_len = cclp->look_token->len;
399 if (p->u.t.term[0] && cclp->look_token->ws_prefix_len)
401 strxcat(p->u.t.term, cclp->look_token->ws_prefix_buf,
402 cclp->look_token->ws_prefix_len);
404 for (j = 0; j < src_len; j++)
407 if (j > 0 && src_str[j-1] == '\\')
409 if (regex_trunc && strchr(REGEX_CHARS "\\", src_str[j]))
412 strcat(p->u.t.term, "\\");
414 else if (z3958_trunc && strchr(CCL_CHARS "\\", src_str[j]))
417 strcat(p->u.t.term, "\\");
419 strxcat(p->u.t.term, src_str + j, 1);
421 else if (src_str[j] == '"')
422 quote_mode = !quote_mode;
423 else if (!quote_mode &&
424 (op_size = cmp_operator(truncation_aliases,
428 j += (op_size - 1); /* j++ in for loop */
431 strcat(p->u.t.term, ".*");
432 regex_trunc = 2; /* regex trunc is really needed */
434 else if (z3958_trunc)
436 strcat(p->u.t.term, "?");
439 else if (i == 0 && j == 0)
441 else if (i == no - 1 && j == src_len - 1)
445 cclp->error_code = CCL_ERR_TRUNC_NOT_EMBED;
450 else if (!quote_mode && src_str[j] == '#')
454 strcat(p->u.t.term, ".");
455 regex_trunc = 2; /* regex trunc is really needed */
457 else if (z3958_trunc)
459 strcat(p->u.t.term, "#");
464 cclp->error_code = CCL_ERR_TRUNC_NOT_SINGLE;
469 else if (src_str[j] != '\\')
471 if (regex_trunc && strchr(REGEX_CHARS, src_str[j]))
474 strcat(p->u.t.term, "\\");
476 else if (z3958_trunc && strchr(CCL_CHARS, src_str[j]))
479 strcat(p->u.t.term, "\\");
481 strxcat(p->u.t.term, src_str + j, 1);
487 /* make the top node point to us.. */
490 struct ccl_rpn_node *tmp;
493 tmp = ccl_rpn_node_create(CCL_RPN_OR);
495 tmp = ccl_rpn_node_create(CCL_RPN_AND);
497 tmp = ccl_rpn_node_create(CCL_RPN_AND);
507 if (left_trunc && right_trunc)
509 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH,
512 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
516 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 3);
518 else if (right_trunc)
520 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT,
523 cclp->error_code = CCL_ERR_TRUNC_NOT_RIGHT;
527 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 1);
531 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT,
534 cclp->error_code = CCL_ERR_TRUNC_NOT_LEFT;
538 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 2);
540 else if (regex_trunc == 2)
542 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 102);
544 else if (z3958_trunc == 2)
546 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 104);
550 if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE,
552 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 100);
558 cclp->error_code = CCL_ERR_TERM_EXPECTED;
562 static struct ccl_rpn_node *search_term(CCL_parser cclp, ccl_qualifier_t *qa)
564 static int list[] = {CCL_TOK_TERM, CCL_TOK_COMMA, -1};
565 return search_term_x(cclp, qa, list, 0);
569 static struct ccl_rpn_node *search_terms2(CCL_parser cclp,
572 if (KIND == CCL_TOK_LP)
574 struct ccl_rpn_node *p;
576 if (!(p = find_spec(cclp, qa)))
578 if (KIND != CCL_TOK_RP)
580 cclp->error_code = CCL_ERR_RP_EXPECTED;
589 static int list[] = {
590 CCL_TOK_TERM, CCL_TOK_COMMA,CCL_TOK_EQ,
591 CCL_TOK_REL, CCL_TOK_SET, -1};
593 return search_term_x(cclp, qa, list, 1);
600 struct ccl_rpn_node *qualifiers_order(CCL_parser cclp,
601 ccl_qualifier_t *ap, char *attset)
604 struct ccl_rpn_node *p;
606 if (cclp->look_token->len == 1)
608 if (cclp->look_token->name[0] == '<')
610 else if (cclp->look_token->name[0] == '=')
612 else if (cclp->look_token->name[0] == '>')
615 else if (cclp->look_token->len == 2)
617 if (!memcmp(cclp->look_token->name, "<=", 2))
619 else if (!memcmp(cclp->look_token->name, ">=", 2))
621 else if (!memcmp(cclp->look_token->name, "<>", 2))
626 cclp->error_code = CCL_ERR_BAD_RELATION;
629 ADVANCE; /* skip relation */
631 qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, 0))
633 /* allow - inside term and treat it as range _always_ */
634 /* relation is =. Extract "embedded" - to separate terms */
635 if (KIND == CCL_TOK_TERM)
638 for (i = 0; i<cclp->look_token->len; i++)
640 if (cclp->look_token->name[i] == '-')
644 if (cclp->look_token->len > 1 && i == 0)
646 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
648 ntoken->kind = CCL_TOK_TERM;
649 ntoken->name = cclp->look_token->name + 1;
650 ntoken->len = cclp->look_token->len - 1;
652 cclp->look_token->len = 1;
653 cclp->look_token->name = "-";
655 else if (cclp->look_token->len > 1 && i == cclp->look_token->len-1)
657 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
659 ntoken->kind = CCL_TOK_TERM;
663 (cclp->look_token->len)--;
665 else if (cclp->look_token->len > 2 && i < cclp->look_token->len)
667 struct ccl_token *ntoken1 = ccl_token_add(cclp->look_token);
668 struct ccl_token *ntoken2 = ccl_token_add(ntoken1);
670 ntoken1->kind = CCL_TOK_TERM; /* generate - */
674 ntoken2->kind = CCL_TOK_TERM; /* generate yy */
675 ntoken2->name = cclp->look_token->name + (i+1);
676 ntoken2->len = cclp->look_token->len - (i+1);
678 cclp->look_token->len = i; /* adjust xx */
680 else if (i == cclp->look_token->len &&
681 cclp->look_token->next &&
682 cclp->look_token->next->kind == CCL_TOK_TERM &&
683 cclp->look_token->next->len > 1 &&
684 cclp->look_token->next->name[0] == '-')
687 /* we _know_ that xx does not have - in it */
688 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
690 ntoken->kind = CCL_TOK_TERM; /* generate - */
694 (ntoken->next->name)++; /* adjust yy */
695 (ntoken->next->len)--;
701 KIND == CCL_TOK_TERM &&
702 cclp->look_token->next && cclp->look_token->next->len == 1 &&
703 cclp->look_token->next->name[0] == '-')
705 struct ccl_rpn_node *p1;
706 if (!(p1 = search_term(cclp, ap)))
708 ADVANCE; /* skip '-' */
709 if (KIND == CCL_TOK_TERM) /* = term - term ? */
711 struct ccl_rpn_node *p2;
713 if (!(p2 = search_term(cclp, ap)))
718 p = ccl_rpn_node_create(CCL_RPN_AND);
720 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
722 ccl_add_attr_numeric(p2, attset, CCL_BIB1_REL, 2);
727 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
732 cclp->look_token->len == 1 &&
733 cclp->look_token->name[0] == '-') /* = - term ? */
736 if (!(p = search_term(cclp, ap)))
738 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, 2);
743 if (!(p = search_terms(cclp, ap)))
745 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, rel);
748 cclp->error_code = CCL_ERR_TERM_EXPECTED;
753 struct ccl_rpn_node *qualifier_relation(CCL_parser cclp, ccl_qualifier_t *ap)
757 if (qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_ORDER, &attset)
758 || qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, &attset))
759 return qualifiers_order(cclp, ap, attset);
761 /* unordered relation */
762 if (KIND != CCL_TOK_EQ)
764 cclp->error_code = CCL_ERR_EQ_EXPECTED;
768 return search_terms(cclp, ap);
772 * qualifier_list: Parse CCL qualifiers and search terms.
774 * la: Token pointer to RELATION token.
775 * qa: Qualifier attributes already applied.
776 * return: pointer to node(s); NULL on error.
778 static struct ccl_rpn_node *qualifier_list(CCL_parser cclp,
779 struct ccl_token *la,
782 struct ccl_token *lookahead = cclp->look_token;
783 struct ccl_token *look_start = cclp->look_token;
785 struct ccl_rpn_node *node = 0;
786 const char **field_str;
794 cclp->error_code = CCL_ERR_DOUBLE_QUAL;
798 for (lookahead = cclp->look_token; lookahead != la;
799 lookahead=lookahead->next)
802 for (i=0; qa[i]; i++)
804 ap = (ccl_qualifier_t *)xmalloc((no ? (no+1) : 2) * sizeof(*ap));
807 field_str = ccl_qual_search_special(cclp->bibset, "field");
810 if (!strcmp(field_str[0], "or"))
812 else if (!strcmp(field_str[0], "merge"))
817 /* consider each field separately and OR */
818 lookahead = look_start;
819 while (lookahead != la)
823 while ((ap[0] = ccl_qual_search(cclp, lookahead->name,
824 lookahead->len, seq)) != 0)
826 struct ccl_rpn_node *node_sub;
827 cclp->look_token = la;
829 node_sub = qualifier_relation(cclp, ap);
832 ccl_rpn_delete(node);
838 struct ccl_rpn_node *node_this =
839 ccl_rpn_node_create(CCL_RPN_OR);
840 node_this->u.p[0] = node;
841 node_this->u.p[1] = node_sub;
850 cclp->look_token = lookahead;
851 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
855 lookahead = lookahead->next;
856 if (lookahead->kind == CCL_TOK_COMMA)
857 lookahead = lookahead->next;
862 /* merge attributes from ALL fields - including inherited ones */
865 struct ccl_rpn_node *node_sub;
867 lookahead = look_start;
868 for (i = 0; lookahead != la; i++)
870 ap[i] = ccl_qual_search(cclp, lookahead->name,
871 lookahead->len, seq);
874 if (!ap[i] && seq > 0)
875 ap[i] = ccl_qual_search(cclp, lookahead->name,
879 cclp->look_token = lookahead;
880 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
884 lookahead = lookahead->next;
885 if (lookahead->kind == CCL_TOK_COMMA)
886 lookahead = lookahead->next;
890 ccl_qualifier_t *qa0 = qa;
900 cclp->look_token = lookahead;
902 node_sub = qualifier_relation(cclp, ap);
905 ccl_rpn_delete(node);
910 struct ccl_rpn_node *node_this =
911 ccl_rpn_node_create(CCL_RPN_OR);
912 node_this->u.p[0] = node;
913 node_this->u.p[1] = node_sub;
927 * search_terms: Parse CCL search terms - including proximity.
929 * qa: Qualifier attributes already applied.
930 * return: pointer to node(s); NULL on error.
932 static struct ccl_rpn_node *search_terms(CCL_parser cclp, ccl_qualifier_t *qa)
934 static int list[] = {
935 CCL_TOK_TERM, CCL_TOK_COMMA,CCL_TOK_EQ,
936 CCL_TOK_REL, CCL_TOK_SET, -1};
937 struct ccl_rpn_node *p1, *p2, *pn;
938 p1 = search_terms2(cclp, qa);
943 if (KIND == CCL_TOK_PROX)
945 struct ccl_rpn_node *p_prox = 0;
946 /* ! word order specified */
947 /* % word order not specified */
948 p_prox = ccl_rpn_node_create(CCL_RPN_TERM);
949 p_prox->u.t.term = (char *) xmalloc(1 + cclp->look_token->len);
950 memcpy(p_prox->u.t.term, cclp->look_token->name,
951 cclp->look_token->len);
952 p_prox->u.t.term[cclp->look_token->len] = 0;
953 p_prox->u.t.attr_list = 0;
956 p2 = search_terms2(cclp, qa);
962 pn = ccl_rpn_node_create(CCL_RPN_PROX);
968 else if (is_term_ok(KIND, list))
970 p2 = search_terms2(cclp, qa);
976 pn = ccl_rpn_node_create(CCL_RPN_PROX);
989 * search_elements: Parse CCL search elements
991 * qa: Qualifier attributes already applied.
992 * return: pointer to node(s); NULL on error.
994 static struct ccl_rpn_node *search_elements(CCL_parser cclp,
997 struct ccl_rpn_node *p1;
998 struct ccl_token *lookahead;
999 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 qualifier_list(cclp, lookahead, qa);
1021 if (lookahead->kind != CCL_TOK_COMMA)
1023 lookahead = lookahead->next;
1025 if (qa || lookahead->kind == CCL_TOK_LP)
1026 return search_terms(cclp, qa);
1029 ccl_qualifier_t 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, ccl_qualifier_t *qa)
1076 struct ccl_rpn_node *p1, *p2, *pn;
1077 if (!(p1 = search_elements(cclp, qa)))
1085 p2 = search_elements(cclp, qa);
1091 pn = ccl_rpn_node_create(CCL_RPN_AND);
1099 p2 = search_elements(cclp, qa);
1105 pn = ccl_rpn_node_create(CCL_RPN_OR);
1113 p2 = search_elements(cclp, qa);
1119 pn = ccl_rpn_node_create(CCL_RPN_NOT);
1131 struct ccl_rpn_node *ccl_parser_find_str(CCL_parser cclp, const char *str)
1133 struct ccl_rpn_node *p;
1134 struct ccl_token *list = ccl_parser_tokenize(cclp, str);
1135 p = ccl_parser_find_token(cclp, list);
1136 ccl_token_del(list);
1140 struct ccl_rpn_node *ccl_parser_find_token(CCL_parser cclp,
1141 struct ccl_token *list)
1143 struct ccl_rpn_node *p;
1145 cclp->look_token = list;
1146 p = find_spec(cclp, NULL);
1147 if (p && KIND != CCL_TOK_EOL)
1149 if (KIND == CCL_TOK_RP)
1150 cclp->error_code = CCL_ERR_BAD_RP;
1152 cclp->error_code = CCL_ERR_OP_EXPECTED;
1156 cclp->error_pos = cclp->look_token->name;
1158 cclp->error_code = CCL_ERR_OK;
1160 cclp->error_code = cclp->error_code;
1165 * ccl_find_str: Parse CCL find - string representation
1166 * bibset: Bibset to be used for the parsing
1167 * str: String to be parsed
1168 * error: Pointer to integer. Holds error no. on completion.
1169 * pos: Pointer to char position. Holds approximate error position.
1170 * return: RPN tree on successful completion; NULL otherwise.
1172 struct ccl_rpn_node *ccl_find_str(CCL_bibset bibset, const char *str,
1173 int *error, int *pos)
1175 CCL_parser cclp = ccl_parser_create(bibset);
1176 struct ccl_token *list;
1177 struct ccl_rpn_node *p;
1179 list = ccl_parser_tokenize(cclp, str);
1180 p = ccl_parser_find_token(cclp, list);
1182 *error = cclp->error_code;
1184 *pos = cclp->error_pos - str;
1185 ccl_parser_destroy(cclp);
1186 ccl_token_del(list);
1193 * c-file-style: "Stroustrup"
1194 * indent-tabs-mode: nil
1196 * vim: shiftwidth=4 tabstop=8 expandtab