ferret 0.3.2 → 0.9.0

data/ext/q_multi_phrase.c

@@ -0,0 +1,343 @@
+#include <string.h>
+#include "search.h"
+
+/***************************************************************************
+ *
+ * MultiPhraseWeight
+ *
+ ***************************************************************************/
+
+char *mphw_to_s(Weight *self)
+{
+  char dbuf[32];
+  dbl_to_s(dbuf, self->value);
+  return epstrdup("MultiPhraseWeight(%s)", strlen(dbuf), dbuf);
+}
+
+Scorer *mphw_scorer(Weight *self, IndexReader *ir)
+{
+  Scorer *phsc;
+  MultiPhraseQuery *mphq = (MultiPhraseQuery *)self->query->data;
+  int i;
+  if (mphq->t_cnt == 0) return NULL; // optimize zero-term case
+
+  TermDocEnum **tps = ALLOC_N(TermDocEnum *, mphq->t_cnt);
+
+  for (i = 0; i < mphq->t_cnt; i++) {
+    if (mphq->pt_cnt[i] == 1) {
+      tps[i] = ir_term_positions_for(ir, mphq->terms[i][0]);
+    } else {
+      tps[i] = mtdpe_create(ir, mphq->terms[i], mphq->pt_cnt[i]);
+    }
+    if (tps[i] == NULL) {
+      // free everything we just created and return NULL
+      int j;
+      for (j = 0; j < i; j++) {
+        tps[i]->close(tps[i]);
+      }
+      free(tps);
+      return NULL;
+    }
+  }
+
+  if (mphq->slop == 0) {       // optimize exact case
+    phsc = exact_phrase_scorer_create(self, tps, mphq->positions, mphq->t_cnt,
+                                      self->similarity,
+                                      ir->get_norms(ir, mphq->field));
+  } else {
+    phsc = sloppy_phrase_scorer_create(self, tps, mphq->positions, mphq->t_cnt,
+                                       self->similarity,
+                                       mphq->slop,
+                                       ir->get_norms(ir, mphq->field));
+  }
+  free(tps);
+  return phsc;
+}
+
+Explanation *mphw_explain(Weight *self, IndexReader *ir, int doc_num)
+{
+  char *query_str = self->query->to_s(self->query, "");
+  MultiPhraseQuery *mphq = (MultiPhraseQuery *)self->query->data;
+  int i, j;
+  char *doc_freqs = NULL;
+  int len = 0, pos = 0;
+
+  Explanation *expl = expl_create(0.0,
+      epstrdup("weight(%s in %d), product of:",
+        strlen(query_str) + 20,
+        query_str, doc_num));
+
+  for (i = 0; i < mphq->t_cnt; i++) {
+    for (j = 0; j < mphq->pt_cnt[i]; j++) {
+      len += strlen(mphq->terms[i][j]->text) + 30;
+    }
+  }
+  doc_freqs = ALLOC_N(char, len);
+  for (i = 0; i < mphq->t_cnt; i++) {
+    for (j = 0; j < mphq->pt_cnt[i]; j++) {
+      Term *term = mphq->terms[i][j];
+      sprintf(doc_freqs + pos, "%s=%d, ", term->text, ir->doc_freq(ir, term));
+      pos += strlen(doc_freqs + pos);
+    }
+  }
+  pos -= 2; // remove ", " from the end
+  doc_freqs[pos] = 0;
+
+  Explanation *idf_expl1 = expl_create(self->idf,
+      epstrdup("idf(%s:<%s>)", strlen(mphq->field) + pos, mphq->field, doc_freqs));
+  Explanation *idf_expl2 = expl_create(self->idf,
+      epstrdup("idf(%s:<%s>)", strlen(mphq->field) + pos, mphq->field, doc_freqs));
+  free(doc_freqs);
+  
+  // explain query weight
+  Explanation *query_expl = expl_create(0.0, 
+      epstrdup("query_weight(%s), product of:", strlen(query_str), query_str));
+
+  if (self->query->boost != 1.0) {
+    expl_add_detail(query_expl, expl_create(self->query->boost, estrdup("boost")));
+  }
+  expl_add_detail(query_expl, idf_expl1);
+  
+  Explanation *qnorm_expl = expl_create(self->qnorm, estrdup("query_norm"));
+  expl_add_detail(query_expl, qnorm_expl);
+  
+  query_expl->value = self->query->boost * self->idf * self->qnorm;
+
+  expl_add_detail(expl, query_expl);
+ 
+  // explain field weight
+  Explanation *field_expl = expl_create(0.0, 
+      epstrdup("field_weight(%s in %d), product of:",
+        strlen(query_str) + 20, query_str, doc_num));
+  free(query_str);
+
+  Scorer *scorer = self->scorer(self, ir);
+  Explanation *tf_expl = scorer->explain(scorer, doc_num);
+  scorer->destroy(scorer);
+  expl_add_detail(field_expl, tf_expl);
+  expl_add_detail(field_expl, idf_expl2);
+
+  uchar *field_norms = ir->get_norms(ir, mphq->field);
+  float field_norm = (field_norms != NULL)
+    ? sim_decode_norm(self->similarity, field_norms[doc_num])
+    : 0.0;
+  Explanation *field_norm_expl = expl_create(field_norm,
+    epstrdup("field_norm(field=%s, doc=%d)",
+        strlen(mphq->field) + 20, mphq->field, doc_num));
+
+  expl_add_detail(field_expl, field_norm_expl);
+
+  field_expl->value = tf_expl->value * self->idf * field_norm;
+  
+  // combine them
+  if (query_expl->value == 1.0) {
+    expl_destoy(expl);
+    return field_expl;
+  } else {
+    expl->value = (query_expl->value * field_expl->value);
+    expl_add_detail(expl, field_expl);
+    return expl;
+  }
+}
+
+
+
+
+Weight *mphw_create(Query *query, Searcher *searcher)
+{
+  MultiPhraseQuery *mphq = (MultiPhraseQuery *)query->data;
+  Weight *self = ALLOC(Weight);
+  int i, j;
+  ZEROSET(self, Weight, 1);
+  self->get_query = &w_get_query;
+  self->get_value = &w_get_value;
+  self->normalize = &w_normalize;
+  self->scorer    = &mphw_scorer;
+  self->explain   = &mphw_explain;
+  self->to_s      = &mphw_to_s;
+  self->destroy   = &free;
+  self->sum_of_squared_weights = &w_sum_of_squared_weights;
+
+  self->similarity = query->get_similarity(query, searcher);
+  self->query = query;
+  self->value = query->boost;
+
+  self->idf = 0.0;
+  for (i = 0; i < mphq->t_cnt; i++) {
+    for (j = 0; j < mphq->pt_cnt[i]; j++) {
+      self->idf += sim_idf_term(self->similarity, mphq->terms[i][j], searcher);
+    }
+  }
+
+  return self;
+}
+
+/***************************************************************************
+ *
+ * MultiPhraseQuery
+ *
+ ***************************************************************************/
+
+#define GET_MPHQ MultiPhraseQuery *mphq = (MultiPhraseQuery *)self->data
+
+/**
+ * NOTE: terms must be allocated and it will be freed when the query is
+ * destroyed.
+ */
+void mphq_add_terms(Query *self, Term **terms, int t_cnt, int pos_inc)
+{
+  GET_MPHQ;
+  int position, index = mphq->t_cnt;
+  if (index >= mphq->t_capa) {
+    mphq->t_capa <<= 1;
+    REALLOC_N(mphq->terms, Term **, mphq->t_capa);
+    REALLOC_N(mphq->positions, int, mphq->t_capa);
+    REALLOC_N(mphq->pt_cnt, int, mphq->t_capa);
+  }
+  if (index == 0) {
+    position = 0;
+    mphq->field = terms[0]->field;
+  } else {
+    int i;
+    position = mphq->positions[index - 1] + pos_inc;
+    for (i = 0; i < t_cnt; i++) {
+      if (strcmp(terms[i]->field, mphq->field) != 0) {
+        eprintf(ARG_ERROR, "All phrase terms must be in the same field. Current phrase is %s, tried to add %s\n", mphq->field, terms[i]->field);
+      }
+    }
+  }
+
+  mphq->terms[index] = terms;
+  mphq->pt_cnt[index] = t_cnt;
+  mphq->positions[index] = position;
+  mphq->t_cnt++;
+}
+
+void mphq_destroy(void *p)
+{
+  Query *self = (Query *)p;
+
+  GET_MPHQ;
+  int i, j;
+  if (self->destroy_all) {
+    for (i = 0; i < mphq->t_cnt; i++) {
+      for (j = 0; j < mphq->pt_cnt[i]; j++) {
+        term_destroy(mphq->terms[i][j]);
+      }
+      free(mphq->terms[i]);
+    }
+  }
+  free(mphq->terms);
+  free(mphq->positions);
+  free(mphq->pt_cnt);
+  free(mphq);
+
+  q_destroy(self);
+}
+
+void mphq_extract_terms(Query *self, Array *terms)
+{
+  GET_MPHQ;
+  int i, j;
+  for (i = 0; i < mphq->t_cnt; i++) {
+    for (j = 0; j < mphq->pt_cnt[i]; j++) {
+      ary_append(terms, mphq->terms[i][j]);
+    }
+  }
+}
+
+char *mphq_to_s(Query *self, char *field)
+{
+  GET_MPHQ;
+  int i, j, buf_index = 0, len = 0, pos, last_pos = -1;
+  char *buffer;
+  if (!mphq->t_cnt) return NULL;
+  len = strlen(mphq->field) + 1;
+  for (i = 0; i < mphq->t_cnt; i++) {
+    for (j = 0; j < mphq->pt_cnt[i]; j++) {
+      len += strlen(mphq->terms[i][j]->text) + 1;
+    }
+  }
+
+  // add space for extra characters and boost and slop
+  len += 100 + 3 * mphq->positions[mphq->t_cnt - 1];
+
+  buffer = ALLOC_N(char, len);
+
+  if (strcmp(field, mphq->field) != 0) {
+    len = strlen(mphq->field);
+    memcpy(buffer, mphq->field, len);
+    buffer[len] = ':';
+    buf_index += len + 1;
+  }
+  buffer[buf_index++] = '"';
+
+  for (i = 0; i < mphq->t_cnt; i++) {
+    pos = mphq->positions[i];
+    for (j = last_pos; j < pos - 1; j++) {
+      memcpy(buffer + buf_index, "<> ", 3);
+      buf_index += 3;
+    }
+    last_pos = pos;
+
+    for (j = 0; j < mphq->pt_cnt[i]; j++) {
+      Term *term = mphq->terms[i][j];
+      len = strlen(term->text);
+      memcpy(buffer + buf_index, term->text, len);
+      buf_index += len;
+      buffer[buf_index++] = '|';
+    }
+    buffer[buf_index-1] = ' '; /* change last '|' to ' ' */
+  }
+
+  if (buffer[buf_index-1] == ' ') buf_index--;
+  buffer[buf_index++] = '"';
+  buffer[buf_index] = 0;
+  if (mphq->slop != 0) {
+    sprintf(buffer + buf_index, "~%d", mphq->slop);
+    buf_index += strlen(buffer + buf_index);
+  }
+  if (self->boost != 1.0) {
+    buffer[buf_index] = '^';
+    dbl_to_s(buffer + buf_index + 1, self->boost);
+  }
+  return buffer;
+}
+
+Query *mphq_rewrite(Query *self, IndexReader *ir) 
+{
+  GET_MPHQ;
+  if (mphq->t_cnt == 1) { // optimize one-term case
+    Term **terms = mphq->terms[0];
+    Query *bq = bq_create(true);
+    int i;
+    for (i = 0; i < mphq->pt_cnt[0]; i++) {
+      bq_add_query(bq, tq_create(term_clone(terms[i])), BC_SHOULD);
+    }
+    bq->boost = self->boost;
+    if (self->rewritten) self->rewritten->destroy(self->rewritten);
+    return self->rewritten = bq;
+  } else {
+    return self;
+  }
+}
+    
+Query *mphq_create()
+{
+  Query *self = q_create();
+  MultiPhraseQuery *mphq = ALLOC(MultiPhraseQuery);
+  ZEROSET(mphq, MultiPhraseQuery, 1);
+  mphq->t_capa = PHQ_INIT_CAPA;
+  mphq->terms = ALLOC_N(Term **, PHQ_INIT_CAPA);
+  mphq->positions = ALLOC_N(int, PHQ_INIT_CAPA);
+  mphq->pt_cnt = ALLOC_N(int, PHQ_INIT_CAPA);
+  self->data = mphq;
+
+  self->create_weight = &mphw_create;
+  self->extract_terms = &mphq_extract_terms;
+  self->to_s = &mphq_to_s;
+  self->destroy = &mphq_destroy;
+  self->rewrite = &mphq_rewrite;
+  self->type = PHRASE_QUERY;
+  return self;
+}

