1 /* This file is part of the YAZ toolkit.
2 * Copyright (C) 1995-2011 Index Data
3 * See the file LICENSE for details.
5 /* bison parser for CQL grammar. */
9 * \brief Implements CQL parser.
11 * This is a YACC parser, but since it must be reentrant, Bison is required.
12 * The original source file is cql.y.
20 #include <yaz/yaz-iconv.h>
21 #include <yaz/xmalloc.h>
25 /** Node in the LALR parse tree. */
27 /** Inhereted attribute: relation */
29 /** Synthesized attribute: CQL node */
31 /** string buffer with token */
33 /** length of token */
35 /** size of buffer (len <= size) */
40 int (*getbyte)(void *client_data);
41 void (*ungetbyte)(int b, void *client_data);
51 #define YYPARSE_PARAM parm
52 #define YYLEX_PARAM parm
54 int yylex(YYSTYPE *lval, void *vp);
59 %token DOTTERM TERM AND OR NOT PROX GE LE NE EXACT SORTBY
64 $$.rel = cql_node_mk_sc(((CQL_parser) parm)->nmem,
65 "cql.serverChoice", "=", 0);
66 ((CQL_parser) parm)->top = 0;
68 cql_node_destroy($$.rel);
71 $3.cql->u.sort.search = $2.cql;
72 ((CQL_parser) parm)->top = $3.cql;
74 ((CQL_parser) parm)->top = $2.cql;
85 sortSpec: sortSpec singleSpec {
87 $$.cql->u.sort.next = $2.cql;
94 singleSpec: index modifiers {
95 $$.cql = cql_node_mk_sort(((CQL_parser) parm)->nmem, $1.buf, $2.cql);
101 cql_node_destroy($1.cql);
109 '>' searchTerm '=' searchTerm {
112 $$.cql = cql_apply_prefix(((CQL_parser) parm)->nmem,
113 $6.cql, $2.buf, $4.buf);
118 $$.cql = cql_apply_prefix(((CQL_parser) parm)->nmem,
126 scopedClause boolean modifiers {
129 struct cql_node *cn = cql_node_mk_boolean(((CQL_parser) parm)->nmem,
132 cn->u.boolean.modifiers = $3.cql;
133 cn->u.boolean.left = $1.cql;
134 cn->u.boolean.right = $5.cql;
148 searchTerm extraTerms {
149 struct cql_node *st = cql_node_dup(((CQL_parser) parm)->nmem, $0.rel);
150 st->u.st.extra_terms = $2.cql;
151 st->u.st.term = nmem_strdup(((CQL_parser)parm)->nmem, $1.buf);
155 index relation modifiers {
156 $$.rel = cql_node_mk_sc(((CQL_parser) parm)->nmem, $1.buf, $2.buf, 0);
157 $$.rel->u.st.modifiers = $3.cql;
160 cql_node_destroy($4.rel);
166 struct cql_node *st = cql_node_mk_sc(((CQL_parser) parm)->nmem,
167 /* index */ 0, /* rel */ 0, $2.buf);
168 st->u.st.extra_terms = $1.cql;
176 /* unary NOT search TERM here .. */
179 AND | OR | NOT | PROX ;
181 modifiers: modifiers '/' searchTerm
183 struct cql_node *mod = cql_node_mk_sc(((CQL_parser)parm)->nmem,
186 mod->u.st.modifiers = $1.cql;
190 modifiers '/' searchTerm mrelation searchTerm
192 struct cql_node *mod = cql_node_mk_sc(((CQL_parser)parm)->nmem,
193 $3.buf, $4.buf, $5.buf);
195 mod->u.st.modifiers = $1.cql;
246 * putb is a utility that puts one character to the string
247 * in current lexical token. This routine deallocates as
248 * necessary using NMEM.
251 static void putb(YYSTYPE *lval, CQL_parser cp, int c)
253 if (lval->len+1 >= lval->size)
256 nmem_malloc(cp->nmem, (lval->size = lval->len * 2 + 20));
257 memcpy (nb, lval->buf, lval->len);
261 lval->buf[lval->len++] = c;
262 lval->buf[lval->len] = '\0';
267 * yylex returns next token for Bison to be read. In this
268 * case one of the CQL terminals are returned.
270 int yylex(YYSTYPE *lval, void *vp)
272 CQL_parser cp = (CQL_parser) vp;
278 lval->buf = (char *) nmem_malloc(cp->nmem, lval->size);
282 c = cp->getbyte(cp->client_data);
287 } while (yaz_isspace(c));
288 if (strchr("()=></", c))
294 c1 = cp->getbyte(cp->client_data);
301 cp->ungetbyte(c1, cp->client_data);
305 c1 = cp->getbyte(cp->client_data);
312 cp->ungetbyte(c1, cp->client_data);
316 c1 = cp->getbyte(cp->client_data);
328 cp->ungetbyte(c1, cp->client_data);
334 while ((c = cp->getbyte(cp->client_data)) != 0 && c != '"')
339 c = cp->getbyte(cp->client_data);
350 int relation_like = 0;
351 while (c != 0 && !strchr(" \n()=<>/", c))
358 c = cp->getbyte(cp->client_data);
363 c = cp->getbyte(cp->client_data);
367 printf ("got %s\n", lval->buf);
370 cp->ungetbyte(c, cp->client_data);
371 if (!cql_strcmp(lval->buf, "and"))
376 if (!cql_strcmp(lval->buf, "or"))
381 if (!cql_strcmp(lval->buf, "not"))
386 if (!cql_strcmp(lval->buf, "prox"))
391 if (!cql_strcmp(lval->buf, "sortby"))
393 lval->buf = "sortby";
396 if (!cql_strcmp(lval->buf, "all"))
398 if (!cql_strcmp(lval->buf, "any"))
407 int cql_parser_stream(CQL_parser cp,
408 int (*getbyte)(void *client_data),
409 void (*ungetbyte)(int b, void *client_data),
412 nmem_reset(cp->nmem);
413 cp->getbyte = getbyte;
414 cp->ungetbyte = ungetbyte;
415 cp->client_data = client_data;
416 cql_node_destroy(cp->top);
423 CQL_parser cql_parser_create(void)
425 CQL_parser cp = (CQL_parser) xmalloc (sizeof(*cp));
433 cp->nmem = nmem_create();
437 void cql_parser_destroy(CQL_parser cp)
439 cql_node_destroy(cp->top);
440 nmem_destroy(cp->nmem);
444 struct cql_node *cql_parser_result(CQL_parser cp)
452 * c-file-style: "Stroustrup"
453 * indent-tabs-mode: nil
455 * vim: shiftwidth=4 tabstop=8 expandtab