X-Git-Url: http://git.indexdata.com/?p=yaz-moved-to-github.git;a=blobdiff_plain;f=src%2Fcql.y;h=ea828dc6c0e31fb627279c684508fd433cd99169;hp=d102a17fc6b3cb921a7f1b4e2b4b5513a5e7de83;hb=e4e5f0bfaa1fcb5eb12cc37df216352df226b01e;hpb=4f3bcae93d51a26709c12b51261c3d95af610cb2 diff --git a/src/cql.y b/src/cql.y index d102a17..ea828dc 100644 --- a/src/cql.y +++ b/src/cql.y @@ -1,10 +1,10 @@ /* This file is part of the YAZ toolkit. - * Copyright (C) 1995-2011 Index Data + * Copyright (C) 1995-2013 Index Data * See the file LICENSE for details. - */ + */ /* bison parser for CQL grammar. */ %{ -/** +/** * \file cql.c * \brief Implements CQL parser. * @@ -34,7 +34,7 @@ size_t len; /** size of buffer (len <= size) */ size_t size; - } token; + } token; struct cql_parser { int (*getbyte)(void *client_data); @@ -47,36 +47,54 @@ }; #define YYSTYPE token - + #define YYPARSE_PARAM parm #define YYLEX_PARAM parm - + int yylex(YYSTYPE *lval, void *vp); int yyerror(char *s); %} %pure_parser -%token DOTTERM TERM AND OR NOT PROX GE LE NE EXACT SORTBY +%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; } cqlQuery1 sortby { cql_node_destroy($$.rel); - ((CQL_parser) parm)->top = $2.cql; + if ($3.cql) + { + $3.cql->u.sort.search = $2.cql; + ((CQL_parser) parm)->top = $3.cql; + } else { + ((CQL_parser) parm)->top = $2.cql; + } } ; sortby: /* empty */ -| SORTBY sortSpec; - -sortSpec: sortSpec singleSpec -| singleSpec; + { $$.cql = 0; } +| SORTBY sortSpec { + $$.cql = $2.cql; + }; + +sortSpec: sortSpec singleSpec { + $$.cql = $1.cql; + $$.cql->u.sort.next = $2.cql; + } +| singleSpec +{ + $$.cql = $1.cql; +}; -singleSpec: index modifiers ; +singleSpec: index modifiers { + $$.cql = cql_node_mk_sort(((CQL_parser) parm)->nmem, $1.buf, $2.cql); + } +; cqlQuery1: cqlQuery | cqlQuery error { @@ -97,20 +115,20 @@ cqlQuery: | '>' 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; @@ -119,10 +137,10 @@ scopedClause: } ; -searchClause: - '(' { +searchClause: + '(' { $$.rel = $0.rel; - + } cqlQuery ')' { $$.cql = $3.cql; } @@ -133,7 +151,7 @@ searchTerm extraTerms { 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; @@ -144,24 +162,24 @@ searchTerm extraTerms { ; extraTerms: -extraTerms TERM { - struct cql_node *st = cql_node_mk_sc(((CQL_parser) parm)->nmem, - /* index */ 0, /* rel */ 0, $2.buf); - st->u.st.extra_terms = $1.cql; +SIMPLE_STRING extraTerms { + 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 TERM here .. */ +/* 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); @@ -169,7 +187,7 @@ modifiers: modifiers '/' searchTerm $$.cql = mod; } | -modifiers '/' searchTerm mrelation searchTerm +modifiers '/' searchTerm relation_symbol searchTerm { struct cql_node *mod = cql_node_mk_sc(((CQL_parser)parm)->nmem, $3.buf, $4.buf, $5.buf); @@ -178,38 +196,29 @@ modifiers '/' searchTerm mrelation searchTerm $$.cql = mod; } | -{ +{ $$.cql = 0; } ; -mrelation: - '=' -| '>' -| '<' -| GE -| LE -| NE -| EXACT -; +relation: PREFIX_NAME | relation_symbol; -relation: - '=' -| '>' +relation_symbol: + '=' +| '>' | '<' | GE | LE | NE | EXACT -| DOTTERM ; -index: +index: searchTerm; searchTerm: - TERM -| DOTTERM + SIMPLE_STRING +| PREFIX_NAME | AND | OR | NOT @@ -236,7 +245,7 @@ static void putb(YYSTYPE *lval, CQL_parser cp, int c) { char *nb = (char *) nmem_malloc(cp->nmem, (lval->size = lval->len * 2 + 20)); - memcpy (nb, lval->buf, lval->len); + memcpy(nb, lval->buf, lval->len); lval->buf = nb; } if (c) @@ -325,7 +334,7 @@ int yylex(YYSTYPE *lval, void *vp) putb(lval, cp, c); } putb(lval, cp, 0); - return TERM; + return SIMPLE_STRING; } else { @@ -379,10 +388,16 @@ int yylex(YYSTYPE *lval, void *vp) relation_like = 1; if (!cql_strcmp(lval->buf, "any")) relation_like = 1; + if (!cql_strcmp(lval->buf, "adj")) + relation_like = 1; + if (!cql_strcmp(lval->buf, "within")) + relation_like = 1; + if (!cql_strcmp(lval->buf, "encloses")) + relation_like = 1; if (relation_like) - return DOTTERM; + return PREFIX_NAME; } - return TERM; + return SIMPLE_STRING; } @@ -395,8 +410,7 @@ int cql_parser_stream(CQL_parser cp, cp->getbyte = getbyte; cp->ungetbyte = ungetbyte; cp->client_data = client_data; - if (cp->top) - cql_node_destroy(cp->top); + cql_node_destroy(cp->top); cql_parse(cp); if (cp->top) return 0; @@ -405,7 +419,7 @@ int cql_parser_stream(CQL_parser cp, CQL_parser cql_parser_create(void) { - CQL_parser cp = (CQL_parser) xmalloc (sizeof(*cp)); + CQL_parser cp = (CQL_parser) xmalloc(sizeof(*cp)); cp->top = 0; cp->getbyte = 0; @@ -428,3 +442,12 @@ struct cql_node *cql_parser_result(CQL_parser cp) { return cp->top; } + +/* + * Local variables: + * c-basic-offset: 4 + * c-file-style: "Stroustrup" + * indent-tabs-mode: nil + * End: + * vim: shiftwidth=4 tabstop=8 expandtab + */