-/* $Id: cql.y,v 1.3 2004-03-15 21:39:06 adam Exp $
+/* $Id: cql.y,v 1.9 2005-06-27 22:03:59 adam Exp $
Copyright (C) 2002-2004
Index Data Aps
bison parser for CQL grammar.
*/
%{
+/**
+ * \file cql.c
+ * \brief Implements CQL parser.
+ *
+ * This is a YACC parser, but since it must be reentrant, Bison is required.
+ * The original source file is cql.y.
+ */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <yaz/xmalloc.h>
#include <yaz/nmem.h>
#include <yaz/cql.h>
-
+
+ /** Node in the LALR parse tree. */
typedef struct {
+ /** Inhereted attribute: relation */
struct cql_node *rel;
+ /** Synthesized attribute: CQL node */
struct cql_node *cql;
+ /** string buffer with token */
char *buf;
+ /** length of token */
size_t len;
+ /** size of buffer (len <= size) */
size_t size;
} token;
%%
top: {
- $$.rel = cql_node_mk_sc("cql.serverChoice", "scr", 0);
+ $$.rel = cql_node_mk_sc(((CQL_parser) parm)->nmem,
+ "cql.serverChoice", "scr", 0);
((CQL_parser) parm)->top = 0;
} cqlQuery1 {
cql_node_destroy($$.rel);
cqlQuery boolean modifiers {
$$.rel = $0.rel;
} searchClause {
- struct cql_node *cn = cql_node_mk_boolean($2.buf);
+ struct cql_node *cn = cql_node_mk_boolean(((CQL_parser) parm)->nmem,
+ $2.buf);
cn->u.boolean.modifiers = $3.cql;
cn->u.boolean.left = $1.cql;
}
|
searchTerm {
- struct cql_node *st = cql_node_dup ($0.rel);
- st->u.st.term = xstrdup($1.buf);
+ struct cql_node *st = cql_node_dup (((CQL_parser) parm)->nmem, $0.rel);
+ st->u.st.term = nmem_strdup(((CQL_parser)parm)->nmem, $1.buf);
$$.cql = st;
}
|
index relation modifiers {
- $$.rel = cql_node_mk_sc($1.buf, $2.buf, 0);
+ $$.rel = cql_node_mk_sc(((CQL_parser) parm)->nmem, $1.buf, $2.buf, 0);
$$.rel->u.st.modifiers = $3.cql;
} searchClause {
$$.cql = $5.cql;
| '>' searchTerm '=' searchTerm {
$$.rel = $0.rel;
} cqlQuery {
- $$.cql = cql_apply_prefix($6.cql, $2.buf, $4.buf);
+ $$.cql = cql_apply_prefix(((CQL_parser) parm)->nmem,
+ $6.cql, $2.buf, $4.buf);
}
| '>' searchTerm {
$$.rel = $0.rel;
} cqlQuery {
- $$.cql = cql_apply_prefix($4.cql, 0, $2.buf);
+ $$.cql = cql_apply_prefix(((CQL_parser) parm)->nmem,
+ $4.cql, 0, $2.buf);
}
;
modifiers: modifiers '/' searchTerm
{
- struct cql_node *mod = cql_node_mk_sc($3.buf, "=", 0);
+ struct cql_node *mod = cql_node_mk_sc(((CQL_parser)parm)->nmem,
+ $3.buf, "=", 0);
mod->u.st.modifiers = $1.cql;
$$.cql = mod;
|
modifiers '/' searchTerm mrelation searchTerm
{
- struct cql_node *mod = cql_node_mk_sc($3.buf, $4.buf, $5.buf);
+ struct cql_node *mod = cql_node_mk_sc(((CQL_parser)parm)->nmem,
+ $3.buf, $4.buf, $5.buf);
mod->u.st.modifiers = $1.cql;
$$.cql = mod;
return 0;
}
-/*
- * bison lexer for CQL.
+/**
+ * putb is a utility that puts one character to the string
+ * in current lexical token. This routine deallocates as
+ * necessary using NMEM.
*/
static void putb(YYSTYPE *lval, CQL_parser cp, int c)
{
if (lval->len+1 >= lval->size)
{
- char *nb = nmem_malloc(cp->nmem, (lval->size = lval->len * 2 + 20));
+ char *nb = (char *)
+ nmem_malloc(cp->nmem, (lval->size = lval->len * 2 + 20));
memcpy (nb, lval->buf, lval->len);
lval->buf = nb;
}
}
+/**
+ * yylex returns next token for Bison to be read. In this
+ * case one of the CQL terminals are returned.
+ */
int yylex(YYSTYPE *lval, void *vp)
{
CQL_parser cp = (CQL_parser) vp;
lval->rel = 0;
lval->len = 0;
lval->size = 10;
- lval->buf = nmem_malloc(cp->nmem, lval->size);
+ lval->buf = (char *) nmem_malloc(cp->nmem, lval->size);
lval->buf[0] = '\0';
do
{
}
if (c == '"')
{
- while ((c = cp->getbyte(cp->client_data)) != EOF && c != '"')
+ while ((c = cp->getbyte(cp->client_data)) != 0 && c != '"')
{
if (c == '\\')
c = cp->getbyte(cp->client_data);
#endif
if (c != 0)
cp->ungetbyte(c, cp->client_data);
- if (!strcmp(lval->buf, "and"))
+ if (!cql_strcmp(lval->buf, "and"))
return AND;
- if (!strcmp(lval->buf, "or"))
+ if (!cql_strcmp(lval->buf, "or"))
return OR;
- if (!strcmp(lval->buf, "not"))
+ if (!cql_strcmp(lval->buf, "not"))
return NOT;
- if (!strncmp(lval->buf, "prox", 4))
+ if (!cql_strcmp(lval->buf, "prox"))
return PROX;
}
return TERM;