1 /* This file is part of the YAZ toolkit.
2 * Copyright (C) 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);
52 int yylex(YYSTYPE *lval, void *vp);
53 int yyerror(void *lval, char *msg);
58 %lex-param {void *parm}
59 %parse-param {void *parm}
61 %token PREFIX_NAME SIMPLE_STRING AND OR NOT PROX GE LE NE EXACT SORTBY
66 $$.rel = cql_node_mk_sc(((CQL_parser) parm)->nmem,
67 "cql.serverChoice", "=", 0);
68 ((CQL_parser) parm)->top = 0;
70 cql_node_destroy($$.rel);
73 $3.cql->u.sort.search = $2.cql;
74 ((CQL_parser) parm)->top = $3.cql;
76 ((CQL_parser) parm)->top = $2.cql;
87 sortSpec: sortSpec singleSpec {
89 $$.cql->u.sort.next = $2.cql;
96 singleSpec: index modifiers {
97 $$.cql = cql_node_mk_sort(((CQL_parser) parm)->nmem, $1.buf, $2.cql);
103 cql_node_destroy($1.cql);
111 '>' searchTerm '=' searchTerm {
114 $$.cql = cql_apply_prefix(((CQL_parser) parm)->nmem,
115 $6.cql, $2.buf, $4.buf);
120 $$.cql = cql_apply_prefix(((CQL_parser) parm)->nmem,
128 scopedClause boolean modifiers {
131 struct cql_node *cn = cql_node_mk_boolean(((CQL_parser) parm)->nmem,
134 cn->u.boolean.modifiers = $3.cql;
135 cn->u.boolean.left = $1.cql;
136 cn->u.boolean.right = $5.cql;
150 searchTerm extraTerms {
151 struct cql_node *st = cql_node_dup(((CQL_parser) parm)->nmem, $0.rel);
152 st->u.st.extra_terms = $2.cql;
153 st->u.st.term = nmem_strdup(((CQL_parser)parm)->nmem, $1.buf);
157 index relation modifiers {
158 $$.rel = cql_node_mk_sc(((CQL_parser) parm)->nmem, $1.buf, $2.buf, 0);
159 $$.rel->u.st.modifiers = $3.cql;
162 cql_node_destroy($4.rel);
167 SIMPLE_STRING extraTerms {
168 struct cql_node *st = cql_node_mk_sc(((CQL_parser) parm)->nmem,
169 /* index */ 0, /* rel */ 0, $1.buf);
170 st->u.st.extra_terms = $2.cql;
178 /* unary NOT search SIMPLE_STRING here .. */
181 AND | OR | NOT | PROX ;
183 modifiers: modifiers '/' searchTerm
185 struct cql_node *mod = cql_node_mk_sc(((CQL_parser)parm)->nmem,
188 mod->u.st.modifiers = $1.cql;
192 modifiers '/' searchTerm relation_symbol searchTerm
194 struct cql_node *mod = cql_node_mk_sc(((CQL_parser)parm)->nmem,
195 $3.buf, $4.buf, $5.buf);
197 mod->u.st.modifiers = $1.cql;
206 relation: PREFIX_NAME | relation_symbol;
233 int yyerror(void *locp, char *s)
239 * putb is a utility that puts one character to the string
240 * in current lexical token. This routine deallocates as
241 * necessary using NMEM.
244 static void putb(YYSTYPE *lval, CQL_parser cp, int c)
246 if (lval->len+1 >= lval->size)
249 nmem_malloc(cp->nmem, (lval->size = lval->len * 2 + 20));
250 memcpy(nb, lval->buf, lval->len);
254 lval->buf[lval->len++] = c;
255 lval->buf[lval->len] = '\0';
260 * yylex returns next token for Bison to be read. In this
261 * case one of the CQL terminals are returned.
263 int yylex(YYSTYPE *lval, void *vp)
265 CQL_parser cp = (CQL_parser) vp;
271 lval->buf = (char *) nmem_malloc(cp->nmem, lval->size);
275 c = cp->getbyte(cp->client_data);
280 } while (yaz_isspace(c));
281 if (strchr("()=></", c))
287 c1 = cp->getbyte(cp->client_data);
294 cp->ungetbyte(c1, cp->client_data);
298 c1 = cp->getbyte(cp->client_data);
305 cp->ungetbyte(c1, cp->client_data);
309 c1 = cp->getbyte(cp->client_data);
321 cp->ungetbyte(c1, cp->client_data);
327 while ((c = cp->getbyte(cp->client_data)) != 0 && c != '"')
332 c = cp->getbyte(cp->client_data);
339 return SIMPLE_STRING;
343 int relation_like = 0;
344 while (c != 0 && !strchr(" \n()=<>/", c))
351 c = cp->getbyte(cp->client_data);
356 c = cp->getbyte(cp->client_data);
360 printf ("got %s\n", lval->buf);
363 cp->ungetbyte(c, cp->client_data);
364 if (!cql_strcmp(lval->buf, "and"))
369 if (!cql_strcmp(lval->buf, "or"))
374 if (!cql_strcmp(lval->buf, "not"))
379 if (!cql_strcmp(lval->buf, "prox"))
384 if (!cql_strcmp(lval->buf, "sortby"))
386 lval->buf = "sortby";
391 if (!cql_strcmp(lval->buf, "all"))
393 if (!cql_strcmp(lval->buf, "any"))
395 if (!cql_strcmp(lval->buf, "adj"))
400 return SIMPLE_STRING;
404 int cql_parser_stream(CQL_parser cp,
405 int (*getbyte)(void *client_data),
406 void (*ungetbyte)(int b, void *client_data),
409 nmem_reset(cp->nmem);
410 cp->getbyte = getbyte;
411 cp->ungetbyte = ungetbyte;
412 cp->client_data = client_data;
413 cql_node_destroy(cp->top);
420 CQL_parser cql_parser_create(void)
422 CQL_parser cp = (CQL_parser) xmalloc(sizeof(*cp));
430 cp->nmem = nmem_create();
435 void cql_parser_destroy(CQL_parser cp)
437 cql_node_destroy(cp->top);
438 nmem_destroy(cp->nmem);
442 struct cql_node *cql_parser_result(CQL_parser cp)
447 void cql_parser_strict(CQL_parser cp, int mode)
455 * c-file-style: "Stroustrup"
456 * indent-tabs-mode: nil
458 * vim: shiftwidth=4 tabstop=8 expandtab