1 /* This file is part of the YAZ toolkit.
2 * Copyright (C) 1995-2013 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 SIMPLE_STRING 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;
149 struct cql_node *st = cql_node_dup(((CQL_parser) parm)->nmem, $0.rel);
150 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);
164 /* unary NOT search SIMPLE_STRING here .. */
167 AND | OR | NOT | PROX ;
169 modifiers: modifiers '/' searchTerm
171 struct cql_node *mod = cql_node_mk_sc(((CQL_parser)parm)->nmem,
174 mod->u.st.modifiers = $1.cql;
178 modifiers '/' searchTerm relation_symbol searchTerm
180 struct cql_node *mod = cql_node_mk_sc(((CQL_parser)parm)->nmem,
181 $3.buf, $4.buf, $5.buf);
183 mod->u.st.modifiers = $1.cql;
192 relation: SIMPLE_STRING | relation_symbol;
224 * putb is a utility that puts one character to the string
225 * in current lexical token. This routine deallocates as
226 * necessary using NMEM.
229 static void putb(YYSTYPE *lval, CQL_parser cp, int c)
231 if (lval->len+1 >= lval->size)
234 nmem_malloc(cp->nmem, (lval->size = lval->len * 2 + 20));
235 memcpy(nb, lval->buf, lval->len);
239 lval->buf[lval->len++] = c;
240 lval->buf[lval->len] = '\0';
245 * yylex returns next token for Bison to be read. In this
246 * case one of the CQL terminals are returned.
248 int yylex(YYSTYPE *lval, void *vp)
250 CQL_parser cp = (CQL_parser) vp;
256 lval->buf = (char *) nmem_malloc(cp->nmem, lval->size);
260 c = cp->getbyte(cp->client_data);
265 } while (yaz_isspace(c));
266 if (strchr("()=></", c))
272 c1 = cp->getbyte(cp->client_data);
279 cp->ungetbyte(c1, cp->client_data);
283 c1 = cp->getbyte(cp->client_data);
290 cp->ungetbyte(c1, cp->client_data);
294 c1 = cp->getbyte(cp->client_data);
306 cp->ungetbyte(c1, cp->client_data);
312 while ((c = cp->getbyte(cp->client_data)) != 0 && c != '"')
317 c = cp->getbyte(cp->client_data);
324 return SIMPLE_STRING;
328 while (c != 0 && !strchr(" \n()=<>/", c))
333 c = cp->getbyte(cp->client_data);
338 c = cp->getbyte(cp->client_data);
342 printf ("got %s\n", lval->buf);
345 cp->ungetbyte(c, cp->client_data);
346 if (!cql_strcmp(lval->buf, "and"))
351 if (!cql_strcmp(lval->buf, "or"))
356 if (!cql_strcmp(lval->buf, "not"))
361 if (!cql_strcmp(lval->buf, "prox"))
366 if (!cql_strcmp(lval->buf, "sortby"))
368 lval->buf = "sortby";
372 return SIMPLE_STRING;
376 int cql_parser_stream(CQL_parser cp,
377 int (*getbyte)(void *client_data),
378 void (*ungetbyte)(int b, void *client_data),
381 nmem_reset(cp->nmem);
382 cp->getbyte = getbyte;
383 cp->ungetbyte = ungetbyte;
384 cp->client_data = client_data;
385 cql_node_destroy(cp->top);
392 CQL_parser cql_parser_create(void)
394 CQL_parser cp = (CQL_parser) xmalloc(sizeof(*cp));
402 cp->nmem = nmem_create();
406 void cql_parser_destroy(CQL_parser cp)
408 cql_node_destroy(cp->top);
409 nmem_destroy(cp->nmem);
413 struct cql_node *cql_parser_result(CQL_parser cp)
421 * c-file-style: "Stroustrup"
422 * indent-tabs-mode: nil
424 * vim: shiftwidth=4 tabstop=8 expandtab