1 /* CCL find (to rpn conversion)
5 * Revision 1.8 1995/02/14 19:59:42 adam
6 * Removed a syntax error.
8 * Revision 1.7 1995/02/14 19:55:10 adam
9 * Header files ccl.h/cclp.h are gone! They have been merged an
10 * moved to ../include/ccl.h.
11 * Node kind(s) in ccl_rpn_node have changed names.
13 * Revision 1.6 1995/02/14 16:20:55 adam
14 * Qualifiers are read from a file now.
16 * Revision 1.5 1995/02/14 14:12:41 adam
17 * Ranges for ordered qualfiers implemented (e.g. pd=1980-1990).
19 * Revision 1.4 1995/02/14 13:16:29 adam
20 * Left and/or right truncation implemented.
22 * Revision 1.3 1995/02/14 10:25:56 adam
23 * The constructions 'qualifier rel term ...' implemented.
25 * Revision 1.2 1995/02/13 15:15:07 adam
26 * Added handling of qualifiers. Not finished yet.
28 * Revision 1.1 1995/02/13 12:35:20 adam
29 * First version of CCL. Qualifiers aren't handled yet.
40 static struct ccl_token *look_token;
42 static CCL_bibset bibset;
44 #define KIND (look_token->kind)
45 #define ADVANCE look_token = look_token->next
46 #define ADVX(x) x=(x)->next
48 static struct ccl_rpn_attr *qual_val (struct ccl_rpn_attr *list, int type)
52 if (list->type == type)
59 static int qual_val_type (struct ccl_rpn_attr *list, int type, int value)
63 if (list->type == type && list->value == value)
70 static void strxcat (char *n, const char *src, int len)
79 static char *copy_token_name (struct ccl_token *tp)
81 char *str = malloc (tp->len + 1);
83 memcpy (str, tp->name, tp->len);
88 static struct ccl_rpn_node *mk_node (enum rpn_node_kind kind)
90 struct ccl_rpn_node *p;
91 p = malloc (sizeof(*p));
97 void ccl_rpn_delete (struct ccl_rpn_node *rpn)
99 struct ccl_rpn_attr *attr, *attr1;
107 ccl_rpn_delete (rpn->u.p[0]);
108 ccl_rpn_delete (rpn->u.p[1]);
111 free (rpn->u.t.term);
112 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
119 free (rpn->u.setname);
122 ccl_rpn_delete (rpn->u.p[0]);
123 ccl_rpn_delete (rpn->u.p[1]);
129 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa);
130 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa);
132 static void add_attr (struct ccl_rpn_node *p, int type, int value)
134 struct ccl_rpn_attr *n;
136 n = malloc (sizeof(*n));
140 n->next = p->u.t.attr_list;
141 p->u.t.attr_list = n;
144 static struct ccl_rpn_node *search_term (struct ccl_rpn_attr **qa)
146 struct ccl_rpn_node *p;
147 struct ccl_rpn_attr *attr;
148 struct ccl_token *lookahead = look_token;
155 if (KIND != CCL_TOK_TERM)
157 ccl_error = CCL_ERR_TERM_EXPECTED;
160 for (no = 0; lookahead->kind == CCL_TOK_TERM; no++)
162 for (i = 0; i<lookahead->len; i++)
163 if (lookahead->name[i] == '?')
165 if (no == 0 && i == 0 && lookahead->len >= 1)
167 else if (lookahead->next->kind != CCL_TOK_TERM &&
168 i == lookahead->len-1 && i >= 1)
173 len += 1+lookahead->len;
174 lookahead = lookahead->next;
176 p = mk_node (CCL_RPN_TERM);
177 p->u.t.term = malloc (len);
178 assert (p->u.t.term);
179 p->u.t.attr_list = NULL;
180 p->u.t.term[0] = '\0';
181 for (i = 0; i<no; i++)
183 const char *src_str = look_token->name;
184 int src_len = look_token->len;
186 if (i == 0 && left_trunc)
191 else if (i == no-1 && right_trunc)
194 strcat (p->u.t.term, " ");
195 strxcat (p->u.t.term, src_str, src_len);
201 for (i=0; qa[i]; i++)
203 struct ccl_rpn_attr *attr;
205 for (attr = qa[i]; attr; attr = attr->next)
207 add_attr (p, attr->type, attr->value);
212 attr = ccl_qual_search (bibset, "term", 4);
213 if (attr && qual_val_type (attr, CCL_BIB1_STR, CCL_BIB1_STR_WP))
216 add_attr (p, CCL_BIB1_STR, 2);
218 add_attr (p, CCL_BIB1_STR, 1);
220 if (left_trunc && right_trunc)
222 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH))
224 ccl_error = CCL_ERR_TRUNC_NOT_BOTH;
230 add_attr (p, CCL_BIB1_TRU, 3);
232 else if (right_trunc)
234 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT))
236 ccl_error = CCL_ERR_TRUNC_NOT_RIGHT;
242 add_attr (p, CCL_BIB1_TRU, 1);
246 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT))
248 ccl_error = CCL_ERR_TRUNC_NOT_LEFT;
254 add_attr (p, CCL_BIB1_TRU, 2);
258 if (attr && qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE))
259 add_attr (p, CCL_BIB1_TRU, 100);
264 static struct ccl_rpn_node *qualifiers (struct ccl_token *la,
265 struct ccl_rpn_attr **qa)
267 struct ccl_token *lookahead = look_token;
268 struct ccl_rpn_attr **ap;
271 struct ccl_rpn_attr *attr;
275 ccl_error = CCL_ERR_DOBBLE_QUAL;
278 for (lookahead = look_token; lookahead != la; lookahead=lookahead->next)
280 ap = malloc (no * sizeof(*ap));
282 for (i=0; look_token != la; i++)
284 ap[i] = ccl_qual_search (bibset, look_token->name, look_token->len);
287 ccl_error = CCL_ERR_UNKNOWN_QUAL;
292 if (KIND == CCL_TOK_COMMA)
296 if (! (attr = qual_val (ap[0], CCL_BIB1_REL)) ||
297 attr->value != CCL_BIB1_REL_ORDER)
299 /* unordered relation */
300 struct ccl_rpn_node *p;
301 if (KIND != CCL_TOK_EQ)
303 ccl_error = CCL_ERR_EQ_EXPECTED;
308 if (KIND == CCL_TOK_LP)
311 if (!(p = find_spec (ap)))
316 if (KIND != CCL_TOK_RP)
318 ccl_error = CCL_ERR_RP_EXPECTED;
326 p = search_terms (ap);
331 if (look_token->len == 1)
333 if (look_token->name[0] == '<')
335 else if (look_token->name[0] == '=')
337 else if (look_token->name[0] == '>')
340 else if (look_token->len == 2)
342 if (!memcmp (look_token->name, "<=", 2))
344 else if (!memcmp (look_token->name, ">=", 2))
346 else if (!memcmp (look_token->name, "<>", 2))
350 ccl_error = CCL_ERR_BAD_RELATION;
353 struct ccl_rpn_node *p;
355 ADVANCE; /* skip relation */
356 if (KIND == CCL_TOK_TERM)
358 struct ccl_rpn_node *p1;
359 p1 = search_term (ap);
360 if (KIND == CCL_TOK_MINUS)
362 ADVANCE; /* skip '-' */
363 if (KIND == CCL_TOK_TERM) /* = term - term ? */
365 struct ccl_rpn_node *p2;
367 p2 = search_term (ap);
368 p = mk_node (CCL_RPN_AND);
370 add_attr (p1, CCL_BIB1_REL, 4);
372 add_attr (p2, CCL_BIB1_REL, 2);
378 add_attr (p1, CCL_BIB1_REL, 4);
385 add_attr (p1, CCL_BIB1_REL, rel);
390 else if (KIND == CCL_TOK_MINUS) /* = - term ? */
393 p = search_term (ap);
394 add_attr (p, CCL_BIB1_REL, 2);
398 ccl_error = CCL_ERR_TERM_EXPECTED;
404 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa)
406 struct ccl_rpn_node *p1, *p2, *pn;
407 p1 = search_term (qa);
412 if (KIND == CCL_TOK_PROX)
415 p2 = search_term (qa);
421 pn = mk_node (CCL_RPN_PROX);
426 else if (KIND == CCL_TOK_TERM)
428 p2 = search_term (qa);
434 pn = mk_node (CCL_RPN_PROX);
445 static struct ccl_rpn_node *search_elements (struct ccl_rpn_attr **qa)
447 struct ccl_rpn_node *p1;
448 struct ccl_token *lookahead;
449 if (KIND == CCL_TOK_LP)
455 if (KIND != CCL_TOK_RP)
457 ccl_error = CCL_ERR_RP_EXPECTED;
464 else if (KIND == CCL_TOK_SET)
467 if (KIND == CCL_TOK_EQ)
469 if (KIND != CCL_TOK_TERM)
471 ccl_error = CCL_ERR_SETNAME_EXPECTED;
474 p1 = mk_node (CCL_RPN_SET);
475 p1->u.setname = copy_token_name (look_token);
479 lookahead = look_token;
481 while (lookahead->kind==CCL_TOK_TERM || lookahead->kind==CCL_TOK_COMMA)
482 lookahead = lookahead->next;
483 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
484 return qualifiers (lookahead, qa);
485 return search_terms (qa);
488 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa)
490 struct ccl_rpn_node *p1, *p2, *pn;
491 if (!(p1 = search_elements (qa)))
499 p2 = search_elements (qa);
505 pn = mk_node (CCL_RPN_AND);
512 p2 = search_elements (qa);
518 pn = mk_node (CCL_RPN_OR);
525 p2 = search_elements (qa);
531 pn = mk_node (CCL_RPN_NOT);
542 struct ccl_rpn_node *ccl_find (CCL_bibset abibset, struct ccl_token *list,
543 int *error, const char **pos)
545 struct ccl_rpn_node *p;
549 p = find_spec (NULL);
550 if (p && KIND != CCL_TOK_EOL)
552 if (KIND == CCL_TOK_RP)
553 ccl_error = CCL_ERR_BAD_RP;
555 ccl_error = CCL_ERR_OP_EXPECTED;
559 *pos = look_token->name;
567 struct ccl_rpn_node *ccl_find_str (CCL_bibset bibset, const char *str,
568 int *error, int *pos)
570 struct ccl_token *list, *li;
571 struct ccl_rpn_node *rpn;
572 const char *char_pos;
574 list = ccl_tokenize (str);
576 for (li = list; li; li = li->next)
577 printf ("kind=%d, str='%.*s'\n", li->kind, li->len, li->name);
579 rpn = ccl_find (bibset, list, error, &char_pos);
581 *pos = char_pos - str;