1 /* CCL find (to rpn conversion)
5 * Revision 1.4 1995-11-01 13:54:20 quinn
8 * Revision 1.3 1995/09/29 17:11:59 quinn
11 * Revision 1.2 1995/09/27 15:02:44 quinn
12 * Modified function heads & prototypes.
14 * Revision 1.1 1995/04/10 10:28:19 quinn
17 * Revision 1.12 1995/03/20 15:27:43 adam
20 * Revision 1.11 1995/02/23 08:31:59 adam
23 * Revision 1.9 1995/02/16 13:20:06 adam
26 * Revision 1.8 1995/02/14 19:59:42 adam
27 * Removed a syntax error.
29 * Revision 1.7 1995/02/14 19:55:10 adam
30 * Header files ccl.h/cclp.h are gone! They have been merged an
31 * moved to ../include/ccl.h.
32 * Node kind(s) in ccl_rpn_node have changed names.
34 * Revision 1.6 1995/02/14 16:20:55 adam
35 * Qualifiers are read from a file now.
37 * Revision 1.5 1995/02/14 14:12:41 adam
38 * Ranges for ordered qualfiers implemented (e.g. pd=1980-1990).
40 * Revision 1.4 1995/02/14 13:16:29 adam
41 * Left and/or right truncation implemented.
43 * Revision 1.3 1995/02/14 10:25:56 adam
44 * The constructions 'qualifier rel term ...' implemented.
46 * Revision 1.2 1995/02/13 15:15:07 adam
47 * Added handling of qualifiers. Not finished yet.
49 * Revision 1.1 1995/02/13 12:35:20 adam
50 * First version of CCL. Qualifiers aren't handled yet.
61 static struct ccl_token *look_token;
63 static CCL_bibset bibset;
65 #define KIND (look_token->kind)
66 #define ADVANCE look_token = look_token->next
67 #define ADVX(x) x=(x)->next
69 static struct ccl_rpn_attr *qual_val (struct ccl_rpn_attr *list, int type)
73 if (list->type == type)
80 static int qual_val_type (struct ccl_rpn_attr *list, int type, int value)
84 if (list->type == type && list->value == value)
91 static void strxcat (char *n, const char *src, int len)
100 static char *copy_token_name (struct ccl_token *tp)
102 char *str = xmalloc (tp->len + 1);
104 memcpy (str, tp->name, tp->len);
109 static struct ccl_rpn_node *mk_node (enum rpn_node_kind kind)
111 struct ccl_rpn_node *p;
112 p = xmalloc (sizeof(*p));
118 void ccl_rpn_delete (struct ccl_rpn_node *rpn)
120 struct ccl_rpn_attr *attr, *attr1;
128 ccl_rpn_delete (rpn->u.p[0]);
129 ccl_rpn_delete (rpn->u.p[1]);
132 xfree (rpn->u.t.term);
133 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
140 xfree (rpn->u.setname);
143 ccl_rpn_delete (rpn->u.p[0]);
144 ccl_rpn_delete (rpn->u.p[1]);
150 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa);
151 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa);
153 static void add_attr (struct ccl_rpn_node *p, int type, int value)
155 struct ccl_rpn_attr *n;
157 n = xmalloc (sizeof(*n));
161 n->next = p->u.t.attr_list;
162 p->u.t.attr_list = n;
165 static struct ccl_rpn_node *search_term (struct ccl_rpn_attr **qa)
167 struct ccl_rpn_node *p;
168 struct ccl_rpn_attr *attr;
169 struct ccl_token *lookahead = look_token;
176 if (KIND != CCL_TOK_TERM)
178 ccl_error = CCL_ERR_TERM_EXPECTED;
181 for (no = 0; lookahead->kind == CCL_TOK_TERM; no++)
183 for (i = 0; i<lookahead->len; i++)
184 if (lookahead->name[i] == '?')
186 if (no == 0 && i == 0 && lookahead->len >= 1)
188 else if (lookahead->next->kind != CCL_TOK_TERM &&
189 i == lookahead->len-1 && i >= 1)
194 len += 1+lookahead->len;
195 lookahead = lookahead->next;
197 p = mk_node (CCL_RPN_TERM);
198 p->u.t.term = xmalloc (len);
199 assert (p->u.t.term);
200 p->u.t.attr_list = NULL;
201 p->u.t.term[0] = '\0';
202 for (i = 0; i<no; i++)
204 const char *src_str = look_token->name;
205 int src_len = look_token->len;
207 if (i == 0 && left_trunc)
212 else if (i == no-1 && right_trunc)
215 strcat (p->u.t.term, " ");
216 strxcat (p->u.t.term, src_str, src_len);
222 for (i=0; qa[i]; i++)
224 struct ccl_rpn_attr *attr;
226 for (attr = qa[i]; attr; attr = attr->next)
228 add_attr (p, attr->type, attr->value);
233 attr = ccl_qual_search (bibset, "term", 4);
234 if (attr && qual_val_type (attr, CCL_BIB1_STR, CCL_BIB1_STR_WP))
237 add_attr (p, CCL_BIB1_STR, 2);
239 add_attr (p, CCL_BIB1_STR, 1);
241 if (left_trunc && right_trunc)
243 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH))
245 ccl_error = CCL_ERR_TRUNC_NOT_BOTH;
251 add_attr (p, CCL_BIB1_TRU, 3);
253 else if (right_trunc)
255 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT))
257 ccl_error = CCL_ERR_TRUNC_NOT_RIGHT;
263 add_attr (p, CCL_BIB1_TRU, 1);
267 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT))
269 ccl_error = CCL_ERR_TRUNC_NOT_LEFT;
275 add_attr (p, CCL_BIB1_TRU, 2);
279 if (attr && qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE))
280 add_attr (p, CCL_BIB1_TRU, 100);
285 static struct ccl_rpn_node *qualifiers (struct ccl_token *la,
286 struct ccl_rpn_attr **qa)
288 struct ccl_token *lookahead = look_token;
289 struct ccl_rpn_attr **ap;
292 struct ccl_rpn_attr *attr;
296 ccl_error = CCL_ERR_DOUBLE_QUAL;
299 for (lookahead = look_token; lookahead != la; lookahead=lookahead->next)
301 ap = xmalloc (no * sizeof(*ap));
303 for (i=0; look_token != la; i++)
305 ap[i] = ccl_qual_search (bibset, look_token->name, look_token->len);
308 ccl_error = CCL_ERR_UNKNOWN_QUAL;
313 if (KIND == CCL_TOK_COMMA)
317 if (! (attr = qual_val (ap[0], CCL_BIB1_REL)) ||
318 attr->value != CCL_BIB1_REL_ORDER)
320 /* unordered relation */
321 struct ccl_rpn_node *p;
322 if (KIND != CCL_TOK_EQ)
324 ccl_error = CCL_ERR_EQ_EXPECTED;
329 if (KIND == CCL_TOK_LP)
332 if (!(p = find_spec (ap)))
337 if (KIND != CCL_TOK_RP)
339 ccl_error = CCL_ERR_RP_EXPECTED;
347 p = search_terms (ap);
352 if (look_token->len == 1)
354 if (look_token->name[0] == '<')
356 else if (look_token->name[0] == '=')
358 else if (look_token->name[0] == '>')
361 else if (look_token->len == 2)
363 if (!memcmp (look_token->name, "<=", 2))
365 else if (!memcmp (look_token->name, ">=", 2))
367 else if (!memcmp (look_token->name, "<>", 2))
371 ccl_error = CCL_ERR_BAD_RELATION;
374 struct ccl_rpn_node *p;
376 ADVANCE; /* skip relation */
377 if (KIND == CCL_TOK_TERM)
379 struct ccl_rpn_node *p1;
380 p1 = search_term (ap);
381 if (KIND == CCL_TOK_MINUS)
383 ADVANCE; /* skip '-' */
384 if (KIND == CCL_TOK_TERM) /* = term - term ? */
386 struct ccl_rpn_node *p2;
388 p2 = search_term (ap);
389 p = mk_node (CCL_RPN_AND);
391 add_attr (p1, CCL_BIB1_REL, 4);
393 add_attr (p2, CCL_BIB1_REL, 2);
399 add_attr (p1, CCL_BIB1_REL, 4);
406 add_attr (p1, CCL_BIB1_REL, rel);
411 else if (KIND == CCL_TOK_MINUS) /* = - term ? */
414 p = search_term (ap);
415 add_attr (p, CCL_BIB1_REL, 2);
419 ccl_error = CCL_ERR_TERM_EXPECTED;
425 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa)
427 struct ccl_rpn_node *p1, *p2, *pn;
428 p1 = search_term (qa);
433 if (KIND == CCL_TOK_PROX)
436 p2 = search_term (qa);
442 pn = mk_node (CCL_RPN_PROX);
447 else if (KIND == CCL_TOK_TERM)
449 p2 = search_term (qa);
455 pn = mk_node (CCL_RPN_PROX);
466 static struct ccl_rpn_node *search_elements (struct ccl_rpn_attr **qa)
468 struct ccl_rpn_node *p1;
469 struct ccl_token *lookahead;
470 if (KIND == CCL_TOK_LP)
476 if (KIND != CCL_TOK_RP)
478 ccl_error = CCL_ERR_RP_EXPECTED;
485 else if (KIND == CCL_TOK_SET)
488 if (KIND == CCL_TOK_EQ)
490 if (KIND != CCL_TOK_TERM)
492 ccl_error = CCL_ERR_SETNAME_EXPECTED;
495 p1 = mk_node (CCL_RPN_SET);
496 p1->u.setname = copy_token_name (look_token);
500 lookahead = look_token;
502 while (lookahead->kind==CCL_TOK_TERM || lookahead->kind==CCL_TOK_COMMA)
503 lookahead = lookahead->next;
504 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
505 return qualifiers (lookahead, qa);
506 return search_terms (qa);
509 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa)
511 struct ccl_rpn_node *p1, *p2, *pn;
512 if (!(p1 = search_elements (qa)))
520 p2 = search_elements (qa);
526 pn = mk_node (CCL_RPN_AND);
533 p2 = search_elements (qa);
539 pn = mk_node (CCL_RPN_OR);
546 p2 = search_elements (qa);
552 pn = mk_node (CCL_RPN_NOT);
563 struct ccl_rpn_node *ccl_find (CCL_bibset abibset, struct ccl_token *list,
564 int *error, const char **pos)
566 struct ccl_rpn_node *p;
570 p = find_spec (NULL);
571 if (p && KIND != CCL_TOK_EOL)
573 if (KIND == CCL_TOK_RP)
574 ccl_error = CCL_ERR_BAD_RP;
576 ccl_error = CCL_ERR_OP_EXPECTED;
580 *pos = look_token->name;
588 struct ccl_rpn_node *ccl_find_str (CCL_bibset bibset, const char *str,
589 int *error, int *pos)
591 struct ccl_token *list;
592 struct ccl_rpn_node *rpn;
593 const char *char_pos;
595 list = ccl_tokenize (str);
596 rpn = ccl_find (bibset, list, error, &char_pos);
598 *pos = char_pos - str;