%}
%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
%%
;
extraTerms:
-extraTerms TERM {
+extraTerms SIMPLE_STRING {
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;
;
-/* unary NOT search TERM here .. */
+/* unary NOT search SIMPLE_STRING here .. */
boolean:
AND | OR | NOT | PROX ;
}
;
-relation: DOTTERM | relation_symbol;
+relation: PREFIX_NAME | relation_symbol;
relation_symbol:
'='
searchTerm;
searchTerm:
- TERM
-| DOTTERM
+ SIMPLE_STRING
+| PREFIX_NAME
| AND
| OR
| NOT
putb(lval, cp, c);
}
putb(lval, cp, 0);
- return TERM;
+ return SIMPLE_STRING;
}
else
{
if (!cql_strcmp(lval->buf, "any"))
relation_like = 1;
if (relation_like)
- return DOTTERM;
+ return PREFIX_NAME;
}
- return TERM;
+ return SIMPLE_STRING;
}