1 /* CCL find (to rpn conversion)
5 * Revision 1.2 1995-09-27 15:02:44 quinn
6 * Modified function heads & prototypes.
8 * Revision 1.1 1995/04/10 10:28:19 quinn
11 * Revision 1.12 1995/03/20 15:27:43 adam
14 * Revision 1.11 1995/02/23 08:31:59 adam
17 * Revision 1.9 1995/02/16 13:20:06 adam
20 * Revision 1.8 1995/02/14 19:59:42 adam
21 * Removed a syntax error.
23 * Revision 1.7 1995/02/14 19:55:10 adam
24 * Header files ccl.h/cclp.h are gone! They have been merged an
25 * moved to ../include/ccl.h.
26 * Node kind(s) in ccl_rpn_node have changed names.
28 * Revision 1.6 1995/02/14 16:20:55 adam
29 * Qualifiers are read from a file now.
31 * Revision 1.5 1995/02/14 14:12:41 adam
32 * Ranges for ordered qualfiers implemented (e.g. pd=1980-1990).
34 * Revision 1.4 1995/02/14 13:16:29 adam
35 * Left and/or right truncation implemented.
37 * Revision 1.3 1995/02/14 10:25:56 adam
38 * The constructions 'qualifier rel term ...' implemented.
40 * Revision 1.2 1995/02/13 15:15:07 adam
41 * Added handling of qualifiers. Not finished yet.
43 * Revision 1.1 1995/02/13 12:35:20 adam
44 * First version of CCL. Qualifiers aren't handled yet.
55 static struct ccl_token *look_token;
57 static CCL_bibset bibset;
59 #define KIND (look_token->kind)
60 #define ADVANCE look_token = look_token->next
61 #define ADVX(x) x=(x)->next
63 static struct ccl_rpn_attr *qual_val (struct ccl_rpn_attr *list, int type)
67 if (list->type == type)
74 static int qual_val_type (struct ccl_rpn_attr *list, int type, int value)
78 if (list->type == type && list->value == value)
85 static void strxcat (char *n, const char *src, int len)
94 static char *copy_token_name (struct ccl_token *tp)
96 char *str = malloc (tp->len + 1);
98 memcpy (str, tp->name, tp->len);
103 static struct ccl_rpn_node *mk_node (enum rpn_node_kind kind)
105 struct ccl_rpn_node *p;
106 p = malloc (sizeof(*p));
112 void MDF ccl_rpn_delete (struct ccl_rpn_node *rpn)
114 struct ccl_rpn_attr *attr, *attr1;
122 ccl_rpn_delete (rpn->u.p[0]);
123 ccl_rpn_delete (rpn->u.p[1]);
126 free (rpn->u.t.term);
127 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
134 free (rpn->u.setname);
137 ccl_rpn_delete (rpn->u.p[0]);
138 ccl_rpn_delete (rpn->u.p[1]);
144 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa);
145 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa);
147 static void add_attr (struct ccl_rpn_node *p, int type, int value)
149 struct ccl_rpn_attr *n;
151 n = malloc (sizeof(*n));
155 n->next = p->u.t.attr_list;
156 p->u.t.attr_list = n;
159 static struct ccl_rpn_node *search_term (struct ccl_rpn_attr **qa)
161 struct ccl_rpn_node *p;
162 struct ccl_rpn_attr *attr;
163 struct ccl_token *lookahead = look_token;
170 if (KIND != CCL_TOK_TERM)
172 ccl_error = CCL_ERR_TERM_EXPECTED;
175 for (no = 0; lookahead->kind == CCL_TOK_TERM; no++)
177 for (i = 0; i<lookahead->len; i++)
178 if (lookahead->name[i] == '?')
180 if (no == 0 && i == 0 && lookahead->len >= 1)
182 else if (lookahead->next->kind != CCL_TOK_TERM &&
183 i == lookahead->len-1 && i >= 1)
188 len += 1+lookahead->len;
189 lookahead = lookahead->next;
191 p = mk_node (CCL_RPN_TERM);
192 p->u.t.term = malloc (len);
193 assert (p->u.t.term);
194 p->u.t.attr_list = NULL;
195 p->u.t.term[0] = '\0';
196 for (i = 0; i<no; i++)
198 const char *src_str = look_token->name;
199 int src_len = look_token->len;
201 if (i == 0 && left_trunc)
206 else if (i == no-1 && right_trunc)
209 strcat (p->u.t.term, " ");
210 strxcat (p->u.t.term, src_str, src_len);
216 for (i=0; qa[i]; i++)
218 struct ccl_rpn_attr *attr;
220 for (attr = qa[i]; attr; attr = attr->next)
222 add_attr (p, attr->type, attr->value);
227 attr = ccl_qual_search (bibset, "term", 4);
228 if (attr && qual_val_type (attr, CCL_BIB1_STR, CCL_BIB1_STR_WP))
231 add_attr (p, CCL_BIB1_STR, 2);
233 add_attr (p, CCL_BIB1_STR, 1);
235 if (left_trunc && right_trunc)
237 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH))
239 ccl_error = CCL_ERR_TRUNC_NOT_BOTH;
245 add_attr (p, CCL_BIB1_TRU, 3);
247 else if (right_trunc)
249 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT))
251 ccl_error = CCL_ERR_TRUNC_NOT_RIGHT;
257 add_attr (p, CCL_BIB1_TRU, 1);
261 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT))
263 ccl_error = CCL_ERR_TRUNC_NOT_LEFT;
269 add_attr (p, CCL_BIB1_TRU, 2);
273 if (attr && qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE))
274 add_attr (p, CCL_BIB1_TRU, 100);
279 static struct ccl_rpn_node *qualifiers (struct ccl_token *la,
280 struct ccl_rpn_attr **qa)
282 struct ccl_token *lookahead = look_token;
283 struct ccl_rpn_attr **ap;
286 struct ccl_rpn_attr *attr;
290 ccl_error = CCL_ERR_DOUBLE_QUAL;
293 for (lookahead = look_token; lookahead != la; lookahead=lookahead->next)
295 ap = malloc (no * sizeof(*ap));
297 for (i=0; look_token != la; i++)
299 ap[i] = ccl_qual_search (bibset, look_token->name, look_token->len);
302 ccl_error = CCL_ERR_UNKNOWN_QUAL;
307 if (KIND == CCL_TOK_COMMA)
311 if (! (attr = qual_val (ap[0], CCL_BIB1_REL)) ||
312 attr->value != CCL_BIB1_REL_ORDER)
314 /* unordered relation */
315 struct ccl_rpn_node *p;
316 if (KIND != CCL_TOK_EQ)
318 ccl_error = CCL_ERR_EQ_EXPECTED;
323 if (KIND == CCL_TOK_LP)
326 if (!(p = find_spec (ap)))
331 if (KIND != CCL_TOK_RP)
333 ccl_error = CCL_ERR_RP_EXPECTED;
341 p = search_terms (ap);
346 if (look_token->len == 1)
348 if (look_token->name[0] == '<')
350 else if (look_token->name[0] == '=')
352 else if (look_token->name[0] == '>')
355 else if (look_token->len == 2)
357 if (!memcmp (look_token->name, "<=", 2))
359 else if (!memcmp (look_token->name, ">=", 2))
361 else if (!memcmp (look_token->name, "<>", 2))
365 ccl_error = CCL_ERR_BAD_RELATION;
368 struct ccl_rpn_node *p;
370 ADVANCE; /* skip relation */
371 if (KIND == CCL_TOK_TERM)
373 struct ccl_rpn_node *p1;
374 p1 = search_term (ap);
375 if (KIND == CCL_TOK_MINUS)
377 ADVANCE; /* skip '-' */
378 if (KIND == CCL_TOK_TERM) /* = term - term ? */
380 struct ccl_rpn_node *p2;
382 p2 = search_term (ap);
383 p = mk_node (CCL_RPN_AND);
385 add_attr (p1, CCL_BIB1_REL, 4);
387 add_attr (p2, CCL_BIB1_REL, 2);
393 add_attr (p1, CCL_BIB1_REL, 4);
400 add_attr (p1, CCL_BIB1_REL, rel);
405 else if (KIND == CCL_TOK_MINUS) /* = - term ? */
408 p = search_term (ap);
409 add_attr (p, CCL_BIB1_REL, 2);
413 ccl_error = CCL_ERR_TERM_EXPECTED;
419 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa)
421 struct ccl_rpn_node *p1, *p2, *pn;
422 p1 = search_term (qa);
427 if (KIND == CCL_TOK_PROX)
430 p2 = search_term (qa);
436 pn = mk_node (CCL_RPN_PROX);
441 else if (KIND == CCL_TOK_TERM)
443 p2 = search_term (qa);
449 pn = mk_node (CCL_RPN_PROX);
460 static struct ccl_rpn_node *search_elements (struct ccl_rpn_attr **qa)
462 struct ccl_rpn_node *p1;
463 struct ccl_token *lookahead;
464 if (KIND == CCL_TOK_LP)
470 if (KIND != CCL_TOK_RP)
472 ccl_error = CCL_ERR_RP_EXPECTED;
479 else if (KIND == CCL_TOK_SET)
482 if (KIND == CCL_TOK_EQ)
484 if (KIND != CCL_TOK_TERM)
486 ccl_error = CCL_ERR_SETNAME_EXPECTED;
489 p1 = mk_node (CCL_RPN_SET);
490 p1->u.setname = copy_token_name (look_token);
494 lookahead = look_token;
496 while (lookahead->kind==CCL_TOK_TERM || lookahead->kind==CCL_TOK_COMMA)
497 lookahead = lookahead->next;
498 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
499 return qualifiers (lookahead, qa);
500 return search_terms (qa);
503 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa)
505 struct ccl_rpn_node *p1, *p2, *pn;
506 if (!(p1 = search_elements (qa)))
514 p2 = search_elements (qa);
520 pn = mk_node (CCL_RPN_AND);
527 p2 = search_elements (qa);
533 pn = mk_node (CCL_RPN_OR);
540 p2 = search_elements (qa);
546 pn = mk_node (CCL_RPN_NOT);
557 struct ccl_rpn_node MDF *ccl_find (CCL_bibset abibset, struct ccl_token *list,
558 int *error, const char **pos)
560 struct ccl_rpn_node *p;
564 p = find_spec (NULL);
565 if (p && KIND != CCL_TOK_EOL)
567 if (KIND == CCL_TOK_RP)
568 ccl_error = CCL_ERR_BAD_RP;
570 ccl_error = CCL_ERR_OP_EXPECTED;
574 *pos = look_token->name;
582 struct ccl_rpn_node MDF *ccl_find_str (CCL_bibset bibset, const char *str,
583 int *error, int *pos)
585 struct ccl_token *list;
586 struct ccl_rpn_node *rpn;
587 const char *char_pos;
589 list = ccl_tokenize (str);
590 rpn = ccl_find (bibset, list, error, &char_pos);
592 *pos = char_pos - str;