1 /* $Id: cql.y,v 1.2 2004-03-10 16:34:29 adam Exp $
2 Copyright (C) 2002-2004
5 This file is part of the YAZ toolkit.
9 bison parser for CQL grammar.
28 int (*getbyte)(void *client_data);
29 void (*ungetbyte)(int b, void *client_data);
39 #define YYPARSE_PARAM parm
40 #define YYLEX_PARAM parm
42 int yylex(YYSTYPE *lval, void *vp);
47 %token TERM AND OR NOT PROX GE LE NE
53 $$.rel = cql_node_mk_sc("cql.serverChoice", "scr", 0);
54 ((CQL_parser) parm)->top = 0;
56 cql_node_destroy($$.rel);
57 ((CQL_parser) parm)->top = $2.cql;
63 cql_node_destroy($1.cql);
71 cqlQuery boolean modifiers {
74 struct cql_node *cn = cql_node_mk_boolean($2.buf);
76 cn->u.boolean.modifiers = $3.cql;
77 cn->u.boolean.left = $1.cql;
78 cn->u.boolean.right = $5.cql;
93 struct cql_node *st = cql_node_dup ($0.rel);
94 st->u.st.term = strdup($1.buf);
98 index relation modifiers {
99 $$.rel = cql_node_mk_sc($1.buf, $2.buf, 0);
100 $$.rel->u.st.modifiers = $3.cql;
103 cql_node_destroy($4.rel);
105 | '>' searchTerm '=' searchTerm {
108 $$.cql = cql_node_prefix($6.cql, $2.buf, $4.buf);
113 $$.cql = cql_node_prefix($4.cql, 0, $2.buf);
117 /* unary NOT search TERM here .. */
120 AND | OR | NOT | PROX
123 modifiers: modifiers '/' searchTerm
125 struct cql_node *mod = cql_node_mk_sc($3.buf, "=", 0);
127 mod->u.st.modifiers = $1.cql;
131 modifiers '/' searchTerm mrelation searchTerm
133 struct cql_node *mod = cql_node_mk_sc($3.buf, $4.buf, $5.buf);
135 mod->u.st.modifiers = $1.cql;
182 * bison lexer for CQL.
185 static void putb(YYSTYPE *lval, CQL_parser cp, int c)
187 if (lval->len+1 >= lval->size)
189 char *nb = nmem_malloc(cp->nmem, (lval->size = lval->len * 2 + 20));
190 memcpy (nb, lval->buf, lval->len);
194 lval->buf[lval->len++] = c;
195 lval->buf[lval->len] = '\0';
199 int yylex(YYSTYPE *lval, void *vp)
201 CQL_parser cp = (CQL_parser) vp;
207 lval->buf = nmem_malloc(cp->nmem, lval->size);
211 c = cp->getbyte(cp->client_data);
216 } while (isspace(c));
217 if (strchr("()=></", c))
223 c1 = cp->getbyte(cp->client_data);
230 cp->ungetbyte(c1, cp->client_data);
234 c1 = cp->getbyte(cp->client_data);
246 cp->ungetbyte(c1, cp->client_data);
252 while ((c = cp->getbyte(cp->client_data)) != EOF && c != '"')
255 c = cp->getbyte(cp->client_data);
263 while ((c = cp->getbyte(cp->client_data)) != 0 &&
264 !strchr(" \n()=<>/", c))
267 c = cp->getbyte(cp->client_data);
271 printf ("got %s\n", lval->buf);
274 cp->ungetbyte(c, cp->client_data);
275 if (!strcmp(lval->buf, "and"))
277 if (!strcmp(lval->buf, "or"))
279 if (!strcmp(lval->buf, "not"))
281 if (!strncmp(lval->buf, "prox", 4))
288 int cql_parser_stream(CQL_parser cp,
289 int (*getbyte)(void *client_data),
290 void (*ungetbyte)(int b, void *client_data),
293 nmem_reset(cp->nmem);
294 cp->getbyte = getbyte;
295 cp->ungetbyte = ungetbyte;
296 cp->client_data = client_data;
298 cql_node_destroy(cp->top);
305 CQL_parser cql_parser_create(void)
307 CQL_parser cp = (CQL_parser) malloc (sizeof(*cp));
315 cp->nmem = nmem_create();
319 void cql_parser_destroy(CQL_parser cp)
321 cql_node_destroy(cp->top);
322 nmem_destroy(cp->nmem);
326 struct cql_node *cql_parser_result(CQL_parser cp)