/* This file is part of the YAZ toolkit.
- * Copyright (C) 1995-2012 Index Data
+ * Copyright (C) Index Data
* See the file LICENSE for details.
- */
+ */
/* bison parser for CQL grammar. */
%{
-/**
+/**
* \file cql.c
* \brief Implements CQL parser.
*
size_t len;
/** size of buffer (len <= size) */
size_t size;
- } token;
+ } token;
struct cql_parser {
int (*getbyte)(void *client_data);
int last_pos;
struct cql_node *top;
NMEM nmem;
+ int strict;
};
#define YYSTYPE token
-
-#define YYPARSE_PARAM parm
-#define YYLEX_PARAM parm
-
- int yylex(YYSTYPE *lval, void *vp);
- int yyerror(char *s);
+
+int yylex(YYSTYPE *lval, void *vp);
+int yyerror(void *lval, char *msg);
+
%}
-%pure_parser
+
+%lex-param {void *parm}
+%parse-param {void *parm}
+%pure-parser
%token PREFIX_NAME SIMPLE_STRING AND OR NOT PROX GE LE NE EXACT SORTBY
%%
-top: {
+top: {
$$.rel = cql_node_mk_sc(((CQL_parser) parm)->nmem,
"cql.serverChoice", "=", 0);
((CQL_parser) parm)->top = 0;
| singleSpec
{
$$.cql = $1.cql;
-};
+};
singleSpec: index modifiers {
$$.cql = cql_node_mk_sort(((CQL_parser) parm)->nmem, $1.buf, $2.cql);
| '>' searchTerm {
$$.rel = $0.rel;
} cqlQuery {
- $$.cql = cql_apply_prefix(((CQL_parser) parm)->nmem,
+ $$.cql = cql_apply_prefix(((CQL_parser) parm)->nmem,
$4.cql, 0, $2.buf);
}
;
-scopedClause:
+scopedClause:
searchClause
|
- scopedClause boolean modifiers {
+ scopedClause boolean modifiers {
$$.rel = $0.rel;
} searchClause {
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;
cn->u.boolean.right = $5.cql;
}
;
-searchClause:
- '(' {
+searchClause:
+ '(' {
$$.rel = $0.rel;
-
+
} cqlQuery ')' {
$$.cql = $3.cql;
}
st->u.st.term = nmem_strdup(((CQL_parser)parm)->nmem, $1.buf);
$$.cql = st;
}
-|
+|
index relation modifiers {
$$.rel = cql_node_mk_sc(((CQL_parser) parm)->nmem, $1.buf, $2.buf, 0);
$$.rel->u.st.modifiers = $3.cql;
extraTerms:
SIMPLE_STRING extraTerms {
- struct cql_node *st = cql_node_mk_sc(((CQL_parser) parm)->nmem,
+ struct cql_node *st = cql_node_mk_sc(((CQL_parser) parm)->nmem,
/* index */ 0, /* rel */ 0, $1.buf);
st->u.st.extra_terms = $2.cql;
$$.cql = st;
}
-|
+|
{ $$.cql = 0; }
;
/* unary NOT search SIMPLE_STRING here .. */
-boolean:
+boolean:
AND | OR | NOT | PROX ;
modifiers: modifiers '/' searchTerm
-{
+{
struct cql_node *mod = cql_node_mk_sc(((CQL_parser)parm)->nmem,
$3.buf, 0, 0);
$$.cql = mod;
}
|
-{
+{
$$.cql = 0;
}
;
relation: PREFIX_NAME | relation_symbol;
relation_symbol:
- '='
-| '>'
+ '='
+| '>'
| '<'
| GE
| LE
| EXACT
;
-index:
+index:
searchTerm;
searchTerm:
%%
-int yyerror(char *s)
+int yyerror(void *locp, char *s)
{
return 0;
}
lval->buf = "sortby";
return SORTBY;
}
+ if (cp->strict)
+ return PREFIX_NAME;
if (!cql_strcmp(lval->buf, "all"))
relation_like = 1;
if (!cql_strcmp(lval->buf, "any"))
cp->last_error = 0;
cp->last_pos = 0;
cp->nmem = nmem_create();
+ cp->strict = 0;
return cp;
}
return cp->top;
}
+void cql_parser_strict(CQL_parser cp, int mode)
+{
+ cp->strict = mode;
+}
+
/*
* Local variables:
* c-basic-offset: 4