1 /* CCL find (to rpn conversion)
5 * Revision 1.6 1995/02/14 16:20:55 adam
6 * Qualifiers are read from a file now.
8 * Revision 1.5 1995/02/14 14:12:41 adam
9 * Ranges for ordered qualfiers implemented (e.g. pd=1980-1990).
11 * Revision 1.4 1995/02/14 13:16:29 adam
12 * Left and/or right truncation implemented.
14 * Revision 1.3 1995/02/14 10:25:56 adam
15 * The constructions 'qualifier rel term ...' implemented.
17 * Revision 1.2 1995/02/13 15:15:07 adam
18 * Added handling of qualifiers. Not finished yet.
20 * Revision 1.1 1995/02/13 12:35:20 adam
21 * First version of CCL. Qualifiers aren't handled yet.
32 static struct ccl_token *look_token;
34 static CCL_bibset bibset;
36 #define KIND (look_token->kind)
37 #define ADVANCE look_token = look_token->next
38 #define ADVX(x) x=(x)->next
40 static struct ccl_rpn_attr *qual_val (struct ccl_rpn_attr *list, int type)
44 if (list->type == type)
51 static int qual_val_type (struct ccl_rpn_attr *list, int type, int value)
55 if (list->type == type && list->value == value)
62 static void strxcat (char *n, const char *src, int len)
71 static char *copy_token_name (struct ccl_token *tp)
73 char *str = malloc (tp->len + 1);
75 memcpy (str, tp->name, tp->len);
80 static struct ccl_rpn_node *mk_node (enum rpn_node_kind kind)
82 struct ccl_rpn_node *p;
83 p = malloc (sizeof(*p));
89 void ccl_rpn_delete (struct ccl_rpn_node *rpn)
91 struct ccl_rpn_attr *attr, *attr1;
99 ccl_rpn_delete (rpn->u.p[0]);
100 ccl_rpn_delete (rpn->u.p[1]);
103 free (rpn->u.t.term);
104 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
111 free (rpn->u.setname);
114 ccl_rpn_delete (rpn->u.p[0]);
115 ccl_rpn_delete (rpn->u.p[1]);
121 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa);
122 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa);
124 static void add_attr (struct ccl_rpn_node *p, int type, int value)
126 struct ccl_rpn_attr *n;
128 n = malloc (sizeof(*n));
132 n->next = p->u.t.attr_list;
133 p->u.t.attr_list = n;
136 static struct ccl_rpn_node *search_term (struct ccl_rpn_attr **qa)
138 struct ccl_rpn_node *p;
139 struct ccl_rpn_attr *attr;
140 struct ccl_token *lookahead = look_token;
147 if (KIND != CCL_TOK_TERM)
149 ccl_error = CCL_ERR_TERM_EXPECTED;
152 for (no = 0; lookahead->kind == CCL_TOK_TERM; no++)
154 for (i = 0; i<lookahead->len; i++)
155 if (lookahead->name[i] == '?')
157 if (no == 0 && i == 0 && lookahead->len >= 1)
159 else if (lookahead->next->kind != CCL_TOK_TERM &&
160 i == lookahead->len-1 && i >= 1)
165 len += 1+lookahead->len;
166 lookahead = lookahead->next;
169 p->u.t.term = malloc (len);
170 assert (p->u.t.term);
171 p->u.t.attr_list = NULL;
172 p->u.t.term[0] = '\0';
173 for (i = 0; i<no; i++)
175 const char *src_str = look_token->name;
176 int src_len = look_token->len;
178 if (i == 0 && left_trunc)
183 else if (i == no-1 && right_trunc)
186 strcat (p->u.t.term, " ");
187 strxcat (p->u.t.term, src_str, src_len);
193 for (i=0; qa[i]; i++)
195 struct ccl_rpn_attr *attr;
197 for (attr = qa[i]; attr; attr = attr->next)
199 add_attr (p, attr->type, attr->value);
204 attr = ccl_qual_search (bibset, "term", 4);
205 if (attr && qual_val_type (attr, CCL_BIB1_STR, CCL_BIB1_STR_WP))
208 add_attr (p, CCL_BIB1_STR, 2);
210 add_attr (p, CCL_BIB1_STR, 1);
212 if (left_trunc && right_trunc)
214 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_BOTH))
216 ccl_error = CCL_ERR_TRUNC_NOT_BOTH;
222 add_attr (p, CCL_BIB1_TRU, 3);
224 else if (right_trunc)
226 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_RIGHT))
228 ccl_error = CCL_ERR_TRUNC_NOT_RIGHT;
234 add_attr (p, CCL_BIB1_TRU, 1);
238 if (attr && !qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_LEFT))
240 ccl_error = CCL_ERR_TRUNC_NOT_LEFT;
246 add_attr (p, CCL_BIB1_TRU, 2);
250 if (attr && qual_val_type (attr, CCL_BIB1_TRU, CCL_BIB1_TRU_CAN_NONE))
251 add_attr (p, CCL_BIB1_TRU, 100);
256 static struct ccl_rpn_node *qualifiers (struct ccl_token *la,
257 struct ccl_rpn_attr **qa)
259 struct ccl_token *lookahead = look_token;
260 struct ccl_rpn_attr **ap;
263 struct ccl_rpn_attr *attr;
267 ccl_error = CCL_ERR_DOBBLE_QUAL;
270 for (lookahead = look_token; lookahead != la; lookahead=lookahead->next)
272 ap = malloc (no * sizeof(*ap));
274 for (i=0; look_token != la; i++)
276 ap[i] = ccl_qual_search (bibset, look_token->name, look_token->len);
279 ccl_error = CCL_ERR_UNKNOWN_QUAL;
284 if (KIND == CCL_TOK_COMMA)
288 if (! (attr = qual_val (ap[0], CCL_BIB1_REL)) ||
289 attr->value != CCL_BIB1_REL_ORDER)
291 /* unordered relation */
292 struct ccl_rpn_node *p;
293 if (KIND != CCL_TOK_EQ)
295 ccl_error = CCL_ERR_EQ_EXPECTED;
300 if (KIND == CCL_TOK_LP)
303 if (!(p = find_spec (ap)))
308 if (KIND != CCL_TOK_RP)
310 ccl_error = CCL_ERR_RP_EXPECTED;
318 p = search_terms (ap);
323 if (look_token->len == 1)
325 if (look_token->name[0] == '<')
327 else if (look_token->name[0] == '=')
329 else if (look_token->name[0] == '>')
332 else if (look_token->len == 2)
334 if (!memcmp (look_token->name, "<=", 2))
336 else if (!memcmp (look_token->name, ">=", 2))
338 else if (!memcmp (look_token->name, "<>", 2))
342 ccl_error = CCL_ERR_BAD_RELATION;
345 struct ccl_rpn_node *p;
347 ADVANCE; /* skip relation */
348 if (KIND == CCL_TOK_TERM)
350 struct ccl_rpn_node *p1;
351 p1 = search_term (ap);
352 if (KIND == CCL_TOK_MINUS)
354 ADVANCE; /* skip '-' */
355 if (KIND == CCL_TOK_TERM) /* = term - term ? */
357 struct ccl_rpn_node *p2;
359 p2 = search_term (ap);
362 add_attr (p1, CCL_BIB1_REL, 4);
364 add_attr (p2, CCL_BIB1_REL, 2);
370 add_attr (p1, CCL_BIB1_REL, 4);
377 add_attr (p1, CCL_BIB1_REL, rel);
382 else if (KIND == CCL_TOK_MINUS) /* = - term ? */
385 p = search_term (ap);
386 add_attr (p, CCL_BIB1_REL, 2);
390 ccl_error = CCL_ERR_TERM_EXPECTED;
396 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa)
398 struct ccl_rpn_node *p1, *p2, *pn;
399 p1 = search_term (qa);
404 if (KIND == CCL_TOK_PROX)
407 p2 = search_term (qa);
418 else if (KIND == CCL_TOK_TERM)
420 p2 = search_term (qa);
437 static struct ccl_rpn_node *search_elements (struct ccl_rpn_attr **qa)
439 struct ccl_rpn_node *p1;
440 struct ccl_token *lookahead;
441 if (KIND == CCL_TOK_LP)
447 if (KIND != CCL_TOK_RP)
449 ccl_error = CCL_ERR_RP_EXPECTED;
456 else if (KIND == CCL_TOK_SET)
459 if (KIND == CCL_TOK_EQ)
461 if (KIND != CCL_TOK_TERM)
463 ccl_error = CCL_ERR_SETNAME_EXPECTED;
467 p1->u.setname = copy_token_name (look_token);
471 lookahead = look_token;
473 while (lookahead->kind==CCL_TOK_TERM || lookahead->kind==CCL_TOK_COMMA)
474 lookahead = lookahead->next;
475 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
476 return qualifiers (lookahead, qa);
477 return search_terms (qa);
480 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa)
482 struct ccl_rpn_node *p1, *p2, *pn;
483 if (!(p1 = search_elements (qa)))
491 p2 = search_elements (qa);
504 p2 = search_elements (qa);
517 p2 = search_elements (qa);
534 struct ccl_rpn_node *ccl_find (CCL_bibset abibset, struct ccl_token *list,
535 int *error, const char **pos)
537 struct ccl_rpn_node *p;
541 p = find_spec (NULL);
542 if (p && KIND != CCL_TOK_EOL)
544 if (KIND == CCL_TOK_RP)
545 ccl_error = CCL_ERR_BAD_RP;
547 ccl_error = CCL_ERR_OP_EXPECTED;
551 *pos = look_token->name;
559 struct ccl_rpn_node *ccl_find_str (CCL_bibset bibset, const char *str,
560 int *error, int *pos)
562 struct ccl_token *list, *li;
563 struct ccl_rpn_node *rpn;
564 const char *char_pos;
566 list = ccl_tokenize (str);
568 for (li = list; li; li = li->next)
569 printf ("kind=%d, str='%.*s'\n", li->kind, li->len, li->name);
571 rpn = ccl_find (bibset, list, error, &char_pos);
573 *pos = char_pos - str;