1 /* This file is part of the YAZ toolkit.
2 * Copyright (C) 1995-2013 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;
340 const char **truncation_aliases;
341 const char *t_default[2];
344 ccl_qual_search_special(cclp->bibset, "truncation");
345 if (!truncation_aliases)
347 truncation_aliases = t_default;
352 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_AND_LIST, 0))
354 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_AUTO_GROUP, 0))
356 if (qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_OR_LIST, 0))
360 struct ccl_rpn_node *p;
363 int relation_value = -1;
364 int position_value = -1;
365 int structure_value = -1;
366 int truncation_value = -1;
367 int completeness_value = -1;
374 if (and_list || or_list || !multi)
377 /* ignore commas when dealing with and-lists .. */
378 if (and_list && lookahead && lookahead->kind == CCL_TOK_COMMA)
380 lookahead = lookahead->next;
384 for (no = 0; no < max && is_term_ok(lookahead->kind, term_list); no++)
386 int this_is_phrase = 0;
387 for (i = 0; i<lookahead->len; i++)
388 if (lookahead->name[i] == ' ')
393 if (no > 0 && (is_phrase || is_phrase != this_is_phrase))
395 is_phrase = this_is_phrase;
397 else if (this_is_phrase || no > 0)
399 len += 1+lookahead->len+lookahead->ws_prefix_len;
400 lookahead = lookahead->next;
404 break; /* no more terms . stop . */
406 /* create the term node, but wait a moment before adding the term */
407 p = ccl_rpn_node_create(CCL_RPN_TERM);
408 p->u.t.attr_list = NULL;
412 const char *n = ccl_qual_get_name(qa[0]);
414 p->u.t.qual = xstrdup(n);
417 /* go through all attributes and add them to the attribute list */
418 for (i=0; qa && qa[i]; i++)
420 struct ccl_rpn_attr *attr;
422 for (attr = ccl_qual_get_attr(qa[i]); attr; attr = attr->next)
425 case CCL_RPN_ATTR_STRING:
426 ccl_add_attr_string(p, attr->set, attr->type,
429 case CCL_RPN_ATTR_NUMERIC:
430 if (attr->value.numeric > 0)
431 { /* deal only with REAL attributes (positive) */
435 if (relation_value != -1)
437 relation_value = attr->value.numeric;
440 if (position_value != -1)
442 position_value = attr->value.numeric;
445 if (structure_value != -1)
447 structure_value = attr->value.numeric;
450 if (truncation_value != -1)
452 truncation_value = attr->value.numeric;
455 if (completeness_value != -1)
457 completeness_value = attr->value.numeric;
460 ccl_add_attr_numeric(p, attr->set, attr->type,
461 attr->value.numeric);
466 if (structure_value == -1 && (
468 qual_val_type(qa, CCL_BIB1_STR, CCL_BIB1_STR_WP, &attset))
472 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 2);
474 ccl_add_attr_numeric(p, attset, CCL_BIB1_STR, 1);
477 if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_REGEX,
480 regex_trunc = 1; /* regex trunc (102) allowed */
482 else if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_Z3958,
485 z3958_trunc = 1; /* Z39.58 trunc (CCL) trunc allowed */
488 /* make the RPN token */
489 p->u.t.term = (char *)xmalloc(len * 2 + 2);
490 ccl_assert(p->u.t.term);
491 p->u.t.term[0] = '\0';
492 for (i = 0; i<no; i++)
494 const char *src_str = cclp->look_token->name;
495 size_t src_len = cclp->look_token->len;
497 if (p->u.t.term[0] && cclp->look_token->ws_prefix_len)
499 strxcat(p->u.t.term, cclp->look_token->ws_prefix_buf,
500 cclp->look_token->ws_prefix_len);
502 if (append_term(cclp, src_str, src_len, p->u.t.term, ®ex_trunc,
503 &z3958_trunc, truncation_aliases, i == 0, i == no - 1,
504 &left_trunc, &right_trunc))
511 /* make the top node point to us.. */
514 struct ccl_rpn_node *tmp;
517 tmp = ccl_rpn_node_create(CCL_RPN_OR);
519 tmp = ccl_rpn_node_create(CCL_RPN_AND);
521 tmp = ccl_rpn_node_create(CCL_RPN_AND);
531 if (left_trunc && right_trunc)
533 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH,
536 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
540 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 3);
542 else if (right_trunc)
544 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT,
547 cclp->error_code = CCL_ERR_TRUNC_NOT_RIGHT;
551 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 1);
555 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT,
558 cclp->error_code = CCL_ERR_TRUNC_NOT_LEFT;
562 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 2);
564 else if (regex_trunc == 2)
566 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 102);
568 else if (z3958_trunc == 2)
570 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 104);
574 if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE,
576 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 100);
582 cclp->error_code = CCL_ERR_TERM_EXPECTED;
586 static struct ccl_rpn_node *search_term(CCL_parser cclp, ccl_qualifier_t *qa)
588 static int list[] = {CCL_TOK_TERM, CCL_TOK_COMMA, -1};
589 return search_term_x(cclp, qa, list, 0);
593 static struct ccl_rpn_node *search_terms2(CCL_parser cclp,
596 if (KIND == CCL_TOK_LP)
598 struct ccl_rpn_node *p;
600 if (!(p = find_spec(cclp, qa)))
602 if (KIND != CCL_TOK_RP)
604 cclp->error_code = CCL_ERR_RP_EXPECTED;
613 static int list[] = {
614 CCL_TOK_TERM, CCL_TOK_COMMA,CCL_TOK_EQ,
615 CCL_TOK_REL, CCL_TOK_SET, -1};
617 return search_term_x(cclp, qa, list, 1);
624 struct ccl_rpn_node *qualifiers_order(CCL_parser cclp,
625 ccl_qualifier_t *ap, char *attset)
628 struct ccl_rpn_node *p;
630 if (cclp->look_token->len == 1)
632 if (cclp->look_token->name[0] == '<')
634 else if (cclp->look_token->name[0] == '=')
636 else if (cclp->look_token->name[0] == '>')
639 else if (cclp->look_token->len == 2)
641 if (!memcmp(cclp->look_token->name, "<=", 2))
643 else if (!memcmp(cclp->look_token->name, ">=", 2))
645 else if (!memcmp(cclp->look_token->name, "<>", 2))
650 cclp->error_code = CCL_ERR_BAD_RELATION;
653 ADVANCE; /* skip relation */
655 qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, 0))
657 /* allow - inside term and treat it as range _always_ */
658 /* relation is =. Extract "embedded" - to separate terms */
659 if (KIND == CCL_TOK_TERM)
662 for (i = 0; i<cclp->look_token->len; i++)
664 if (cclp->look_token->name[i] == '-')
668 if (cclp->look_token->len > 1 && i == 0)
670 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
672 ntoken->kind = CCL_TOK_TERM;
673 ntoken->name = cclp->look_token->name + 1;
674 ntoken->len = cclp->look_token->len - 1;
676 cclp->look_token->len = 1;
677 cclp->look_token->name = "-";
679 else if (cclp->look_token->len > 1 && i == cclp->look_token->len-1)
681 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
683 ntoken->kind = CCL_TOK_TERM;
687 (cclp->look_token->len)--;
689 else if (cclp->look_token->len > 2 && i < cclp->look_token->len)
691 struct ccl_token *ntoken1 = ccl_token_add(cclp->look_token);
692 struct ccl_token *ntoken2 = ccl_token_add(ntoken1);
694 ntoken1->kind = CCL_TOK_TERM; /* generate - */
698 ntoken2->kind = CCL_TOK_TERM; /* generate yy */
699 ntoken2->name = cclp->look_token->name + (i+1);
700 ntoken2->len = cclp->look_token->len - (i+1);
702 cclp->look_token->len = i; /* adjust xx */
704 else if (i == cclp->look_token->len &&
705 cclp->look_token->next &&
706 cclp->look_token->next->kind == CCL_TOK_TERM &&
707 cclp->look_token->next->len > 1 &&
708 cclp->look_token->next->name[0] == '-')
711 /* we _know_ that xx does not have - in it */
712 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
714 ntoken->kind = CCL_TOK_TERM; /* generate - */
718 (ntoken->next->name)++; /* adjust yy */
719 (ntoken->next->len)--;
725 KIND == CCL_TOK_TERM &&
726 cclp->look_token->next && cclp->look_token->next->len == 1 &&
727 cclp->look_token->next->name[0] == '-')
729 struct ccl_rpn_node *p1;
730 if (!(p1 = search_term(cclp, ap)))
732 ADVANCE; /* skip '-' */
733 if (KIND == CCL_TOK_TERM) /* = term - term ? */
735 struct ccl_rpn_node *p2;
737 if (!(p2 = search_term(cclp, ap)))
742 p = ccl_rpn_node_create(CCL_RPN_AND);
744 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
746 ccl_add_attr_numeric(p2, attset, CCL_BIB1_REL, 2);
751 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
756 cclp->look_token->len == 1 &&
757 cclp->look_token->name[0] == '-') /* = - term ? */
760 if (!(p = search_term(cclp, ap)))
762 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, 2);
767 if (!(p = search_terms(cclp, ap)))
769 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, rel);
772 cclp->error_code = CCL_ERR_TERM_EXPECTED;
777 struct ccl_rpn_node *qualifier_relation(CCL_parser cclp, ccl_qualifier_t *ap)
781 if (qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_ORDER, &attset)
782 || qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, &attset))
783 return qualifiers_order(cclp, ap, attset);
785 /* unordered relation */
786 if (KIND != CCL_TOK_EQ)
788 cclp->error_code = CCL_ERR_EQ_EXPECTED;
792 return search_terms(cclp, ap);
796 * qualifier_list: Parse CCL qualifiers and search terms.
798 * la: Token pointer to RELATION token.
799 * qa: Qualifier attributes already applied.
800 * return: pointer to node(s); NULL on error.
802 static struct ccl_rpn_node *qualifier_list(CCL_parser cclp,
803 struct ccl_token *la,
806 struct ccl_token *lookahead = cclp->look_token;
807 struct ccl_token *look_start = cclp->look_token;
809 struct ccl_rpn_node *node = 0;
810 const char **field_str;
818 cclp->error_code = CCL_ERR_DOUBLE_QUAL;
822 for (lookahead = cclp->look_token; lookahead != la;
823 lookahead=lookahead->next)
826 for (i=0; qa[i]; i++)
828 ap = (ccl_qualifier_t *)xmalloc((no ? (no+1) : 2) * sizeof(*ap));
831 field_str = ccl_qual_search_special(cclp->bibset, "field");
834 if (!strcmp(field_str[0], "or"))
836 else if (!strcmp(field_str[0], "merge"))
841 /* consider each field separately and OR */
842 lookahead = look_start;
843 while (lookahead != la)
847 while ((ap[0] = ccl_qual_search(cclp, lookahead->name,
848 lookahead->len, seq)) != 0)
850 struct ccl_rpn_node *node_sub;
851 cclp->look_token = la;
853 node_sub = qualifier_relation(cclp, ap);
856 ccl_rpn_delete(node);
862 struct ccl_rpn_node *node_this =
863 ccl_rpn_node_create(CCL_RPN_OR);
864 node_this->u.p[0] = node;
865 node_this->u.p[1] = node_sub;
874 cclp->look_token = lookahead;
875 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
879 lookahead = lookahead->next;
880 if (lookahead->kind == CCL_TOK_COMMA)
881 lookahead = lookahead->next;
886 /* merge attributes from ALL fields - including inherited ones */
889 struct ccl_rpn_node *node_sub;
891 lookahead = look_start;
892 for (i = 0; lookahead != la; i++)
894 ap[i] = ccl_qual_search(cclp, lookahead->name,
895 lookahead->len, seq);
898 if (!ap[i] && seq > 0)
899 ap[i] = ccl_qual_search(cclp, lookahead->name,
903 cclp->look_token = lookahead;
904 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
908 lookahead = lookahead->next;
909 if (lookahead->kind == CCL_TOK_COMMA)
910 lookahead = lookahead->next;
914 ccl_qualifier_t *qa0 = qa;
924 cclp->look_token = lookahead;
926 node_sub = qualifier_relation(cclp, ap);
929 ccl_rpn_delete(node);
934 struct ccl_rpn_node *node_this =
935 ccl_rpn_node_create(CCL_RPN_OR);
936 node_this->u.p[0] = node;
937 node_this->u.p[1] = node_sub;
951 * search_terms: Parse CCL search terms - including proximity.
953 * qa: Qualifier attributes already applied.
954 * return: pointer to node(s); NULL on error.
956 static struct ccl_rpn_node *search_terms(CCL_parser cclp, ccl_qualifier_t *qa)
958 static int list[] = {
959 CCL_TOK_TERM, CCL_TOK_COMMA,CCL_TOK_EQ,
960 CCL_TOK_REL, CCL_TOK_SET, -1};
961 struct ccl_rpn_node *p1, *p2, *pn;
962 p1 = search_terms2(cclp, qa);
967 if (KIND == CCL_TOK_PROX)
969 struct ccl_rpn_node *p_prox = 0;
970 /* ! word order specified */
971 /* % word order not specified */
972 p_prox = ccl_rpn_node_create(CCL_RPN_TERM);
973 p_prox->u.t.term = (char *) xmalloc(1 + cclp->look_token->len);
974 memcpy(p_prox->u.t.term, cclp->look_token->name,
975 cclp->look_token->len);
976 p_prox->u.t.term[cclp->look_token->len] = 0;
977 p_prox->u.t.attr_list = 0;
980 p2 = search_terms2(cclp, qa);
986 pn = ccl_rpn_node_create(CCL_RPN_PROX);
992 else if (is_term_ok(KIND, list))
994 p2 = search_terms2(cclp, qa);
1000 pn = ccl_rpn_node_create(CCL_RPN_PROX);
1013 * search_elements: Parse CCL search elements
1015 * qa: Qualifier attributes already applied.
1016 * return: pointer to node(s); NULL on error.
1018 static struct ccl_rpn_node *search_elements(CCL_parser cclp,
1019 ccl_qualifier_t *qa)
1021 struct ccl_rpn_node *p1;
1022 struct ccl_token *lookahead;
1023 if (KIND == CCL_TOK_SET)
1026 if (KIND == CCL_TOK_EQ)
1028 if (KIND != CCL_TOK_TERM)
1030 cclp->error_code = CCL_ERR_SETNAME_EXPECTED;
1033 p1 = ccl_rpn_node_create(CCL_RPN_SET);
1034 p1->u.setname = copy_token_name(cclp->look_token);
1038 lookahead = cclp->look_token;
1040 while (lookahead->kind==CCL_TOK_TERM)
1042 lookahead = lookahead->next;
1043 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
1044 return qualifier_list(cclp, lookahead, qa);
1045 if (lookahead->kind != CCL_TOK_COMMA)
1047 lookahead = lookahead->next;
1049 if (qa || lookahead->kind == CCL_TOK_LP)
1050 return search_terms(cclp, qa);
1053 ccl_qualifier_t qa[2];
1054 struct ccl_rpn_node *node = 0;
1056 lookahead = cclp->look_token;
1059 for(seq = 0; ;seq++)
1061 struct ccl_rpn_node *node_sub;
1062 qa[0] = ccl_qual_search(cclp, "term", 4, seq);
1066 cclp->look_token = lookahead;
1068 node_sub = search_terms(cclp, qa);
1071 ccl_rpn_delete(node);
1076 struct ccl_rpn_node *node_this =
1077 ccl_rpn_node_create(CCL_RPN_OR);
1078 node_this->u.p[0] = node;
1079 node_this->u.p[1] = node_sub;
1080 node_this->u.p[2] = 0;
1087 node = search_terms(cclp, 0);
1093 * find_spec: Parse CCL find specification
1095 * qa: Qualifier attributes already applied.
1096 * return: pointer to node(s); NULL on error.
1098 static struct ccl_rpn_node *find_spec(CCL_parser cclp, ccl_qualifier_t *qa)
1100 struct ccl_rpn_node *p1, *p2, *pn;
1101 if (!(p1 = search_elements(cclp, qa)))
1109 p2 = search_elements(cclp, qa);
1115 pn = ccl_rpn_node_create(CCL_RPN_AND);
1123 p2 = search_elements(cclp, qa);
1129 pn = ccl_rpn_node_create(CCL_RPN_OR);
1137 p2 = search_elements(cclp, qa);
1143 pn = ccl_rpn_node_create(CCL_RPN_NOT);
1155 struct ccl_rpn_node *ccl_parser_find_str(CCL_parser cclp, const char *str)
1157 struct ccl_rpn_node *p;
1158 struct ccl_token *list = ccl_parser_tokenize(cclp, str);
1159 p = ccl_parser_find_token(cclp, list);
1160 ccl_token_del(list);
1164 struct ccl_rpn_node *ccl_parser_find_token(CCL_parser cclp,
1165 struct ccl_token *list)
1167 struct ccl_rpn_node *p;
1169 cclp->look_token = list;
1170 p = find_spec(cclp, NULL);
1171 if (p && KIND != CCL_TOK_EOL)
1173 if (KIND == CCL_TOK_RP)
1174 cclp->error_code = CCL_ERR_BAD_RP;
1176 cclp->error_code = CCL_ERR_OP_EXPECTED;
1180 cclp->error_pos = cclp->look_token->name;
1182 cclp->error_code = CCL_ERR_OK;
1184 cclp->error_code = cclp->error_code;
1189 * ccl_find_str: Parse CCL find - string representation
1190 * bibset: Bibset to be used for the parsing
1191 * str: String to be parsed
1192 * error: Pointer to integer. Holds error no. on completion.
1193 * pos: Pointer to char position. Holds approximate error position.
1194 * return: RPN tree on successful completion; NULL otherwise.
1196 struct ccl_rpn_node *ccl_find_str(CCL_bibset bibset, const char *str,
1197 int *error, int *pos)
1199 CCL_parser cclp = ccl_parser_create(bibset);
1200 struct ccl_token *list;
1201 struct ccl_rpn_node *p;
1203 list = ccl_parser_tokenize(cclp, str);
1204 p = ccl_parser_find_token(cclp, list);
1206 *error = cclp->error_code;
1208 *pos = cclp->error_pos - str;
1209 ccl_parser_destroy(cclp);
1210 ccl_token_del(list);
1217 * c-file-style: "Stroustrup"
1218 * indent-tabs-mode: nil
1220 * vim: shiftwidth=4 tabstop=8 expandtab