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++)
230 #define REGEX_CHARS "^[]{}()|.*+?!$"
231 #define CCL_CHARS "#?\\"
232 static int append_term(CCL_parser cclp, const char *src_str, size_t src_len,
233 char *dst_term, int *regex_trunc, int *z3958_trunc,
234 const char **truncation_aliases,
235 int is_first, int is_last,
236 int *left_trunc, int *right_trunc)
241 for (j = 0; j < src_len; j++)
244 if (j > 0 && src_str[j-1] == '\\')
246 if (*regex_trunc && strchr(REGEX_CHARS "\\", src_str[j]))
249 strcat(dst_term, "\\");
251 else if (*z3958_trunc && strchr(CCL_CHARS "\\", src_str[j]))
254 strcat(dst_term, "\\");
256 strxcat(dst_term, src_str + j, 1);
258 else if (src_str[j] == '"')
259 quote_mode = !quote_mode;
260 else if (!quote_mode &&
261 (op_size = cmp_operator(truncation_aliases,
265 j += (op_size - 1); /* j++ in for loop */
268 strcat(dst_term, ".*");
269 *regex_trunc = 2; /* regex trunc is really needed */
271 else if (*z3958_trunc)
273 strcat(dst_term, "?");
276 else if (is_first && j == 0)
278 else if (is_last && j == src_len - 1)
282 cclp->error_code = CCL_ERR_TRUNC_NOT_EMBED;
286 else if (!quote_mode && src_str[j] == '#')
290 strcat(dst_term, ".");
291 *regex_trunc = 2; /* regex trunc is really needed */
293 else if (*z3958_trunc)
295 strcat(dst_term, "#");
300 cclp->error_code = CCL_ERR_TRUNC_NOT_SINGLE;
304 else if (src_str[j] != '\\')
306 if (*regex_trunc && strchr(REGEX_CHARS, src_str[j]))
309 strcat(dst_term, "\\");
311 else if (*z3958_trunc && strchr(CCL_CHARS, src_str[j]))
314 strcat(dst_term, "\\");
316 strxcat(dst_term, src_str + j, 1);
323 * search_term: Parse CCL search term.
325 * qa: Qualifier attributes already applied.
326 * term_list: tokens we accept as terms in context
327 * multi: whether we accept "multiple" tokens
328 * return: pointer to node(s); NULL on error.
330 static struct ccl_rpn_node *search_term_x(CCL_parser cclp,
332 int *term_list, int multi)
334 struct ccl_rpn_node *p_top = 0;
335 struct ccl_token *lookahead = cclp->look_token;
339 const char **truncation_aliases;
340 const char *t_default[2];
343 ccl_qual_search_special(cclp->bibset, "truncation");
344 if (!truncation_aliases)
346 truncation_aliases = t_default;
351 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_AND_LIST, 0))
353 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_OR_LIST, 0))
357 struct ccl_rpn_node *p;
360 int relation_value = -1;
361 int position_value = -1;
362 int structure_value = -1;
363 int truncation_value = -1;
364 int completeness_value = -1;
371 if (and_list || or_list || !multi)
374 /* ignore commas when dealing with and-lists .. */
375 if (and_list && lookahead && lookahead->kind == CCL_TOK_COMMA)
377 lookahead = lookahead->next;
381 /* go through each TERM token. If no truncation attribute is yet
382 met, then look for left/right truncation markers (?) and
383 set left_trunc/right_trunc/mid_trunc accordingly */
384 for (no = 0; no < max && is_term_ok(lookahead->kind, term_list); no++)
386 for (i = 0; i<lookahead->len; i++)
387 if (lookahead->name[i] == ' ')
389 len += 1+lookahead->len+lookahead->ws_prefix_len;
390 lookahead = lookahead->next;
394 break; /* no more terms . stop . */
396 /* create the term node, but wait a moment before adding the term */
397 p = ccl_rpn_node_create(CCL_RPN_TERM);
398 p->u.t.attr_list = NULL;
402 const char *n = ccl_qual_get_name(qa[0]);
404 p->u.t.qual = xstrdup(n);
407 /* go through all attributes and add them to the attribute list */
408 for (i=0; qa && qa[i]; i++)
410 struct ccl_rpn_attr *attr;
412 for (attr = ccl_qual_get_attr(qa[i]); attr; attr = attr->next)
415 case CCL_RPN_ATTR_STRING:
416 ccl_add_attr_string(p, attr->set, attr->type,
419 case CCL_RPN_ATTR_NUMERIC:
420 if (attr->value.numeric > 0)
421 { /* deal only with REAL attributes (positive) */
425 if (relation_value != -1)
427 relation_value = attr->value.numeric;
430 if (position_value != -1)
432 position_value = attr->value.numeric;
435 if (structure_value != -1)
437 structure_value = attr->value.numeric;
440 if (truncation_value != -1)
442 truncation_value = attr->value.numeric;
445 if (completeness_value != -1)
447 completeness_value = attr->value.numeric;
450 ccl_add_attr_numeric(p, attr->set, attr->type,
451 attr->value.numeric);
455 /* len now holds the number of characters in the RPN term */
456 /* no holds the number of CCL tokens (1 or more) */
458 if (structure_value == -1 &&
459 qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_WP, &attset))
460 { /* no structure attribute met. Apply either structure attribute
461 WORD or PHRASE depending on number of CCL tokens */
462 if (no == 1 && no_spaces == 0)
463 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 2);
465 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 1);
468 if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_REGEX,
471 regex_trunc = 1; /* regex trunc (102) allowed */
473 else if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_Z3958,
476 z3958_trunc = 1; /* Z39.58 trunc (CCL) trunc allowed */
479 /* make the RPN token */
480 p->u.t.term = (char *)xmalloc(len * 2 + 2);
481 ccl_assert(p->u.t.term);
482 p->u.t.term[0] = '\0';
483 for (i = 0; i<no; i++)
485 const char *src_str = cclp->look_token->name;
486 size_t src_len = cclp->look_token->len;
488 if (p->u.t.term[0] && cclp->look_token->ws_prefix_len)
490 strxcat(p->u.t.term, cclp->look_token->ws_prefix_buf,
491 cclp->look_token->ws_prefix_len);
493 if (append_term(cclp, src_str, src_len, p->u.t.term, ®ex_trunc,
494 &z3958_trunc, truncation_aliases, i == 0, i == no - 1,
495 &left_trunc, &right_trunc))
502 /* make the top node point to us.. */
505 struct ccl_rpn_node *tmp;
508 tmp = ccl_rpn_node_create(CCL_RPN_OR);
510 tmp = ccl_rpn_node_create(CCL_RPN_AND);
512 tmp = ccl_rpn_node_create(CCL_RPN_AND);
522 if (left_trunc && right_trunc)
524 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH,
527 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
531 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 3);
533 else if (right_trunc)
535 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT,
538 cclp->error_code = CCL_ERR_TRUNC_NOT_RIGHT;
542 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 1);
546 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT,
549 cclp->error_code = CCL_ERR_TRUNC_NOT_LEFT;
553 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 2);
555 else if (regex_trunc == 2)
557 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 102);
559 else if (z3958_trunc == 2)
561 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 104);
565 if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE,
567 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 100);
573 cclp->error_code = CCL_ERR_TERM_EXPECTED;
577 static struct ccl_rpn_node *search_term(CCL_parser cclp, ccl_qualifier_t *qa)
579 static int list[] = {CCL_TOK_TERM, CCL_TOK_COMMA, -1};
580 return search_term_x(cclp, qa, list, 0);
584 static struct ccl_rpn_node *search_terms2(CCL_parser cclp,
587 if (KIND == CCL_TOK_LP)
589 struct ccl_rpn_node *p;
591 if (!(p = find_spec(cclp, qa)))
593 if (KIND != CCL_TOK_RP)
595 cclp->error_code = CCL_ERR_RP_EXPECTED;
604 static int list[] = {
605 CCL_TOK_TERM, CCL_TOK_COMMA,CCL_TOK_EQ,
606 CCL_TOK_REL, CCL_TOK_SET, -1};
608 return search_term_x(cclp, qa, list, 1);
615 struct ccl_rpn_node *qualifiers_order(CCL_parser cclp,
616 ccl_qualifier_t *ap, char *attset)
619 struct ccl_rpn_node *p;
621 if (cclp->look_token->len == 1)
623 if (cclp->look_token->name[0] == '<')
625 else if (cclp->look_token->name[0] == '=')
627 else if (cclp->look_token->name[0] == '>')
630 else if (cclp->look_token->len == 2)
632 if (!memcmp(cclp->look_token->name, "<=", 2))
634 else if (!memcmp(cclp->look_token->name, ">=", 2))
636 else if (!memcmp(cclp->look_token->name, "<>", 2))
641 cclp->error_code = CCL_ERR_BAD_RELATION;
644 ADVANCE; /* skip relation */
646 qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, 0))
648 /* allow - inside term and treat it as range _always_ */
649 /* relation is =. Extract "embedded" - to separate terms */
650 if (KIND == CCL_TOK_TERM)
653 for (i = 0; i<cclp->look_token->len; i++)
655 if (cclp->look_token->name[i] == '-')
659 if (cclp->look_token->len > 1 && i == 0)
661 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
663 ntoken->kind = CCL_TOK_TERM;
664 ntoken->name = cclp->look_token->name + 1;
665 ntoken->len = cclp->look_token->len - 1;
667 cclp->look_token->len = 1;
668 cclp->look_token->name = "-";
670 else if (cclp->look_token->len > 1 && i == cclp->look_token->len-1)
672 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
674 ntoken->kind = CCL_TOK_TERM;
678 (cclp->look_token->len)--;
680 else if (cclp->look_token->len > 2 && i < cclp->look_token->len)
682 struct ccl_token *ntoken1 = ccl_token_add(cclp->look_token);
683 struct ccl_token *ntoken2 = ccl_token_add(ntoken1);
685 ntoken1->kind = CCL_TOK_TERM; /* generate - */
689 ntoken2->kind = CCL_TOK_TERM; /* generate yy */
690 ntoken2->name = cclp->look_token->name + (i+1);
691 ntoken2->len = cclp->look_token->len - (i+1);
693 cclp->look_token->len = i; /* adjust xx */
695 else if (i == cclp->look_token->len &&
696 cclp->look_token->next &&
697 cclp->look_token->next->kind == CCL_TOK_TERM &&
698 cclp->look_token->next->len > 1 &&
699 cclp->look_token->next->name[0] == '-')
702 /* we _know_ that xx does not have - in it */
703 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
705 ntoken->kind = CCL_TOK_TERM; /* generate - */
709 (ntoken->next->name)++; /* adjust yy */
710 (ntoken->next->len)--;
716 KIND == CCL_TOK_TERM &&
717 cclp->look_token->next && cclp->look_token->next->len == 1 &&
718 cclp->look_token->next->name[0] == '-')
720 struct ccl_rpn_node *p1;
721 if (!(p1 = search_term(cclp, ap)))
723 ADVANCE; /* skip '-' */
724 if (KIND == CCL_TOK_TERM) /* = term - term ? */
726 struct ccl_rpn_node *p2;
728 if (!(p2 = search_term(cclp, ap)))
733 p = ccl_rpn_node_create(CCL_RPN_AND);
735 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
737 ccl_add_attr_numeric(p2, attset, CCL_BIB1_REL, 2);
742 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
747 cclp->look_token->len == 1 &&
748 cclp->look_token->name[0] == '-') /* = - term ? */
751 if (!(p = search_term(cclp, ap)))
753 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, 2);
758 if (!(p = search_terms(cclp, ap)))
760 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, rel);
763 cclp->error_code = CCL_ERR_TERM_EXPECTED;
768 struct ccl_rpn_node *qualifier_relation(CCL_parser cclp, ccl_qualifier_t *ap)
772 if (qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_ORDER, &attset)
773 || qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, &attset))
774 return qualifiers_order(cclp, ap, attset);
776 /* unordered relation */
777 if (KIND != CCL_TOK_EQ)
779 cclp->error_code = CCL_ERR_EQ_EXPECTED;
783 return search_terms(cclp, ap);
787 * qualifier_list: Parse CCL qualifiers and search terms.
789 * la: Token pointer to RELATION token.
790 * qa: Qualifier attributes already applied.
791 * return: pointer to node(s); NULL on error.
793 static struct ccl_rpn_node *qualifier_list(CCL_parser cclp,
794 struct ccl_token *la,
797 struct ccl_token *lookahead = cclp->look_token;
798 struct ccl_token *look_start = cclp->look_token;
800 struct ccl_rpn_node *node = 0;
801 const char **field_str;
809 cclp->error_code = CCL_ERR_DOUBLE_QUAL;
813 for (lookahead = cclp->look_token; lookahead != la;
814 lookahead=lookahead->next)
817 for (i=0; qa[i]; i++)
819 ap = (ccl_qualifier_t *)xmalloc((no ? (no+1) : 2) * sizeof(*ap));
822 field_str = ccl_qual_search_special(cclp->bibset, "field");
825 if (!strcmp(field_str[0], "or"))
827 else if (!strcmp(field_str[0], "merge"))
832 /* consider each field separately and OR */
833 lookahead = look_start;
834 while (lookahead != la)
838 while ((ap[0] = ccl_qual_search(cclp, lookahead->name,
839 lookahead->len, seq)) != 0)
841 struct ccl_rpn_node *node_sub;
842 cclp->look_token = la;
844 node_sub = qualifier_relation(cclp, ap);
847 ccl_rpn_delete(node);
853 struct ccl_rpn_node *node_this =
854 ccl_rpn_node_create(CCL_RPN_OR);
855 node_this->u.p[0] = node;
856 node_this->u.p[1] = node_sub;
865 cclp->look_token = lookahead;
866 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
870 lookahead = lookahead->next;
871 if (lookahead->kind == CCL_TOK_COMMA)
872 lookahead = lookahead->next;
877 /* merge attributes from ALL fields - including inherited ones */
880 struct ccl_rpn_node *node_sub;
882 lookahead = look_start;
883 for (i = 0; lookahead != la; i++)
885 ap[i] = ccl_qual_search(cclp, lookahead->name,
886 lookahead->len, seq);
889 if (!ap[i] && seq > 0)
890 ap[i] = ccl_qual_search(cclp, lookahead->name,
894 cclp->look_token = lookahead;
895 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
899 lookahead = lookahead->next;
900 if (lookahead->kind == CCL_TOK_COMMA)
901 lookahead = lookahead->next;
905 ccl_qualifier_t *qa0 = qa;
915 cclp->look_token = lookahead;
917 node_sub = qualifier_relation(cclp, ap);
920 ccl_rpn_delete(node);
925 struct ccl_rpn_node *node_this =
926 ccl_rpn_node_create(CCL_RPN_OR);
927 node_this->u.p[0] = node;
928 node_this->u.p[1] = node_sub;
942 * search_terms: Parse CCL search terms - including proximity.
944 * qa: Qualifier attributes already applied.
945 * return: pointer to node(s); NULL on error.
947 static struct ccl_rpn_node *search_terms(CCL_parser cclp, ccl_qualifier_t *qa)
949 static int list[] = {
950 CCL_TOK_TERM, CCL_TOK_COMMA,CCL_TOK_EQ,
951 CCL_TOK_REL, CCL_TOK_SET, -1};
952 struct ccl_rpn_node *p1, *p2, *pn;
953 p1 = search_terms2(cclp, qa);
958 if (KIND == CCL_TOK_PROX)
960 struct ccl_rpn_node *p_prox = 0;
961 /* ! word order specified */
962 /* % word order not specified */
963 p_prox = ccl_rpn_node_create(CCL_RPN_TERM);
964 p_prox->u.t.term = (char *) xmalloc(1 + cclp->look_token->len);
965 memcpy(p_prox->u.t.term, cclp->look_token->name,
966 cclp->look_token->len);
967 p_prox->u.t.term[cclp->look_token->len] = 0;
968 p_prox->u.t.attr_list = 0;
971 p2 = search_terms2(cclp, qa);
977 pn = ccl_rpn_node_create(CCL_RPN_PROX);
983 else if (is_term_ok(KIND, list))
985 p2 = search_terms2(cclp, qa);
991 pn = ccl_rpn_node_create(CCL_RPN_PROX);
1004 * search_elements: Parse CCL search elements
1006 * qa: Qualifier attributes already applied.
1007 * return: pointer to node(s); NULL on error.
1009 static struct ccl_rpn_node *search_elements(CCL_parser cclp,
1010 ccl_qualifier_t *qa)
1012 struct ccl_rpn_node *p1;
1013 struct ccl_token *lookahead;
1014 if (KIND == CCL_TOK_SET)
1017 if (KIND == CCL_TOK_EQ)
1019 if (KIND != CCL_TOK_TERM)
1021 cclp->error_code = CCL_ERR_SETNAME_EXPECTED;
1024 p1 = ccl_rpn_node_create(CCL_RPN_SET);
1025 p1->u.setname = copy_token_name(cclp->look_token);
1029 lookahead = cclp->look_token;
1031 while (lookahead->kind==CCL_TOK_TERM)
1033 lookahead = lookahead->next;
1034 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
1035 return qualifier_list(cclp, lookahead, qa);
1036 if (lookahead->kind != CCL_TOK_COMMA)
1038 lookahead = lookahead->next;
1040 if (qa || lookahead->kind == CCL_TOK_LP)
1041 return search_terms(cclp, qa);
1044 ccl_qualifier_t qa[2];
1045 struct ccl_rpn_node *node = 0;
1047 lookahead = cclp->look_token;
1050 for(seq = 0; ;seq++)
1052 struct ccl_rpn_node *node_sub;
1053 qa[0] = ccl_qual_search(cclp, "term", 4, seq);
1057 cclp->look_token = lookahead;
1059 node_sub = search_terms(cclp, qa);
1062 ccl_rpn_delete(node);
1067 struct ccl_rpn_node *node_this =
1068 ccl_rpn_node_create(CCL_RPN_OR);
1069 node_this->u.p[0] = node;
1070 node_this->u.p[1] = node_sub;
1071 node_this->u.p[2] = 0;
1078 node = search_terms(cclp, 0);
1084 * find_spec: Parse CCL find specification
1086 * qa: Qualifier attributes already applied.
1087 * return: pointer to node(s); NULL on error.
1089 static struct ccl_rpn_node *find_spec(CCL_parser cclp, ccl_qualifier_t *qa)
1091 struct ccl_rpn_node *p1, *p2, *pn;
1092 if (!(p1 = search_elements(cclp, qa)))
1100 p2 = search_elements(cclp, qa);
1106 pn = ccl_rpn_node_create(CCL_RPN_AND);
1114 p2 = search_elements(cclp, qa);
1120 pn = ccl_rpn_node_create(CCL_RPN_OR);
1128 p2 = search_elements(cclp, qa);
1134 pn = ccl_rpn_node_create(CCL_RPN_NOT);
1146 struct ccl_rpn_node *ccl_parser_find_str(CCL_parser cclp, const char *str)
1148 struct ccl_rpn_node *p;
1149 struct ccl_token *list = ccl_parser_tokenize(cclp, str);
1150 p = ccl_parser_find_token(cclp, list);
1151 ccl_token_del(list);
1155 struct ccl_rpn_node *ccl_parser_find_token(CCL_parser cclp,
1156 struct ccl_token *list)
1158 struct ccl_rpn_node *p;
1160 cclp->look_token = list;
1161 p = find_spec(cclp, NULL);
1162 if (p && KIND != CCL_TOK_EOL)
1164 if (KIND == CCL_TOK_RP)
1165 cclp->error_code = CCL_ERR_BAD_RP;
1167 cclp->error_code = CCL_ERR_OP_EXPECTED;
1171 cclp->error_pos = cclp->look_token->name;
1173 cclp->error_code = CCL_ERR_OK;
1175 cclp->error_code = cclp->error_code;
1180 * ccl_find_str: Parse CCL find - string representation
1181 * bibset: Bibset to be used for the parsing
1182 * str: String to be parsed
1183 * error: Pointer to integer. Holds error no. on completion.
1184 * pos: Pointer to char position. Holds approximate error position.
1185 * return: RPN tree on successful completion; NULL otherwise.
1187 struct ccl_rpn_node *ccl_find_str(CCL_bibset bibset, const char *str,
1188 int *error, int *pos)
1190 CCL_parser cclp = ccl_parser_create(bibset);
1191 struct ccl_token *list;
1192 struct ccl_rpn_node *p;
1194 list = ccl_parser_tokenize(cclp, str);
1195 p = ccl_parser_find_token(cclp, list);
1197 *error = cclp->error_code;
1199 *pos = cclp->error_pos - str;
1200 ccl_parser_destroy(cclp);
1201 ccl_token_del(list);
1208 * c-file-style: "Stroustrup"
1209 * indent-tabs-mode: nil
1211 * vim: shiftwidth=4 tabstop=8 expandtab