data/ext/q_parser.c

@@ -0,0 +1,2180 @@
+/* A Bison parser, made by GNU Bison 2.0.  */
+
+/* Skeleton parser for Yacc-like parsing with Bison,
+   Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
+
+   This program is free software; you can redistribute it and/or modify
+   it under the terms of the GNU General Public License as published by
+   the Free Software Foundation; either version 2, or (at your option)
+   any later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place - Suite 330,
+   Boston, MA 02111-1307, USA.  */
+
+/* As a special exception, when this file is copied by Bison into a
+   Bison output file, you may use that output file without restriction.
+   This special exception was added by the Free Software Foundation
+   in version 1.24 of Bison.  */
+
+/* Written by Richard Stallman by simplifying the original so called
+   ``semantic'' parser.  */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+   infringing on user name space.  This should be done even for local
+   variables, as they might otherwise be expanded by user macros.
+   There are some unavoidable exceptions within include files to
+   define necessary library symbols; they are noted "INFRINGES ON
+   USER NAME SPACE" below.  */
+
+/* Identify Bison output.  */
+#define YYBISON 1
+
+/* Skeleton name.  */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers.  */
+#define YYPURE 1
+
+/* Using locations.  */
+#define YYLSP_NEEDED 0
+
+
+
+/* Tokens.  */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+   /* Put the tokens into the symbol table, so that GDB and other debuggers
+      know about them.  */
+   enum yytokentype {
+     WORD = 258,
+     WILD_STR = 259,
+     LOW = 260,
+     OR = 261,
+     AND = 262,
+     NOT = 263,
+     REQ = 264,
+     HIGH = 265
+   };
+#endif
+#define WORD 258
+#define WILD_STR 259
+#define LOW 260
+#define OR 261
+#define AND 262
+#define NOT 263
+#define REQ 264
+#define HIGH 265
+
+
+
+
+/* Copy the first part of user declarations.  */
+#line 1 "src/query_parser/q_parser.y"
+
+#include <string.h>
+#include "search.h"
+
+typedef struct Phrase {
+  int cnt;
+  int capa;
+  char ***words;
+  int  *w_cnt;
+  int  *w_capa;
+} Phrase;
+
+
+
+/* Enabling traces.  */
+#ifndef YYDEBUG
+# define YYDEBUG 0
+#endif
+
+/* Enabling verbose error messages.  */
+#ifdef YYERROR_VERBOSE
+# undef YYERROR_VERBOSE
+# define YYERROR_VERBOSE 1
+#else
+# define YYERROR_VERBOSE 0
+#endif
+
+#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED)
+#line 14 "src/query_parser/q_parser.y"
+typedef union YYSTYPE {
+  Query *query;
+  BooleanClause *bcls;
+  Array *array;
+  HashSet *hashset;
+  Phrase *phrase;
+  char *str;
+} YYSTYPE;
+/* Line 190 of yacc.c.  */
+#line 119 "y.tab.c"
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+# define YYSTYPE_IS_TRIVIAL 1
+#endif
+
+
+
+/* Copy the second part of user declarations.  */
+#line 22 "src/query_parser/q_parser.y"
+
+int yylex(YYSTYPE *lvalp, QParser *qp);
+int yyerror(QParser *qp, char const *msg);
+
+#define PHRASE_INIT_CAPA 4
+Query *get_bool_q(Array *bclauses);
+
+Array *first_cls(BooleanClause *cls);
+Array *add_and_cls(Array *clauses, BooleanClause *cls);
+Array *add_or_cls(Array *clauses, BooleanClause *cls);
+Array *add_default_cls(QParser *qp, Array *clauses, BooleanClause *cls);
+
+BooleanClause *get_bool_cls(Query *q, unsigned int occur);
+
+Query *get_term_q(QParser *qp, char *field, char *word);
+Query *get_fuzzy_q(QParser *qp, char *field, char *word, char *slop);
+Query *get_wild_q(QParser *qp, char *field, char *pattern);
+
+HashSet *first_field(QParser *qp, char *field);
+HashSet *add_field(QParser *qp, char *field);
+
+Query *get_phrase_q(QParser *qp, Phrase *phrase, char *slop);
+
+Phrase *ph_first_word(char *word);
+Phrase *ph_add_word(Phrase *self, char *word);
+Phrase *ph_add_multi_word(Phrase *self, char *word);
+
+Query *get_range_q(char *field, char *from, char *to,
+  bool inc_lower, bool inc_upper);
+
+#define FLDS(q, func) do {\
+  char *field;\
+  if (qp->fields->size == 0) {\
+    q = NULL;\
+  } else if (qp->fields->size == 1) {\
+    field = (char *)qp->fields->elems[0];\
+    q = func;\
+  } else {\
+    int i;Query *sq;\
+    q = bq_create(false);\
+    for (i = 0; i < qp->fields->size; i++) {\
+      field = (char *)qp->fields->elems[i];\
+      sq = func;\
+      if (sq) bq_add_query(q, sq, BC_SHOULD);\
+    }\
+  }\
+} while (0)
+
+
+/* Line 213 of yacc.c.  */
+#line 179 "y.tab.c"
+
+#if ! defined (yyoverflow) || YYERROR_VERBOSE
+
+# ifndef YYFREE
+#  define YYFREE free
+# endif
+# ifndef YYMALLOC
+#  define YYMALLOC malloc
+# endif
+
+/* The parser invokes alloca or malloc; define the necessary symbols.  */
+
+# ifdef YYSTACK_USE_ALLOCA
+#  if YYSTACK_USE_ALLOCA
+#   ifdef __GNUC__
+#    define YYSTACK_ALLOC __builtin_alloca
+#   else
+#    define YYSTACK_ALLOC alloca
+#   endif
+#  endif
+# endif
+
+# ifdef YYSTACK_ALLOC
+   /* Pacify GCC's `empty if-body' warning. */
+#  define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
+# else
+#  if defined (__STDC__) || defined (__cplusplus)
+#   include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+#   define YYSIZE_T size_t
+#  endif
+#  define YYSTACK_ALLOC YYMALLOC
+#  define YYSTACK_FREE YYFREE
+# endif
+#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */
+
+
+#if (! defined (yyoverflow) \
+     && (! defined (__cplusplus) \
+	 || (defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL)))
+
+/* A type that is properly aligned for any stack member.  */
+union yyalloc
+{
+  short int yyss;
+  YYSTYPE yyvs;
+  };
+
+/* The size of the maximum gap between one aligned stack and the next.  */
+# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
+
+/* The size of an array large to enough to hold all stacks, each with
+   N elements.  */
+# define YYSTACK_BYTES(N) \
+     ((N) * (sizeof (short int) + sizeof (YYSTYPE))			\
+      + YYSTACK_GAP_MAXIMUM)
+
+/* Copy COUNT objects from FROM to TO.  The source and destination do
+   not overlap.  */
+# ifndef YYCOPY
+#  if defined (__GNUC__) && 1 < __GNUC__
+#   define YYCOPY(To, From, Count) \
+      __builtin_memcpy (To, From, (Count) * sizeof (*(From)))
+#  else
+#   define YYCOPY(To, From, Count)		\
+      do					\
+	{					\
+	  register YYSIZE_T yyi;		\
+	  for (yyi = 0; yyi < (Count); yyi++)	\
+	    (To)[yyi] = (From)[yyi];		\
+	}					\
+      while (0)
+#  endif
+# endif
+
+/* Relocate STACK from its old location to the new one.  The
+   local variables YYSIZE and YYSTACKSIZE give the old and new number of
+   elements in the stack, and YYPTR gives the new location of the
+   stack.  Advance YYPTR to a properly aligned location for the next
+   stack.  */
+# define YYSTACK_RELOCATE(Stack)					\
+    do									\
+      {									\
+	YYSIZE_T yynewbytes;						\
+	YYCOPY (&yyptr->Stack, Stack, yysize);				\
+	Stack = &yyptr->Stack;						\
+	yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
+	yyptr += yynewbytes / sizeof (*yyptr);				\
+      }									\
+    while (0)
+
+#endif
+
+#if defined (__STDC__) || defined (__cplusplus)
+   typedef signed char yysigned_char;
+#else
+   typedef short int yysigned_char;
+#endif
+
+/* YYFINAL -- State number of the termination state. */
+#define YYFINAL  38
+/* YYLAST -- Last index in YYTABLE.  */
+#define YYLAST   98
+
+/* YYNTOKENS -- Number of terminals. */
+#define YYNTOKENS  26
+/* YYNNTS -- Number of nonterminals. */
+#define YYNNTS  16
+/* YYNRULES -- Number of rules. */
+#define YYNRULES  50
+/* YYNRULES -- Number of states. */
+#define YYNSTATES  79
+
+/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX.  */
+#define YYUNDEFTOK  2
+#define YYMAXUTOK   265
+
+#define YYTRANSLATE(YYX) 						\
+  ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
+
+/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX.  */
+static const unsigned char yytranslate[] =
+{
+       0,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,    18,     2,     2,     2,     2,     2,
+      13,    14,    16,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,    10,     2,
+      19,    25,    20,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,    21,     2,    22,    12,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,    24,    17,    23,    15,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+       2,     2,     2,     2,     2,     2,     1,     2,     3,     4,
+       5,     6,     7,     8,     9,    11
+};
+
+#if YYDEBUG
+/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
+   YYRHS.  */
+static const unsigned char yyprhs[] =
+{
+       0,     0,     3,     4,     6,     8,    12,    16,    19,    22,
+      25,    27,    29,    33,    35,    39,    41,    43,    45,    47,
+      49,    53,    56,    58,    59,    64,    65,    66,    72,    74,
+      78,    82,    88,    91,    96,    98,   101,   104,   108,   112,
+     117,   122,   127,   132,   136,   140,   144,   148,   151,   155,
+     159
+};
+
+/* YYRHS -- A `-1'-separated list of the rules' RHS. */
+static const yysigned_char yyrhs[] =
+{
+      27,     0,    -1,    -1,    28,    -1,    29,    -1,    28,     7,
+      29,    -1,    28,     6,    29,    -1,    28,    29,    -1,     9,
+      30,    -1,     8,    30,    -1,    30,    -1,    31,    -1,    31,
+      12,     3,    -1,    32,    -1,    13,    28,    14,    -1,    34,
+      -1,    39,    -1,    41,    -1,    33,    -1,     3,    -1,     3,
+      15,     3,    -1,     3,    15,    -1,     4,    -1,    -1,    38,
+      10,    31,    35,    -1,    -1,    -1,    16,    36,    10,    31,
+      37,    -1,     3,    -1,    38,    17,     3,    -1,    18,    40,
+      18,    -1,    18,    40,    18,    15,     3,    -1,    18,    18,
+      -1,    18,    18,    15,     3,    -1,     3,    -1,    19,    20,
+      -1,    40,     3,    -1,    40,    19,    20,    -1,    40,    17,
+       3,    -1,    21,     3,     3,    22,    -1,    21,     3,     3,
+      23,    -1,    24,     3,     3,    22,    -1,    24,     3,     3,
+      23,    -1,    19,     3,    23,    -1,    19,     3,    22,    -1,
+      21,     3,    20,    -1,    24,     3,    20,    -1,    19,     3,
+      -1,    19,    25,     3,    -1,    20,    25,     3,    -1,    20,
+       3,    -1
+};
+
+/* YYRLINE[YYN] -- source line where rule number YYN was defined.  */
+static const unsigned char yyrline[] =
+{
+       0,    86,    86,    87,    89,    90,    91,    92,    94,    95,
+      96,    98,    99,   101,   102,   103,   104,   105,   106,   108,
+     109,   110,   112,   114,   114,   116,   116,   116,   119,   120,
+     122,   123,   124,   125,   127,   128,   129,   130,   131,   133,
+     134,   135,   136,   137,   138,   139,   140,   141,   142,   143,
+     144
+};
+#endif
+
+#if YYDEBUG || YYERROR_VERBOSE
+/* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
+   First, the terminals, then, starting at YYNTOKENS, nonterminals. */
+static const char *const yytname[] =
+{
+  "$end", "error", "$undefined", "WORD", "WILD_STR", "LOW", "OR", "AND",
+  "NOT", "REQ", "':'", "HIGH", "'^'", "'('", "')'", "'~'", "'*'", "'|'",
+  "'\"'", "'<'", "'>'", "'['", "']'", "'}'", "'{'", "'='", "$accept",
+  "bool_q", "bool_clss", "bool_cls", "boosted_q", "q", "term_q", "wild_q",
+  "field_q", "@1", "@2", "@3", "field", "phrase_q", "ph_words", "range_q", 0
+};
+#endif
+
+# ifdef YYPRINT
+/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
+   token YYLEX-NUM.  */
+static const unsigned short int yytoknum[] =
+{
+       0,   256,   257,   258,   259,   260,   261,   262,   263,   264,
+      58,   265,    94,    40,    41,   126,    42,   124,    34,    60,
+      62,    91,    93,   125,   123,    61
+};
+# endif
+
+/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives.  */
+static const unsigned char yyr1[] =
+{
+       0,    26,    27,    27,    28,    28,    28,    28,    29,    29,
+      29,    30,    30,    31,    31,    31,    31,    31,    31,    32,
+      32,    32,    33,    35,    34,    36,    37,    34,    38,    38,
+      39,    39,    39,    39,    40,    40,    40,    40,    40,    41,
+      41,    41,    41,    41,    41,    41,    41,    41,    41,    41,
+      41
+};
+
+/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN.  */
+static const unsigned char yyr2[] =
+{
+       0,     2,     0,     1,     1,     3,     3,     2,     2,     2,
+       1,     1,     3,     1,     3,     1,     1,     1,     1,     1,
+       3,     2,     1,     0,     4,     0,     0,     5,     1,     3,
+       3,     5,     2,     4,     1,     2,     2,     3,     3,     4,
+       4,     4,     4,     3,     3,     3,     3,     2,     3,     3,
+       2
+};
+
+/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
+   STATE-NUM when YYTABLE doesn't specify something else to do.  Zero
+   means the default is an error.  */
+static const unsigned char yydefact[] =
+{
+       2,    19,    22,     0,     0,     0,    25,     0,     0,     0,
+       0,     0,     0,     3,     4,    10,    11,    13,    18,    15,
+       0,    16,    17,    21,     9,     8,     0,     0,    34,    32,
+       0,     0,    47,     0,    50,     0,     0,     0,     1,     0,
+       0,     7,     0,     0,     0,    20,    14,     0,     0,    35,
+      36,     0,    30,     0,    44,    43,    48,    49,     0,    45,
+       0,    46,     6,     5,    12,    23,    29,    26,    33,    38,
+       0,    37,    39,    40,    41,    42,    24,    27,    31
+};
+
+/* YYDEFGOTO[NTERM-NUM]. */
+static const yysigned_char yydefgoto[] =
+{
+      -1,    12,    13,    14,    15,    16,    17,    18,    19,    76,
+      27,    77,    20,    21,    31,    22
+};
+
+/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
+   STATE-NUM.  */
+#define YYPACT_NINF -32
+static const yysigned_char yypact[] =
+{
+      44,    75,   -32,    63,    63,    44,   -32,    55,    -2,    -1,
+       0,     3,    11,    25,   -32,   -32,    18,   -32,   -32,   -32,
+      76,   -32,   -32,    33,   -32,   -32,     1,    32,   -32,    41,
+      39,    52,    17,    58,   -32,    69,    15,    34,   -32,    44,
+      44,   -32,    72,    63,    77,   -32,   -32,    63,    88,   -32,
+     -32,    91,    80,    78,   -32,   -32,   -32,   -32,    28,   -32,
+      66,   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32,
+      93,   -32,   -32,   -32,   -32,   -32,   -32,   -32,   -32
+};
+
+/* YYPGOTO[NTERM-NUM].  */
+static const yysigned_char yypgoto[] =
+{
+     -32,   -32,    92,   -13,    74,   -31,   -32,   -32,   -32,   -32,
+     -32,   -32,   -32,   -32,   -32,   -32
+};
+
+/* YYTABLE[YYPACT[STATE-NUM]].  What to do in state STATE-NUM.  If
+   positive, shift that token.  If negative, reduce the rule which
+   number is the opposite.  If zero, do what YYDEFACT says.
+   If YYTABLE_NINF, syntax error.  */
+#define YYTABLE_NINF -29
+static const yysigned_char yytable[] =
+{
+      41,    32,    34,    36,     1,     2,    37,    39,    40,     3,
+       4,    38,    65,    41,     5,    46,    67,     6,    58,     7,
+       8,     9,    10,    33,    35,    11,    62,    63,     1,     2,
+      42,    39,    40,     3,     4,    59,    45,    60,     5,    54,
+      55,     6,    47,     7,     8,     9,    10,     1,     2,    11,
+      72,    73,     3,     4,    61,    50,    48,     5,    28,    49,
+       6,    56,     7,     8,     9,    10,     1,     2,    11,    51,
+      52,    53,    57,    29,    30,    64,     5,    24,    25,     6,
+      66,     7,     8,     9,    10,   -28,    43,    11,    74,    75,
+      23,    68,   -28,    44,    69,    70,    78,    26,    71
+};
+
+static const unsigned char yycheck[] =
+{
+      13,     3,     3,     3,     3,     4,     3,     6,     7,     8,
+       9,     0,    43,    26,    13,    14,    47,    16,     3,    18,
+      19,    20,    21,    25,    25,    24,    39,    40,     3,     4,
+      12,     6,     7,     8,     9,    20,     3,     3,    13,    22,
+      23,    16,    10,    18,    19,    20,    21,     3,     4,    24,
+      22,    23,     8,     9,    20,     3,    15,    13,     3,    20,
+      16,     3,    18,    19,    20,    21,     3,     4,    24,    17,
+      18,    19,     3,    18,    19,     3,    13,     3,     4,    16,
+       3,    18,    19,    20,    21,    10,    10,    24,    22,    23,
+      15,     3,    17,    17,     3,    15,     3,     5,    20
+};
+
+/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
+   symbol of state STATE-NUM.  */
+static const unsigned char yystos[] =
+{
+       0,     3,     4,     8,     9,    13,    16,    18,    19,    20,
+      21,    24,    27,    28,    29,    30,    31,    32,    33,    34,
+      38,    39,    41,    15,    30,    30,    28,    36,     3,    18,
+      19,    40,     3,    25,     3,    25,     3,     3,     0,     6,
+       7,    29,    12,    10,    17,     3,    14,    10,    15,    20,
+       3,    17,    18,    19,    22,    23,     3,     3,     3,    20,
+       3,    20,    29,    29,     3,    31,     3,    31,     3,     3,
+      15,    20,    22,    23,    22,    23,    35,    37,     3
+};
+
+#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
+# define YYSIZE_T __SIZE_TYPE__
+#endif
+#if ! defined (YYSIZE_T) && defined (size_t)
+# define YYSIZE_T size_t
+#endif
+#if ! defined (YYSIZE_T)
+# if defined (__STDC__) || defined (__cplusplus)
+#  include <stddef.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYSIZE_T size_t
+# endif
+#endif
+#if ! defined (YYSIZE_T)
+# define YYSIZE_T unsigned int
+#endif
+
+#define yyerrok		(yyerrstatus = 0)
+#define yyclearin	(yychar = YYEMPTY)
+#define YYEMPTY		(-2)
+#define YYEOF		0
+
+#define YYACCEPT	goto yyacceptlab
+#define YYABORT		goto yyabortlab
+#define YYERROR		goto yyerrorlab
+
+
+/* Like YYERROR except do call yyerror.  This remains here temporarily
+   to ease the transition to the new meaning of YYERROR, for GCC.
+   Once GCC version 2 has supplanted version 1, this can go.  */
+
+#define YYFAIL		goto yyerrlab
+
+#define YYRECOVERING()  (!!yyerrstatus)
+
+#define YYBACKUP(Token, Value)					\
+do								\
+  if (yychar == YYEMPTY && yylen == 1)				\
+    {								\
+      yychar = (Token);						\
+      yylval = (Value);						\
+      yytoken = YYTRANSLATE (yychar);				\
+      YYPOPSTACK;						\
+      goto yybackup;						\
+    }								\
+  else								\
+    { 								\
+      yyerror (qp, "syntax error: cannot back up");\
+      YYERROR;							\
+    }								\
+while (0)
+
+
+#define YYTERROR	1
+#define YYERRCODE	256
+
+
+/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N].
+   If N is 0, then set CURRENT to the empty location which ends
+   the previous symbol: RHS[0] (always defined).  */
+
+#define YYRHSLOC(Rhs, K) ((Rhs)[K])
+#ifndef YYLLOC_DEFAULT
+# define YYLLOC_DEFAULT(Current, Rhs, N)				\
+    do									\
+      if (N)								\
+	{								\
+	  (Current).first_line   = YYRHSLOC (Rhs, 1).first_line;	\
+	  (Current).first_column = YYRHSLOC (Rhs, 1).first_column;	\
+	  (Current).last_line    = YYRHSLOC (Rhs, N).last_line;		\
+	  (Current).last_column  = YYRHSLOC (Rhs, N).last_column;	\
+	}								\
+      else								\
+	{								\
+	  (Current).first_line   = (Current).last_line   =		\
+	    YYRHSLOC (Rhs, 0).last_line;				\
+	  (Current).first_column = (Current).last_column =		\
+	    YYRHSLOC (Rhs, 0).last_column;				\
+	}								\
+    while (0)
+#endif
+
+
+/* YY_LOCATION_PRINT -- Print the location on the stream.
+   This macro was not mandated originally: define only if we know
+   we won't break user code: when these are the locations we know.  */
+
+#ifndef YY_LOCATION_PRINT
+# if YYLTYPE_IS_TRIVIAL
+#  define YY_LOCATION_PRINT(File, Loc)			\
+     fprintf (File, "%d.%d-%d.%d",			\
+              (Loc).first_line, (Loc).first_column,	\
+              (Loc).last_line,  (Loc).last_column)
+# else
+#  define YY_LOCATION_PRINT(File, Loc) ((void) 0)
+# endif
+#endif
+
+
+/* YYLEX -- calling `yylex' with the right arguments.  */
+
+#ifdef YYLEX_PARAM
+# define YYLEX yylex (&yylval, YYLEX_PARAM)
+#else
+# define YYLEX yylex (&yylval, qp)
+#endif
+
+/* Enable debugging if requested.  */
+#if YYDEBUG
+
+# ifndef YYFPRINTF
+#  include <stdio.h> /* INFRINGES ON USER NAME SPACE */
+#  define YYFPRINTF fprintf
+# endif
+
+# define YYDPRINTF(Args)			\
+do {						\
+  if (yydebug)					\
+    YYFPRINTF Args;				\
+} while (0)
+
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)		\
+do {								\
+  if (yydebug)							\
+    {								\
+      YYFPRINTF (stderr, "%s ", Title);				\
+      yysymprint (stderr, 					\
+                  Type, Value);	\
+      YYFPRINTF (stderr, "\n");					\
+    }								\
+} while (0)
+
+/*------------------------------------------------------------------.
+| yy_stack_print -- Print the state stack from its BOTTOM up to its |
+| TOP (included).                                                   |
+`------------------------------------------------------------------*/
+
+#if defined (__STDC__) || defined (__cplusplus)
+static void
+yy_stack_print (short int *bottom, short int *top)
+#else
+static void
+yy_stack_print (bottom, top)
+    short int *bottom;
+    short int *top;
+#endif
+{
+  YYFPRINTF (stderr, "Stack now");
+  for (/* Nothing. */; bottom <= top; ++bottom)
+    YYFPRINTF (stderr, " %d", *bottom);
+  YYFPRINTF (stderr, "\n");
+}
+
+# define YY_STACK_PRINT(Bottom, Top)				\
+do {								\
+  if (yydebug)							\
+    yy_stack_print ((Bottom), (Top));				\
+} while (0)
+
+
+/*------------------------------------------------.
+| Report that the YYRULE is going to be reduced.  |
+`------------------------------------------------*/
+
+#if defined (__STDC__) || defined (__cplusplus)
+static void
+yy_reduce_print (int yyrule)
+#else
+static void
+yy_reduce_print (yyrule)
+    int yyrule;
+#endif
+{
+  int yyi;
+  unsigned int yylno = yyrline[yyrule];
+  YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ",
+             yyrule - 1, yylno);
+  /* Print the symbols being reduced, and their result.  */
+  for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++)
+    YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]);
+  YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]);
+}
+
+# define YY_REDUCE_PRINT(Rule)		\
+do {					\
+  if (yydebug)				\
+    yy_reduce_print (Rule);		\
+} while (0)
+
+/* Nonzero means print parse trace.  It is left uninitialized so that
+   multiple parsers can coexist.  */
+int yydebug;
+#else /* !YYDEBUG */
+# define YYDPRINTF(Args)
+# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
+# define YY_STACK_PRINT(Bottom, Top)
+# define YY_REDUCE_PRINT(Rule)
+#endif /* !YYDEBUG */
+
+
+/* YYINITDEPTH -- initial size of the parser's stacks.  */
+#ifndef	YYINITDEPTH
+# define YYINITDEPTH 200
+#endif
+
+/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
+   if the built-in stack extension method is used).
+
+   Do not make this value too large; the results are undefined if
+   SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
+   evaluated with infinite-precision integer arithmetic.  */
+
+#ifndef YYMAXDEPTH
+# define YYMAXDEPTH 10000
+#endif
+
+
+
+#if YYERROR_VERBOSE
+
+# ifndef yystrlen
+#  if defined (__GLIBC__) && defined (_STRING_H)
+#   define yystrlen strlen
+#  else
+/* Return the length of YYSTR.  */
+static YYSIZE_T
+#   if defined (__STDC__) || defined (__cplusplus)
+yystrlen (const char *yystr)
+#   else
+yystrlen (yystr)
+     const char *yystr;
+#   endif
+{
+  register const char *yys = yystr;
+
+  while (*yys++ != '\0')
+    continue;
+
+  return yys - yystr - 1;
+}
+#  endif
+# endif
+
+# ifndef yystpcpy
+#  if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE)
+#   define yystpcpy stpcpy
+#  else
+/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
+   YYDEST.  */
+static char *
+#   if defined (__STDC__) || defined (__cplusplus)
+yystpcpy (char *yydest, const char *yysrc)
+#   else
+yystpcpy (yydest, yysrc)
+     char *yydest;
+     const char *yysrc;
+#   endif
+{
+  register char *yyd = yydest;
+  register const char *yys = yysrc;
+
+  while ((*yyd++ = *yys++) != '\0')
+    continue;
+
+  return yyd - 1;
+}
+#  endif
+# endif
+
+#endif /* !YYERROR_VERBOSE */
+
+
+
+#if YYDEBUG
+/*--------------------------------.
+| Print this symbol on YYOUTPUT.  |
+`--------------------------------*/
+
+#if defined (__STDC__) || defined (__cplusplus)
+static void
+yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep)
+#else
+static void
+yysymprint (yyoutput, yytype, yyvaluep)
+    FILE *yyoutput;
+    int yytype;
+    YYSTYPE *yyvaluep;
+#endif
+{
+  /* Pacify ``unused variable'' warnings.  */
+  (void) yyvaluep;
+
+  if (yytype < YYNTOKENS)
+    YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
+  else
+    YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
+
+
+# ifdef YYPRINT
+  if (yytype < YYNTOKENS)
+    YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
+# endif
+  switch (yytype)
+    {
+      default:
+        break;
+    }
+  YYFPRINTF (yyoutput, ")");
+}
+
+#endif /* ! YYDEBUG */
+/*-----------------------------------------------.
+| Release the memory associated to this symbol.  |
+`-----------------------------------------------*/
+
+#if defined (__STDC__) || defined (__cplusplus)
+static void
+yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
+#else
+static void
+yydestruct (yymsg, yytype, yyvaluep)
+    const char *yymsg;
+    int yytype;
+    YYSTYPE *yyvaluep;
+#endif
+{
+  /* Pacify ``unused variable'' warnings.  */
+  (void) yyvaluep;
+
+  if (!yymsg)
+    yymsg = "Deleting";
+  YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
+
+  switch (yytype)
+    {
+
+      default:
+        break;
+    }
+}
+
+
+/* Prevent warnings from -Wmissing-prototypes.  */
+
+#ifdef YYPARSE_PARAM
+# if defined (__STDC__) || defined (__cplusplus)
+int yyparse (void *YYPARSE_PARAM);
+# else
+int yyparse ();
+# endif
+#else /* ! YYPARSE_PARAM */
+#if defined (__STDC__) || defined (__cplusplus)
+int yyparse (QParser *qp);
+#else
+int yyparse ();
+#endif
+#endif /* ! YYPARSE_PARAM */
+
+
+
+
+
+
+/*----------.
+| yyparse.  |
+`----------*/
+
+#ifdef YYPARSE_PARAM
+# if defined (__STDC__) || defined (__cplusplus)
+int yyparse (void *YYPARSE_PARAM)
+# else
+int yyparse (YYPARSE_PARAM)
+  void *YYPARSE_PARAM;
+# endif
+#else /* ! YYPARSE_PARAM */
+#if defined (__STDC__) || defined (__cplusplus)
+int
+yyparse (QParser *qp)
+#else
+int
+yyparse (qp)
+    QParser *qp;
+#endif
+#endif
+{
+  /* The look-ahead symbol.  */
+int yychar;
+
+/* The semantic value of the look-ahead symbol.  */
+YYSTYPE yylval;
+
+/* Number of syntax errors so far.  */
+int yynerrs;
+
+  register int yystate;
+  register int yyn;
+  int yyresult;
+  /* Number of tokens to shift before error messages enabled.  */
+  int yyerrstatus;
+  /* Look-ahead token as an internal (translated) token number.  */
+  int yytoken = 0;
+
+  /* Three stacks and their tools:
+     `yyss': related to states,
+     `yyvs': related to semantic values,
+     `yyls': related to locations.
+
+     Refer to the stacks thru separate pointers, to allow yyoverflow
+     to reallocate them elsewhere.  */
+
+  /* The state stack.  */
+  short int yyssa[YYINITDEPTH];
+  short int *yyss = yyssa;
+  register short int *yyssp;
+
+  /* The semantic value stack.  */
+  YYSTYPE yyvsa[YYINITDEPTH];
+  YYSTYPE *yyvs = yyvsa;
+  register YYSTYPE *yyvsp;
+
+
+
+#define YYPOPSTACK   (yyvsp--, yyssp--)
+
+  YYSIZE_T yystacksize = YYINITDEPTH;
+
+  /* The variables used to return semantic value and location from the
+     action routines.  */
+  YYSTYPE yyval;
+
+
+  /* When reducing, the number of symbols on the RHS of the reduced
+     rule.  */
+  int yylen;
+
+  YYDPRINTF ((stderr, "Starting parse\n"));
+
+  yystate = 0;
+  yyerrstatus = 0;
+  yynerrs = 0;
+  yychar = YYEMPTY;		/* Cause a token to be read.  */
+
+  /* Initialize stack pointers.
+     Waste one element of value and location stack
+     so that they stay on the same level as the state stack.
+     The wasted elements are never initialized.  */
+
+  yyssp = yyss;
+  yyvsp = yyvs;
+
+
+  yyvsp[0] = yylval;
+
+  goto yysetstate;
+
+/*------------------------------------------------------------.
+| yynewstate -- Push a new state, which is found in yystate.  |
+`------------------------------------------------------------*/
+ yynewstate:
+  /* In all cases, when you get here, the value and location stacks
+     have just been pushed. so pushing a state here evens the stacks.
+     */
+  yyssp++;
+
+ yysetstate:
+  *yyssp = yystate;
+
+  if (yyss + yystacksize - 1 <= yyssp)
+    {
+      /* Get the current used size of the three stacks, in elements.  */
+      YYSIZE_T yysize = yyssp - yyss + 1;
+
+#ifdef yyoverflow
+      {
+	/* Give user a chance to reallocate the stack. Use copies of
+	   these so that the &'s don't force the real ones into
+	   memory.  */
+	YYSTYPE *yyvs1 = yyvs;
+	short int *yyss1 = yyss;
+
+
+	/* Each stack pointer address is followed by the size of the
+	   data in use in that stack, in bytes.  This used to be a
+	   conditional around just the two extra args, but that might
+	   be undefined if yyoverflow is a macro.  */
+	yyoverflow ("parser stack overflow",
+		    &yyss1, yysize * sizeof (*yyssp),
+		    &yyvs1, yysize * sizeof (*yyvsp),
+
+		    &yystacksize);
+
+	yyss = yyss1;
+	yyvs = yyvs1;
+      }
+#else /* no yyoverflow */
+# ifndef YYSTACK_RELOCATE
+      goto yyoverflowlab;
+# else
+      /* Extend the stack our own way.  */
+      if (YYMAXDEPTH <= yystacksize)
+	goto yyoverflowlab;
+      yystacksize *= 2;
+      if (YYMAXDEPTH < yystacksize)
+	yystacksize = YYMAXDEPTH;
+
+      {
+	short int *yyss1 = yyss;
+	union yyalloc *yyptr =
+	  (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
+	if (! yyptr)
+	  goto yyoverflowlab;
+	YYSTACK_RELOCATE (yyss);
+	YYSTACK_RELOCATE (yyvs);
+
+#  undef YYSTACK_RELOCATE
+	if (yyss1 != yyssa)
+	  YYSTACK_FREE (yyss1);
+      }
+# endif
+#endif /* no yyoverflow */
+
+      yyssp = yyss + yysize - 1;
+      yyvsp = yyvs + yysize - 1;
+
+
+      YYDPRINTF ((stderr, "Stack size increased to %lu\n",
+		  (unsigned long int) yystacksize));
+
+      if (yyss + yystacksize - 1 <= yyssp)
+	YYABORT;
+    }
+
+  YYDPRINTF ((stderr, "Entering state %d\n", yystate));
+
+  goto yybackup;
+
+/*-----------.
+| yybackup.  |
+`-----------*/
+yybackup:
+
+/* Do appropriate processing given the current state.  */
+/* Read a look-ahead token if we need one and don't already have one.  */
+/* yyresume: */
+
+  /* First try to decide what to do without reference to look-ahead token.  */
+
+  yyn = yypact[yystate];
+  if (yyn == YYPACT_NINF)
+    goto yydefault;
+
+  /* Not known => get a look-ahead token if don't already have one.  */
+
+  /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol.  */
+  if (yychar == YYEMPTY)
+    {
+      YYDPRINTF ((stderr, "Reading a token: "));
+      yychar = YYLEX;
+    }
+
+  if (yychar <= YYEOF)
+    {
+      yychar = yytoken = YYEOF;
+      YYDPRINTF ((stderr, "Now at end of input.\n"));
+    }
+  else
+    {
+      yytoken = YYTRANSLATE (yychar);
+      YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
+    }
+
+  /* If the proper action on seeing token YYTOKEN is to reduce or to
+     detect an error, take that action.  */
+  yyn += yytoken;
+  if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
+    goto yydefault;
+  yyn = yytable[yyn];
+  if (yyn <= 0)
+    {
+      if (yyn == 0 || yyn == YYTABLE_NINF)
+	goto yyerrlab;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+
+  if (yyn == YYFINAL)
+    YYACCEPT;
+
+  /* Shift the look-ahead token.  */
+  YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
+
+  /* Discard the token being shifted unless it is eof.  */
+  if (yychar != YYEOF)
+    yychar = YYEMPTY;
+
+  *++yyvsp = yylval;
+
+
+  /* Count tokens shifted since error; after three, turn off error
+     status.  */
+  if (yyerrstatus)
+    yyerrstatus--;
+
+  yystate = yyn;
+  goto yynewstate;
+
+
+/*-----------------------------------------------------------.
+| yydefault -- do the default action for the current state.  |
+`-----------------------------------------------------------*/
+yydefault:
+  yyn = yydefact[yystate];
+  if (yyn == 0)
+    goto yyerrlab;
+  goto yyreduce;
+
+
+/*-----------------------------.
+| yyreduce -- Do a reduction.  |
+`-----------------------------*/
+yyreduce:
+  /* yyn is the number of a rule to reduce with.  */
+  yylen = yyr2[yyn];
+
+  /* If YYLEN is nonzero, implement the default value of the action:
+     `$$ = $1'.
+
+     Otherwise, the following line sets YYVAL to garbage.
+     This behavior is undocumented and Bison
+     users should not rely upon it.  Assigning to YYVAL
+     unconditionally makes the parser a bit smaller, and it avoids a
+     GCC warning that YYVAL may be used uninitialized.  */
+  yyval = yyvsp[1-yylen];
+
+
+  YY_REDUCE_PRINT (yyn);
+  switch (yyn)
+    {
+        case 2:
+#line 86 "src/query_parser/q_parser.y"
+    { qp->result = (yyval.query) = NULL; }
+    break;
+
+  case 3:
+#line 87 "src/query_parser/q_parser.y"
+    { qp->result = (yyval.query) = get_bool_q((yyvsp[0].array)); }
+    break;
+
+  case 4:
+#line 89 "src/query_parser/q_parser.y"
+    { (yyval.array) = first_cls((yyvsp[0].bcls)); }
+    break;
+
+  case 5:
+#line 90 "src/query_parser/q_parser.y"
+    { (yyval.array) = add_and_cls((yyvsp[-2].array), (yyvsp[0].bcls)); }
+    break;
+
+  case 6:
+#line 91 "src/query_parser/q_parser.y"
+    { (yyval.array) = add_or_cls((yyvsp[-2].array), (yyvsp[0].bcls)); }
+    break;
+
+  case 7:
+#line 92 "src/query_parser/q_parser.y"
+    { (yyval.array) = add_default_cls(qp, (yyvsp[-1].array), (yyvsp[0].bcls)); }
+    break;
+
+  case 8:
+#line 94 "src/query_parser/q_parser.y"
+    { (yyval.bcls) = get_bool_cls((yyvsp[0].query), BC_MUST); }
+    break;
+
+  case 9:
+#line 95 "src/query_parser/q_parser.y"
+    { (yyval.bcls) = get_bool_cls((yyvsp[0].query), BC_MUST_NOT); }
+    break;
+
+  case 10:
+#line 96 "src/query_parser/q_parser.y"
+    { (yyval.bcls) = get_bool_cls((yyvsp[0].query), BC_SHOULD); }
+    break;
+
+  case 12:
+#line 99 "src/query_parser/q_parser.y"
+    { if ((yyvsp[-2].query)) sscanf((yyvsp[0].str),"%f",&((yyvsp[-2].query)->boost)); (yyval.query)=(yyvsp[-2].query); }
+    break;
+
+  case 14:
+#line 102 "src/query_parser/q_parser.y"
+    { (yyval.query) = get_bool_q((yyvsp[-1].array)); }
+    break;
+
+  case 19:
+#line 108 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_term_q(qp, field, (yyvsp[0].str))); }
+    break;
+
+  case 20:
+#line 109 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_fuzzy_q(qp, field, (yyvsp[-2].str), (yyvsp[0].str))); }
+    break;
+
+  case 21:
+#line 110 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_fuzzy_q(qp, field, (yyvsp[-1].str), NULL)); }
+    break;
+
+  case 22:
+#line 112 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_wild_q(qp, field, (yyvsp[0].str))); }
+    break;
+
+  case 23:
+#line 114 "src/query_parser/q_parser.y"
+    { qp->fields = qp->def_fields; }
+    break;
+
+  case 24:
+#line 115 "src/query_parser/q_parser.y"
+    { (yyval.query) = (yyvsp[-1].query); }
+    break;
+
+  case 25:
+#line 116 "src/query_parser/q_parser.y"
+    { qp->fields = qp->all_fields; }
+    break;
+
+  case 26:
+#line 116 "src/query_parser/q_parser.y"
+    {qp->fields = qp->def_fields;}
+    break;
+
+  case 27:
+#line 117 "src/query_parser/q_parser.y"
+    { (yyval.query) = (yyvsp[-1].query); }
+    break;
+
+  case 28:
+#line 119 "src/query_parser/q_parser.y"
+    { (yyval.hashset) = first_field(qp, (yyvsp[0].str)); }
+    break;
+
+  case 29:
+#line 120 "src/query_parser/q_parser.y"
+    { (yyval.hashset) = add_field(qp, (yyvsp[0].str));}
+    break;
+
+  case 30:
+#line 122 "src/query_parser/q_parser.y"
+    { (yyval.query) = get_phrase_q(qp, (yyvsp[-1].phrase), NULL); }
+    break;
+
+  case 31:
+#line 123 "src/query_parser/q_parser.y"
+    { (yyval.query) = get_phrase_q(qp, (yyvsp[-3].phrase), (yyvsp[0].str)); }
+    break;
+
+  case 32:
+#line 124 "src/query_parser/q_parser.y"
+    { (yyval.query) = NULL; }
+    break;
+
+  case 33:
+#line 125 "src/query_parser/q_parser.y"
+    { (yyval.query) = NULL; }
+    break;
+
+  case 34:
+#line 127 "src/query_parser/q_parser.y"
+    { (yyval.phrase) = ph_first_word((yyvsp[0].str)); }
+    break;
+
+  case 35:
+#line 128 "src/query_parser/q_parser.y"
+    { (yyval.phrase) = ph_first_word(NULL); }
+    break;
+
+  case 36:
+#line 129 "src/query_parser/q_parser.y"
+    { (yyval.phrase) = ph_add_word((yyvsp[-1].phrase), (yyvsp[0].str)); }
+    break;
+
+  case 37:
+#line 130 "src/query_parser/q_parser.y"
+    { (yyval.phrase) = ph_add_word((yyvsp[-2].phrase), NULL); }
+    break;
+
+  case 38:
+#line 131 "src/query_parser/q_parser.y"
+    { (yyval.phrase) = ph_add_multi_word((yyvsp[-2].phrase), (yyvsp[0].str));  }
+    break;
+
+  case 39:
+#line 133 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_range_q(field, (yyvsp[-2].str),  (yyvsp[-1].str),  true,  true)); }
+    break;
+
+  case 40:
+#line 134 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_range_q(field, (yyvsp[-2].str),  (yyvsp[-1].str),  true,  false)); }
+    break;
+
+  case 41:
+#line 135 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_range_q(field, (yyvsp[-2].str),  (yyvsp[-1].str),  false, true)); }
+    break;
+
+  case 42:
+#line 136 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_range_q(field, (yyvsp[-2].str),  (yyvsp[-1].str),  false, false)); }
+    break;
+
+  case 43:
+#line 137 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_range_q(field, NULL,(yyvsp[-1].str),  false, false)); }
+    break;
+
+  case 44:
+#line 138 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_range_q(field, NULL,(yyvsp[-1].str),  false, true)); }
+    break;
+
+  case 45:
+#line 139 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_range_q(field, (yyvsp[-1].str),  NULL,true,  false)); }
+    break;
+
+  case 46:
+#line 140 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_range_q(field, (yyvsp[-1].str),  NULL,false, false)); }
+    break;
+
+  case 47:
+#line 141 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_range_q(field, NULL,(yyvsp[0].str),  false, false)); }
+    break;
+
+  case 48:
+#line 142 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_range_q(field, NULL,(yyvsp[0].str),  false, true)); }
+    break;
+
+  case 49:
+#line 143 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_range_q(field, (yyvsp[0].str),  NULL,true,  false)); }
+    break;
+
+  case 50:
+#line 144 "src/query_parser/q_parser.y"
+    { FLDS((yyval.query), get_range_q(field, (yyvsp[0].str),  NULL,false, false)); }
+    break;
+
+
+    }
+
+/* Line 1037 of yacc.c.  */
+#line 1371 "y.tab.c"
+
+  yyvsp -= yylen;
+  yyssp -= yylen;
+
+
+  YY_STACK_PRINT (yyss, yyssp);
+
+  *++yyvsp = yyval;
+
+
+  /* Now `shift' the result of the reduction.  Determine what state
+     that goes to, based on the state we popped back to and the rule
+     number reduced by.  */
+
+  yyn = yyr1[yyn];
+
+  yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
+  if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+    yystate = yytable[yystate];
+  else
+    yystate = yydefgoto[yyn - YYNTOKENS];
+
+  goto yynewstate;
+
+
+/*------------------------------------.
+| yyerrlab -- here on detecting error |
+`------------------------------------*/
+yyerrlab:
+  /* If not already recovering from an error, report this error.  */
+  if (!yyerrstatus)
+    {
+      ++yynerrs;
+#if YYERROR_VERBOSE
+      yyn = yypact[yystate];
+
+      if (YYPACT_NINF < yyn && yyn < YYLAST)
+	{
+	  YYSIZE_T yysize = 0;
+	  int yytype = YYTRANSLATE (yychar);
+	  const char* yyprefix;
+	  char *yymsg;
+	  int yyx;
+
+	  /* Start YYX at -YYN if negative to avoid negative indexes in
+	     YYCHECK.  */
+	  int yyxbegin = yyn < 0 ? -yyn : 0;
+
+	  /* Stay within bounds of both yycheck and yytname.  */
+	  int yychecklim = YYLAST - yyn;
+	  int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
+	  int yycount = 0;
+
+	  yyprefix = ", expecting ";
+	  for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+	    if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
+	      {
+		yysize += yystrlen (yyprefix) + yystrlen (yytname [yyx]);
+		yycount += 1;
+		if (yycount == 5)
+		  {
+		    yysize = 0;
+		    break;
+		  }
+	      }
+	  yysize += (sizeof ("syntax error, unexpected ")
+		     + yystrlen (yytname[yytype]));
+	  yymsg = (char *) YYSTACK_ALLOC (yysize);
+	  if (yymsg != 0)
+	    {
+	      char *yyp = yystpcpy (yymsg, "syntax error, unexpected ");
+	      yyp = yystpcpy (yyp, yytname[yytype]);
+
+	      if (yycount < 5)
+		{
+		  yyprefix = ", expecting ";
+		  for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+		    if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
+		      {
+			yyp = yystpcpy (yyp, yyprefix);
+			yyp = yystpcpy (yyp, yytname[yyx]);
+			yyprefix = " or ";
+		      }
+		}
+	      yyerror (qp, yymsg);
+	      YYSTACK_FREE (yymsg);
+	    }
+	  else
+	    yyerror (qp, "syntax error; also virtual memory exhausted");
+	}
+      else
+#endif /* YYERROR_VERBOSE */
+	yyerror (qp, "syntax error");
+    }
+
+
+
+  if (yyerrstatus == 3)
+    {
+      /* If just tried and failed to reuse look-ahead token after an
+	 error, discard it.  */
+
+      if (yychar <= YYEOF)
+        {
+          /* If at end of input, pop the error token,
+	     then the rest of the stack, then return failure.  */
+	  if (yychar == YYEOF)
+	     for (;;)
+	       {
+
+		 YYPOPSTACK;
+		 if (yyssp == yyss)
+		   YYABORT;
+		 yydestruct ("Error: popping",
+                             yystos[*yyssp], yyvsp);
+	       }
+        }
+      else
+	{
+	  yydestruct ("Error: discarding", yytoken, &yylval);
+	  yychar = YYEMPTY;
+	}
+    }
+
+  /* Else will try to reuse look-ahead token after shifting the error
+     token.  */
+  goto yyerrlab1;
+
+
+/*---------------------------------------------------.
+| yyerrorlab -- error raised explicitly by YYERROR.  |
+`---------------------------------------------------*/
+yyerrorlab:
+
+#ifdef __GNUC__
+  /* Pacify GCC when the user code never invokes YYERROR and the label
+     yyerrorlab therefore never appears in user code.  */
+  if (0)
+     goto yyerrorlab;
+#endif
+
+yyvsp -= yylen;
+  yyssp -= yylen;
+  yystate = *yyssp;
+  goto yyerrlab1;
+
+
+/*-------------------------------------------------------------.
+| yyerrlab1 -- common code for both syntax error and YYERROR.  |
+`-------------------------------------------------------------*/
+yyerrlab1:
+  yyerrstatus = 3;	/* Each real token shifted decrements this.  */
+
+  for (;;)
+    {
+      yyn = yypact[yystate];
+      if (yyn != YYPACT_NINF)
+	{
+	  yyn += YYTERROR;
+	  if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
+	    {
+	      yyn = yytable[yyn];
+	      if (0 < yyn)
+		break;
+	    }
+	}
+
+      /* Pop the current state because it cannot handle the error token.  */
+      if (yyssp == yyss)
+	YYABORT;
+
+
+      yydestruct ("Error: popping", yystos[yystate], yyvsp);
+      YYPOPSTACK;
+      yystate = *yyssp;
+      YY_STACK_PRINT (yyss, yyssp);
+    }
+
+  if (yyn == YYFINAL)
+    YYACCEPT;
+
+  *++yyvsp = yylval;
+
+
+  /* Shift the error token. */
+  YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
+
+  yystate = yyn;
+  goto yynewstate;
+
+
+/*-------------------------------------.
+| yyacceptlab -- YYACCEPT comes here.  |
+`-------------------------------------*/
+yyacceptlab:
+  yyresult = 0;
+  goto yyreturn;
+
+/*-----------------------------------.
+| yyabortlab -- YYABORT comes here.  |
+`-----------------------------------*/
+yyabortlab:
+  yydestruct ("Error: discarding lookahead",
+              yytoken, &yylval);
+  yychar = YYEMPTY;
+  yyresult = 1;
+  goto yyreturn;
+
+#ifndef yyoverflow
+/*----------------------------------------------.
+| yyoverflowlab -- parser overflow comes here.  |
+`----------------------------------------------*/
+yyoverflowlab:
+  yyerror (qp, "parser stack overflow");
+  yyresult = 2;
+  /* Fall through.  */
+#endif
+
+yyreturn:
+#ifndef yyoverflow
+  if (yyss != yyssa)
+    YYSTACK_FREE (yyss);
+#endif
+  return yyresult;
+}
+
+
+#line 146 "src/query_parser/q_parser.y"
+
+
+const char *special_char = "&:()[]{}!+\"~^-|<>=*?";
+const char *not_word =  " \t&:()[]{}!+\"~^-|<>=";
+
+int get_word(YYSTYPE *lvalp, QParser *qp)
+{
+  bool is_wild = false;
+  int len;
+  char c;
+  char *buf = qp->buf[qp->buf_index];
+  char *bufp = buf;
+  qp->buf_index = (qp->buf_index + 1) % CONC_WORDS;
+
+  qp->qstrp--; /* need to back up one character */
+  
+  while (!strchr(not_word, (c=*qp->qstrp++))) {
+    switch (c) {
+      case '\\':
+        if ((c=*qp->qstrp) == ' ' && c != '\t' && c != '\0') {
+          *bufp++ = '\\';
+        } else {
+          *bufp++ = c;
+          qp->qstrp++;
+        }
+        break;
+      case '*': case '?':
+        is_wild = true;
+      default:
+        *bufp++ = c;
+    }
+  }
+  qp->qstrp--;
+  /* check for keywords. There are only four so we have a bit of a hack which
+   * just checks for all of them. */
+  *bufp = '\0';
+  len = bufp - buf;
+  if (len == 3) {
+    if (buf[0] == 'A' && buf[1] == 'N' && buf[2] == 'D') return AND;
+    if (buf[0] == 'N' && buf[1] == 'O' && buf[2] == 'T') return NOT;
+    if (buf[0] == 'R' && buf[1] == 'E' && buf[2] == 'Q') return REQ;
+  }
+  if (len == 2 && buf[0] == 'O' && buf[1] == 'R') return OR;
+
+  /* found a word so return it. */
+  lvalp->str = buf;
+  if (is_wild) return WILD_STR;
+  return WORD;
+}
+
+int yylex(YYSTYPE *lvalp, QParser *qp)
+{
+  char c, nc;
+
+  while ((c=*qp->qstrp++) == ' ' || c == '\t')
+    ;
+  if (c == '\0')
+    return 0;
+
+  if (strchr(special_char, c)) {   /* comment */
+    nc = *qp->qstrp;
+    switch (c) {
+      case '-': case '!': return NOT;
+      case '+': return REQ;
+      case '*':
+        if (nc == ':') return c;
+        break;
+      case '&':
+        if (nc == '&') {
+          qp->qstrp++;
+          return AND;
+        }
+        break; /* Don't return single & character. Use in word. */
+      case '|':
+        if (nc == '|') {
+          qp->qstrp++;
+          return OR;
+        }
+      default:
+        return c;
+    }
+  }
+
+  return get_word(lvalp, qp);
+}
+
+int yyerror(QParser *qp, char const *msg)
+{
+  if (!qp->handle_parse_errors) {
+    if (qp->clean_str) free(qp->qstr);
+    eprintf(PARSE_ERROR, msg);
+  }
+  return 0;
+}
+
+
+Query *get_bool_q(Array *bclauses)
+{
+  Query *q;
+  BooleanQuery *bq;
+  BooleanClause *bc;
+
+  if (bclauses->size == 0) {
+    ary_destroy(bclauses);
+    q = NULL;
+  } else if (bclauses->size == 1) {
+    bc = (BooleanClause *)bclauses->elems[0];
+    q = bc->query;
+    free(bc);
+    ary_destroy(bclauses);
+  } else {
+    q = bq_create(false);
+    /* copy clauses into query */
+    bq = (BooleanQuery *)q->data;
+    bq->clause_cnt = bclauses->size;
+    bq->clause_capa = bclauses->allocated;
+    free(bq->clauses);
+    bq->clauses = (BooleanClause **)bclauses->elems;
+    free(bclauses);
+  }
+  return q;
+}
+
+
+Array *first_cls(BooleanClause *cls)
+{
+  Array *clauses = ary_create(0, NULL);
+  if (cls) ary_append(clauses, cls);
+  return clauses;
+}
+
+Array *add_and_cls(Array *clauses, BooleanClause *clause)
+{
+  if (clause) {
+    BooleanClause *last_cl;
+    if (clauses->size == 1) {
+      last_cl = clauses->elems[0];
+      if (!last_cl->is_prohibited)  bc_set_occur(last_cl, BC_MUST);
+    }
+
+    if (!clause->is_prohibited) bc_set_occur(clause, BC_MUST);
+    ary_append(clauses, clause);
+  }
+  return clauses;
+}
+
+Array *add_or_cls(Array *clauses, BooleanClause *clause)
+{
+  if (clause) ary_append(clauses, clause);
+  return clauses;
+}
+
+Array *add_default_cls(QParser *qp, Array *clauses, BooleanClause *clause)
+{
+  if (qp->or_default) {
+    add_or_cls(clauses, clause);
+  } else {
+    add_and_cls(clauses, clause);
+  }
+  return clauses;
+}
+
+BooleanClause *get_bool_cls(Query *q, unsigned int occur)
+{
+  if (q) return bc_create(q, occur);
+  else return NULL;
+}
+
+Query *get_term_q(QParser *qp, char *field, char *word)
+{
+  Query *q;
+  Token *token;
+  TokenStream *stream = a_get_ts(qp->analyzer, field, word);
+
+  if ((token = ts_next(stream)) == NULL) {
+    q = NULL;
+  } else {
+    Term *term = term_create(field, token->text);
+    if ((token = ts_next(stream)) == NULL) {
+      q = tq_create(term);
+    } else {
+      q = phq_create();
+      phq_add_term(q, term, 0);
+      do {
+        phq_add_term(q, term_create(field, token->text), token->pos_inc);
+      } while ((token = ts_next(stream)) != NULL);
+    }
+  }
+  return q;
+}
+
+Query *get_fuzzy_q(QParser *qp, char *field, char *word, char *slop_str)
+{
+  Query *q;
+  Token *token;
+  TokenStream *stream = a_get_ts(qp->analyzer, field, word);
+
+  if ((token = ts_next(stream)) == NULL) {
+    q = NULL;
+  } else {
+    /* it only makes sense to find one term in a fuzzy query */
+    Term *term = term_create(field, token->text);
+    if (slop_str) {
+      float slop;
+      sscanf(slop_str, "%f", &slop);
+      q = fuzq_create_mp(term, slop, DEF_PRE_LEN);
+    } else {
+      q = fuzq_create(term);
+    }
+  }
+  return q;
+}
+
+Query *get_wild_q(QParser *qp, char *field, char *pattern)
+{
+  if (qp->wild_lower) lower_str(pattern);
+  return wcq_create(term_create(field, pattern));;
+}
+
+HashSet *add_field(QParser *qp, char *field)
+{
+  char *orig_field;
+  if ((orig_field = hs_orig(qp->all_fields, field)) != NULL) {
+    hs_add(qp->fields, orig_field);
+  } else if (qp->allow_any_fields) {
+    field = estrdup(field);
+    hs_add(qp->all_fields, field);
+    hs_add(qp->fields, field);
+  }
+  return qp->fields;
+}
+
+HashSet *first_field(QParser *qp, char *field)
+{
+  qp->fields = qp->fields_buf;
+  qp->fields->size = 0;
+  h_clear(qp->fields->ht);
+  return add_field(qp, field);
+}
+
+void ph_destroy(Phrase *self)
+{
+  int i, j;
+  for (i = 0; i < self->cnt; i++) {
+    for (j = 0; j < self->w_cnt[i]; j++) {
+      free(self->words[i][j]);
+    }
+    free(self->words[i]);
+  }
+  free(self->words);
+  free(self->w_cnt);
+  free(self->w_capa);
+  free(self);
+}
+
+
+Phrase *ph_create()
+{
+  Phrase *self = ALLOC(Phrase);
+  self->cnt = 0;
+  self->capa = PHRASE_INIT_CAPA;
+  self->words = ALLOC_N(char **, PHRASE_INIT_CAPA);
+  self->w_cnt = ALLOC_N(int, PHRASE_INIT_CAPA);
+  self->w_capa = ALLOC_N(int, PHRASE_INIT_CAPA);
+  return self;
+}
+
+Phrase *ph_first_word(char *word)
+{
+  Phrase *self = ph_create();
+  if (word) { /* no point in adding NULL in start */
+    self->words[0] = ALLOC(char *);
+    self->words[0][0] = estrdup(word);
+    self->w_cnt[0] = self->w_capa[0] = 1;
+    self->cnt = 1;
+  }
+  return self;
+}
+
+Phrase *ph_add_word(Phrase *self, char *word)
+{
+  int i;
+  if (self->cnt == self->capa) {
+    self->capa <<= 1;
+    REALLOC_N(self->words, char **, self->capa);
+    REALLOC_N(self->w_cnt, int, self->capa);
+    REALLOC_N(self->w_capa, int, self->capa);
+  }
+  i = self->cnt;
+  self->cnt++;
+  self->words[i] = ALLOC(char *);
+  self->words[i][0] = word ? estrdup(word) : NULL;
+  self->w_cnt[i] = self->w_capa[i] = 1;
+  return self;
+}
+
+Phrase *ph_add_multi_word(Phrase *self, char *word)
+{
+  int i = self->cnt - 1;
+
+  if (!word) return self; /* no point in adding NULL in multi */
+
+  if (self->w_cnt[i] >= self->w_capa[i]) {
+    self->w_capa[i] <<= 1;
+    REALLOC_N(self->words[i], char *, self->w_capa[i]);
+  }
+  self->words[i][self->w_cnt[i]] = estrdup(word);
+  self->w_cnt[i]++;
+  return self;
+}
+
+Query *get_normal_phrase_query(QParser *qp, char *field, Phrase *phrase, int slop)
+{
+  int pos_inc = 0;
+  int i;
+  Token *token;
+  TokenStream *stream;
+  char *word;
+
+  Query *pq = phq_create();
+  ((PhraseQuery *)pq->data)->slop = slop;
+
+  for (i = 0; i < phrase->cnt; i++) {
+    word = phrase->words[i][0];
+    if (!word) {
+      pos_inc++;
+    } else {
+      stream = a_get_ts(qp->analyzer, field, word);
+      while ((token = ts_next(stream))) {
+        phq_add_term(pq, term_create(field, token->text),
+                     token->pos_inc + pos_inc);
+        pos_inc = 0;
+      }
+    }
+  }
+  return pq;
+}
+
+Query *get_multi_phrase_query(QParser *qp, char *field, Phrase *phrase, int slop)
+{
+  int i, j;
+  int pos_inc = 0;
+  Token *token;
+  TokenStream *stream;
+  char *word;
+  Term **terms = NULL;
+  int t_cnt;
+
+  Query *mpq = mphq_create();
+  ((MultiPhraseQuery *)mpq->data)->slop = slop;
+
+  for (i = 0; i < phrase->cnt; i++) {
+    word = phrase->words[i][0];
+    if (!word) {
+      pos_inc++;
+    } else {
+      t_cnt = phrase->w_cnt[i];
+      if (t_cnt > 1) {
+        terms = ALLOC_N(Term *, t_cnt);
+        for (j = 0; j < t_cnt; j++) {
+          word = phrase->words[i][j];
+          stream = a_get_ts(qp->analyzer, field, word);
+          if ((token = ts_next(stream))) {
+            terms[j] = term_create(field, token->text);
+          } else {
+            t_cnt--; j--;
+          }
+        }
+        /* must advance at least one */
+        mphq_add_terms(mpq, terms, t_cnt, pos_inc + 1);
+      } else {
+        stream = a_get_ts(qp->analyzer, field, word);
+        while ((token = ts_next(stream))) {
+          terms = ALLOC(Term *);
+          terms[0] = term_create(field, token->text);
+          mphq_add_terms(mpq, terms, 1, token->pos_inc + pos_inc);
+          pos_inc = 0;
+        }
+      }
+    }
+  }
+  return mpq;
+}
+
+Query *get_phrase_q(QParser *qp, Phrase *phrase, char *slop_str)
+{
+  Query *q;
+  int i, j;
+  int slop;
+
+  if (phrase->cnt == 0) {
+    q = NULL;
+  } else if (phrase->cnt == 1) {
+    if (phrase->w_cnt[0] == 1) {
+      FLDS(q, get_term_q(qp, field, phrase->words[0][0]));
+    } else {
+      Query *bq;
+      q = bq_create(false);
+      for (j = 0; j < phrase->w_cnt[0]; j++) {
+        FLDS(bq, tq_create(term_create(field, phrase->words[0][j])));
+        if (bq) bq_add_query(q, bq, BC_SHOULD);
+      }
+    }
+  } else {
+    bool multi_phrase = false;
+    for (i = 0; i < phrase->cnt; i++) {
+      if (phrase->w_cnt[i] > 1) multi_phrase = true;
+    }
+    slop = qp->def_slop;
+    if (slop_str) sscanf(slop_str, "%d", &slop);
+    if (multi_phrase) {
+      FLDS(q, get_multi_phrase_query(qp, field, phrase, slop));
+    } else {
+      FLDS(q, get_normal_phrase_query(qp, field, phrase, slop));
+    }
+  }
+  ph_destroy(phrase);
+  return q;
+}
+
+Query *get_range_q(char *field, char *from, char *to, bool inc_lower, bool inc_upper)
+{
+  return rq_create(field, from, to, inc_lower, inc_upper);
+}
+
+void qp_destroy(void *p)
+{
+  QParser *self = (QParser *)p;
+  if (self->close_def_fields) hs_destroy_all(self->def_fields);
+  hs_destroy_all(self->all_fields);
+  hs_destroy(self->fields_buf);
+  free(self);
+}
+
+QParser *qp_create(HashSet *all_fields, HashSet *def_fields, Analyzer *analyzer)
+{
+  int i;
+  QParser *self = ALLOC(QParser);
+  self->or_default = true;
+  self->wild_lower = true;
+  self->clean_str = false;
+  self->handle_parse_errors = false;
+  self->allow_any_fields = false;
+  self->def_slop = 0;
+  self->fields_buf = hs_str_create(NULL);
+  self->all_fields = all_fields;
+  if (def_fields) {
+    self->def_fields = def_fields;
+    for (i = 0; i < self->def_fields->size; i++) {
+      if (!hs_exists(self->all_fields, self->def_fields->elems[i])) {
+        hs_add(self->all_fields, estrdup(self->def_fields->elems[i]));
+      }
+    }
+    self->close_def_fields = true;
+  } else {
+    self->def_fields = all_fields;
+    self->close_def_fields = false;
+  }
+  self->fields = self->def_fields;
+  /* make sure all_fields contains the default fields */
+  self->analyzer = analyzer;
+  self->buf_index = 0;
+  return self;
+}
+
+/* these chars have meaning within phrases */
+static const char *PHRASE_CHARS = "<>|\"";
+
+void str_insert(char *str, int len, char chr)
+{
+  memmove(str+1, str, len*sizeof(char));
+  *str = chr;
+}
+
+char *qp_clean_str(char *str)
+{
+  int b, pb = -1;
+  int br_cnt = 0;
+  bool quote_open = false;
+  char *sp, *nsp;
+
+  /* leave a little extra */
+  char *new_str = ALLOC_N(char, strlen(str)*2 + 1);
+
+  for (sp = str, nsp = new_str; *sp; sp++) {
+    b = *sp;
+    /* ignore escaped characters */
+    if (pb == '\\') {
+      if (quote_open && index(PHRASE_CHARS, b)) {
+        *nsp++ = '\\'; /* this was left off the first time through */
+      }
+
+      *nsp++ = b;
+      /* \\ has escaped itself so has no power. Assign pb random char : */
+      pb = ((b == '\\') ? ':' : b);
+      continue;
+    }
+    switch (b) {
+      case '\\':
+        if (!quote_open) /* We do our own escaping below */
+          *nsp++ = b;
+        break;
+      case '"':
+        quote_open = !quote_open;
+        *nsp++ = b;
+        break;
+      case '(':
+        if (!quote_open) {
+          br_cnt++;
+        } else {
+          *nsp++ = '\\';
+        }
+        *nsp++ = b;
+        break;
+      case ')':
+        if (!quote_open) {
+          if (br_cnt == 0) {
+            str_insert(new_str, nsp - new_str, '(');
+            nsp++;
+          } else {
+            br_cnt--;
+          }
+        } else {
+          *nsp++ = '\\';
+        }
+        *nsp++ = b;
+        break;
+      case '>':
+        if (quote_open) {
+          if (pb == '<') {
+            /* remove the escape character */
+            nsp--;
+            nsp[-1] = '<';
+          } else {
+            *nsp++ = '\\';
+          }
+        }
+        *nsp++ = b;
+        break;
+      default:
+        if (quote_open) {
+          if (index(special_char, b) && b != '|') {
+            *nsp++ = '\\';
+          }
+        }
+        *nsp++ = b;
+    }
+    pb = b;
+  }
+  if (quote_open) *nsp++ = '"';
+  for (;br_cnt > 0; br_cnt--) {
+    *nsp++ = ')';
+  }
+  *nsp = '\0';
+  return new_str;  
+}
+
+Query *qp_get_bad_query(QParser *qp, char *str)
+{
+  Query *q;
+  FLDS(q, get_term_q(qp, field, str));
+  return q;
+}
+
+Query *qp_parse(QParser *self, char *qstr)
+{
+  if (self->clean_str) {
+    self->qstrp = self->qstr = qp_clean_str(qstr);
+  } else {
+    self->qstrp = self->qstr = qstr;
+  }
+  self->fields = self->def_fields;
+  self->result = NULL;
+  yyparse(self);
+  if (!self->result && self->handle_parse_errors)
+    self->result = qp_get_bad_query(self, self->qstr);
+  if (!self->result) self->result = bq_create(false);
+  if (self->clean_str) free(self->qstr);
+  return self->result;
+}
+
+