1 /* $Id: cql.y,v 1.17 2008-01-06 16:22:02 adam Exp $
2 Copyright (C) 2002-2006
5 This file is part of the YAZ toolkit.
9 bison parser for CQL grammar.
14 * \brief Implements CQL parser.
16 * This is a YACC parser, but since it must be reentrant, Bison is required.
17 * The original source file is cql.y.
23 #include <yaz/xmalloc.h>
27 /** Node in the LALR parse tree. */
29 /** Inhereted attribute: relation */
31 /** Synthesized attribute: CQL node */
33 /** string buffer with token */
35 /** length of token */
37 /** size of buffer (len <= size) */
42 int (*getbyte)(void *client_data);
43 void (*ungetbyte)(int b, void *client_data);
53 #define YYPARSE_PARAM parm
54 #define YYLEX_PARAM parm
56 int yylex(YYSTYPE *lval, void *vp);
61 %token DOTTERM TERM AND OR NOT PROX GE LE NE EXACT
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);
71 ((CQL_parser) parm)->top = $2.cql;
77 cql_node_destroy($1.cql);
85 '>' searchTerm '=' searchTerm {
88 $$.cql = cql_apply_prefix(((CQL_parser) parm)->nmem,
89 $6.cql, $2.buf, $4.buf);
94 $$.cql = cql_apply_prefix(((CQL_parser) parm)->nmem,
102 scopedClause boolean modifiers {
105 struct cql_node *cn = cql_node_mk_boolean(((CQL_parser) parm)->nmem,
108 cn->u.boolean.modifiers = $3.cql;
109 cn->u.boolean.left = $1.cql;
110 cn->u.boolean.right = $5.cql;
124 searchTerm extraTerms {
125 struct cql_node *st = cql_node_dup(((CQL_parser) parm)->nmem, $0.rel);
126 st->u.st.extra_terms = $2.cql;
127 st->u.st.term = nmem_strdup(((CQL_parser)parm)->nmem, $1.buf);
131 index relation modifiers {
132 $$.rel = cql_node_mk_sc(((CQL_parser) parm)->nmem, $1.buf, $2.buf, 0);
133 $$.rel->u.st.modifiers = $3.cql;
136 cql_node_destroy($4.rel);
142 struct cql_node *st = cql_node_mk_sc(((CQL_parser) parm)->nmem,
143 /* index */ 0, /* rel */ 0, $2.buf);
144 st->u.st.extra_terms = $1.cql;
152 /* unary NOT search TERM here .. */
155 AND | OR | NOT | PROX ;
157 modifiers: modifiers '/' searchTerm
159 struct cql_node *mod = cql_node_mk_sc(((CQL_parser)parm)->nmem,
162 mod->u.st.modifiers = $1.cql;
166 modifiers '/' searchTerm mrelation searchTerm
168 struct cql_node *mod = cql_node_mk_sc(((CQL_parser)parm)->nmem,
169 $3.buf, $4.buf, $5.buf);
171 mod->u.st.modifiers = $1.cql;
221 * putb is a utility that puts one character to the string
222 * in current lexical token. This routine deallocates as
223 * necessary using NMEM.
226 static void putb(YYSTYPE *lval, CQL_parser cp, int c)
228 if (lval->len+1 >= lval->size)
231 nmem_malloc(cp->nmem, (lval->size = lval->len * 2 + 20));
232 memcpy (nb, lval->buf, lval->len);
236 lval->buf[lval->len++] = c;
237 lval->buf[lval->len] = '\0';
242 * yylex returns next token for Bison to be read. In this
243 * case one of the CQL terminals are returned.
245 int yylex(YYSTYPE *lval, void *vp)
247 CQL_parser cp = (CQL_parser) vp;
253 lval->buf = (char *) nmem_malloc(cp->nmem, lval->size);
257 c = cp->getbyte(cp->client_data);
262 } while (isspace(c));
263 if (strchr("()=></", c))
269 c1 = cp->getbyte(cp->client_data);
276 cp->ungetbyte(c1, cp->client_data);
280 c1 = cp->getbyte(cp->client_data);
287 cp->ungetbyte(c1, cp->client_data);
291 c1 = cp->getbyte(cp->client_data);
303 cp->ungetbyte(c1, cp->client_data);
309 while ((c = cp->getbyte(cp->client_data)) != 0 && c != '"')
314 c = cp->getbyte(cp->client_data);
325 int relation_like = 0;
326 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, "all"))
368 if (!cql_strcmp(lval->buf, "any"))
377 int cql_parser_stream(CQL_parser cp,
378 int (*getbyte)(void *client_data),
379 void (*ungetbyte)(int b, void *client_data),
382 nmem_reset(cp->nmem);
383 cp->getbyte = getbyte;
384 cp->ungetbyte = ungetbyte;
385 cp->client_data = client_data;
387 cql_node_destroy(cp->top);
394 CQL_parser cql_parser_create(void)
396 CQL_parser cp = (CQL_parser) xmalloc (sizeof(*cp));
404 cp->nmem = nmem_create();
408 void cql_parser_destroy(CQL_parser cp)
410 cql_node_destroy(cp->top);
411 nmem_destroy(cp->nmem);
415 struct cql_node *cql_parser_result(CQL_parser cp)