* Europagate, 1995
*
* $Log: cclfind.c,v $
- * Revision 1.1 1995/02/13 12:35:20 adam
+ * Revision 1.4 1995/02/14 13:16:29 adam
+ * Left and/or right truncation implemented.
+ *
+ * Revision 1.3 1995/02/14 10:25:56 adam
+ * The constructions 'qualifier rel term ...' implemented.
+ *
+ * Revision 1.2 1995/02/13 15:15:07 adam
+ * Added handling of qualifiers. Not finished yet.
+ *
+ * Revision 1.1 1995/02/13 12:35:20 adam
* First version of CCL. Qualifiers aren't handled yet.
*
*/
static struct ccl_token *look_token;
static int ccl_error;
+static CCL_bibset bibset;
#define KIND (look_token->kind)
#define ADVANCE look_token = look_token->next
#define ADVX(x) x=(x)->next
+static struct ccl_rpn_attr *qual_val (struct ccl_rpn_attr *list, int type)
+{
+ while (list)
+ {
+ if (list->type == type)
+ return list;
+ list = list->next;
+ }
+ return NULL;
+}
+
static void strxcat (char *n, const char *src, int len)
{
while (*n)
static char *copy_token_name (struct ccl_token *tp)
{
char *str = malloc (tp->len + 1);
+ assert (str);
memcpy (str, tp->name, tp->len);
str[tp->len] = '\0';
return str;
void ccl_rpn_delete (struct ccl_rpn_node *rpn)
{
+ struct ccl_rpn_attr *attr, *attr1;
if (!rpn)
return;
switch (rpn->kind)
break;
case TERM:
free (rpn->u.t.term);
- /* attr list */
+ for (attr = rpn->u.t.attr_list; attr; attr = attr1)
+ {
+ attr1 = attr->next;
+ free (attr);
+ }
break;
case SET:
free (rpn->u.setname);
free (rpn);
}
-static struct ccl_rpn_node *find_spec (void);
+static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa);
+static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa);
-static struct ccl_rpn_node *search_term (void)
+static void add_attr (struct ccl_rpn_node *p, int type, int value)
+{
+ struct ccl_rpn_attr *n;
+
+ n = malloc (sizeof(*n));
+ assert (n);
+ n->type = type;
+ n->value = value;
+ n->next = p->u.t.attr_list;
+ p->u.t.attr_list = n;
+}
+
+static struct ccl_rpn_node *search_term (struct ccl_rpn_attr **qa)
{
struct ccl_rpn_node *p;
struct ccl_token *lookahead = look_token;
int len = 0;
+ int no, i;
+ int left_trunc = 0;
+ int right_trunc = 0;
+ int mid_trunc = 0;
if (KIND != CCL_TOK_TERM)
{
ccl_error = CCL_ERR_TERM_EXPECTED;
return NULL;
}
- while (lookahead->kind == CCL_TOK_TERM)
+ for (no = 0; lookahead->kind == CCL_TOK_TERM; no++)
{
- len += 1+lookahead->len;
+ for (i = 0; i<lookahead->len; i++)
+ if (lookahead->name[i] == '?')
+ {
+ if (no == 0 && i == 0 && lookahead->len >= 1)
+ left_trunc = 1;
+ else if (lookahead->next->kind != CCL_TOK_TERM &&
+ i == lookahead->len-1 && i >= 1)
+ right_trunc = 1;
+ else
+ mid_trunc = 1;
+ }
+ len += 1+lookahead->len;
lookahead = lookahead->next;
}
p = mk_node (TERM);
p->u.t.term = malloc (len);
+ assert (p->u.t.term);
p->u.t.attr_list = NULL;
p->u.t.term[0] = '\0';
- assert (p->u.t.term);
- strxcat (p->u.t.term, look_token->name, look_token->len);
- ADVANCE;
- while (KIND == CCL_TOK_TERM)
+ for (i = 0; i<no; i++)
{
- strcat (p->u.t.term, " ");
- strxcat (p->u.t.term, look_token->name, look_token->len);
+ const char *src_str = look_token->name;
+ int src_len = look_token->len;
+
+ if (i == 0 && left_trunc)
+ {
+ src_len--;
+ src_str++;
+ }
+ else if (i == no-1 && right_trunc)
+ src_len--;
+ if (i)
+ strcat (p->u.t.term, " ");
+ strxcat (p->u.t.term, src_str, src_len);
ADVANCE;
}
+ if (qa)
+ {
+ int i;
+ struct ccl_rpn_attr *attr;
+ for (i=0; qa[i]; i++)
+ {
+ struct ccl_rpn_attr *attr;
+
+ for (attr = qa[i]; attr; attr = attr->next)
+ if (attr->value > 0)
+ add_attr (p, attr->type, attr->value);
+ }
+ if ((attr = qual_val (qa[0], CCL_BIB1_STR)) &&
+ attr->value == CCL_BIB1_STR_WP)
+ {
+ if (no == 1)
+ add_attr (p, CCL_BIB1_STR, 2);
+ else
+ add_attr (p, CCL_BIB1_STR, 1);
+ }
+ }
+ if (left_trunc && right_trunc)
+ add_attr (p, CCL_BIB1_TRU, 3);
+ else if (right_trunc)
+ add_attr (p, CCL_BIB1_TRU, 1);
+ else if (left_trunc)
+ add_attr (p, CCL_BIB1_TRU, 2);
return p;
}
-static struct ccl_rpn_node *qualifiers (struct ccl_token *la)
+static struct ccl_rpn_node *qualifiers (struct ccl_token *la,
+ struct ccl_rpn_attr **qa)
{
- assert (0);
+ struct ccl_token *lookahead = look_token;
+ struct ccl_rpn_attr **ap;
+ int no = 1;
+ int i, rel;
+ struct ccl_rpn_attr *attr;
+
+ if (qa)
+ {
+ ccl_error = CCL_ERR_DOBBLE_QUAL;
+ return NULL;
+ }
+ for (lookahead = look_token; lookahead != la; lookahead=lookahead->next)
+ no++;
+ ap = malloc (no * sizeof(*ap));
+ assert (ap);
+ for (i=0; look_token != la; i++)
+ {
+ ap[i] = ccl_qual_search (bibset, look_token->name, look_token->len);
+ if (!ap[i])
+ {
+ ccl_error = CCL_ERR_UNKNOWN_QUAL;
+ free (ap);
+ return NULL;
+ }
+ ADVANCE;
+ if (KIND == CCL_TOK_COMMA)
+ ADVANCE;
+ }
+ ap[i] = NULL;
+ if (! (attr = qual_val (ap[0], CCL_BIB1_REL)) || attr->value == 3)
+ {
+ /* unordered relation */
+ struct ccl_rpn_node *p;
+ if (KIND != CCL_TOK_EQ)
+ {
+ ccl_error = CCL_ERR_EQ_EXPECTED;
+ free (ap);
+ return NULL;
+ }
+ ADVANCE;
+ if (KIND == CCL_TOK_LP)
+ {
+ ADVANCE;
+ if (!(p = find_spec (ap)))
+ {
+ free (ap);
+ return NULL;
+ }
+ if (KIND != CCL_TOK_RP)
+ {
+ ccl_error = CCL_ERR_RP_EXPECTED;
+ ccl_rpn_delete (p);
+ free (ap);
+ return NULL;
+ }
+ ADVANCE;
+ }
+ else
+ p = search_terms (ap);
+ free (ap);
+ return p;
+ }
+ rel = 0;
+ if (look_token->len == 1)
+ {
+ if (look_token->name[0] == '<')
+ rel = 1;
+ else if (look_token->name[0] == '=')
+ rel = 3;
+ else if (look_token->name[0] == '>')
+ rel = 5;
+ }
+ else if (look_token->len == 2)
+ {
+ if (!memcmp (look_token->name, "<=", 2))
+ rel = 2;
+ else if (!memcmp (look_token->name, ">=", 2))
+ rel = 4;
+ else if (!memcmp (look_token->name, "<>", 2))
+ rel = 6;
+ }
+ if (!rel)
+ ccl_error = CCL_ERR_BAD_RELATION;
+ else
+ {
+ struct ccl_rpn_node *p;
+
+ ADVANCE;
+ p = search_term (ap);
+ add_attr (p, CCL_BIB1_REL, rel);
+ free (ap);
+ return p;
+ }
+ free (ap);
return NULL;
}
-static struct ccl_rpn_node *search_terms (void)
+static struct ccl_rpn_node *search_terms (struct ccl_rpn_attr **qa)
{
struct ccl_rpn_node *p1, *p2, *pn;
- p1 = search_term ();
+ p1 = search_term (qa);
if (!p1)
return NULL;
while (1)
if (KIND == CCL_TOK_PROX)
{
ADVANCE;
- p2 = search_term ();
+ p2 = search_term (qa);
if (!p2)
{
ccl_rpn_delete (p1);
}
else if (KIND == CCL_TOK_TERM)
{
- p2 = search_term ();
+ p2 = search_term (qa);
if (!p2)
{
ccl_rpn_delete (p1);
return p1;
}
-static struct ccl_rpn_node *search_elements (void)
+static struct ccl_rpn_node *search_elements (struct ccl_rpn_attr **qa)
{
struct ccl_rpn_node *p1;
struct ccl_token *lookahead;
if (KIND == CCL_TOK_LP)
{
ADVANCE;
- p1 = find_spec ();
+ p1 = find_spec (qa);
if (!p1)
return NULL;
if (KIND != CCL_TOK_RP)
else if (KIND == CCL_TOK_SET)
{
ADVANCE;
+ if (KIND == CCL_TOK_EQ)
+ ADVANCE;
if (KIND != CCL_TOK_TERM)
{
ccl_error = CCL_ERR_SETNAME_EXPECTED;
while (lookahead->kind==CCL_TOK_TERM || lookahead->kind==CCL_TOK_COMMA)
lookahead = lookahead->next;
if (lookahead->kind == CCL_TOK_REL || lookahead->kind == CCL_TOK_EQ)
- return qualifiers (lookahead);
- return search_terms ();
+ return qualifiers (lookahead, qa);
+ return search_terms (qa);
}
-static struct ccl_rpn_node *find_spec (void)
+static struct ccl_rpn_node *find_spec (struct ccl_rpn_attr **qa)
{
struct ccl_rpn_node *p1, *p2, *pn;
- if (!(p1 = search_elements ()))
+ if (!(p1 = search_elements (qa)))
return NULL;
while (1)
{
{
case CCL_TOK_AND:
ADVANCE;
- p2 = search_elements ();
+ p2 = search_elements (qa);
if (!p2)
{
ccl_rpn_delete (p1);
continue;
case CCL_TOK_OR:
ADVANCE;
- p2 = search_elements ();
+ p2 = search_elements (qa);
if (!p2)
{
ccl_rpn_delete (p1);
continue;
case CCL_TOK_NOT:
ADVANCE;
- p2 = search_elements ();
+ p2 = search_elements (qa);
if (!p2)
{
ccl_rpn_delete (p1);
return p1;
}
-struct ccl_rpn_node *ccl_find (struct ccl_token *list,
+struct ccl_rpn_node *ccl_find (CCL_bibset abibset, struct ccl_token *list,
int *error, const char **pos)
{
struct ccl_rpn_node *p;
look_token = list;
- p = find_spec ();
+ bibset = abibset;
+ p = find_spec (NULL);
if (p && KIND != CCL_TOK_EOL)
{
if (KIND == CCL_TOK_RP)
return p;
}
-static void pr_tree (struct ccl_rpn_node *rpn)
-{
- switch (rpn->kind)
- {
- case TERM:
- printf ("\"%s\"", rpn->u.t.term);
- break;
- case AND:
- printf ("(");
- pr_tree (rpn->u.p[0]);
- printf (") and (");
- pr_tree (rpn->u.p[1]);
- printf (")");
- break;
- case OR:
- printf ("(");
- pr_tree (rpn->u.p[0]);
- printf (") or (");
- pr_tree (rpn->u.p[1]);
- printf (")");
- break;
- case NOT:
- printf ("(");
- pr_tree (rpn->u.p[0]);
- printf (") not (");
- pr_tree (rpn->u.p[1]);
- printf (")");
- break;
- case SET:
- printf ("set=%s", rpn->u.setname);
- break;
- case PROX:
- printf ("(");
- pr_tree (rpn->u.p[0]);
- printf (") prox (");
- pr_tree (rpn->u.p[1]);
- printf (")");
- break;
- default:
- assert (0);
- }
-}
-
-void ccl_find_str (const char *str, int *error, int *pos)
+struct ccl_rpn_node *ccl_find_str (CCL_bibset bibset, const char *str,
+ int *error, int *pos)
{
struct ccl_token *list, *li;
struct ccl_rpn_node *rpn;
for (li = list; li; li = li->next)
printf ("kind=%d, str='%.*s'\n", li->kind, li->len, li->name);
#endif
- rpn = ccl_find (list, error, &char_pos);
- if (! *error)
- {
- pr_tree (rpn);
- printf ("\n");
- }
- else
- {
+ rpn = ccl_find (bibset, list, error, &char_pos);
+ if (*error)
*pos = char_pos - str;
- }
+ return rpn;
}
projects / egate.git / blobdiff