1 /* CCL find (to rpn conversion)
5 * Revision 1.1 1995-04-10 10:28:19 quinn
8 * Revision 1.12 1995/03/20 15:27:43 adam
11 * Revision 1.11 1995/02/23 08:31:59 adam
14 * Revision 1.9 1995/02/16 13:20:06 adam
17 * Revision 1.8 1995/02/14 19:59:42 adam
18 * Removed a syntax error.
20 * Revision 1.7 1995/02/14 19:55:10 adam
21 * Header files ccl.h/cclp.h are gone! They have been merged an
22 * moved to ../include/ccl.h.
23 * Node kind(s) in ccl_rpn_node have changed names.
25 * Revision 1.6 1995/02/14 16:20:55 adam
26 * Qualifiers are read from a file now.
28 * Revision 1.5 1995/02/14 14:12:41 adam
29 * Ranges for ordered qualfiers implemented (e.g. pd=1980-1990).
31 * Revision 1.4 1995/02/14 13:16:29 adam
32 * Left and/or right truncation implemented.
34 * Revision 1.3 1995/02/14 10:25:56 adam
35 * The constructions 'qualifier rel term ...' implemented.
37 * Revision 1.2 1995/02/13 15:15:07 adam
38 * Added handling of qualifiers. Not finished yet.
40 * Revision 1.1 1995/02/13 12:35:20 adam
41 * First version of CCL. Qualifiers aren't handled yet.
52 static struct ccl_token *look_token;
54 static CCL_bibset bibset;
56 #define KIND (look_token->kind)
57 #define ADVANCE look_token = look_token->next
58 #define ADVX(x) x=(x)->next
60 static struct ccl_rpn_attr *qual_val (struct ccl_rpn_attr *list, int type)
64 if (list->type == type)
71 static int qual_val_type (struct ccl_rpn_attr *list, int type, int value)
75 if (list->type == type && list->value == value)
82 static void strxcat (char *n, const char *src, int len)
91 static char *copy_token_name (struct ccl_token *tp)
93 char *str = malloc (tp->len + 1);
95 memcpy (str, tp->name, tp->len);
100 static struct ccl_rpn_node *mk_node (enum rpn_node_kind kind)
102 struct ccl_rpn_node *p;
103 p = malloc (sizeof(*p));
109 void ccl_rpn_delete (struct ccl_rpn_node *rpn)
111 struct ccl_rpn_attr *attr, *attr1;
119 ccl_rpn_delete (rpn->u.p[0]);
120 ccl_rpn_delete (rpn->u.p[1]);
123 free (rpn->u.t.term);
124 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
131 free (rpn->u.setname);
134 ccl_rpn_delete (rpn->u.p[0]);
135 ccl_rpn_delete (rpn->u.p[1]);
141 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa);
142 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa);
144 static void add_attr (struct ccl_rpn_node *p, int type, int value)
146 struct ccl_rpn_attr *n;
148 n = malloc (sizeof(*n));
152 n->next = p->u.t.attr_list;
153 p->u.t.attr_list = n;
156 static struct ccl_rpn_node *search_term (struct ccl_rpn_attr **qa)
158 struct ccl_rpn_node *p;
159 struct ccl_rpn_attr *attr;
160 struct ccl_token *lookahead = look_token;
167 if (KIND != CCL_TOK_TERM)
169 ccl_error = CCL_ERR_TERM_EXPECTED;
172 for (no = 0; lookahead->kind == CCL_TOK_TERM; no++)
174 for (i = 0; i<lookahead->len; i++)
175 if (lookahead->name[i] == '?')
177 if (no == 0 && i == 0 && lookahead->len >= 1)
179 else if (lookahead->next->kind != CCL_TOK_TERM &&
180 i == lookahead->len-1 && i >= 1)
185 len += 1+lookahead->len;
186 lookahead = lookahead->next;
188 p = mk_node (CCL_RPN_TERM);
189 p->u.t.term = malloc (len);
190 assert (p->u.t.term);
191 p->u.t.attr_list = NULL;
192 p->u.t.term[0] = '\0';
193 for (i = 0; i<no; i++)
195 const char *src_str = look_token->name;
196 int src_len = look_token->len;
198 if (i == 0 && left_trunc)
203 else if (i == no-1 && right_trunc)
206 strcat (p->u.t.term, " ");
207 strxcat (p->u.t.term, src_str, src_len);
213 for (i=0; qa[i]; i++)
215 struct ccl_rpn_attr *attr;
217 for (attr = qa[i]; attr; attr = attr->next)
219 add_attr (p, attr->type, attr->value);
224 attr = ccl_qual_search (bibset, "term", 4);
225 if (attr && qual_val_type (attr, CCL_BIB1_STR, CCL_BIB1_STR_WP))
228 add_attr (p, CCL_BIB1_STR, 2);
230 add_attr (p, CCL_BIB1_STR, 1);
232 if (left_trunc && right_trunc)
234 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH))
236 ccl_error = CCL_ERR_TRUNC_NOT_BOTH;
242 add_attr (p, CCL_BIB1_TRU, 3);
244 else if (right_trunc)
246 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT))
248 ccl_error = CCL_ERR_TRUNC_NOT_RIGHT;
254 add_attr (p, CCL_BIB1_TRU, 1);
258 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT))
260 ccl_error = CCL_ERR_TRUNC_NOT_LEFT;
266 add_attr (p, CCL_BIB1_TRU, 2);
270 if (attr && qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE))
271 add_attr (p, CCL_BIB1_TRU, 100);
276 static struct ccl_rpn_node *qualifiers (struct ccl_token *la,
277 struct ccl_rpn_attr **qa)
279 struct ccl_token *lookahead = look_token;
280 struct ccl_rpn_attr **ap;
283 struct ccl_rpn_attr *attr;
287 ccl_error = CCL_ERR_DOUBLE_QUAL;
290 for (lookahead = look_token; lookahead != la; lookahead=lookahead->next)
292 ap = malloc (no * sizeof(*ap));
294 for (i=0; look_token != la; i++)
296 ap[i] = ccl_qual_search (bibset, look_token->name, look_token->len);
299 ccl_error = CCL_ERR_UNKNOWN_QUAL;
304 if (KIND == CCL_TOK_COMMA)
308 if (! (attr = qual_val (ap[0], CCL_BIB1_REL)) ||
309 attr->value != CCL_BIB1_REL_ORDER)
311 /* unordered relation */
312 struct ccl_rpn_node *p;
313 if (KIND != CCL_TOK_EQ)
315 ccl_error = CCL_ERR_EQ_EXPECTED;
320 if (KIND == CCL_TOK_LP)
323 if (!(p = find_spec (ap)))
328 if (KIND != CCL_TOK_RP)
330 ccl_error = CCL_ERR_RP_EXPECTED;
338 p = search_terms (ap);
343 if (look_token->len == 1)
345 if (look_token->name[0] == '<')
347 else if (look_token->name[0] == '=')
349 else if (look_token->name[0] == '>')
352 else if (look_token->len == 2)
354 if (!memcmp (look_token->name, "<=", 2))
356 else if (!memcmp (look_token->name, ">=", 2))
358 else if (!memcmp (look_token->name, "<>", 2))
362 ccl_error = CCL_ERR_BAD_RELATION;
365 struct ccl_rpn_node *p;
367 ADVANCE; /* skip relation */
368 if (KIND == CCL_TOK_TERM)
370 struct ccl_rpn_node *p1;
371 p1 = search_term (ap);
372 if (KIND == CCL_TOK_MINUS)
374 ADVANCE; /* skip '-' */
375 if (KIND == CCL_TOK_TERM) /* = term - term ? */
377 struct ccl_rpn_node *p2;
379 p2 = search_term (ap);
380 p = mk_node (CCL_RPN_AND);
382 add_attr (p1, CCL_BIB1_REL, 4);
384 add_attr (p2, CCL_BIB1_REL, 2);
390 add_attr (p1, CCL_BIB1_REL, 4);
397 add_attr (p1, CCL_BIB1_REL, rel);
402 else if (KIND == CCL_TOK_MINUS) /* = - term ? */
405 p = search_term (ap);
406 add_attr (p, CCL_BIB1_REL, 2);
410 ccl_error = CCL_ERR_TERM_EXPECTED;
416 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa)
418 struct ccl_rpn_node *p1, *p2, *pn;
419 p1 = search_term (qa);
424 if (KIND == CCL_TOK_PROX)
427 p2 = search_term (qa);
433 pn = mk_node (CCL_RPN_PROX);
438 else if (KIND == CCL_TOK_TERM)
440 p2 = search_term (qa);
446 pn = mk_node (CCL_RPN_PROX);
457 static struct ccl_rpn_node *search_elements (struct ccl_rpn_attr **qa)
459 struct ccl_rpn_node *p1;
460 struct ccl_token *lookahead;
461 if (KIND == CCL_TOK_LP)
467 if (KIND != CCL_TOK_RP)
469 ccl_error = CCL_ERR_RP_EXPECTED;
476 else if (KIND == CCL_TOK_SET)
479 if (KIND == CCL_TOK_EQ)
481 if (KIND != CCL_TOK_TERM)
483 ccl_error = CCL_ERR_SETNAME_EXPECTED;
486 p1 = mk_node (CCL_RPN_SET);
487 p1->u.setname = copy_token_name (look_token);
491 lookahead = look_token;
493 while (lookahead->kind==CCL_TOK_TERM || lookahead->kind==CCL_TOK_COMMA)
494 lookahead = lookahead->next;
495 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
496 return qualifiers (lookahead, qa);
497 return search_terms (qa);
500 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa)
502 struct ccl_rpn_node *p1, *p2, *pn;
503 if (!(p1 = search_elements (qa)))
511 p2 = search_elements (qa);
517 pn = mk_node (CCL_RPN_AND);
524 p2 = search_elements (qa);
530 pn = mk_node (CCL_RPN_OR);
537 p2 = search_elements (qa);
543 pn = mk_node (CCL_RPN_NOT);
554 struct ccl_rpn_node *ccl_find (CCL_bibset abibset, struct ccl_token *list,
555 int *error, const char **pos)
557 struct ccl_rpn_node *p;
561 p = find_spec (NULL);
562 if (p && KIND != CCL_TOK_EOL)
564 if (KIND == CCL_TOK_RP)
565 ccl_error = CCL_ERR_BAD_RP;
567 ccl_error = CCL_ERR_OP_EXPECTED;
571 *pos = look_token->name;
579 struct ccl_rpn_node *ccl_find_str (CCL_bibset bibset, const char *str,
580 int *error, int *pos)
582 struct ccl_token *list;
583 struct ccl_rpn_node *rpn;
584 const char *char_pos;
586 list = ccl_tokenize (str);
587 rpn = ccl_find (bibset, list, error, &char_pos);
589 *pos = char_pos - str;