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 strxcat(p->u.t.term, cclp->look_token->ws_prefix_buf,
389 cclp->look_token->ws_prefix_len);
391 for (j = 0; j < src_len; j++)
393 if (j > 0 && src_str[j-1] == '\\')
395 if (regex_trunc && strchr(REGEX_CHARS "\\", src_str[j]))
398 strcat(p->u.t.term, "\\");
400 else if (z3958_trunc && strchr(CCL_CHARS "\\", src_str[j]))
403 strcat(p->u.t.term, "\\");
405 strxcat(p->u.t.term, src_str + j, 1);
407 else if (src_str[j] == '"')
408 quote_mode = !quote_mode;
409 else if (!quote_mode && src_str[j] == '?')
413 strcat(p->u.t.term, ".*");
414 regex_trunc = 2; /* regex trunc is really needed */
416 else if (z3958_trunc)
418 strcat(p->u.t.term, "?");
421 else if (i == 0 && j == 0)
423 else if (i == no - 1 && j == src_len - 1)
427 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
432 else if (!quote_mode && src_str[j] == '#')
436 strcat(p->u.t.term, ".");
437 regex_trunc = 2; /* regex trunc is really needed */
439 else if (z3958_trunc)
441 strcat(p->u.t.term, "#");
446 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
451 else if (src_str[j] != '\\')
453 if (regex_trunc && strchr(REGEX_CHARS, src_str[j]))
456 strcat(p->u.t.term, "\\");
458 else if (z3958_trunc && strchr(CCL_CHARS, src_str[j]))
461 strcat(p->u.t.term, "\\");
463 strxcat(p->u.t.term, src_str + j, 1);
469 /* make the top node point to us.. */
472 struct ccl_rpn_node *tmp;
475 tmp = ccl_rpn_node_create(CCL_RPN_OR);
477 tmp = ccl_rpn_node_create(CCL_RPN_AND);
479 tmp = ccl_rpn_node_create(CCL_RPN_AND);
489 if (left_trunc && right_trunc)
491 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH,
494 cclp->error_code = CCL_ERR_TRUNC_NOT_BOTH;
498 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 3);
500 else if (right_trunc)
502 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT,
505 cclp->error_code = CCL_ERR_TRUNC_NOT_RIGHT;
509 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 1);
513 if (!qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT,
516 cclp->error_code = CCL_ERR_TRUNC_NOT_LEFT;
520 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 2);
522 else if (regex_trunc == 2)
524 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 102);
526 else if (z3958_trunc == 2)
528 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 104);
532 if (qual_val_type(qa, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE,
534 ccl_add_attr_numeric(p, attset, CCL_BIB1_TRU, 100);
540 cclp->error_code = CCL_ERR_TERM_EXPECTED;
544 static struct ccl_rpn_node *search_term(CCL_parser cclp, ccl_qualifier_t *qa)
546 static int list[] = {CCL_TOK_TERM, CCL_TOK_COMMA, -1};
547 return search_term_x(cclp, qa, list, 0);
551 struct ccl_rpn_node *qualifiers_order(CCL_parser cclp,
552 ccl_qualifier_t *ap, char *attset)
555 struct ccl_rpn_node *p;
557 if (cclp->look_token->len == 1)
559 if (cclp->look_token->name[0] == '<')
561 else if (cclp->look_token->name[0] == '=')
563 else if (cclp->look_token->name[0] == '>')
566 else if (cclp->look_token->len == 2)
568 if (!memcmp(cclp->look_token->name, "<=", 2))
570 else if (!memcmp(cclp->look_token->name, ">=", 2))
572 else if (!memcmp(cclp->look_token->name, "<>", 2))
577 cclp->error_code = CCL_ERR_BAD_RELATION;
580 ADVANCE; /* skip relation */
582 qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, 0))
584 /* allow - inside term and treat it as range _always_ */
585 /* relation is =. Extract "embedded" - to separate terms */
586 if (KIND == CCL_TOK_TERM)
589 for (i = 0; i<cclp->look_token->len; i++)
591 if (cclp->look_token->name[i] == '-')
595 if (cclp->look_token->len > 1 && i == 0)
597 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
599 ntoken->kind = CCL_TOK_TERM;
600 ntoken->name = cclp->look_token->name + 1;
601 ntoken->len = cclp->look_token->len - 1;
603 cclp->look_token->len = 1;
604 cclp->look_token->name = "-";
606 else if (cclp->look_token->len > 1 && i == cclp->look_token->len-1)
608 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
610 ntoken->kind = CCL_TOK_TERM;
614 (cclp->look_token->len)--;
616 else if (cclp->look_token->len > 2 && i < cclp->look_token->len)
618 struct ccl_token *ntoken1 = ccl_token_add(cclp->look_token);
619 struct ccl_token *ntoken2 = ccl_token_add(ntoken1);
621 ntoken1->kind = CCL_TOK_TERM; /* generate - */
625 ntoken2->kind = CCL_TOK_TERM; /* generate yy */
626 ntoken2->name = cclp->look_token->name + (i+1);
627 ntoken2->len = cclp->look_token->len - (i+1);
629 cclp->look_token->len = i; /* adjust xx */
631 else if (i == cclp->look_token->len &&
632 cclp->look_token->next &&
633 cclp->look_token->next->kind == CCL_TOK_TERM &&
634 cclp->look_token->next->len > 1 &&
635 cclp->look_token->next->name[0] == '-')
638 /* we _know_ that xx does not have - in it */
639 struct ccl_token *ntoken = ccl_token_add(cclp->look_token);
641 ntoken->kind = CCL_TOK_TERM; /* generate - */
645 (ntoken->next->name)++; /* adjust yy */
646 (ntoken->next->len)--;
652 KIND == CCL_TOK_TERM &&
653 cclp->look_token->next && cclp->look_token->next->len == 1 &&
654 cclp->look_token->next->name[0] == '-')
656 struct ccl_rpn_node *p1;
657 if (!(p1 = search_term(cclp, ap)))
659 ADVANCE; /* skip '-' */
660 if (KIND == CCL_TOK_TERM) /* = term - term ? */
662 struct ccl_rpn_node *p2;
664 if (!(p2 = search_term(cclp, ap)))
669 p = ccl_rpn_node_create(CCL_RPN_AND);
671 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
673 ccl_add_attr_numeric(p2, attset, CCL_BIB1_REL, 2);
678 ccl_add_attr_numeric(p1, attset, CCL_BIB1_REL, 4);
683 cclp->look_token->len == 1 &&
684 cclp->look_token->name[0] == '-') /* = - term ? */
687 if (!(p = search_term(cclp, ap)))
689 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, 2);
692 else if (KIND == CCL_TOK_LP)
695 if (!(p = find_spec(cclp, ap)))
697 if (KIND != CCL_TOK_RP)
699 cclp->error_code = CCL_ERR_RP_EXPECTED;
708 if (!(p = search_terms(cclp, ap)))
710 ccl_add_attr_numeric(p, attset, CCL_BIB1_REL, rel);
713 cclp->error_code = CCL_ERR_TERM_EXPECTED;
718 struct ccl_rpn_node *qualifier_relation(CCL_parser cclp, ccl_qualifier_t *ap)
721 struct ccl_rpn_node *p;
723 if (qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_ORDER, &attset)
724 || qual_val_type(ap, CCL_BIB1_REL, CCL_BIB1_REL_PORDER, &attset))
725 return qualifiers_order(cclp, ap, attset);
727 /* unordered relation */
728 if (KIND != CCL_TOK_EQ)
730 cclp->error_code = CCL_ERR_EQ_EXPECTED;
734 if (KIND == CCL_TOK_LP)
737 if (!(p = find_spec(cclp, ap)))
741 if (KIND != CCL_TOK_RP)
743 cclp->error_code = CCL_ERR_RP_EXPECTED;
750 p = search_terms(cclp, ap);
755 * qualifier_list: Parse CCL qualifiers and search terms.
757 * la: Token pointer to RELATION token.
758 * qa: Qualifier attributes already applied.
759 * return: pointer to node(s); NULL on error.
761 static struct ccl_rpn_node *qualifier_list(CCL_parser cclp,
762 struct ccl_token *la,
765 struct ccl_token *lookahead = cclp->look_token;
766 struct ccl_token *look_start = cclp->look_token;
768 struct ccl_rpn_node *node = 0;
769 const char **field_str;
777 cclp->error_code = CCL_ERR_DOUBLE_QUAL;
781 for (lookahead = cclp->look_token; lookahead != la;
782 lookahead=lookahead->next)
785 for (i=0; qa[i]; i++)
787 ap = (ccl_qualifier_t *)xmalloc((no ? (no+1) : 2) * sizeof(*ap));
790 field_str = ccl_qual_search_special(cclp->bibset, "field");
793 if (!strcmp(field_str[0], "or"))
795 else if (!strcmp(field_str[0], "merge"))
800 /* consider each field separately and OR */
801 lookahead = look_start;
802 while (lookahead != la)
806 while ((ap[0] = ccl_qual_search(cclp, lookahead->name,
807 lookahead->len, seq)) != 0)
809 struct ccl_rpn_node *node_sub;
810 cclp->look_token = la;
812 node_sub = qualifier_relation(cclp, ap);
815 ccl_rpn_delete(node);
821 struct ccl_rpn_node *node_this =
822 ccl_rpn_node_create(CCL_RPN_OR);
823 node_this->u.p[0] = node;
824 node_this->u.p[1] = node_sub;
833 cclp->look_token = lookahead;
834 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
838 lookahead = lookahead->next;
839 if (lookahead->kind == CCL_TOK_COMMA)
840 lookahead = lookahead->next;
845 /* merge attributes from ALL fields - including inherited ones */
848 struct ccl_rpn_node *node_sub;
850 lookahead = look_start;
851 for (i = 0; lookahead != la; i++)
853 ap[i] = ccl_qual_search(cclp, lookahead->name,
854 lookahead->len, seq);
857 if (!ap[i] && seq > 0)
858 ap[i] = ccl_qual_search(cclp, lookahead->name,
862 cclp->look_token = lookahead;
863 cclp->error_code = CCL_ERR_UNKNOWN_QUAL;
867 lookahead = lookahead->next;
868 if (lookahead->kind == CCL_TOK_COMMA)
869 lookahead = lookahead->next;
873 ccl_qualifier_t *qa0 = qa;
883 cclp->look_token = lookahead;
885 node_sub = qualifier_relation(cclp, ap);
888 ccl_rpn_delete(node);
893 struct ccl_rpn_node *node_this =
894 ccl_rpn_node_create(CCL_RPN_OR);
895 node_this->u.p[0] = node;
896 node_this->u.p[1] = node_sub;
910 * search_terms: Parse CCL search terms - including proximity.
912 * qa: Qualifier attributes already applied.
913 * return: pointer to node(s); NULL on error.
915 static struct ccl_rpn_node *search_terms(CCL_parser cclp, ccl_qualifier_t *qa)
917 static int list[] = {
918 CCL_TOK_TERM, CCL_TOK_COMMA,CCL_TOK_EQ, CCL_TOK_REL, CCL_TOK_SET, -1};
919 struct ccl_rpn_node *p1, *p2, *pn;
920 p1 = search_term_x(cclp, qa, list, 1);
925 if (KIND == CCL_TOK_PROX)
927 struct ccl_rpn_node *p_prox = 0;
928 /* ! word order specified */
929 /* % word order not specified */
930 p_prox = ccl_rpn_node_create(CCL_RPN_TERM);
931 p_prox->u.t.term = (char *) xmalloc(1 + cclp->look_token->len);
932 memcpy(p_prox->u.t.term, cclp->look_token->name,
933 cclp->look_token->len);
934 p_prox->u.t.term[cclp->look_token->len] = 0;
935 p_prox->u.t.attr_list = 0;
938 p2 = search_term_x(cclp, qa, list, 1);
944 pn = ccl_rpn_node_create(CCL_RPN_PROX);
950 else if (is_term_ok(KIND, list))
952 p2 = search_term_x(cclp, qa, list, 1);
958 pn = ccl_rpn_node_create(CCL_RPN_PROX);
971 * search_elements: Parse CCL search elements
973 * qa: Qualifier attributes already applied.
974 * return: pointer to node(s); NULL on error.
976 static struct ccl_rpn_node *search_elements(CCL_parser cclp,
979 struct ccl_rpn_node *p1;
980 struct ccl_token *lookahead;
981 if (KIND == CCL_TOK_LP)
984 p1 = find_spec(cclp, qa);
987 if (KIND != CCL_TOK_RP)
989 cclp->error_code = CCL_ERR_RP_EXPECTED;
996 else if (KIND == CCL_TOK_SET)
999 if (KIND == CCL_TOK_EQ)
1001 if (KIND != CCL_TOK_TERM)
1003 cclp->error_code = CCL_ERR_SETNAME_EXPECTED;
1006 p1 = ccl_rpn_node_create(CCL_RPN_SET);
1007 p1->u.setname = copy_token_name(cclp->look_token);
1011 lookahead = cclp->look_token;
1013 while (lookahead->kind==CCL_TOK_TERM)
1015 lookahead = lookahead->next;
1016 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
1017 return qualifier_list(cclp, lookahead, qa);
1018 if (lookahead->kind != CCL_TOK_COMMA)
1020 lookahead = lookahead->next;
1023 return search_terms(cclp, qa);
1026 ccl_qualifier_t qa[2];
1027 struct ccl_rpn_node *node = 0;
1029 lookahead = cclp->look_token;
1032 for(seq = 0; ;seq++)
1034 struct ccl_rpn_node *node_sub;
1035 qa[0] = ccl_qual_search(cclp, "term", 4, seq);
1039 cclp->look_token = lookahead;
1041 node_sub = search_terms(cclp, qa);
1044 ccl_rpn_delete(node);
1049 struct ccl_rpn_node *node_this =
1050 ccl_rpn_node_create(CCL_RPN_OR);
1051 node_this->u.p[0] = node;
1052 node_this->u.p[1] = node_sub;
1053 node_this->u.p[2] = 0;
1060 node = search_terms(cclp, 0);
1066 * find_spec: Parse CCL find specification
1068 * qa: Qualifier attributes already applied.
1069 * return: pointer to node(s); NULL on error.
1071 static struct ccl_rpn_node *find_spec(CCL_parser cclp, ccl_qualifier_t *qa)
1073 struct ccl_rpn_node *p1, *p2, *pn;
1074 if (!(p1 = search_elements(cclp, qa)))
1082 p2 = search_elements(cclp, qa);
1088 pn = ccl_rpn_node_create(CCL_RPN_AND);
1096 p2 = search_elements(cclp, qa);
1102 pn = ccl_rpn_node_create(CCL_RPN_OR);
1110 p2 = search_elements(cclp, qa);
1116 pn = ccl_rpn_node_create(CCL_RPN_NOT);
1128 struct ccl_rpn_node *ccl_parser_find_str(CCL_parser cclp, const char *str)
1130 struct ccl_rpn_node *p;
1131 struct ccl_token *list = ccl_parser_tokenize(cclp, str);
1132 p = ccl_parser_find_token(cclp, list);
1133 ccl_token_del(list);
1137 struct ccl_rpn_node *ccl_parser_find_token(CCL_parser cclp,
1138 struct ccl_token *list)
1140 struct ccl_rpn_node *p;
1142 cclp->look_token = list;
1143 p = find_spec(cclp, NULL);
1144 if (p && KIND != CCL_TOK_EOL)
1146 if (KIND == CCL_TOK_RP)
1147 cclp->error_code = CCL_ERR_BAD_RP;
1149 cclp->error_code = CCL_ERR_OP_EXPECTED;
1153 cclp->error_pos = cclp->look_token->name;
1155 cclp->error_code = CCL_ERR_OK;
1157 cclp->error_code = cclp->error_code;
1162 * ccl_find_str: Parse CCL find - string representation
1163 * bibset: Bibset to be used for the parsing
1164 * str: String to be parsed
1165 * error: Pointer to integer. Holds error no. on completion.
1166 * pos: Pointer to char position. Holds approximate error position.
1167 * return: RPN tree on successful completion; NULL otherwise.
1169 struct ccl_rpn_node *ccl_find_str(CCL_bibset bibset, const char *str,
1170 int *error, int *pos)
1172 CCL_parser cclp = ccl_parser_create(bibset);
1173 struct ccl_token *list;
1174 struct ccl_rpn_node *p;
1176 list = ccl_parser_tokenize(cclp, str);
1177 p = ccl_parser_find_token(cclp, list);
1179 *error = cclp->error_code;
1181 *pos = cclp->error_pos - str;
1182 ccl_parser_destroy(cclp);
1183 ccl_token_del(list);
1190 * c-file-style: "Stroustrup"
1191 * indent-tabs-mode: nil
1193 * vim: shiftwidth=4 tabstop=8 expandtab