1 /* CCL find (to rpn conversion)
5 * Revision 1.5 1995/02/14 14:12:41 adam
6 * Ranges for ordered qualfiers implemented (e.g. pd=1980-1990).
8 * Revision 1.4 1995/02/14 13:16:29 adam
9 * Left and/or right truncation implemented.
11 * Revision 1.3 1995/02/14 10:25:56 adam
12 * The constructions 'qualifier rel term ...' implemented.
14 * Revision 1.2 1995/02/13 15:15:07 adam
15 * Added handling of qualifiers. Not finished yet.
17 * Revision 1.1 1995/02/13 12:35:20 adam
18 * First version of CCL. Qualifiers aren't handled yet.
29 static struct ccl_token *look_token;
31 static CCL_bibset bibset;
33 #define KIND (look_token->kind)
34 #define ADVANCE look_token = look_token->next
35 #define ADVX(x) x=(x)->next
37 static struct ccl_rpn_attr *qual_val (struct ccl_rpn_attr *list, int type)
41 if (list->type == type)
48 static void strxcat (char *n, const char *src, int len)
57 static char *copy_token_name (struct ccl_token *tp)
59 char *str = malloc (tp->len + 1);
61 memcpy (str, tp->name, tp->len);
66 static struct ccl_rpn_node *mk_node (enum rpn_node_kind kind)
68 struct ccl_rpn_node *p;
69 p = malloc (sizeof(*p));
75 void ccl_rpn_delete (struct ccl_rpn_node *rpn)
77 struct ccl_rpn_attr *attr, *attr1;
85 ccl_rpn_delete (rpn->u.p[0]);
86 ccl_rpn_delete (rpn->u.p[1]);
90 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
97 free (rpn->u.setname);
100 ccl_rpn_delete (rpn->u.p[0]);
101 ccl_rpn_delete (rpn->u.p[1]);
107 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa);
108 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa);
110 static void add_attr (struct ccl_rpn_node *p, int type, int value)
112 struct ccl_rpn_attr *n;
114 n = malloc (sizeof(*n));
118 n->next = p->u.t.attr_list;
119 p->u.t.attr_list = n;
122 static struct ccl_rpn_node *search_term (struct ccl_rpn_attr **qa)
124 struct ccl_rpn_node *p;
125 struct ccl_token *lookahead = look_token;
132 if (KIND != CCL_TOK_TERM)
134 ccl_error = CCL_ERR_TERM_EXPECTED;
137 for (no = 0; lookahead->kind == CCL_TOK_TERM; no++)
139 for (i = 0; i<lookahead->len; i++)
140 if (lookahead->name[i] == '?')
142 if (no == 0 && i == 0 && lookahead->len >= 1)
144 else if (lookahead->next->kind != CCL_TOK_TERM &&
145 i == lookahead->len-1 && i >= 1)
150 len += 1+lookahead->len;
151 lookahead = lookahead->next;
154 p->u.t.term = malloc (len);
155 assert (p->u.t.term);
156 p->u.t.attr_list = NULL;
157 p->u.t.term[0] = '\0';
158 for (i = 0; i<no; i++)
160 const char *src_str = look_token->name;
161 int src_len = look_token->len;
163 if (i == 0 && left_trunc)
168 else if (i == no-1 && right_trunc)
171 strcat (p->u.t.term, " ");
172 strxcat (p->u.t.term, src_str, src_len);
178 struct ccl_rpn_attr *attr;
179 for (i=0; qa[i]; i++)
181 struct ccl_rpn_attr *attr;
183 for (attr = qa[i]; attr; attr = attr->next)
185 add_attr (p, attr->type, attr->value);
187 if ((attr = qual_val (qa[0], CCL_BIB1_STR)) &&
188 attr->value == CCL_BIB1_STR_WP)
191 add_attr (p, CCL_BIB1_STR, 2);
193 add_attr (p, CCL_BIB1_STR, 1);
196 if (left_trunc && right_trunc)
197 add_attr (p, CCL_BIB1_TRU, 3);
198 else if (right_trunc)
199 add_attr (p, CCL_BIB1_TRU, 1);
201 add_attr (p, CCL_BIB1_TRU, 2);
205 static struct ccl_rpn_node *qualifiers (struct ccl_token *la,
206 struct ccl_rpn_attr **qa)
208 struct ccl_token *lookahead = look_token;
209 struct ccl_rpn_attr **ap;
212 struct ccl_rpn_attr *attr;
216 ccl_error = CCL_ERR_DOBBLE_QUAL;
219 for (lookahead = look_token; lookahead != la; lookahead=lookahead->next)
221 ap = malloc (no * sizeof(*ap));
223 for (i=0; look_token != la; i++)
225 ap[i] = ccl_qual_search (bibset, look_token->name, look_token->len);
228 ccl_error = CCL_ERR_UNKNOWN_QUAL;
233 if (KIND == CCL_TOK_COMMA)
237 if (! (attr = qual_val (ap[0], CCL_BIB1_REL)) || attr->value == 3)
239 /* unordered relation */
240 struct ccl_rpn_node *p;
241 if (KIND != CCL_TOK_EQ)
243 ccl_error = CCL_ERR_EQ_EXPECTED;
248 if (KIND == CCL_TOK_LP)
251 if (!(p = find_spec (ap)))
256 if (KIND != CCL_TOK_RP)
258 ccl_error = CCL_ERR_RP_EXPECTED;
266 p = search_terms (ap);
271 if (look_token->len == 1)
273 if (look_token->name[0] == '<')
275 else if (look_token->name[0] == '=')
277 else if (look_token->name[0] == '>')
280 else if (look_token->len == 2)
282 if (!memcmp (look_token->name, "<=", 2))
284 else if (!memcmp (look_token->name, ">=", 2))
286 else if (!memcmp (look_token->name, "<>", 2))
290 ccl_error = CCL_ERR_BAD_RELATION;
293 struct ccl_rpn_node *p;
295 ADVANCE; /* skip relation */
296 if (KIND == CCL_TOK_TERM)
298 struct ccl_rpn_node *p1;
299 p1 = search_term (ap);
300 if (KIND == CCL_TOK_MINUS)
302 ADVANCE; /* skip '-' */
303 if (KIND == CCL_TOK_TERM) /* = term - term ? */
305 struct ccl_rpn_node *p2;
307 p2 = search_term (ap);
310 add_attr (p1, CCL_BIB1_REL, 4);
312 add_attr (p2, CCL_BIB1_REL, 2);
318 add_attr (p1, CCL_BIB1_REL, 4);
325 add_attr (p1, CCL_BIB1_REL, rel);
330 else if (KIND == CCL_TOK_MINUS) /* = - term ? */
333 p = search_term (ap);
334 add_attr (p, CCL_BIB1_REL, 2);
338 ccl_error = CCL_ERR_TERM_EXPECTED;
344 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa)
346 struct ccl_rpn_node *p1, *p2, *pn;
347 p1 = search_term (qa);
352 if (KIND == CCL_TOK_PROX)
355 p2 = search_term (qa);
366 else if (KIND == CCL_TOK_TERM)
368 p2 = search_term (qa);
385 static struct ccl_rpn_node *search_elements (struct ccl_rpn_attr **qa)
387 struct ccl_rpn_node *p1;
388 struct ccl_token *lookahead;
389 if (KIND == CCL_TOK_LP)
395 if (KIND != CCL_TOK_RP)
397 ccl_error = CCL_ERR_RP_EXPECTED;
404 else if (KIND == CCL_TOK_SET)
407 if (KIND == CCL_TOK_EQ)
409 if (KIND != CCL_TOK_TERM)
411 ccl_error = CCL_ERR_SETNAME_EXPECTED;
415 p1->u.setname = copy_token_name (look_token);
419 lookahead = look_token;
421 while (lookahead->kind==CCL_TOK_TERM || lookahead->kind==CCL_TOK_COMMA)
422 lookahead = lookahead->next;
423 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
424 return qualifiers (lookahead, qa);
425 return search_terms (qa);
428 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa)
430 struct ccl_rpn_node *p1, *p2, *pn;
431 if (!(p1 = search_elements (qa)))
439 p2 = search_elements (qa);
452 p2 = search_elements (qa);
465 p2 = search_elements (qa);
482 struct ccl_rpn_node *ccl_find (CCL_bibset abibset, struct ccl_token *list,
483 int *error, const char **pos)
485 struct ccl_rpn_node *p;
489 p = find_spec (NULL);
490 if (p && KIND != CCL_TOK_EOL)
492 if (KIND == CCL_TOK_RP)
493 ccl_error = CCL_ERR_BAD_RP;
495 ccl_error = CCL_ERR_OP_EXPECTED;
499 *pos = look_token->name;
507 struct ccl_rpn_node *ccl_find_str (CCL_bibset bibset, const char *str,
508 int *error, int *pos)
510 struct ccl_token *list, *li;
511 struct ccl_rpn_node *rpn;
512 const char *char_pos;
514 list = ccl_tokenize (str);
516 for (li = list; li; li = li->next)
517 printf ("kind=%d, str='%.*s'\n", li->kind, li->len, li->name);
519 rpn = ccl_find (bibset, list, error, &char_pos);
521 *pos = char_pos - str;