1 /* CCL find (to rpn conversion)
5 * Revision 1.4 1995/02/14 13:16:29 adam
6 * Left and/or right truncation implemented.
8 * Revision 1.3 1995/02/14 10:25:56 adam
9 * The constructions 'qualifier rel term ...' implemented.
11 * Revision 1.2 1995/02/13 15:15:07 adam
12 * Added handling of qualifiers. Not finished yet.
14 * Revision 1.1 1995/02/13 12:35:20 adam
15 * First version of CCL. Qualifiers aren't handled yet.
26 static struct ccl_token *look_token;
28 static CCL_bibset bibset;
30 #define KIND (look_token->kind)
31 #define ADVANCE look_token = look_token->next
32 #define ADVX(x) x=(x)->next
34 static struct ccl_rpn_attr *qual_val (struct ccl_rpn_attr *list, int type)
38 if (list->type == type)
45 static void strxcat (char *n, const char *src, int len)
54 static char *copy_token_name (struct ccl_token *tp)
56 char *str = malloc (tp->len + 1);
58 memcpy (str, tp->name, tp->len);
63 static struct ccl_rpn_node *mk_node (enum rpn_node_kind kind)
65 struct ccl_rpn_node *p;
66 p = malloc (sizeof(*p));
72 void ccl_rpn_delete (struct ccl_rpn_node *rpn)
74 struct ccl_rpn_attr *attr, *attr1;
82 ccl_rpn_delete (rpn->u.p[0]);
83 ccl_rpn_delete (rpn->u.p[1]);
87 for (attr = rpn->u.t.attr_list; attr; attr = attr1)
94 free (rpn->u.setname);
97 ccl_rpn_delete (rpn->u.p[0]);
98 ccl_rpn_delete (rpn->u.p[1]);
104 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa);
105 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa);
107 static void add_attr (struct ccl_rpn_node *p, int type, int value)
109 struct ccl_rpn_attr *n;
111 n = malloc (sizeof(*n));
115 n->next = p->u.t.attr_list;
116 p->u.t.attr_list = n;
119 static struct ccl_rpn_node *search_term (struct ccl_rpn_attr **qa)
121 struct ccl_rpn_node *p;
122 struct ccl_token *lookahead = look_token;
129 if (KIND != CCL_TOK_TERM)
131 ccl_error = CCL_ERR_TERM_EXPECTED;
134 for (no = 0; lookahead->kind == CCL_TOK_TERM; no++)
136 for (i = 0; i<lookahead->len; i++)
137 if (lookahead->name[i] == '?')
139 if (no == 0 && i == 0 && lookahead->len >= 1)
141 else if (lookahead->next->kind != CCL_TOK_TERM &&
142 i == lookahead->len-1 && i >= 1)
147 len += 1+lookahead->len;
148 lookahead = lookahead->next;
151 p->u.t.term = malloc (len);
152 assert (p->u.t.term);
153 p->u.t.attr_list = NULL;
154 p->u.t.term[0] = '\0';
155 for (i = 0; i<no; i++)
157 const char *src_str = look_token->name;
158 int src_len = look_token->len;
160 if (i == 0 && left_trunc)
165 else if (i == no-1 && right_trunc)
168 strcat (p->u.t.term, " ");
169 strxcat (p->u.t.term, src_str, src_len);
175 struct ccl_rpn_attr *attr;
176 for (i=0; qa[i]; i++)
178 struct ccl_rpn_attr *attr;
180 for (attr = qa[i]; attr; attr = attr->next)
182 add_attr (p, attr->type, attr->value);
184 if ((attr = qual_val (qa[0], CCL_BIB1_STR)) &&
185 attr->value == CCL_BIB1_STR_WP)
188 add_attr (p, CCL_BIB1_STR, 2);
190 add_attr (p, CCL_BIB1_STR, 1);
193 if (left_trunc && right_trunc)
194 add_attr (p, CCL_BIB1_TRU, 3);
195 else if (right_trunc)
196 add_attr (p, CCL_BIB1_TRU, 1);
198 add_attr (p, CCL_BIB1_TRU, 2);
202 static struct ccl_rpn_node *qualifiers (struct ccl_token *la,
203 struct ccl_rpn_attr **qa)
205 struct ccl_token *lookahead = look_token;
206 struct ccl_rpn_attr **ap;
209 struct ccl_rpn_attr *attr;
213 ccl_error = CCL_ERR_DOBBLE_QUAL;
216 for (lookahead = look_token; lookahead != la; lookahead=lookahead->next)
218 ap = malloc (no * sizeof(*ap));
220 for (i=0; look_token != la; i++)
222 ap[i] = ccl_qual_search (bibset, look_token->name, look_token->len);
225 ccl_error = CCL_ERR_UNKNOWN_QUAL;
230 if (KIND == CCL_TOK_COMMA)
234 if (! (attr = qual_val (ap[0], CCL_BIB1_REL)) || attr->value == 3)
236 /* unordered relation */
237 struct ccl_rpn_node *p;
238 if (KIND != CCL_TOK_EQ)
240 ccl_error = CCL_ERR_EQ_EXPECTED;
245 if (KIND == CCL_TOK_LP)
248 if (!(p = find_spec (ap)))
253 if (KIND != CCL_TOK_RP)
255 ccl_error = CCL_ERR_RP_EXPECTED;
263 p = search_terms (ap);
268 if (look_token->len == 1)
270 if (look_token->name[0] == '<')
272 else if (look_token->name[0] == '=')
274 else if (look_token->name[0] == '>')
277 else if (look_token->len == 2)
279 if (!memcmp (look_token->name, "<=", 2))
281 else if (!memcmp (look_token->name, ">=", 2))
283 else if (!memcmp (look_token->name, "<>", 2))
287 ccl_error = CCL_ERR_BAD_RELATION;
290 struct ccl_rpn_node *p;
293 p = search_term (ap);
294 add_attr (p, CCL_BIB1_REL, rel);
302 static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa)
304 struct ccl_rpn_node *p1, *p2, *pn;
305 p1 = search_term (qa);
310 if (KIND == CCL_TOK_PROX)
313 p2 = search_term (qa);
324 else if (KIND == CCL_TOK_TERM)
326 p2 = search_term (qa);
343 static struct ccl_rpn_node *search_elements (struct ccl_rpn_attr **qa)
345 struct ccl_rpn_node *p1;
346 struct ccl_token *lookahead;
347 if (KIND == CCL_TOK_LP)
353 if (KIND != CCL_TOK_RP)
355 ccl_error = CCL_ERR_RP_EXPECTED;
362 else if (KIND == CCL_TOK_SET)
365 if (KIND == CCL_TOK_EQ)
367 if (KIND != CCL_TOK_TERM)
369 ccl_error = CCL_ERR_SETNAME_EXPECTED;
373 p1->u.setname = copy_token_name (look_token);
377 lookahead = look_token;
379 while (lookahead->kind==CCL_TOK_TERM || lookahead->kind==CCL_TOK_COMMA)
380 lookahead = lookahead->next;
381 if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
382 return qualifiers (lookahead, qa);
383 return search_terms (qa);
386 static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa)
388 struct ccl_rpn_node *p1, *p2, *pn;
389 if (!(p1 = search_elements (qa)))
397 p2 = search_elements (qa);
410 p2 = search_elements (qa);
423 p2 = search_elements (qa);
440 struct ccl_rpn_node *ccl_find (CCL_bibset abibset, struct ccl_token *list,
441 int *error, const char **pos)
443 struct ccl_rpn_node *p;
447 p = find_spec (NULL);
448 if (p && KIND != CCL_TOK_EOL)
450 if (KIND == CCL_TOK_RP)
451 ccl_error = CCL_ERR_BAD_RP;
453 ccl_error = CCL_ERR_OP_EXPECTED;
457 *pos = look_token->name;
465 struct ccl_rpn_node *ccl_find_str (CCL_bibset bibset, const char *str,
466 int *error, int *pos)
468 struct ccl_token *list, *li;
469 struct ccl_rpn_node *rpn;
470 const char *char_pos;
472 list = ccl_tokenize (str);
474 for (li = list; li; li = li->next)
475 printf ("kind=%d, str='%.*s'\n", li->kind, li->len, li->name);
477 rpn = ccl_find (bibset, list, error, &char_pos);
479 *pos = char_pos - str;