1 /* CCL find (to rpn conversion)
5 * Revision 1.7 1995/02/14 19:55:10 adam
6 * Header files ccl.h/cclp.h are gone! They have been merged an
7 * moved to ../include/ccl.h.
8 * Node kind(s) in ccl_rpn_node have changed names.
10 * Revision 1.6 1995/02/14 16:20:55 adam
11 * Qualifiers are read from a file now.
13 * Revision 1.5 1995/02/14 14:12:41 adam
14 * Ranges for ordered qualfiers implemented (e.g. pd=1980-1990).
16 * Revision 1.4 1995/02/14 13:16:29 adam
17 * Left and/or right truncation implemented.
19 * Revision 1.3 1995/02/14 10:25:56 adam
20 * The constructions 'qualifier rel term ...' implemented.
22 * Revision 1.2 1995/02/13 15:15:07 adam
23 * Added handling of qualifiers. Not finished yet.
25 * Revision 1.1 1995/02/13 12:35:20 adam
26 * First version of CCL. Qualifiers aren't handled yet.
37 static struct ccl_token *look_token;
39 static CCL_bibset bibset;
41 #define KIND (look_token->kind)
42 #define ADVANCE look_token = look_token->next
43 #define ADVX(x) x=(x)->next
45 static struct ccl_rpn_attr *qual_val (struct ccl_rpn_attr *list, int type)
49 if (list->type == type)
56 static int qual_val_type (struct ccl_rpn_attr *list, int type, int value)
60 if (list->type == type && list->value == value)
67 static void strxcat (char *n, const char *src, int len)
76 static char *copy_token_name (struct ccl_token *tp)
78 char *str = malloc (tp->len + 1);
80 memcpy (str, tp->name, tp->len);
85 static struct ccl_rpn_node *mk_node (enum rpn_node_kind kind)
87 struct ccl_rpn_node *p;
88 p = malloc (sizeof(*p));
94 void ccl_rpn_delete (struct ccl_rpn_node *rpn)
96 struct ccl_rpn_attr *attr, *attr1;
104 ccl_rpn_delete (rpn->u.p[0]);
105 ccl_rpn_delete (rpn->u.p[1]);
108 free (rpn->u.t.term);
109 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
116 free (rpn->u.setname);
119 ccl_rpn_delete (rpn->u.p[0]);
120 ccl_rpn_delete (rpn->u.p[1]);
126 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa);
127 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa);
129 static void add_attr (struct ccl_rpn_node *p, int type, int value)
131 struct ccl_rpn_attr *n;
133 n = malloc (sizeof(*n));
137 n->next = p->u.t.attr_list;
138 p->u.t.attr_list = n;
141 static struct ccl_rpn_node *search_term (struct ccl_rpn_attr **qa)
143 struct ccl_rpn_node *p;
144 struct ccl_rpn_attr *attr;
145 struct ccl_token *lookahead = look_token;
152 if (KIND != CCL_TOK_TERM)
154 ccl_error = CCL_ERR_TERM_EXPECTED;
157 for (no = 0; lookahead->kind == CCL_TOK_TERM; no++)
159 for (i = 0; i<lookahead->len; i++)
160 if (lookahead->name[i] == '?')
162 if (no == 0 && i == 0 && lookahead->len >= 1)
164 else if (lookahead->next->kind != CCL_TOK_TERM &&
165 i == lookahead->len-1 && i >= 1)
170 len += 1+lookahead->len;
171 lookahead = lookahead->next;
173 p = mk_node (CCL_RPN_TERM);
174 p->u.t.term = malloc (len);
175 assert (p->u.t.term);
176 p->u.t.attr_list = NULL;
177 p->u.t.term[0] = '\0';
178 for (i = 0; i<no; i++)
180 const char *src_str = look_token->name;
181 int src_len = look_token->len;
183 if (i == 0 && left_trunc)
188 else if (i == no-1 && right_trunc)
191 strcat (p->u.t.term, " ");
192 strxcat (p->u.t.term, src_str, src_len);
198 for (i=0; qa[i]; i++)
200 struct ccl_rpn_attr *attr;
202 for (attr = qa[i]; attr; attr = attr->next)
204 add_attr (p, attr->type, attr->value);
209 attr = ccl_qual_search (bibset, "term", 4);
210 if (attr && qual_val_type (attr, CCL_BIB1_STR, CCL_BIB1_STR_WP))
213 add_attr (p, CCL_BIB1_STR, 2);
215 add_attr (p, CCL_BIB1_STR, 1);
217 if (left_trunc && right_trunc)
219 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH))
221 ccl_error = CCL_ERR_TRUNC_NOT_BOTH;
227 add_attr (p, CCL_BIB1_TRU, 3);
229 else if (right_trunc)
231 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT))
233 ccl_error = CCL_ERR_TRUNC_NOT_RIGHT;
239 add_attr (p, CCL_BIB1_TRU, 1);
243 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT))
245 ccl_error = CCL_ERR_TRUNC_NOT_LEFT;
251 add_attr (p, CCL_BIB1_TRU, 2);
255 if (attr && qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE))
256 add_attr (p, CCL_BIB1_TRU, 100);
261 static struct ccl_rpn_node *qualifiers (struct ccl_token *la,
262 struct ccl_rpn_attr **qa)
264 struct ccl_token *lookahead = look_token;
265 struct ccl_rpn_attr **ap;
268 struct ccl_rpn_attr *attr;
272 ccl_error = CCL_ERR_DOBBLE_QUAL;
275 for (lookahead = look_token; lookahead != la; lookahead=lookahead->next)
277 ap = malloc (no * sizeof(*ap));
279 for (i=0; look_token != la; i++)
281 ap[i] = ccl_qual_search (bibset, look_token->name, look_token->len);
284 ccl_error = CCL_ERR_UNKNOWN_QUAL;
289 if (KIND == CCL_TOK_COMMA)
293 if (! (attr = qual_val (ap[0], CCL_BIB1_REL)) ||
294 attr->value != CCL_BIB1_REL_ORDER)
296 /* unordered relation */
297 struct ccl_rpn_node *p;
298 if (KIND != CCL_TOK_EQ)
300 ccl_error = CCL_ERR_EQ_EXPECTED;
305 if (KIND == CCL_TOK_LP)
308 if (!(p = find_spec (ap)))
313 if (KIND != CCL_TOK_RP)
315 ccl_error = CCL_ERR_RP_EXPECTED;
323 p = search_terms (ap);
328 if (look_token->len == 1)
330 if (look_token->name[0] == '<')
332 else if (look_token->name[0] == '=')
334 else if (look_token->name[0] == '>')
337 else if (look_token->len == 2)
339 if (!memcmp (look_token->name, "<=", 2))
341 else if (!memcmp (look_token->name, ">=", 2))
343 else if (!memcmp (look_token->name, "<>", 2))
347 ccl_error = CCL_ERR_BAD_RELATION;
350 struct ccl_rpn_node *p;
352 ADVANCE; /* skip relation */
353 if (KIND == CCL_TOK_TERM)
355 struct ccl_rpn_node *p1;
356 p1 = search_term (ap);
357 if (KIND == CCL_TOK_MINUS)
359 ADVANCE; /* skip '-' */
360 if (KIND == CCL_TOK_TERM) /* = term - term ? */
362 struct ccl_rpn_node *p2;
364 p2 = search_term (ap);
365 p = mk_node (CCL_RPN_AND);
367 add_attr (p1, CCL_BIB1_REL, 4);
369 add_attr (p2, CCL_BIB1_REL, 2);
375 add_attr (p1, CCL_BIB1_REL, 4);
382 add_attr (p1, CCL_BIB1_REL, rel);
387 else if (KIND == CCL_TOK_MINUS) /* = - term ? */
390 p = search_term (ap);
391 add_attr (p, CCL_BIB1_REL, 2);
395 ccl_error = CCL_ERR_TERM_EXPECTED;
401 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa)
403 struct ccl_rpn_node *p1, *p2, *pn;
404 p1 = search_term (qa);
409 if (KIND == CCL_TOK_PROX)
412 p2 = search_term (qa);
418 pn = mk_node (CCL_RPN_PROX);
423 else if (KIND == CCL_TOK_TERM)
425 p2 = search_term (qa);
442 static struct ccl_rpn_node *search_elements (struct ccl_rpn_attr **qa)
444 struct ccl_rpn_node *p1;
445 struct ccl_token *lookahead;
446 if (KIND == CCL_TOK_LP)
452 if (KIND != CCL_TOK_RP)
454 ccl_error = CCL_ERR_RP_EXPECTED;
461 else if (KIND == CCL_TOK_SET)
464 if (KIND == CCL_TOK_EQ)
466 if (KIND != CCL_TOK_TERM)
468 ccl_error = CCL_ERR_SETNAME_EXPECTED;
471 p1 = mk_node (CCL_RPN_SET);
472 p1->u.setname = copy_token_name (look_token);
476 lookahead = look_token;
478 while (lookahead->kind==CCL_TOK_TERM || lookahead->kind==CCL_TOK_COMMA)
479 lookahead = lookahead->next;
480 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
481 return qualifiers (lookahead, qa);
482 return search_terms (qa);
485 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa)
487 struct ccl_rpn_node *p1, *p2, *pn;
488 if (!(p1 = search_elements (qa)))
496 p2 = search_elements (qa);
502 pn = mk_node (CCL_RPN_AND);
509 p2 = search_elements (qa);
515 pn = mk_node (CCL_RPN_OR);
522 p2 = search_elements (qa);
528 pn = mk_node (CCL_RPN_NOT);
539 struct ccl_rpn_node *ccl_find (CCL_bibset abibset, struct ccl_token *list,
540 int *error, const char **pos)
542 struct ccl_rpn_node *p;
546 p = find_spec (NULL);
547 if (p && KIND != CCL_TOK_EOL)
549 if (KIND == CCL_TOK_RP)
550 ccl_error = CCL_ERR_BAD_RP;
552 ccl_error = CCL_ERR_OP_EXPECTED;
556 *pos = look_token->name;
564 struct ccl_rpn_node *ccl_find_str (CCL_bibset bibset, const char *str,
565 int *error, int *pos)
567 struct ccl_token *list, *li;
568 struct ccl_rpn_node *rpn;
569 const char *char_pos;
571 list = ccl_tokenize (str);
573 for (li = list; li; li = li->next)
574 printf ("kind=%d, str='%.*s'\n", li->kind, li->len, li->name);
576 rpn = ccl_find (bibset, list, error, &char_pos);
578 *pos = char_pos - str;