1 /* CCL find (to rpn conversion)
5 * Revision 1.12 1995/03/20 15:27:43 adam
8 * Revision 1.11 1995/02/23 08:31:59 adam
11 * Revision 1.9 1995/02/16 13:20:06 adam
14 * Revision 1.8 1995/02/14 19:59:42 adam
15 * Removed a syntax error.
17 * Revision 1.7 1995/02/14 19:55:10 adam
18 * Header files ccl.h/cclp.h are gone! They have been merged an
19 * moved to ../include/ccl.h.
20 * Node kind(s) in ccl_rpn_node have changed names.
22 * Revision 1.6 1995/02/14 16:20:55 adam
23 * Qualifiers are read from a file now.
25 * Revision 1.5 1995/02/14 14:12:41 adam
26 * Ranges for ordered qualfiers implemented (e.g. pd=1980-1990).
28 * Revision 1.4 1995/02/14 13:16:29 adam
29 * Left and/or right truncation implemented.
31 * Revision 1.3 1995/02/14 10:25:56 adam
32 * The constructions 'qualifier rel term ...' implemented.
34 * Revision 1.2 1995/02/13 15:15:07 adam
35 * Added handling of qualifiers. Not finished yet.
37 * Revision 1.1 1995/02/13 12:35:20 adam
38 * First version of CCL. Qualifiers aren't handled yet.
49 static struct ccl_token *look_token;
51 static CCL_bibset bibset;
53 #define KIND (look_token->kind)
54 #define ADVANCE look_token = look_token->next
55 #define ADVX(x) x=(x)->next
57 static struct ccl_rpn_attr *qual_val (struct ccl_rpn_attr *list, int type)
61 if (list->type == type)
68 static int qual_val_type (struct ccl_rpn_attr *list, int type, int value)
72 if (list->type == type && list->value == value)
79 static void strxcat (char *n, const char *src, int len)
88 static char *copy_token_name (struct ccl_token *tp)
90 char *str = malloc (tp->len + 1);
92 memcpy (str, tp->name, tp->len);
97 static struct ccl_rpn_node *mk_node (enum rpn_node_kind kind)
99 struct ccl_rpn_node *p;
100 p = malloc (sizeof(*p));
106 void ccl_rpn_delete (struct ccl_rpn_node *rpn)
108 struct ccl_rpn_attr *attr, *attr1;
116 ccl_rpn_delete (rpn->u.p[0]);
117 ccl_rpn_delete (rpn->u.p[1]);
120 free (rpn->u.t.term);
121 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
128 free (rpn->u.setname);
131 ccl_rpn_delete (rpn->u.p[0]);
132 ccl_rpn_delete (rpn->u.p[1]);
138 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa);
139 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa);
141 static void add_attr (struct ccl_rpn_node *p, int type, int value)
143 struct ccl_rpn_attr *n;
145 n = malloc (sizeof(*n));
149 n->next = p->u.t.attr_list;
150 p->u.t.attr_list = n;
153 static struct ccl_rpn_node *search_term (struct ccl_rpn_attr **qa)
155 struct ccl_rpn_node *p;
156 struct ccl_rpn_attr *attr;
157 struct ccl_token *lookahead = look_token;
164 if (KIND != CCL_TOK_TERM)
166 ccl_error = CCL_ERR_TERM_EXPECTED;
169 for (no = 0; lookahead->kind == CCL_TOK_TERM; no++)
171 for (i = 0; i<lookahead->len; i++)
172 if (lookahead->name[i] == '?')
174 if (no == 0 && i == 0 && lookahead->len >= 1)
176 else if (lookahead->next->kind != CCL_TOK_TERM &&
177 i == lookahead->len-1 && i >= 1)
182 len += 1+lookahead->len;
183 lookahead = lookahead->next;
185 p = mk_node (CCL_RPN_TERM);
186 p->u.t.term = malloc (len);
187 assert (p->u.t.term);
188 p->u.t.attr_list = NULL;
189 p->u.t.term[0] = '\0';
190 for (i = 0; i<no; i++)
192 const char *src_str = look_token->name;
193 int src_len = look_token->len;
195 if (i == 0 && left_trunc)
200 else if (i == no-1 && right_trunc)
203 strcat (p->u.t.term, " ");
204 strxcat (p->u.t.term, src_str, src_len);
210 for (i=0; qa[i]; i++)
212 struct ccl_rpn_attr *attr;
214 for (attr = qa[i]; attr; attr = attr->next)
216 add_attr (p, attr->type, attr->value);
221 attr = ccl_qual_search (bibset, "term", 4);
222 if (attr && qual_val_type (attr, CCL_BIB1_STR, CCL_BIB1_STR_WP))
225 add_attr (p, CCL_BIB1_STR, 2);
227 add_attr (p, CCL_BIB1_STR, 1);
229 if (left_trunc && right_trunc)
231 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH))
233 ccl_error = CCL_ERR_TRUNC_NOT_BOTH;
239 add_attr (p, CCL_BIB1_TRU, 3);
241 else if (right_trunc)
243 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT))
245 ccl_error = CCL_ERR_TRUNC_NOT_RIGHT;
251 add_attr (p, CCL_BIB1_TRU, 1);
255 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT))
257 ccl_error = CCL_ERR_TRUNC_NOT_LEFT;
263 add_attr (p, CCL_BIB1_TRU, 2);
267 if (attr && qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE))
268 add_attr (p, CCL_BIB1_TRU, 100);
273 static struct ccl_rpn_node *qualifiers (struct ccl_token *la,
274 struct ccl_rpn_attr **qa)
276 struct ccl_token *lookahead = look_token;
277 struct ccl_rpn_attr **ap;
280 struct ccl_rpn_attr *attr;
284 ccl_error = CCL_ERR_DOUBLE_QUAL;
287 for (lookahead = look_token; lookahead != la; lookahead=lookahead->next)
289 ap = malloc (no * sizeof(*ap));
291 for (i=0; look_token != la; i++)
293 ap[i] = ccl_qual_search (bibset, look_token->name, look_token->len);
296 ccl_error = CCL_ERR_UNKNOWN_QUAL;
301 if (KIND == CCL_TOK_COMMA)
305 if (! (attr = qual_val (ap[0], CCL_BIB1_REL)) ||
306 attr->value != CCL_BIB1_REL_ORDER)
308 /* unordered relation */
309 struct ccl_rpn_node *p;
310 if (KIND != CCL_TOK_EQ)
312 ccl_error = CCL_ERR_EQ_EXPECTED;
317 if (KIND == CCL_TOK_LP)
320 if (!(p = find_spec (ap)))
325 if (KIND != CCL_TOK_RP)
327 ccl_error = CCL_ERR_RP_EXPECTED;
335 p = search_terms (ap);
340 if (look_token->len == 1)
342 if (look_token->name[0] == '<')
344 else if (look_token->name[0] == '=')
346 else if (look_token->name[0] == '>')
349 else if (look_token->len == 2)
351 if (!memcmp (look_token->name, "<=", 2))
353 else if (!memcmp (look_token->name, ">=", 2))
355 else if (!memcmp (look_token->name, "<>", 2))
359 ccl_error = CCL_ERR_BAD_RELATION;
362 struct ccl_rpn_node *p;
364 ADVANCE; /* skip relation */
365 if (KIND == CCL_TOK_TERM)
367 struct ccl_rpn_node *p1;
368 p1 = search_term (ap);
369 if (KIND == CCL_TOK_MINUS)
371 ADVANCE; /* skip '-' */
372 if (KIND == CCL_TOK_TERM) /* = term - term ? */
374 struct ccl_rpn_node *p2;
376 p2 = search_term (ap);
377 p = mk_node (CCL_RPN_AND);
379 add_attr (p1, CCL_BIB1_REL, 4);
381 add_attr (p2, CCL_BIB1_REL, 2);
387 add_attr (p1, CCL_BIB1_REL, 4);
394 add_attr (p1, CCL_BIB1_REL, rel);
399 else if (KIND == CCL_TOK_MINUS) /* = - term ? */
402 p = search_term (ap);
403 add_attr (p, CCL_BIB1_REL, 2);
407 ccl_error = CCL_ERR_TERM_EXPECTED;
413 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa)
415 struct ccl_rpn_node *p1, *p2, *pn;
416 p1 = search_term (qa);
421 if (KIND == CCL_TOK_PROX)
424 p2 = search_term (qa);
430 pn = mk_node (CCL_RPN_PROX);
435 else if (KIND == CCL_TOK_TERM)
437 p2 = search_term (qa);
443 pn = mk_node (CCL_RPN_PROX);
454 static struct ccl_rpn_node *search_elements (struct ccl_rpn_attr **qa)
456 struct ccl_rpn_node *p1;
457 struct ccl_token *lookahead;
458 if (KIND == CCL_TOK_LP)
464 if (KIND != CCL_TOK_RP)
466 ccl_error = CCL_ERR_RP_EXPECTED;
473 else if (KIND == CCL_TOK_SET)
476 if (KIND == CCL_TOK_EQ)
478 if (KIND != CCL_TOK_TERM)
480 ccl_error = CCL_ERR_SETNAME_EXPECTED;
483 p1 = mk_node (CCL_RPN_SET);
484 p1->u.setname = copy_token_name (look_token);
488 lookahead = look_token;
490 while (lookahead->kind==CCL_TOK_TERM || lookahead->kind==CCL_TOK_COMMA)
491 lookahead = lookahead->next;
492 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
493 return qualifiers (lookahead, qa);
494 return search_terms (qa);
497 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa)
499 struct ccl_rpn_node *p1, *p2, *pn;
500 if (!(p1 = search_elements (qa)))
508 p2 = search_elements (qa);
514 pn = mk_node (CCL_RPN_AND);
521 p2 = search_elements (qa);
527 pn = mk_node (CCL_RPN_OR);
534 p2 = search_elements (qa);
540 pn = mk_node (CCL_RPN_NOT);
551 struct ccl_rpn_node *ccl_find (CCL_bibset abibset, struct ccl_token *list,
552 int *error, const char **pos)
554 struct ccl_rpn_node *p;
558 p = find_spec (NULL);
559 if (p && KIND != CCL_TOK_EOL)
561 if (KIND == CCL_TOK_RP)
562 ccl_error = CCL_ERR_BAD_RP;
564 ccl_error = CCL_ERR_OP_EXPECTED;
568 *pos = look_token->name;
576 struct ccl_rpn_node *ccl_find_str (CCL_bibset bibset, const char *str,
577 int *error, int *pos)
579 struct ccl_token *list;
580 struct ccl_rpn_node *rpn;
581 const char *char_pos;
583 list = ccl_tokenize (str);
584 rpn = ccl_find (bibset, list, error, &char_pos);
586 *pos = char_pos - str;