1 /* CCL find (to rpn conversion)
5 * Revision 1.9 1995/02/16 13:20:06 adam
8 * Revision 1.8 1995/02/14 19:59:42 adam
9 * Removed a syntax error.
11 * Revision 1.7 1995/02/14 19:55:10 adam
12 * Header files ccl.h/cclp.h are gone! They have been merged an
13 * moved to ../include/ccl.h.
14 * Node kind(s) in ccl_rpn_node have changed names.
16 * Revision 1.6 1995/02/14 16:20:55 adam
17 * Qualifiers are read from a file now.
19 * Revision 1.5 1995/02/14 14:12:41 adam
20 * Ranges for ordered qualfiers implemented (e.g. pd=1980-1990).
22 * Revision 1.4 1995/02/14 13:16:29 adam
23 * Left and/or right truncation implemented.
25 * Revision 1.3 1995/02/14 10:25:56 adam
26 * The constructions 'qualifier rel term ...' implemented.
28 * Revision 1.2 1995/02/13 15:15:07 adam
29 * Added handling of qualifiers. Not finished yet.
31 * Revision 1.1 1995/02/13 12:35:20 adam
32 * First version of CCL. Qualifiers aren't handled yet.
43 static struct ccl_token *look_token;
45 static CCL_bibset bibset;
47 #define KIND (look_token->kind)
48 #define ADVANCE look_token = look_token->next
49 #define ADVX(x) x=(x)->next
51 static struct ccl_rpn_attr *qual_val (struct ccl_rpn_attr *list, int type)
55 if (list->type == type)
62 static int qual_val_type (struct ccl_rpn_attr *list, int type, int value)
66 if (list->type == type && list->value == value)
73 static void strxcat (char *n, const char *src, int len)
82 static char *copy_token_name (struct ccl_token *tp)
84 char *str = malloc (tp->len + 1);
86 memcpy (str, tp->name, tp->len);
91 static struct ccl_rpn_node *mk_node (enum rpn_node_kind kind)
93 struct ccl_rpn_node *p;
94 p = malloc (sizeof(*p));
100 void ccl_rpn_delete (struct ccl_rpn_node *rpn)
102 struct ccl_rpn_attr *attr, *attr1;
110 ccl_rpn_delete (rpn->u.p[0]);
111 ccl_rpn_delete (rpn->u.p[1]);
114 free (rpn->u.t.term);
115 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
122 free (rpn->u.setname);
125 ccl_rpn_delete (rpn->u.p[0]);
126 ccl_rpn_delete (rpn->u.p[1]);
132 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa);
133 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa);
135 static void add_attr (struct ccl_rpn_node *p, int type, int value)
137 struct ccl_rpn_attr *n;
139 n = malloc (sizeof(*n));
143 n->next = p->u.t.attr_list;
144 p->u.t.attr_list = n;
147 static struct ccl_rpn_node *search_term (struct ccl_rpn_attr **qa)
149 struct ccl_rpn_node *p;
150 struct ccl_rpn_attr *attr;
151 struct ccl_token *lookahead = look_token;
158 if (KIND != CCL_TOK_TERM)
160 ccl_error = CCL_ERR_TERM_EXPECTED;
163 for (no = 0; lookahead->kind == CCL_TOK_TERM; no++)
165 for (i = 0; i<lookahead->len; i++)
166 if (lookahead->name[i] == '?')
168 if (no == 0 && i == 0 && lookahead->len >= 1)
170 else if (lookahead->next->kind != CCL_TOK_TERM &&
171 i == lookahead->len-1 && i >= 1)
176 len += 1+lookahead->len;
177 lookahead = lookahead->next;
179 p = mk_node (CCL_RPN_TERM);
180 p->u.t.term = malloc (len);
181 assert (p->u.t.term);
182 p->u.t.attr_list = NULL;
183 p->u.t.term[0] = '\0';
184 for (i = 0; i<no; i++)
186 const char *src_str = look_token->name;
187 int src_len = look_token->len;
189 if (i == 0 && left_trunc)
194 else if (i == no-1 && right_trunc)
197 strcat (p->u.t.term, " ");
198 strxcat (p->u.t.term, src_str, src_len);
204 for (i=0; qa[i]; i++)
206 struct ccl_rpn_attr *attr;
208 for (attr = qa[i]; attr; attr = attr->next)
210 add_attr (p, attr->type, attr->value);
215 attr = ccl_qual_search (bibset, "term", 4);
216 if (attr && qual_val_type (attr, CCL_BIB1_STR, CCL_BIB1_STR_WP))
219 add_attr (p, CCL_BIB1_STR, 2);
221 add_attr (p, CCL_BIB1_STR, 1);
223 if (left_trunc && right_trunc)
225 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH))
227 ccl_error = CCL_ERR_TRUNC_NOT_BOTH;
233 add_attr (p, CCL_BIB1_TRU, 3);
235 else if (right_trunc)
237 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT))
239 ccl_error = CCL_ERR_TRUNC_NOT_RIGHT;
245 add_attr (p, CCL_BIB1_TRU, 1);
249 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT))
251 ccl_error = CCL_ERR_TRUNC_NOT_LEFT;
257 add_attr (p, CCL_BIB1_TRU, 2);
261 if (attr && qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE))
262 add_attr (p, CCL_BIB1_TRU, 100);
267 static struct ccl_rpn_node *qualifiers (struct ccl_token *la,
268 struct ccl_rpn_attr **qa)
270 struct ccl_token *lookahead = look_token;
271 struct ccl_rpn_attr **ap;
274 struct ccl_rpn_attr *attr;
278 ccl_error = CCL_ERR_DOUBLE_QUAL;
281 for (lookahead = look_token; lookahead != la; lookahead=lookahead->next)
283 ap = malloc (no * sizeof(*ap));
285 for (i=0; look_token != la; i++)
287 ap[i] = ccl_qual_search (bibset, look_token->name, look_token->len);
290 ccl_error = CCL_ERR_UNKNOWN_QUAL;
295 if (KIND == CCL_TOK_COMMA)
299 if (! (attr = qual_val (ap[0], CCL_BIB1_REL)) ||
300 attr->value != CCL_BIB1_REL_ORDER)
302 /* unordered relation */
303 struct ccl_rpn_node *p;
304 if (KIND != CCL_TOK_EQ)
306 ccl_error = CCL_ERR_EQ_EXPECTED;
311 if (KIND == CCL_TOK_LP)
314 if (!(p = find_spec (ap)))
319 if (KIND != CCL_TOK_RP)
321 ccl_error = CCL_ERR_RP_EXPECTED;
329 p = search_terms (ap);
334 if (look_token->len == 1)
336 if (look_token->name[0] == '<')
338 else if (look_token->name[0] == '=')
340 else if (look_token->name[0] == '>')
343 else if (look_token->len == 2)
345 if (!memcmp (look_token->name, "<=", 2))
347 else if (!memcmp (look_token->name, ">=", 2))
349 else if (!memcmp (look_token->name, "<>", 2))
353 ccl_error = CCL_ERR_BAD_RELATION;
356 struct ccl_rpn_node *p;
358 ADVANCE; /* skip relation */
359 if (KIND == CCL_TOK_TERM)
361 struct ccl_rpn_node *p1;
362 p1 = search_term (ap);
363 if (KIND == CCL_TOK_MINUS)
365 ADVANCE; /* skip '-' */
366 if (KIND == CCL_TOK_TERM) /* = term - term ? */
368 struct ccl_rpn_node *p2;
370 p2 = search_term (ap);
371 p = mk_node (CCL_RPN_AND);
373 add_attr (p1, CCL_BIB1_REL, 4);
375 add_attr (p2, CCL_BIB1_REL, 2);
381 add_attr (p1, CCL_BIB1_REL, 4);
388 add_attr (p1, CCL_BIB1_REL, rel);
393 else if (KIND == CCL_TOK_MINUS) /* = - term ? */
396 p = search_term (ap);
397 add_attr (p, CCL_BIB1_REL, 2);
401 ccl_error = CCL_ERR_TERM_EXPECTED;
407 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa)
409 struct ccl_rpn_node *p1, *p2, *pn;
410 p1 = search_term (qa);
415 if (KIND == CCL_TOK_PROX)
418 p2 = search_term (qa);
424 pn = mk_node (CCL_RPN_PROX);
429 else if (KIND == CCL_TOK_TERM)
431 p2 = search_term (qa);
437 pn = mk_node (CCL_RPN_PROX);
448 static struct ccl_rpn_node *search_elements (struct ccl_rpn_attr **qa)
450 struct ccl_rpn_node *p1;
451 struct ccl_token *lookahead;
452 if (KIND == CCL_TOK_LP)
458 if (KIND != CCL_TOK_RP)
460 ccl_error = CCL_ERR_RP_EXPECTED;
467 else if (KIND == CCL_TOK_SET)
470 if (KIND == CCL_TOK_EQ)
472 if (KIND != CCL_TOK_TERM)
474 ccl_error = CCL_ERR_SETNAME_EXPECTED;
477 p1 = mk_node (CCL_RPN_SET);
478 p1->u.setname = copy_token_name (look_token);
482 lookahead = look_token;
484 while (lookahead->kind==CCL_TOK_TERM || lookahead->kind==CCL_TOK_COMMA)
485 lookahead = lookahead->next;
486 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
487 return qualifiers (lookahead, qa);
488 return search_terms (qa);
491 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa)
493 struct ccl_rpn_node *p1, *p2, *pn;
494 if (!(p1 = search_elements (qa)))
502 p2 = search_elements (qa);
508 pn = mk_node (CCL_RPN_AND);
515 p2 = search_elements (qa);
521 pn = mk_node (CCL_RPN_OR);
528 p2 = search_elements (qa);
534 pn = mk_node (CCL_RPN_NOT);
545 struct ccl_rpn_node *ccl_find (CCL_bibset abibset, struct ccl_token *list,
546 int *error, const char **pos)
548 struct ccl_rpn_node *p;
552 p = find_spec (NULL);
553 if (p && KIND != CCL_TOK_EOL)
555 if (KIND == CCL_TOK_RP)
556 ccl_error = CCL_ERR_BAD_RP;
558 ccl_error = CCL_ERR_OP_EXPECTED;
562 *pos = look_token->name;
570 struct ccl_rpn_node *ccl_find_str (CCL_bibset bibset, const char *str,
571 int *error, int *pos)
573 struct ccl_token *list, *li;
574 struct ccl_rpn_node *rpn;
575 const char *char_pos;
577 list = ccl_tokenize (str);
579 for (li = list; li; li = li->next)
580 printf ("kind=%d, str='%.*s'\n", li->kind, li->len, li->name);
582 rpn = ccl_find (bibset, list, error, &char_pos);
584 *pos = char_pos - str;