Index: lucene/queryparser/aqp-macros.xml
===================================================================
--- lucene/queryparser/aqp-macros.xml	(revision 0)
+++ lucene/queryparser/aqp-macros.xml	(revision 0)
@@ -0,0 +1,258 @@
+<?xml version="1.0"?>
+
+<!--
+    Licensed to the Apache Software Foundation (ASF) under one or more
+    contributor license agreements.  See the NOTICE file distributed with
+    this work for additional information regarding copyright ownership.
+    The ASF licenses this file to You under the Apache License, Version 2.0
+    the "License"); you may not use this file except in compliance with
+    the License.  You may obtain a copy of the License at
+ 
+        http://www.apache.org/licenses/LICENSE-2.0
+ 
+    Unless required by applicable law or agreed to in writing, software
+    distributed under the License is distributed on an "AS IS" BASIS,
+    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+    See the License for the specific language governing permissions and
+    limitations under the License.
+ -->
+
+<project name="aqp-macros" >
+
+  <import file="../module-build.xml"/>
+  
+	<macrodef name="clean-parser">
+        <attribute name="grammar-name"/>
+        <attribute name="parser-dir"/>
+        <sequential>
+            <delete dir="@{grammar-dir}" failonerror="false">
+                <fileset dir="@{parser-dir}">
+                    <include name="@{grammar-name}*.java" />
+                    <include name="@{grammar-name}*.class" />
+                    <include name="@{grammar-name}*.tokens" />
+                </fileset>
+            </delete>
+        </sequential>
+    </macrodef>
+
+    <macrodef name="generate-grammar">
+        <attribute name="grammar-name"/>
+        <attribute name="grammar-dir"/>
+        <attribute name="build-dir"/>
+        <attribute name="parser-dir"/>
+        <attribute name="classpathref"/>
+    	  <attribute name="compilerarg" default="-nowarn"/> <!-- Because parser is a generated code, we have little control over it and  disable the warnings -->
+        <sequential>
+            
+            <clean-parser parser-dir="@{parser-dir}" grammar-name="@{grammar-name}"/>
+            <clean-parser parser-dir="@{build-dir}" grammar-name="@{grammar-name}"/>
+            
+            <echo>
+                Regenerating: @{grammar-name}
+                Output: @{parser-dir}
+            </echo>
+
+            
+            <java classpathref="@{classpathref}"
+                    classname="org.antlr.Tool"
+                    failonerror="true"
+                    >
+                <arg value="-o"/>
+                <arg value="@{parser-dir}"/>
+                <arg value="@{grammar-dir}/@{grammar-name}.g"/>
+            </java>
+            
+            <mkdir dir="@{build-dir}"/>
+        	
+        	
+            <!-- generate the wrapper class around ANTLR parser -->
+            <generate-syntax-parser parser-dir="@{parser-dir}" grammar-name="@{grammar-name}"/>
+            
+        </sequential>
+    </macrodef>
+
+    <macrodef name="generate-dot">
+        <attribute name="grammar-name"/>
+        <attribute name="query"/>
+        <attribute name="rule"/>
+        <attribute name="output-file"/>
+        <attribute name="classpathref"/>
+        <sequential>
+            <delete file="@{output-file}" failonerror="false"/>
+            <echo>
+                Generating DOT: @{grammar-name}  
+                Query: @{query} 
+                Rule: @{rule}       
+            </echo>
+            <java classpathref="@{classpathref}"
+                    classname="org.apache.lucene.queryparser.flexible.aqp.parser.BuildAST"
+                    output="@{output-file}"
+                                errorproperty="aqp.antlr-dot.error"
+                                failonerror="true"
+                    >
+                <arg value="@{grammar-name}"/>
+                <arg value="@{query}"/>
+                <arg value="@{rule}"/>
+                <arg value="dot"/>
+            </java>
+        </sequential>
+    </macrodef>
+
+    <macrodef name="generate-tree">
+        <attribute name="grammar-name"/>
+        <attribute name="query"/>
+        <attribute name="rule"/>
+        <attribute name="classpathref"/>
+        <sequential>
+            <echo>
+                Generating TREE: @{grammar-name}  
+                Query: @{query} 
+                Rule: @{rule}       
+            </echo>
+            <java classpathref="@{classpathref}"
+                classname="org.apache.lucene.queryparser.flexible.aqp.parser.BuildAST"
+                >
+                <arg value="@{grammar-name}"/>
+                <arg value="@{query}"/>
+                <arg value="@{rule}"/>
+                <arg value="tree"/>
+            </java>
+        </sequential>
+    </macrodef>
+
+    <macrodef name="run-gunit">
+        <attribute name="grammar-name"/>
+        <attribute name="grammar-dir"/>
+        <attribute name="classpathref"/>
+        <sequential>
+            <echo>
+            Running GUNIT: @{grammar-name}        
+            </echo>
+            <java classpathref="@{classpathref}"
+                classname="org.antlr.gunit.Interp"
+            	  failonerror="true">
+                <arg value="@{grammar-dir}/@{grammar-name}.gunit"/>
+            </java>
+        </sequential>
+    </macrodef>
+
+    <macrodef name="generate-html">
+        <attribute name="python-executable" default="python"/>
+        <attribute name="python-generator" />
+        <attribute name="grammar-name" />
+        <attribute name="build-dir" />
+        <attribute name="classpath" />
+        <attribute name="grammar-dir" />
+    	  <attribute name="java-executable" default="java"/>
+    	  <attribute name="dot-executable" default="dot"/>
+    	
+        <sequential>
+            <exec executable="@{python-executable}" failonerror="true" >
+                <arg value="@{python-generator}"/>
+                <arg value="@{grammar-name}"/>
+                <arg value="@{build-dir}"/>
+                <arg value="@{classpath}" />
+                <arg value="@{grammar-dir}"/>
+            	  <arg value="@{java-executable}"/>
+        		    <arg value="@{dot-executable}"/>
+            </exec>
+            <echo>
+            The html with charts is at: @{build-dir}/@{grammar-name}.html
+            </echo>
+        </sequential>
+    </macrodef>
+
+    <macrodef name="generate-syntax-parser">
+        <attribute name="grammar-name"/>
+        <attribute name="parser-dir"/>
+        <sequential>
+            <echo file="@{parser-dir}/@{grammar-name}SyntaxParser.java">
+                <![CDATA[
+package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+
+/**
+ * Automatically generated SyntaxParser wrapper built by ant
+ * from the grammar source: @{parser-dir}/@{grammar-name}.g
+ * 
+ * YOUR CHANGES WILL BE OVERWRITTEN BY NEXT ANT RUN!
+ */
+
+import org.antlr.runtime.ANTLRStringStream;
+import org.antlr.runtime.CommonTokenStream;
+import org.antlr.runtime.RecognitionException;
+import org.antlr.runtime.TokenStream;
+import org.apache.lucene.queryparser.flexible.messages.Message;
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpCommonTree;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpCommonTreeAdaptor;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeParseException;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+
+import org.apache.lucene.queryparser.flexible.aqp.AqpSyntaxParser;            	
+import org.apache.lucene.queryparser.flexible.aqp.AqpSyntaxParserAbstract;
+import org.apache.lucene.queryparser.flexible.aqp.parser.@{grammar-name}Lexer;
+import org.apache.lucene.queryparser.flexible.aqp.parser.@{grammar-name}Parser;
+
+
+public class @{grammar-name}SyntaxParser extends AqpSyntaxParserAbstract {
+  public AqpSyntaxParser initializeGrammar(String grammarName)
+          throws QueryNodeParseException {
+    return this;
+  }
+
+  public TokenStream getTokenStream(CharSequence input) {
+    ANTLRStringStream in = new ANTLRStringStream(input.toString());
+    @{grammar-name}Lexer lexer = new @{grammar-name}Lexer(in);
+    CommonTokenStream tokens = new CommonTokenStream(lexer);
+    return tokens;
+  }
+
+  public QueryNode parseTokenStream(TokenStream tokens, CharSequence query,
+          CharSequence field) throws QueryNodeParseException {
+    @{grammar-name}Parser parser = new @{grammar-name}Parser(tokens);
+    @{grammar-name}Parser.mainQ_return returnValue;
+    
+    AqpCommonTreeAdaptor adaptor = new AqpCommonTreeAdaptor(parser.getTokenNames());
+    parser.setTreeAdaptor(adaptor);
+    
+    AqpCommonTree astTree;
+    
+    try {
+      returnValue = parser.mainQ();
+      // this prevents parser from recovering, however it can also interfere
+      // with custom error handling (if present inside the grammar)
+    	if (parser.getNumberOfSyntaxErrors() > 0) {
+            throw new Exception("The parser reported a syntax error, antlrqueryparser hates errors!");
+      }
+      astTree = (AqpCommonTree) returnValue.getTree();
+      return astTree.toQueryNodeTree();
+    } catch (RecognitionException e) {
+      throw new QueryNodeParseException(new MessageImpl(query + " " + parser.getErrorMessage(e, parser.getTokenNames())));
+    } catch (Exception e) {
+      Message message = new MessageImpl(
+              QueryParserMessages.INVALID_SYNTAX_CANNOT_PARSE, query,
+              e.getMessage());
+      QueryNodeParseException ee = new QueryNodeParseException(e);
+      ee.setQuery(query);
+      ee.setNonLocalizedMessage(message);
+      throw ee;
+    } catch (Error e) {
+      Message message = new MessageImpl(
+              QueryParserMessages.INVALID_SYNTAX_CANNOT_PARSE, query,
+              e.getMessage());
+      QueryNodeParseException ee = new QueryNodeParseException(e);
+      ee.setQuery(query);
+      ee.setNonLocalizedMessage(message);
+      throw ee;
+    }
+  }
+}
+]]>
+            </echo>
+        </sequential>
+    </macrodef>
+
+
+</project>
Index: lucene/queryparser/ivy.xml
===================================================================
--- lucene/queryparser/ivy.xml	(revision 1484512)
+++ lucene/queryparser/ivy.xml	(working copy)
@@ -18,4 +18,17 @@
 -->
 <ivy-module version="2.0">
     <info organisation="org.apache.lucene" module="queryparser"/>
+    
+    <!-- queryparser.flexible.aqp -->
+    <dependencies>
+      <dependency org="org.antlr" name="antlr-runtime" rev="3.4" transitive="false"/> 
+      <dependency org="org.antlr" name="antlr" rev="3.4" transitive="false"/>
+      <dependency org="org.antlr" name="stringtemplate" rev="3.2.1" transitive="false"/>
+      <dependency org="org.antlr" name="ST4" rev="4.0.3" transitive="false"/>
+      <dependency org="org.antlr" name="gunit" rev="3.4" transitive="false"/>
+      <dependency org="antlr" name="antlr" rev="2.7.7" transitive="false"/>
+      
+      <exclude org="*" ext="*" matcher="regexp" type="${ivy.exclude.types}"/>
+    </dependencies>
+    
 </ivy-module>
Index: lucene/queryparser/lib/antlr-runtime-3.4.jar
===================================================================
--- lucene/queryparser/lib/antlr-runtime-3.4.jar	(revision 0)
+++ lucene/queryparser/lib/antlr-runtime-3.4.jar	(revision 0)
@@ -0,0 +1,846 @@
+PK
+�L�>	META-INF/PK
+�L�>aS��f}META-INF/MANIFEST.MF�M��LK-.�
K-*��ϳR0�3��r,J��,K-B�V�+�$x���RKRSt�*��3R|�R�x��J3sJ��Y���%��]��l��fz�F@;x�PK
+�L�>org/PK
+�L�>
+org/antlr/PK
+�L�>org/antlr/runtime/PK
+�L�>org/antlr/runtime/misc/PK
+�L�>org/antlr/runtime/debug/PK
+�L�>org/antlr/runtime/tree/PK
+�L�>	y�3��%org/antlr/runtime/misc/IntArray.class�R�O�P=o�Z�e ��NTtTXI0�G�(Ku�Ȣ�A]%[�t�����_�b4����?�x��萐����s�=������#S���c��p[��eE4���]
&�h��K�7%{�1����~3�~X�Ֆ'5�A��3�^�5�y���E�xv�L��������n�U�t�5�Y%d�Pwx��O�;�n{M��B=ز�P5���z5תyMDz�p)����J�����v)l��ۄ7�
Y��(M�=�&������7[������=�wߖ$ED�d#	ϯ���R�8�'|����]n`�
�C7����>$
\Ɛ��
S��4�0 ��*������	��J{�Э1�r�v�
�0���9s�M���ZP���st�����R��tj�P;����0�X�;��G�̻ 0:�	ʴp�"���%��db���������q�8��J��I5���MB<�iR��4f�v����Ѱ��JTe�8����$N��E���j���i�I����<VJ�$����ۊ0����9ʟ'�����Ns9ֿ�[�$�vWN����LD�-e���̅�PN���)d�Q}%�Bg^��Is@?���|�lZ���L�3��������C�(�������0Ii]�|CO�=�BϨ�"ưJ�s�h��(a	kd�,-�dc�^�ui~����L��~�љ�MY��_PK
+�L�>*�e�S,org/antlr/runtime/misc/LookaheadStream.class�T�SU�n�I ��R~�A���!Hi�����%�hV~���$X���f�:���;��dujg�/>Й�N�}�_���,��Ա��ܻ���;��r���?
��z���aL�0��4��pt��+Af9�k�U\��un�0��*�|$@�2�f,��2_^�H`�� :�@.�����T"��J�$s������|<�������
��w����[3j�(�_���LMS�V<'�4%��hX3庳%М\U�����/�O,�ʴuV�~R[�U�hJ
���x��$̩k\5�ҤCy
+F嚵"��t��sў
傑�����.S���4��Ŝd4#��fTS㵳�X+ZA �4��~*!g��E���?���I�Ȫ+R�LZ�T�Ħmo��k���^2� 5L�|�,HR�A����IK��E���=�>�@]h�֞�#1�t�L�7։�0i�P1O���M==�d��h�L��VB�pI��(�(,h���)uؓ�b����,�&v���p�ؔ9�(�?ﴎ�m�!F�2˹�
N���=�_���.eQ�j�4�fZ�i܈�*�Op�z�(�B��k!D9z��t�^�=���if�q!��P��t�8z��w0��
��e�Ӥ�ښaZ23�&M��=��&�R .�|
+Քc)RԳ���GXj�W!��3�q	D��EK�����bz��IEҁ���"9�9������)D�AX+�1t
+���#�a�GJ,�_ί����@&X#o�����Q-U�)Y. ��.�{w�2i�ëf2U�&��|�gF9J/T'=�~�+��M�� �{J��-�����cu�Y+,�}.j��Y��^Z]�3������1<1�^������46�mP}��i4�E@�t'�o?ݕ;�hl4i��WB���p�2R|4�0!�OH�p#/��v�[�۴&���w)"/S�l���澘wu���#�������?EP�>)V�"�FC�V��eM�D�LR�i�f[)�C�O���
9���)�۱2e��V���)�ň�>���z����=s��*�QK�q�B���:|�����{i>����+BFY꼇�X�6ˠ���Z!�WK6`���
�h��l+���.�(�8�z�K�
��Rz����tS��S��m4�H�}lLb��<�|�#~���L�0�	�"�,A���']WIO�&��!����͏����~���{m��^�����u	��sz|����O����㷿���t"��Eܱ�w�5�w�[����m�n��l����J�<���*��V� E*{��M��ߢ�>#
+�Wu�-~���-�Do��W��E���-}�f>�#p��UUQQ���j�[u�Mw�Q��
������m4��
J����������������E��{X���
+Q�+��GU�7i�Mz��YS�}��S�ګ�.��;؏o+��\����
+��w!�<���O�����{��
+]�kt�wӎ�%$�.�����V��Sa�K�O~�K��>-)�лⴄ���W[��1�|�	?��~��_*�Z\��w�T���D�؞/�PK
+�L�>��F �
"org/antlr/runtime/misc/Stats.class�V�sSe~N�IN�@K�
ii�ET�^�\T"�e[,\�49
�&9��z��-�wuFg�]`�/�)�Ɵ�?؟w�G�����;I�$��?���~�����~�w����o؉�؂	?��I?N�)��7oʯpo
���E��~4@R�*~�%E��fJEʏ�8���gUL��gE�MF,g�LFE֏&`��óbb5R��GL�*fT���7|lh�����g�G%���f�޴�M��9��M�Kh:`fmG�:�Z:�K�
YÉI�#���f��k���>��L��1m2�efBK�k�!�E�9c�6
�V��:�V���:FF��v�V5ǦQ��$���o�T������wB��d�mvR�8���ED�L�m�Ȗ��L���>Rt-���!�v���u��6T���-#��Fv�"V񬣧t�?F�cF*�9y�g"�V�P��߾᧝gD$w�9�p�Q=gZ����jRW�&�����2����h��6i�鼣?Vޑ��7���+�[9�ҳ4&O���j$�����Z����&�����Ԕn��1O�Rme��D���t6�����B��ҝ}P�]���x�]/��cf�J�'�D�`�`�؃s
<��U���x)����Ud��}�g�2
+B�k
�����O�-FBrABǭ$d.��:�	�
a���b2�:[��$�ۺ�s���*��-��6�	�]le܋yδ�����s���<Y�32yVO8��#e��9+�G4��~V$�9(.A�:�Ŷ��V��d�9�W�X�G�r�j�G<	i���n��^�^�ə�aٮɓ�a�j��BMhe�*iŞ�L�E�I�M[���؜�輤k���3G�Z.�g���V�)���y�4�$�
�Yܕ����|U��#=��V��p���|$��l#\�e/��F!}�t����D�����7bzJ�����?�1V.���O<�W�w��|��lW�m���H��M'�*�>鋛�mW�Jr�ܫ�+� _-ێ���!��K�}�
�Db�aB��A�c������a3�w7��>�b/S�~����<Ա�9R�Ǟ��q���ވu~*�w+mJ�E4wE۔��ġy���
+~��:̫�Zȏsv���T��<�VA�-���ݨ9J�A�
+Ȋ�B��(��2�L]1E��PB�okQ�7;�T�"�:;.�5���x���eB�1|��o���v�!:A����#��F��l�x+NW`��b�ݳ�ἛHD8}���־:ؼu�]�%�$���<El)b3���M�Al���ַ
+���ؖJ����I�!9,H�Ճ�P@�2����[��ۦr�f�h�sl���,�?�,{��_*�n�#�t����ݍ�t�o����ؕ|�M�}%������zT�H����Es�B����$�$�����m�A>�uX��@{oЛ"~�›h��X����_��S�M�ʛ�n���{�\�Mo���}b���|Ho>�7��'��#"��7����(_�y��l�k���0o��"ޟ+���9�s���4�+�����q]fN]b���������X7���&V��n����Q<V��<',����d	k&�/"0����>%�<���;�E���.�y"�]DK�o	�'B�E���!���Bj
B��yh_y0v10�����
+k�W��W��|M8�0�ߒ���8��\�F��X;����ZyY5�y����a:�J�8R�u;+�0�v��6-l��Q>HcԣP�1�?f%ZF��}Ԗ�X�Ɩ�5t��-6�m��<��+`��5�����0R�+��
+��PK
+�L�>��*.��	&org/antlr/runtime/misc/FastQueue.class�V]S[U]'ߤ�
����hmCB	�(m�Th�b#A*��$�p;!���������Agg|�342���
+���:���tڇ�}��笽��9�����#��ы9/����\�c^�����H��'H�Ղ\-J���%/>��4�|HI���3��^�C��>�����Ei�‡5/y�.�ʩ�*Й|�>U�S/ēz��H���jVM���=�N�'�G��7/�6�b��<zQ7���2��r��zQ[�lg4#�f
+����ZXV
]~[F�����%#W�f�����ok�m���Ϫes��U4�9	�|���kOqwZY3��M5��жKO	���[`R���-+�!J�w�����ִS��X�H�NYO��j�)�_k�:�|�-M���mkEsʔ��Y�>5S�/�go��g�R������VI,S�8�⚮lnj��.
+D&ҷZ�&�1�J#����g��˭
+.�����L��\�����ѯ`@�����c�0�`7�bC �8�PJU�[3���<�j;�^"ٞ��(_J&a]�(�@EF�,i���ڮ��Hre�]���M�P�J�0I�n�xs�K�('/�+��!����hE��v���v�zOG���GΙ��>Ԏ˫���7���.�7\����-��%�H���M�|�_�����C8V��|	W��u����e� 1�!�a�v��Т�� u�%F�\�xS���V�m@{j�����-pn�
w�)J_��w����G�
Z�6�0������r�YEG2���k�Ê��^�G���4��{�g�'I�v-~Oъ�o�5&
_���ow�:W����F-w+�G��Xi�x�XDŊ(W�+b�׈�!W��-e>�\�!�kSлoX�
�1{�4�;�8ܴ�6m��Ժ��	��1<O���kT�����9�weڽ�!�?��!��C���9T���`�{�+GSg���g�;\l{����=�?�
��I��
zh�s
^�E���K�;�j���e��R�3\gl�~���g��L�3�F�'rO����j�/�7�'9�oO:}������U�[�sm����a+�8����c>ͤ���#��Y'�Ǵm�qX��ej����$�J�c}[<�4OFq����E�a%p35=�?PK
+�L�>��E���)org/antlr/runtime/misc/DoubleKeyMap.class�UmSU~n�I ��b
+�M�-I��X�ĨiK�VA*��v`KH��0��
���_�N;����;�~�>��I��拓�޳����9������o��у���`����~,pW����|,� � �:�����|<��g�<����]��t-=�O�T�bR��QV�}��+�j��i�ͭ=0N��.�tvm]/T�l�?
�,����7�X�^s�]C�e����Q^ӷ��.�v�º^6���*�����Ry/�+�r�\-V�C#uh��KU�qS�o_#���9N�[�
$~T�,�-����z���ةd[�$�]��i��u&- N|�PhkGe��~��m�il���}
+������޻gP�lK]�\j��
��@&��솽:�6�i��o��+
+���"W����r����LEO�>�.NF/��rɷ��Br!r��V8�7��������WJeΉ��浶��MM�������I��fa���[�t���
+&�Z��w�S6gO}ޔ�!��_��Ƒ�Ł�{O?�gL�x'�	|!��P3!a2�i��}��6-3
���_��&�B�
+_�$�o�-����B���&Y�-6K�-�m�}������{������㻊�a7ya�K$�{gCQp���+؅�&��a��G�ϔs�����h�����*�;�"������'����)�S@;4Z�i��x\A���Ϡ�q׸���K?}w�?C?�σ���h"�j����hj>��!���g�j*Z�MLZ��C�]�:х0�uQN77���5����#���m���Z��Ze���eי*��3�A�Oɫa:cF��H8I#A+��\1�I+1����1֐���W��瓖���0Gp�0UD�I*KZ�e1GY�V�O��*��A'~̉�;�I�[�o*�)���Ri��q��_a]S���H�[��v�anЙs�s��4����sT��\�PYb��DS�F��SYѱwN�M$�ґ��(J��A'j̉J2�"�}��lr|�������X���`S���,�����7��8M��� |V��m���eGl�D��۱d%��q���2�u
+������6��d���
i1"������a�����?�k���@`vژ�$�,��rNs/�fU�z��NY�y�e;�
+�w�O�ܖ��6�r��v9ʶ�0d�Z+�*-[vZ���S�9i����οPK
+�L�>�R^]�;org/antlr/runtime/TokenRewriteStream$RewriteOperation.class�U�R�@����XJEE�ZZ������hD�JZ�lӚn_����)���>���4���df��|纛����p�zp!�F%uQ.���rWp5�1���\&\#�Q7�~S�dS�Վ۸#9wU�S�K�
+2]�U��f�ҭU���t��Y��o
+�Hf�xk���O�d7xN�1��u�?�p2S��i�;m;�0�<�Pzͭ9��6�67�d�o�u.�Y���)&�����C��Ti�3tfL�O;�,��l��K9��hئ<{̀��r�f��6d��nYܞ*�
+'�K{
+!ތC)��5��
+�|��s��X%vi��i�'��5n�
Q?�Yg���_*�(�8��P��lW�<myc3w�q�����c��S�@k&#�XC?k8���Ы� i�ƌ�Y
�0�`N�<4<Ƣ�'Xb��=x�q
�xJ�
�4<�/5�Š����Nh8�����
Bs��	�5υ;�
�s�T��&u�Lj��j΋�n1g�e��.��V�V^�����8ي�K���f���Zen��V��(��Ry}%S^��#�B:cV���h�Pؔ-CO�!��K�����W��W,F�[���u�>o�9�="�GO�(Y1���৽3��Kn×�߂�3�|���!Kt��#� �S.d����'<����6'Oo!��qu8��z�Xw=�^�uQσ�dR~�2����
+�RL~��c���@qW��:`)���+��| X�v)YE���L�+^�r-�XIU�V�|Gxy���}��項ܲ/TB��]>T�?����&��触��P�gSB�]i/yQ��E��[t_��[ι(�q��0�z�t�
PK
+�L�>�^+�H�)org/antlr/runtime/ANTLRReaderStream.class�SmOY~n;ӑXvYAEa��Wv�tL�EbVV�	�[f��t�&�c?���Dq�!����>�N���Ĥ���s���s������
��i�q.��e����F�Ӹ��fsһh�����ũ��On=���*>)ٿO	[�5����y�Zw���.{ƞ�'{���Eɡ�y
-T\���wg�Kn8�,U�,e�:�7�Z���A��c�j��~䭺�ə�B��:7,E�묎����S�o'��83.K��s�O�����Z�qW�8l��k�3v�9�U�V���W���%�Ӫ�S0|���9�Gy����clf��KA=,�Ӟ��� #���vt�儉~�\ŀ�k&F�_M��1�0M\G����P��(�=yյ;�=�Ԉ���d��s��Z��℡�Q�6��N
+0���-G��!!%^�^IY#T"C��D�	��ՠ������0y�Zծ���{�:}�ǵ��+��V��Bl)H�4-0̛k�=3!�nZI�#��61kZ�
��Eb?��4�x�cl�Gz?�A����㊻��]`,)Y�l��̗8�e��#������X'��ƉF��4�?`��m$�ViS�W���FU%+��Azq%��?��f�nMq�Jaf3�
�V�08ݍ��NX�;�h�Q��޷h����%�(����c)�&{RI��_�'�#Y��m�Fi3�"	�ċ�;VF����n��+�c��1�o����:�Y�3e�������c�:����Ź��~#�3����f��f�ϵHM�P�xxH��������wa��K;�Y�8M�4�fq��.�i���w����!����~
PK
+�L�>@�
v�
1org/antlr/runtime/MismatchedNotSetException.class�R�n�@=�\�Ch(-��$�P�Қ�
�@����J<:�6�*Y[���	%H|��u"��D�3g�g�����_�~x��6r(S�p�F�֍߰q
�
z��f�����W,T-l�ϥ��%!��WAGr
��ޠ�Ѿ��q&��~�����'ɤ>�'��Fu=_�^�E�e_x���������)��Ӷ�T��̽�`GZ�?u��:~�f:̊�P��T]��tBJ�p�	�3%	0���R����{=_u�q�v3Dm�F�;�M�ٶ)up��,�k�E�}O�pl�sx��zL�+�pp�M��@%w�J����	�,�Yj�C�:��{q�3�Oi�+�{5ގ��
+E����>���1o[�\>��%�`��̚m�#�=�O�G�/�p�m:N���p��M�Ҥ��b	�V�Ra�o��Xg��X�0�M$��IJ���l2ۙȾ�c���ć�������|�௰���wq��7�i����Z̺�PK
+�L�>�Q�{M/org/antlr/runtime/SerializedGrammar$Block.class�R�nA=�RXp++VEm-m��.Vkbjk�Z$����1>
0��,���G��_|TKM�
��?��ْ��<��=w�{Ν����	�"�F``9�i��(F6� Vt��n�ȫÂ�U�aø���g������xҶj��m0��}�O�j=�cqdz]�8��
+�.\�m�V�*.�v�K�����lR�}�Ho��^f����=W�C�&�;�6���7l�$j�&��8�%�J/�T��5_1U�n������9���_KVt�W�\�tf3�Sm6w:�i�nh48���1I�J�6��Xmi�n5�h�7p�bG*��1-�����.`��y�����e��mܡ����Q�
c�!;�o���i�@4ɡ�Q/⇇�i1�3���ϙ��	�c�~�i����$}�6�
?�h���H�	a��X�<�#��A��_L��xlQ��%}��pէ���1�jD��p���_c�f&BC��k���7h'�V{jm7�
Q3��C�0DD��ӟ_f"�g�8��L�2I
BG���q�X�#䱃u�xL'U_h�$,���A6��	+�x�,��"� ��X"F J.
PK
+�L�>��;�Tvorg/antlr/runtime/Token.class}�[OA���V
+�D*TE
Q[��F�`/aC�6Rjxj�2���,���X�M�~(��t���a���m�9;�_����Q<������R.��E!���r�]�Q�.���^����D��o	�iu�<L�C�T{oJ9�ڭK)L�o
3/��p�V	�����L�q;y��u�n_�v���G.����Y5J#ɨ��)Clgۨ!U*W6w��Vqk�4�U�h�(�(�V�$m�h��
~�3Lgs�C듕�Z����][t���7tHg��sM������9CG(�d��C�|`Hi�?Xn��l�v�!��;_���^�x9,C�cb�4'�n���O%s��0O����<t�AM'������Cd��v����A�H�9��S�����n����fv����[�*vU��a�S�^��)�u,�1�t�r� �0���0y�j���Mq��J#	Q�)�8&�:��Vp�8��d�/O�21�GrW��Y������Z��#E�e7Ի��y�/`Q�����ۚ�h��9�9�yY�=��5�`U�y�G��!Q�I~�ʰ�l/�
��K1��ȉx�z�OhM��e��
+�.3=U�<�PK
+�L�>n��'Q
�-org/antlr/runtime/ParserRuleReturnScope.class�QMO�@��B
�(��N�k�&&/&�� ܗ��bi�v�����ă?�e|[<�=x�yo3�f�����p��
+�h�Q@S�]{6�
+��R14���<T�te**�A�,�K+VьHI!j�	�n�ñ{?�O��x凾�fȷ;C��D�$�v�P�%ӑ�>
+Rs��`ȥ���GK=�1C�P��X�^��P��^4�W՟7��;�Fv�н�4H�W�Q"=q��Ԧ���>����%e
,1��CkQ�ѠE�P��Ƀ����J�҈-���
+m.1#.}��ѐC���>�b�Й��Zzf��;r��Ѽa4��s�y�h����y+Um�PK
+�L�>�
+C��org/antlr/runtime/Parser.class�VmsU~n�6�,�FZ(RZ^�$E"/�D���4����Mn�B�7(����~���3�Ne���Q���]��n[�3w�=���=�6����_���:FQ�1��,]�#i���4\�0��J�>ס���o��I��͗n���W)|�ox��G�;,�,��R�m�%�������rW���@ܲ[O`����i{
��vl�j�¬s_�ϕf�@�e[�Y��-���b�NM
+�˖-�u��ҝ5��ɔ��٘3]���2�ݵ�{B��M�-]�e+�!�3���m�t+wMW�*��I_�͢@�ƕmI��fa�.���J�+q
+���NC�XX�%�{U��=�Yh�v�05OV=B��D`��j�ۖ]������iy�cO,Ve��ӥ��,�"��H�,�s(�@�\l����F�>j��(��F�y����@����ǼY��r�Jp40w�i6[��[Z�o���F�[۩�=t"E}�b6�-�O�62�8�*��MJvg6��fU�l������+�v
H�%�&I�,�xfu�Ѥ�#���(�8����K�
��
ﱮ
Jdx�,�p(�3M�q�S�4��kü�YX�.E׽h��o
��Yg
x�꬧=`G��h�/�q��w,}�����'��O�q���(����j�m�:�G6�rȫkKy�>YաHyV`/ɛ�*a�ZҮ)O����~M)f�s ��F����23���ܵAxDC����޴����Rl��z��N[�v���3��FJۖ
t�G1����a������B6lRֿQ�9������L}�t�����n�#m~"?���ﴋ�0����]ĐEr$
��m��%1�P���:�a�T��2�����=�8
���
+tԿ�M�,����4�
|Y�)
+9�����?�$"X�����c�'��ʛ�[�b(���Ӡ�����V���.\B�}�S��>F���&�.Ig�D1>y=�W���/��\F*c,Q�K�>|��L��%�(�_����P|�bb5��6���-��H�:�J����/0�˃,�JD_`��b͞��j.ǩ�G1��H��vE\$6LP�&���%X��tp�^�+����y��u�~���I*oDI�j�3���T�(�q�Z^�4����$y;K���\��SA�yA��꼽�=~O��Q�Bl��iH�X�K��^P{��Y��=Ԉ0����d`���
+��u̸Ճ�w&(S�B�\����^������t��m�������fՏϨ�BI���<�-�[�Jjo�ಲ��?PK
+�L�>�7~9org/antlr/runtime/TokenRewriteStream$InsertBeforeOp.class�S[OA��-,-ۂ�MAE-�m�EoEԒ�l�Hb	��-�2Xf��T�F���
+��/&���?�xfi��6i�M�̹�w�|��������dq���\�`E�BZ��A�c��� `k����a`��_�zr�a.��ە���~C*���M��O�+_(^P>w���¾T;\�e�
+)�ê�[���u_�vՕ{���K*��b��{ۜa(/$��+r�-V�2��Jnu����[ƈ�̐pd��*�˞�7j�#%�׫n��ɿ����*�`��ۼ��}o*
�
6�����Ph���Oe����2��)�.6���Bb���c���h���3M$0d�FLLめ�p��wq��yLȚX�}�ҥukx`�!�����]mOY-m��}W	O2���;_q˭ո�f��:���m&{�����D���R
%�v^��d�-4�
+'9f9��D ��~�����=�ͨ�4�OG-k׎0C�8NO�h�9@�0��с�Y�
+���ә�`����7��a�$��G^S�7#m&��1�sA�����Q��q�u�Gҵ�ɤ>D���}����'�e}�L��3�p�A��y���H��-�x�Y�G����t�e�• �*&�����D<���PK
+�L�>~X����	)org/antlr/runtime/CommonTokenStream.class�UKsU��<2ɤIaxt��M:�
�L�B"#�Q|2LzB�IO�
+�ʈ�.��R�D�*X�pA�q��?�?�_`�NwO31�bn�{����wν��?�<��Fþ:��~�Di��A�ze�i��x>�C���,�0(�q8*LJdzL\��oD�^��xI�H�Bʶͬ�Q��l�دl�8��M�
+�I�6O��ϛ����,W�&s�T�L*o��[/X��d.?O��l>�/�Ekڌ榧s�xnʴO�fj�W������+��f�0�/>^Pض�	�֕@G5��م�4�
������SM�g�g���º”53��8��~L<Dj�W�3/����f�,�˱4��y�,�ҎfF���тS*�o�~
���)�C�T%�D��S�R6a��
�(V��Ŋ��	�j8�S�i8
&�a��^�n
]xVC���)�A�)H/�������ͬ�t�h��@)�1���"?E	C��vڕ���)z�NJ��R��ƓV�(J-^���R��Rg+��'��/�iq�rw�|=�y�I�g�lV�ZW8��e����c1^^�4�Ԙ��Y������G�g�h�؀ �n�܃:~�x�鍭�栲F�1�
+�[ot>@�*�>�	�~*�{PbmG���=E�`4d4U
�%hAh��T,�_���g�޲wҸ�p�"�<j������Gؐ�y��C��Q���>D��c�R﹅?s܊���m�	r~q��F1\��I�sHZ������M��@x}�&�ꮘ�P��G�1�B���A5��wSy������O������j�S�Au�Q�������!�
ꋘ�3����c\�%�>�GݱJ9�o��~�-���1���s�h(��V�OԚun\&��^�h�c-� �7��[,j���؍	�Y�OV�2��2�����37�|�\B�Px��v�4t��*�o�U�q�[�S�㓌�'
�c��g؃o3D���;}B�
��]~��M����b�ͪ����*º��y�5�R����S�z�yנ���j��"���^��H�}��M��7m�G���7 ,h�`ߓh苢���!E�e�?bīd�1���}����"���Ɗ�3��np9ݡ���0��cM0!�V�kn�{Q������B
�q��r&s�<�F��Bs���}�\�s{�����u��k��߇���p'�3�^����<@��yw�gu]�g�%���w+<�{�s=�PK
+�L�>�r��0org/antlr/runtime/MismatchedTokenException.class�R]OA=��k�Q��V�L�ʢ��M�TI�m�e���,S��JmM�
�(�݆����̹3瞹������7;x`���"��nP#��2X-`����l�,`�n`+'�-��8����3�CnO*�1�y�!�$�	���T��hx,�C�x@'�n�{�#/�&�f��<chw���zJ"7)-��}.φ��OE�0x+��s_�Zj���;H�(}�#�
wMY�‘f����P�
ḛ%����y��S}79%�u�"_<���ڼ��M��2*6�hP�a�w�ǣ�1����6�aۆ���3��閍*n38��Cs��/��OF���u�OCs^
+գ��.��4J���B�T��P��C�
+MN�w��A3X�i�֍��҄�^Z�Q��!�r&`N�3R)Ja��q�5��:��_��N�XƍX���S�הe��N{�t,�Tѫ��D��,lR=<֬'ySM�L�,F+�WH�6}gZ1��̫	���yg��Ŋe�'��Bx�����8o�R���Z̺�PK
+�L�>6p&��E
!org/antlr/runtime/IntStream.classE��N�0E�+i��e����3� E�`��n�S�6q$�
ħ1�
|�%�������������
+
+k�*[��
��0�����
+A��~H������'I.(�5�N
+��y?�|HZT�m�J~�C�:�6;���Z�*�zgluKH&����,�eº�T�U�\[_���֛��?����{|�q�c���J"y8"@8G<R�p�Q`����;	y��)V�H8�}��_PK
+�L�>xݴ��
#org/antlr/runtime/TokenStream.classuP�n1��qGH�SJCR�3M���$$
+�
�����,��K��GE���R�ޑ�3��������i�Q�q�����
+�U6_U>�ƅ�kv�8Y����-]o\nm5�Xsֺ���~��j���B�	�p��Ie�y0F�t�񝜥jL�ظiԏc�E�t�$xkNod�KSښDɿ�zw�{~zv-�\��D�m��#��5�.�;�k�����FY[�PK
+�L�>�	��3org/antlr/runtime/MismatchedTreeNodeException.class�R�n�@=��㚔�R.)4�8NZx,�)R���xt�m�(Y[���		$>���:k��R����3ggf���6��D��T��Z�Ld�j�>�|�Q�@À�a3'�C����WB�X�!�TH��3���>C�e���]!��hx��=�`@�r7���	�O�u$��n�]O�A�F#�Đ�o���S���E�o����Jr��ew.�Q�t�w�󆛺����H14�1��P
��%��}�}�܁'�n%���"�����%ծ�d%��i[X�U��?%_�yİr��ma
�\lh�!U{F�дP�
+�����>���~Ч��bվ`r�ff���C۞���vi��>Woe�TT�ǐǫD�U�;�C�v�H�L��J�!��Fޓ��:��RX"k�	�i��N�JHXƍX���S�mb��\p����W���+�[$َ��	}*������nS&ӿ4�߉}���̻	���ygc�B����/��t�v.�sgʷ�˿��
PK
+�L�>��5!
^'org/antlr/runtime/RuleReturnScope.class���J�@ƿI���jk�g	EhE�wŋ�)(���m\�4)�ϥ'���C��i	����>�73����'�+�x����؅OhިL�[Bm0��w��$t"�ɇb1�z"f);�(�E:ZY�1��Y��Q��Pd&ա.2�2�IS�l�KyMh%Ҍ�І���\�D��,	gs�pˎ|��&Z�}[��2��7��{e����vdu4�����῱�
��86Y��ɺ��7.���y����
{�8�ݥc�
��k����/y���J�@�m%;;�íd�TG?PK
+�L�>�7�
+�+org/antlr/runtime/BufferedTokenStream.class�WkpTg~���.�l	$l!�\�(���	`�Kr�$�qs�B�Vm��jk����B-^jm댃��x����8�u/����~��'�
��~�|����}��}��w�����B�A��
+�Gd8*Ã2|$��2<$ӏ���E�8>!o���"���"���|���=�� >B9�S�<?#�g��	y>�t|N�?��EyZD}A�/��xZ&τ0��pB����|8-�s��y�q6��x�@����t��20�-��k�%�Tc*���VcgvC����?l`jۡ��Xcڎ4�Ňm~+��%bv:EI�r>��Lr�Z�
���T��2`��7d���%�(*�&���k
�/�m�ܘ��ji[<a��X��؁
���%�c�c����E�>'�y�oH��Z)��1�NY�AB�[�.��>���7�~�R�'z�#�Zh�\��5`ņi}���4R�<!<XÖ�
Ö�/�����N&�Ӄrp�h�����Kp{�ew�;�TM�:a��jj�ͦ��V~��i��K)Hv��
+�(�����!�� ��SNXv�[K�s�+�PI/���ѵ��y/nwXvs>p��!��fM~�8z���>w�=�F��?GI�ܖ�*[�(�����1�Zy��
Fy#�/����)v�y'�,���H�����	hn�<i7O�!�&�,
0=����Ge��Y"gøM�g)X�JŎ
+�iKw�0Vae�eh��0��)���'���
[�8F���ˡ��r>���rd���J_�=겺ړ��A+ao:�m
��$�aF~��U%�SIY����_70�.��뒽u���-]�$�A�
��щ�̜��0�bW�ᢐQ9Y�Cw����F�q%�~Q�FAa�2C��_�U9k���n�d�du�=R2>dos ��	눓�"��=�Oq&�[����Li�Eټ�~V4�*W��!KJ����Q91Pu�G��$��Z�O�n��'"b�v�2K!���8��8��O(��K2'k�WS]u��d�)Yj0�
�
,v�Ô���Ô|��2����sf�Z_�>W�g�0�86s������1���uM�C��Q��e\R�p�A}���Ә�3�	�[�v�`-��):���s���9��]t���Ypl�Qt/�oS�f8]e�&$��`=6�j�Tp��Zt@-n�`�k�,,y�_�9�#���yr��{x�>����[�h��E0:�)Q�W�Z(+�;)l/~�=�����t�#x�:ǵK9�>��Д��xCZ����#���(��rBju/���вY��[��Y��;�)���T�m�Wiq�E$�8��bzz���"zDiQ۴mMY�(*��C�صѵ�M�o��|�y
a�0�A�H�k�v�|�=.�81����<��,�2�	p�" �#��Q��ٮ
+S��b/O
+9������R�<U��$�ć�|3��E�uV�PɌJh�}|�Q�N�댚�̖��94I:^C������� ��k���>�X$�"p
�#>�­�e!�"�q��,��1,�q&�!=� F�r�}� X9�C
#
{�+��$���ٵ=r
+S�伀;�cz�u�w���l�(f2*˪��7�=\Ŭ1Dޔ��5T��j.���=I�Oy�j����eS`�va��{�"&	+X}~�78��������ԃ�%�Ҭ0��a�,V�`M�*����
+�#&)�iCx�����
?K�`�d�?EO3��c���E�2j-��ǀ����e�(	��64�=�Py{��N-æ�]L��~�%��unfIՙ���ԋ&���"�IS�X���]��_�'C��L'z̩E/Q���ZG->�zk���}�?�{}9)�"�Y"�(�#��ɸb��".���4*�8/9*-��'��B	�w�zZF�j�*�^c�\d��N�\&�+�D�������g?��&�>]�Vd�-
���[&��-���U��ue�����s�{@n=���̘70oz�/�p�u׏�[L�fn��N���i&�'Ҫ��0w���]q�H˄r��"��k,�\J�1o<L���ɂ5���/nf7����
+?3x��`���@�
Lk�
+���'P\e�T���i��*G�I�&�J�R�,Z�b�?"!oc~��	��g��s��_�[�d���8?�_����්������=Ipi��U����f�f�ˊ�����f��^j3Y6�8+�Յ4�v��d�K4��%�1��a���w��s�P�
�j��T�o����3]��\��<
+��Qp;���!���?�s)`�[` W��^
+����>gܥ`�тq
han����S���9	W�M�Ť�I������-�B�����L�˼�����h������0���Fs��_,]�f����ɘ�����ҍf�n4i����R���*~KRF����.1�nG�@��R��a�W�Q�5r�}���[�2OY�h�*�P�#Tܡ�BJ���n1��R�e��pg^���i���Ζ3(1��­�g��\"�����o���.�[�0���0J=ŵ�����S�2�d��PK
+�L�>���M$org/antlr/runtime/ClassicToken.class�VmsU~6i�m�X�By�E�i�"�HC�-/R@� o�6]څtS�
/����8����~��HuƏ~�G��ٽ��Q�ӻ�=���<�{o��_��`ORą�ć2\\�4.	�,�We���k�����(%1�B.��{C�yR�qI���f
+�Pֱ���Qѱ��cU�Q���븭㎎�b���^�$q?�O5�y�]O�Y�iݶre˝ϝ�;?&k��l
Z��츄fi�����ϩ����4��]���s�]
���:�8�҅���LU�q��?U_���3�lY�+%�|ު:2W�6o��i�/V��9����\��z΢��*[��S��ܲ]
+ܚ��,
+�^)��3
}-7j�M^�^�7F-�	%�mo�/N<=��$k���!+~I��CQE�����t4����MET��mO��f�jM���)%�BЫ���y��Rݣ"�Zd�GD'H�`N]���@Tc�\$Mzh��_�u�T�9���9K�IS�*�j�>���Y�|@F��v�39d
�p��1p��ȰK�
+t\�(�����d��
��Y%栁��@���b�7&EuW��I|a����[�u���;�n�_�/J��a' (;�
��<�r�Q�v��WY��֭h=={�.�dc�s�\v!a--�l�i|�$Ϧl��n��.��>U���U�'�<��#�����
�-i$�&}�C�&�����wD}s�;�7�o7�⸇�ӈ�X�y
-�Xf�sğ��^�&�m$�`�.:7p��x��k~��*��*x~%��/h����ₒ�tA�R����(�
���d/هm���ûM��
ey�(ecJ�,����^�v&Ke+��h�8���� Y�}�����ҭ�$
��|y�W�\����ٶ*���)xA�	�N�t
+�xK�8j�5��� �y�V^o%!����t	�x�mTh
��d\u2!���)�z�>Ŧ�'��ab�8B�
+	9)d�����jU �}fZ���Ȋ��\�r4�9v��|,���p��s�E#���#���BJ�Bދ���B!9%�+�u���-b�|9ND&e���D&u2Z�R���BȨRĴ��UBbZ���iRk�8�x����=9�o"����}��l���+,��S��(���C��Xk�[�z1-�\Ɔbf���?0�5{��el�Κ�̾l6��
	s����$�2�3��q��f5.�
�a1���_���&1�W�a���x@������cڟ0�/�~ţ�5;�M��T� ��x��dmg�����?PK
+�L�>�= PA-org/antlr/runtime/RecognizerSharedState.class�T[OA����rQ��R�7T�U�kx�3��,�d:�V��K�'����hL$>㓏>�1��]C0�`�|�9gΜ��~��a�f&�;��Y�f�b�Ͱ�a/C/�>����A����<�p���Q�cq�#%P;껮���چӾKJϸ:��q&U��1ez�F�S�6�)�}}Ve�KJ�(v^�ޕys��)/��գ�qUN�ʗ<#��Z����0� hZ��T��@�p���$���A9EMcƟP���9���%�ir2Fj30.������O	��N;����^ʫ,dz���K��ҔbRE#�T��Jo,�1�4S��}�����!J�s���+�*L�(}N���7�Y�I���fܡs�c$>�1Ϲ�t�$��5��m�w2���Hd��Ϊ��]6g~Og����ݾ��h����b��6���Z�V���q��I�-��Jz&�n��*����s�3t2t�[�s�������#U��
+eJy�&�QK�e)�O�۴����M�Ju��f��

<1Y�����-��Cy�w�L�L��&��
y]��C�����,���|`���n�}DU� jGʈ�U�V�����c�7A�M�6�ED�hm�Vi/��#��$��(���C�V�!�A fKE����~���-"�^����^6#�X�ﱀW�\�8�5���,q�+�pq�Z�Od}�*v-*ZW��&�"A0,Z_F=s��7�+R�hd^X�B�2�fO�1
W�qxW�א�uӭeq��<n�����c����K<�k<�{<�'�~�|�S|�3����Z*^[[ɢ�,�ڶ�PK
+�L�>�UC4org/antlr/runtime/TokenRewriteStream$ReplaceOp.class�T[OA��-�����"��-^P��"Z�T)���R��Xv��T�/x�F����M�DM|S��̶6b��}8��7�:�������Q,��G̃�J�g<h�Y'�I=��y�/�1��r{�q$\�taJ�\raڅ�.�8�tb��]PK"���M�bhkZih�a8m������3˺�6xlѸ������
+��qʐ}��5.�E'4]S����S����@�T=�,�󜈇�Ic�3��5�ϗ7����.񥍜ZXRMM���C6M�,�bA��L�AI�:7�4]���hC���\�U��`�	C��B�k���7y�,������Q��3��Un�Ct����*C�A..aT��`�Ώ<<Y�l���&����1
+�VЋ9��Rp�
+��C����35�I��4������
i�T0�.'2
+n�6H4JT�R�CK�vfӴ71Hb����fk0�Ze��T�f��z(�(���^�Z,r}�a$�����g��z�+h��N峔 �[IUZ!��J��MZ����ݡ��dg0��G���A��&d�$q������E�~Z�ɫ��?�G�{����a�`%�8H>&�'h�SZ?�aB���Z��8Nm�5D�ݲ����p�j�,�H�@x�oP"R��i��޻Z�6+�s8�^���V
+jEQ#�\��j��֔�+��;���|wN�kn��<�Z>B����Z����F�������g��
+.g������5
��^�[k8��vu8NY2�c�-��4��A<�+�/PK
+�L�>��y��/org/antlr/runtime/LegacyCommonTokenStream.class�WitT�~��;3�dk�a&*�h�$$���D
b"A� "-��&$3���[�֭Zh�J,I�X�.q��vs�ն��������J���;77���|�[��y����y���_P����wb!�%�=�|[�{}��/��~6Ʈ���"<��E؇�E(�ò����c�/£xLz���
Y;X�C���/�a9��������)���C?���"�i��c��{��pL�ϊUw�Q�Is\�>Y�f@�='�Ai��'���4?�_��K>��c��/�����4?���|��C>��P�Nl��k=�V]��D��&Ow&k�=�t�K�iްP�k�O)�k����I�:kc�4�&�n���zg�6=����G��:�q���m�Tk4ٶFO�\��}�U�p�����}�9�l�����h*}y4�UO*x��x�P��]���u
+k�e�6]�������=�m��̄�Dk�sm4��5��7Ǩ�2�zG��wY��+7�I'�h�.���Ď�_��^v��t�3,��Xg�Ҟ�vq��‡�L4���5��ޡ'@2"����̧ـ<O�tQӤ��X7�6V,�	�VQ?��T���B(׮+u�=E3�7�v��2��T��y�iN3,+흦	V�5�)��P������m�H=�I��I:���	f�,�����XZ�-�y��:��?�1"i=��e,�!j�d�^�m��v56+���i���ʾ����W�:���7����%�N=*!�vY5��b;d�Է3�F��n���<Wܑ�i�*�Z`S�2��F�d�c�!"�ංt��+L���=v�)���\��yfaޅ������cR��<e<Kp9V�+X���׈���-I&��<پ9���$�:\$�f^
�5�������
�;X�e
+�G��oЋ�����������N��o��L�N�/ïbS7�\/�%C��!��0we4����{x�S:�uX�H�K�� ���8�a�G
\�m
��9�3�n�.�n�oŮn��n�fB�H�'��g�E���	v*����K:�ԲEoe���Kd�H��*dq��|��9hIa\�.ma�_0B�R_��q*�Sјm�ĵ�XF�xzm��G�
��ͧcFܛr-$��hL��$�l�-;��3,]o��h[��O9�pw�P�9I7�]�\�&�Ӗ��ؒ��J�JsӠͽ�TO�0^Ƃ��ݺ\U���M6���p����B>���3ߐ�Զ�e�_��%E_����7X�F�;���(l�8�q^�{nd*��Kw��MO���ǫ�ׇ�c���j�g���R�G�.D1͛H��Ќs��
+�LѸk��͖�����O����>��%���2��B-�&��-I�0�!�*K��#'�"�l��%[h<��U��mn��YB�'X��_k���29h�9��AL��#�M��.���&�j���I�V��j�x�*�ʑHxٽ�z��C?��p�j���G񐻎+c�0K>'0n��4����I�[��!W�~L�$��d��ub�{Q���w��ދ	\<C�	*�hu��0�*4�)���]X�K�a���$0x"�y�1��aH֢��&��L�L%O��3�	�f&N��w"�R�Y7�;��]d�����P��/�#؁g��q=�����|�U�?@Wb�R��5�����.�ċ`�
���T��]�۬�n�6��/Y�	mS^�&P!����K�`�ߙ#�5�#-U;�,���,��L�8,�+u�_H���(t$K�L��PApf�AG:�ڙUK��e?�j1�Y��Ѳ#j�syh�i��:|�c�r����_�~��GJ�ۊ�-�
+m���n;c$'�%__A1i���8�c3b*�7l���n����09�	��D�r�\m��f:�0���K���e�S�a���i�4Qև�LQ���]��?M�ϰ3�l��-�W2�M�u��H��:,�o�2����ey
Y[�Ւ��p/��z�H?fH�f�gx�9��#��,��ef
+��c&c���$��qΰ(�q�d��`.bŚ0�Af�W�r9�v����q#�f_k[z��P�<�\68w���)�b�l-�drs��z㫃^���Q�c��
>�T�j��}�*��a���U����[���Q�wn-��>l�]{	�%�Lj��n���C��W�|Z
+"+�a3�F���(_`伐�n��6J�-���MvsSGn�q�n!�
YGY�kc�(__=��9��aB��j�k�k�KuKr�B25���9͊z�s��P�7���E]z�󢀯m+���Ƀ����I|l$��G�QYm��y��#72Q7�.�-:��k�HËw����_�l�q-,�n�KY��)��3&�����`�����o��0�e���W��XM�R.lTn�*���&
+��;�;hw��'��� j��+-p��k�"�\�h����t
0`���*Ff=��HP�P����2��$LP�	�(USQ�B��J1S����l�WeX��c�*w8�`;�`9U��1�����ʆ^۩���d�2��1̂Ŷ�b�&�Ik3���i?|�އ�~�Y��f��9���spZ������2��v���E�,�~�2��H��.8�&����l1�5YDA�lj��wAm�e�2j�h}&����I�z���k��ܱ,�.qاl�Q�}7���o��y�F��|��m#6�j,	��dnp�؇rֲ7�<|��������W�a�4�p38�d?�[q*��_mq�����lYl	)2_�lj����
��Z��F��"[�-�|�
+5��D)�<�m�|��r��Ϯƶ� ���+;A�1g�)dK؜3An�%4Y�;KG������8?��;	w� �^����)Oy��A_�9��|}�[���h||���~|x��|�̗���vi����qᰙshT�f��m����^LW;P�v����X���F\�~���p����YyMx��i�v�A������|���?n��o�{�C�C��6�I��A,P�2ZAUe�z
ލ��� Ɛ�8D�
�!*6�:�iH���PK
+�L�>	���{
"org/antlr/runtime/CharStream.classmPMK�@}���Vk�G*�? ���=�
+�޷e�[�
l6�8��:�*=���xoߛ������	��	Ƅ�q1'� f�i�4n%�V�_���]7�jSƙ�b+_e^IS�K�?��eb�]�R�Bŝ3ϛ_�V���ً�Ou����0���_�/��n�\WL����*���!�ն�y���5N�T~�F�u��8��߄0n���B�D8b��h
��=�����x<�����;��>{�
PK
+�L�>q���W.org/antlr/runtime/SerializedGrammar$Rule.class�SkkA=�l�I����Y�Mu�I��+~h�#��d�n�̖ɮ��J�����G�w&A�Y�>�{Ϲ������Z�)b
�%8��hM��6CM�����6
�66,ɇ���>��r9�;�
+�`�!�
��;>�{:dp�K)�~�G#1bh�#5�C�D��P��E����!W5�Kx��(�Zkiڨ��� �#=j~� ~� �T���Ǭ�Rf?�2��@�ɰ+�k�
�VQ���Z)�Zz7r��y��t-mY�������(u�D�ē@c_���-*��`-�p��".R�Y����P(�����`��-Tml3�i�fX����{,z1C=��YWk��''B������RL��=S>��W�j��P���S��OB�!ٲ�$�9�P��+d�R��r�|�k���Sd��Yo}볩�ft�&��"�mB��u:��
+n`�`Ws�D�;K,t73�g�X��ܛS�/�N`�d(�&(NP���5o�&g�9c�නwh2=]Kh���o�PK
+�L�>�z��-&
+)org/antlr/runtime/debug/DebugParser.class�Tks�D=�G�m�<J����
��G!%��8	�1I�M�&- ˋ�֑=�����B�M&0��W~�ݵ�(�×����s��sw����\�
+�&��Q���8��p#I�sbZ)7��B��8�OPM��D����eE�V|�`�!�j�ʵ���t��ؚݷ\s�k-�췵y����L���g2�S�1:�1�
�1��`�jZ�{��|^���[u����쿡�]�F�m��q��@�y���.�-�3�*�g��_�o5��ЛZ�u
���ۦ�{�1���0L/gU�y�i��.��8e:BC�����Cў_����
�q�+�2haǃ��@��aE:��R6�umw�����t��P��5��UW�5xϥ~�d���K M�6�5��X]���Op�u�����t�kS�V�WEN�÷y���*�2���HI:}����u��Ja%�\R�*>q2�Ի}������L�O�Ł	�ؚA�+�!�b�T���*��[b�U�p^A]E�+XWqw�U��M�TLCS顢�6�Qq�(bF�}�0\8��"��~e��jk��-r��v��U۴\�ꍇ,3(=1��C5�5��\i>�+k?�(���(�p�l�G.H, �'�c�	;�X���|�^�b�
1a}S4"C(fi�=�
��?�~�R��`wK�=D.�!ZdO+F�"^,�b�g	z��)�
+h�q��.�{y2�5Z-@i�, Gd?Q�����7hOT��yr,Œ�77$����9�J�$�{
%���s,_E�W����=�q������(��2)�0Cu����TY�*�����Qm�<"���I����J�HKt�gOw�(o�QV$堊AJADO
+�P��49y���|���(a�A�C͇��y�S9�Iҕ*�wꡲ�<�-(��F-�j�W5�2.J�RMV�m�*)T��E�g��V򒾼K�CI��	��BO��R��(�}�F�`n��N�p)�p)�Km'd�s�
.SQDYT	xf���&����GT=D1���kD:2�a�<��bi/	��>Ƃ��|I~~E���3>G�,�"U(���
PK
+�L�>[��t20org/antlr/runtime/debug/DebugEventRepeater.class��ySG��Y�c%�1`�1�+6**���au�X
+I4�3�:0��A�e����o���R�|�|�T޷gX({�%e���������������_3p6��$���S�Ir��5��I� y��-��$o��C�.�{$�|@�!�G$�|B�)�g$��|A�%�W$_�|C�-�w$ߓ�@�c3��?7�/
+�,��3�y
+�*�^%�9�����M��
V*�q҉
��Ũ��M�L�����OǓ�
+$�\�)�V46�e�-hekڋ��Y��g�sT���ս�+�u���^�W
+�p"W\�6���9����NeP�!gmO�m͛4-6��ܒ�S���)�i��gR��#���s�5h��P����6m5�nVM�	��@�0��-��x�F��\a�x��Xƨ���
+��	�]wڦ,�����m$-ݬ�����N5�ق�ưMW���w<�F?lvX�
+#��S�a0'�&�
+�JWL�Oqa�8�&��5���hˬb:�F�h�
f�0w����ΪՕ���Vpeb�:[��f)�i���s�<n�Ī���<c����lD���������Ňï�`��;�S�k��ѱ��5a���F�O�tp��)�2���v���_�o��V�K3�s����=�S�Cȯ:�I'��19��\�`;nC$��ݰO�ka)�����e��xM�>�W�Ͽ<������~(�c�h�K{��<��l\T�G�y7�tF�
��s���*����gT腼
+gI���
+�$$�pI�a*]��aB�)�\U�:��Q�T*Q�xA��T�D�/�p�J�I^
��
+��J(LXU�&Y�W������3�S��C��x�kp�(��b��PO��$$�@��OP�{���o���n�Vh@}{�B�ЃOak8���KDŝJ�G̫؏z�ݿC���44��	[
�洣a�Mū�4��,%�|V�M��3{��ˆ��QY�vnAcB���5�l
���p��_
+ka}��6 �5��su`������ڂ��yI|!�J�a��7,5�M^�c���dF4�/19Z39�%2��;�d�dE�%&'�ynrJ
+SE�@7�#�U�"�xP2�k��K#�.��V��%��kѴLKam"�r]�L���t� l�)k��԰U�R�8���/��ؙ�����]��+�	��M�|�/𦐬�GD�#��p���)�쀘�hlfK2�A�0K��N�R;Ġ�%A���A����d���&b�ݖ	����%�uX�����*B9�Һ,��Ġ��aK�yP��d�hr��I&�u���:�)����������J���p�&�~ɸO��y	w�Ƶ�i��ܣ"wA�uj\7��Ĉ��������s��l���.p�G��]opxwظo�����/D*U�Ԁ�>��
PK
+�L�>��|�A�
+Gorg/antlr/runtime/debug/RemoteDebugEventSocketListener$ProxyToken.class���SWǿw�l�4�F��P,
!5�Vm�
+*�(��uI.q1�fv7�I������3�L���Q���{	�l�L�s�={�s�㯿��%�38���B��YTX|�b���42�����<.�Xb�l���xbੁg��⅁��L��4^�a
+�,�&�DY �o7�@��ƴm� Eò��]p<��[�@��nn���i�KK�k����e[�4��+4�85r>R��U�.��
��N�l����k�L�o,J�Yp���e筴�e�pg��I�6Sq�zɴ��[r[�om�RM���E���r��w7��/9շүX�/)�����y&_���
+�9]��rP��D\�ioנ?H�����DYy딯�[g����t3a�-�r청�^�>���Ȅ^�fe�}�^�������z���{�n�|"���(�{���:������Ϲ��.�:_�!0�o�
�	�H��HkZ,9-�*�Y|J��鋼#Y�a5�A��b��0��,����w���&)cOQ忙E52�Y\�[�"�Oy���hE�]��z�p���[���&p�V��{��V�e��x�`XeLǍ���ͦ�kŸ�y@�L��K�����V���dt���F[�
�qX�#jU#��c�7�$?��44�2����6��h�a��N6�|Br �B�A�L�U��*��d��q��p��Da��d�?�F�ПjC/���H��9��]$q�������L>�R�J�0F�0�+�q�Z0�����O3�@*�q�.:m��T
�{���������@%�r)�>�0�AI�@��|��O��
'��c@�D@�cA>?��:�=yB>O��|���J,H*
+�<�j<H*
+�|^u
Q �bA�(��X�/�A�(H�|j]@�R �cA�Q��X�� �(�E>�]@��T,�iĂ܌Ѣ �4�����i|�b�&�W��G�u(n���I}hZ���NrA�L�l�sewT!�9��;�����g��}��,�vл��ʮ��wp��ܱ�$A&��'Yy<T�Xy"4���@��x~��t��\��@��5q����j�T5$���Ʒ]��}��]�3�
+��PK
+�L�>�����	�.org/antlr/runtime/debug/DebugTreeAdaptor.class�W[t\U��\2Mr���6	$�
+�$�@E�R���`��$-�rq2sH�Lfҙ3�E�b�Eo�RP@0U�Ъ�A��˃k�����/>�Z>�߿Ϟ���9�tu��>���}��o{����y���m��k9���/���󬘯���W����y� �����2zQ��$�/��7ļ"�ߔѷļ*����u1�÷�ݴ�N
+�sbԇ���E���SbfĜ�=1����}1?�32����������D�O#�Ys�c ��0�;��M��;���
+;5iŒ�xa"�Y�V�J�m+c���ē�);�3p��B;gY�1���,.��1�I��F�.�i!�ݻ�6e�����T�.L�[���x�o����xzW<��g�2d�M�
D/��l������kc�{����}��X:���m�g%lq�T�P:Oh�]HI��f/�Z+���Մ'|�G��������0b%��W*��r0aM��{w�Tf�`�"�3�v<Ǚ����2`p3^{���)	��+�*uxJ�j�A��|j��f�bS6��s�� X�nj
+'�������A��8"�0,lghpR0�JX�����|�d�C�x2��!��c����q�i��f�����3;3�}H$�N:��\!m�����l���S6�PN}[�E�[���\(qM���U\�-��M1:��䲓j���/T�Ì��r�:h�_�z�op�(�	�v�y��-�/�X�1cP�<[}WXJT��p�*p��J��@�EB㸱ϓǿ�5��ҁl!�d'��{�^L]0��T_��j���qsQ�L�$��.�����do(�A�.ʻ���y�m}�J[��6�7�3G=�wfR���f�O;�9K��3������������؛�ߦ�5��'֜���K���&��R�Fqr��T����-E��Q,�W`�.� Z%��ǶԄ���I�h��KX���~����_#�1q~n⽸�����~a�,�5���/M�cR̆~e�,��E�m&�����sY�!w�.���n�1�k��a�a�n|D�&�k?&��B���~a�Mp��}8h����)�y�0qX���G�1���I<�,^�e��*O+�{��d��ŧ��,WC�W�?X~��],���`x�ۛsbGxZ;��:�ޅ�B_�W�Br�BI��w5�_��io��n��oS�4�h�)���<�W
��m�B"D�ZB4d=�,w��F����j$D
��J��!�k{f2pK��
���Ad:��|Z�6���;�*Y�0�
T���u5�&ü������ɽ
�&�����<N��]�8{��B��c]�-<�FaoϢ>���t�#�`1n�Rl%堢�w�\�U��U9b>@
5�(�F��DZ�K��0g�����h4kg���4���Q�؆z�F����7��1LlvdD�]m?$��Y�9[\9 ;%Kc��)�����/�K���� օ�m!�P��W�q$h���?̧�J,��u��RfU;���} �;�p7w�Rz-���o��BhA�S�\�J3����_%x�\ݩ}Ԣ57Fm��Qq:a�P�G��T-��8ʤp'O��4��%|˄j�2T�eK�)g����b	R�i��R3�@1�5��_���4�W]��C�%`���z_C����[�3�H�;�t�{˂P�{U��c��~F.Ǣ�)��N(q�r�q����F����5w���:ڊ�-A9[��+��!��~z���,�,v��5����2�u��� �&�T(�_[�e�{��I���W���.������e���,�����6�Nj����kX�E�w�M��T��EE�}��n�v��{������6/���I�mT:��j�¢��Z�^-�U�/']��W�*��p}�[~�^�L	k���J�1���Lب�夻úO��:ɸv��\!i.�oC��-T���}�{x��\�2����YF�"͵��7���h����{.��g�����Uw.�����D��,��}u�NTޗ4ذ.tS���byiQ�)���B6]D��Q�e�4W^�|�����W��u�S(}��R�k\�zU��o
�%�]U)�d��mj���6����"���s��SmMU%�.}��bu嗤ST:�L8�5x�$_b.y��S�����>���\z}vwee�����|���{�
+/����������sU�9���{���W���]��d9˥�V���Ӄ�B<��ߢ�G�=�3�.W~�Dy����W�_�6U��wU���/X���>`��ţ��cOe������|��V*�S���]��3�Uv�?s�_�f�1}9���Tb��������5_jl�珜@Mv�[�p��yx����*��tL�7�S:O�x���_S����$�Z�2�\�����t&h�����~��ˮ\濸��%1�qe��s>��RH�\�<�<�f=�PK
+�L�>��9��-org/antlr/runtime/debug/DebugTreeParser.class�VmSU~n^�$+P�l����4$)���J-/�iS�$����l.aK����`���3�~�N��8���x��Y^�/����s��_��;��C���^C����/L6L�0�2'\t��X�R��Aq�s1[�a�fU���C���_*�R9�*�UéXi�n8z��K�X/�焝�憓�m���0���lC����t[7
���5��3��}�ϱ8O�,�%���Z��Z�e��eC��[�M�⥼�:<3���%�ޜn��z�ȭ�Z��N���ʊj�b�n�M�f?Y�о�Z�LAP7ju���#��P���C�?$������}6w��]���� ����)�9zA#���3oY&?�=W�մn����/4^s��J2F��ʐ���fU�F:�s3�G�m�F9ߨ�
+��u<k8���0v��qFw��Ɍ7���F9�X|�5������p����'/�-n5J�R�o����
Å�	����A)�n,s�ah��E���Q����gTm˱�P�Ƴ�'X�ۜ���o��`<�&>����q�ި�O8o�-���E�i�	!�*|j�4��檂a���<�
+�!.�b
+.���(�OCx�@E1MA	<�
e����
+6QT0���)a>ƴ�Oq�ޒ3>?�O��}������U�4�����d�m���f�ĪBO�P���"��COo��B*P���6l'��w7���t�4Ӱ�UY2�� ��
>D�h�D�hThF#{�V? H�x"�'؏%���j2���]��5	�k�t�,AG��QPE���H�
+n"�[4MP��K���� J1r|rv��K9W]9a�i��HNꐜ%����6%���KM���і�Q���c.��;晊	P�e�t<�FkQ�ZT17`&zťZ��OR����G��K�;���Fw�(g��sD9/)��m���^�l�%J�5�v�xق쒛�%��tpa�M@�=��U��¤+��qʁ�t!��Ճ�6U�-U���	�")��Y8"T%��G3����6�H0B�7( �;��Ec4�L�D�虔G�{��!|yD�*������nnQD�x�dZ���'g��y6J7�6�G�>"j&^3W�7�a���>��St�Y[�í�O�r�E#��'
+��^y����3�e7���'��Ao��@	)P$��=�;��d��'���"���Q�Ĭ<=�PK
+�L�>!(UI��Forg/antlr/runtime/debug/RemoteDebugEventSocketListener$ProxyTree.class�S[OA>��vi�\�E�)7�����h�
46i��7�v,+e�l�����wC�����$6&>��?�x�t��e�D��33���������L��$�|�0Nf��$���-pрifh�,�@ۛ]�v��5�[r��]�N�)�:%�`��߷�,�b9e� <�)_e�f;��Π/���`Nf;̻%�ߖG����*����
+��nѪ�X�Mk���59ė<����q�J��{��Z�x4�w��i9��^��7K|�V6��
W��onqG��:y�*86�["u=�#n�2ˤ� ,O(ɑt����E���ثs7�YG���Q�m.J��ә�٘��A=��H���B�"�f��Upk^�߲ix���$�JB'�&��Ih#�N���d: ����݄
���߁��C��YU��������#O��FZ0b$G�V�۔oW��O`�	]h�q�40��d�
�F�e�D����D�
�e�[���(��`�b�=h'��c��
{�!�8	Oa��<�4����0
��f�ncN?��H�I�dDb"2"9��HPTF$)&
(Aw��*{�G�G6�	�ޑ�z�M|r��C9��)׀3�
+�g�mLn��m�z��
>���ǽ�@�}���g0���}�q��E��o��k>������� 8���>�L��bA�B�v΅A䏡�i�xBGR-��O�J#�T���Y�S�M.�K��
PK
+�L�>�-���-<org/antlr/runtime/debug/RemoteDebugEventSocketListener.class�Y	|T��?�-3/�K0�Hb
A 	�Q�"a�@��e2y$#��8�b���Z��.UA)���H�j�V��Uk�b�R�����}�s��d�j����{�;�=�=��������r���sh+#�F�0J�J��<:@9<\>�xl���8Y+�r���x?���	<1�����q��OP
�$��2L��)O	Б\��~���xz��y���!D3�|j���Y~���f�0Gh�z���e���P#ü^<�O�����P��
*��/��t��j-^�k�^x[�D�/�|�|,�8(s��!�-v,^!�&��e[|��+-��*-
��Q��,n����2',Nʜ�x�̫eXc�Z�ϵ�<��Y|~����e���/ȡ���2\(������k�F��5�o/���5��R�/�J���r����W��}����*�������5�������:�\/7X�c�o��&?����I�7[|�|���-b����[en�x�̷Y�S��[�C��.�±�ϻt�)�]���~�G��[�v���^�;t=�'�^~f��? �-~��-��ŏ��~~����r��ck�.�;�]�:�i�`"�$�.*�҉2�ͭ\t֌�g�,8kF����똸�)wZ,�H��Ӄ����tXLV$�H:�TV�7�>OE��gl�Ӑj;]���h�ڣ>���5���&������H0�4�.G��6Zc�$�B�A�a��RE��غXh���K�&�ńcc�9yF<�T;ha�30���Z�‰;��N�Q�MGT���x"q��x��%��85�ѭ5�
+�R	坪h����2��$�����p#|���wR8NNf�:�?�ơ�u:|0-��T�M5��'� �Q����Ӄ�|{@#�F0'v�Z�%�t��wݘ���5!�5	W@���3+m�Ht���;iw+m���ku�ȑ�J*o�.�bV��¼T�5���N�EE0���(+:#���(WE�I'�ޠl�t���T(�$ �O(K8ݴǜn��e���kL4W�&G9�Z�l�Zψ8-p��_�-�{y���tfW���j'Z��P3�y��w���2�úN7T*�"�gFs5�s}�4�uB�&�9<��*#]
+�fX�*LM,93��6f�j��Uni	{J���������T*3I��{j}a9�ub<_��I�
+�S��t�	
���HE���ȩ�X�	��\Ԃ�p(�t8k@eD����₂��S���)^۪��"��(;fҭ�9Qgum,��X��s���XyP1��biT;��T|FTrZN:+�4:	�%>שQ&.�%��F�_X�p�O���=)y������ʱ*�7C-ﮪ��Ы�0H $g�H�)��*�S�ŵ��Q[B�&'���:�#����e#O��3���*e�"*+��D���AK$Ӆ/�G<
��H
+��H�8�MEg$B�V��Y-ц2�dS&�.zR� �ƫ�;�K/PK�C�\�LG�{���6=L�۴��mz�v�� =d�.�Ӧ��n��د�)T��}���Y����A�ټ��i�p�L��t@���q���R~��͏�~~��_�S6?����=:�ȿ��Y~����7LG�z�
Z�`�$a�m��;x�g�"��w6��{m�=����lw���1��.�6��ev�{��\h���K�Z�?��ſ�����V�3����Rѕ����`u��̬l�_���/�c8��8��Tı�>h�"~U��p�.q���2���_m��f�2~]��ץ\ڠ�z	oP�"���n�f$�)�~CD��es��[tH��g�	��I���������[6G�m�7.vV��щz4��Ѫ��w�#n�6.���E����U�:q`��)��=�`�ZϺ��y�n�ӕ����~�����ɯv��|����G��٭�+/��H^
���F���n���a��.o8�v<ݹ�^�HJ�;��i�^�e�Nbm4d���E�Rc'�
+@�[�Q�g��pZD���������1����`X�	�X_͟B�U��l�Ŷ���S���g(�!��"�����w�)_�z�s��ͷȦ����ܨ�ڷ���B��pĵq����㱸ئ�n@�8���S�p:�������y�|��V�J��Y�$l�]c\=o8(�i6�K����o��ak�fؚ��l��ou��l7��h�Z¦�����U��^�H>Ѵp����c5�i��n��k8w
+l�զ�Q�-e��n�q�Ȭ�b��k!����F���Y��]�|E�=ZW9���iu�Q@��@��#�n!�Y�u��̕�ZkbӝHp-����J8ڔ�;M��:�[�tdvL�'K�.j�!'���0�vc��_��]�Ȭ�/��{�	�T�=���oqi�b-��isE$����l���N�Wj�ܻ&X�Xg��s�I#���yq��0���2�u�iRJ��	�e�ü!�$�*̑U���͌&��{]%^� .���s[ca*Y�o�}z�FH��I�q6�K|����{�9����g�!U�~�w�h[�-$��j���ǡ��$?��[q�6?�{�np���49���ǻ��Z�D�/;ט,F�ۘ��Ɛu�
Y(�d��,��ǯ�N� �CdXN"Ր�G��b�*�8Ѧ$N�ȯt:Tb�6scq��K����`ĝ��he$�4髝�CA4��R��md�@�A;����4�#3$��Q3�4jƛG�h�Ռ����*:��\��{|x|x!a�
���s���n�l`./�C\»I+�v�^��&��t7�%e��WR���%�d]O��RN�
+<x���K(�q3䌡��N��t,���i
���`�t=��Վ���+�ʕ��Vb��Vb�N�am'<h���F~8^�z���Cv;���X��G���N}�훁m��e@����껨i;Q����]h`��e0L�G)O�s1N��j�K5jv
�L}0���X�A0�(�2f�CP�GH&"\��S����l.��8���eO�=��xu��
��D)����TP�|�߿�H��!�h��2�S�ܽtd}Yޠ=TT����tT��=�=4x7
q��V{���BC�U� ^_h�cv�m��F���5epѠPB�fZ	w�fW@]�&
y��L*��Á��A�jP�ȭ@Ěa�J�-0IL�E~�O�����M�"��TD���0���
��L���k$'R�k4H�r%@�讓�s�L��
�If�!�4R֞��$�>�%���!�(���}���l�[;���ڞ9��H\��xZ�ęs�Q�����O�H�I���g<L-ܸ3�0jB�Χ
��[h;�Յw`l�Uj~!{���z����t�߇�M��
D�����E��v{�&�d�M��C�`������� -�W��&����!l��>�6�#����
���������oǺ<��1�<��I�<�?��x^�;�{�����?�7T�Ւ��P34�\5���Ei��Փ�J���R,}F_@���t0���T� ��sKʌ��T�
kJ��
+����hU��!���0u�cPF�ނ�oC�wp���!�|��A�q�
J�?�]ǻ�zY�Nj(�h�A�'�Ig1�0���K�;��H��i���O-ol;�s3��.�z+|?��p��`�Li���P(�9�C!�bnv�Q��r����T���K�G��;���;��&���;�ϛ�N'\�܄�����Щ�\*�E�$�Syr7�4��Nр*�)�"+i
+r��i@�	r�Bw!�m�;h&�6�S�0K$ld�B�&A����d�"��i��$��}Y%�\���FwP�H��y�	�|a���<��La��D�PIW��5i
$��	r�B�b_w�Ӆd���g0�[�|ѡ��p� +d���|3���|��D~������j�c��x5 �0�|�f��������Ҳ
+����|��
+�Bw�r�L�
+b�S�٦��ԡT������j�nvZ��7�QM7�pV���hD7�HV��6M�?�,���-�i
�f����?�	Nx���
+<J92�zŦ�VU(o"V�~�r�a�b����/M΃'�mA�S�!^`T���*9�C?*��T��{DPE���̽����4M:�oU���}t�l�^�|[I��C�b�C��
�����Ǭؿ+JL���}�ǞfS����FBy��P�ɓgDʥ_��z��^u�Ja���a����
+��}�a�u��"uԾo����e�t-�mӶS����f5��M~m6]���9��/�/��(���:�g�Neղ�9��ئ�8�n�>t����G��?����M.��x [\ȃ��K����(>���Sy�桼���3x7�p�1����G�x�\
+��q_ǣy��]<���q����q��x<�ϓ�>Q�IZO�F�)���M�JmO�jx�V�ӵe<Ck��Z��Ex���Z��h�y�v1�hW�<�F��m�e�v��vr���hO��Y>]{�����Eڿ��1/�>�%z>/Ջ�L}0����r}"7�S9�װ���
+��f����j>[_�+�
ѯ�~
���ܪo�s��8����'���ҟ�U��Z����Z�]>W����?�u����Mc�7�񷌱|�1��mL�
�,��Q��5��F#�Q��H�%�z�Ը�/3.�ˍk�
+�f����W;�*���x�`<�?4��k���Gƫ|��_g|�כ�`���y|�Y�7���f��7�x�Yɷ�5|�yo1��O�o5[�����͍����wH��O��)�K� �4����&�ѷ���-�G�6
�k�����!����v��
z����tK�'X��~�Җ�y��<Z�[���К�C����E�k���O������__��ǿ�C��u4
8�m�?F������DtџF�#0C�O�#h�����s��(�^��gL@�������3f���i�Q.Nӫ�K�J�n��k7w�����ؑ������,��{�����>��8���԰�!t�0ЙBg���'t���]%�,E�!�f��t�6���nn�I�.�gހ�.]�!��H�����"}�*N�E�r������,-�+_i��]�K����V�ܒ�*,����|��*�+݉�&�wQ�M��*ƻn�Y�=4��)ܡ�ӥ�*�_�¬V�0Q~�k,��)���z�7V&��2��
+߱^��x�R!�`v_��=�s��r�(�k��������=�-���-Gu*�IQ�I�_�~eE�0�e��х$?��=LG��i?�����Q�aM���'M��ꪖvÒ��xn��BuRtʥTl�d�����5<E��p�:=~dd�熉4L��W.�����q�ˈـ���^���d]]���=����<��M�����@���;r��'ߒ�xI��K\@X����2^(�'����^��l]�~2yW_�~�f.ה��N?�`�7PQ�����Z���r(~�j
+��t}}i�
��q��O�I�p#��|__k3��]e�
+vS��}���}d
4���r+�B���l��M�<��Eͮ��b<����
��e����_E�_���@�ߤ��-��i:�C��.2�=Z�Й�O\�R3D-���'�O�\�<}6��:?R���� �����".l:�����8�,e��e]:�֩_n�
+Ao��Q*��C��e^��ݜ���6W��ݒw��ؒ�����<�F�)G3(OC�i���(No_�C���C;-û��	Mߑ����H���$>Z���j_���V�
�ـy;��/PK
+�L�>%����
5org/antlr/runtime/debug/TraceDebugEventListener.class�VkWW�2y�%(bE�y�Z�-��h�,D-���G��8L|��}��.�Z\m���~���w&!�ۺXs��{��g������߿�
�5��~\��U\��:ދb1�0��X����p#�pSLJ:�u��\5t,'PBYB�t�踭��qG�]�,�:j:��p�X���5�F͵
󶳒1,��d���U�q!2E�=��:ϙ��Nj8��7�^����B���i�B��,���\�Jw�.�k�cʹ�vo������r}��FI�H��}a�ys����b�
+g�.az��;�}#S1��̂�֊"�;�.U~���C�� �
+n���M���*���jږ��-�!!O5=�
+�r�!�ΩS�
+���Q��[�d[���(��<�tn��(����>O������2���|=�#�/jH�sm�L
+m�/^�������|Ѿ+,OLK���rEÞ���|rVY<�dY�쪘�mW��樁ԣ�x���ڕ�g�F�<}۬���Q+��7�^��>e׭2�J�ڽ
�<Q�+���>�.Ů5h/�u�$fM�k����I���Dq?�������ߺ%{&��ԁ$��$>��Q|������7��F3)�/�f6�/�x�'I|����Oج-=�S��|���O3�)O+����@�&��gO��#�6JL{��r5�?�-NL�@w�Nt��J;Z���[Un�u����jڙ+���
+�*�(�V�a4�ش�i"?}��V4�Jo���΀�,kM�*���h�?����:���eޫ���
�o��*��p�GwuD]�m>Y
�V|���9���~�Hi|���hb��A�f�~mx���r�!�����#�#����YP�De��(�}��I�����;‹���\Ct���5��ct*fG[����}����;�%���Ǒ���k#vw"j�*ք��?�c
+�x0T2j�P��e0c��PK�ۘ��5tuo��O#8�1d�;�2�	DZ'i�h��i?�SzG�����_�#�7|�
+����p��>��]4��(�'@-���#�S�r�t
+$"���B7����$���*�)��c�:xn�e>���0�7}�r���%ItTџ�M�φ}[���iT���0����D�fr���%�!2[$'�ɤǢ���򋾤r
+�Ԝʩ�g�UNa"�R9E�y�)�u�6t@���j�
�[ڬ���j�zI�{��n�gk�g��ڳ��"u��R�O�r�}ݧ��O��φ�y����
�wo-�;���H�y�r�E��&�iRͪ�O3�Y%�������I��/�%�|��#�щv{7
+�*���
t�J�yV����O4)N�m���ʪ?�%���K�:I,�!q�I�������c�o �/�D��ז�
���H{�-$�4I���KZ�J,

+��PK
+�L�>I[�-1org/antlr/runtime/debug/DebugTreeNodeStream.class�VmwE~f�V���J��VJ�"Xh�b%����(�ӥɦl6�"**����9�� �������x��]�m-~�̝�;�}��l����?
���I���5���v���Kf��k���e��J
+�,ͥp65>���<߸�˛����K,���<|��S�wxy���y�$�O���g��ɒ@O�j�����]��"��r�^��x|^ZNѬ9Ғv�@˜6未-�+�cK��ᘫEb�5Ww���>Z��c�2*t�ݴL�4��Ƙc8R@\H���3bس�̋�@��U&2�Dg�'��tW��hZr�^����1Y���bu�(O��ko3�̘5��+[irx]M:��i�|�C+2m-I'y��L��2���Z�z��G2�gK��^�f���a��g&��)�t#dE �)t��
+S@+��P�hțοq�e�*��٭9���H&4Jf�B�U
+�j��Mʰ-o��*�x�K–ei�8�5)gy2h�e�)���1V��S��>ʘ�\�Q�Ҥ��U���J�͙����T�R9g���=o�ǬZ��{s��I�Ï�l9W6����Y���%Нif_(4��t�b�Vs�Q 7��5�:����T]G��	1��2�y ԫnTO��!u��1t�ఎ�uta���8�cv�8�	/�W�N��c�:^��>�����C_��
+_�������
|��8N��"�RA�0/O�t��Y�1�'����xK�\�qWr�пԾK$�{U��@v�M.���tT�g:$U������UzZ�ܨ�PԄ	�z��]aaU����ސY�<���7��'ub�r��k�P3���b�L9�9M�=�K�>Z݆�͙����ch��cD�����>B$�@\C��	IWC���Hи_��
�R
v��X$���⦰I��$�$��l5��l=.��h�3��EKI�{�|<�P7�Z>j\aQrGxXy����͇���W��*x0�ƻ|�#��9�FC���T���B�IiXd�NQ�!�7�����N�D�Ύ�̌�3��g,��4�kX�w8���N�96���J
������@Ok5xb���QOn�p��Բ��"�Y4�YA�&CE2>BQ%#gȇ7�
הO��#��S�S�[�ɿ�ډMx�"%���^P��<�<����x:�`	�qbr�8L���d���`��3������w��7��[}��hz�Ϫ*�bqK�9n�v&F���׸d�ɵ���La�B�W�������r�E_/���V�T!�#� ȕ�V�j �q�7kإU"��S3Pri?Ni��J��,�����F�!��ez,*lXo�Y��YT�h��w��	���}��%��d�>*�4�X���=���r��9�����S��>\��3�i��Yd��p'�=��t�'�������
�M_�pϷ6#�E�?&�$#ޜ��4��L2��7�)��P��1��0�u�&z��Ś@���Y����>h.�ǘ��)3���QM��e:��9���L��>ӕIzv�G���K�ç��t����a�F`Rݜ�PK
+�L�>4@1�3org/antlr/runtime/debug/Profiler$ProfileStats.class��]S1�O��`�oE�o�����L+�ܧ��6t7���N�_y�����r�[��8�ɓ��Mz69ɯ�?~�cx=��,/r�R@�M�B-`�x,���9��(]{#�O�I�Ip������+c�GĞ�)>i�%A+GVo�'`��[�*��vuL��L,*�M4ֹ���e\c�+����ۈ
5�/ڶŒ:�Vg~[x�L�f�QFӑ��#`���2��ldA#kx&�KB{}����nbj��-�Q-��iX�>�d+��aؐu�^��֕:�|��Ş�ͫ,�(����L^��y���Y���]b�̬۰ܕZ��VSI�:����A�Ra�TG���h)����D%�u[SSmOg��
��&Foۘ��
�0�״n
+�������%JIE��h��	FM�Ř�dⶦ+eg�UZ������+�]�����1	�heշW�H�G�(;�`_\W�F�l����J,m��=��|y��SM͡M�c���I��if%;�n�P%L��w����sצ}�
+k9x%`�V0��9ٯ�k�ӿ��e��	����O=�1f��d1�3��a�
���c�3'X�dN1��3̛�Y�s�y���\d�f.1��w�w�+�{���La���u9���;�o�遇���G�چ���[�I�>��@[&��6a�PK
+�L�>�*�R45org/antlr/runtime/debug/BlankDebugEventListener.class��[S�F�ς�/hhB�6iH/��Ă�$MHC­(uIj�t�7Y�:����X}�L�
��:={���R�>H�������g�����
`~��$t+pX�_*����Y���dc���8��ڌӃ,�Qq��B�oǾ���}3XJ߰��Z;}��i(��E�	h/�;[�Ǐwds���͒�r*6԰KE'���F��w�9�w��`��1>"����E��c!=�"�k,�@Ud��*=c�ަ��|�(��Jܤ';�%0��YO���g	��������/��C��p�$o֏�0����T��G�K��VC42,S2J!��jNb4sƏy�E�0>�s��c��S��Sv�0
+-2�}��D���͆�A:a�H��r�fJ�w��g��ɳ�S*Gӯ'���$�-ù+��q�
s�=��6a%/�NN�V�>]x
�lJh�&�s_�\0h_Nh��4`�� x�q�_v�x��R������qQ�c���1������ ]-헽��Oq~|X���GW85�F���n�}AqK�i�l��߶�5���E��鹃8�(����J�U��`�
�@JB��}ݝOh�vފ3�B�Я�l��Ü*�n���
=Â3#��w�L�T�xF
+�����@�8��"��yu�E���p&�E+��]�/��w{~	~��?����	��{J
~
5|����4~�\�%�x�I9v~��pQO���5sj��~/�aK������9���-������X�#���;�iA\�Om�������P�ܴ�k��9ܲ�W�gq��6���/�K��V����$��;v�cA,a)XRZ-Hiy�Ra2���kz���w�o����^Q�9��#'�O�=�����2{;��]/��5�s�T��j��@�}T*��۽x������r>�q��
+x�yk�cs�m�U<�U�ľp#w������f��M��G�́g8R�ʁ�v=;=[vĮ�mG�Y;6W~(peW!��tec-������_�an
��!�m`?�������`/��'ǜ����O�l�–���g���PK
+�L�>���;;@$org/antlr/runtime/debug/Tracer.class�T�RA==�NF4Ap
5�Y�q�XTp���(oNHF&3�8���/�'�}�U-
�TY�����	�
�R�������������+�c�Laz�肩�cIljN�p
+�u�IAGog�|.��)�.�M��l �Aې�%��0��:pE�U�68�l=�U�i{��A���4-/i���s�t�%����pP �[�+?!�+R`s���H�V���]viɔ�)۝�G���p�yʸ����r�j����')�P��ʫ3Wzb�٦k{U�܎W���#��kc���6ôWeh�l�=��}Wŵ��|F�O�TH1#�������(϶��^�5Ѓ�v���v��qÀ�����e��]+��?���6�5p#T�u}ƞ�v%w<?` ��:5pw
�Sq��,Kך�qFz�*ø@�_��i�r�=�
L����P`��I0�1����:Ǻ������G,��e�m���_5]g3��o�a�6[�*f��ڱ���Y�U��V�S3�}+���\���E`k�G�	r=֡���vY�Dw��TT��lF��4���^��m�h�������f�a��܍�q�\��(�>A+?!�>r��1C�}�8�$
+hGYZ��n$�D+E�F�~X��^1�V|�����? ������x��'w�'��$H�ϴq(�0��@{��&�Dm+e���� �v7�uS��$�(� �ZK-���\��&E��!u��RW
+<�NS�
+<�$���@>�E�UFQ�"5ž#�i���t�gd4�[@Ǥ�p�U��yt�[����%�1O��V\"-�������
PK
+�L�>��/�a0org/antlr/runtime/debug/DebugEventListener.class}T[S�@>���r�Nm��ĥ���P&�<��ə�4�u6	�_����r<�,�C+ɗ�\�={�n~����a7�������l7��/�5�Uo3�4���\ѵ[�⢻�`�@�(vE|�	�#�\��\c���$�L�5Z���"����`�V�l�2(謽 &u��Y.y��Lig+�d��z�lZ;�������gi�T��<��6�۲�DW��T]��([%"�!�ڧ˩��O��Q���F���U�13���`R�w.|�Vj��`��}��Ŋ^zK�-�s�����z�+xj�]z�-so�*���)�u�~O�ƿ���0$�(�9-N�\���3O�!
+�b���_6]:�>���a7;���:y�:6ґ<�R���T�w�SH���м����"DG�����YJ�����<��U"��޾L��*���J٘J-�(�xz���tkt$<�Q���y6����X{8�������L��芍�2=9b��`�x
+}^$^�eX�с�i���q��9�+oü��aI���pW�=�_��������P�#x��{j��k��0�	[f��_^5h�q[�K�����kx�Gou��PK
+�L�>�ccD|9*3org/antlr/runtime/debug/DebugEventSocketProxy.class�Yy`�uO�cv5X�@H!@�Vbč
�KY��v�f�+��p|$8�c�رI���I7n�خ%b�����u�n��q�4M�������fvv�f����������{oV������h?RJ��W���_)Eo0�M�~K����e�?�৷��w00�I� �p�?{5�i:����9�
+)�A�,"��ӂ4���<=H�x����8$d~����Ƴ��J���\@�*���s��T�j?����)��_��5��x��]���4�D�FYh�8,,�5nѸU��i�L�1��k�B�w	�w4�4�+�=ȫxu���Z�ɰ^�4zQ�
�i�F���2��7ɰY����sko��2��N�w
+�9_�q���Ҹ[�����J��#��2�ɰW�}����4�x���k4>����:?G�<�4{��m��v�ܲu���۷�ܳ����;��u���l$��I�&�H*�e�3F����ME�x��u}�X�-id�z�|�d��$�9}(����Fwd�C&U"�j�ͦ��!���r`0�܊���`=۟�g�4vK�I�����ܡCFڈ������hj(��H3�w��CmP'�nK����Ѷ9�1zl��Gb��l
+�]ȳi�h�ðɤ%�Ǔ��F��Ƌ�
+˦}�tG*�L�'�����&��R�Hb_$�wkѓ=�0��p�����-2n=f$�����S'N��)@�*���H2�99D���R��J�;�sّ\�5"�ʳ��L5��g���L^�!�����v��D����LZ45<l$�@��x2���q����!����l:���%'���5��`��H���5��к��ҹ�E��M	��4v�fiD^4�D<k��Ion�|-��xx�`a*R{{���b�ic�~a[M���Pډ��_X�h�V��t�a�/u��k�[Ȩ=�fUQ
+(2�;�(�x��bF��\҅�S��o�q�YX}i�x<���P<��›�'�HN備\4jd2�r���Hټ5��=	�6@���ee!�����M�R-�M�����a&4l�){���dTEX,?��1��=݃�����l��d�Y&'�)P�Y��V9���=x�ͪ����"�ӝ��s��%��p��!�F<�@R1�N����,�Y3N��ٙ�'�����.`�ө�9F�����.
+Mc���d^6zR��{�g�
+ӟ4��g��D̜�51J�Z����:�bOZQz��/m��Ղ�B#�@nN�1Ta:���ӕ�z��tֲU����/�BWZN1ٗ�;���4�zYn��u�['�(nA!��TxM)�w���D##F�q\�{F����"Y��M��QC��y��u����!�i�2t��Q�cl�t�N��z�NY��¹�Or�1��N�踟��}��|����/���}�V�<3U��M���&sC�$u��ޭs�G�ɋVV!=�¨���F�	
������n��z8b��p/�~��^G��|���b�ex����v���~>��
�7�M:�,�7h�a|wp _�QW"�Y�
+j _#����`�����G9je@��O�謘8Z1��a����Wj�~��a6��jf"�9�������:��[��>��φ�o��v:��1���!�@��~����~�C�;���w�u��O�n�z����|����2|D65+�*�싗�B�ݖN
+��&t^����3Rtl��*o�\+
+�Ӣob�Sƿ_�2�%�.	�3�No����%��d�J??��C���G'V�m�l��!���Q
3:�b���G
+��♬�����X
� �n�-4��5�"Qq7̒߿�jܒJ�پ�Hwj�����~R5~�!ә:�{�Nlԛ�w��kE������‘D�p5��Í��f����H�K$�`##�4�-SJ�v��eS�
+��D.sXJs"��kf8����L)��G�������W�c����
P�K5�����#��'��:@�]
8��H&�E���),��8b�c�ԚXX)n����HzO*��;��F��� to2~4gH��ڎv������F�vy�Պ�)
+݇���0s�l��M5������.F�;{�i�E뽺�c�M�ɤ|��O�~�I �6%��zj���h!%)ED
��:JLi���鑎s��0�E=�ܨ'��D��7�-ꉾ�0x��[1�oW`�T䄛C�r�J�Vbޏ1�'���&�
�:��n���0f5�%���x��Y>G����'�<F�Q�[G���JA�<�a���6�B!�Jsh��v%<l2�����k�=J�L`�b�N:�����b���gI{�
����s%-,�cT6J:f�g���s�ʻ����Ќs4s��S�4���J�jN�y�;�*TUk= �7P�գT��P�͗�yZ0p��BǨ�><�h��9F��c��`��4�N��;�ԅX�EM�M�i7��=��~�(�"6�`�t��ѣX}���.��˱{}�XO�M��?�~���s�Qv��e��8a#�
MW6�O,��>�p@���M�J�`�☺p�a�.1�m4M���u5?C����A?�f��a��|(Ot�D���v
�K�h
Vr+A;t��
+A���#M���:�,����qR	�]fK�T����V��,E��4�!m�-
ݱ%��!����{C��YH���� �-��Wf������?�$D�8�����Z�X���P��|`]2����q��b���j�Qum�>�82�
���k\�c��]��p�-u��r�"ʎ*u>1�:+���)�q����$�kRun�:�Q�qK�OM���I��	�/��	�Ӣ�ZiqW�Bx����F����L12�4=���g���jRu�:g.�Ο�g,�1K��RV�e�)��rE})�~d��̷�̧������OY����N*�ap{���g�/,�)��6���������0$�.*�c`�5���7�›�Y�}M
+���}�'u��pߧ���Y�}c�p�0)�O������+�.�6!�х�g`��:���.>�&
x٤��g����9�2�b���~���A�{� OiQq���X�~����֥<O_(�6��E>A��_����T/��e��%���}"oƊs�yWK���[p����V5Wұ�,m���q�;�]��B�KQr	H��0�k�/i1}�Z��ͼ@�E�/�z��_;4�gk�g�
+�AtMO�h�[Pu��oT��Ջn,v���{���+����dq
+��
h�����B��
+/���[a��p�x���7!�u���߂��MK�;����El��B�@�2SݴXE:�W���'i�����]�',��)�M�W��7 �w �.��7��Q�ើ�<Ri{��;K�렖F�����9�]B��BGmί,�v�
o�����U�jKU�
Z���
�&D�Cd}(���g�M��C��� �~�x�_�|���F�m'�n�C	�t�kX+�U��IX|��a��uJCV�N�05�@��:
��;�\+J�_f{��&Y/��J��%�Z��%�]�{�����2ً�f�_�Ds0�Y
{'�v�����U0�~���P�gP�M��s�/h���
+��Ƈ�[0�o�h��;��~�.����پC7�v�2�=\Bg��e}���؇L���~\���,o�lc�m��e�t5���`�]t�J_~�ثҗ�f��u�g\�|�ǭ@_$vhV��`'��"�S�a.�2֩��9b|�
~��e��Y��[�د�Z��N�Xܫ��
���T@{�w�T�@|{Z%%��.D3���I38D�\A�x�y6��JZ�s�r�K�\eʗe�N�e��V����%.N���o�ڼ��C�F4���nk*��)����+���~^K?�l����T��Z�
+�R%χP+��J^H빞��"�����K�nPJn4
�J��챔��햒��NE�ef�R׫������y+�n��W�c��5Х6_��F��P�|�5�T��t)�8��҆���QA��7UC'��5���T����o
\�XH5���
 ��^N�y�����
�.E)0�j=
+�	�<�k�r%@��*�\]�6���A��
�{��*� �@�*�t ;�dwYjR[4e�#��S;op�[e�[eŤ�~`�|�
+�I��()�Y�~�"e�[k���7���/1��Ѹ�l)>���4�?B�3���w"����86���k���c��u�e+�;z�fuT�7��~Y�LX���7ae���yT�]�{@�#�o� o��AK��m'��t���0�r$�a���GZݳلx�?o�R�x���PL��/�/d쒾�Юf�0�ׅ����`/�s?��h8DWۢ���V�R��~��}��F�m
��Q��9t}�9I��դ����P�P��E�?�����_X��R����PK
+�L�>�y�sj�+org/antlr/runtime/debug/DebugEventHub.class��mpUǟ�/��͒����IJC_rso�Ѐ�m��MK#!�Ihi�V��{�����t��4�E�Ƃhyтhyт`A�epjd�2Π���3���'t�A�O�8���9��
i�ɮ���ٳ��;��?g���ß^ �k�8��=1:��SE	���/�q�r�/F_��J���W9|��	px��C��u��p��#��M�q��os8��qOpx��S���Nsx��3���Y�q�~����y���z����
+]�;�Ow�l=�ً�
+Ul�
�ޤPg�״r�i��[�Vɰ���̊L)���q۸0�^7׆��
+E��Y�Pm�n��R!#��t&���^SK�w�-���Έ}PB���(e@V9��?h
+
����i+i�e�Ng��e�*V��ږptΧ�\�m�Fnå=2���h��҅B�ڮ�E_� 5��
Hb�f�W�	�v�U�қ�6DN�p�p�/T�?P�8�j�BӋ�i8k�	p������nw�B�D����R>�%���x�85�8�2��g��<\
�1��j�Q,Ġ9*0�y�����(Q���9
+�w�٬0ܼ��A�Z=�]7�b�`� 9fTa���mB�8#r�1k�Ѽy)�l!�Œ��b��]a	��a+A�m�s�H�7��y�:v�b~(A�Eq�Ф�3���( ����DV�� �����&��%6L���ѕ�Y(CC�
+�(��vu�[�a��wfF�fˌ��vs���G�=���eZN;�Y%���y
+}�*G'I�D�i�s��L"q�y&f�N��}�A=�D,�՜����e�-f��������svF�������NJ5n�9�v�̒�	>
��#cgUi

+���i�ٲғ|���T�^P���J?��t��)�\�1�ҧi�J7r�L[T�氝�M�C����K����>�� �[i�J{�Ɛ�U�ǭ����,�	wPN�n�r�S��*�q��	E�J4��$��t�B�����n�����o?>'�Y㐋�#B
+8��9a��KS+��	�_�_W����"v�j���� jJ�'%�
+������)�|�"�i��h�9�Q'b=�� Q-_��kг�IA먋H����P�}�-d�P�W{�暹5Sq�[�5��U��u�;�uW���.�>�V�O��ڍk�T�[\�[Oմa֜�rn�<'x����3]GxS'��
+�NS+�[�)�W�r}�1�´��4V������&�k-�jC{-\���ýeT%�F0>��r�e���6��v�g�����.�E��� ��>���_tص.�1\��R��g�-�v�]�ڦi��Tho�E�h�����J���化D��I4�vB��b��h)ڊ>^��@��>�G����}ms����HP��4���d�k�&��xjL�0O����r���C����9�\�^r�i���d*��� r]�%��&!��5
������,�NI��{џ\8'��h_�4wC�� �1r�Ӏ�k0P��q݋��
�8@������s�����X��~'�~�X�=���
t�~{��
+/�N�H�(�:	��!���C
���N
�q@��T �ahcX�dxc�, ��M3@�`�+4��睹<���4j?C+�n�g�_-T!y���M�(���Q�ӷ,Wz�rϣ������C���,���K�l}L�`�0�����>l��l�ϻ�8>�}��^r��O �4�:�^�!W�I�+��EK�\t
<?C�W�p���"២ɋ�5P�	��@�S�GQ����:���7��oQ�uX�w>�s�q���_�#�5j���
��z�	�ހFX�F��)�yQ���Q�P��?-��W}o����ѻ��3J���]���mt�ꜗ��:˽���������G���!�3@�V/���?!Ϳ �����
�:�j/���@PR�@V�@J�jW����T��v����8���UjC{�R��P�d�V��uV�� t����@W�E��]���e�	����V{�-
]#薂n	�}�)�}��;Jw�tO�
+��
+_i���[��H0�M5��-BS�9��*�S�S��J)��)+$�&do��$���C���ʄ]���E׏]���3Q����?PK
+�L�>s���
�9org/antlr/runtime/debug/Profiler$DecisionDescriptor.class�Q�NA�9������ÁM�"!G �!!�������20;�zwO�
�GY�.�	Xr�]]ݭ��ڧ������>4�����h��Ɍw��/c��L�@�{%2��%Q/'�]�S�گ[��n|&0�|a��R]�ā�~�Ǣu9HJz�i*o9�wE�g�T��H;�Y�͝�N�HLJi�2�g�ɿ��_.Xa�Ǽ����'E���C�m�V����dJ���ҰF� \x�3E�&�$�:vNӾ�YVn����D��"*\nRź_$������
+������>2徉�٭Ҹ�1�����hL��ڿ�*X���P�����0g�!��f�q�*�|�
+��P��q�eU޼��㤆9�#U��[/X�r�_�,16�W�G,b�PK
+�L�>�KmG|�.org/antlr/runtime/debug/ParseTreeBuilder.class�UkSW~r[@åb�Xk50�Z�z-׊�@���uIa!�M7���/��~�t���i���sT��9���g�{��>���������Ï1���0>��
�Q�R7c���[jYc%�(#���w"����b�����c5�r�,�����R\WgV��86�F1��@����lf.{~|937>%��l��tѴ�ϵ��y��IǮx��-�Ū���bq�3s��}��g����ƺ��K{�ٔvE`_�JƪxJc���˅Ĭ@�˶�K�ɝN.	�&�<��d,[f��U�.��E�8;$�d����Ð�n�w*㸅4�ݴ[�=�$�y�Z-��M�"])'�V1/]��\�T2ݬYR��xG[ x4��e� =�8�<��Μ+M��g��[ݐ9����es���Wk 0Y�XE���uIۓ��Y˱:��+*����9�Z�O�,WX ����C�Y�n���FU%�D�R�.^d�*J[�5���Oqw�t	��|����U|7F��W-I�P��-�ﴫ�W�UKe�(K��J�W��V�ϕ9���d��d�әn��FU�E}�*���>�؂Susr�R�o��S*�N��z�&���8*л}<��=����wq\`��Pյ5�Ņ`�pPf�|
���8c��T�P����T|��f$�cl�_���c��V��?0]{X��n��jsJm���*ri+����J�Y.K��?���q���x���H�ԣF�\��o9�-�4�ḧ޽ٖ:����{X�r��I�*b���L�Ԫu��S����~i�I��:O|���������cB�Bk��w��ՀqC�{Jm��ʶ��a�/ېk�:'��z��oh�/0�z�z����h���v>C8E9B9J9���`�/�ť��z���"4Rþ�O������!���8�Sdw0�i6�0o����1���hA�Ҵm��4�}�g��[{
��A⏺�N}wV��^�+�鱍��$��������Ģ���L5?
��N8��c������L>�ǁ�l��xj�)"�L�&��$��\�8�2
+�;�T)q)����[��4��{Y�
+|B�>�����w����������l���9���:W��8Hw*����(g�u�e5�3>t��0&t��n��6Z�۠����
�L��_���:�]���Ư���j8�ap��H�-P^�,���_CoZ��WR�PV�c;I]Oqnz��<	?���	!݁��Y!���r��}��|�\��4���c���C/�M���﵀_��o�7��}
�����64d�[7]��D�
�W��x,j6@�dh��B�]�NGm��&�/6�8Tw8�9�W!�;YB?�s�PK
+�L�>2�Z��=&org/antlr/runtime/debug/Profiler.class�;y|���3�M���  ���!'�nB�`)�SE6ɗd!ٍ��@<�<��o��*h
j/ū���V���Z�G��jk�ͼ��]��񫟼�{����f�{K���Г0����Kؔ/b@��n\�
�
ivc��� (MH�Vi�uc�=�����eڤiw�z�5 ҹ����<0��9_��{an�M2�ك[p�p�H�m�n{:���5�D�K3�2�\�\��N^�Wɪ����øצC�1�Nz�ix�np��7	���˃��x^���Bq��{4�C0���.��[��hx���O����E���}T�=���{P�J�pzXz�H�O���<���<,U����a���w@���tg�!<,�����I
�����?����1n��'��SQ�g�\�g4|Vã"�s}^�4|Q×4������e
�"�^ʿ��U
��o4/S���5��� �^�ׅ��|S���G���4oK�(����!�w�yO���f? n{_$�P�4����C<�y�c�D���SY�i>�HP:�S������
���+
�������W�o4�P#�(E#�F��i��H�(]#�Fy���(S�=5�a�F�5\�Q�F}4�Q�F�4��
+��
��h4�ţ\��)�M�=p��x��|
�h��NC=�

����!��H�Fi�/��T�B�s��@$
+V���(��2�����HD� dY�s�H}8�
��&Zh�G�Q���̪�u��F�Z�o��6�������@�q
+�(#Q0���ܦ#�����@�{����V\���zX� �[�dAmeu�9�kg�.>gneUłY�!�����EQ
+7�2��pi�-
��
z][c�ik�N�5�Uz���l*�b�E���6�Nֆ���ʠ�%BN�
+��e��鋘$���е-h.]�G���@c�m�j���N=�0�yE���p��~z�����e�.������Q��)�s�8D{�DEN�Z�	�RVy":����ȦBsYM��Mo0mIn��@��tN���Y?C���2�-'��D�$���f,���J��g����W"��	��'�MQU�zX��Mʏ5��@5��WF����[�M�cו~;5�6eRiS�@t:BJ�襼��C
��1ł��:=\�g��&������
�@W�)�\�}+Wf��R�S�Hg=��D*¨�F�	�U=����]�7��~��'�j�%8�U�|B2	9Ԙ��o�RY��oj ���I2ͬSl�7p?
��}w��%�vL8jNi�ltC����J� #I������S��R���6\Ȁ�P[s�l+j�a�*T�B��M���d9�x���9	482���i2��1�5��Ј+c:��]2%�+A-�Z�t�K��M�����Zt��0(�Í��5м��5&aO�Qx�p��2��L�TU�A�_yB࿨�h�1t8(�٬O�ht��i���#�5m<��gXZX_6��|L�q���������P#g�m�g�)Z��,�(	�R��E�F�ׄ���l����w+ikf���ư�y'�V}
+g���'�F��n�����mP�G8W���1��ЂP4���`ʴ؆I1)umk35�m����h�"�ި��5f�Ǟ�Ku/^?'VL$ۏJJ&Y���Xl��,K'g�+?~�N.XR��M�u�q��s�;=����_������s�[-:G1���_P��Y᰿Cܐ(�Z�'�р�����k�ȃ�86h�̩�����2!+�ZyJ}�I� &��.ї?aU{����f��,�q �U�=,�	/|	_y�
��ބ��}1���#M|t�������ӄޅ���4H�!���Γ/|�b����^�;|�τT�w�/���R���/�&�R	���˼x:�q�/��q^o�i��&�*/M�S�4�N��o�57�yi
+M��gTr�TP����4�K�i��ɾ-c�,/ͦr/́��T�
N��^�+rif��y����������^�#��K�D�J/ͧ3�T��W�}��X�&T�j,Yo�}b�Z�����-�7�/����w�4�����;�Kߣ�x�'N�!�����S����	��z��
-eka/���&^��2����
&�����{i��ҙb�h�����*�r���
�=��\y0 �_�u,Q���*�����4�ʭ	��H�%��5%6W��AG�b��Sgp9g��I��+gT��sČ��9ǜ����I�]��'�	�6L�� {�A4��5F
s�u�b��m�l�^#؍�4��) �����f�[K����Q1�[����9$M�4�J�����mB�]���l��^\�sX��`^:��w�^����a�l�^����Fi6	����V-�-2��3����v�y-� �
��������s�l��1�9l7�j�g��f���B���9���{`�:��tU�xr��v.���>�|u�:�D�(���p1J�x�B��)�OQ�|޳�:�!|����Nr���ē�m�;�,�����Čq2!���M6bPl
E�z��w��/	nC(e�I��k���QQ^5��r����O�L����y�p6��>Ĕ����~N��/�G�II�|8W-�'��&��\���M
0�ߊȵ0�j���:�p�5��Cl�gl����ۢ
+�1+�٭2��F�z8
+=L��oo\�N���f9�JOo1z^�׺�e=^���I��G3�r�1�%���Վ�uk���udP���!?W�/i��.�Kx�X��
+|)]&E�r/]A3�YG���mID���W�d']ɡ�mE��x(�Y�u���
+��6����a╘Yl�E��lo".���V].=EINhǞ��Sy��W8���&��$bXk�\���/�Y��.�1�j�R�M�����d���|k�
Þt�6��SB�ڐm`Bl��!���B�a�������$gV�J}�0�@l�Qs0�^��Y���R.{�:`��������Ǹ����QsY�LE�Y
+Mٵ�w�$'�c��؁|3p�m Mz����;!�u�	���(
7H�'�o	���V]�L09ɪ�A	��'E�$Ij
���_�{����nu��Y^9�1>�	�s�|y�p���s�1��8f�]my�\��-j_�W!��犨W���C�5!�h���
+,U���@�8�
*��`��ħ�g�q�'jT�i`ɠ��r-�/��1:��EֱPޏM��}��
+�O_� 5�;�����v��cQT��5�>�����3 N��Ps3��x����ıM#��Ya�Z�G���Q��䕛�6'�M�*���D��P?`�$q�V
���E�-�KEP}ĹKb��H�Z'J���=
gqv9�"\$�%��q��uz�*H��k��t���Ţ�ٚP��ϔNK���<��"�~y
��v $�^���b��늝<�&0(�<���	��|
+��%Ȃ��
+���>�]�����7G�4���<��c�:�ހ?p�%O,��|�}���?+����]x�����'�?p����������>�����g���s%��	��y�K�����yH�@��`
v�tBJ�ap�8����]7w�NH�u=�nF���n�fvBO���n�NȊ!��n_�fwB�}J��p;	zp{=Kz��FȄ-lݭ,�EP
+۠�C\
+5�΄+a
\��
�5�������f�fo�f�����2��ze��M�Q���v)�j�*JO����Le�X���.X���V���A?��A��
,`Na��妈��`P7�,l�{�'� �T�tF�ɬ�H:1��������?��pTÝ��s�n%�ϐɖ|5��-#=�XzL�u�Mr
һ`��/��,6'�}�~/����e��2�f�k�LC���c�N���0lL���F����q��FpS�
#��<*+�Gy�a�u��<��MC���A�
+����2(�y�d��K��R���	�NevS� TB7��G�S�#��V�N0�݂�+E���7<�^�RTO�w��^[�KL�K��y��X�Z�b�I��$�T��c�?���C�[�[�[��aJUbK��=M�y,sC�k�a�"��7c�+�A�8Q�_B/x��y�CmA��{�d�<J�8��>S��lv�#yb���D�w"�&ué��A�K�l��d��Zl�Ӳʸ�+�2�;�?U�ӔAs\�J7L'v�������p�}��R��3'5f�9G��,-'��<�snYZ<NNZ��,'-����huB�z��|5�P�q]pF'T)��
��I�	r���C
s�^��1���9NX��>�;�6ǝ�	Kb~Yʼn
�>�r%��*:��h>Wэ��.��|��^��q�|���3\'�u�/���.�{��1����C,��p"|���,�'~^d���3������������.q8�����T�������|���8�!��`#2p�Kc�{DkNAG���H���!�a��E�c�����I�<�6d�\�'�es�Y��E����NU�u�
+�rG��iE�Y���|I>g�2���	:v�du�9��cF/��|��ҟ�%�r�	\��X�j6�ul��l#1�tC={��1
�
�+sS��� ��=S[�C��������Zd��o�C�ՒDc�w���m�:	��}��� ۶j�j�M��ɖՅ'6��Z��Zo&k�)�S��o_�Γ�5�p���cv�G
�b2�s�HL��P�jα�8�-����5�饝˳~1���{��Ol�e1��
+�q��o��}ֶۡ�He��2����ec�np���+�A[�4����Q/�h����8��Q��^�#��M1�=���eQb�l[�lS��X`�@o&-�y�������w�s�v8'`��Z�,2#k�t���̣�xO�{�����)2ç���S*;s��ޒ��N682��0ZY�K�����R�(`%{�ʃRh��Fه�f�هEl)4�V:���g�1;$h��Ԇ�1U�1U��v�0�U!�	��2h-ru¹	�\��Z�q	�ڥ0�A.�x]��9�Q(���/g-E�(�R��c�B	����#�-w曕Щ��&�k<���j�~��m1ƛbHo����l3.7�w�#qfL�e�ͱ��>���t����=!���eݷq�o`�D7��T\2�KV[�!��VǾ�iu�O�&��f~�0��GRC��D��&�&���Ιf��Kl�'
+�
=�<������4����a�I�Y3'L���z#A,Sɡ�cwC��2ۡ�Q�0�y�EU����{�Bw#��M���a0n�B�
+M����9����
[�N��C՛j^�Y���8;�ԡ��p7��P���k�|�\���V���넍�6Y霻����|��oXF'l��^l��Jc��TT�k���ɭb�N&����՝�3g��]p�3�u����5'��`�[db�]v��\e�W��;��P
+�u���h��1Q06Y*�4�!%���p	;�R��ѻ,�c+9�/�<��s��0����V��P���V������r=܇7��x#<�7��x+����۸��w��N>����x��X���8���&����8�=���L��)|3_ű0�gC5gcGL����tƑ�OK���d?�⣎M�f�U�}�/g���I����¬�9����c��
+����.�RA9�c[��ܺ� h�
=����0?u�.0yk0+p��}��{��74��U��Ĥ�#ih��a�}s7RX��9��N��|N0%�kM@Z7\�|��^�16�6O����`Yj���g�,KM��=)A^�8�ڋ��:���řI��?j0��02$��u�r	�Fu�Í�u��6~���)�
�e�����b�'��o�����6�v���m�7�������wX����;-��x�]6��5�O�mMn�g~��������%���-xA<�
^��o�����?��(��o��;7.�4N�nh�zR_@��~0����)f�@�G�PC�`��jM4B�
46�0��N��i8�L#`���i<B�p�F�*�g�^�"����9*�w�>�1���ohj4{��OqM�b:'�d�F�a�aM�%4Ϧi�@ӱ�f`�
+�vjŝt.^Oa��"x/E�Aj�Nj�'�<�	��/��*]���F�3m�i3~F[�k�J�tyie�vʣ4�.�b��&ҥ�Fe����Z	l���h#�%)�W���#����q�G�F�ō:�F]q���|����
�������"�$�/���.8���ۏ���HO��C�$����	';���S��fh���F 	�R���TIS�O8�Bc�)�'�)���
+��x~�� <��h�s�Z
�>RhY?��Y?q&������ė�ka8ww���(�
+��ՐG��p�
+�:G��it̤�t�	�Ͱ�v�Yt�ӭ��n���v�O�9����t�Fw��t|Mw����L��>G{q*ݏ��V����~���A���A�z/�R-�5�c���y���K|q�+�.�@�}y'�J�Y#g���K���_aS�fƢ�U�*��X�>y���gAaJqʠ����„�M���E�C �B_:dI=��Z���(\����2Uo�z�t�r���o2�t����g�{�S���� �0�~Nye��<y�=c���͛E1��@Or)~
+����h�ҏ�ޡ���•,dWWr�-�X�[�OR�|�;�ŕs�ٸ��i�o3Sb啕�R�Seg<#���Nt7�qe���Ry��ge�����RY�W�b��K��	�YȠ��B���z&��B�2�_�/�s������2�/�o)�ʹe�i��g���-u*��L���N4]��iM}ΖW��/���ƞ[�^Z�Yy�&�=~�8{��/x~�3YmelwL�o9�K:�.��.K�oˉ|^w<֏�U���o%c�A]w���t��n������h�
�#����£pcʣ0L��;C>{��/���*�R�^�_p�T��e����+��PK
+�L�>�W��d
.org/antlr/runtime/debug/DebugTokenStream.class�VKsU�n�d&�4!�W>'�HQ���L�C � (���t2���^��\�p��*]RV�a!Uk\���U�
+�;���0�	h���sO���<�v~�����g)���
؍K".�(>Lc/����l?��5�����vC4KĬl�D̋�-���-�� ڂh�h�"�D���2\aP�-�&�%QN�W����&J^��r����U\�Y�����J�L�۶�O8e�vm�B��ު�yO��Ғ�^�=�Z���u|�*����
+�B�h��I�[�=�
+�!9:�0�}
���sI!>Z�g�M�kOU�gmoƚ-��1Q����,ϑ}h��NY!�~��l/۾6?����(�ui&�Jn��L
+������YI\�*�
+}�A��8��0�7��O�����Emλ��]cbF�+��Yߘ8����+�d_f�4ͼ�
��Yn���}����i$��&'=�h[e)qٶ�dq�s�F̠���7GþlS:���H�`3eIɶ�gѺm�ɢ��q�����@Wؖ���i)��'Y���-��Mǯ���~���L���=8d�u�a�U�f�x��1�؇WL�+OO℉�8�D��m�11"�v�Lǰ���ԛȊv�Ĩl�D�3���6��I�71�IS��q^!��#ω_Mxzvўc���}k�F����`��dD�מ3����{����uj�W��
��KS����]��K\��2���\��Ir��ܹ0�ڕ�*
+#���\�
+��*Z\~���(w!A�Ә��F��������
���6hM8(�	+�:�&�=̽�5!!�QR�z-ШۂSjBc�2�I��b����'0�G2���ĪhU-Hf20n`��=���"e��3~�Gd)��3���gr2C���*L_��O����� L�A$��8�G}/�X���7L9��>�i�s\��y
�q�'ؗ�p3��"�&��"�$z�Y��M�~��T��j���]��ΐwW
m����������Y�ql�Yvk���$����&�K8�?��c�3uTsTr�|�NN��B�S�t�T�1�����]�s��yVqF�
��~.�~Ns���K�_�6���^aܫ�{�q�� �H��H8��8]�PB�U�������~=�=������=ld{�
�߾ʼM���F�d:�@���\�!����E���R
B*Bm�б���W{M�R��nN[�g-�j�q]beB���*5�D��tX���uȇ�.�Ud��<�^�wy��#����#��G�k?�ץ�y
31S�3�hݠl�e�w�~�dXN���f�ؾ�_5�?��v�5��uC~�� �`g��"|�a*B8"�
+�t��[��Z�?�������ʻ�+���w5_&3���tME;��6�=���߆?4��p5��9�/PK
+�L�>+�X�
4org/antlr/runtime/debug/Profiler$DecisionEvent.class�R�NA=�W3��"�x.�Mb\i��Ja����2tW����X����(��f���E�s���n��_�
��N�xa#�&a>�T�ښ[��~��s�:}�#tư��,�$�Z7���]e�.8�8�F�g:g���KB���������.%����;
Q�S��U~�š��
+=Dz�d��iKo�&�.����l�W�9��^d�~�9Г�Ͻ�F�ׄ�'OO3}����P�P	�c���
m���t�7��E�{s�7c6����	�,�l�R~�k��M���Vp'�6a��d	Ku�+3�?&�J���a�O]�Ĕ�"��Œ�B;�B�t�jxK���5u����wŋ��>��c
+��s!ȸ'ؙ`
B�a�G��{b�b]�[b��>Z?
PK
+�L�>��Lmq(org/antlr/runtime/ANTLRInputStream.class���oAƿ)�@�Z*�P�J��.t1�6m��CjR��[���m����ً$�x��e|3�[�9̛y|���{��~�
���
E
���=�܏��Ae��c0b�0Dw���=�H�|Ơ<s�6�R�;��wn{��y�2��۲�g���9H*�[�g(6\�cZ���Lo���g�O�O'u�r�7}϶zO�J�w�{��9����\$�S�ᇖ}�s���Pe�L�����#����t�(ٵ��I�td
q�i�m:�f�)���n����{����V����E:��ה-jMw��#.�"=9�m�DI�dŒ��o&FRIl�d(��U6g�FvU+!�U���R]�jS�W�
+z��C�.}��/
+&ڠu�N)2��>�B�9,ҪQ�P��%�%G"��2Ea�"�0�GDjc������(�,-VG��B�Vp��ҴW(�J�[��K�E(�u#G��I�
+ݯJ�;#]�|�n
R�K��F@�tcYAe
+�F3{0��B�24�#w���id
+�uA���$������!$BA#b'p�	�F��D�(EC<fF���w�o��2DtG��y"���5����U9Yyu�,���}B���T֡,�M<M��4
U@�B��P#,Ԡ/.#�fȒ��_���?PK
+�L�>�r��'org/antlr/runtime/ANTLRFileStream.class�TmO�P~���C��‹�����q�b4�`P�ԭ̚њ��/��Ua����?���vL���{��s�s�n������p2��fJ󂊋LIqI�e
)L���AôW%��Ԯwѵ ��*�RN�^�6m�L���2�[3W�qk3�Y�u���?��	$�^��=%ǵ��6��������*V}��i�.�s�!0R���i�A�7�-7p6msay�T��lܶ6ɭ-���/�s*��h�:'��݊W�EƺgU�N�8��\r_nSٶ��O>�!�n#d*�L4�7L\,1Ɔ�=��G��kv��m��VK���:5U�0ҟ��
+��:�1 ż�>�1�

�Of�����X8v@J������-)�:ncQ���q�u,a^`��#��D����9<hO����I%�[���}
#�iBL�xgp��U+�bO��y�
PrO�c�� �R�{
�|�,bd��%������yĩ
��M�Tc8N�����#K�h�	�BM�8�
+y:;�
+��a�<{�&bF~q#?�����z
��肉>~�3��yz[<R���8��(��K��N�](��&��;P�N'v��vW!9�
�]h���x�
+�;�#�	������6���b|D�����*;�}��jY���Ρ�2e�O�3*��4�&3͟�5Z�ٖ�>��Lq��P�"���x�u|̳ʍ��Y����YN�v�v�iz��,��x�s8O�9�Z����QZ�}
�HE8"���&��o�/Ka2zh� �	5�PK
+�L�>�j�WI
)org/antlr/runtime/ANTLRStringStream.class�UIpe�z234!dc�Af�@D��’aI'�$f��=l��By�<xp�\�@)XY
+P�*�ܪ<x�UZe�Go���uw:�0��y������������g��3,Do�_�
1����FЀ>Yj2�ـ|H�L�p3�;��a8�Y�Α0g��c�f�9+&'&/f$�'ݐ�̬
+!
�J�4��6J��v�F��I�t�C��3o��t>מKڛ�f٬�XC
+B2�
SAUrX;�5�t�9�6�u
+"ʹ����Ӳ���h���N�H�y0�>�K[T���<ږO��L	�Q���F�֟���Z�[3Ҳv7��P��'��`���2F�Q�Y����ѕ��D�յ,c��ne A��H�"�Xo[�l��١wn�
+Z���0�s�����iC7u�
�sfA.�K��K�=.L˺�M���{q�o�O
+a����fq��q	�0�C�"C?F0'�)Y7􌮙�f'�l�:��f�ߴ裂>��/�u!`X�c�)yhP���8k+#|��N��OT��)��w�ƀ�ak^+���t9F��[�"h�-��o���R�R,Q�s'T,�=*Nb��Ų�
U,C����´Փ��IOᔊ6lR��?%PqgT,�$U�M�#b�c%˿�B���h�������M8;���
��p'r
+�[yY���ť��=7(
ZysWR"-�*�'к�>~�����T1�w��]~
���|���n�����%����c�wDŽ;R{\n���:Ψ4�}\텏3`nbJ�b��2�	\�G� �0L�J��`5�`+V���
����
��>	� �IJq��0M��"S
�	
+��c�*��v��qv�e� o��!Z�=<S�q�B�ʀ��M��d�e�/p�<�v�{�������ҵ�MWݝSU�m/�~Dp�Py�CEi��Ҵ�?C*�mCb�أ�\ĪD�(��>	1�;�ê��ۨ��
+�w�s铥o�D#B������0�;�PY)"��#îvɼ@2����kT\��G�s�"�}��y|�'B���1mrs�e��&0�z�%t�9����,�,�S��3��g��n��h�C�����u�)���c�T��}��p�N��i�&ǩ!  �Ka^,�O��O[Y�H��Ke�7{���=Gg�k6�
��@�T�Q�a�{EԀ�P�ܖH�5T)���70�ղ�.s�_B����5���9f%����P+#�NFm}BN�a�S�ײ+��Y7��_^�|��G�<z�B��Խ���>��!��z�2^�Y|P��s��,�-|$O|�ݫ�v�I�F'�nO4��vsd����X/�M�疾A���CF��5~��^e�|\��M��Mh�e��I�⳹L6���Ò���7(b_��Ƌ�{Zn�.�t��JD���Y�נ�&u���	_�O�RU�����g�C>��ycTT|�4���v�]D$1���*M���%��+���q�����l�b6RP'�vt�1wC�V�@C��s�!���M`�����(��f5d����X��l�T�6͏e�fwYg��Oe�;�\n�z3X]�:�L�_n�n��u���b�J��n�������j,M��e/������P'Ś�]�a�F�}j߿PK
+�L�>*��n~�#org/antlr/runtime/CommonToken.class�V�sSU�^�אKe���H�@�iU
+h��E����H_b��殨ྀ�����8V����_t�����;��.<oP����{��s�}7���/n�g1d0҄�(�8$Ⰸ��Q���Z�E<!�"kUA����#"�Fql�ㄈ'M<e��(���#&���9ϋx!F/e/�8�Kx��+&N�8m�U��x]4o�x��[&�6��L��{Q��⬁�s�l0r�łM�:���,UN�d����m[E�]�9n�)UF2y�)V2���F�L7-�������1�%z��3ż=��^��PN��c�N�B�P�)�
D���tq�̭�͡�4�ೄ����U���cOi(_ܝ�d�-������E:b��ђ�_:lٌ�"y}�9���s������:�w�6K�a530��"k:b9�����j�?Z��ڲ��wcr��~����J-I=Mq�:l!��kKU�s���U�MTTE��:}r|9�,�����j�T��V����*�4�����I��gb`1+�7��Y���)�%c�^�s�3q����R�2dm)H�͞�Fk��qt��8��8։�q����>���NwcC���Vl�c��;ec@P���D<��ڮ��Q|�9Q>�y���wl�
���kX̥)�e��G� �b���N�1Ձ
z�8�O�)W��
+͌&�X���]Z,���{��V�8�\E�U�,��3��JS,v��h������r���x����U慐kv�Ó�F�u�����w���9텉��e�6��ݕ-���݂�����l��b���!�"/�zM���K��� �w�64!$=ŧ'$=�Ƶ޸N�'��Ԝ}��o?덝jle�t��{9������@�T����PjA���}���\GG�Hg9fb
�0�M��;s]G��&@!!l�p��p�RG�dt��눤2f�M�ZBuDS-�:�))�(7�Ht�Dm�p)�%���R]n�IRU%C!�PH*THjRH�V�x䟦�h-kT+w���i��R��}��Ix	o��Et��z��2�z��@������c;���U�B����‚ₚ���f	
+�-((�A��ߐ8϶h��ˈ�Q�м�<�0��
_z9����������e�۱���`'ǃ8����Ok�������j~'��3jfr�K��#j�a�&�*xn�h�.�Z9��)�1���6ӈD&�D�U���j{���Dk�4�S�1��
+\�Y��������";�&�1��D˘�K�#���Gy���p@~fR��4��<����%u�dQ�ٶ_Ӊn���5�V�L|�Җ��_�cڲ�i�~㧴���3��x�6�7�b�W���D�~"'�Dv��DN��t"�<"�}���^��7����>�M*�O�mmR{�D�~"ghs�
��G�Q-�O䜖�^=�O�m.6 ���	��|�%�OO$�'�m�l@��#Ÿm"�1���D�K���?�K���
�e3�7���h��J��zbn���ǘ�Z�\�M�y�/K�X0��=�q���ǒt��Ģq,�M'�$��`Yb���I��p�R�c$������.6s~��vw1,�� �	��I�q�"x
19M�}�ǘ�wD���e��#��8k�=�����?O{K�^i��R_��x��[j)��
PK
+�L�>x�>]k.org/antlr/runtime/UnwantedTokenException.class�T]OA=C?viW��`�h���RX�[��h0iR��@���N��v�Y��o�W�!%j⫉?�xgwQ���M�ܽsΝ3�n���oV���$U�=�K05��bQGA�K�XTٲ
++:,�*]�q'����ᾆ�uG8r�!b�w���:g��8���u���mﵩ���5��k{�z�Q��0*�״l!۞���t:�������[.�k�+W�rfy�,dUz��q~��5�&+3���I���L��rG��h���B�7��K���ISl��l�m��T	�~��C�U����G��~��3��e�����n�z���������xb`��d�c�0�(���D����qy
�o(����aB_:[���1x��p��v��3�A�(���G�i�z�E��j6�}�3��P"G��I�O�,�yQ��'�Vr��	�GJ�p�b�/�0M���U�'�Cr�Z!S<��z�V`��,�-�
,l�2��V�5���:nh:F��&s�&zwB�'B��[_}s�X*�'}����#QQ��SI�E�#{�3����Dk�"B����1�@��o���(��e��
+iZ%�kآ�$�z:P��A7q˿��c�PK
+�L�>A�D)0org/antlr/runtime/MismatchedRangeException.class�RmOA~����rVTJ�T)ףp�U?`��ѤI�Ec4�^�r�ݻ[��JiM�
�(��
BE��3�����<;?}�
`�u�QQ�Ns���JUiT4�*m��)dkX�Pװ���,�,6�K�I�Ðy�_>eHZ�=�����Z����A�G�n�O�xnύ|eO�)y�2�[A�s\!��
���y�\���+z�ő�C�b��b5��h
+ٖw[���/¡d(�5�A�
a_�
+V�����:}zљx)Bo���/}�q颾6T���)q��<LWa2,�/�l���#���bہlsyR�2p4�P�G��d���{�!�f�n3��OCu6x�{A�������R�qÐ�.��5��,��������?
+�'yw�S�����*Z��L[��%N�)r	1�/�$!"��YiF:m����	�Ifbg7H���b\���4�K�)�y{}��]<F�^:F괎߯Pv:V�)+�iO�5RM��61ZB)n�~n���x ���7cd���=Bnݼ��W$6&8��e�#\�|n��3�5N�+�Q˿
PK
+�L�>���).org/antlr/runtime/MismatchedSetException.class�S]OA=��.+�AA�E)ۥ���"�F�&U#�ۡig7����D�D�?�xg�(�B|��̝s?��̯�����)�1��,�H���=��
+�5Z��־����F�,�3��i�}%d�a�Dmד��QO*���P
��2τ�CҮ0�^-�P�����M�y�E�z�{�/z=
+�ԑ8ap&4x#N���x���:�y�D ��S��q&�Ԥj��{�m=^ZȰ���d2�T@8>��]�{=��ɶ;��h��篅>���i7u�	׵�41�Y����vz��<bX�\�6�b��<��C��\���b�6���U��<N��~Цk��3��$�����C�i\��II��6W�r��xk�S��T#)��y�ڼkS��mP�g^�A:i�	%	�u�����ig��@7�f��*�ɚCp3.d��(�=��䧜�	g���JL�[k�X����TqH��H��b��%�d�.G�w�5`�@��i+�G��#�G�24��dS�I��k�/����;�����PK
+�L�>G�W�
�2org/antlr/runtime/SerializedGrammar$TokenRef.class�R�N1=��&a�
)����B�Ģ���U��A
��	&6��q��W�D�Џ�:�P!A����9�����O��P@����۽-b�<�xX%d���.	�$��Vv	����C�mdB3�V
dؑF�H���_���D(t.�=�V��������Zu*v�vD�4�c���_G��4��q�܊{":�����q����\�o��7�����P���4�+�|���;�(�'�Uk�3q!�H�~8�rG��LO~V���3�G�Q@ч�5��}l��a���?��G���YB��^������H��5_m����ñ�"�%ŋ�3��}@�
�:�3^0���y�cP���H՗�H_'�
c��6J��h�Y�%RA2�	���D�#G���o��C���A��Oz�RXLp	�8:�Y�g��PK
+�L�>J���n
'org/antlr/runtime/CharStreamState.class�P�J1}�n������@уz0�-^
+�¢�J��5�)�DҬ��I���Qb�������yo������-��8M1JqF�WB���Q����l��F/t��Tj��	�˫���̋g���6��ϼR�\���%�2�=�����cW�k�,��v�l�w��
+ޔ�;qG�J��Z�ep���o6���8�!a��4�0��z����&���#F����k�������#1л���KG���>�;
�q탨�PK
+�L�>O8�(��0*org/antlr/runtime/TokenRewriteStream.class�Z{|T՝��;3�y���H&O���<DH�#�N��dp2'^�P�Z|���*�<l�Z�!�R��B�bk}U��]�Z�֮U�ڮ��~�޹s3���g���9����=��|�
/����P�w�����*�d8���n�I�������/���p�	�P�ݐ_��Wp��=M
��"͡���9h�;7n�4�A'�\ܸLs�U���.X������d�8R�s�0��c��(nF;���1N�#�&c����d�x^\��n&*8�
3����g&s3��n�rS�s��a	7�ܔ)XΖU�r�
+Ns���y�4��3Ӱ
+gqs.�p7լ�l�~��2�<n��dz���n��ܫv���j'.��E�x�kx���%���e.����܍+�Ή�Nl`�N\���
+�qb�:0��t�a/��k\��z�j�+�o����PH�,
+����n���P��.����<k��%�R_����p!gq͒�hܸru����6�/��A�^�ɿ�_��+�D#�P�l��E�Pw����{4��5������n��X+S*�"d���ollX^SO�׬�i@pvE��'������u�.0�4�:6�/�B��Vm+�r^U����`�0��:�B񚱄�����V���"|C�\k���Z4Ђ0�,�-�v�	��yrQ�Zۢp��FBZ}Og�i�75ve��\�xlLڢ
2k�
+�Z!�VR+�J%}m,abQ�k�=�m6k��O �?�
+�Ig�eT���O��F��`���rR�H<�
+P^DzZ8�D��f�x7�H�z'i'��,��"��TkՂZT[�����N�D��E�ByJKf[�74o�Z�b9�O=)�p�������X��&�t��D�ԯ(����,iO�
S��Vz&V��c}���D����YT�B��-�(IQ:8��F��_��sCq27�P�鬼~vz8����'x›�D~<�x�׍Jj/?Y��b#�nע+��[Q�jSl9�i��
E�v-B	3�;%�M�4s3&CZl!Q"Fp������r�
7D큐?������8ٙ�ǑJ��N'Y�����贒�{�Ȉ!/.�ik�9�ᘤ)��,"��M����=���(o�0�v�*̇������B�]C��-�R�ޞP��I�k�sVpu�9��0�8�ո��BWDۼ�Q*�[c���}�����d�@q�q�#��e��*D�˺
���J���^CJW�?���(j��EC�n�ݜ,���vi@I�������E����!�"Y_��q�ŵIV;��z.�Y��hx����KE�N]&�!'c�G�:�XD��ptI�'�Z��E�2Nik%m[�
,	0g54���`���#��3�"���R/-����"�pD�`����*\W�p
7�`'Ձ�s���;(�))Z�6O��>2�tA$����c���D�Kq#n��v�R�2w�`�������wa/7�Tl�>�S�����`ې`�T8?S���*�c�
+��(7���{)8��j����H{O��Z����NQ3��=�
+��T9[�Tڵ�sCN*/��)ꦊ:�2�X�
�9��;D��n7�]�*����
+��p,T�B�[�4���Qx�CХ��#���Q���KT��yQ��MI1*��=�Y�-�U�m*n�+�Jū���*����=v�u*\;����r�|a�|��	x_���)�A��z-��noR�[x���ƛܥ�-x+Ԑ����g����x;��c$B
�6������]n+ ��7k����`K �Q��4��.P�mx�6�^�y%8�@(
�\C7�x���5��`kA8�V�L*���q��xީ‡�q����(C_[����{��VfB��Aq�o.���=��/�V�ƎHx����,U�A�'�⮞otИW���u�+�=�\����&;%�	�ʸ�䝃�<W���ښ@c/ѩ��Lr����%8T�x�ɨ�%�B�ӹ�5!�
΀���������W=�}��K3z�K8"Z'mvBm��h[����j�asf�fV��5���Et��Z�7'�<b0A���b��Yҭ��]/� >�4+$�y�iI��1!<r7g�ԤW�d�Y�s�!�c�����u�h�wB�5��G���0�l�j�̊x'��ን�d��h22ɴ �4
+�k)�F�Y4�-�A�@za3�$Pi����m4�n_	6&/Է1�_'!��:�F��-�r���F��z:#`��08|xn��>p�D��Dmة�%�}��@�+d�C�-�U��p3|[(�˄n�U���w�M�!����������Ð��2��?w�ef�#��B
<%t����ؔ[y�i�D�9��Ð����v�ɖLx��?(����6�n�����nHi
��b���{F|��)�I#1Y�$��1:�)&�ý;(��;�.C���6���e�c� ;.�-�F��E}���d�'�'j�m'�رS8%�0R��CN}�䉙2���2�I����?��B�OG3eN�{D�r�naK���{�
+$�K��F�)dU�%�o��x+f��+�
�(�9�_^&��X���:*��Ht�>l9��Qq�>%�}0*�5r���L8����.�p°�����%�щ�o�[)����
�k70�>�WR���$�o��ޱ*�O7�.��D���B�>C�ZC����v��(�]R�E�۔�6e��)���d�O����"�'}0l��O��!����?�����L���7p�~����nu��#�m�y�C~��W������㑮@��ɺc�
+�W��S*p��x8	���g��j��3�����0�
+f#�Q�C��a��
+�"A���䉉~��\�w���	s��tr/.�Գ�G�޲$�_�W)R�!��!��k��U�νI	2…�B��g���$ڗ��%A��=���M�w��QC�)��B�;���a��~�ɿ�����s���#0��ש�E}P��_6ePq>w��b�m� =����0T=��s��a�Vm׳�A��0���88�Ʊ>�1�FL�fT!��Ѓp-f
+k��:���0�o���$z5Y��n�	=�0��!|��M�3>�ܒ��؆�
f�H�����X���.9":!�Ȣ��DFb��K�C��Dap��A4��0���J�7	\>��KQ�2K����1�$��%�s�'��z��pR��!p�	nJJ=w�z�6�|����7.:p�1I��	�g�6V�X�\f"��Db��(-�$;��D�C�nS�n!��!]ĴA�f�#�NZ�iI���?f�,SN���t�h�̺�c`�!oW�
3Ù��U��� ϳx�cj�14� >��بD��M^�֨�9B���D�vV"Խ3�v�<����"6�i�h5�3�{�Q.���֕>�`��j!Y�Fc�E�S�⾺U�`�|xڔx�A�G�7�:!�T7�"/���Zp����-�F��F����.�(��˚'��ͣ����V�Z�`��	�k���?ˤ�G��q��u�ި��c�l���aN�ͻ�rmf��E�\*qs�a.��}Y��^�n�
{O�@u�<����HY~!�ZXD���ެ�id
Ǐs�޴��5�K=<'��%t'xA����<1?��'.I�
8f`Ւ6��F���D0?�5[��S�&�0�4��Z��
ږ�r=kV��
+;@7!
*M P7W�A�]m��Ƕ�!�2���
vy��6���h�>"�|�#�t������Rr:�7�*��wx�]s�_�̅��A�����J?,�j�]�1��q��&�vW<g������`I��{z�Ն=��I�R�����9�)}��PɽP����r˲���BŠ>�[�{�8�[���6�&��N�a*������
7�:�p;��J�
��{�jx���p<���1�	/�M�*�'�v���������Ʃx��v�=�	2ᤶTPp:��O`�^��|���Qܨ��~�P�9q�dґ̔�
�{�%�ޠ{�ՔP�U��z~^���������=�Ҕ����e���+e�=��q�f>��K�
�?��
O�ʦ'��4C����.W9r��`���:���jţ���AX�jJxԈ�p!�C��H9�\��(���9���^�g7����_�A�7�C� ��B���E��ź�	�/Z;dNo�]��<��L�JN1� ��%�I�
���%<���o���,sنA���M�rš�@NjO�7ϭ?�
+����\�}�j��{� O¥��Gz6�
���GR֓�����a��\�}Pl��-���[���W0�
y꽝�~�F<]���t��.^N,2�y�*]�H��{`�����Z#A�C�vh���e�!!�,G�vL�8
aN�z$l}�׌���{��PFri����$.=��]z��
�N��o���sm��cc�¬R.�,ky��R�>Mفð���\ϙd�IΏ,T�̧�qT|	F�`���e����*|.�רƽW�p3�O�����G�>�wQ��������p9���#㟩�}�?�O�~���I|?����+�B��'�b<.U�ii6�%Ju�$��d�E�K;$�t��HHN�a)MzJJ�^������R���4RvK9�()W�Iy�9�(�J��+�1�f)[�
+O��K�.i�|�4Q�'M��
+��d���T��4���3�/���`3�
+~MU��*��TX��7�
+�0��W�5�����u�э��{
+���E���k�S�}�j�*��o��yh"�).��T�Q�
(��X�ĵ_H��k��'p��,-!-�����~6i���,}w���4\�#��`���D�֋9��z�ܠ�(�wt0)~�1�ȝ4f�W��T��Tm+ �M���t\���UǪr����C��TN�V����%M�1�t��ܤ/�t6}OЗr���B��O:�d��Tx�z�]��!��߹J�����4�•�߸�٢���%
��
|�Ɗ�p�ɸ˫���s����\{lN+ɵ����q�MHCKȌ���i�=����L|����%͆|i���0]�54^.�o~���X<���"x����ް�{� ���(}�M�[e�_5�|;=���zU��~h�����N��E��O��s�ϤJp���p}i%y-J@�ΔVX�����զ��&ӭ6��t��;��̍��]�}O>��Ȥ���~T��	�ne֯�$�}�_�g�^6|L��ߨ$��h��w<*�\tQ�K��]H���PK
+�L�>��>�
�1org/antlr/runtime/SerializedGrammar$RuleRef.class�R�nA=�\���j[[0@�K�Z��f�&��>�C��d�%�Wi"����Q�w�&����νsϹgo���_�
t�2�<- �{:,���8�2�u�@��'0d�T.��F/��+j_��ȹ��BK�/b�^����s�Vf*���TҼeh5�b�
C���דJ\����0�J��x8�Ģ|S�X�پ�@)��!_,]��fp}�&�9���j°�l�f|�������RG��z$�I;���kKq�G����.��pQC�A������.�312�]S�5Z’���$V���{m�٨ң��KI�G�	K�w��H�e<$ܥ�Ky���>]�� �>Z!�-i���\�HXID=<�^"�%�`��ւg-#����Od��Q$J�g���~�O𘢵��c��PK
+�L�>f%�	�)org/antlr/runtime/SerializedGrammar.class�W�{S���&�IӠ���@�p+mzc�:)R����umWVt�is
+�4�$'��Y�2qL�6�ɼ`�x
�F�Щsws�{؟0���'Io��'�{����^>�����\��Z�Ӈoa��񘎟��¨�K��|���3<��ExJ��}(�1��a��Є�e􌌎{���y/x��l����'�sRX���˲�+/^��)9�k�~U�k>,Ǩ��^�Z���i/ޔ����qƇ���,�������8�9�u���:�	�:.�נw��f�9��I$�d[�H�̔o���L�Ok�ܫ�-�
+ۺ�k(��c�7�FbWc���%vm�0��J�l#a��4�o��ս-ܻ����'�թA����Fv	c�n��;����@�%��7v�R6��K��
�ճ����M�%�[;b	�3=<`&{�
Q���4�}F2&�������VrW#��'��6{LR�c��薤1<l$)�;�����!9p��Y���I��m�b�$v
X�X��hM
�I3:�� ����n�6����#v�pR
.FE����
+-ko�t�~3��i
ŻCzйY�2ǛHw;������B"5���%5���*�/bY���j��M_�m7[+ۀ��9T�-�5�-+�E!��_�r�]F�fx'�\��Ϳo6��Hq��d�:籝,*��$��
�JZ�4�bF%,��!��ډ-L��i�O�:����ʝ��ڠD|�e�bֶ��?��㿠��l|=V:9h:!�p�
rď����ЏK�L�닣��eD9�1����0�qŏ�Ѱ��+̹��&Y+$O�0?���~�?�cjU����[�'~|��4��NF����JA��`*os0��A�:~���q7��hC����9O���'Vo�qP���&e���x;�،-9�*`�ɤqP�ƏAD��B[<K���|'��5�����t�9�!5�I��f��^
��؏��P3��6e�i���J���0��t��o̼��������԰r瘉�Q�5�����j)�S6z�l�����.�'佌����!���zڕx�d,�;V�����`����[)s��ټ.4���xj�호�fG�ܷ�Me0���궛h��p�n+��#���л�(�0��t����k�s
b���̪�r�fng#B�@k�-�C�f�:��P᫱�Y��6���������#y�I�Q={/G,���g���a��@{p�g�.�����m�8�(����m��u�;'0��>�[�ݡ�{�ʧ�}�+(�;���
+��?������*=�R�w�c:
5�RFU�6܋�[#�=Ts����ȳ��nR-���1E+�L��������te'1o�K�3X�1����x�;T
+E��	<�4���,.]B��<$�l*���Rn�ss��
+��춋N��J�u�Qz��2a5v�Ϳ�{1���{	M?�0F�P�luL�sX�Τ�C���ܗ��z�E~�v������]�U��I?,�Y��`_Ⱦf�i̊NW��|

�de��>ไU���[����sy������$�#�
+��$�`�R����� *R�JP�˛S�5GF�f
�-W
ꚦ0/���_��@�m�,�>���j��c��T�7�S]��.g��٣&t\IC�E���@M�Vg����v�(�G(Ǐ������P�P�G�S\�����!�&�^����.�qe����ᰛT[�)1�Mw��,op&ȯ�@�Ty�y�-���rw�ӣ<���iO
��,S>NYO@���Iz�(�W�X�{��8����e ｵy���-�eȊ�|<��5�{����yAEp5n�T*.-	�\И�O��d�)�)w�U����]ϖbk`ake;ʖd�6۝l���d��M`m��>���c��1w�q�0��s;
c����&]}�c�T�Ec(sB�W�9Ԏ�c���&���Jg$?Kܞ�7��o_��_�O�����-��Nq�U�^��4o�,��.���Bo�q�_���%�t����kE*Z|��O����+jJ��i�]�#��*���Kne�˰��y^�z��עx���4D��{8�bs�/�����a�kT&f��R�VZ_y��S��i�ڿ����‘��R�%*v�kT��20��+�&f+�~CJ��L‡���&���p���Y�:j���T�J:ǁ\e(�^�ip����Z�t��}J�>��|����Y�Lч��X�주����Z�D:I�&���o6���$a�_PK
+�L�>63m�R#6&org/antlr/runtime/BaseRecognizer.class�Z	xT��?罙̛�cId��L�����A"Y0	�&�Ff�3 .ն����F[����-�֥�Zk�Z���Z[kk��]��;��y3����~o��sg�gy�c�?@D�hct���i<�O7�|?F��X ���X$���X"���P�Ky�<�˴1@�y��.��Jy4��"y��G�<Z|���<Wm��ߋ�M{���w��O�y���^�p���h�&_����_��fo�SH��>��S���GX[>�j�6o78�����y�q�O�7np�O������7ipJ�K�''�6��-�~��(���Jy\e�����k���w�����3��_o��~��o����!QՇ��G��Qy|L��'|�IQ�\��2�I�?%��,�O�c@���[����F,���Ɵ���D�7�^��^����
���;�>�|��/���b�
+�%�������>����N�{t�����^a>(�4�>�2�~�ˎo��"�~@�~�����a��m�w������#L�[[�6��inܼ����q971�X�����xzm8�g�Ǐ?�4&�wM�ֶu���8SYSkSgSC��m��m�6wt6,[���ic���a*]޸�aMs��ζU�����lhmml���T��i���V�u3�km\�٧�jmhid*i�,�3\
Ƿ�u�����L^@L[L3��mu@M�%���H̪k����+�d��p��鐭�)Z�Gҋ���k�<�=�0�9�Z�b]V�3����Dw8�6����Y���GRLS
+��4���g�P�i� ޤ����~�X8ݽ�����x
+�±M�`D�Vz��u�u]fu�E]�xo���+�������hk"M�b�t��*
+,D�u%�C-�h��m��#�*e2QC��)8����	�HJ4���wa��ә�ař�<��fld��n��Rp��~x�a���;m�V�JQ����'�R��z�tc2�H2���W=J^�i@==�To4ܟ��>vqզ���AH�|���[�������R�p��Y��-V*�1�N[��g<�O�|u
�C|#WA~W
+
z�����ԡ�{�?a�'��ㄺᩒ�ՊȓK�D�,�/��v�ͭ�t�~}���B�G�V�j��H7B���Q��ض��?��V&N��\12c��V�ǂ/,<}g/d�q�gkU�.�}���fÈte'%�{0ڊE������&��`����m���^/-��v���_�em��ۭT��o�{2�	݉���ж�X�MEU!ov��!2z�ڍ�x
+HvZ��|
bO2�Ǡ�ʪ��2��"�k�wK�Bh�Ӊ^$
Ga+��X�uA���SVw�ib�}�i��鷙&K����I+�n���Il�N��
+�
^N\ɰI�o�z�����#��*�����}1k
ȣ��L�fB�M��ϟ`��j'�ۗھ�)3*��!�L囆sK�V�u<�.���	7u���ށڤ��M�k���hTo8	g\
�Rv���:�'�$�/8i���V9dN�L���ƨ�?�wd��tK�$�$Đ@u�AR��Lgl:ʼnO�b9��@�l��`�q��˞*eg�K�������#2q�)J�f,J���d8'W��d\U� -<;}�ng��~'UvU���]���}�]�c�+��\��mU55I��'�_�X��d�%��B �ȥ��96/��ڦ��1�(�����L�]��]2���S-�ۤ�<RH�R���/# v(�>A�%�
+,�O	�P:HaM'�9����#���P�ڤ]�[B+C����դ;h���lwL�}�����&���0�M�ѣ2��<���O���7����J�L��m���	��D���s��ɿ�R��x�IG�I�үM�!=�0����}[�ZI���_�Ã&?�&�H/��4W@q�[S����;�]��&?C7�4��PQ��[��TP��<��=� (���*X�J�d������7(O�.����A���m��9�x���`��
�y�O����'�lM�U�RC4��kr<�[�`8����%"]ݴY5�����ݑ\F�'���"p�`�̙3g���Do�'�t頂��ѹC�9��p��˖c7D͠�|M��(�Z�dE��q�l�<bg���������&�F�iW/1�R��(E����y�_��כ��8��y�2��G�`e!�u1�,�?�
��/�$��WL�=�
+#�
+
+^���Tw�}�����|�'��,7�uzƤ?�6��c6�U��^Guw�lm�_��俲Ǥo��!��Iߦ�� =dҿ�?����㿛�����4�_"��)�d��3�TXlH&���&L�7����5��P��Li�i���525���8=��i�O�W�M�H��F�i
+��jY+é�*^�9!��4�p
+�Z1��jj&��s�J2	�E�`$��E����$Y.H'�mL!��>xL(�'WN��"˦6Bij��58J�����P�+�X$�ݧJ��\_0S����n��I�T��P��眂�Py�@�yk
+za��;�x�Sv��$L35�%5s%q��R��tB�,&A�j57���
�S)CsPu�'oPi�e�p��pkQ�v
+�po/�=���4��ؙl��i�`�u��ȴ�~7b�њ�����3ͱ7m������!�2���A�pU'��H��#��!*�F��:�R��oV$>�95Rm��|=i�FQ�4DQ��+������˺?���:Э�#���ؚ�T:��2���,W�\��:=���]-p��*��
��y�)����*lt'zqi���@Ah�����ҁ@�!E�Z�~)oɶ�]D�z��A���S�'�ü�}Π���BG��ZIo?ɧ�Qi���=6Q
+�p4�G��Fm+`�p��'��n}����C����G	*p��*.�q��"Y:9]}��W��i�������s&�H7����St31}3�0�%g~+�ə��r��|O�|/�����.�HA�q5��	��%̖������ՇI�p��{�s���2�#I���i-�;13m�
+ݥ�8t}��T~����T�l���u<y�\��A
ൌJi��>���p�� G]C_sq?T�+\}�<G�Y~�{�+��ș�������߀�PF��M.w��Nc�a9w\Ǽ���Yȳ!6QLu 7rM�V
+RU�j:��iu`�	5t�Z�SOg�וy�U�~��D�#P�(j$��S�9D#4��C5�h$�C�X"N�g��4p����Y����Q��]�3���@���wu�cTC	:�za��a��K+���x\#4�=�
���@M��A�G�t����������0}�1�:�)&�Ka˖Uq	�����+��+���r<b�f���(ui���15ތ�|�}8�.�}���b�7�,Ǹ�q�c)q�_�n��4t���]!� ����A���KZlkxo%C^�
9ľ[�����ܕ���x�|��p�>@c郸����aX�Z�K
.��j��K���
+�R�R�Re�����t�J�
�h��-�߳Ź�
+��+�d�x��6�+a��n�0�.�j�.}O]�s�
8_|��:4H�[�C8bB��f""C�7���2(i� URe�G<CA��
��q����>�@��FA�@q=������H���
K?�7N[8g��<L����!�\�)	�{ˠ�3�=(�R��GfH-̮�:�K�m�`�6Hg�g�^[��}�;��>@�`9=˲*�eU�%�¼��ؼm�7�c���r���X��q�P>���c��Ǻ,�s�9���q���
�=H�汣7��
:3���R���4'g��B��Ħyt�ͫ��L���z`�钠[`�-85�B��t��\�-��-v�-��I�L�:Hk�A������H���>���<M��_�:z���+��~O�х[�#hɓ�"���n�+����7����w\�������������?�8��KgF�����y<{��}|6VV��^�&���屼oo�2�O��ю>�����O�8�i<E��Tt�Ӵ>K[�U�v}���G�8n�x����x�y)��~��B��vP��k�3k���s��T���h��_b�)5z����W���qmq�.cdɭ�ȫ�W7Xj���c;��V���܎`���ܜZ�p��M�1'-u�-;B���e&6^���q�V�\h�Wb���8H�ɷ��x�x>��9a�Ӎ^�n�|c�{t�cH�1� ���p��=�/inٗ�C-r�z'HZm�l	������1h/��%kd�!\��!v�M��}6�
�B�^I��D�|�s��մ�/�Y���9�4����b�h+�f�|�"��v��v�Z��>����q�5._C9���e����V'3ϵ��5l`���l�d/I-8H[��T]��s	F��>쉻h4o����|U�
+q�fs��p�M�8�5�M�sq�%�T���^%i��m��}��=�v�t���릯��pW
B�|�s�Q���j}�.ݟG���"��O�='Rk#
+R�q̦~Le`��N]��0m��mi���)��J���p���VrHW��/�ڕ��R�md�J%u�������U�Z)�x�M���D��UR�v�Ԃ4W�J�iԀwj!t1�LC��ŋ*�<U��!�\C6!�
�Ҏ��*��4�1�G��a��\"Z�Q�Ԡ\��هi򆊚�ԃ58��|p0U"XvYﵗ˼��n�i�5e�طI��eރ�Lv��b���AW	+P���F�v1�Z;M��S��
%�F:K�D5�;h�v)��6����k�Ԧ��%�E]�V���j�)��E���.%�u�xd��T}�r��r�<��)����>H�Z����e771�U�e�#� t�E����X���R���h��b]�s��\8e.�2�ܓ�
'�#�rr~e����|}N���4��|�vxt��[�Ǟ���D2ʠԐ�oV�RSx�1�u����*�Nsڇŕ:�ʊϡ0W��Y�w���fZ�"n�T��Í�M�����4�4�4<ĐU(�J�:�� ��A2=IE�R54'�y)��
f?�j��+�Ag�ς�Κj\�K6j����)*[�D�'|<��ff���ߢ�N�Czf�>�L��{��
���{�[ӑ��h�h�v?M�#�|��h�Z�A7�M�J�r���:W�u��(l��N��@�c��͇)� ���YRYO{
+{4��9�
29���_�v�p~�	�=��/o�	�V}���
O�a/�U�UBk�$=H}T��f�|gɮAڭ�g���N�o�騐z��5Z�"��Pi=�Ҟ�_��O!�>
�>���,"�i��<-�^@��-�h/�j�e��p^q��(_`Sݔ�.
+D���G*
��G�h�7�%��h�;;Z3�=Y��+��W<�K�E�mT�[~/��Z�1����<^}�a��C1�^JOr�C��a�Jͥ,�SR;����'H����p��)��E��_�	w�
+F2��E_\iOn�ɡ��Ct��V�jU�:.��7�QH�Q�n�8�OA=@s�P7�0���+��hv1ax��W��X�����,�gC�����ou�靸�t��ӵ*һѻ񵭵�N���=w�A�D�^Nz%`N�z=�Sr�U����9_��,9�2>��K�D���QG�u�v�9H�!z�G�����~�C]S��r�ދX�v�1�uv��g�X�\*�ϧi�|��䀫s�չ��N��`��<��\�568��'Wo��d�>���m�;%�ɨ�3}���A��2_h�Wd>��Pξ��>獴"7`^awD r�T�>BSݱت���R�2�tZ�W��P�
+��_HK�&Z�_Di����[h�~qN���d�����Jdt�RI��CNL�ucʀ�����E���+��ta��!���}�i���4܃���pi�z��o��6R���fa>W�Ե�4�3�N�̹�V����u��9<ˁy��`��Ї2���t��/i��w�A����xJ�ޏ�F
+dL�����eq������{��t��-���]E������*���}���sq?��N�`��)p/9n׍Gbc�'�g��'e%��*
�zi�~9m�S��9�%\��p	W��+��*���?PK
+�L�>����
�0org/antlr/runtime/FailedPredicateException.class�S�n�@=�8����
+��\��1H��ĥRTUmU�ǭ�
��26���'�h#���Q��u��I+^ffggΞ9���׷�g��eeV�`aU�;5�5Q�r���_�ZT��Щ�e��y(��H0؃w��B
��,�Ѱ��HRH�gbOe�'2��S����g0^�
�62[��@�{� �`���}�J��$��|������Q�^�G�	o��P�{u�$�qD^:3�_Gq|ԟf=�QT+2Jr��}!)��EÂә����/6���}��0[�u�Ѵ�B�a�,����P�K�9��`(u?����u,��-���dX�.�~<���S�++�Ԭ�$Q@��̐{*U��*=�=��҃"�$!_���"{�VyF������U�tp��U`�4�<�O��6ȷ��1Jn�ew��?[���ۃI���G�-�&�*Z�
}NK�-�HVt�&'�聈�wTތQ�k'��_Q&g���b��	.}>3��S9'j�ۿ
PK
+�L�>`�g�K
P*org/antlr/runtime/EarlyExitException.class�Q]KA=�����}��R�&��n��e����M��2Ά��B�Џ��B�Q���s�gν������yX�а�C
+[T2�f(�/&"
+��Q�K�fH��P���s�cH]F�Pꈐ�iw^?�L��^����E2��ń�މ���BHWơ#�<<��B��>+z��Ps�?Pۡ�*ɽQS;�D8����L�|7��ϯ�6RY~���{�ld�Ӱc#�����D˴[�GCZտ���F_`ѿк���-�<�\S
���ٔ�i�<�Mh�	XA�eQZ4�;Ig�q2C�����Dє��xDd�HU�􅔎�'f�U�oe���	PK
+�L�>�V���org/antlr/runtime/Lexer.class�X	xT���d�Y� �$8��W$l�0��%lj�C�#�L����Zk��J�.�Z�w
!��+.�֥նvu�m��{��/�5�7��{�9�{��g���a'�?�q��p�@w�pw.����w��c�;e�%�2�a�]��W�e�a�����C~����@
+�@dx���c<.�'<x҃�<(���i���gzΏCx^���?��'~�A~я�$�˂�S^��U?�q������������[>��-�?���^���/������]f�=9����a6���o�x_�߉�~/����?z�'/���^|(�$t{��������2�Ãz���*d�#�m	�Q��XSy(�h����"�p�Y>oC(�,3C-�rf�#��,���
+�y�FS!�:1k�Z֙��кf��WGB�+B����MwbC8�0��j�Ì����K �.<���R�!�	_`Ɩ�l\�%L�,;.�BI��H3�&�勘���F3�PP��A�"ˌ�w~x�+F!&9 Ԅ�-�D��qi(�dVv4���pTh���9��;��~�`����í
+�̈́6�'O��ק��uS�u�Q��HH�E�b
fm��/?�$��C��|d9�‘&��l	SхN�[��6LX6PD�֯WZ|$?��jk����Å*�_��W���D���P5PzWہ7WUY�t*��:���h�BFCm�,�Ƶ��"֩a�WE�����D(��zʍ���X�2��J�mE-�'Yk�3��u��q���i��V]�s���D��e�&	&8T�b͛*;½�[�D�|T���&�����G��@�k/w�sqx����g��R��[�C���U�Q��&M�I�B
fu��sj_��ښ��	h{G�N��6���6I�|��bh~Xҫ_'�2�l`VX����@V{�o���BX��a�h2p���.�dps�U��P����+d���<
+E�mi�FtD�B��(����K�ʅ-"L��P���g9���Ǡ���T�sn[q���6���&��ͣj�<7O
2�`�H�";�PC�-��0C
W�j�i�UH�f�tn���b��-IQ
��PCŒU�F����&�L#̎V�!AJ� �w|�SL)��D�z?j��P"�N8�v�¸�D�BE�<�-̢(.+++)
4G����pc M�s��&Vt��qE�g�R槴w3����h��&��Ư��p�hY���E���:C�U㘧gT��g��:7"CBZEM4�x呋&��	43-ϔ�D�M3�M�M+�]a�;�dn(n���`��j.k�Qr�C�Rx��*u�47*L�'K�1�Z9yh�H�dr�� Oc�婰�nf1�:�6�Oj:W�����?F�VUe�Su�=��F��иsU�/[T�xm}ݢ�Z�A�
I37���ۃ��9	K�y,��B
%�n��և�R�	gKOZ� yU$�֓z��I�ö���xۺ�-�0�#�*��H�i5ihq�cU�hՠ�$g5��>K��jm5#��M��	X�"��!-�*ڣ��w�
K>��qEݺ�H�+<���6�n��e���\��җ;&�8��i�S�vr�{4��ꡰ�?��]~�f�x6W�pf�Evp/�N.�����H�b�KȰ��9��,���Sp�� X������$�R�0Isfaۜ����y���enp�^d92-�0'��$�4`�'���LbWAJ%���~�^+(�;���0@��nd�@(� �;eV{��9k���ٵ���\{6l�
)I�`�S��)��tE
+1�_�3031�p� 4���̥��)|ER�0-���h��!�L�э�
+���:Oֹ�� Y'�=w7ӎ�P���eǕ���bHui��uc�
��pB;/�v�s�7ua��N�wva����<��^��v������t����%�a�s?��Ww�[ϲ~����̲>�Qz-���1���b��~QC/��~�pS�K�]��b�y3WW�'��Vo �-�����.��>��~z�
���c=�@�!|��ylċhƫ\���M�È�D��j„���y����n �X�E���Xa����E�fFb�Mi�a��[I˝�ܜG�M�f��yA��E�2b)�D�6����p	c�iA�����d���|�yy2s�=v$Y�����{Z��T��o��h�L��8������o�n_꠲o��O{�/��|ah
=Q�V׫������^k�Y��*�n��@�v$�ŀn�M.rud�G�+M�m$_lcf�N��W���y+��mi�.�E��2|����wiQ_���lk�f���[�2¥�]��e�o��ܽ�;��h�>�(�
Nf�M~�R���ԡ.����pgf�����ۻ�����K���`t�b�z�U����K���$��fƺ�� 9zm�
+k�E\ȇ���%\Ĺlj���r2:��v
+�i� �%ur�����;�Y�_�RU�V�PS�����$�h�#G�'%B�ׁ�b ��x�)�q�ƓT�Aק���e��u�P�T��
+�$�@>��bY�p	�z�c�#�.Z�l��Ԫ����xN��B�=�=&?�{^��_��_��/�ȯ�H����:�ěL�o�G�Nx&�s)�^VZ��2��.�e`iA���X�����8���8���]G���0�H�;r�F2���_�ع�)+�ڑJ'v�Ƥ���gu4�����]T���J��s���0�}�G�J����^����r��l��O�2�)|��G�v�.kJ>k-~���
�@�-}E[0�������|�^��RN���)]8�`�i��ލ)�FN��TE���I;5E[ћV��#�N�P��P�;�$�-8��3��h&hVΰ�&�l�n����$�V��`�HWpt:����Ƽ��3Ӆ�K�
W�NN9�nw���@�(��?��`�R��TC�H
�zu<�jZ�H��B\��p���	خxF��!5/��x]�SJ�Wn5A媉j�*V�*���Ij�*�>��V�c//���6����zB턾����o���{�^���)��#$C��3z����?݀ű�*|�>��ݛp�����5�=��5w�%��0�t��o��:{��'%kz���N����ȯ☓�������I��E��Sz�9P������N�)j
+����P����5s�,�xN��ǚd\��3y�i��I{�5-�q}4UMk��q��F=[�����
+�avI�v�.��׊7�g�B]�bFX�*XZ8y/�d|[��8I-�T�4��G���m˅:;U�y��~έ��n����4S��k�Z�?�u����_PK
+�L�>�c��	-org/antlr/runtime/UnbufferedTokenStream.class�U]S�V=W�¡nB�ơ$�G��~$P7@L�ƅ���T�o�[�Hr�������LC;��9?*ӽ��82�hf%ݻ��ٳ�ҋ���~��.VHcU�5a�$Q�z�
+�������^�1|�!�
�)ֿ��!���؊�ʐ�����r�n�3\�8n�h�~�-�]۷ڼX=qXbФ�a7�
3��}Ӷy�atٲ-��0�}Ln�A]s�LŲ�F�]�nլ�h%]q�fk�t-�,����1�"���Z��C��F/��r�ML�6?��-���0��:+O�/#��S�G,����pqhfK�=�qRM�W�5�<<r���o�n2Lf
#Wyd�j[��,���7]�z��aXNe8�(\��B�Y#G�dC���	6NN=�f��<���>��[ݬ=�u_
+���~m�!������oթ�V]��|
=�U*Uq�jڦ�uɯ��my�b�q���l��cyhf���}���^�D_NGv�uAV�4�u��Sœ�d;:�ǜ��ձ�Ho�H���������N�߶�n��>olv�k��c��#J+5�iu}�����Ĩr/c�<��M�iqϣ��ig�!��'��?�X�':�઎˘��o9vW߮���L�d�Wb�W0\	1�F�^0y��I�4A��@>�p	i��4"��^
:8�C���I=�TQC�����>%�:�Oc��Ez{�.�l�,{E�X��ꟴ�`��$F��$�E$�R�Eq��ܓ�q	@>��4��A�]:/�f�Ϡc��R��>����B!�1���4�"�@��_��}af�0���>�e�|�N��D�q��W��#D%O`�q"$>�k
b��(߁A��LY��=��!�Bpx��"�Xzl��]y4����
��ɧ�I�p��g����%\���=��@�T~����I����'U*DN�#I�a
x%�"�����M�G�wk�K����8�Zd�z��b��~��Z��|J,�Av�|�R;ę����$B2��?����햴���ؓ~8�� ���~xh���7s�w�b4X���D�"��PK
+�L�>$����#org/antlr/runtime/TokenSource.classu�1�0E�Kiib����3!�BeE)m*E)�l�C!�v`‹��߷ߟ���Y���~�K{cCX�7��*!�����q�aч{�L�+�Ζ|�
ޮ�]�Z%
+g�Q^��k����@�A&��|$_��<_+.]B Dńb��1Oi��|
PK
+�L�>�ݽf�
+,org/antlr/runtime/RecognitionException.class�VkoU~f��iw��u)�r�e�� ����ťܖ
+��t;m���,�)�
+
+�(�5��5&�&$`����������'�yg�-���
s�s��ޟ��?n����8�Z$J��"xI�v�� �=���>��H)���
s}F�!�:,�G"(�~��"��='���1پ�B��VP�H��+E�88��|�Ua�€8T1��T2�츫`E�v�t��8mθ嚣F[�r����n�p�Ƅ%AٵGKA��NJ��Zv��`irX?��etk�mO߰�vy��y�1-�O��^{�tM�JXI�B�f{��]CNրM�#
+�w����TP���K#���r
����NJ��xn�����S��à;d�)h*�~#mZ^]i#+]];_	a�1�:zڕL�n�M9����|�-똶�W���z?sa�K��/��;��Z��h4`Z��)(�o,���w������Y�v�B:>J���-4܃�1�eÌ��K�އ��N��6���Bu� �k؄4��z��-�F�����0���&4����V4j�E� ��W��V��w�p��,�kh�#p4��0WŸ�8��
�-�QA�=n;��Q���	Ljx/L?�"H�N	�[A�����2O��N=G\�d��iJ4/0�5��"O�R�(u��@��l�}2�J�xʨ{��qS�p
+�t�����y?�֦��/����s���f"��f�����[ݔ�����|���E	�ʸPRdR��s�$�����[���J�r
R��񻙻�\�����x��0W Mp?��� l�Þ�Mؚ7�/�<�1�_E ϡH�U���B<��P0���X�
+�JQ�߄e!\�B$�����m��M�rQ],��rX������4�n�����0�A�b0��,����q>	>�p��0�1���38��0��^���]$i�+��_�@5kS��,cP��XC��P*[r�R���<+s�`[0���h����B|�c�-�������8Z|�Z�ž�Uo �k�%�c���E����iT�ݚ74}kf��5��U��-A]G�vJ*��6��\_��2ߺ������M�,gӈ�S[��P^^)�c�b��P�x��������p�;�����R�{r�T}�5=��x
]x��R8Ͼ��NIG.P�m"�%�=�������>�%|�L�w|�?�����_�&�Q��V��;��dx
+��k�Jo���Ȉ����Q15��.g�+'���;�J>BJCs�Q�ȧN��Z��'hYF���I���"��,R���E>��\��H�"�Dɸǜ�-s���se\������ď�_�p�S�Kx�Ks56`���/@�s��(?�Y|�?PK
+�L�>�iXorg/antlr/runtime/BitSet.class�W{pT�������f
!d	�<�>�ZQD!!�A�����6{�f����F[�R���(j�M}��J�N;uڱ�?}���t�tڱ��v:c�3��w���f�hfr�y|���8�w�矾�]Ao��G��h�b�
^,�G����c>��a�~�C����6/������O�p�GO��<;��ϰ�z�C�����.�?&9���{�ͧ�e�]�~��q��Ëz�C/�ړ{����ّ֘���o�3�	s��ut���4�vc��}���ս7�z����A���W���|� gSd�֘��Y��U�7r��v�:̔�٤�ҼV�Z~{��:��` 2�D��ͧ��D{:�k�Wr5m���]�t��9M;��z��Og��
+>�qbd��`"���F�"
�t����RV@hJJ�Ye��MP{���02���M�KS
+����A�9�)A
L�9d�1'hY�g�]R�S��E�s枍f2��8hN�@�'k��M�7�����Kf{2z�`�\B1<�JC�g��[R��=fnB<�թ��|���b��A���#�|��+�1��n�Ŵ����N��⢃5L�e�{��f.o�ݛ2�YxD�@z"�5�
��0���U�3@h�XS�6@1��`�L@��!,��!�;g��
ν��tF�vE�0����h�73y�}]j����1�����l���S�˛�s9}�G6��eddB;x�08�y�GO�4�a��
�trY�������R�Z�0���o�H�˛;�l�>dƜ�8�
+�L�.:j/l�&��w��sz�,�-�z�����1]�]��,|-�H_�Yȥ��\Gʭ�[�"��ej��J?%�
+��~J��Uz
޽�D��u>���7�2�C'�t���ӝ��O7�&?}����um��.�y�~z�N����7-�"i*�f:�\VϬ��Lh�А��{ّ͝�G�Ot���<�c�{P�JS�*�c���e��p�)�Ӫ_Lr��N=�������vR�u��}#(���	�2����.]r�-Y����ŕ	6��8%���7}��Ƀ�m�vJ�ĝņ4
+��Ԅy=�AQ�cE�8��E�%�@�a���R��ƙ���l;C�$�
+�_��
��1�[d�����E,W"n%���g���&甔
+��ʯ%/]'%͵��$�]`BʼN�|4�Q�Ԝ-��9r	�P,t��z�<]��	*� �C�_���:`&j�*��6
+�jZ�y��H�Q���V�J�s��rȓILQ�R���nP3�igP�t�׶�/����P��*�Pd�[���x��,�]�`����wk���������ٝT�J���]E�C"��Ck�Œ}��m@6s���Y*��;�,?�aJI��{/͢�T��RK���K���x�^1��*ReR�ܥ�W�*®f��̺�C<L)�K.��! ��2�����N;Tb+�UJy�A��fK�N��F����ԅJ�uZ��j��Cr�q
+��8����Y�炴
�nP��ʒi�Yh�Y���3F��4�w"^�h؍���䊞�N��=�u�ctY��%0
���#iv�!`'Sp8�*�|���5���zEK(�&9�y�ʢp�,^�nO��@ϩ�1�нP�J�*R�h+o�y���#= �)����H���h��F���Ηw��)��RU�y�5�@܏4Y8�;� �?T�D�n� *��D5��5ʼn]�F�u��9���ک+��_ T���j�7fa�n	i���4�w÷'x?�8�3�0~�)��m��!��~|���|<�]<b�o��%c��N2�_F}��m~��e}�|ygPy��Uz1���3x�8��B����L��m��t�� �E���e@��xM(�U��U��g�/��U��.Ơ������}����*?X����g,EA
�tĤ]��J���v�����m��u��.�"_�E9W
���'z�%���8{���!'��b+��R�2�N�l
+~�)x���͹�J����q��k�ho�9F
������T������{�Q!F]�!���
+�b;)
+7d:
O K���gQ4Ρ9���|��4zϻv��G�8�]�^��d�N&{V���
�m�Ń�ݲAp[�<x6�S��~D�'��|%�EG��L$�2-���(��
-�>���:쇒!�E��V���1�Q�"ڿ�����y\��g צ|ԅ����'h��2�q�q�:�/a�h��F��
���w��<G�G�����(�����}(����R�g
+�|5�Ϟ�C�mx�v�|�wʊ�J�6~���د�j<�[2��bm�	WW�m/�);���7��;��#���}\Tf�6��*��(��e6k���_�o(B0F�E彚j����[=��@�/�ῑc�)��`�m��{��k�Yzu�diT�ce�8��y�����(���O�d�/��(��]-���[T?��0U�+F�[�����|wM	uK�Ee�c[�Q���R���Jܕ�%�������y[��X�P��+�v��tT����^X��<��p�8[ÓP��l�,	�m
�a�u����(��KQC^1�jD-Ջ:Z�y\����2�e�(�f؃����E�O�t?.��-�,s1��%�5�R��W��l��U��ze�4�dW�����C�TLP�TudF��G���T>�qަ�h��U
]�h�ʻ&����5z��+�
�tqs�u�*�1<��[�K}(��ⱀ�J^��/΄��eڨQ�a��n����S[�V$�Leb	��U�+( ��Eb)-W�rq5��k�],�.��n-t��md��ҲV���7B�,�|�'xJ�
XY��t?C�uD��
+tׇ�k��u����PK
+�L�>�Є|9-org/antlr/runtime/MissingTokenException.class�T]OA=C��v-�Bi���Z���ф�
Bb�˲���v��NM�7�0Q���ȃ?�xg�"i����;s�9{f�����E<�CCV}��!/��
+qD�U�$��2
+�	��m%�^QpG�jk1�ePl��=�+�ց��4�S3^�pK���c��!=��~�V8�Ė�����v̽:�d�2뻦g�uo3,��Cn��j�鈺gxmG�
n��[-۩��o��c�]��W�7Л��7�a���8�4)'A����f[0��U�!Y���}���$�"\��j�z��+��D�o�m���my����,K��)�d���"&U�㊊� �Ԡ�F�Z��B���oTZ�:�@]	�M��ᑊ�X���T\��L���k���C>�0���+���?:*��D�����D����iA��p��_�<���h��1����]��*���M�,L5��4��D��`�(�%�Qs3�.���p�G~��"?W8�X~�B4�T���#������{Z2�!��U, ML�I�!�������Y�I��# ��U�:�="'(~G��1b�r�qY9B\Kt��W��k�(!y��,�9�p���Sw)r#�I���Q�V`a������>��oPK
+�L�>zO��Borg/antlr/runtime/tree/BufferedTreeNodeStream$StreamIterator.class�T]OA=��v��Q>�Ru[�E�(`D0M*&BH�ɥL˒v��n	�s|��L M��e����^�m�v��sΝ;����`�i��	��݃4l��Q��
+U:f`�
��6Lxd`��c��UbH�[^02���}Ys\֥#�"��	%�Ϋf��%�\�d���+�����ʞ�x�U���	/�c���ȓ_c�(g�,{�/7\��uB2e����\�<ue���EP
+�tC_2X%!�\��A�i}�jFF��QƖ,�ݐA��HWDI��/o�;�SwE�y���+���4��
+R�7����3W����%Oy�^.>�-t��B�-t�����i<1���3<��3��e<5����n�
+=_0U\!�0ײ����o�HLIФ���=]���A�Ы;�ucW�aHF~��|�V�����H�}n�3�d��	�K��G�~U��K���3(��D�N%��e�����@(fԈ�@}t�����>�f�NUvF�
+GH�Ch�	J���-�"�9\�;EN币,�2�ĭ�j�*��@�]��1�_`�_�k�NHSQ��3�'��1�A�ħa��NQ�H��ɻ�4{�T����?�G��k���{���`�H��%�'�唣z��F�6�Ȇ�h�D�z&}���FޞiČ���F(���Ԧ�PK
+�L�>�&���.org/antlr/runtime/tree/TreeVisitorAction.classeN;�@��Je�4��������~%�w����,<��2�2�$�����zءȱȱ$�z6�Myj�S�N�F�ﭩe_M%B��A�ŏ\���By}ecnv���P��n���s�����N��(	Q5�V�[�� "I�M�@�y��dQG�PK
+�L�>��O�		D-org/antlr/runtime/tree/DOTTreeGenerator.class�W�w��Ɩ4��%N$�P�c˲EI��gs֖��dd��I�3Fe���h 4m)[�B	�͆��m��e�������)m�}3�7�8=�>�o�}ﾻ|��������U��spe�T��
c5�pH�JV�:��Q�{��G�}T�wThp��n��1�W��;�3O�����p����Y�)����,�
+��x�Y{<�V~�ं<����T4�/�̏�V�c?�O���g
+^V���W��ӯ��so��Mo)�;���w�Rƻ2�H������#�y�SL�k�E�`ڃ�14l鮑�!��m�]����FnPPsy���V������y[���t�5��F���Iګ��'%A�Zmڦ�FBmSs��@���-����Y�f"[�~���&��d�͛���J�ki,�v{O}7�Q�]�@]�f%\l���t{0�=���wۯ��ut��a�0k�f-x=��c���sQBb6��c���G,���M3i�.U�f�$�^�x�1�5D�D��g�k7؟7��:v<$��m	ڰ^0lw�?=ѿut~ȿ���cv''׳�>&�M�������>��s���W"�����Dr�6�i�d��ϩ9�c'��J����ݕ�!ֺm�4�J��aϞ�Ʀ��4W���$ؕ����\�N��o�7�k4Lmm�A�zl�p㴮��tiX�u��Y
�c��yX��5t��$4]�.ghȱ'���=2���+�``��������8��<.HX05�{Jm��K��΋�@C�5�W�2��`�!�\'�񛸛�cSB4�`t,Ɖ8k�-~�\��!>��Ʃ#����{
���n�q����Ų�dA��⏬�O�����6&?��d�E$I��9XЇ�U5�r/w8%�]
t�@��h����`�c9���e����q$�c�b��y}���:�S1*#W4��U4h±]�/]�1�HG|�a4\�_o�:V.�-��VɈ���!3��;ږ-O���芔��7���Oʛ�ASE��E6x���X&}��=	'(�K/�C³��J}
�U���NL��&�GU��g�	)�e�Y��'�D&ؒ��	�6��5���&�X:�'��F"΋�D�%���x�Rc�z���m]��7�S��4]O[�u��Lt��]�P�-n�K��%*+,��3�4!��ʘ�)�|���j�nH6lڒ�Uo�0����{�U�u�z����N&g�^�X��V�RK[�Z��b�n�N'@�ͨ?�e��v�Dj�v��Nq�Tߨ?�y��iYSTO��L}?dTOy�5��l�W����
+��|]k���^�J����D�;?Qa���)��B|鶠Q�ķ
+��ۀZ����eH�Q��]F�$i���t�x�
��&̥�bq������_7��S$����2B��ЕlIE�e�%<W1q���C�}�C/�ѝvv"����O�o�����pa1��{IS�A��8zvcv��n&���#����qWBB�!��<���9�s|���>_q'����B#,�q�T�G����$Ž���S'�ąi���SΧZ�`n
V/�L��Q�	�Fnd0#�+B
���hM�4��`^-2r2�YJa)���Q9Ei����w���x�3�c�12�8�s��')Oя�X�g��I��y��TP�(�)����i�nrt��#td�����%X�]Tx���J�}�*����%˛I�:�d!�����m|P^%N#��j��b>��YP�ג��MeD˸9d�[j�	ծ�d���I�`RRQ�[OR���iPE��2uѺ�B
8���G|=
��
��%�a�i����+��r\&ԟG�^�x�"z��|�b�P�f�F+��
+����!r�j�}8�8;Dϱc8���EvH�"I\�����k�(1���E6�� �}�!���N�JZV#K��Q֎�Ɍi%C#��T24R��Y?C�T��/H�G������?��N�ْ�n��8��sjB����b�@$�l�1
L�W(�*�Q4�3q����pB���)ܗ5H!���U�>
+����
�'��ט"��b}�O�}"���U�m�qk�(��br�}D/������}D�q�c"wv���ߤ��m�gd�s܁/&4�L���t�,��?�}�F�c�=-���T$!�R[STrm����K#�Q����B��}�����NJ@d9
)����XA�bkj�Fц�Lܗ�_��+
�7�~��$�AA��j�_�S	d�	Xz����	x�r
���m�X���2V]DX�A��.h���h�/���N9��f���
PK
+�L�>3u��o'org/antlr/runtime/tree/TreeFilter.class�V�SU�]Yˣ��XT�6���W�C!P�ƀ��a�l�d!ٍ�M��_��gF!S�q�����n��]I�L�=��y�ι瞽�����EM�b_���0�
+�1t �EΒ��:�������V%����䰮�a�ؐ�G�z,�=���*�F�3�c�n.AW��2ra(�)0l	D�ʞ+�.ڶ馊z�bV�;���l����v�sM�$0�v�|R����t��g���	��}�z�9��94<�Ci*r���zN9缰�5���Һo=������t<�)Uˁj�e[�=
�L#'g��֘��ğ�l3S-m�Y$g �zqMw-���`1KW��$��.W=���d[E"�bN޶~0�lAw�\��=���"I������r����mP�n<����dQ��ɥ�m����n��/��}
|{�c/|g�eIе�d�_�HL/
+�QX�ʍ�ʚ��.���֚���U�%��t�}�ZP�5�JP��q�1v-u'�Y��2+�Ύt]�fu��)*4��a���<�7 ��*&oIeF��
+
+*,l���	;(���q��}���I9��c��R��
�Ta�QQƷ*\�L�V
c�7���T�o$�JK����CU`����2˺[�2!
��
+��
���R��͛މHa� �5��'?����?���h<���V��p,��IR���tc�s9Xv>m��"[u|����/&[��w˚,+�����N���ו1���0/�x�|�g����)��!�q��ʵq��u��ѾKF�q��/�y��:�7�H��
��	�)ir&0��&�9�h��:"�
:6�:�{PHwJ�k1-�
+�{P%�#��cǗ�xı�
����:{�i�82��	�|�H���J��ȮD��>��گPu���Ɂ?�ϩw��>.L��E��N�gD2�4ف{��s!�N���sr
^�r�f���q�nc��N��c��G|#H��Ǹ����*�K�F�����60H�o�q���|���N\�����	��m���u��������	���>����5q�(��Ma�� ��D'�]D}�K߬�x�]��O0E�����Lm�̗�c���a9�F������C��PK
+�L�>^�x��)org/antlr/runtime/tree/TreeWizard$2.class�T�NA��-]Zւ^���؊j4�4)jR	̴�e��N�M|����0��xf��5n�3����t����@O��7�`�T��N"��
8(Z�ka��=��݌��Z_Y��0��񲫠��R�/�<D��T=��J��㷕�[�фw�њ|��ff�}�!Q{�tKh���ucAΆ���Ý���S��&t\�d�)2L�����z�AdO�?c˭2��^S0V���[u��K�����*���{ʘ��
���=K�ud 5�B���j�yQ�
]:���Kq�o�2m�9�^ms_(�M6Z�mVTS��B7.�70e�Gؚ���4��%;c��y��H��,t�kZ����6�q�F)C8ocm<B�¢�Ǡ�M��!�"�a(�lX��;z����R��g����4��R�1���մO�*厮~4k�Ec
+�ٵ�����۱N�8���&%=zL��:n���Oۛ@�J�$~�6c�'Ѹ�J��`���-�3�|a,?��H~z��'�އ�KD���2Q;�Gp�`�;i\��ꐧ>:��`"�}�"6Z��xk{>S�5��2�I�~����=߆���0^��sOc�B�4&���QL�^o��1zGs8G�U� Ɇye�_��x�PK
+�L�>޸8;
\+org/antlr/runtime/tree/TreeNodeStream.class}RMO�@��7(���z�)��ē11iB�z��K-�-.?΃?�e|m5i<�Nv33�����z�p��2��qD��l	����M�R��Ҿ{�<ᑽ&�zCB](C�<�fĄ���݉i�+�5���S�E�w���q�B�`���W$�7c5��!�g��.�O��9��-�����l�~4�9��<u	E��8\މOI�@��+g��͛���R�6�B5�ۗ քn���e�I�t�wA(cl�y��a\�
+��?�WdB�o
�ɦ��6��������`�˨$XE-�-l'X�N�
4��^�-��I~��9|PK
+�L�>p�W
G8org/antlr/runtime/tree/RewriteCardinalityException.class��KK1�O���X�ֶ�+]�}�#�N��Uu�J�i{#ӌ���UA\�t��L�� ���/�������$�� ��
+)��Ӏ�=�aϨ+�͛�Ky-]_j�m[���/�<PZ�C�b��q�#��}�5���ѠK�\v}
+qAO�iT���	{��{��x���7�i��ZC���(Kui�JK_ٻ��E
9��=��Pz�*�+�v��������V��m��,R(e1�����3	�|FhML_��Jk��	�����*�U
+i�3��c�:�'�j������y���:�7�w��J�nd1DUH
���M�G�f�
�W��e,�߸UNQc�V��NS��BԽ�
PK
+�L�>jN��5org/antlr/runtime/tree/RewriteRuleSubtreeStream.class�T�RA=�;a�&� r
� ("("
�PEY��L�Pˆ��z�}�'_�ʒ�?����{�D�P�&���3�}�O����O�
a!�j�1�3�q�:��ü�R��2\e��0�p=��(nD&���[�t���
�1m�v-GmKݱ��W	�sƎ��'�[�SC7
kC_qlemL��	�f�9)P�V�̸���^5�MکM糆�f؊m3�l����q|����r�]�-�����@�(�!�y�j�i�mi9����Վ��W�G����C;K�[2�x���+R��������u���U���$Uk��ө%�;oB���r��) H����@0��t'��W.E|%��Y9�x�-Ǎp�#5��,C3C��	Lj��[�Х�6�5�CS�� �a��0��.�iH!!�����(��AD��^��^�%�S��4zDoMֵ|
ÏY\���ϒn/IZ�CX2�4o('/�ڐ�̦2s3y�oPY?�)v�'�S�%UvT\ׅ��Q
��!x(��d��/M���A��eu�qz����j+��
�^�(�����<.�7�m�Ӯ"D_ Fi�8�������ɢ_)o��7����E�?3��ge!��S0\�:$T���l��ɏM&? �5�4�ESs�
�� �H;��}T�{؎�
+m�Q��zVpZ��~|���-�ߍ
+�9��<����ЋE"C��
�X�Z%�VTҘZ�6��dOhl]�� �(#�f����B~�S�ˑ�\L�>���R)O�5����VR�HJ���ɟPK
+�L�>��Mf�&
,org/antlr/runtime/tree/TreeFilter$fptr.class�OAjA�6�����sq�C����!�qi��ͬ��J����Q���Ku�EU����`��Af�LH����0}�"d�?9�CY���E��n%�E%�O�������0���·J��>��l���M;��h��޳�U�i�!����/�r��<�u\q^����	��S��8��H�?*������������^�=PK
+�L�>���j�4
'org/antlr/runtime/tree/CommonTree.class�UmSe���r��*EQT\��Kj
+�Bi("	��/`���.�Y��>��Ʀ7���9SNa#8�Lӧ��W�K���]��ǃ����yv�뺞�m�����
l�t)V�Dq�y[�I���?�S�|��4Έ9+fP��s��1({Ļ �E9�n23,ߍ���\���⍕@��\�c\A�6�5CAC�i��3����֔a�Z�_^�)(����2F�iJ��D�6'�ul2ci��`}�Ҵt�91a�tkxLώ,�m�
�>� ܲy@A���Tv��351�Y���,wj���Lv c��6#���S����:膃�����M�+�7)��~7,���/	L|dj��A]S�;G�w��ѳ�UyR(�Ojκ�[k�$�#����L:�1F�}���m���:�2V���m�4�w�fAu_ [5�"���.�jTw����~V�s/�5p�1n���U�9e�0'���L�%��Q���f|��Q�O{��^�j���v�T�I\�D��s�S�ئB��3��a��.�S�/�m�$6bSkє�:1�lDW�X��i����đMb�&�*�%�_�	1�8&�h��1rq�IL��*�%�!
+�eyP�z4'�
+v�D)��vͲLK���fA��&r,_�n��d�z�R����D�S/y�b;4	p���*���l=���s6�*��ai����)��J1�^81tY��������4
+E�C/"�s�뜧"�s��u=时��������EHLXL�1�C�L[C4`7�VT`j��I�g��10��u��Um}�h
����Y����3̗y�F^��(	+IX�}X�jf�la]�2��#o+=ő�͓qޓ�P�zj+%�)��8���X���S5�T
H3�B�;<���f&T^nƇ�9���pE�p�$�{x�λ�o���֒B�#
������z������CD
+@�@�}�=�a
y��uA��G��#� UA��	�aS��d�Ɇ_R�q!K�@�4!�����Jv� ��J�L�,W琼�
+5<��yTP��ʂwps}����v�p�x�O��g=�.q�\� �]!sU���E�Q�R�Y��Ğ0����}�^����!�չ
+�]�jȋ�]a�X�U;��裿�Zw�xMSSl�|G�:��T|=�1�b�&'��*
/�4\��}*��J?,��Pq��B�Q�%�v,L>%�N��T����(yߢ^U}Ń�2�B���)�t�
+p��Oͣ.�?�C�
Ey���.J�������>���e忍�,�W[�L�Ԗ9,��,�cv�'�ǧ��g��-��s��[8�/p_����?�k��7�n����V�3�tBq�g�p��MT�M������~�Oip�E
+Gʽ���?؂�W�E��.��!/�	����ŊŒ�<d<�g<A�����)���~\�z����{��ľo��X��z�;�Vͼlֹ��h&�cT��'���?
Dd������PK
+�L�>���T�=
.org/antlr/runtime/tree/TreeRewriter$fptr.class�NAjA��͎����`.N�9J!�|`\�ed3+��I������� �žT]�U���
�#�
+��5!��d�h��5F���u���?�篜w�V�V���yn���M���)ֳL�[�0�����R�4��w�>���n���O�_8�2+M]sM�-B���s�yU8���$�/O	��PBh#	�*��i�����A?`��vPK
+�L�>�g���'org/antlr/runtime/tree/TreeParser.class�Wy|e~�d7��L�mӒ4-���J)4��[��&�	���i2M��f'%T�*����(Q�Rz$
�r���( ��*(x�
+�y��l��$���d��f��z��'>�� ��ՌV�Jq�P;�r[>��(@���
|K��`g!��w��]��^w�bW>�ĝ���
� ����wc��ړ���'�.y�-����=!L�
�to����A��A<(��D��A<"�G8$�����P������xJ�=��Pφ�#<����I��� ^�� ~�KxY.?��r��z%�We��z]��!�7�xK��2�_��ע���Q�-k8�^A�(�X�L�3�1cV.��Q�9�Q�\��֤�?�p�&s�Y3mUM�M��S�oMv��Y˝
+J�l4Dz
+Ei�'���6���}E����v4��A=%uI������*�#�D�V�c[VU3/��V��-3N!y󣉨�@!R:L��k��R�F�EV}G|�e7�4EL���5������l��NJA�i�,�5
��m���d["z�e7m4m���1K�O	�0s�\䱭�E0sKE��G[�gm��,���
��7%;��ތӺq��H�Bn[�a�V©��6m��O�N�&��*KV��MV�CYS�daRQתh*Eͽj�����M&�w�X�B̫�ظ$�4Y�����xi��XX��d�Z��[��-�d�ې�Œ�*L\7���V'c0[�v'i+�*��ӻ���N��ʼn-
+���(/ږH�R�d���A�q��l�2viO&��z�e���q�G+u]U�Z��
+��q��P�T�Q��Xn�I{�e�Z�h����֣z孲R)���-�=u�4�R]l@c=�s4������z�]Ǵh��q���7/<
D�[��-i2�A3�b�t&��9('3V���^��}u�x�l�'�}DN"�P@�g�$��~y�Y������;��)���s[c��5�V���5g������;�B�N�"*#gT�L����z-8W��0ey6�x�؀6��շ
�����M^ұa���??�����?����-0����M����T�4�'���ο��Ŀ\���o���>��C)��x�P�(-�Q�d
+��U��|�Q],yQ�����P~��Fen���X
ҏ8��"��H���PA�*L;�D7T>�*�
+e���F�$���1�M
5�PcT�@�,�j�*T��pM,f����v[G�C0�h4�ٌE[�S[��Y]\Y)��W�0�M��ӷ�+�G�����`��T��&
+���5IM6�u<��c�����2n4p��f`������wa�"K�
hd����5PR��Wg��P��	���LY}�����ʇ�� _ʲ8v|���rꚥ��x�g���n%Z��a��t��g�欦[X:ӳ��d�N��.C��>C�M��5�ѵ��f��-�g9Vx����n]%�ĜhX2�V��7�j��JL���4TK7Fc�K���o���f֤�O�C�`@��ù��k�v^��Lی�M[�c���e��dg�=’�|MbCRN&$&���n���ɔNǚD�f�%�GA�7
4�j9y����أ!У�$O��6a�o(
+����S��-�wM�%�c�H�;@rf��6D�x���n�c�2��SN1�j�q�-��p��0>>q��i�E������e��@��Y,3�$��@�׈�غFg{�]��;��1���|%?�(B
j9�>,��zUֺAiԤ�ҕ��cHߛ��''���9�򺖫���=醊�u!�n-o�#!����y�1�q5>���@S"Ui��2���,��w#�S�\�QM�yZhqz{Fh�+T(�ȩ�l㊯�k�B�}������� /}��4X��B�Y�B,�ڌ4��M��ɕ��#/R��>I!�tm>3����yZa������iweD�釵Y��3���2�v�C���N�K�ϒ�
6"�JX�RP������:˗�����>\��+�N�Zۍ���EȻ0r�,�Q�tat��|/�P]�
+�yEy0v�"7���0ۀt��T���b1deZEƐ��!Bő�f.D���j���ȩL��0Rp�s؜6]�N>?��F$�����~� ��eUd�\ރ�lO�S&*ܝ� ������rnEm�/oS�aQf� "]&��o�U;�<$�G�ݚ{d瑮>Mpj��GA&�h��$�����C8N's5��{	s��>Nǯ����R܀N|�c����N�
�6�`'���B�s��2
l-��r^}�]�����l�F�䵓%��1��~�t�VIo�(���|��s4%�˥ђ�
+W��*|�M6���En�1ώ�,��K�^oC0<m'�������]81|R�.!�t���J�E��ܒj��ݵ�r�
�Q�
�ʲҺ���˙=��`�H���2�t���R�9`�sW�����Ϡ�T�(��b�a:sn&nf	ܚ
q�&�,�ސ1��5W��?���S����&g�O��/-���rW?X�̂erF�d|��88��-��)=�wO�FUEN����)����0k��ǩkó�q��E��'s�IE���]�[O�����.̗&q��:'a�|�uS�-�pQQ^a`VxAnC�0��.�g��Y�A�Y܏E��E����w��8RIWw��o��|٫a�[�#$����G�
��D�0H0��Yz��<�ex���a��Gۣl���ɏ��g?��{_�S�O3���v<ˮ�v�yf���"%��]/k���n���5�ܯce|��O���^?#�:
�)	����t�
+%��%�#��/0Da�})?-���\�@7�����@��r=��5��}���|w�]}������T�F�u��`���V���X�RIƅ��%J���|zk"mZ%H揉�M���n,�?��f�|'�1&��c�F�jK�V���c*X�_��T��0Yý����
0%�t�������X�g�A�n���)�LeV������
�kژ��PK
+�L�>}ϙ
�
0org/antlr/runtime/tree/TreeRuleReturnScope.class�PMK�@}ۦI[��Z�kB[���x<�����Cܒnd���R��8I=�9����xo�0�?�_�pچ�nu�8h���N�;^����2�|�/(v���6��
+�Ù�w�=�@g�
=��9٩��T��X�3eu��=��W��&R�Zis�����Dr�0�S��˭���ز���6+�ê��Q�ۘ�uarV1���р/0���]�}>���؀�G����L��1��x+�mF�,�c�1���/��#~G�uK<����_PK
+�L�>O����,
6org/antlr/runtime/tree/TreeWizard$ContextVisitor.class���
+�@E��H4>A��Ƶ��A�P�^u��u#�M?����DA���̽?�7}�|�|T�DE���A&Rhi�b�9��
��b����Ӱ�"�0�[+̈́��2��E�]/S}T	���4N[ac�ԑ�K5�qۣ�8>�UV&���7�N�a;�2�8"4��Z�xB�P��G!M9_�C����앟PK
+�L�>�/-
6org/antlr/runtime/tree/RewriteEarlyExitException.class���NB1�O�U@Q�.M4��&^b�a� �n\�a_.
�)���*<�+>�e��Ɵ�.ڙ�9_��������
+��(c���@���@�y4(tӑ��d�u6*{+��oq�H=��|��,�;�
+�ũG�8m#�G9�Tt��,9ՓV�{3r�Y���-�݌�壌�4��,�q�w�PZM�q�j�X
+j��7�@��f6QW�[����So����@뿍����t������˄=�x�~��SB��g�!J���9�˼W�����
+G��
+�\A T��+s�p��	����P-	>�a���S�PK
+�L�>1�n&
�
8org/antlr/runtime/tree/RewriteEmptyStreamException.class�PMK�@}c��Z-��z����J/���+�o�!�$��ݨ�Y���8��EP܅ٙ7�������	:���bK!8gî������{��d��Y6Y�`���))�6tU�7z��I�T�cm���@���\�,)mk�r��8.(v�(��ˎ���-Ąt1|Li�4=���
+2����}~���ʦtɵ��/��5��
+��_�O�@�)��[|�Ѕ'\%W�%R���
����$�J��+s{X�l�s
+��A����h�7��PK
+�L�>y{�~�
.org/antlr/runtime/tree/CommonTreeAdaptor.class�UKsE�FZI��Q,b�`�8
����8vB,�X�ya�`^�ZZ;rd�X��}���p�Pp�*(.98H�TQp	U�(����z�]I���3���7_������?��F�p#�7�a.��4܌a!�(�bs3������y��{l�g�
�[�t�=���"���2����P�N��e��@8ۿ ��͒!��-W���kK�5�/Uh&3k�ʂn�y�&5�N�.00kZ+9�jW���^��kFζ#�7����<�Jz�6����z����XvvU���*zu%wmi�(�g��S����E��m��P�7��`�XM߬�zI�P�D��/�#قjζ��Bo��ٙ߬AQ`���='Q(���d�e�\S�2uÖ^-Q�*ͥ��5�@���ۺe���u۬)?"�x<G4V�9�.TKƆ@gP�I���`��bc<'�j� �z2E�ܶ({" ������S�PSH-�&]����<	O��4��[���~jE�:ZS).�Ҧ����+�(!D�N@�2j�h�$�e�J)�H��z7��E�N$��u�h\,�{���#���s��n�Jpx
+G�*p��C�Xwz��*���A��R��L��S�؜��6㨧0��$��c=�)汚�4�p��3�v	d��#G�� tJ�O�u��
+5XO��a� �Q���
������ =���ὶZV6SG�Kdobw��v�X�8o_�yw�Ѳ��J-�,���/�=G��F9�
+�FA<$'�^�Q99��ɦ�F}�qT%��7D���#"��Dha�-'!�Oި��r�{/�EI�%S��˨�ch�����C�UT܅��8��.A����cD��!�kZb�9Q.V��>$��e0j�O0����.4 xB|'ԯ��8)�=�i���$��ӆ�v��۩m#�t#�H��[��h#{�*u�<I,� ��p��`��^���9;���U
�;EC�%/L8'�
+I�Zc�E(�4� �B�H	<��
e�s�E�i���G���ug�u�>��	�n�:�5����\7u��$��A��P;���-�����[b��>ٳ#�O�Ƨ��Å>���ń%�+C�6:B>>#Ɵ{�����|=��+��+r��h�H��[�z_�W-P��B�Wbd�2aI��{��~Mg�ƣF��͸jdp�<V�Rs5:�j|G��o�{�zC�N�vU�.?��K~��N��i�to�^Ƭ��Ѕ�xe��=D/�Aͳ��?Q��$�/r�Q'�#�EW�+r���v��h��D��PK
+�L�>{�-org/antlr/runtime/tree/TreePatternLexer.class�T�OU���v;�+����m�(K�j�(vY�-��|Im����,]f�0[�>T�����m҄b4����7_�1��`|����1Ͻ3�Uj�$s���9�{�9��__~
�D���i���
�\��`oಔ�^��IJ�a)���

W�tn�@���T�ZuL˙1K���JgF������ذ}ߨ���LNf� h���TzlZ� ��rٜ�
��pN�56[1G��)�d�1%�*$��h���
+�y~� �z�,��
U���Aa�e������Ut	-����3.U�%G�EK�U��=mΗ�$RΛ��.J�)�bq�ϖ�B��d'���E±�HL�2�%+���%֜��m����8ߪ��[�,��Bd�\��b�(3��;D������8�&B���#���:^�i
�:��h��tYg%|c:r't�ϓ��ys�K"��C�R�/	��,�W����@lT4d����=���w�B�E�N:�[
+'�K��&�qϠ	�geá�qKne|��1>V��c�^��g�B>���:|���:|
+
y���e!�~��;�N�j�*�Q`��x�ft����N�1����g|��cv4�;�;Ќ�v6j�|�'x=�^{9U�\�f�����t?�����7����2�$I�g
���K�7�6�,?6���p�wݷA�r����q%D6Т��
�JW��6wP�|�}�������=�Ue	>���p��瀷�gO�[��x�������Xս������\��'�9w�a��ת�{B��2J�^�Q�m�t���zb��>�hMn_�‡|[��'U�T��e�u�[~�+��Es�G��*��u��/��7<����	��I��)��w�f�+��7��w��\ß�A
�K
�I�`R3�
yj���X�
+t�ԇ"
b�2�MX&+d��
+ZG���}��5��uz�
-;Nw{�븀��x
_P�3f���';~[���t<
�&�ƚ��p�5�-ߊ ����<��������'�MJ<����PK
+�L�>q�R�
+5org/antlr/runtime/tree/RewriteRuleElementStream.class�UmoU~fv��n��W*(b;����"��H�����*
+��k����Y�$�}2M�+j��M�Є�A��E���
���93������{�{����;w���G�`'���}b�yA��$M��eyH�@=c0�#I�cH���s,��I4�,FM�
'��I1�	�%𒆚l�-]
Z����S�ȫ���TOC��9����ۅ�̑�s*���P��풆�`��9�̀S��x�q�i�c���s�*e]g�s���1�y.
y*a��)Ohl(����݌[.xΤ�x�R��4=��t;�۫aw���kD��[�)
MNA
�'Ǖ{��+�X����ud~4��s�~?���
����rT@B){�l�G���_h'��J���W�J�$p�U%Ř�NY��\N����I�*O)�EOp4���ZN,;?-n�4W�Ұy�����A��Y�4�G!9J�(9����l'�b�-&�,y�Xv��#�\�~m��&�6k�����`b#1�(6��f۱�D;2�	�,_Nih�T��u�i)��x��^�3�v�؍g4��g�MNy�
���Y��%�^5��
���n�)�yǛ�:~g4d��|y˗6�_����D���/jY�]uc�?ܿL���|���U��!��̐��#���?�=��q4�I�h��<t�8���Y�9�bbVz���C|��::i�|
�@���|6������!)��	��τ���C�S�6���J/���2�D�я5Jē|����V��7��f_f[X����5DR!RK��͡��2��
+\��p�p6���k�VA�D�-dK���[ 3�G�����AE
Vtin�GIL�@f�ir��P7HA`�Rw`�Z7PwM2�n"�cT>��A�4�vֺ�����LO�d3�Ү:�م�׉㒓G.e���z��f—X�7��-�����;���>�U
��@Cx���s�'�3��Pb)k
ݤ��fz��ڍ+h�F�a+=����4}}���'�(�Y�H�c�u��>+TR!�8���5z��!OLH�RRE�T�e4�B�Yh�)d�^ؙ�q��o�-�X!������qF�����]���:��pũ*��꟒�g�M�c%����PT3L�+R��g�k�7�5
+�[j廪�V�R=��eT
CR���ES��QJ��*,j|��P�K=�����b���N��K����\-K���*
_"a\�����*ŧ#��b���u(q�;��ž�^�H��n��wx�~兾K�U��"��TK�s�	13�����.-��U����}�޿PK
+�L�>��d��s1org/antlr/runtime/tree/CommonTreeNodeStream.class�V�{W~'��.�!)	׆���l�T�X
+�.ib������t�=$�3��,
*`[E{S[녪���jU�\D|���<��g��;3l���<�˞���]���?��G���%`�|[q!�m8������/��J�K`.���"uQ�e���ㇲ}u��dx�o�M~$�?n�O���O�x'������<�_�}�����$?�+�_��_����b�%���,�ޗ�d�a��qW
t<=0�͎�e�2#�tvl����������
F���~�.{���
+�#r���Og�c�#����'D]���eOZg���eO�?�&���<甲��:�d�n�[��|Q���ٰ�*�Hј��J���"K)^����x�!O���%��k�V�@B���D_��Үk��lb�*���Y�q^.�3�@k�������������+���2К��j�RW�5^P��[n^���Qo*OJ��fB�S,:�2Dت��rh`W�R�γ�UeE�"ݲk�մ7PPEe��=a�4xԘ/������XK�Q;����3�I��;�Ч����nU%�x�����Sq'����CVQ��;��$��ȵ�Lb�)w�dk)�]����;¼%`�������
+�U����%EO�F&%R��3�aɳ�iqn��-U�S�N✷sj�%���M��+x��*�	�?�/�\e�		j&�?M%�����f�z$�j){N�������2�x��aQnԊh��X�9:8#gK�6zd�r������ʉ�ՅCiˆ��U\�'����sʚRV����4��W�؄�ƃy��uae�]�
t߷�ab�2�7��b"�GM<��&v�	]K�&vc���$���&��b��'�;���&>�s&��?�8��1���5�e<�4^p˨]��J�����h`eLO��,<�/;����6�N��T�$�(YT��8T��ߓ�����:h*�,k����M��8���tpg�����Ȑ�I��#v��:<CXLI3��a�ļ��4���?4���R�oג�Gޮ��H/*}��^a
Ds΋����7ݶ�����K ���7t޳��jS�ACv��Ze�N�?X�����5���+���.Ww���I����7��i��T��Ǐ5_��H����j�;���:*	���{f����zf陥Ĺ�����i�!�<uƱy4��#rC��� }�LBr���W�V��04���!_P=�yDS�Y4�Д�:�X�wq�Zv�75��<�h^P�b���.z`Zȳ��ky�MB!�W)�h�
�2
\��2�zl"�*��h���|��Lsh]�� �8f�c?����V�YtaHs0}̀����@��?���Ȋ��3Xq]�c3h��|�M�b��KH��Ѷ���E_���q���D{.ac**
+��U^�����q��<�Ne'������<��7Q����B����Q�� �_�s���PF�V�Vr{��5D#�V�7i7�jPWVö��a��Q�7��u'j �*��Q��@���O���^3U��j����;�ˉ�V��j�'kU>!���_.���@�����$U���v���>h��/J�g��ד(���a$��$ܻ��K�`�8{�BH���cm����?�*5X�*V���`�X�bP�c:��m���
+�Z��N�]R��B;�z6��Y.g�����hJ.x`5��g���6��Zz�J�Ү��.暯�ot��@��V��lأ�;�hѝ�U��kl���X��S
0���HbB���3����s]�&66�F�[lio��;|��ʺ�I�S���4�U���^I���4��W��,g����D�Tӭ#U�_E^Э+��;�Q�Y�[�̘<�ME�gŮ�:�{;.���m����vΡ��S�Į����9,j��Q�e���}��C��n>fs��d�F��h�)�O�_��3x�lۘ��4�Nޛ�.j�Y��[l�2�PK
+�L�>p[�I	&org/antlr/runtime/tree/ParseTree.class�U]WU�7	I�W�h�(-ڒ/�h�@E��iCh��U��I�LX���	}r�R|���.t-��t��
�o�}'��}�̹w�9��}ν���_~0��:p���0��x5 ��0&�{*�[js:������AF={d1��q�S�Y�w?�!|,*��E=/�n�[z�����ٕM�j�hF>/����,�T}*�QHg�����a�舝L_L�R�9k�2Wy�"�y}� `qU/,薡��f��0ԗ-Z�iݴVڪ���T�mK��}�*�yZ��+�+�@�J)�����1�ui�?/���gܵ|f�3����m�:��Aџ�u�Θy������XF�3�K���Œ��Z>���U@����$��s~�uѰ7��N��,�0Ho��F��&*kk�b��Iɪԣ��7�ŌY����5/�#g��%�w!vZv�Cd�X�V崡����mP�h�Ɯ�N�ӐF���Skx��������?�y��ڸΣ+�O4,ಆE<��K!<���j�#��_�g��x֐q�Nq���=8Gd�r|����Yန��T�B�L�։ꥒ4yS'�99�^;[�a*�eE/�O9�K��
�����K�:x�� TWh	�%��n\ೇ�iz���$^B$�?÷�D��g�|&y/�x��M�:����E��.1;'}x�͙r��"��\Agg�ɡU��9������E׌����i7�.��q������k��ք�#�F���so�X��!������U�����	>x6��3�Ӟl[n�?��ߠWY�#�M�N�����6!�m�m�}�����C�M=�!�,���!�Q�U��A��5��?��{�W�?z�H�(
�p�?֣�=hߣO�={h���NE�hZ��'^�����L*�E�O�ԗ�.Zj��!"�+�K��1�x��ǰ�	|Ϊu��a�I
+
x�u��J{�?�Ԃ� ��9L��uΘ:j�{�r��Q��i=ZQ��m0��Fl�Z�C��(B�un�\Ŧ��5&�?�8��Ǹ��
+q�^���c�מP�8��}0;}DL"цYY�2�����8n9&�}���B?���fmʫz��?�?PK
+�L�>�`���
�)org/antlr/runtime/tree/TreeWizard$1.class�RMo�@}�6IM�Z���II���	���*zh�J�6��l宥�&�+$*~@	1�D���t%���μ}�<'��}���U������auk��c�G��:�YC�(��|�㑑Yܕ�yF�{�
+#�e��bX��zse2�2�H�F��v ?r�R��\*i^0<i] ���=w�x1�]����Q_�}��(R��	�z\K�O�����`G)��3^���������X�0,�&d2��n�P$:�ؗ�]1���N�kii�g��l.E^�$��o�橏��
+P�|�h��t�I�^�/C{vV�6�k��Z�YEJ�����?t�i���J˪��g��<M�#�;��4z4��V�iU�U���z}
.��@�S�+t�Q�,�<�}A�S���Q"p�Ų��!�pv&��2�yI�%p�N�+\g�����Y�LILp�u
�	��e�Mܢ��m����
�Z�,��M��PK
+�L�>�b�(r!org/antlr/runtime/tree/Tree.class�SkOA=ãX(T� �n}��~�hS0���b��X�������R?�h��G�L���̽=�����������x��C<
��,��$��i�2Xnm�\u7�ֶ66�Q�t<!�؉;B-�Șs�N�g�\V���g(�n��X�]��_�A��2d)���\e�zd�>�h�J.�2��{IY4x"��a�4��$�����D	C�$x<�#�Щ�<��>?�8�;V��ms�b��s�X~��=/�2���2��m��a|r�MŴ2\+
=�t��xCi�żz�.�t0�خ{��:I-�2�%OS֣�\�H/�f�|rBr�όڽ\r<��;�Z�s:����މ������8��.��Nk۽x;JD�ݼ%�.[YC6�B:�5�@r�vR�/Ω�Z���㺷Rfd'��
�2PAV�XV*h�Y@%j�"��i�Yx�u���B��)kc���wZ���}V��W�z�Yc�=��Tr)�f�;�tY���)���LɥSa���@8
+K��5�0�qy��o
+���.h��E�S7�y������E��qE�US��/����m��d�7pS�-�6�l�B�j�t0ܡ��~���^��W~��'��]z�A}���oPK
+�L�>F�8qr
�>org/antlr/runtime/tree/TreeWizard$TreePatternTreeAdaptor.class�R�JBA]s4O�,���Ѓuz�nBH��S����gd���z
+
+��>*ڣB�P�k�=��症'�X�0�IS̸�u1ǐ�ehvb�B�!^T5��.�Rv�U�˼Q%SR
�*\�6���"l3d�Z�cn��҆{5�2J3����v[n��t���D��i¦�
�}K:
o��-}-�E
�����濐)�K!�
+���~�e�?�6D`���u�x�a�["�w�::��}W��BkV1�\�4�O/`z�Y����.�!�
���M���u
+���� �8}{0���������{��n;I6�-��#��
0��O���;�H>�9[�G����
+d{����Ɛ����.~��3�	���C~�WPK
+�L�>
�ת
+org/antlr/runtime/tree/TreeRewriter$3.class�R�N1=&K6�n	�-P �EзV}AT�Z	��$F;�z��H\$�>��xAї�4c���\�����&V�p0�a����Ŝ�yu��鉤�ɰ�V����:Щ4���9I��s-���������)��f3{���Qǜ����N���NLH���0>
+������������8LN�j�۔��S��\k��ga������Э�{�J&.�>P���Oa9co�mX6%�+�X%Bv���cK>\�|xh�XF�z�+7���	Q'�POFSa�����}�.M��z-�a)Gh�B�N��Qƨ~:@���0��HR���^�]C$>����+��Z�k�c�:��H�r
��~v�P�hv�㨑���E��+�n��P�z���^�$!�(`*����6Mz��J���U$t�X�PK
+�L�>���V�
\3org/antlr/runtime/tree/TreeWizard$TreePattern.class�R[OA�No�.+�
+(��
+�m��ϖ�h��$m0�6�CY��6өA&�&���?�pfۈ��˹��}���������q1���x��"��y�Y��džMV�Sq�;����ȈPj�E	�ZF��W'��bؖ'���!����V�f�{�P&ҁ)�eЎ?HU�2��+	�f��Q�#u[t"ia�CZ̘�pH�kk)��1R+��B)��%'�+����M�Y���_�L��OQ,����\	yO�%,��+�ЊG�P>-��܎�����<\#,���ltt$�-���6<lb��'�`��6a���"�g�7�~?V�������` /��_^������P��F@
+dg�0��4��`Ybo���\ms���o�t�hY��"[˓*,��X+��3Ȟi:K$�������|G���R���s�Uɱ�yVg(�Z���<z�5죆V�MFN�S���{�����#&W8PK
+�L�>ؤ�~�
�)org/antlr/runtime/tree/TreeFilter$3.class�R]KA=c6�d�5�F��~���)t�K_�B!m���o�i2��	����������?�%�Y�� ā{g��{��{g�o.�lc�o<�����]��Xu��P0C�4��m�A(M��J#F<0��K�PĆ�}�R�4CnDDԏB
+�ac�ܭ��Rǜ���MG}��a?&��VQ�B-l|:�40�����I�	Y�|]c��utjur��n��g��F(��xGqG�:�鶢懓�GHȁ�b�9���P���pQ��ꣁ*��e0�X� � ��?ᑡ�M&~M�mO��H
h�����j��}e��c��_����*�9�K�k���;z:�R�!��g`�L��r^��\�7�����C��쳽B����E�[�y
+v���˔���i�5��B��B�y��["?KV!���*Z+�n
PK
+�L�>�g규
�)org/antlr/runtime/tree/TreeFilter$2.class�R�J1=�k�]�[���V�
+�����"
+BUP�}��mdMJ6��Y������*�P3ɜ�s23ٷ��WkX�����NLxä�)�.f��!���|E�zJ�@��W<0����ܾ�
�[��;i܈���B
+�ð����9���j���"$?j]U�>�1!�����<���_�cKc� %׻q�$����ו֩XG��Nf�����F�i����9�OUKG6�V��\��CB�d�D��!7
Us1��E·����4����g�8���z�#CkO�hM|n��H�i���wc�m�\��5u#1C?E'M7KV��ў�]d����Aq��W����Os��[.p��~z��Kj��P�,��I���+?�=!���R�[���F�Kc��!d������~�a>W���l�PK
+�L�>�r�F�2)org/antlr/runtime/tree/TreeWizard$3.class�U�NA��ݶ�].o �EJ/l��Ԥ	�I	F��i;�K�Y�;%�+����0����P�3[(FZ7�sΞ�wf����JxG3�X��4��@�I�a>�n%���b��]��w2�
+�gX��{�j*۱���"C��V��Pv��Ԧj�+%<�=��'ċ��ޗ�ު�}_P0k���,.��Y^S*{GX��-���~ǽz�?%K�{�o+�c�_u��j�P1�E��>3���)1�����K���
+Çl�����ۙ�d0Vݺ�P�R<k�T����iRkn�;�ܳ�|�4t�`��"�M ���mw�p�e=�n��Z<�)w�@WȔ.�)
w�{B��D�a;����}2/��4e���=LTܦWOm���Q�3:(i�Ț����Z���cX41�%�qń�>2q
�Lc9���l�
j��]��a��
�R��1{Z��3�^����h>��cᬦ}'��ͨ9�S7�7��O�T�VB�w�c}^c�>Z	��$�4���C?)
�1��=&����1B�U���s$�o��
+-�r�¹a�#��O��(�(�e���)�5�I� Z����)��X�}F��İ<���|A�#��3򅱶ɹ����5�4�,�Q6��
+η�$�\���"&��
L!pY�A�t9�<�}䋔A� I�i�I:/F��A��PK
+�L�>��U�l)org/antlr/runtime/tree/TreeRewriter.class�W�wU�^�f�t([AQ��RH']7h�
+��R��&�t ���I+�"ZW��w�-j[��x�I����Q�7����!���{s�}�]�˟����񋂑�1t`4Ɲ�()S��"��Ř+�haa�"��%�H*')Wy�1,DŽ\< ��R烵؂�<,��p��1<.�O(8&�'�p\�S
+���A�Y�I��Є�\<�sx^�1lFZ���h�	�x�/���^�k
+^W���7�#Y�P�Z���d�\��	�̍��ʍ�Θ�]q�_l�L���9`1�
�1�1�������-7�t8y�5nj��.���r;Szֵy��rS���EAյ�){�:T����oL8�k8%/e�ۮk�峇F�,�#;L�t��%^NM��2|�-�tQ״�״���ذ�Ї3�Y�k'�̠�r�o��Q��j�'!V�V6�
+l���@����I;m������
Ww
���$Z*����l��>+I��x�a}\���V�c��a#�
��P��/�tc�Z���g���;�@��JD�H���[ �x�I#+	��� �5��R?��Y����:�9J��@�D�3J)#�Ē��
+l
+pC�q��a��2h��B�(z�/ղe��L�n�w�����=b�uL�Τ�bR�1�S~�R}<ЮX1�[3_����N��cJ�//͕v���*�P��-9�Qq%�bMV��[ ��Vщ�
+��P�]
+N�x�؆�*���*��5*n�M��P�c�����ڕ>Pqv��������^�� T|��U|
]�)_�+w�fie�b/nVq;�h�p>��.h��ץ}_W��-*���
+�S�=~X}.��,�J�ʏ�<��2�TLᴊ�;tC[w���qZ����
+4U�D`C�~��e|p^��e������U!Y���\�ԥ
��۲-����֓,��7J.�۷��`^yp��-:�1HY�yR��R�������5ƍ#��]؎׸##:{H��3_.���e���׸?�g؈V5��^3��F�&����oą]9�e�8�s
�+d��ê�iw��"�bd�x*�H�������\�p�EG����|�D��(W3���€���\e�En��<�
|�^�v5²E�
+ˎ��졐?vao���Q�¯E7���M�*�K����,�f:͍*\�1�}lc?o�NR��؅O��a�J���<A�!�۴D�,�Zh��"C�,�iԐ�J:6�Z-q���<��$�����x"|w����6�[�g+M��C�P8��h��HR�5�I�&\�&�=G
��?P-�4��i,#�|H�K�X1��$W��rNKgP��g���V��E}Z�Km�Dub�<�'���;�%�f�f��������o]��K{5r�JL�%�>�[p��Ox�1<��t�������:��w#����1���Q�z��~�a8N�����=W��n��B�w�[��l��I�C��I�F��e��]���]͹9ܽ�$���'ք=;��)�C�k½����-�ݭ\��>�я�T�@�M(���
+����4!5!5���(u�	�����uq-3R�ɺs�G<����U��_�Tt���9�VƵ˘�sX?4��ƆY4�͡I&���p�gvso���=�!�Q��h�!l�}E��xr�hVܫ�*J��NJ�(����C�7��+�/2Z�?b�6Q<q-g�	޻�F��dcL����fɘ%��^DԎ{}D������>��魞��K,�츧M-|��
{]G0w��(��
+)o�`��������R����sSa�PK
+�L�>��_�C�(org/antlr/runtime/tree/TreeAdaptor.class�T�r�0]��Bh�r�P�q���:��K��g:%�xS���XF����|� �JTn?��g�쮤_���-xb�#(y�@���Ccq�g����g�;����:����
z�C��d����a�/��9J�lF�m�Y9g����BU=!�:�����C�q(B�z��s
+�a��K_1���@�����0�	4
&��}�{�	O'���5xa���˙�i�
�Z��}~��}U��%��o��t��	���e�efM�b2KKV��-�'�JG�UC-ܼ������Cj��rJ�G"e�r&OW]>C����N����e�Oy�)����S_�\Yc��'(n����x�%z-O���{QN�H��d�$5#���Q�mYY���w)G5N��#;-���;_��D�;t��V�L�
+4U{,��	#y���O�x;7'�~���Ւ�[J���K�@���ɷ�$�CI����U�)<u�gaA�",)lh�s���W�ª��/(���.�e�W��k���:�P�7����5n@S�
-�w���޿��lj�m���x[p_fN������?PK
+�L�>#e6	�,org/antlr/runtime/tree/BaseTreeAdaptor.class�W]tTW���d���B�2@�d���XC�m�H
+3 	`���m20�7��
��V[[�����*��T�6�%1D�J���>��>�Z>�A���yR�}���$�$�ɗ3�g�|{���{��_z���F�B;s�L�
#�υ��*�������exD�/��e�32<&��!|�O��_���dxR����<�gd�
�}SfgE�[!<[���X�蝓�y^��Cx1��x �o�;!�F+.��]��^/�0�+��9�������g{"5��v��ԉTg��d;��E�^P�I+M
Z���[2f�ު���z@C`�D5c��Ȁ��K
d�S��Le�rY��
{8���
u�L;���L;3bt
+���T�����tjԶrD�73Y
�-��l���3p��yXe�rV.��.e��:f��4��R��:�gZC�?c�w�4Fe��$�`�-�V/��y;��dSY L\޶X!�(����(nϓ�m��ŧ3� 瓒톖kj=$գ�T�D��ta�O�/�]J����T
g�i
a�8�[pk�s4�3L�≻mj�L����
��Jj���c�eў�t�:ː�M;����8[U.�rL�Wϑ����^+o��Y�F>�1��圲��4�Z�ӋMT� If�UGKOY[��-g}��R���5�d5�6��";d7�)m:`���<rť<=��2l^I��U����%$zT��չ��@-�^�2�T`�t�VI7�а�d��yO���Ri�F�Fְ
W�z��6� �#��t�gL�A+Fs�	Y/+2�c�Ɛ!��'G�O.:J�|�T���{�Bn�ؑ�oH���D� б	�ѱ��1�ﳎ��z�����yn���xM�n$u\DB�8��������S���ֱ_��1){�doJÊ���s,{
ZÖ+gD���L#*e���Qiі�=��tEGRnj�1���Tnp��VA�C�0)`~�����𺎬� ��H݇O�8�K�tO��-'{�J��hX���
v��i���U�����D(|:,\�Q�'��'�M|M�<v���|<��#1}VL&?��l�?E�|��TZÒ�\װv��yz���ĝ�����8��V��O���o��6Nq�����z��ዖ��O�k�G{Jݹ�լ�Z��-�y^W&ֹ�5�g�)��
���t���6e�	�cƴ��&���V`
_���	_��&�
i�]�}v	�����ñ	h��E�^�ʇ���wtq�
�#��������ŵr�k�"���?�Y�P��E�������>��
+�.�B��-���@�+���6Ԡ[��(��dv+O55��2>5�ƙ_Ͷ��Q��|AJ�D��^`�|��
+*&�paN;��FG��Ɲ��s�M1���B"��1�s3qg���g(Td(�z�p+��l{Am,�6��d�]~�������eU�9��l6���X[Cp5]��
+�Uv�b�M�q�>�����3x6��>z�%����وa%���ȟ��q�i�0�?DdU���f,�"��i{9�%��A�+(��Ȓ�ݥ"ORs}�,I/g~ziC5<�'Í�e�d�mWQ��%R��*�f�Y����14`Da�:���F�{��+=�e���%�CR\t�Lv�X�"���s����n�,j�����!y˸q�SX�_W?��ˤ��W��D8>Ą<��i����Q����c�q}�}�О�X�kX'�	/��ℒ`1$� |����z7�tD%�#Ϻ����dW�
릸
+�)Tj��X�`S�	0�&��C�7���3�zTq|��ϡϣ/0�/"����^�-|���^�$�D�ſK�Y��r��PZ�#1ᴟ�^>��Zd6♍01��<�&F��5�U��=/F�M�x�$V� ���\uJn��&Q�Kd̔�s�=ˑfq453T��ۼCB<��z>õ�0NJ�c���h�BȵrKW�)0�f�b�e�t��y����j�#Z�dT�����*����U5=�|
+��L_}��V�����ܲ��~��8�.�]����|�+�>JW+~���>ʛZ���چ��2
w��'��񎭝.q�SX�_����sl���7�ڒ�I������0���^�q���7"t���ڻ0���•��΅��2f�lD5l1[�	��aJ�k��v�:?�	~Of���~�z�k=�y��Q_�S������E�?U�ZK���;���E]�K�^�
o�&6����p7�N�$Z|����\+y�b��۪Φ�ڿj���q0�σ�]|\����4�?�����/����}�;?��3柄���,>��F���8����O0��&s�ܓ��!/�O)���/PK
+�L�>�Us|��3org/antlr/runtime/tree/RewriteRuleTokenStream.class�T�O�P=o���)�o�JEdccTQP��Y 
$��'�v�^�?K#Q�����%����{��{�y�����O_�Ʋ�4�����Ѝ���.z�pG����T�S0�`�!�l9�XaX̕]��0a{��;ªsCx�{dVkfC�^�|h�6
�t�]�Y�Aiz�!�ȭq�����-�^�ޞY�餯�VM{��,�����d0����o<K��2�W�!"n�K��`���D�m^�x̛U�j�u��?������?u�]9�U�Cs�R���0l��/,�([͐M�nI5�m����Gb+��@n:N#��1r�⓿K"�A�����0��)Lw��5�AE�u}���-9#��!��i\�eiF�ɤq��g�Jc�
+���%�쉈�N�o4\O��v�{����*��$K����d�^ᴰm^�_��n�B��P�A7)^h�i�Ϗ�F�WF�s����'�ZQ�$A�,�MZذ؎��qܠ?�4�O
�
 �C�
t�C����1�;Z&�KV�7p)L�
+��0}�`�/"WC�h	;��!I�l��v�"e���0����p�W�F1F��!����0O`��k
�u�G�䑾��$�����T�#�޶�-@) 
+S"2���S��#�nF�s�^J�O�R���)I����f����,�B{��)
�օ��1�'�ma��ee��곾�ch_۰����ZXZ�Ő�PK
+�L�>S�N�,
2;org/antlr/runtime/tree/TreeWizard$WildcardTreePattern.class�QMK�@�kb�j4Պ���4^�C��� -�i�,��nd��_y<��Q�K�P)���f�
����;�C��1�5��Die[���Nfn"�mj"3�V
eg�R7w��R;K$!�(-��þ4�觌��l Ү0*����U#B���d L)/���hB�Lkiک�$����̏rQO=�|k�O��=��4	a����e66y��`�����xU�0�N8�W
+��l��215f���q�uyj1�puw�^A/�9��-���]������"���APh�Q�n!�}�b
�PK
+�L�>��Oc��2org/antlr/runtime/tree/RewriteRuleNodeStream.class���O�@Ɵc�DAŊ��
+~�b00!.#
$�'s�N<ҵ����Y������Q���:q� �&o�w�}��޷����gK�m#�k&L(ڰQ�0�C��X�a�b���Đy }�W��s��=��ײ%\��pw(<j��ru�����=w[+��-��2�W��`�J_��V]�^�hf�4��˕4��dZ���ʟ���k%��
+=Q#.��Zf�x���ߤJ��-��5�i(��2�MJ����?���f}_4tT;��zl��_�a��/�PKϭ�N�MNI%�]�U_�ZԞ��\�\2:0��R���ۑ�@3l�Q��P5�ci;շsC�#�S&L�0��uL�qcn�qC��S��ہҢ����έ4D��Y;
��S4�<�t^��O�N'�5N�N�1��˓���1��Ԙa����GL���/���p��5W�T��iz��݀U�_8{K��)��
+$/b�FN,��F˔� f4�s�6؉��4�@����H�r+�ˍ��X��f��l�5��$�0��a���9�=��\�.a:qp�iT���H���3�����	:��T�x�CRp�����I��!b�\7��j��Ә��V(3��?�z6�=�З����e�	��j���PK
+�L�>������%org/antlr/runtime/tree/BaseTree.class�X{pT���}d7��	X��B$�M�(�ᑀI!�� ��M���Mw7<����ڢ�[�
j����I#�@[т��֩ckkk����δ�i��s�ݻK�d��s�������;9��k����]X�=�p�7��}�q��aǃ<�����ub��xD�?*�������|<&j�)��}��8��W���|<#����~'�s��.��y��#W^�����|�$?��Cv��.��'^��W��U'�{ЅYxDR�ȉ!9�G\��o���
:�����9��1�8;�#�pB�	�o����KE��-�dj�@΅�X$�P�ZQ�V��k�Z"1mE_O��h�G9S��E׆�mL�Rݑ����x��6KE���X*ңզ�V�Jjm�_1�"P�1�]zFB�ӥ���J�is�Y�E��f
wz�2DAE�HSxIrQ$����ER�m;z)�HIM�0/ͥ)N,e4�v��aC"��
r�ѥ�N/+�Š��J�-�0-�L��M�h>��ܑXRK�wq�b
źjW�o�:t�#��7�E��f��JK�B��%�j$��z��-�Ȥ��1���16�b�XX��_����i�7+��5�
+�7K:��d*ޛ=1^�ĺ.�ok
�vL4����iGL�fX������\�=a���ґ�B)S%�.F�+"Q��+J:Z�[��
+� �$Έ��_6��
+��;;�9�g"_�Ql��O��r;����-c�~�lQ�ec�4�{z�1#�szBV�v�K��m���\ҭ2�L�8[z�&3���PrI�C��ih@{J���EO���
eƞT|M*A�ꮜX���
+q��}��G,5�uvj	8� ����MݡĪx2���c�1}ޙp���%:��"��奫V�d��B,��B48�S~������`��j��,eуo�Ƙ�Qb�N�l{��+e��C���ӛ��~��J-��*g"���2���M���MX���Hy��r��Ճ5X��̠43��B�%���z.����N��T���j�W��'%�	��S��=p����P4^�����c��j+K_��-I$B;ZÅ��eҮ��ك��s��}�{pn�!GȾ&����h�@�����K�zB���~m{/���{�6~)�0d����r�N���u҅��i��f�.������N�r�{܆��U�"7���j�~J0���k��.Yhdx맓�bd~��`e�[M�h��U��٣���	�'��p9��^-F���p����h��M^|�y4b�i�U�tvB��ßM&.��i3��\̯s�|���9�`	�.��7U��#�N�&,�[2Xf0h��2�s�`�bP���"\����M��T�W`9����=��S��C�x6��~�Dʇ��y��:���B+7��q)�+��h����a��&���
+S��Im�{��AvN�)�~��qIZ��Cȡ������N����]���BD���j

3��u�j4|PNIV�\V�9O�"՛o�7��X;	��JYބ�z���0۵2JV��_��t�������-��ž�z��U��h
��w�6�,_A��E��/p
�}4����$��B,��ټ���X$������?|�!x,X���g��nJo!߂�6�x?��Wa	`\?���u�9^��J��Ԅ`�
d�������@�_�ބ	��+��h�N�R��McE���E=�d��.⬕I<����x�����#,�'q�2�B�p#/1m����ߨ�i#�e��#�S�gO)��T�q�圅�u����uF�YJ����Ue/P=�Bq�f-",p+���XvK8��;�`���t���`+3E*�z��W�*C��I-o��a��^��E��tt��l�U�Ey8X�ܚ�3@��ݔ�NJt7cu]t/��}��=��� ��iV��u	L9���#��4��t�.q�!�O��v8-�ϊ@��d)P6~N<ɴ8@!�����>�G��
+�F�巤�j�Yϊ��Zh0St7�35�cj>O���^�B�j"O5�'�:d��N��ʟ��]�#�^)�^))�6�٪���9����Q���!e�����t�mS��U#'*�����k���u���}Xj�s׹����sx]F0:�=���yt��<2}��i��%v�����7�q�����u�_Y���d�ҷsG��,�:7IJЫ \ʦ��ϕY��Agh;C��k��&9z��1M'wKr�A�Q�?(Ϣ��#��,�3P��5�1��r%;�s�+6�-:�$k�)����wX\�e
y�����b���1���x���[�����#���q�G���3���	������������D)�e�L�w1���|_�/�Z�S��1��.��`�Bnʱ��,g��cG�������K���:�*jX��M� �\e�����n=-8��Մ#� VL�XDe�[%�b9�~���ɲ�er��cqm�=��+ĸꤽ��B��)a�
��\sU�N���6�8�2�ds�'o���qXZ����w�N��3i�O��9
�i���?��>_eq����j%d����o(^XZ"��t��m>[���>�^$wZvʠL�m ��	<ŠBaC����ߕ�h���N_���/����m�10H}�Gv�T���i��:���p�=��[M5t��ұ\�(+�T�E�Jʊ`@�����z
"�H��x�	(�!
+1�s��k�Z�ܓQ-u�e�Zc�Zc�Zi���u������|��������u���f�I9��mҮ*�3��`��#����(�@�jU윤�gr<��A�-�g����!U��I��rl�KS�MTI�kS֜[og�$?�U�_���N�Z1
�?6��`���rl3y�,íb�٩l����f�L�iʘ�,�es����%v�Bˁ��ym<[���Q�z3t�yd�-�5Y��0l��V�����bX]sG�ɼ܌	^7�J�Rs3�c�h4.5��8��~�FX�,~�&�|�b(�Ӽyl3����Vv+�Z�'��W��!c���φ_3Dm����yb1|b	+ESVK1ӄ�i@[��t�t�Yow��\���1
+oK�T�*��P�}Q��H��K)�rL-�]��"V����,�
+s��,���M�	�K���ȴd��v#��FK|�~�g���रu���j�s�T���Z'S�N
��0]�ZW�}��>�ZW�8\y�xH��~C��*�WL���Y��X(��
x%��*��Q#60'7b�؄6B�hG��@�а�s7�.�f7v��f��Θћ����t�~�a,?��;x3���o���Q�a�7ؙ��&���������PK
+�L�>���0�
+org/antlr/runtime/tree/TreeRewriter$2.class�R�N1=N�lv�-B��-@�Pߊ�Q�Ҷ��٘İؑ���WT* ���GU/Q��Z���x�x.����7��{p�����X�{\,�Xb����;k�ҽ0�&աJ#�yh4���~�����wx-M��yOHa>34��؛�N[u9�d$$�><�p}wRBj�J��8���#б�1�!�*%��4�2N�F������6R����q�Ʋ����Э����Jf.V�>TC��/�r�ǃm[6%�/�TeB��q�W]�
\T�hXC�zY(7���	Q'�POFSa���s�
OT�&CU�/�a�@h�r�N�5j�U�K�s&������vv�H|�����G�s��uֺG�g���gxE:��>&)����e#�e節_`w(�<�c��?K��e����0�c��Ij�9x\B�+�?PK
+�L�>+��(�5	)org/antlr/runtime/tree/TreeIterator.class�TKoU��=�8ΤM�$�$-i�3njh)�Lӄ�	I�<��B;�o�I�3����XT��n@
+R�*T
R*�X�aϒ=p���6����s������_���{/㖊sq�q��8��::
2��d�ɰ����uc���FX��m�c1�3�`��L���$�)��̰x�ɬ�kq�b@Ŝ�wT\P��QpmG�k�vӆ�杴S�\sE�]G���
�꤀�ض+�]6V�tް����2벎��L��NQ
1'*H��o[ai/D,;'�5r���lz�(��K�$)j��i������I{g(� E�=jZr��2/�)c>/��5�3�c�\*�I����܌+ï�?�<}�
,�Ȣ�f��,�KFqL��2�E�<�)�[��т�H��l6i��Mk1c��55CzG�ثTO|�.9Y9lrq{������?h���VU�����qXC;i�B��t
+�?kXt����W�T���=�Аd���>��Ƈ5�rԛ�����,r$4,�O�i�kX��a9��J��b�P�W��\�i[CkYY��@�s�Z�d�iU���k����gO��u��R�{���AN�
�d��F�yi��R4?��:�@�;�d�s�v��^s�ɮ��&��8\˦Vư��>�vR0ا�25]˸���!zp���bPxC�ISx?<�pZ�'��d�{=�	�(�Aѣ$
!���ĵ��"�-]��&��oB�IzC������8��BB~C���G�Pte=���~d*����T�
��HB�BCإ���݁Ш�B�=����	hU��g�g���<�$�zx�<��>�2��{�;1��_ʼn��'�>l�
b�
�7��"A運� C��&r�d��$x
��?�R���TEކ�܇���oc����KD�R#��,l�9�Up�B9F[���8-��Lm�R�o���
�������D���Os�չ��^H��&^���B������Ӿu��;�?QE��s��~���V�ػ��U�hj�*7/���d1���
+]�w#{��hU����)�����	j�
Z��.�V��Qn��������Y��5}�>������'�~k��ޡ��.n�,l���>����(�7��w��d�'>a|$�X�'�M�����S�,��#��8Oyv���ǂ��=B+}km?�1G��;U+/����?PK
+�L�>�@i}�
C!'org/antlr/runtime/tree/TreeWizard.class�Z|S��N^7MS[(
#�G)P���EP,"(�JWp@h/%�&5MyM's�6'����SPlŪ�N���N�s�����n�M��sonҒҔ���ɹ��������/}�ԳƋ<�n
ix�;��e�Ӱ'S�O.��pyDãx$�T��p��<����x<�\��c��y2��N
O{0{r1���g�rX���9I���o{0/h8���R�|G./jxɃ�����{R���y�ey�C
?�?�'?��L���L����5��,���K�?�W���xS��R>�%�_I��5����k�>?�H���No�$bq
��hT�W5�[[�V
�(��45ԇ�
iWrӞ4�V@[i�����	�V�&�u	�o�I
%sb���p4�/��E�f�<A^�ijL蟈]�G���zM�f}�>7�"�?guxM��-i*�
ɦ�KMKȲD�,1Y�H�%�emdu/�hD?�_S8�X�L&ǜ�룉Uz"R/�:7�$�	�)�F뱋U�]j���m�+�xMxEO�ωՇ����l:�"�#O��0��M�J�n.�:UfuqI�3&�h���AE3L�=��WkniK0�d!�H%�O�#J��k�9	���_31ۨ',��H�cY��*<,L��M�6�}�H�A_������b�^�Ƞ�HtU�$��e&��|2�Y��0%È�[oқ�h�.+H#�i����XI��2�=��+�(�٪`ԃ.=E�d��$���ڶB�5�����=�d03�n��Ny�����K�,.�W���NX:���3%i,x9/���$G�of$ޚP	ޣ���쾸��U�Yfe��9]��B��&Ya'�����Ғ�[�T����&�YL�gIQ��'OQbSx��D|:βE}��\L7���t���3�$C�Kך�f��7�fP˥<9!��(`K��U�Dy��	���f�V��ma�K�CVq��kb�~K�V��eI5\Fo�V�2X�lݶu4�����Xbf�-�p�z�%�E�x�qa�-^�ό�N��r�8�@���v
+��IuL��WD�x,��<����'/fa��/��r���Xkn��Of�G-;j
+	�­��T��&����=/���z�7�����W�I�?��qH�Z��S����zy��?�//�������{�.���'^|�2�Y�y�?=�䄆�bܧ<����z��
+�����q�Bؼ���g��8u}�y}��>��ç;�S⃬\:�
+����t�pdui�����Vl��f|�+\��+4�K�&<^lgtE.�� ���.����`�=�
o��V�Q|l������}m	L�nI�:�27fA{��9rԯ
+�ɒJ/85�Ⱶr\�RsR��JgKy]�4�r��u^�:Tv-�vε�����ݑhbQ���0��mq��~���ssR���

=�e����*ق�X郞;�����]�}Δ��8�����L��H��n@i�i.�ZiR�^l�m ��4Ssҳr�)�����n������������)
s�U���M�7�x�C�a}/v
�u\���1Uc#{>3�d�N�L�4v8dO��!�:ݲ-@��� ��a>�K�46�<���'���
��F^���rp�i�A�\��y�,�x.2y֑F�̷xBO��bܟ,�M\�&��t�b>ܸf1�7�˝4Ŧ�Ԛb>OjI_��#'��k�n��/���4Q���BKT!>�,����.$��;/�	O]r��x��8bܘ�<�y�b)���d�N�*:�G���
�3�_�V|v��&V:B~G'��:Pp���b�?{;�ߒ\��_�z+�o�'�A�a0�!��Dܡ4�����G�-�+
+xo�+TXZV�Z�y3lz{�M}fP�ᦪ�}r<��6A���1����}�}�vg�������s��л�Z���OB��A1�� ].t�T4b���"3�I��8 �`���?�&���Q�V++ݦ�9�2�>I�nd4h�F}6L��X��;�������U���0b�w�߆Z��6Lv�'�|.�s��S���Q����e�K�7�J�
�S���
+#щR<�	x�0M8”8Jc�C�s�<�\}A������f���ň2�2(-�l4"w�C
+Ho�c$���B���+y�$e�fH"�*��o��:҉!u���chY�ؼH�^b|_V��˖*~K�R�F�~D^�J�mf�\*z����N�u`x%�eD���4-拑(�t���u�+]~�1��]����o�c{��O"X�8�'�)��ס�Z ��:QV�hӸ�6�&��W�˫,,�a^G9�`��L�����
+5�l]cٺ��*[�X�l��<X����(ڻ���I�1���ڹ������P��_�a�H��R��K��%�fɷ���ܮ����r3��K��\���'�!e�(�^;?�'?I�Dz�Ir��z���r����a���2d4j�e�ϱ����P�8��N�e��>Y�i>�.�٨����|�9$rʷh��7R
+(���!Nl �&��g
+
U��/e��T��-@�㘻Q<�jYkY�빳��
f��U�;�NNY,�W�L�n��L�~�$]�����fɭԌ�p3-ܝ����TbLdb�\��B�#�H�q:.C�@�1+�p�c-�Pe�k-W�5�$wF�=t��E,LF^��(c���M,`3ħ2�M>��4r.��Y�'�i�$A��ie�gѶ�i[%m;��i9��Q��TX�T(�-
˖A�-y�-H�Uܢr�f����P���C�)�Tn�i�鶴p[Z�M-����d��A���		`R*�Hڡ���;�7�LVo�j���͗�Ca�1��}�h�iY� y�d���s*vF�t����-2�#���ȸ%��24J�j�/;RΨ�Q
���0-�h���P#1+�K�,�b�X���r\'¸^�c�h�N�c�X�шC<;,V[0�ɶ�u�I��Ak#z��G-��f���
+�M���礹M����߷�=��iy�9�0�9|�Di( �A�V��Qr�Hf5�
+���*	�M��'��j�
+��%��l��Qг�v	���+m�`b=�s����4�i�d��ݦ��e/��)�`9�d�	��E�nM��n���ݪD�2Q<��2�6�⠁�
S�;�G��#�X
( N%
Y�s�Ht��E�
+|N��P0�e���F�
:	�W�@8������],�f`�a�؁Ib���0C܏���#v�2����q���ڸ�x�I<bՕ�8]���i5���0�ǩ �D�-�o������r�j&3p����rw�6�j�#P���?�v�CG��Ê��l]��7���p/gz��x
�C��)_�p�����9�`��{
��
0��1�ZMŅ��l*.r導���	���PK
+�L�>��4�l�3org/antlr/runtime/tree/BufferedTreeNodeStream.class�W	x\�u��hi�$ْ-Y��my�G2"�
�`����D��$5c��[������4�M�Y\�����J��d�����`YHh֦Mۤm�tKC�sߛ���	H�o���{���9�=缯����
�/#x2
+�xW�)mND��%�}A�/j�6�D�lQ<����R��up�����b|E�_U9_��J�u����������o��kڜ��7�y]�oi��R|�UQo������M����~��hP�
��6?��'�4���[����.��1^����ϵ�m�Q��I{�(�/�����_�����J�{1~���C�������+������7Q�/~�[ADDPޕ�؉����Id��ՖJٙ־��=(�]�fm���
[�:�6���o]�q��5�o�j�^#�6AYk:5�M���}Cv��+��-omio�ڵ���Z�E���`o�攠�}WbO��/���ܹm�ݓ])
���vA(��UӜuC�d_s{rPW3�tVΦw�).�Ӟ��h&��Lsf(�M���t�я;"��ĀQq��Z��6-�*n�9�J�4dw$�$w$��t��A#��c�6ʮOdv۔�I��qr�����`Os[*ے�$�Qp��d*�]��6��MT��'	*ړ)�c���ِ��g���<gS"�Ա�2�ݙ���Si�zh�v;c��v��g��N.mx7��G�����M7OW3$}���	&�=�� tY�gg�������T��=���agU��T��w
+s�����)c������T�A�f�
pI%�8E�Rۖ��}E�&;��u(��Sٮ}���7�a�-�y_�\�ӕ������w$��½tV2��{�u���4�{'Ηl���W��D���%wa��se�y�;�+~衳v&7�_8ҀWneO� �Э""=�DCj�@{��Wz?��+j�p��}vb�K�����t���7��
���
������7��x�Q*�2��>�����I/jV�fbT.��"{�/�c�*�I�����_��@BiE1����Ⓗ|0��1=�6��@;�!�mC����s���ݔ�P����K��
��g���tn�%>��h�'�b��#�2\%��To�8���f''
+owԹ5k�c�Q�<�'h�������t*��z��f�6}>�߳��-܀.���U�6!]S�.���M�L�Wun�H��"	Z�]d���,l�^њε6��z-	I8"K�%lI	�X�GI�R]@0��.��?�pj�V�ݢ�㶈X���ݖ������F�|H!%�������ú�^n�r���N�d��*�Ɛ
+�a2ʟ{�s-�&ӵ��0B�Jf�pfD�-��Y����1ؽ�ɇ'W�UQ�i�&��$F!j�si��&��,�+�"Ro�|Y X�;�ˠ_�p�·�t�[��9"���pq���v6�}�K(9ء��7
2��O.��D&C'��8Қ�PS���퓹�ή{۬¸�)Ť�P0�`��0E�b�ab`������F)s������R+i�g��R��S�:�<�t��ڴLQzH�gO2�|7d�^����Q_���9;lR��u��gX��)�syd�ez�}g�g"�w�p��n����/���g�T�&���:~ܵ��h�z�;��@'���ߋ��U��U�s��d6��1##�ی�͓Q�<ot��|.�=�eks�E<
(���l9�@�q=n l�O3�!X�0v�W�,�N$͑e�EbD�vE^ˣ�3�$��4��8���nA1�Ј��,�ĕ��Tp��s?I�A>�����"�"oEq�q��@tK�q��Š7�*��Q^�QT�Õ����xc���TM`��Q����3(g"��~�b�Y���=LG�pջ�`�;X<���v���i�"�d�s���h���O�x3T���rc���4�,g�{�h^u�����|�PXI�8fp���,�������3Vݽ�Vh���g�@�Y038��"��k99cP�����>����(ŝ��]8�)y!��W�!\����~�������}��|��6��"�6�h���7�Dj�ϔ=4����$���
+YהC��*7gt�2j	!�pN��U�q0�>���g�cvKAh���
��fਧN=m
|�������X�ch���.Ę��E�pE��B�LH��e�e�k���qa�p���C��BGPO�uw�J͞���a,渂�9y�9��u1��׫6M�[��4G�ݳD�����e��
+.�KX����Jޭ��0w��k�	��vo�1��Uǚ|#+����H
q_��Ќ��ŋ�c2��xrCк�b���!D�����؍�^Ϸ��T鄕�,@���.�AD��4��J���~�:��W�������c�r�~�A�Az�{u����L�6o�wUî��V��n��s�����{��:**P�+!�$��Q!!L�H�y�y���f3�%CM
^)���Bkmw�E��(�1w��*�$D=	��}��/�\�{���w�*�wa
��9Djh�Yyv{v�|���
RR$������B sd�@�� �Y�$|��|_ w0�1�YL 
Sъ@�s/i(��n��7NJG�a���K�C�4����`~������B���c~��^�����Z��;�X�����͂Q,仅G�.'ڋ��R̐yhk=���ef/�=^��<|��&�A_�S#�j��u�=��yNâB���S��©9 �xN��5T��}�]C�\���t�t��r��c>�蠴N����I�灬�@V�J�Þ�.=�S��S�TN����Q�
�C��N �
قJy������:�;t�w轞��u�RN.C�eF~l�Y&yI5�E��>�,fn��|�3y��M��QF.>ɨiNj*�!I��BTv�h}�%)_~��!_�P]�~M,T�&*��K�yR�=��AW������/��nai}^AJ����B?�'t�'�!w��~*HQ�x�U����jYV6�PP��G��>JO�7"/r�y��#���ް[bU�3&hiO� ����U�Me�P1Y��I���O��yac�c�ps��]j��.�l
+�ӍcXVPJ�m������X>���I�'��29��8�F���DJ�N��z�:��UqK��g
����t�xݭ�}��i���ƅ3���R}��;�YZꨣ/KjC�X��\����/.���N�s����D�܃K������x����0�gL�^���n��������z�n<f����FG%�	`t��8“8�K*/�
+r%�t*W�n|+�F��\�+/�f��b�.�N��8�Bc�bQ.���l2��8j�-�ҙmbOk��ƶ�5�¯!���^���'�GL��Eff��w��J��5�k��ש��*ˆt8�.�5��#<��7\�V�&-iz��W����׆OaAN}u�K��ZG�
+Ն�锜/m��c.�e5M%K�����c�+a�<�k;�s�38W>��r��(��1t�v�1�$O`���V�
�ay
+G�xJ��������|	g��H^�/�$~%��k�#_���$���R-/K����򊬓o�u�t��*ߔm�-IɷeP�#��7�|�pu;3ݭ��9f��
~m^�*��
+z��a�^���=��3��U�;��^vxΚ��ar���"W��,��q�ͮ�/��q
��PK
+�L�>R�
�8
+,org/antlr/runtime/tree/CommonErrorNode.class�V�SU�n��BS�"`C+B mE[ `�66�Z~(��K���d7�l
+8�#yҩ}�Δt��}���
g�G8���d�,0N&�{�w��ν����~��U�0��V����np�E�ŧ,�KHJXlER,H�L��h�C?�$,KX	�<��X��:�%kk~��������&�n<��c?�
PhE†�d�J��#�ǖM¶@��J�@_�0�1E�rf�,閖Wc	�Z�LU�O�h)&�]p�Ǝ��[���@�e*�����K�K3t����C5mdu�
u$��52�|��d���:���Ype1�J��U�=��j���P�ee#G�`�H+�U��x^5z�-��^'�UcsF>OL�0S��tFuB��)���@Sxx]@ʪ��~A���\ݣc�'���J,������,���K@A'-m(t��-��KF�L�W�y����Î�&eL�BX�0"2FXD1*p���N-]F�C΂�='��2	��SV�k-�,��xI�э]�zk��qQ+�z�Ǒ��:�U���Mդƈ���E'2�Q�&S/�zA�p�85Ec�}�j�x��8���Q*rH%����GC�Z����2�8jĵ��b���^`�յ�ŋ�!	�2�l�2V������C���{5M�'C�3q�ۂU�n�/�*�9W�n��m���5�g�=~^��h�+�H�6���냍m�9�hqu��g����F���Q�5�}/{�.��� �W�;X�=tuO~S�.E�����^8zX�.@?�>�o���0i���=�TG��46�6�ɫ4{Y���+��?�;zAm��4m����h*2ro$z����
|�n�
�_�كk$/�/"(����C\�GD�cJz�q�>4�NBB��6DHakL�ckL���8�u�"8��42���s=�϶����Z� �e;��'�Ъ����KcQ$#/���2�X�wj�4���8oڏ蠉�5ZpVx��w��&$�#�D���q����8g#|���ȋ:��D�C�y�Ѕ��mP�J�O2I�E�"Kx���Q�1C�!��OH��-VK��n��3[+Z���7�-q�ޠ����p~���t��5:*x����E�T���]Ƶ��:����
+z�}l��}��]*c�����D��N��8]9۩��e��׃��
XC��6��
��4�kel�'d������z���Q��PK
+�L�>�%ܴ�U.org/antlr/runtime/tree/TreePatternParser.class�V�SU���zf�$dX@�
G�
��=7MH����H�[3408t���@��^ֻk�%F�/����l�>�*�|�g_,��}[�;��0S��U������]��u��~`>����pL��Q�1,��Q�a8�[�9<"�G�x���Q�F4d��b3��a<���rQL�I
�0�����a:�8�QÍ�����L6f���yZ�*����3������"���i�N��@{�vƻ
��;�N�rsSf��f� �
�uM�J����G 躧�M
�+�ɝ6�Q����1�ģ�1jL�6�M�����e�F��n\��K�q�_�/�S`kz�8it�
k��G����S�;a��,�ޛ�r�~�Bb�yo ����>$�GY�-�ef�S#�3h��)�����2��\��
w"WHn �
�)�i�˥؞h/+F�Ȥ�u��T�j{�iiF���Bq�U�`v"�g��m��J/��dY�
�T�6��X%�A�6��Y�*�ײLG5�d��뗹���yc�̯N����=��S���,��8�J�2�A�3�[kʹWA�o�����=b��óYs��ٖ��%=j��y$'Z��c]Ҏ�t��;�3+p�J�VJ��1O�qlG�mxQ�KxYG�:R��хn
���^ՑD���أ� fӊ�����y[�΃����H��ix]�x�e��p搎��wt��
+�X��{jʶ�]��Y
�	ܱ~�����
+6۪H���u��%���k�@LJ�H�+�<��:>���S�\�v�}�r�Ur�%�wUG���lO�o�����Hl��
+�V�Iް
+D�b�َ�kBrJD2Z�Q,P�*���c�H&Y���@�)�N,^�R�u��v_N��THX��=��%�2�Z�"��I�׽a�߃ű1E~��w�ϵ=A%-^��Do�|Z���@s����z�Dm�a��D��*ʸ��q�Ը��ۣ��Ֆ_�c�)�X-�j$����%�1\t�(��$]��h�/D�q�HJ�, 9D��.�M��;,��(}~�q;�;����z@sr	�d��dj
�d�"ɎEDP�%�}��cB۔�}n��m�y=�ŝ�gw��YE&�L��S3�����S��K$�BM`�����Eh۹ؔ�������Z�hO渉�1�&f�J�q�t+#���S�	:�b��'Q�QH�������*���t��c[�P�m�"ͫ�����b��׬��@�_�.ߵ��*�S/���"ґ���~\��4ӗZ6���<\v�pޱ��C��q3ߏ��`��q�#��
�	bi��(����(�q�1�3�}	��6�qǯ�p5���}<������\(լ�g�:
+����{��4V�_�^��p��j^��l���m����%�
+)�Y&���a�~	�뻊���3�!�I�6u�Ws�Wv<�a��IV�
+v̧2bw@���+�v����S����`]��r�ꂝWp��C���1����@�5l��~���/��B�|�1�o�e���
�pKch����Z�q��@�-�����M0ٴ16a�P�`�&�v����=��	����4N���e<ſ�38�էx�������HH|C���
+~���o�#��O������?EΊ�/z��H�#�GH	�e1�!���%�K��>LA��"<{�w��z�3?��#T{	�	�>�J��VW6D��[O}I�]Ē_Ç��?���*����
����R�w��@�$0�+ �1^�^�=b��R�qGԞ�b�0�j��"�PK
+�L�>�^*"��(org/antlr/runtime/tree/TreeVisitor.class�T�O�P�ݮk�V�S&���u�"* �k֐�,`�,��2�(�V�u�^�+|41�j�4���(��n J����s����=�������qqt@mC;22�8"P�d�a4�1�\���1���|㑌�2&ds���]�a��zݬ���{��oW-��,K_�����3H�v���FԫdJ��n[ɢ]�V�-�[7��tݲ�L��z�(�;v�:%�n7�DT�!��
��⮹o�Y��[�V��_
�P�m��Ϝ&���ls�!�� �Uo8�=�^��Wj�a6����,�A��(�]_�B�d��p^�Z�y�:�x�qj
+�У �N���[���3��A�2�bZ�3�+�Ŝ�y,(H㖂E<���:Q��R��+�L`*�{�͋Os�^4{�f8(���7x���/`@����c�e9<V?
RÂBR�˲��}ܣ��Aw�t�Q�"$S�h�F�z��v�e?A�H���v�/0D��h�R��hz��&H��=-�� �h_�8�x��T)�S4���Bc|H������v�B�C0���d�$r����I1%��c����x��f�Z:�������YNKi��Zƴt����"{���l�2d?�Ҟ ��h	L�i�Ҁ�"O�,�ak4�X@��U��W0�#��1����E��y�$IdO�6I2�����t`:�ia�u}Ay0@Qe��r
�x��PK
+�L�>�Q��
/org/antlr/runtime/tree/TreeWizard$Visitor.class�RMO1}N�]�l	����M�!����!EB����F�'k�#�y��W\Z�?��o"P	R��ϼy3c���������.D�|�1�'�Pji������H�PnI-~�]aڼ�(��J{\u���<	z�LfAGfҦ�!jj-LC�,��m��4��*���r bk���d~�Kn��Im�a�ܹ�V���Xq}���E�֧#�qhd����a�MϬt�J[���a�L���qA�&e�
+�����cX{f�%���LO�Hw��U�:vA�2*
>3l����vc؛]�H��Ae�i�:Sëҧ�@/@�HH+���SL��v��]�S@�������,`��nK��?�v����_�CB��s��1k��e��>V�+��k��p�[�x��T�57r����MD^�T7Q�K�PK
+�L�>K�_q�
Q)org/antlr/runtime/tree/TreeFilter$1.class�Tmo�0~ܔ���m��w�XW�M| �iHH�}�ԯS���Sj�
�_�4@�?��8���F��Q����s�������6�y(��a�'��j[.*.�]TJf(�J�a��� ��It�siĈ�Fs�x#��.�wx*͐S�!�y�P�-[�2�T�3,w����Q�루����Qq�t#-�zj,Zj`�J��^e'����*;D�I5�;�>Ea�Ax�;�٭�ob`���QLUF{���ul�3��ղ!dٗq�2!����G
j�����D+@�v������a�<%�ڜ��ȄQ�ul����N��g��k�jE�sjVF����Cj���T��b=���49=�1���l�"Y>K=e����Fu�Xl�w�ҵ�Lo�v��+�á7�����z�������WZ�L�D>���8��>Vq���a}��O�a�qִ��w�_�
�c�����j7p��nͅ�4��\H���wp��"���ie��0������PK
+�L�>��9� �+org/antlr/runtime/tree/TreeRewriter$1.class�T�n1=nB�Y6$��ܡд��i)�!�R�����E�f�&�6���P�@*E���4�(^yv<�9s<��_��PǓ,,��ǽ,��Kb�j%��8Xu��̐1]���+
�;~ M�}ݗF��o4��
�=~���z�!�?��ˍ)����<c(�g��4�;���
!��~���AЊ�Rl�0���v=2�-=0x���z'
+���em���
"��5
���������w[�<4ە�M�X*6ұJh��W}�W��[�;ۺ
����a�!;o�骶���*j\\���Q���M����Mj�Lb(�s��O	m�D���F(ɰ<Cjl[��~Le�P���*��zF�6��(6��c*���3����;�q4ؕ!����cM��k)cT�������x����`zA�I�%����zfim��U�)�9\�u��-�����7��w�}��
+$3�|�Io���u��/���!Z�B��f�)RgH��8�Y<��X���>Í��ΐG�41��C�[�M�4�_��2iE�98�d�3�?PK
+�L�>� ���
org/antlr/runtime/DFA.class�Vkl�����w3y�Κ$��qxx�v�m^&��S�81�5ޝl&^Ϻ����mq[h- �4
�RS�H&	i�H���V U��o����߽3^;��ɏ���s�=���|������
܅?őĮy؍=14ao��>9�R7"����Iɒ�~9��p@v�tIJ�0C
c18(�a\�ϥ7W��XO.�58�aL��Q��x\ l=����s��蓢9!5�Yk�Fzi���fA S�=�H��<� ǽ[�c#�+ �i�Z�bޱ������Ϙ�Wp3n���1+��,Y�+6k"9k����G�����Cf�l���Yg;��ð��!
����؎�G�a���(f���r(5�]��J&���2�>�Z9;��6�V1�w�Aϵ̱�)�.Rr�	�
.���1���G�"�3^�vrNGLj�tGy���7OH��bI�/�9�!�o��nm�;'��s�dՒ�:�F"n�n��i��32N��;�ņ�&I��-o�Uʺ��hqkj�y��L'�����Z}�7����,�����z�mJRP����!�Ǻ�`]�Z���3=����GK��;�;yżc���n�ZY����b��Z[lI��j��3��w�x��=x�����@?�3ЇM��/
�
+w�Mn�O�-����i�f��,�4�tL�
~��w�A�������
+h�0�*�݅��	�e?9S��Q&��HTm�E37`�%ۥJ蠯e�Jh��9ȡ������a�ɱ*���lz�
Q#���^_K���='�C��LU��� +*�LS��4eߏ�%|	���^��&kά;�P�������CtY���w�B��{=��}�F�A�84IJ�䆚�5/�����L6���W3��y)����u�2��L�r\IM���I�q\���U�:9�
�Э���Ǵ��� �ĨJ��DH`}�'=�p��[KhGОNhm'��$C��!��	wGښN"B"r��t�7/}�S5�.�u$|�2#�$b!��ID�Ov���J���<������\Ww4}.�'����z�c��y��!�c�he{�Υ���a9���2���`�i_�c��g����Қ36�v!+܍mjƔ�O��E\ԫ9)nQz� au�Mб��C-;�
?#Gv�C,Ճ�����0���E��
+��6�a��G�ݟË�q�x��o�����8ʘ��i~A��>ţ8������/_�o�����Ɇ�E�����I�{��sX���$�Za`
%�q��Zf�4	($���!�t��LS�cL4c�0zw6r��S
�ӫ�y%1_4��)Խ���B{��?���'����M[�'���L�e�!����/�+�W�!G�
UwH����$3J���h-��2+�����ԥb��NzKh�7+
�r&��E7p%?�B�cW�������V|�*I��$gR�� H�#h�p�ҷ�p||V���1܏��Q1�����ׅ�7�eo��1�t���M�Bo^���T��pOX6������~w���OJQ�[O��QԵ''�"}ihR<<���g�3i���pu�i}ț�b�ΐ���gI�0���OH�I�����L]e�׈��Z��QR,]'[e�"c���R��5�N�~/�Ce��m%Q��������Ɛ��!6��@�g.h"�C�jhjhv*d�WȜ�
+�/�:Od�$2����3�Hd��[������|�{��/��TE&QA���̒
+2�+�� ����znQ���><�f��PK
+�L�>�X�i�,org/antlr/runtime/NoViableAltException.class�S[O�P��^�R����MQ�e���E�M�$��P���f��t�������D_�Q�9g�Tb��|��7ӯ3�?�|0�������@&�)H3%�tV3h�k�'�l���$��p_Â�4<�����i,���0X	�Z�ֹ�6\�[�
'p� Cv��ֶ��W��D�z�E��rH�l��x��J�
a~z�Zr=W,3č�C��9C��녔m{��e}߱�;v��sx�n������e{�XA�n�[���b�VųC�+��h޸��T��/y��ܮ-JYI׫7�ȥLM���}F>�%�-�8��+�D���Y:�0,�9\�q:���1��:�v����k��}��\��	�x�c���4&Vvb��:�b��?2O��D�����A$�w�
+�
��G����\Rv�ν2C!b����M����K�ֹ#xy�]����2���
�Fq���~��`rf������͕��,�|�<
�L �dS�r7��mF�8T��0���I�9s q��9y��9|��9r���j9Ś��tb
+=�&���>߮V�H�f
+I�1����B�yHP�6"T�8��k!��(|����L�f���d���qr�n2-�|:%����٫��O�R2f��=��{֠	�6~
PK
+�L�>META-INF/maven/PK
+�L�>META-INF/maven/org.antlr/PK
+�L�>'META-INF/maven/org.antlr/antlr-runtime/PK
+���>�}���4.META-INF/maven/org.antlr/antlr-runtime/pom.xml�V]o�6}����F���(j�R8k�8k�
+��$�������l�V7���������KE�7�@+�
W�b<œ1b�����b|���1~��R�%�
[��qnmy�Y1�IIhΰ�Yx��&<�g�3�7�o����O=o6�L�o7�;8X��Kc��N~n<8W�Xԋ��S�����1�8!*a�:�����H�VUy��`i���r�D[�ja�w]I���G�`~�Ԍ�l얰����е̙��Z��]���A1�iT���sNsd�U����M�К!��'D�Pkϲ
+��t�J&�.g�tL����/���X3ic�(���QG����6�Ƨ�,
+W�Ýߑ[KR��ҙC�E_Z}=�	3T��5I|	���Z�(UQ-�+jAj�U��?��	�%�_���DA�Ҧ�>;t%u<g�.��OdEN����{�����G�C	 W��Q�
�[iw����h��V����P%D�B]p�y�+�`�e�h݊�c������}�����4��35�2)%�%U���.��\`.b(��:��p���`��m����;sF�Q|��g�
+|�Ђ�١C5��5r
�SI�z����jW�p�ϗ�/�u"�˥Y��T��+-4�_��L�1���v?�VK^�g�d�2ܸ
�������]�����-wG
-���mM���#�a��q���+�q������8�t��M���
�m�]��SF#�1Wl�|o�g���O{��o
+���,uA��V�~x�Fމ}8��e(�N�3��;���}���`=T\4>!��T����������i���������NJ�gK�P5}8��'x6�xۛ)�*=0MjqT�)���-(S�H��b�K���|7����#x���֡����rR\���}�R.��*3A��/w�z�Z��
+�eec����:ğ=�����C2���C;�=ߛa�G�]��(l:��)�G�
PK
+�L�>� Ǒfi5META-INF/maven/org.antlr/antlr-runtime/pom.propertiesSvO�K-J,IMQH�T�M,K��R)MU�*�Q0�T0��26�2�Pp	Q0204�*K-*��ϳ5�3�J/�/-�L��/J�K�+�)�J,*�LKL.

+�t�J�J2sS�PK

+�L�>	�AMETA-INF/PK

+�L�>aS��f}��'META-INF/MANIFEST.MFPK

+�L�>�A�org/PK

+�L�>
+�A�org/antlr/PK

+�L�>�A	
org/antlr/runtime/PK

+�L�>�A9
org/antlr/runtime/misc/PK

+�L�>�An
org/antlr/runtime/debug/PK

+�L�>�A�
org/antlr/runtime/tree/PK

+�L�>	y�3��%���
org/antlr/runtime/misc/IntArray.classPK

+�L�>*�e�S,���org/antlr/runtime/misc/LookaheadStream.classPK

+�L�>��F �
"��3org/antlr/runtime/misc/Stats.classPK

+�L�>��*.��	&���org/antlr/runtime/misc/FastQueue.classPK

+�L�>��E���)��borg/antlr/runtime/misc/DoubleKeyMap.classPK

+�L�>�R^]�;��gorg/antlr/runtime/TokenRewriteStream$RewriteOperation.classPK

+�L�>�^+�H�)�� org/antlr/runtime/ANTLRReaderStream.classPK

+�L�>@�
v�
1���#org/antlr/runtime/MismatchedNotSetException.classPK

+�L�>�Q�{M/���%org/antlr/runtime/SerializedGrammar$Block.classPK

+�L�>��;�Tv���(org/antlr/runtime/Token.classPK

+�L�>n��'Q
�-��!+org/antlr/runtime/ParserRuleReturnScope.classPK

+�L�>�
+C�����,org/antlr/runtime/Parser.classPK

+�L�>�7~9��2org/antlr/runtime/TokenRewriteStream$InsertBeforeOp.classPK

+�L�>~X����	)���4org/antlr/runtime/CommonTokenStream.classPK

+�L�>�r��0��:org/antlr/runtime/MismatchedTokenException.classPK

+�L�>6p&��E
!��[<org/antlr/runtime/IntStream.classPK

+�L�>xݴ��
#��{=org/antlr/runtime/TokenStream.classPK

+�L�>�	��3���>org/antlr/runtime/MismatchedTreeNodeException.classPK

+�L�>��5!
^'���@org/antlr/runtime/RuleReturnScope.classPK

+�L�>�7�
+�+��ZBorg/antlr/runtime/BufferedTokenStream.classPK

+�L�>���M$���Lorg/antlr/runtime/ClassicToken.classPK

+�L�>�= PA-��Rorg/antlr/runtime/RecognizerSharedState.classPK

+�L�>�UC4���Uorg/antlr/runtime/TokenRewriteStream$ReplaceOp.classPK

+�L�>��y��/���Xorg/antlr/runtime/LegacyCommonTokenStream.classPK

+�L�>	���{
"��Xeorg/antlr/runtime/CharStream.classPK

+�L�>q���W.���forg/antlr/runtime/SerializedGrammar$Rule.classPK

+�L�>�z��-&
+)���horg/antlr/runtime/debug/DebugParser.classPK

+�L�>[��t20��^morg/antlr/runtime/debug/DebugEventRepeater.classPK

+�L�>��|�A�
+G�� sorg/antlr/runtime/debug/RemoteDebugEventSocketListener$ProxyToken.classPK

+�L�>�����	�.���worg/antlr/runtime/debug/DebugTreeAdaptor.classPK

+�L�>��9��-����org/antlr/runtime/debug/DebugTreeParser.classPK

+�L�>!(UI��F����org/antlr/runtime/debug/RemoteDebugEventSocketListener$ProxyTree.classPK

+�L�>�-���-<����org/antlr/runtime/debug/RemoteDebugEventSocketListener.classPK

+�L�>%����
5���org/antlr/runtime/debug/TraceDebugEventListener.classPK

+�L�>I[�-1��ۦorg/antlr/runtime/debug/DebugTreeNodeStream.classPK

+�L�>4@1�3��:�org/antlr/runtime/debug/Profiler$ProfileStats.classPK

+�L�>�*�R45��6�org/antlr/runtime/debug/BlankDebugEventListener.classPK

+�L�>���;;@$����org/antlr/runtime/debug/Tracer.classPK

+�L�>��/�a0���org/antlr/runtime/debug/DebugEventListener.classPK

+�L�>�ccD|9*3��ʺorg/antlr/runtime/debug/DebugEventSocketProxy.classPK

+�L�>�y�sj�+����org/antlr/runtime/debug/DebugEventHub.classPK

+�L�>s���
�9��J�org/antlr/runtime/debug/Profiler$DecisionDescriptor.classPK

+�L�>�KmG|�.��-�org/antlr/runtime/debug/ParseTreeBuilder.classPK

+�L�>2�Z��=&����org/antlr/runtime/debug/Profiler.classPK

+�L�>�W��d
.��&�org/antlr/runtime/debug/DebugTokenStream.classPK

+�L�>+�X�
4���org/antlr/runtime/debug/Profiler$DecisionEvent.classPK

+�L�>��Lmq(���
org/antlr/runtime/ANTLRInputStream.classPK

+�L�>�r��'���
org/antlr/runtime/ANTLRFileStream.classPK

+�L�>�j�WI
)��	
org/antlr/runtime/ANTLRStringStream.classPK

+�L�>*��n~�#���

org/antlr/runtime/CommonToken.classPK

+�L�>x�>]k.��f
org/antlr/runtime/UnwantedTokenException.classPK

+�L�>A�D)0��
org/antlr/runtime/MismatchedRangeException.classPK

+�L�>���).���
org/antlr/runtime/MismatchedSetException.classPK

+�L�>G�W�
�2���
org/antlr/runtime/SerializedGrammar$TokenRef.classPK

+�L�>J���n
'���
org/antlr/runtime/CharStreamState.classPK

+�L�>O8�(��0*�� 
org/antlr/runtime/TokenRewriteStream.classPK

+�L�>��>�
�1��T4
org/antlr/runtime/SerializedGrammar$RuleRef.classPK

+�L�>f%�	�)��E6
org/antlr/runtime/SerializedGrammar.classPK

+�L�>63m�R#6&���?
org/antlr/runtime/BaseRecognizer.classPK

+�L�>����
�0��(X
org/antlr/runtime/FailedPredicateException.classPK

+�L�>`�g�K
P*��tZ
org/antlr/runtime/EarlyExitException.classPK

+�L�>�V�����\
org/antlr/runtime/Lexer.classPK

+�L�>�c��	-��;i
org/antlr/runtime/UnbufferedTokenStream.classPK

+�L�>$����#���m
org/antlr/runtime/TokenSource.classPK

+�L�>�ݽf�
+,���n
org/antlr/runtime/RecognitionException.classPK

+�L�>�iX��3t
org/antlr/runtime/BitSet.classPK

+�L�>�Є|9-���
org/antlr/runtime/MissingTokenException.classPK

+�L�>zO��B����
org/antlr/runtime/tree/BufferedTreeNodeStream$StreamIterator.classPK

+�L�>�&���.����
org/antlr/runtime/tree/TreeVisitorAction.classPK

+�L�>��O�		D-��h�
org/antlr/runtime/tree/DOTTreeGenerator.classPK

+�L�>3u��o'����
org/antlr/runtime/tree/TreeFilter.classPK

+�L�>^�x��)��p�
org/antlr/runtime/tree/TreeWizard$2.classPK

+�L�>޸8;
\+��A�
org/antlr/runtime/tree/TreeNodeStream.classPK

+�L�>p�W
G8��Ř
org/antlr/runtime/tree/RewriteCardinalityException.classPK

+�L�>jN��5��r�
org/antlr/runtime/tree/RewriteRuleSubtreeStream.classPK

+�L�>��Mf�&
,��̝
org/antlr/runtime/tree/TreeFilter$fptr.classPK

+�L�>���j�4
'��ٞ
org/antlr/runtime/tree/CommonTree.classPK

+�L�>���T�=
.���
org/antlr/runtime/tree/TreeRewriter$fptr.classPK

+�L�>�g���'���
org/antlr/runtime/tree/TreeParser.classPK

+�L�>}ϙ
�
0��#�
org/antlr/runtime/tree/TreeRuleReturnScope.classPK

+�L�>O����,
6����
org/antlr/runtime/tree/TreeWizard$ContextVisitor.classPK

+�L�>�/-
6����
org/antlr/runtime/tree/RewriteEarlyExitException.classPK

+�L�>1�n&
�
8���
org/antlr/runtime/tree/RewriteEmptyStreamException.classPK

+�L�>y{�~�
.��|�
org/antlr/runtime/tree/CommonTreeAdaptor.classPK

+�L�>{�-��м
org/antlr/runtime/tree/TreePatternLexer.classPK

+�L�>q�R�
+5��,�
org/antlr/runtime/tree/RewriteRuleElementStream.classPK

+�L�>��d��s1����
org/antlr/runtime/tree/CommonTreeNodeStream.classPK

+�L�>p[�I	&����
org/antlr/runtime/tree/ParseTree.classPK

+�L�>�`���
�)��O�
org/antlr/runtime/tree/TreeWizard$1.classPK

+�L�>�b�(r!��r�
org/antlr/runtime/tree/Tree.classPK

+�L�>F�8qr
�>��#�
org/antlr/runtime/tree/TreeWizard$TreePatternTreeAdaptor.classPK

+�L�>
�ת
+����
org/antlr/runtime/tree/TreeRewriter$3.classPK

+�L�>���V�
\3����
org/antlr/runtime/tree/TreeWizard$TreePattern.classPK

+�L�>ؤ�~�
�)���
org/antlr/runtime/tree/TreeFilter$3.classPK

+�L�>�g규
�)���
org/antlr/runtime/tree/TreeFilter$2.classPK

+�L�>�r�F�2)����
org/antlr/runtime/tree/TreeWizard$3.classPK

+�L�>��U�l)����
org/antlr/runtime/tree/TreeRewriter.classPK

+�L�>��_�C�(��	�
org/antlr/runtime/tree/TreeAdaptor.classPK

+�L�>#e6	�,����
org/antlr/runtime/tree/BaseTreeAdaptor.classPK

+�L�>�Us|��3���
org/antlr/runtime/tree/RewriteRuleTokenStream.classPK

+�L�>S�N�,
2;��.�
org/antlr/runtime/tree/TreeWizard$WildcardTreePattern.classPK

+�L�>��Oc��2����
org/antlr/runtime/tree/RewriteRuleNodeStream.classPK

+�L�>������%����
org/antlr/runtime/tree/BaseTree.classPK

+�L�>���0�
+���org/antlr/runtime/tree/TreeRewriter$2.classPK

+�L�>+��(�5	)���org/antlr/runtime/tree/TreeIterator.classPK

+�L�>�@i}�
C!'���org/antlr/runtime/tree/TreeWizard.classPK

+�L�>��4�l�3��}!org/antlr/runtime/tree/BufferedTreeNodeStream.classPK

+�L�>R�
�8
+,��:0org/antlr/runtime/tree/CommonErrorNode.classPK

+�L�>�%ܴ�U.��,5org/antlr/runtime/tree/TreePatternParser.classPK

+�L�>�^*"��(��l<org/antlr/runtime/tree/TreeVisitor.classPK

+�L�>�Q��
/��y?org/antlr/runtime/tree/TreeWizard$Visitor.classPK

+�L�>K�_q�
Q)��lAorg/antlr/runtime/tree/TreeFilter$1.classPK

+�L�>��9� �+���Corg/antlr/runtime/tree/TreeRewriter$1.classPK

+�L�>� ���
��Forg/antlr/runtime/DFA.classPK

+�L�>�X�i�,��/Morg/antlr/runtime/NoViableAltException.classPK

+�L�>��PMETA-INF/maven/PK

+�L�>��4PMETA-INF/maven/org.antlr/PK

+�L�>'��kPMETA-INF/maven/org.antlr/antlr-runtime/PK

+���>�}���4.
$��PMETA-INF/maven/org.antlr/antlr-runtime/pom.xmlPK

+�L�>� Ǒfi5���TMETA-INF/maven/org.antlr/antlr-runtime/pom.propertiesPK��[,�U
\ No newline at end of file

Property changes on: lucene/queryparser/lib/antlr-runtime-3.4.jar
___________________________________________________________________
Added: svn:mime-type
   + application/octet-stream

Index: lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpSLGMultiField.java
===================================================================
--- lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpSLGMultiField.java	(revision 0)
+++ lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpSLGMultiField.java	(revision 0)
@@ -0,0 +1,392 @@
+package org.apache.lucene.queryparser.flexible.aqp;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.io.Reader;
+import java.io.StringReader;
+import java.util.HashMap;
+import java.util.Map;
+
+import org.apache.lucene.analysis.Analyzer;
+import org.apache.lucene.analysis.MockAnalyzer;
+import org.apache.lucene.analysis.standard.StandardAnalyzer;
+import org.apache.lucene.document.Document;
+import org.apache.lucene.document.TextField;
+import org.apache.lucene.index.DirectoryReader;
+import org.apache.lucene.index.IndexWriter;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.standard.QueryParserUtil;
+import org.apache.lucene.queryparser.flexible.standard.TestQPHelper;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler.Operator;
+import org.apache.lucene.queryparser.flexible.aqp.AqpQueryParser;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpQueryParserUtil;
+import org.apache.lucene.search.BooleanClause;
+import org.apache.lucene.search.IndexSearcher;
+import org.apache.lucene.search.Query;
+import org.apache.lucene.search.ScoreDoc;
+import org.apache.lucene.search.BooleanClause.Occur;
+import org.apache.lucene.store.Directory;
+import org.apache.lucene.store.RAMDirectory;
+import org.apache.lucene.util.IOUtils;
+
+/**
+ * This test case is a copy of the core Lucene query parser test, it was adapted
+ * to use new QueryParserHelper instead of the old query parser.
+ * 
+ * Tests QueryParser.
+ */
+public class TestAqpSLGMultiField extends AqpTestAbstractCase {
+
+  /**
+   * test stop words parsing for both the non static form, and for the
+   * corresponding static form (qtxt, fields[]).
+   */
+  public void testStopwordsParsing() throws Exception {
+    assertStopQueryEquals("one", "b:one t:one");
+    assertStopQueryEquals("one stop", "b:one t:one");
+    assertStopQueryEquals("one (stop)", "b:one t:one");
+    assertStopQueryEquals("one ((stop))", "b:one t:one");
+    assertStopQueryEquals("stop", "");
+    assertStopQueryEquals("(stop)", "");
+    assertStopQueryEquals("((stop))", "");
+  }
+
+  // verify parsing of query using a stopping analyzer
+  private void assertStopQueryEquals(String qtxt, String expectedRes)
+      throws Exception {
+    String[] fields = { "b", "t" };
+    Occur occur[] = { Occur.SHOULD, Occur.SHOULD };
+    TestQPHelper.QPTestAnalyzer a = new TestQPHelper.QPTestAnalyzer();
+    AqpQueryParser mfqp = getParser();
+    mfqp.setMultiFields(fields);
+    mfqp.setAnalyzer(a);
+
+    Query q = mfqp.parse(qtxt, null);
+    assertEquals(expectedRes, q.toString());
+
+    q = QueryParserUtil.parse(qtxt, fields, occur, a);
+    assertEquals(expectedRes, q.toString());
+  }
+
+  public void testSimple() throws Exception {
+    String[] fields = { "b", "t" };
+    AqpQueryParser mfqp = getParser();
+    mfqp.setMultiFields(fields);
+    mfqp.setAnalyzer(new StandardAnalyzer(TEST_VERSION_CURRENT));
+
+    Query q = mfqp.parse("one", null);
+    assertEquals("b:one t:one", q.toString());
+
+    q = mfqp.parse("one two", null);
+    assertEquals("(b:one t:one) (b:two t:two)", q.toString());
+
+    q = mfqp.parse("+one +two", null);
+    assertEquals("+(b:one t:one) +(b:two t:two)", q.toString());
+
+    q = mfqp.parse("+one -two -three", null);
+    assertEquals("+(b:one t:one) -(b:two t:two) -(b:three t:three)",
+        q.toString());
+
+    q = mfqp.parse("one^2 two", null);
+    assertEquals("((b:one t:one)^2.0) (b:two t:two)", q.toString());
+
+    mfqp.setAllowSlowFuzzy(true);
+    q = mfqp.parse("one~ two", null);
+    assertEquals("(b:one~0.5 t:one~0.5) (b:two t:two)", q.toString());
+
+    q = mfqp.parse("one~0.8 two^2", null);
+    assertEquals("(b:one~0.8 t:one~0.8) ((b:two t:two)^2.0)", q.toString());
+
+    q = mfqp.parse("one* two*", null);
+    assertEquals("(b:one* t:one*) (b:two* t:two*)", q.toString());
+
+    q = mfqp.parse("[a TO c] two", null);
+    assertEquals("(b:[a TO c] t:[a TO c]) (b:two t:two)", q.toString());
+
+    q = mfqp.parse("w?ldcard", null);
+    assertEquals("b:w?ldcard t:w?ldcard", q.toString());
+
+    q = mfqp.parse("\"foo bar\"", null);
+    assertEquals("b:\"foo bar\" t:\"foo bar\"", q.toString());
+
+    q = mfqp.parse("\"aa bb cc\" \"dd ee\"", null);
+    assertEquals("(b:\"aa bb cc\" t:\"aa bb cc\") (b:\"dd ee\" t:\"dd ee\")",
+        q.toString());
+
+    q = mfqp.parse("\"foo bar\"~4", null);
+    assertEquals("b:\"foo bar\"~4 t:\"foo bar\"~4", q.toString());
+
+    // LUCENE-1213: QueryParser was ignoring slop when phrase
+    // had a field.
+    q = mfqp.parse("b:\"foo bar\"~4", null);
+    assertEquals("b:\"foo bar\"~4", q.toString());
+
+    // make sure that terms which have a field are not touched:
+    q = mfqp.parse("one f:two", null);
+    assertEquals("(b:one t:one) f:two", q.toString());
+
+    // AND mode:
+    mfqp.setDefaultOperator(Operator.AND);
+    q = mfqp.parse("one two", null);
+    assertEquals("+(b:one t:one) +(b:two t:two)", q.toString());
+    q = mfqp.parse("\"aa bb cc\" \"dd ee\"", null);
+    assertEquals("+(b:\"aa bb cc\" t:\"aa bb cc\") +(b:\"dd ee\" t:\"dd ee\")",
+        q.toString());
+
+  }
+
+  public void testBoostsSimple() throws Exception {
+    Map<String, Float> boosts = new HashMap<String, Float>();
+    boosts.put("b", Float.valueOf(5));
+    boosts.put("t", Float.valueOf(10));
+    String[] fields = { "b", "t" };
+    AqpQueryParser mfqp = getParser();
+    mfqp.setMultiFields(fields);
+    mfqp.setFieldsBoost(boosts);
+    mfqp.setAnalyzer(new StandardAnalyzer(TEST_VERSION_CURRENT));
+
+    // Check for simple
+    Query q = mfqp.parse("one", null);
+    assertEquals("b:one^5.0 t:one^10.0", q.toString());
+
+    // Check for AND
+    q = mfqp.parse("one AND two", null);
+    assertEquals("+(b:one^5.0 t:one^10.0) +(b:two^5.0 t:two^10.0)",
+        q.toString());
+
+    // Check for OR
+    q = mfqp.parse("one OR two", null);
+    assertEquals("(b:one^5.0 t:one^10.0) (b:two^5.0 t:two^10.0)", q.toString());
+
+    // Check for AND and a field
+    q = mfqp.parse("one AND two AND foo:test", null);
+    assertEquals("+(b:one^5.0 t:one^10.0) +(b:two^5.0 t:two^10.0) +foo:test",
+        q.toString());
+
+    q = mfqp.parse("one^3 AND two^4", null);
+    assertEquals("+((b:one^5.0 t:one^10.0)^3.0) +((b:two^5.0 t:two^10.0)^4.0)",
+        q.toString());
+  }
+
+  public void testStaticMethod1() throws Exception {
+    String[] fields = { "b", "t" };
+    String[] queries = { "one", "two" };
+    AqpQueryParser qp = getParser();
+    qp.setAnalyzer(new StandardAnalyzer(TEST_VERSION_CURRENT));
+    Query q = AqpQueryParserUtil.parse(qp, queries, fields);
+    assertEquals("b:one t:two", q.toString());
+
+    String[] queries2 = { "+one", "+two" };
+    q = AqpQueryParserUtil.parse(qp, queries2, fields);
+    assertEquals("b:one t:two", q.toString());
+
+    String[] queries3 = { "one", "+two" };
+    q = AqpQueryParserUtil.parse(qp, queries3, fields);
+    assertEquals("b:one t:two", q.toString());
+
+    String[] queries4 = { "one +more", "+two" };
+    q = AqpQueryParserUtil.parse(qp, queries4, fields);
+    assertEquals("(b:one +b:more) t:two", q.toString());
+
+    String[] queries5 = { "blah" };
+    try {
+      q = AqpQueryParserUtil.parse(qp, queries5, fields);
+      fail();
+    } catch (IllegalArgumentException e) {
+      // expected exception, array length differs
+    }
+
+    // check also with stop words for this static form (qtxts[], fields[]).
+    TestQPHelper.QPTestAnalyzer stopA = new TestQPHelper.QPTestAnalyzer();
+    qp.setAnalyzer(stopA);
+
+    String[] queries6 = { "((+stop))", "+((stop))" };
+    q = AqpQueryParserUtil.parse(qp, queries6, fields);
+    assertEquals("", q.toString());
+
+    String[] queries7 = { "one ((+stop)) +more", "+((stop)) +two" };
+    q = AqpQueryParserUtil.parse(qp, queries7, fields);
+    // well, aqp is better in removing the parens from top-level,
+    // so this is the correct result (the AqpQueryUtils has fundamental flaw
+    // anyway)
+    // original was: (b:one +b:more) (+t:two)
+    assertEquals("(b:one +b:more) t:two", q.toString());
+
+  }
+
+  public void testStaticMethod2() throws QueryNodeException {
+    String[] fields = { "b", "t" };
+    BooleanClause.Occur[] flags = { BooleanClause.Occur.MUST,
+        BooleanClause.Occur.MUST_NOT };
+    Query q = QueryParserUtil.parse("one", fields, flags, new StandardAnalyzer(
+        TEST_VERSION_CURRENT));
+    assertEquals("+b:one -t:one", q.toString());
+
+    q = QueryParserUtil.parse("one two", fields, flags, new StandardAnalyzer(
+        TEST_VERSION_CURRENT));
+    assertEquals("+(b:one b:two) -(t:one t:two)", q.toString());
+
+    try {
+      BooleanClause.Occur[] flags2 = { BooleanClause.Occur.MUST };
+      q = QueryParserUtil.parse("blah", fields, flags2, new StandardAnalyzer(
+          TEST_VERSION_CURRENT));
+      fail();
+    } catch (IllegalArgumentException e) {
+      // expected exception, array length differs
+    }
+  }
+
+  public void testStaticMethod2Old() throws Exception {
+    String[] fields = { "b", "t" };
+    BooleanClause.Occur[] flags = { BooleanClause.Occur.MUST,
+        BooleanClause.Occur.MUST_NOT };
+    AqpQueryParser parser = getParser();
+    parser.setMultiFields(fields);
+    parser.setAnalyzer(new StandardAnalyzer(TEST_VERSION_CURRENT));
+
+    Query q = QueryParserUtil.parse("one", fields, flags, new StandardAnalyzer(
+        TEST_VERSION_CURRENT));// , fields, flags, new
+    // StandardAnalyzer());
+    assertEquals("+b:one -t:one", q.toString());
+
+    q = QueryParserUtil.parse("one two", fields, flags, new StandardAnalyzer(
+        TEST_VERSION_CURRENT));
+    assertEquals("+(b:one b:two) -(t:one t:two)", q.toString());
+
+    try {
+      BooleanClause.Occur[] flags2 = { BooleanClause.Occur.MUST };
+      q = QueryParserUtil.parse("blah", fields, flags2, new StandardAnalyzer(
+          TEST_VERSION_CURRENT));
+      fail();
+    } catch (IllegalArgumentException e) {
+      // expected exception, array length differs
+    }
+  }
+
+  public void testStaticMethod3() throws QueryNodeException {
+    String[] queries = { "one", "two", "three" };
+    String[] fields = { "f1", "f2", "f3" };
+    BooleanClause.Occur[] flags = { BooleanClause.Occur.MUST,
+        BooleanClause.Occur.MUST_NOT, BooleanClause.Occur.SHOULD };
+    Query q = QueryParserUtil.parse(queries, fields, flags,
+        new StandardAnalyzer(TEST_VERSION_CURRENT));
+    assertEquals("+f1:one -f2:two f3:three", q.toString());
+
+    try {
+      BooleanClause.Occur[] flags2 = { BooleanClause.Occur.MUST };
+      q = QueryParserUtil.parse(queries, fields, flags2, new StandardAnalyzer(
+          TEST_VERSION_CURRENT));
+      fail();
+    } catch (IllegalArgumentException e) {
+      // expected exception, array length differs
+    }
+  }
+
+  public void testStaticMethod3Old() throws QueryNodeException {
+    String[] queries = { "one", "two" };
+    String[] fields = { "b", "t" };
+    BooleanClause.Occur[] flags = { BooleanClause.Occur.MUST,
+        BooleanClause.Occur.MUST_NOT };
+    Query q = QueryParserUtil.parse(queries, fields, flags,
+        new StandardAnalyzer(TEST_VERSION_CURRENT));
+    assertEquals("+b:one -t:two", q.toString());
+
+    try {
+      BooleanClause.Occur[] flags2 = { BooleanClause.Occur.MUST };
+      q = QueryParserUtil.parse(queries, fields, flags2, new StandardAnalyzer(
+          TEST_VERSION_CURRENT));
+      fail();
+    } catch (IllegalArgumentException e) {
+      // expected exception, array length differs
+    }
+  }
+
+  public void testAnalyzerReturningNull() throws Exception {
+    String[] fields = new String[] { "f1", "f2", "f3" };
+    AqpQueryParser parser = getParser();
+    parser.setMultiFields(fields);
+    parser.setAnalyzer(new AnalyzerReturningNull());
+
+    Query q = parser.parse("bla AND blo", null);
+    assertEquals("+(f2:bla f3:bla) +(f2:blo f3:blo)", q.toString());
+    // the following queries are not affected as their terms are not
+    // analyzed anyway:
+    q = parser.parse("bla*", null);
+    assertEquals("f1:bla* f2:bla* f3:bla*", q.toString());
+    q = parser.parse("bla~", null);
+    assertEquals("f1:bla~1 f2:bla~1 f3:bla~1", q.toString());
+    q = parser.parse("[a TO c]", null);
+    assertEquals("f1:[a TO c] f2:[a TO c] f3:[a TO c]", q.toString());
+  }
+
+  public void testStopWordSearching() throws Exception {
+    Analyzer analyzer = new StandardAnalyzer(TEST_VERSION_CURRENT);
+    Directory ramDir = new RAMDirectory();
+    IndexWriter iw = new IndexWriter(ramDir, newIndexWriterConfig(
+        TEST_VERSION_CURRENT, analyzer));
+    Document doc = new Document();
+    doc.add(newField("body", "blah the footest blah", TextField.TYPE_NOT_STORED));
+    iw.addDocument(doc);
+    iw.close();
+
+    AqpQueryParser mfqp = getParser();
+
+    mfqp.setMultiFields(new String[] { "body" });
+    mfqp.setAnalyzer(analyzer);
+    mfqp.setDefaultOperator(Operator.AND);
+    Query q = mfqp.parse("the footest", null);
+    IndexSearcher is = new IndexSearcher(DirectoryReader.open(ramDir));
+    ScoreDoc[] hits = is.search(q, null, 1000).scoreDocs;
+    assertEquals(1, hits.length);
+    ramDir.close();
+  }
+
+  /**
+   * Return empty tokens for field "f1".
+   */
+  private static class AnalyzerReturningNull extends Analyzer {
+    MockAnalyzer stdAnalyzer = new MockAnalyzer(random());
+
+    public AnalyzerReturningNull() {
+      super(new PerFieldReuseStrategy());
+    }
+
+    @Override
+    protected Reader initReader(String fieldName, Reader reader) {
+      if ("f1".equals(fieldName)) {
+        // we don't use the reader, so close it:
+        IOUtils.closeWhileHandlingException(reader);
+        // return empty reader, so MockTokenizer returns no tokens:
+        return new StringReader("");
+      } else {
+        return super.initReader(fieldName, reader);
+      }
+    }
+
+    @Override
+    public TokenStreamComponents createComponents(String fieldName, Reader reader) {
+      return stdAnalyzer.createComponents(fieldName, reader);
+    }
+  }
+
+  // Uniquely for Junit 3
+  public static junit.framework.Test suite() {
+    return new junit.framework.JUnit4TestAdapter(TestAqpSLGMultiField.class);
+  }
+
+}
Index: lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpSLGStandardTest.java
===================================================================
--- lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpSLGStandardTest.java	(revision 0)
+++ lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpSLGStandardTest.java	(revision 0)
@@ -0,0 +1,1080 @@
+package org.apache.lucene.queryparser.flexible.aqp;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.io.IOException;
+import java.io.Reader;
+import java.text.DateFormat;
+import java.text.ParseException;
+import java.text.SimpleDateFormat;
+import java.util.Calendar;
+import java.util.Date;
+import java.util.GregorianCalendar;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Locale;
+import java.util.Map;
+import java.util.TimeZone;
+
+import org.apache.lucene.analysis.Analyzer;
+import org.apache.lucene.analysis.MockAnalyzer;
+import org.apache.lucene.analysis.MockTokenizer;
+import org.apache.lucene.analysis.TokenFilter;
+import org.apache.lucene.analysis.TokenStream;
+import org.apache.lucene.analysis.Tokenizer;
+import org.apache.lucene.analysis.core.StopAnalyzer;
+import org.apache.lucene.analysis.core.StopFilter;
+import org.apache.lucene.analysis.core.WhitespaceAnalyzer;
+import org.apache.lucene.analysis.standard.StandardAnalyzer;
+import org.apache.lucene.analysis.tokenattributes.CharTermAttribute;
+import org.apache.lucene.analysis.tokenattributes.OffsetAttribute;
+import org.apache.lucene.analysis.tokenattributes.PositionIncrementAttribute;
+import org.apache.lucene.document.DateTools;
+import org.apache.lucene.document.Document;
+import org.apache.lucene.document.TextField;
+import org.apache.lucene.index.DirectoryReader;
+import org.apache.lucene.index.IndexWriter;
+import org.apache.lucene.index.IndexReader;
+import org.apache.lucene.index.Term;
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.builders.QueryTreeBuilder;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.FuzzyQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorPipeline;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler.Operator;
+import org.apache.lucene.queryparser.flexible.standard.nodes.WildcardQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.processors.GroupQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.AqpQueryParser;
+import org.apache.lucene.queryparser.flexible.aqp.AqpSyntaxParser;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardLuceneParser;
+import org.apache.lucene.search.BooleanClause;
+import org.apache.lucene.search.BooleanQuery;
+import org.apache.lucene.search.FuzzyQuery;
+import org.apache.lucene.search.IndexSearcher;
+import org.apache.lucene.search.MatchAllDocsQuery;
+import org.apache.lucene.search.MultiPhraseQuery;
+import org.apache.lucene.search.MultiTermQuery;
+import org.apache.lucene.search.PhraseQuery;
+import org.apache.lucene.search.PrefixQuery;
+import org.apache.lucene.search.Query;
+import org.apache.lucene.search.TermQuery;
+import org.apache.lucene.search.TermRangeQuery;
+import org.apache.lucene.search.WildcardQuery;
+import org.apache.lucene.store.Directory;
+import org.apache.lucene.store.RAMDirectory;
+import org.apache.lucene.util.automaton.BasicAutomata;
+import org.apache.lucene.util.automaton.CharacterRunAutomaton;
+
+/**
+ * This test case is a copy of the core Lucene query parser test, it was adapted
+ * to use new QueryParserHelper instead of the old query parser.
+ * 
+ * TODO: modify the QueryParserHelper so that we can extend it (it is not
+ * flexible in getting the parser, otherwise we could use the test methods there
+ * for most part)
+ * 
+ * Tests QueryParser.
+ */
+public class TestAqpSLGStandardTest extends AqpTestAbstractCase {
+
+  public static Analyzer qpAnalyzer = new QPTestAnalyzer();
+
+  public static final class QPTestFilter extends TokenFilter {
+    private final CharTermAttribute termAtt = addAttribute(CharTermAttribute.class);
+    private final OffsetAttribute offsetAtt = addAttribute(OffsetAttribute.class);
+
+    /**
+     * Filter which discards the token 'stop' and which expands the token
+     * 'phrase' into 'phrase1 phrase2'
+     */
+    public QPTestFilter(TokenStream in) {
+      super(in);
+    }
+
+    boolean inPhrase = false;
+    int savedStart = 0, savedEnd = 0;
+
+    @Override
+    public boolean incrementToken() throws IOException {
+      if (inPhrase) {
+        inPhrase = false;
+        clearAttributes();
+        termAtt.setEmpty().append("phrase2");
+        offsetAtt.setOffset(savedStart, savedEnd);
+        return true;
+      } else
+        while (input.incrementToken()) {
+          if (termAtt.toString().equals("phrase")) {
+            inPhrase = true;
+            savedStart = offsetAtt.startOffset();
+            savedEnd = offsetAtt.endOffset();
+            termAtt.setEmpty().append("phrase1");
+            offsetAtt.setOffset(savedStart, savedEnd);
+            return true;
+          } else if (!termAtt.toString().equals("stop"))
+            return true;
+        }
+      return false;
+    }
+  }
+
+  public static final class QPTestAnalyzer extends Analyzer {
+
+    /** Filters MockTokenizer with StopFilter. */
+    @Override
+    public final TokenStreamComponents createComponents(String fieldName,
+        Reader reader) {
+      Tokenizer tokenizer = new MockTokenizer(reader, MockTokenizer.SIMPLE,
+          true);
+      return new TokenStreamComponents(tokenizer, new QPTestFilter(tokenizer));
+    }
+  }
+
+  public static class QPTestParser extends AqpQueryParser {
+    public QPTestParser(QueryConfigHandler config, AqpSyntaxParser parser,
+        QueryNodeProcessorPipeline processor, QueryTreeBuilder builder) {
+      super(config, parser, processor, builder);
+      // TODO Auto-generated constructor stub
+    }
+
+    public static AqpQueryParser init(Analyzer a) throws Exception {
+      AqpQueryParser p = AqpStandardLuceneParser.init();
+
+      ((QueryNodeProcessorPipeline) p.getQueryNodeProcessor())
+          .add(new QPTestParserQueryNodeProcessor());
+      p.setAnalyzer(a);
+      return p;
+    }
+
+    private static class QPTestParserQueryNodeProcessor extends
+        QueryNodeProcessorImpl {
+
+      @Override
+      protected QueryNode postProcessNode(QueryNode node)
+          throws QueryNodeException {
+
+        return node;
+
+      }
+
+      @Override
+      protected QueryNode preProcessNode(QueryNode node)
+          throws QueryNodeException {
+
+        if (node instanceof WildcardQueryNode || node instanceof FuzzyQueryNode) {
+
+          throw new QueryNodeException(new MessageImpl(
+              QueryParserMessages.EMPTY_MESSAGE));
+
+        }
+
+        return node;
+
+      }
+
+      @Override
+      protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+          throws QueryNodeException {
+
+        return children;
+
+      }
+
+    }
+
+  }
+
+  @Override
+  public void setUp() throws Exception {
+    super.setUp();
+    originalMaxClauses = BooleanQuery.getMaxClauseCount();
+  }
+
+  public void testConstantScoreAutoRewrite() throws Exception {
+    AqpQueryParser qp = getParser();
+    qp.setAnalyzer(new WhitespaceAnalyzer(TEST_VERSION_CURRENT));
+
+    Query q = qp.parse("foo*bar", "field");
+    assertTrue(q instanceof WildcardQuery);
+    assertEquals(MultiTermQuery.CONSTANT_SCORE_AUTO_REWRITE_DEFAULT,
+        ((MultiTermQuery) q).getRewriteMethod());
+
+    q = qp.parse("foo*", "field");
+    assertTrue(q instanceof PrefixQuery);
+    assertEquals(MultiTermQuery.CONSTANT_SCORE_AUTO_REWRITE_DEFAULT,
+        ((MultiTermQuery) q).getRewriteMethod());
+
+    q = qp.parse("[a TO z]", "field");
+    assertTrue(q instanceof TermRangeQuery);
+    assertEquals(MultiTermQuery.CONSTANT_SCORE_AUTO_REWRITE_DEFAULT,
+        ((MultiTermQuery) q).getRewriteMethod());
+  }
+
+  public void testCJK() throws Exception {
+    // Test Ideographic Space - As wide as a CJK character cell (fullwidth)
+    // used google to translate the word "term" to japanese -> ??
+    assertQueryEquals("term\u3000term\u3000term", null,
+        "term\u0020term\u0020term");
+    assertQueryEqualsAllowLeadingWildcard("??\u3000??\u3000??", null,
+        "??\u0020??\u0020??");
+  }
+
+  public void testCJKTerm() throws Exception {
+    // individual CJK chars as terms
+    StandardAnalyzer analyzer = new StandardAnalyzer(TEST_VERSION_CURRENT);
+
+    BooleanQuery expected = new BooleanQuery();
+    expected.add(new TermQuery(new Term("field", "中")),
+        BooleanClause.Occur.SHOULD);
+    expected.add(new TermQuery(new Term("field", "国")),
+        BooleanClause.Occur.SHOULD);
+
+    assertEquals(expected, getQuery("中国", analyzer));
+  }
+
+  public void testCJKBoostedTerm() throws Exception {
+    // individual CJK chars as terms
+    StandardAnalyzer analyzer = new StandardAnalyzer(TEST_VERSION_CURRENT);
+
+    BooleanQuery expected = new BooleanQuery();
+    expected.setBoost(0.5f);
+    expected.add(new TermQuery(new Term("field", "中")),
+        BooleanClause.Occur.SHOULD);
+    expected.add(new TermQuery(new Term("field", "国")),
+        BooleanClause.Occur.SHOULD);
+
+    assertEquals(expected, getQuery("中国^0.5", analyzer));
+  }
+
+  public void testCJKPhrase() throws Exception {
+    // individual CJK chars as terms
+    StandardAnalyzer analyzer = new StandardAnalyzer(TEST_VERSION_CURRENT);
+
+    PhraseQuery expected = new PhraseQuery();
+    expected.add(new Term("field", "中"));
+    expected.add(new Term("field", "国"));
+
+    assertEquals(expected, getQuery("\"中国\"", analyzer));
+  }
+
+  public void testCJKBoostedPhrase() throws Exception {
+    // individual CJK chars as terms
+    StandardAnalyzer analyzer = new StandardAnalyzer(TEST_VERSION_CURRENT);
+
+    PhraseQuery expected = new PhraseQuery();
+    expected.setBoost(0.5f);
+    expected.add(new Term("field", "中"));
+    expected.add(new Term("field", "国"));
+
+    assertEquals(expected, getQuery("\"中国\"^0.5", analyzer));
+  }
+
+  public void testCJKSloppyPhrase() throws Exception {
+    // individual CJK chars as terms
+    StandardAnalyzer analyzer = new StandardAnalyzer(TEST_VERSION_CURRENT);
+
+    PhraseQuery expected = new PhraseQuery();
+    expected.setSlop(3);
+    expected.add(new Term("field", "中"));
+    expected.add(new Term("field", "国"));
+
+    assertEquals(expected, getQuery("\"中国\"~3", analyzer));
+  }
+
+  public void testSimple() throws Exception {
+    assertQueryEquals("\"term germ\"~2", null, "\"term germ\"~2");
+    assertQueryEquals("term term term", null, "term term term");
+    assertQueryEquals("t�rm term term", new WhitespaceAnalyzer(
+        TEST_VERSION_CURRENT), "t�rm term term");
+    assertQueryEquals("�mlaut", new WhitespaceAnalyzer(TEST_VERSION_CURRENT),
+        "�mlaut");
+
+    // XXX: not allowed, TODO???
+    // assertQueryEquals("\"\"", new KeywordAnalyzer(), "");
+    // assertQueryEquals("foo:\"\"", new KeywordAnalyzer(), "foo:");
+
+    assertQueryEquals("a AND b", null, "+a +b");
+    assertQueryEquals("(a AND b)", null, "+a +b");
+    assertQueryEquals("c OR (a AND b)", null, "c (+a +b)");
+
+    assertQueryEquals("a AND NOT b", null, "+a -b");
+    assertQueryEquals("a NOT b", null, "+a -b");
+
+    assertQueryEquals("a AND -b", null, "+a -b");
+
+    assertQueryEquals("a AND !b", null, "+a -b");
+
+    assertQueryEquals("a && b", null, "+a +b");
+
+    assertQueryEquals("a && ! b", null, "+a -b");
+
+    assertQueryEquals("a OR b", null, "a b");
+    assertQueryEquals("a || b", null, "a b");
+
+    assertQueryEquals("a OR !b", null, "a -b");
+
+    assertQueryEquals("a OR ! b", null, "a -b");
+
+    assertQueryEquals("a OR -b", null, "a -b");
+
+    assertQueryEquals("+term -term term", null, "+term -term term");
+    assertQueryEquals("foo:term AND field:anotherTerm", null,
+        "+foo:term +anotherterm");
+    assertQueryEquals("term AND \"phrase phrase\"", null,
+        "+term +\"phrase phrase\"");
+    assertQueryEquals("\"hello there\"", null, "\"hello there\"");
+    assertTrue(getQuery("a AND b", null) instanceof BooleanQuery);
+    assertTrue(getQuery("hello", null) instanceof TermQuery);
+    assertTrue(getQuery("\"hello there\"", null) instanceof PhraseQuery);
+
+    assertQueryEquals("germ term^2.0", null, "germ term^2.0");
+    assertQueryEquals("(term)^2.0", null, "term^2.0");
+    assertQueryEquals("(germ term)^2.0", null, "(germ term)^2.0");
+    assertQueryEquals("term^2.0", null, "term^2.0");
+    assertQueryEquals("term^2", null, "term^2.0");
+    assertQueryEquals("\"germ term\"^2.0", null, "\"germ term\"^2.0");
+    assertQueryEquals("\"term germ\"^2", null, "\"term germ\"^2.0");
+
+    assertQueryEquals("(foo OR bar) AND (baz OR boo)", null,
+        "+(foo bar) +(baz boo)");
+
+    assertQueryEquals("((a OR b) AND NOT c) OR d", null, "(+(a b) -c) d");
+    assertQueryEquals("((a OR b) NOT c) OR d", null, "(+(a b) -c) d");
+
+    assertQueryEquals("+(apple \"steve jobs\") -(foo bar baz)", null,
+        "+(apple \"steve jobs\") -(foo bar baz)");
+    assertQueryEquals("+title:(dog OR cat) -author:\"bob dole\"", null,
+        "+(title:dog title:cat) -author:\"bob dole\"");
+
+    AqpQueryParser qp = getParser();
+    qp.setDefaultOperator(Operator.OR);
+    assertQueryMatch(qp, "title:(+a -b c)", "text", "+title:a -title:b title:c");
+
+    qp.setDefaultOperator(Operator.AND);
+    assertQueryMatch(qp, "title:(+a -b c)", "text",
+        "+title:a -title:b +title:c");
+
+  }
+
+  public void testPunct() throws Exception {
+    Analyzer a = new WhitespaceAnalyzer(TEST_VERSION_CURRENT);
+    assertQueryEquals("a&b", a, "a&b");
+    assertQueryEquals("a&&b", a, "a&&b");
+    assertQueryEquals(".NET", a, ".NET");
+  }
+
+  public void testSlop() throws Exception {
+
+    assertQueryEquals("\"term germ\"~2", null, "\"term germ\"~2");
+    assertQueryEquals("\"term germ\"~2 flork", null, "\"term germ\"~2 flork");
+    assertQueryEquals("\"term\"~2", null, "term");
+    assertQueryEquals("\" \"~2 germ", null, "germ");
+    assertQueryEquals("\"term germ\"~2^2", null, "\"term germ\"~2^2.0");
+  }
+
+  public void testNumber() throws Exception {
+    // The numbers go away because SimpleAnalzyer ignores them
+    assertQueryEquals("3", null, "");
+    assertQueryEquals("term 1.0 1 2", null, "term");
+    assertQueryEquals("term term1 term2", null, "term term term");
+
+    Analyzer a = new StandardAnalyzer(TEST_VERSION_CURRENT);
+    assertQueryEquals("3", a, "3");
+    assertQueryEquals("term 1.0 1 2", a, "term 1.0 1 2");
+    assertQueryEquals("term term1 term2", a, "term term1 term2");
+  }
+
+  public void testWildcard() throws Exception {
+    assertQueryEquals("term*", null, "term*");
+    assertQueryEquals("term*^2", null, "term*^2.0");
+    assertQueryEquals("term~", null, "term~2");
+    assertQueryEquals("term~0.7", null, "term~1");
+
+    assertQueryEquals("term~^2", null, "term~2^2.0");
+
+    assertQueryEquals("term^2~", null, "term~2^2.0");
+    assertQueryEquals("term*germ", null, "term*germ");
+    assertQueryEquals("term*germ^3", null, "term*germ^3.0");
+
+    assertTrue(getQuery("term*", null) instanceof PrefixQuery);
+    assertTrue(getQuery("term*^2", null) instanceof PrefixQuery);
+    assertTrue(getQuery("term~", null) instanceof FuzzyQuery);
+    assertTrue(getQuery("term~0.7", null) instanceof FuzzyQuery);
+
+    FuzzyQuery fq = (FuzzyQuery) getQuery("term~0.7", null);
+    assertEquals(1, fq.getMaxEdits());
+    assertEquals(FuzzyQuery.defaultPrefixLength, fq.getPrefixLength());
+    fq = (FuzzyQuery) getQuery("term~", null);
+    assertEquals(2, fq.getMaxEdits());
+    assertEquals(FuzzyQuery.defaultPrefixLength, fq.getPrefixLength());
+
+    assertTrue(getQuery("term*germ", null) instanceof WildcardQuery);
+
+    /*
+     * Tests to see that wild card terms are (or are not) properly lower-cased
+     * with propery parser configuration
+     */
+    // First prefix queries:
+    // by default, convert to lowercase:
+    assertWildcardQueryEquals("Term*", true, "term*");
+    // explicitly set lowercase:
+    assertWildcardQueryEquals("term*", true, "term*");
+    assertWildcardQueryEquals("Term*", true, "term*");
+    assertWildcardQueryEquals("TERM*", true, "term*");
+    // explicitly disable lowercase conversion:
+    assertWildcardQueryEquals("term*", false, "term*");
+    assertWildcardQueryEquals("Term*", false, "Term*");
+    assertWildcardQueryEquals("TERM*", false, "TERM*");
+    // Then 'full' wildcard queries:
+    // by default, convert to lowercase:
+    assertWildcardQueryEquals("Te?m", "te?m");
+    // explicitly set lowercase:
+    assertWildcardQueryEquals("te?m", true, "te?m");
+    assertWildcardQueryEquals("Te?m", true, "te?m");
+    assertWildcardQueryEquals("TE?M", true, "te?m");
+    assertWildcardQueryEquals("Te?m*gerM", true, "te?m*germ");
+    // explicitly disable lowercase conversion:
+    assertWildcardQueryEquals("te?m", false, "te?m");
+    assertWildcardQueryEquals("Te?m", false, "Te?m");
+    assertWildcardQueryEquals("TE?M", false, "TE?M");
+    assertWildcardQueryEquals("Te?m*gerM", false, "Te?m*gerM");
+    // Fuzzy queries:
+    assertWildcardQueryEquals("Term~", "term~2");
+    assertWildcardQueryEquals("Term~", true, "term~2");
+    assertWildcardQueryEquals("Term~", false, "Term~2");
+    // Range queries:
+
+    // TODO: implement this on QueryParser
+    // Q0002E_INVALID_SYNTAX_CANNOT_PARSE: Syntax Error, cannot parse '[A TO
+    // C]': Lexical error at line 1, column 1. Encountered: "[" (91), after
+    // : ""
+    assertWildcardQueryEquals("[A TO C]", "[a TO c]");
+    assertWildcardQueryEquals("[A TO C]", true, "[a TO c]");
+    assertWildcardQueryEquals("[A TO C]", false, "[A TO C]");
+    // Test suffix queries: first disallow
+    try {
+      assertWildcardQueryEquals("*Term", true, "*term");
+      fail();
+    } catch (QueryNodeException pe) {
+      // expected exception
+    }
+    try {
+      assertWildcardQueryEquals("?Term", true, "?term");
+      fail();
+    } catch (QueryNodeException pe) {
+      // expected exception
+    }
+    // Test suffix queries: then allow
+    assertWildcardQueryEquals("*Term", true, "*term", true);
+    assertWildcardQueryEquals("?Term", true, "?term", true);
+  }
+
+  public void testLeadingWildcardType() throws Exception {
+    AqpQueryParser qp = getParser(null);
+    qp.setAllowLeadingWildcard(true);
+    assertEquals(WildcardQuery.class, qp.parse("t*erm*", "field").getClass());
+    assertEquals(WildcardQuery.class, qp.parse("?term*", "field").getClass());
+    assertEquals(WildcardQuery.class, qp.parse("*term*", "field").getClass());
+  }
+
+  public void testQPA() throws Exception {
+    assertQueryEquals("term term^3.0 term", qpAnalyzer, "term term^3.0 term");
+    assertQueryEquals("term stop^3.0 term", qpAnalyzer, "term term");
+
+    assertQueryEquals("term term term", qpAnalyzer, "term term term");
+    assertQueryEquals("term +stop term", qpAnalyzer, "term term");
+    assertQueryEquals("term -stop term", qpAnalyzer, "term term");
+
+    assertQueryEquals("drop AND (stop) AND roll", qpAnalyzer, "+drop +roll");
+    assertQueryEquals("term +(stop) term", qpAnalyzer, "term term");
+    assertQueryEquals("term -(stop) term", qpAnalyzer, "term term");
+
+    assertQueryEquals("drop AND stop AND roll", qpAnalyzer, "+drop +roll");
+    // rca TODO: plug the modifier GroupQueryNodeProcessor
+    // expected: term phrase1 phrase2 term
+    assertQueryEquals("term phrase term", qpAnalyzer,
+        "term (phrase1 phrase2) term");
+
+    // TODO: plug the modifier GroupQueryNodeProcessor
+    // expected: term phrase1 phrase2 term
+    assertQueryEquals("term AND NOT phrase term", qpAnalyzer,
+        "(+term -(phrase1 phrase2)) term");
+
+    assertQueryEquals("stop^3", qpAnalyzer, "");
+    assertQueryEquals("stop", qpAnalyzer, "");
+    assertQueryEquals("(stop)^3", qpAnalyzer, "");
+    assertQueryEquals("((stop))^3", qpAnalyzer, "");
+    assertQueryEquals("(stop^3)", qpAnalyzer, "");
+    assertQueryEquals("((stop)^3)", qpAnalyzer, "");
+    assertQueryEquals("(stop)", qpAnalyzer, "");
+    assertQueryEquals("((stop))", qpAnalyzer, "");
+    assertTrue(getQuery("term term term", qpAnalyzer) instanceof BooleanQuery);
+    assertTrue(getQuery("term +stop", qpAnalyzer) instanceof TermQuery);
+  }
+
+  public void testRange() throws Exception {
+    assertQueryEquals("[ a TO z]", null, "[a TO z]");
+    assertEquals(MultiTermQuery.CONSTANT_SCORE_AUTO_REWRITE_DEFAULT,
+        ((TermRangeQuery) getQuery("[ a TO z]", null)).getRewriteMethod());
+
+    AqpQueryParser qp = getParser();
+
+    qp.setMultiTermRewriteMethod(MultiTermQuery.SCORING_BOOLEAN_QUERY_REWRITE);
+    assertEquals(MultiTermQuery.SCORING_BOOLEAN_QUERY_REWRITE,
+        ((TermRangeQuery) qp.parse("[ a TO z]", "field")).getRewriteMethod());
+
+    assertQueryEquals("[ a TO z ]", null, "[a TO z]");
+    assertQueryEquals("{ a TO z}", null, "{a TO z}");
+    assertQueryEquals("{ a TO z }", null, "{a TO z}");
+    assertQueryEquals("{ a TO z }^2.0", null, "{a TO z}^2.0");
+    assertQueryEquals("[ a TO z] OR bar", null, "[a TO z] bar");
+    assertQueryEquals("[ a TO z] AND bar", null, "+[a TO z] +bar");
+    assertQueryEquals("( bar blar { a TO z}) ", null, "bar blar {a TO z}");
+
+    // the original expected value was: gack (bar blar {a TO z})
+    assertQueryEquals("gack ( bar blar { a TO z}) ", null,
+        "gack bar blar {a TO z}");
+  }
+
+  /**
+   * removed in lucene-4.0 public void testFarsiRangeCollating() throws
+   * Exception { Directory ramDir = newDirectory(); IndexWriter iw = new
+   * IndexWriter(ramDir, newIndexWriterConfig(TEST_VERSION_CURRENT, new
+   * WhitespaceAnalyzer(TEST_VERSION_CURRENT))); Document doc = new Document();
+   * doc.add(newField("content", "\u0633\u0627\u0628", Field.Store.YES,
+   * Field.Index.NOT_ANALYZED)); iw.addDocument(doc); iw.close(); IndexSearcher
+   * is = new IndexSearcher(ramDir, true);
+   * 
+   * AqpQueryParser qp = getParser(); qp.setAnalyzer(new
+   * WhitespaceAnalyzer(TEST_VERSION_CURRENT));
+   * 
+   * // Neither Java 1.4.2 nor 1.5.0 has Farsi Locale collation available in //
+   * RuleBasedCollator. However, the Arabic Locale seems to order the // Farsi
+   * // characters properly. Collator c = Collator.getInstance(new
+   * Locale("ar")); qp.setRangeCollator(c);
+   * 
+   * // Unicode order would include U+0633 in [ U+062F - U+0698 ], but Farsi //
+   * orders the U+0698 character before the U+0633 character, so the // single
+   * // index Term below should NOT be returned by a ConstantScoreRangeQuery //
+   * with a Farsi Collator (or an Arabic one for the case when Farsi is // not
+   * // supported).
+   * 
+   * // Test ConstantScoreRangeQuery
+   * qp.setMultiTermRewriteMethod(MultiTermQuery.CONSTANT_SCORE_FILTER_REWRITE);
+   * ScoreDoc[] result = is.search(qp.parse("[ \u062F TO \u0698 ]", "content"),
+   * null, 1000).scoreDocs;
+   * assertEquals("The index Term should not be included.", 0, result.length);
+   * 
+   * result = is.search(qp.parse("[ \u0633 TO \u0638 ]", "content"), null,
+   * 1000).scoreDocs; assertEquals("The index Term should be included.", 1,
+   * result.length);
+   * 
+   * // Test RangeQuery
+   * qp.setMultiTermRewriteMethod(MultiTermQuery.SCORING_BOOLEAN_QUERY_REWRITE);
+   * result = is.search(qp.parse("[ \u062F TO \u0698 ]", "content"), null,
+   * 1000).scoreDocs; assertEquals("The index Term should not be included.", 0,
+   * result.length);
+   * 
+   * result = is.search(qp.parse("[ \u0633 TO \u0638 ]", "content"), null,
+   * 1000).scoreDocs; assertEquals("The index Term should be included.", 1,
+   * result.length);
+   * 
+   * is.close(); ramDir.close(); }
+   */
+
+  public void testDateRange() throws Exception {
+    String startDate = getLocalizedDate(2002, 1, 1);
+    String endDate = getLocalizedDate(2002, 1, 4);
+    Calendar endDateExpected = new GregorianCalendar();
+    endDateExpected.clear();
+    endDateExpected.set(2002, 1, 4, 23, 59, 59);
+    endDateExpected.set(Calendar.MILLISECOND, 999);
+    final String defaultField = "default";
+    final String monthField = "month";
+    final String hourField = "hour";
+    AqpQueryParser qp = getParser();
+
+    Map<CharSequence, DateTools.Resolution> dateRes = new HashMap<CharSequence, DateTools.Resolution>();
+
+    // set a field specific date resolution
+    dateRes.put(monthField, DateTools.Resolution.MONTH);
+    qp.setDateResolution(dateRes);
+
+    // set default date resolution to MILLISECOND
+    qp.setDateResolution(DateTools.Resolution.MILLISECOND);
+
+    // set second field specific date resolution
+    dateRes.put(hourField, DateTools.Resolution.HOUR);
+    qp.setDateResolution(dateRes);
+
+    // for this field no field specific date resolution has been set,
+    // so verify if the default resolution is used
+    assertDateRangeQueryEquals(qp, defaultField, startDate, endDate,
+        endDateExpected.getTime(), DateTools.Resolution.MILLISECOND);
+
+    // verify if field specific date resolutions are used for these two
+    // fields
+    assertDateRangeQueryEquals(qp, monthField, startDate, endDate,
+        endDateExpected.getTime(), DateTools.Resolution.MONTH);
+
+    assertDateRangeQueryEquals(qp, hourField, startDate, endDate,
+        endDateExpected.getTime(), DateTools.Resolution.HOUR);
+  }
+
+  public void testEscaped() throws Exception {
+    Analyzer a = new WhitespaceAnalyzer(TEST_VERSION_CURRENT);
+
+    /*
+     * assertQueryEquals("\\[brackets", a, "\\[brackets");
+     * assertQueryEquals("\\[brackets", null, "brackets");
+     * assertQueryEquals("\\\\", a, "\\\\"); assertQueryEquals("\\+blah", a,
+     * "\\+blah"); assertQueryEquals("\\(blah", a, "\\(blah");
+     * 
+     * assertQueryEquals("\\-blah", a, "\\-blah"); assertQueryEquals("\\!blah",
+     * a, "\\!blah"); assertQueryEquals("\\{blah", a, "\\{blah");
+     * assertQueryEquals("\\}blah", a, "\\}blah"); assertQueryEquals("\\:blah",
+     * a, "\\:blah"); assertQueryEquals("\\^blah", a, "\\^blah");
+     * assertQueryEquals("\\[blah", a, "\\[blah"); assertQueryEquals("\\]blah",
+     * a, "\\]blah"); assertQueryEquals("\\\"blah", a, "\\\"blah");
+     * assertQueryEquals("\\(blah", a, "\\(blah"); assertQueryEquals("\\)blah",
+     * a, "\\)blah"); assertQueryEquals("\\~blah", a, "\\~blah");
+     * assertQueryEquals("\\*blah", a, "\\*blah"); assertQueryEquals("\\?blah",
+     * a, "\\?blah"); //assertQueryEquals("foo \\&\\& bar", a,
+     * "foo \\&\\& bar"); //assertQueryEquals("foo \\|| bar", a,
+     * "foo \\|| bar"); //assertQueryEquals("foo \\AND bar", a,
+     * "foo \\AND bar");
+     */
+
+    assertQueryEquals("\\*", a, "*");
+
+    assertQueryEquals("\\a", a, "a");
+
+    assertQueryEquals("a\\-b:c", a, "a-b:c");
+    assertQueryEquals("a\\+b:c", a, "a+b:c");
+    assertQueryEquals("a\\:b:c", a, "a:b:c");
+    assertQueryEquals("a\\\\b:c", a, "a\\b:c");
+
+    assertQueryEquals("a:b\\-c", a, "a:b-c");
+    assertQueryEquals("a:b\\+c", a, "a:b+c");
+    assertQueryEquals("a:b\\:c", a, "a:b:c");
+    assertQueryEquals("a:b\\\\c", a, "a:b\\c");
+
+    assertQueryEquals("a:b\\-c*", a, "a:b-c*");
+    assertQueryEquals("a:b\\+c*", a, "a:b+c*");
+    assertQueryEquals("a:b\\:c*", a, "a:b:c*");
+
+    assertQueryEquals("a:b\\\\c*", a, "a:b\\c*");
+
+    assertQueryEquals("a:b\\-?c", a, "a:b-?c");
+    assertQueryEquals("a:b\\+?c", a, "a:b+?c");
+    assertQueryEquals("a:b\\:?c", a, "a:b:?c");
+
+    assertQueryEquals("a:b\\\\?c", a, "a:b\\?c");
+
+    assertQueryEquals("a:b\\-c~", a, "a:b-c~1");
+    assertQueryEquals("a:b\\+c~", a, "a:b+c~1");
+    assertQueryEquals("a:b\\:c~", a, "a:b:c~1");
+    assertQueryEquals("a:b\\\\c~", a, "a:b\\c~1");
+
+    // TODO: implement Range queries on QueryParser
+    assertQueryEquals("[ a\\- TO a\\+ ]", null, "[a- TO a+]");
+    assertQueryEquals("[ a\\: TO a\\~ ]", null, "[a: TO a~]");
+    assertQueryEquals("[ a\\\\ TO a\\* ]", null, "[a\\ TO a*]");
+
+    assertQueryEquals(
+        "[\"c\\:\\\\temp\\\\\\~foo0.txt\" TO \"c\\:\\\\temp\\\\\\~foo9.txt\"]",
+        a, "[c:\\temp\\~foo0.txt TO c:\\temp\\~foo9.txt]");
+
+    assertQueryEquals("a\\\\\\+b", a, "a\\+b");
+
+    assertQueryEquals("a \\\"b c\\\" d", a, "a \"b c\" d");
+    assertQueryEquals("\"a \\\"b c\\\" d\"", a, "\"a \"b c\" d\"");
+    assertQueryEquals("\"a \\+b c d\"", a, "\"a +b c d\"");
+
+    assertQueryEquals("c\\:\\\\temp\\\\\\~foo.txt", a, "c:\\temp\\~foo.txt");
+
+    assertQueryNodeException("XY\\"); // there must be a character after the
+    // escape char
+
+    // test unicode escaping
+    assertQueryEquals("a\\u0062c", a, "abc");
+    assertQueryEquals("XY\\u005a", a, "XYZ");
+    assertQueryEquals("XY\\u005A", a, "XYZ");
+    assertQueryEquals("\"a \\\\\\u0028\\u0062\\\" c\"", a, "\"a \\(b\" c\"");
+
+    assertQueryNodeException("XY\\u005G"); // test non-hex character in escaped
+    // unicode sequence
+    assertQueryNodeException("XY\\u005"); // test incomplete escaped unicode
+    // sequence
+
+    // Tests bug LUCENE-800
+    assertQueryEquals("(item:\\\\ item:ABCD\\\\)", a, "item:\\ item:ABCD\\");
+    assertQueryNodeException("(item:\\\\ item:ABCD\\\\))"); // unmatched closing
+    assertQueryNodeException("(item:\\\\ item:ABCD\\\\)))"); // unmatched closing
+    assertQueryNodeException("(item:\\\\ item:ABCD\\\\) foo)"); // unmatched closing
+    
+    // paranthesis
+    assertQueryEquals("\\*", a, "*");
+    assertQueryEquals("\\\\", a, "\\"); // escaped backslash
+
+    assertQueryNodeException("\\"); // a backslash must always be escaped
+
+    // LUCENE-1189
+    // the original result was set to be: 
+    // assertQueryEquals("(\"a\\\\\") or (\"b\")", a, "a\\ or b");
+    // however, this is wrong, because the query is: ("a\\") or ("b")
+    // the AQP parser is handling escaped chars (even escaped escapes)
+    // correctly
+    assertQueryEquals("(\"a\\\\\") or (\"b\")", a, "a\\ b");
+    assertQueryEquals("(foo:\"a\\\\\") or (bar:\"b\")", a, "foo:a\\ bar:b");
+  }
+
+  public void testQueryStringEscaping() throws Exception {
+    Analyzer a = new WhitespaceAnalyzer(TEST_VERSION_CURRENT);
+
+    assertEscapedQueryEquals("a-b:c", a, "a\\-b\\:c");
+    assertEscapedQueryEquals("a+b:c", a, "a\\+b\\:c");
+    assertEscapedQueryEquals("a:b:c", a, "a\\:b\\:c");
+    assertEscapedQueryEquals("a\\b:c", a, "a\\\\b\\:c");
+
+    assertEscapedQueryEquals("a:b-c", a, "a\\:b\\-c");
+    assertEscapedQueryEquals("a:b+c", a, "a\\:b\\+c");
+    assertEscapedQueryEquals("a:b:c", a, "a\\:b\\:c");
+    assertEscapedQueryEquals("a:b\\c", a, "a\\:b\\\\c");
+
+    assertEscapedQueryEquals("a:b-c*", a, "a\\:b\\-c\\*");
+    assertEscapedQueryEquals("a:b+c*", a, "a\\:b\\+c\\*");
+    assertEscapedQueryEquals("a:b:c*", a, "a\\:b\\:c\\*");
+
+    assertEscapedQueryEquals("a:b\\\\c*", a, "a\\:b\\\\\\\\c\\*");
+
+    assertEscapedQueryEquals("a:b-?c", a, "a\\:b\\-\\?c");
+    assertEscapedQueryEquals("a:b+?c", a, "a\\:b\\+\\?c");
+    assertEscapedQueryEquals("a:b:?c", a, "a\\:b\\:\\?c");
+
+    assertEscapedQueryEquals("a:b?c", a, "a\\:b\\?c");
+
+    assertEscapedQueryEquals("a:b-c~", a, "a\\:b\\-c\\~");
+    assertEscapedQueryEquals("a:b+c~", a, "a\\:b\\+c\\~");
+    assertEscapedQueryEquals("a:b:c~", a, "a\\:b\\:c\\~");
+    assertEscapedQueryEquals("a:b\\c~", a, "a\\:b\\\\c\\~");
+
+    assertEscapedQueryEquals("[ a - TO a+ ]", null, "\\[ a \\- TO a\\+ \\]");
+    assertEscapedQueryEquals("[ a : TO a~ ]", null, "\\[ a \\: TO a\\~ \\]");
+    assertEscapedQueryEquals("[ a\\ TO a* ]", null, "\\[ a\\\\ TO a\\* \\]");
+
+    // LUCENE-881
+    assertEscapedQueryEquals("|| abc ||", a, "\\|\\| abc \\|\\|");
+    assertEscapedQueryEquals("&& abc &&", a, "\\&\\& abc \\&\\&");
+  }
+
+  public void testTabNewlineCarriageReturn() throws Exception {
+    assertQueryEqualsDOA("+weltbank +worlbank", null, "+weltbank +worlbank");
+
+    assertQueryEqualsDOA("+weltbank\n+worlbank", null, "+weltbank +worlbank");
+    assertQueryEqualsDOA("weltbank \n+worlbank", null, "+weltbank +worlbank");
+    assertQueryEqualsDOA("weltbank \n +worlbank", null, "+weltbank +worlbank");
+
+    assertQueryEqualsDOA("+weltbank\r+worlbank", null, "+weltbank +worlbank");
+    assertQueryEqualsDOA("weltbank \r+worlbank", null, "+weltbank +worlbank");
+    assertQueryEqualsDOA("weltbank \r +worlbank", null, "+weltbank +worlbank");
+
+    assertQueryEqualsDOA("+weltbank\r\n+worlbank", null, "+weltbank +worlbank");
+    assertQueryEqualsDOA("weltbank \r\n+worlbank", null, "+weltbank +worlbank");
+    assertQueryEqualsDOA("weltbank \r\n +worlbank", null, "+weltbank +worlbank");
+    assertQueryEqualsDOA("weltbank \r \n +worlbank", null,
+        "+weltbank +worlbank");
+
+    assertQueryEqualsDOA("+weltbank\t+worlbank", null, "+weltbank +worlbank");
+    assertQueryEqualsDOA("weltbank \t+worlbank", null, "+weltbank +worlbank");
+    assertQueryEqualsDOA("weltbank \t +worlbank", null, "+weltbank +worlbank");
+  }
+
+  public void testSimpleDAO() throws Exception {
+    assertQueryEqualsDOA("term term term", null, "+term +term +term");
+    assertQueryEqualsDOA("term +term term", null, "+term +term +term");
+    assertQueryEqualsDOA("term term +term", null, "+term +term +term");
+    assertQueryEqualsDOA("term +term +term", null, "+term +term +term");
+    assertQueryEqualsDOA("-term term term", null, "-term +term +term");
+  }
+
+  public void testBoost() throws Exception {
+    CharacterRunAutomaton stopSet = new CharacterRunAutomaton(
+        BasicAutomata.makeString("on"));
+    Analyzer oneStopAnalyzer = new MockAnalyzer(random(), MockTokenizer.SIMPLE,
+        true, stopSet);
+    AqpQueryParser qp = getParser();
+    qp.setAnalyzer(oneStopAnalyzer);
+
+    Query q = qp.parse("on^1.0", "field");
+    assertNotNull(q);
+    q = qp.parse("\"hello\"^2.0", "field");
+    assertNotNull(q);
+    assertEquals(q.getBoost(), (float) 2.0, (float) 0.5);
+    q = qp.parse("hello^2.0", "field");
+    assertNotNull(q);
+    assertEquals(q.getBoost(), (float) 2.0, (float) 0.5);
+    q = qp.parse("\"on\"^1.0", "field");
+    assertNotNull(q);
+
+    AqpQueryParser qp2 = getParser();
+    qp2.setAnalyzer(new StandardAnalyzer(TEST_VERSION_CURRENT));
+
+    q = qp2.parse("the^3", "field");
+    // "the" is a stop word so the result is an empty query:
+    assertNotNull(q);
+    assertEquals("", q.toString());
+    assertEquals(1.0f, q.getBoost(), 0.01f);
+  }
+
+  public void testException() throws Exception {
+    assertQueryNodeException("*leadingWildcard"); // disallowed by default
+    assertQueryNodeException("(foo bar");
+
+    assertQueryNodeException("\"some phrase");
+    assertQueryNodeException("foo bar))");
+    assertQueryNodeException("field:term:with:colon some more terms");
+    assertQueryNodeException("(sub query)^5.0^2.0 plus more");
+    assertQueryNodeException("secret AND illegal) AND access:confidential");
+  }
+
+  public void testCustomQueryParserWildcard() throws Exception {
+    try {
+      QPTestParser.init(new WhitespaceAnalyzer(TEST_VERSION_CURRENT)).parse(
+          "a?t", "contents");
+      fail("Wildcard queries should not be allowed");
+    } catch (QueryNodeException expected) {
+      // expected exception
+    }
+  }
+
+  public void testCustomQueryParserFuzzy() throws Exception {
+    try {
+      QPTestParser.init(new WhitespaceAnalyzer(TEST_VERSION_CURRENT)).parse(
+          "xunit~", "contents");
+      fail("Fuzzy queries should not be allowed");
+    } catch (QueryNodeException expected) {
+      // expected exception
+    }
+  }
+
+  public void testBooleanQuery() throws Exception {
+    BooleanQuery.setMaxClauseCount(2);
+    try {
+      AqpQueryParser qp = getParser();
+      qp.setAnalyzer(new WhitespaceAnalyzer(TEST_VERSION_CURRENT));
+
+      qp.parse("one two three", "field");
+      fail("ParseException expected due to too many boolean clauses");
+    } catch (QueryNodeException expected) {
+      // too many boolean clauses, so ParseException is expected
+    }
+  }
+
+  /**
+   * This test differs from TestPrecedenceQueryParser
+   */
+  public void testPrecedence() throws Exception {
+    AqpQueryParser qp1 = getParser();
+    qp1.setAnalyzer(new WhitespaceAnalyzer(TEST_VERSION_CURRENT));
+
+    AqpQueryParser qp2 = getParser();
+    qp2.setAnalyzer(new WhitespaceAnalyzer(TEST_VERSION_CURRENT));
+
+    // TODO: to achieve standard lucene behaviour (no operator precedence)
+    // modify the GroupQueryNodeProcessor to recognize our new BooleanQN classes
+    // then do:
+    QueryNodeProcessorPipeline processor = (QueryNodeProcessorPipeline) qp1
+        .getQueryNodeProcessor();
+    processor.add(new GroupQueryNodeProcessor());
+
+    Query query1 = qp1.parse("A AND B OR C AND D", "field");
+    Query query2 = qp2.parse("+A +B +C +D", "field");
+
+    assertEquals(query1, query2);
+  }
+
+  public void testLocalDateFormat() throws IOException, QueryNodeException,
+      ParseException {
+    Directory ramDir = new RAMDirectory();
+    IndexWriter iw = new IndexWriter(ramDir, newIndexWriterConfig(
+        TEST_VERSION_CURRENT, new WhitespaceAnalyzer(TEST_VERSION_CURRENT)));
+    addDateDoc("a", 2005, 12, 2, 10, 15, 33, iw);
+    addDateDoc("b", 2005, 12, 4, 22, 15, 00, iw);
+    iw.close();
+    IndexSearcher is = new IndexSearcher(DirectoryReader.open(ramDir));
+
+    SimpleDateFormat format = new SimpleDateFormat("dd/MM/yyyy", Locale.ROOT);
+    Date d1_12 = format.parse("1/12/2005");
+    Date d3_12 = format.parse("3/12/2005");
+    Date d4_12 = format.parse("4/12/2005");
+    Date d28_12 = format.parse("28/12/2005");
+
+    DateFormat df = DateFormat.getDateInstance(DateFormat.SHORT,
+        Locale.getDefault());
+    String dec1 = df.format(d1_12);
+    String dec2 = df.format(format.parse("2/12/2005"));
+    String dec3 = df.format(d3_12);
+    String dec4 = df.format(d4_12);
+    String dec28 = df.format(d28_12);
+
+    assertHits(2, String.format("[%s TO %s]", dec1, dec28), is);
+    assertHits(2, String.format("[%s TO %s]", dec1, dec4), is);
+
+    assertHits(2, String.format("{%s TO %s}", dec1, dec28), is);
+    assertHits(1, String.format("{%s TO %s}", dec1, dec4), is);
+    assertHits(0, String.format("{%s TO %s}", dec3, dec4), is);
+
+    ramDir.close();
+  }
+
+  public void testStopwords() throws Exception {
+    AqpQueryParser qp = getParser();
+    qp.setAnalyzer(new StopAnalyzer(TEST_VERSION_CURRENT, StopFilter
+        .makeStopSet(TEST_VERSION_CURRENT, "the", "foo")));
+
+    Query result = qp.parse("a:the OR a:foo", "a");
+    assertNotNull("result is null and it shouldn't be", result);
+    assertTrue("result is not a BooleanQuery", result instanceof BooleanQuery);
+    assertTrue(((BooleanQuery) result).clauses().size() + " does not equal: "
+        + 0, ((BooleanQuery) result).clauses().size() == 0);
+    result = qp.parse("a:woo OR a:the", "a");
+    assertNotNull("result is null and it shouldn't be", result);
+    assertTrue("result is not a TermQuery", result instanceof TermQuery);
+
+    result = qp.parse(
+        "(fieldX:xxxxx OR fieldy:xxxxxxxx)^2 AND (fieldx:the OR fieldy:foo)",
+        "a");
+
+    assertNotNull("result is null and it shouldn't be", result);
+    assertTrue("result is not a BooleanQuery", result instanceof BooleanQuery);
+    if (VERBOSE)
+      System.out.println("Result: " + result);
+    assertTrue(((BooleanQuery) result).clauses().size() + " does not equal: "
+        + 2, ((BooleanQuery) result).clauses().size() == 2);
+  }
+
+  public void testPositionIncrement() throws Exception {
+    AqpQueryParser qp = getParser();
+    qp.setAnalyzer(new StopAnalyzer(TEST_VERSION_CURRENT, StopFilter
+        .makeStopSet(TEST_VERSION_CURRENT, "the", "in", "are", "this")));
+
+    qp.setEnablePositionIncrements(true);
+
+    String qtxt = "\"the words in poisitions pos02578 are stopped in this phrasequery\"";
+    // 0 2 5 7 8
+    int expectedPositions[] = { 1, 3, 4, 6, 9 };
+    PhraseQuery pq = (PhraseQuery) qp.parse(qtxt, "a");
+    // System.out.println("Query text: "+qtxt);
+    // System.out.println("Result: "+pq);
+    Term t[] = pq.getTerms();
+    int pos[] = pq.getPositions();
+    for (int i = 0; i < t.length; i++) {
+      // System.out.println(i+". "+t[i]+"  pos: "+pos[i]);
+      assertEquals("term " + i + " = " + t[i] + " has wrong term-position!",
+          expectedPositions[i], pos[i]);
+    }
+  }
+
+  public void testMatchAllDocs() throws Exception {
+    AqpQueryParser qp = getParser();
+    qp.setAnalyzer(new WhitespaceAnalyzer(TEST_VERSION_CURRENT));
+
+    assertEquals(new MatchAllDocsQuery(), qp.parse("*:*", "field"));
+    assertEquals(new MatchAllDocsQuery(), qp.parse("(*:*)", "field"));
+    BooleanQuery bq = (BooleanQuery) qp.parse("+*:* -*:*", "field");
+    assertTrue(bq.getClauses()[0].getQuery() instanceof MatchAllDocsQuery);
+    assertTrue(bq.getClauses()[1].getQuery() instanceof MatchAllDocsQuery);
+  }
+
+  private class CannedTokenizer extends Tokenizer {
+    private int upto = 0;
+    private final PositionIncrementAttribute posIncr = addAttribute(PositionIncrementAttribute.class);
+    private final CharTermAttribute term = addAttribute(CharTermAttribute.class);
+
+    public CannedTokenizer(Reader reader) {
+      super(reader);
+    }
+
+    @Override
+    public boolean incrementToken() {
+      clearAttributes();
+      if (upto == 4) {
+        return false;
+      }
+      if (upto == 0) {
+        posIncr.setPositionIncrement(1);
+        term.setEmpty().append("a");
+      } else if (upto == 1) {
+        posIncr.setPositionIncrement(1);
+        term.setEmpty().append("b");
+      } else if (upto == 2) {
+        posIncr.setPositionIncrement(0);
+        term.setEmpty().append("c");
+      } else {
+        posIncr.setPositionIncrement(0);
+        term.setEmpty().append("d");
+      }
+      upto++;
+      return true;
+    }
+
+    @Override
+    public void reset() throws IOException {
+      super.reset();
+      this.upto = 0;
+    }
+  }
+
+  private class CannedAnalyzer extends Analyzer {
+    @Override
+    public TokenStreamComponents createComponents(String ignored,
+        Reader alsoIgnored) {
+      return new TokenStreamComponents(new CannedTokenizer(alsoIgnored));
+    }
+  }
+
+  public void testMultiPhraseQuery() throws Exception {
+    Directory dir = newDirectory();
+    IndexWriter w = new IndexWriter(dir, newIndexWriterConfig(
+        TEST_VERSION_CURRENT, new CannedAnalyzer()));
+    Document doc = new Document();
+    doc.add(newField("field", "", TextField.TYPE_NOT_STORED));
+    w.addDocument(doc);
+    w.commit();
+    IndexReader r = DirectoryReader.open(w.getDirectory());
+    IndexSearcher s = newSearcher(r);
+
+    Query q = QPTestParser.init(new CannedAnalyzer()).parse("\"a\"", "field");
+    assertTrue(q instanceof MultiPhraseQuery);
+    assertEquals(1, s.search(q, 10).totalHits);
+    r.close();
+    w.close();
+    dir.close();
+  }
+
+  // Uniquely for Junit 3
+  public static junit.framework.Test suite() {
+    return new junit.framework.JUnit4TestAdapter(TestAqpSLGStandardTest.class);
+  }
+
+}
Index: lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpSLGMultiAnalyzer.java
===================================================================
--- lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpSLGMultiAnalyzer.java	(revision 0)
+++ lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpSLGMultiAnalyzer.java	(revision 0)
@@ -0,0 +1,268 @@
+package org.apache.lucene.queryparser.flexible.aqp;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.io.IOException;
+import java.io.Reader;
+
+import org.apache.lucene.analysis.Analyzer;
+import org.apache.lucene.analysis.MockTokenizer;
+import org.apache.lucene.analysis.TokenFilter;
+import org.apache.lucene.analysis.TokenStream;
+import org.apache.lucene.analysis.Tokenizer;
+import org.apache.lucene.analysis.tokenattributes.CharTermAttribute;
+import org.apache.lucene.analysis.tokenattributes.OffsetAttribute;
+import org.apache.lucene.analysis.tokenattributes.PositionIncrementAttribute;
+import org.apache.lucene.analysis.tokenattributes.TypeAttribute;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler.Operator;
+import org.apache.lucene.queryparser.flexible.aqp.AqpQueryParser;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardLuceneParser;
+import org.apache.lucene.search.Query;
+
+/**
+ * This test case is a copy of the core Lucene query parser test, it was adapted
+ * to use new QueryParserHelper instead of the old query parser.
+ * 
+ * Test QueryParser's ability to deal with Analyzers that return more than one
+ * token per position or that return tokens with a position increment &gt; 1.
+ */
+public class TestAqpSLGMultiAnalyzer extends AqpTestAbstractCase {
+
+  private static int multiToken = 0;
+
+  public void testMultiAnalyzer() throws QueryNodeException, Exception {
+
+    AqpQueryParser qp = getParser();
+    qp.setDefaultOperator(Operator.OR);
+    qp.setAnalyzer(new MultiAnalyzer());
+
+    // trivial, no multiple tokens:
+    assertEquals("foo", qp.parse("foo", "").toString());
+    assertEquals("foo", qp.parse("\"foo\"", "").toString());
+    assertEquals("foo foobar", qp.parse("foo foobar", "").toString());
+    assertEquals("\"foo foobar\"", qp.parse("\"foo foobar\"", "").toString());
+    assertEquals("\"foo foobar blah\"", qp.parse("\"foo foobar blah\"", "")
+        .toString());
+
+    // two tokens at the same position:
+    assertEquals("(multi multi2) foo", qp.parse("multi foo", "").toString());
+    assertEquals("foo (multi multi2)", qp.parse("foo multi", "").toString());
+    assertEquals("(multi multi2) (multi multi2)", qp.parse("multi multi", "")
+        .toString());
+    Query q = qp.parse("(foo multi) +(bar multi)", "");
+    assertEquals("foo (multi multi2) +(bar (multi multi2))",
+        qp.parse("(foo multi) +(bar multi)", "").toString());
+    assertEquals("+(foo (multi multi2)) field:\"bar (multi multi2)\"", qp
+        .parse("+(foo multi) field:\"bar multi\"", "").toString());
+
+    // phrases:
+    assertEquals("\"(multi multi2) foo\"", qp.parse("\"multi foo\"", "")
+        .toString());
+    assertEquals("\"foo (multi multi2)\"", qp.parse("\"foo multi\"", "")
+        .toString());
+    assertEquals("\"foo (multi multi2) foobar (multi multi2)\"",
+        qp.parse("\"foo multi foobar multi\"", "").toString());
+
+    // fields:
+    assertEquals("(field:multi field:multi2) field:foo",
+        qp.parse("field:multi field:foo", "").toString());
+    assertEquals("field:\"(multi multi2) foo\"",
+        qp.parse("field:\"multi foo\"", "").toString());
+
+    // three tokens at one position:
+    assertEquals("triplemulti multi3 multi2", qp.parse("triplemulti", "")
+        .toString());
+    assertEquals("foo (triplemulti multi3 multi2) foobar",
+        qp.parse("foo triplemulti foobar", "").toString());
+
+    // phrase with non-default slop:
+    assertEquals("\"(multi multi2) foo\"~10", qp.parse("\"multi foo\"~10", "")
+        .toString());
+
+    // phrase with non-default boost:
+    assertEquals("\"(multi multi2) foo\"^2.0", qp.parse("\"multi foo\"^2", "")
+        .toString());
+
+    // phrase after changing default slop
+    qp.setDefaultPhraseSlop(99);
+    assertEquals("\"(multi multi2) foo\"~99 bar",
+        qp.parse("\"multi foo\" bar", "").toString());
+    assertEquals("\"(multi multi2) foo\"~99 \"foo bar\"~2",
+        qp.parse("\"multi foo\" \"foo bar\"~2", "").toString());
+    qp.setDefaultPhraseSlop(0);
+
+    // non-default operator:
+    qp.setDefaultOperator(Operator.AND);
+    assertEquals("+(multi multi2) +foo", qp.parse("multi foo", "").toString());
+
+  }
+
+  // public void testMultiAnalyzerWithSubclassOfQueryParser() throws
+  // ParseException {
+  // this test doesn't make sense when using the new QueryParser API
+  // DumbQueryParser qp = new DumbQueryParser("", new MultiAnalyzer());
+  // qp.setPhraseSlop(99); // modified default slop
+  //
+  // // direct call to (super's) getFieldQuery to demonstrate differnce
+  // // between phrase and multiphrase with modified default slop
+  // assertEquals("\"foo bar\"~99",
+  // qp.getSuperFieldQuery("","foo bar").toString());
+  // assertEquals("\"(multi multi2) bar\"~99",
+  // qp.getSuperFieldQuery("","multi bar").toString());
+  //
+  //
+  // // ask sublcass to parse phrase with modified default slop
+  // assertEquals("\"(multi multi2) foo\"~99 bar",
+  // qp.parse("\"multi foo\" bar").toString());
+  //
+  // }
+
+  public void testPosIncrementAnalyzer() throws QueryNodeException, Exception {
+    AqpQueryParser qp = getParser();
+    qp.setDefaultOperator(Operator.OR);
+
+    qp.setAnalyzer(new PosIncrementAnalyzer());
+
+    assertEquals("quick brown", qp.parse("the quick brown", "").toString());
+    assertEquals("\"quick brown\"", qp.parse("\"the quick brown\"", "")
+        .toString());
+    assertEquals("quick brown fox", qp.parse("the quick brown fox", "")
+        .toString());
+    assertEquals("\"quick brown fox\"", qp.parse("\"the quick brown fox\"", "")
+        .toString());
+  }
+
+  /**
+   * Expands "multi" to "multi" and "multi2", both at the same position, and
+   * expands "triplemulti" to "triplemulti", "multi3", and "multi2".
+   */
+  private class MultiAnalyzer extends Analyzer {
+
+    @Override
+    public TokenStreamComponents createComponents(String fieldName,
+        Reader reader) {
+      Tokenizer result = new MockTokenizer(reader, MockTokenizer.WHITESPACE,
+          true);
+      return new TokenStreamComponents(result, new TestFilter(result));
+    }
+  }
+
+  private final class TestFilter extends TokenFilter {
+
+    private String prevType;
+    private int prevStartOffset;
+    private int prevEndOffset;
+
+    private final CharTermAttribute termAtt = addAttribute(CharTermAttribute.class);
+    private final PositionIncrementAttribute posIncrAtt = addAttribute(PositionIncrementAttribute.class);
+    private final OffsetAttribute offsetAtt = addAttribute(OffsetAttribute.class);
+    private final TypeAttribute typeAtt = addAttribute(TypeAttribute.class);
+
+    public TestFilter(TokenStream in) {
+      super(in);
+    }
+
+    @Override
+    public final boolean incrementToken() throws java.io.IOException {
+      if (multiToken > 0) {
+        termAtt.setEmpty().append("multi" + (multiToken + 1));
+        offsetAtt.setOffset(prevStartOffset, prevEndOffset);
+        typeAtt.setType(prevType);
+        posIncrAtt.setPositionIncrement(0);
+        multiToken--;
+        return true;
+      } else {
+        boolean next = input.incrementToken();
+        if (!next) {
+          return false;
+        }
+        prevType = typeAtt.type();
+        prevStartOffset = offsetAtt.startOffset();
+        prevEndOffset = offsetAtt.endOffset();
+        String text = termAtt.toString();
+        if (text.equals("triplemulti")) {
+          multiToken = 2;
+          return true;
+        } else if (text.equals("multi")) {
+          multiToken = 1;
+          return true;
+        } else {
+          return true;
+        }
+      }
+    }
+
+    @Override
+    public void reset() throws IOException {
+      super.reset();
+      this.prevType = null;
+      this.prevStartOffset = 0;
+      this.prevEndOffset = 0;
+    }
+  }
+
+  /**
+   * Analyzes "the quick brown" as: quick(incr=2) brown(incr=1). Does not work
+   * correctly for input other than "the quick brown ...".
+   */
+  private class PosIncrementAnalyzer extends Analyzer {
+
+    @Override
+    public TokenStreamComponents createComponents(String fieldName,
+        Reader reader) {
+      Tokenizer result = new MockTokenizer(reader, MockTokenizer.WHITESPACE,
+          true);
+      return new TokenStreamComponents(result, new TestPosIncrementFilter(
+          result));
+    }
+  }
+
+  private class TestPosIncrementFilter extends TokenFilter {
+
+    private final CharTermAttribute termAtt = addAttribute(CharTermAttribute.class);
+    private final PositionIncrementAttribute posIncrAtt = addAttribute(PositionIncrementAttribute.class);
+
+    public TestPosIncrementFilter(TokenStream in) {
+      super(in);
+    }
+
+    @Override
+    public final boolean incrementToken() throws java.io.IOException {
+      while (input.incrementToken()) {
+        if (termAtt.toString().equals("the")) {
+          // stopword, do nothing
+        } else if (termAtt.toString().equals("quick")) {
+          posIncrAtt.setPositionIncrement(2);
+          return true;
+        } else {
+          posIncrAtt.setPositionIncrement(1);
+          return true;
+        }
+      }
+      return false;
+    }
+
+  }
+
+  // Uniquely for Junit 3
+  public static junit.framework.Test suite() {
+    return new junit.framework.JUnit4TestAdapter(TestAqpSLGMultiAnalyzer.class);
+  }
+
+}
Index: lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/parser/BuildAST.java
===================================================================
--- lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/parser/BuildAST.java	(revision 0)
+++ lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/parser/BuildAST.java	(revision 0)
@@ -0,0 +1,109 @@
+package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+import org.antlr.runtime.*;
+import org.antlr.runtime.tree.*;
+import org.antlr.stringtemplate.*;
+import java.lang.reflect.*;
+
+import org.apache.lucene.queryparser.flexible.aqp.parser.*;
+
+/**
+ * A utility class for generating the dot/graph representations of the query
+ * 
+ * 
+ */
+
+// import
+// org.apache.lucene.queryparser.flexible.aqp.parser.StandardLuceneGrammarLexer;
+// import
+// org.apache.lucene.queryparser.flexible.aqp.parser.StandardLuceneGrammarParser;
+
+/*
+ * Arguments: - grammar - query - rule-name (optional, default "mainQ") - action
+ * (optional, default: dot)
+ */
+public class BuildAST {
+  @SuppressWarnings("unchecked")
+  public static void main(String[] args) throws Exception {
+    String grammar = args[0];
+    String ruleName = "mainQ";
+    String action = "dot";
+
+    if (args.length > 2) {
+      ruleName = args[2];
+    }
+
+    if (args.length > 3) {
+      if (args[3].toLowerCase().equals("dot")) {
+        action = "dot";
+      } else if (args[3].toLowerCase().equals("tree")) {
+        action = "tree";
+      } else {
+        throw new Exception("Unknown argument " + args[3]
+            + ". Allowed actions: dot,tree");
+      }
+    }
+
+    System.err.println("Grammar: " + grammar + " rule:" + ruleName
+        + "\nquery: " + (args.length > 1 ? args[1] : "--"));
+    String input = args.length > 1 ? args[1] : "No input given";
+
+    ANTLRStringStream in = new ANTLRStringStream(input);
+    // Lexer lexer = new StandardLuceneGrammarLexer(in);
+    // CommonTokenStream ts = new CommonTokenStream(lexer);
+
+    // System.err.println(ts.toString());
+
+    // CommonTokenStream tokens = new CommonTokenStream(lexer);
+
+    // StandardLuceneGrammarParser parser = new
+    // StandardLuceneGrammarParser(tokens);
+    // StandardLuceneGrammarParser.mainQ_return returnValue = parser.mainQ();
+    // CommonTree tree = (CommonTree)returnValue.getTree();
+
+    // get the Classes
+    Class clsLexer = Class
+        .forName("org.apache.lucene.queryparser.flexible.aqp.parser." + grammar
+            + "Lexer");
+    Class clsParser = Class
+        .forName("org.apache.lucene.queryparser.flexible.aqp.parser." + grammar
+            + "Parser");
+
+    // insantiate lexer with one parameter
+    Class partypes[] = new Class[1];
+    partypes[0] = CharStream.class;
+    Constructor ctLexer = clsLexer.getConstructor(partypes);
+
+    Object arglist[] = new Object[1];
+    arglist[0] = in;
+    Object iLexer = ctLexer.newInstance(arglist);
+
+    // get tokens
+    CommonTokenStream tokens = new CommonTokenStream(
+        (TokenSource) clsLexer.cast(iLexer));
+
+    // instantiate parser using parameters
+    Class partypes2[] = new Class[1];
+    partypes2[0] = TokenStream.class;
+    Constructor ct = clsParser.getConstructor(partypes2);
+
+    Object arglist2[] = new Object[1];
+    arglist2[0] = tokens;
+    Object iParser = ct.newInstance(arglist2);
+
+    // call the mainQ parser rule
+    Method iParserMainQ = clsParser.getDeclaredMethod(ruleName);
+    Object retVal = iParserMainQ.invoke(iParser);
+    Method getMethod = iParserMainQ.getReturnType().getMethod("getTree");
+    CommonTree tree = (CommonTree) (getMethod.invoke(retVal));
+
+    // print the output
+    if (action.equals("dot")) {
+      DOTTreeGenerator gen = new DOTTreeGenerator();
+      StringTemplate st = gen.toDOT(tree);
+      System.out.println(st);
+    } else if (action.equals("tree")) {
+      System.out.println(tree.toStringTree());
+    }
+  }
+}
Index: lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpExtendedLGSimple.java
===================================================================
--- lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpExtendedLGSimple.java	(revision 0)
+++ lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpExtendedLGSimple.java	(revision 0)
@@ -0,0 +1,55 @@
+package org.apache.lucene.queryparser.flexible.aqp;
+
+import org.apache.lucene.queryparser.flexible.aqp.AqpQueryParser;
+import org.apache.lucene.queryparser.flexible.aqp.builders.AqpNearQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.aqp.builders.AqpQueryTreeBuilder;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpNearQueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardLuceneParser;
+
+/**
+ * This test case is extending {@link TestAqpSLGSimple}
+ * we just use a different grammar
+ * 
+ * Just an example to show how easy it is to add new 
+ * functionality to the parser. 
+ * 
+ *   1. change grammar
+ *   2. add new builders/processors
+ *   
+ * Note: If the ExtendedLuceneGrammar was a separate parser,
+ * it is much better to create its own configuration. See
+ * {@link AqpStandardLuceneParser#init(String)} for details 
+ * 
+ */
+public class TestAqpExtendedLGSimple extends TestAqpSLGSimple {
+
+
+  @Override
+  public void setUp() throws Exception {
+    super.setUp();
+    setGrammarName("ExtendedLuceneGrammar");
+  }
+
+  public void testExtensions() throws Exception {
+
+    AqpQueryParser qp = getParser();
+    ((AqpQueryTreeBuilder) qp.getQueryBuilder()).setBuilder(AqpNearQueryNode.class,	new AqpNearQueryNodeBuilder());
+    
+    assertQueryMatch(qp, "this NEAR that", "field",
+        "spanNear([field:this, field:that], 5, true)");
+
+    assertQueryMatch(qp, "this NEAR3 that", "field",
+    		"spanNear([field:this, field:that], 3, true)");
+    
+    assertQueryMatch(qp, "this NEAR3 (that OR foo*)", "field",
+				"spanNear([field:this, spanOr([field:that, SpanMultiTermQueryWrapper(field:foo*)])], 3, true)");
+
+    
+  }
+
+  // Uniquely for Junit 3
+  public static junit.framework.Test suite() {
+    return new junit.framework.JUnit4TestAdapter(TestAqpExtendedLGSimple.class);
+  }
+
+}
Index: lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/AqpTestAbstractCase.java
===================================================================
--- lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/AqpTestAbstractCase.java	(revision 0)
+++ lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/AqpTestAbstractCase.java	(revision 0)
@@ -0,0 +1,430 @@
+package org.apache.lucene.queryparser.flexible.aqp;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.io.IOException;
+import java.text.DateFormat;
+import java.util.Calendar;
+import java.util.Date;
+import java.util.GregorianCalendar;
+import java.util.Iterator;
+import java.util.Locale;
+import org.apache.lucene.analysis.Analyzer;
+import org.apache.lucene.analysis.core.SimpleAnalyzer;
+import org.apache.lucene.analysis.core.WhitespaceAnalyzer;
+import org.apache.lucene.document.DateTools;
+import org.apache.lucene.document.Document;
+import org.apache.lucene.document.Field;
+import org.apache.lucene.document.StringField;
+import org.apache.lucene.document.TextField;
+import org.apache.lucene.index.IndexWriter;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.QueryParserHelper;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.QueryParserUtil;
+import org.apache.lucene.queryparser.flexible.standard.StandardQueryParser;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler.Operator;
+import org.apache.lucene.queryparser.flexible.standard.processors.StandardQueryNodeProcessorPipeline;
+import org.apache.lucene.queryparser.flexible.aqp.AqpQueryParser;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardLuceneParser;
+import org.apache.lucene.search.BooleanQuery;
+import org.apache.lucene.search.IndexSearcher;
+import org.apache.lucene.search.Query;
+import org.apache.lucene.search.ScoreDoc;
+import org.apache.lucene.util.LuceneTestCase;
+
+/**
+ * This test case is a copy of the core Lucene query parser test, it was adapted
+ * to use new QueryParserHelper instead of the old query parser.
+ * 
+ * Tests QueryParser.
+ */
+public class AqpTestAbstractCase extends LuceneTestCase {
+
+  public int originalMaxClauses;
+  public boolean debugParser = false;
+  protected String grammarName = "StandardLuceneGrammar";
+  protected int noFailures = 0;
+
+  public void setUp() throws Exception {
+    super.setUp();
+    originalMaxClauses = BooleanQuery.getMaxClauseCount();
+  }
+
+  public static void fail(String message) {
+    System.err.println(message);
+    LuceneTestCase.fail(message);
+  }
+
+  public void setDebug(boolean d) {
+    debugParser = d;
+  }
+
+  public void setGrammarName(String name) {
+    grammarName = name;
+  }
+
+  public String getGrammarName() {
+    return grammarName;
+  }
+
+  public AqpQueryParser getParser(Analyzer a) throws Exception {
+    if (a == null)
+      a = new SimpleAnalyzer(TEST_VERSION_CURRENT);
+    AqpQueryParser qp = getParser();
+    qp.setAnalyzer(a);
+    return qp;
+
+  }
+
+  public QueryParserHelper getParser(Analyzer a, boolean standard)
+      throws Exception {
+    if (standard) {
+      StandardQueryParser sp = new StandardQueryParser(a);
+      if (this.debugParser) {
+        sp.setQueryNodeProcessor(new DebuggingQueryNodeProcessorPipeline(sp
+            .getQueryConfigHandler()));
+      }
+      return sp;
+    } else {
+      return getParser(a);
+    }
+  }
+
+  public AqpQueryParser getParser() throws Exception {
+    AqpQueryParser qp = AqpStandardLuceneParser.init(getGrammarName());
+    qp.setDebug(this.debugParser);
+    return qp;
+  }
+
+  public Query getQuery(String query, Analyzer a) throws Exception {
+    return getParser(a).parse(query, "field");
+  }
+
+  public Query getQueryAllowLeadingWildcard(String query, Analyzer a)
+      throws Exception {
+    AqpQueryParser parser = getParser(a);
+    parser.setAllowLeadingWildcard(true);
+    return parser.parse(query, "field");
+  }
+
+  public Query assertQueryEquals(String query, Analyzer a, String result)
+      throws Exception {
+    Query q = getQuery(query, a);
+    String s = q.toString("field");
+    if (!s.equals(result)) {
+      debugFail(q.toString(), result, s);
+    }
+    return q;
+  }
+
+  public Query assertQueryEquals(String query, Analyzer a, String result,
+      Class<?> clazz) throws Exception {
+    Query q = assertQueryEquals(query, a, result);
+    if (!q.getClass().isAssignableFrom(clazz)) {
+      debugFail(q.toString(), result,
+          "Query is not: " + clazz + " but: " + q.getClass());
+    }
+    return q;
+  }
+
+  public void assertQueryEqualsAllowLeadingWildcard(String query, Analyzer a,
+      String result) throws Exception {
+    Query q = getQueryAllowLeadingWildcard(query, a);
+    String s = q.toString("field");
+    if (!s.equals(result)) {
+      fail("Query /" + query + "/ yielded /" + s + "/, expecting /" + result
+          + "/");
+    }
+  }
+
+  public void assertQueryEquals(AqpQueryParser qp, String field, String query,
+      String result) throws Exception {
+    Query q = qp.parse(query, field);
+    String s = q.toString(field);
+    if (!s.equals(result)) {
+      fail("Query /" + query + "/ yielded /" + s + "/, expecting /" + result
+          + "/");
+    }
+  }
+
+  public void assertEscapedQueryEquals(String query, Analyzer a, String result)
+      throws Exception {
+    String escapedQuery = QueryParserUtil.escape(query);
+    if (!escapedQuery.equals(result)) {
+      fail("Query /" + query + "/ yielded /" + escapedQuery + "/, expecting /"
+          + result + "/");
+    }
+  }
+
+  public void assertWildcardQueryEquals(String query, boolean lowercase,
+      String result, boolean allowLeadingWildcard) throws Exception {
+    AqpQueryParser qp = getParser(null);
+    qp.setLowercaseExpandedTerms(lowercase);
+    qp.setAllowLeadingWildcard(allowLeadingWildcard);
+    Query q = qp.parse(query, "field");
+    String s = q.toString("field");
+    if (!s.equals(result)) {
+      fail("WildcardQuery /" + query + "/ yielded /" + s + "/, expecting /"
+          + result + "/");
+    }
+  }
+
+  public void assertWildcardQueryEquals(String query, boolean lowercase,
+      String result) throws Exception {
+    assertWildcardQueryEquals(query, lowercase, result, false);
+  }
+
+  public void assertWildcardQueryEquals(String query, String result)
+      throws Exception {
+    AqpQueryParser qp = getParser(null);
+    Query q = qp.parse(query, "field");
+    String s = q.toString("field");
+    if (!s.equals(result)) {
+      fail("WildcardQuery /" + query + "/ yielded /" + s + "/, expecting /"
+          + result + "/");
+    }
+  }
+
+  public Query getQueryDOA(String query, Analyzer a) throws Exception {
+    if (a == null)
+      a = new SimpleAnalyzer(TEST_VERSION_CURRENT);
+    AqpQueryParser qp = getParser();
+    qp.setAnalyzer(a);
+    qp.setDefaultOperator(Operator.AND);
+
+    return qp.parse(query, "field");
+
+  }
+
+  public void assertQueryEqualsDOA(String query, Analyzer a, String result)
+      throws Exception {
+    Query q = getQueryDOA(query, a);
+    String s = q.toString("field");
+    if (!s.equals(result)) {
+      fail("Query /" + query + "/ yielded /" + s + "/, expecting /" + result
+          + "/");
+    }
+  }
+
+  /** for testing DateTools support */
+  private String getDate(String s, DateTools.Resolution resolution)
+      throws Exception {
+    DateFormat df = DateFormat.getDateInstance(DateFormat.SHORT);
+    return getDate(df.parse(s), resolution);
+  }
+
+  /** for testing DateTools support */
+  private String getDate(Date d, DateTools.Resolution resolution) {
+    return DateTools.dateToString(d, resolution);
+  }
+
+  public String escapeDateString(String s) {
+    if (s.contains(" ")) {
+      return "\"" + s + "\"";
+    } else {
+      return s;
+    }
+  }
+
+  public String getLocalizedDate(int year, int month, int day) {
+    DateFormat df = DateFormat.getDateInstance(DateFormat.SHORT);
+    Calendar calendar = new GregorianCalendar();
+    calendar.clear();
+    calendar.set(year, month, day);
+    calendar.set(Calendar.HOUR_OF_DAY, 23);
+    calendar.set(Calendar.MINUTE, 59);
+    calendar.set(Calendar.SECOND, 59);
+    calendar.set(Calendar.MILLISECOND, 999);
+    return df.format(calendar.getTime());
+  }
+
+  public void assertDateRangeQueryEquals(AqpQueryParser qp, String field,
+      String startDate, String endDate, Date endDateInclusive,
+      DateTools.Resolution resolution) throws Exception {
+    assertQueryEquals(
+        qp,
+        field,
+        field + ":[" + escapeDateString(startDate) + " TO "
+            + escapeDateString(endDate) + "]",
+        "[" + getDate(startDate, resolution) + " TO "
+            + getDate(endDateInclusive, resolution) + "]");
+    assertQueryEquals(
+        qp,
+        field,
+        field + ":{" + escapeDateString(startDate) + " TO "
+            + escapeDateString(endDate) + "}",
+        "{" + getDate(startDate, resolution) + " TO "
+            + getDate(endDate, resolution) + "}");
+  }
+
+  public void assertHits(int expected, String query, IndexSearcher is)
+      throws IOException, QueryNodeException {
+    AqpQueryParser qp;
+    try {
+      qp = getParser();
+    } catch (Exception e) {
+      e.printStackTrace();
+      throw new QueryNodeException(e);
+    }
+    qp.setAnalyzer(new WhitespaceAnalyzer(TEST_VERSION_CURRENT));
+    // qp.setLocale(Locale.ENGLISH);
+    qp.setDateResolution(DateTools.Resolution.DAY);
+
+    Query q = qp.parse(query, "date");
+    ScoreDoc[] hits = is.search(q, null, 1000).scoreDocs;
+    assertEquals(expected, hits.length);
+  }
+
+  public void assertQueryNodeException(String queryString) throws Exception {
+    try {
+      getQuery(queryString, null);
+    } catch (QueryNodeException expected) {
+      return;
+    }
+    debugFail("ParseException expected, not thrown");
+  }
+
+  public void addDateDoc(String content, int year, int month, int day,
+      int hour, int minute, int second, IndexWriter iw) throws IOException {
+    Document d = new Document();
+    d.add(new Field("f", content, TextField.TYPE_STORED));
+    Calendar cal = Calendar.getInstance(Locale.ROOT);
+    cal.set(year, month - 1, day, hour, minute, second);
+    d.add(new Field("date", getDate(cal.getTime(), DateTools.Resolution.DAY),
+        StringField.TYPE_NOT_STORED));
+    iw.addDocument(d);
+  }
+
+  public void assertQueryMatch(AqpQueryParser qp, String queryString,
+      String defaultField, String expectedResult) throws Exception {
+
+    try {
+      Query query = qp.parse(queryString, defaultField);
+      String queryParsed = query.toString();
+
+      if (!queryParsed.equals(expectedResult)) {
+
+        if (this.debugParser) {
+
+          System.out.println("query:\t\t" + queryString);
+
+          if (qp.getDebug() != true) { // it already printed debug
+            qp.setDebug(true);
+            qp.parse(queryString, defaultField);
+            qp.setDebug(false);
+          }
+          System.out.println("");
+          System.out.println("query:\t\t" + queryString);
+          System.out.println("result:\t\t" + queryParsed);
+
+        }
+
+        String msg = "Query /" + queryString + "/ with field: " + defaultField
+            + "/ yielded /" + queryParsed + "/, expecting /" + expectedResult
+            + "/";
+
+        debugFail(queryString, expectedResult, queryParsed);
+
+      } else {
+        if (this.debugParser) {
+          System.out.println("OK \"" + queryString + "\" --->  " + queryParsed);
+        }
+      }
+    } catch (Exception e) {
+      if (this.debugParser) {
+        System.err.println(queryString);
+        e.printStackTrace();
+      } else {
+        throw e;
+      }
+    }
+
+  }
+
+  public void debugFail(String message) {
+    if (this.debugParser) {
+      System.err.println("Number of failures: " + ++noFailures);
+      System.err.println(message);
+    } else {
+      fail(message);
+    }
+  }
+
+  public void debugFail(String query, String expected, String actual) {
+    if (this.debugParser) {
+      System.err.println("Number of failures: " + ++noFailures);
+      System.err.println("query:/" + query + "/ \nexpected:\n" + expected
+          + " \nactual:\n" + actual + "/");
+    } else {
+      assertEquals(expected, actual);
+    }
+  }
+
+  @Override
+  public void tearDown() throws Exception {
+    BooleanQuery.setMaxClauseCount(originalMaxClauses);
+    super.tearDown();
+  }
+
+  class DebuggingQueryNodeProcessorPipeline extends
+      StandardQueryNodeProcessorPipeline {
+    DebuggingQueryNodeProcessorPipeline(QueryConfigHandler queryConfig) {
+      super(queryConfig);
+    }
+
+    public QueryNode process(QueryNode queryTree) throws QueryNodeException {
+      String oldVal = null;
+      String newVal = null;
+
+      oldVal = queryTree.toString();
+      int i = 1;
+      System.out.println("     0. starting");
+      System.out.println("--------------------------------------------");
+      System.out.println(oldVal);
+
+      Iterator<QueryNodeProcessor> it = this.iterator();
+
+      QueryNodeProcessor processor;
+      while (it.hasNext()) {
+        processor = it.next();
+
+        System.out.println("     " + i + ". step "
+            + processor.getClass().toString());
+        queryTree = processor.process(queryTree);
+        newVal = queryTree.toString();
+        System.out.println("     Tree changed: "
+            + (newVal.equals(oldVal) ? "NO" : "YES"));
+        System.out.println("--------------------------------------------");
+        System.out.println(newVal);
+        oldVal = newVal;
+        i += 1;
+      }
+
+      System.out.println("");
+      System.out.println("final result:");
+      System.out.println("--------------------------------------------");
+      System.out.println(queryTree.toString());
+      return queryTree;
+
+    }
+  }
+
+}
Index: lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpSLGSimple.java
===================================================================
--- lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpSLGSimple.java	(revision 0)
+++ lucene/queryparser/src/test/org/apache/lucene/queryparser/flexible/aqp/TestAqpSLGSimple.java	(revision 0)
@@ -0,0 +1,246 @@
+package org.apache.lucene.queryparser.flexible.aqp;
+
+import org.apache.lucene.analysis.core.WhitespaceAnalyzer;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.builders.QueryTreeBuilder;
+import org.apache.lucene.queryparser.flexible.core.nodes.BooleanQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.BoostQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.StandardQueryParser;
+import org.apache.lucene.queryparser.flexible.standard.builders.BooleanQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.BoostQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler.Operator;
+import org.apache.lucene.queryparser.flexible.aqp.AqpQueryParser;
+import org.apache.lucene.search.BooleanClause;
+import org.apache.lucene.search.BooleanQuery;
+import org.apache.lucene.search.Query;
+
+/**
+ * This test case is a copy of the core Lucene query parser test, it was adapted
+ * to use new QueryParserHelper instead of the old query parser.
+ * 
+ * Tests QueryParser.
+ */
+public class TestAqpSLGSimple extends AqpTestAbstractCase {
+
+  private boolean verbose = true;
+
+  private int originalMaxClauses;
+
+  @Override
+  public void setUp() throws Exception {
+    super.setUp();
+    originalMaxClauses = BooleanQuery.getMaxClauseCount();
+    setGrammarName("StandardLuceneGrammar");
+  }
+
+  public void testBooleanQuery() throws Exception {
+
+    WhitespaceAnalyzer analyzer = new WhitespaceAnalyzer(TEST_VERSION_CURRENT);
+
+    AqpQueryParser qp = getParser(analyzer);
+
+    StandardQueryParser sp = (StandardQueryParser) getParser(analyzer, true);
+
+    // DEFAULT OPERATOR IS AND
+    qp.setDefaultOperator(Operator.AND);
+    sp.setDefaultOperator(Operator.AND);
+
+    // test the clause rewriting/optimization
+    Query q = qp.parse("a -(-(+(-(x)^0.6))^0.2)^0.3", "");
+    assertQueryMatch(qp, "a -(-(+(-(x)^0.6))^0.2)^0.3", "", "+a -x^0.3");
+    assertQueryMatch(qp, "-(-(+(-(x)^0.6))^0.2)^0.3", "", "x^0.3"); // not
+                                                                    // minus,
+                                                                    // because
+                                                                    // that is
+                                                                    // not
+                                                                    // allowed
+    assertQueryMatch(qp, "-(-(+(-(x)^0.6))^0.2)^", "", "x"); // because defualt
+                                                             // boost is 1.0f
+    assertQueryMatch(qp, "-(-(+(-(x)^))^0.2)^0.1", "", "x^0.1"); // because
+                                                                 // defualt
+                                                                 // boost is
+                                                                 // 1.0f
+
+    Query qa = sp.parse("kahnn-strauss", "x");
+    Query qb = qp.parse("kahnn-strauss", "x");
+    assertQueryMatch(qp, "kahnn-strauss", "x", qa.toString());
+
+    qa = sp.parse("a \\\"b \\\"c d", "x");
+    qb = qp.parse("a \\\"b \\\"c d", "x");
+    assertQueryMatch(qp, "a \\\"b \\\"c d", "x", qa.toString());
+
+    qa = sp.parse("\"a \\\"b c\\\" d\"", "x");
+    qb = qp.parse("\"a \\\"b c\\\" d\"", "x");
+    assertQueryMatch(qp, "\"a \\\"b c\\\" d\"", "x", qa.toString());
+
+    assertQueryMatch(qp, "+(-(-(-(x)^0.6))^0.2)^", "field", "field:x");
+    assertQueryMatch(qp, "+(-(-(-(x)^0.6))^0.2)^0.5", "field", "field:x^0.5");
+
+    // the first element will be positive, because the negative X NOT Y
+    // is currently implemented that way (the first must return something)
+    // TODO: this should be:
+    // "((+field:a +field:b)^0.8) -((+field:x +field:y)^0.2)"
+
+    assertQueryMatch(qp, "(+(-(a b)))^0.8 OR -(x y)^0.2", "field",
+        "+((+field:a +field:b)^0.8) -((+field:x +field:y)^0.2)");
+
+    assertQueryMatch(qp, "(+(-(a b)))^0.8 AND -(x y)^0.2", "field",
+        "+((+field:a +field:b)^0.8) -((+field:x +field:y)^0.2)");
+
+    assertQueryMatch(qp, "(+(-(a b)))^0.8 -(x y)", "field",
+        "+((+field:a +field:b)^0.8) -(+field:x +field:y)");
+    // or does -(x y) have different semantics? ... -field:x -field:y
+    // +((-(+field:a +field:b))^0.8) -field:x -field:y
+
+    assertQueryMatch(qp, "+((+(-(a b)))^0.8)^0.7 OR -(x y)^0.2", "field",
+        "+((+field:a +field:b)^0.7) -((+field:x +field:y)^0.2)");
+
+    assertQueryMatch(qp, "+title:(dog cat)", "field", "+title:dog +title:cat");
+
+    assertQueryMatch(qp, "title:(+dog -cat)", "field", "+title:dog -title:cat");
+
+    assertQueryMatch(qp, "\\*", "field", "field:*");
+
+    assertQueryMatch(qp, "term~", "field", "field:term~2");
+    assertQueryMatch(qp, "term~1", "field", "field:term~1");
+    assertQueryMatch(qp, "term~2", "field", "field:term~2");
+
+    qp.setAllowSlowFuzzy(true);
+    assertQueryMatch(qp, "term~", "field", "field:term~0.5");
+    assertQueryMatch(qp, "term~0.1", "field", "field:term~0.1");
+    assertQueryMatch(qp, "term~0.2", "field", "field:term~0.2");
+    qp.setAllowSlowFuzzy(false);
+
+    assertQueryMatch(qp, "something", "field", "field:something");
+
+    assertQueryMatch(qp, "x:something", "field", "x:something");
+
+    assertQueryMatch(qp, "x:\"something else\"", "field",
+        "x:\"something else\"");
+
+    assertQueryMatch(qp, "x:\"someth*\"", "field", "x:someth*");
+
+    assertQueryMatch(qp, "x:\"someth?ng\"", "field", "x:someth?ng");
+
+    assertQueryMatch(qp, "A AND B C AND D", "field",
+        "+field:A +field:B +field:C +field:D");
+
+    assertQueryMatch(qp, "A AND B C AND D OR E", "field",
+        "+(+field:A +field:B) +((+field:C +field:D) field:E)");
+
+    assertQueryMatch(qp, "one OR +two", "f", "f:one +f:two");
+
+    assertQueryMatch(qp, "one OR two NOT three", "field",
+        "field:one (+field:two -field:three)");
+
+    assertQueryMatch(qp, "one OR (two AND three) NOT four", "field",
+        "field:one (+(+field:two +field:three) -field:four)");
+
+    assertQueryMatch(qp, "-one -two", "field", "-field:one -field:two");
+
+    assertQueryMatch(qp, "x:one NOT y:two -three^0.5", "field",
+        "+(+x:one -y:two) -field:three^0.5");
+
+    qp.setAllowSlowFuzzy(true);
+    assertQueryMatch(qp, "one NOT two -three~0.2", "field",
+        "+(+field:one -field:two) -field:three~0.2");
+
+    assertQueryMatch(qp, "one NOT two NOT three~0.2", "field",
+        "+field:one -field:two -field:three~0.2");
+
+    assertQueryMatch(qp, "one two^0.5 three~0.2", "field",
+        "+field:one +field:two^0.5 +field:three~0.2");
+    qp.setAllowSlowFuzzy(false);
+
+    assertQueryMatch(qp, "one NOT two -three~0.2", "field",
+        "+(+field:one -field:two) -field:three~2");
+
+    assertQueryMatch(qp, "one NOT two NOT three~0.2", "field",
+        "+field:one -field:two -field:three~2");
+
+    assertQueryMatch(qp, "one two^0.5 three~0.2", "field",
+        "+field:one +field:two^0.5 +field:three~2");
+
+    q = qp.parse("one (two three)^0.8", "field");
+    
+    // I know where the problem is: builder does not have access
+    // to the config, so that when a default operator is changed
+    // *after* the parser was instantiated, the builder behaves
+    // the old way(s) -- this is a bigger problem, and I didn't 
+    // want to change the flex parser API
+    
+    ((QueryTreeBuilder) qp.getQueryBuilder()).setBuilder(BooleanQueryNode.class, new BooleanQueryNodeBuilder(BooleanClause.Occur.MUST));
+    
+    qa = qp.parse("one (two three)^0.8", "field");
+    assertQueryMatch(qp, "one (two three)^0.8", "field",
+        "+field:one +((+field:two +field:three)^0.8)");
+
+    assertQueryMatch(qp, "one (x:two three)^0.8", "field",
+        "+field:one +((+x:two +field:three)^0.8)");
+    
+    // TODO: the original value was -((+one:two +one:three)^0.8)
+    // but that is not a valid Lucene query (or is it?)
+    assertQueryMatch(qp, "-one:(two three)^0.8", "field",
+        "(+one:two +one:three)^0.8");
+
+    
+    assertQueryMatch(qp, "one:(two three)^0.8", "field",
+        "(+one:two +one:three)^0.8");
+
+    assertQueryMatch(qp, "+one:(two three)^0.8", "field",
+        "(+one:two +one:three)^0.8");
+
+    assertQueryMatch(qp, "[one TO five]", "field", "field:[one TO five]");
+
+    assertQueryMatch(qp, "z:[one TO five]", "field", "z:[one TO five]");
+
+    assertQueryMatch(qp, "{one TO five}", "field", "field:{one TO five}");
+
+    assertQueryMatch(qp, "z:{one TO five}", "field", "z:{one TO five}");
+
+    assertQueryMatch(qp, "z:{\"one\" TO \"five\"}", "field", "z:{one TO five}");
+
+    assertQueryMatch(qp, "z:{one TO *}", "field", "z:{one TO *}");
+
+    assertQueryMatch(qp, "this +(that)", "field", "+field:this +field:that");
+
+    assertQueryMatch(qp, "(this) (that)", "field", "+field:this +field:that");
+
+    assertQueryMatch(qp, "this ((((+(that))))) ", "field",
+        "+field:this +field:that");
+
+    assertQueryMatch(qp, "this (+(that)^0.7)", "field",
+        "+field:this +field:that^0.7");
+
+    assertQueryMatch(qp, "this (+(that thus)^0.7)", "field",
+        "+field:this +((+field:that +field:thus)^0.7)");
+
+    assertQueryMatch(qp, "this (-(+(that thus))^0.7)", "field",
+        "+field:this -((+field:that +field:thus)^0.7)");
+
+    assertQueryMatch(qp, "this (+(-(+(-(that thus))^0.1))^0.3)", "field",
+        "+field:this +((+field:that +field:thus)^0.3)");
+
+    BooleanQuery.setMaxClauseCount(2);
+    try {
+      qp = getParser(new WhitespaceAnalyzer(TEST_VERSION_CURRENT));
+
+      qp.parse("one two three", "field");
+      fail("ParseException expected due to too many boolean clauses");
+    } catch (QueryNodeException expected) {
+      // too many boolean clauses, so ParseException is expected
+    }
+    
+    assertQueryMatch(qp, "*:*", "field", "*:*");
+    qp.setAllowLeadingWildcard(true);
+    assertQueryMatch(qp, "*", "field", "field:*");
+    assertQueryMatch(qp, "field:*", "field", "field:*");
+    
+  }
+
+  // Uniquely for Junit 3
+  public static junit.framework.Test suite() {
+    return new junit.framework.JUnit4TestAdapter(TestAqpSLGSimple.class);
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/BooleanQueryNodeBuilder.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/BooleanQueryNodeBuilder.java	(revision 1484512)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/BooleanQueryNodeBuilder.java	(working copy)
@@ -40,14 +40,26 @@
  * <br/>
  * It takes in consideration if the children is a {@link ModifierQueryNode} to
  * define the {@link BooleanClause}.
+ * 
+ * TODO: this class is an example why also builders should have access to the
+ * parser configuration. Because we should not decide for the user what is the
+ * default modifier. I am solving it by passing the parameter, but that is less
+ * than optimal solution.
+ * 
  */
 public class BooleanQueryNodeBuilder implements StandardQueryBuilder {
 
+  private BooleanClause.Occur defaultModifier;
+  
+  
   public BooleanQueryNodeBuilder() {
-    // empty constructor
+    defaultModifier = BooleanClause.Occur.SHOULD;
+  }
+  
+  public BooleanQueryNodeBuilder(BooleanClause.Occur defaultModifier) {
+    this.defaultModifier = defaultModifier;
   }
 
-  @Override
   public BooleanQuery build(QueryNode queryNode) throws QueryNodeException {
     BooleanQueryNode booleanNode = (BooleanQueryNode) queryNode;
 
@@ -84,7 +96,7 @@
 
   }
 
-  private static BooleanClause.Occur getModifierValue(QueryNode node) {
+  private BooleanClause.Occur getModifierValue(QueryNode node) {
 
     if (node instanceof ModifierQueryNode) {
       ModifierQueryNode mNode = ((ModifierQueryNode) node);
@@ -103,7 +115,7 @@
 
     }
 
-    return BooleanClause.Occur.SHOULD;
+    return defaultModifier;
 
   }
 
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/AqpSyntaxParser.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/AqpSyntaxParser.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/AqpSyntaxParser.java	(revision 0)
@@ -0,0 +1,40 @@
+package org.apache.lucene.queryparser.flexible.aqp;
+
+import org.antlr.runtime.TokenStream;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeParseException;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.parser.SyntaxParser;
+
+public interface AqpSyntaxParser extends SyntaxParser {
+  /**
+   * @param grammarName
+   *          - the name of the query
+   * @throws Exception
+   *           - there are different implementations (should we want different
+   *           interfaces?) some may be loading grammars on the fly, others will
+   *           load grammars directly
+   * 
+   * @return AqpSyntaxParser
+   */
+  public AqpSyntaxParser initializeGrammar(String grammarName)
+      throws QueryNodeParseException;
+
+  /**
+   * This method should return the stream of tokens, it can be used to modify
+   * the original query before it gets executed
+   * 
+   * @param input
+   *          - original query
+   * @return TokenStream 
+   *          - (un)modified stream of tokens
+   * @throws QueryNodeParseException
+   */
+  public TokenStream getTokenStream(CharSequence input)
+      throws QueryNodeParseException;
+
+  public QueryNode parseTokenStream(TokenStream tokens, CharSequence query,
+      CharSequence field) throws QueryNodeParseException;
+
+  public QueryNode parse(CharSequence query, CharSequence field)
+      throws QueryNodeParseException;
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedbackImpl.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedbackImpl.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedbackImpl.java	(revision 0)
@@ -0,0 +1,68 @@
+package org.apache.lucene.queryparser.flexible.aqp.config;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.util.ArrayList;
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.util.AttributeImpl;
+import org.apache.lucene.queryparser.flexible.aqp.config.AqpFeedbackEventHandler.ACTION;
+
+public class AqpFeedbackImpl extends AttributeImpl implements AqpFeedback {
+
+  private static final long serialVersionUID = 5178148416076100953L;
+
+  private List<AqpFeedbackEvent> events = new ArrayList<AqpFeedbackEvent>();
+  private List<AqpFeedbackEventHandler> handlers = new ArrayList<AqpFeedbackEventHandler>();
+
+  @Override
+  public void clear() {
+    events.clear();
+  }
+
+  @Override
+  public void copyTo(AttributeImpl target) {
+    throw new UnsupportedOperationException();
+  }
+
+  public void registerEventHandler(AqpFeedbackEventHandler handler) {
+    handlers.add(handler);
+  }
+
+  public AqpFeedbackEvent createEvent(TYPE level,
+      Class<? extends QueryNodeProcessor> qnClass, QueryNode node, String msg,
+      Object... args) {
+    return new AqpFeedbackEventImpl(level, qnClass, node, msg, args);
+  }
+
+  public void sendEvent(AqpFeedbackEvent event) {
+    for (AqpFeedbackEventHandler handler : handlers) {
+      ACTION r = handler.handle(event);
+      if (r == ACTION.STOP) {
+        return;
+      } else if (r == ACTION.SAVE_EVENT) {
+        if (!events.contains(event)) {
+          events.add(event);
+        }
+      }
+    }
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedbackEvent.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedbackEvent.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedbackEvent.java	(revision 0)
@@ -0,0 +1,19 @@
+package org.apache.lucene.queryparser.flexible.aqp.config;
+
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.util.Attribute;
+
+public interface AqpFeedbackEvent extends Attribute {
+
+  public AqpFeedback.TYPE getType();
+
+  public Class<? extends QueryNodeProcessor> getCaller();
+
+  public QueryNode getNode();
+
+  public String getMessage();
+
+  public Object[] getArgs();
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedbackEventImpl.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedbackEventImpl.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedbackEventImpl.java	(revision 0)
@@ -0,0 +1,46 @@
+package org.apache.lucene.queryparser.flexible.aqp.config;
+
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.config.AqpFeedback.TYPE;
+
+public class AqpFeedbackEventImpl implements AqpFeedbackEvent {
+
+  private AqpFeedback.TYPE type = null;
+  private Class<? extends QueryNodeProcessor> caller = null;
+  private QueryNode node = null;
+  private String message = null;
+  private Object[] args = null;
+
+  AqpFeedbackEventImpl(AqpFeedback.TYPE type,
+      Class<? extends QueryNodeProcessor> processorClass, QueryNode node,
+      String message, Object... args) {
+
+    this.type = type;
+    this.caller = processorClass;
+    this.node = node;
+    this.message = message;
+    this.args = args;
+
+  }
+
+  public TYPE getType() {
+    return type;
+  }
+
+  public Class<? extends QueryNodeProcessor> getCaller() {
+    return caller;
+  }
+
+  public QueryNode getNode() {
+    return node;
+  }
+
+  public String getMessage() {
+    return message;
+  }
+
+  public Object[] getArgs() {
+    return args;
+  }
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedbackEventHandler.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedbackEventHandler.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedbackEventHandler.java	(revision 0)
@@ -0,0 +1,21 @@
+package org.apache.lucene.queryparser.flexible.aqp.config;
+
+import org.apache.lucene.queryparser.flexible.aqp.config.AqpFeedbackEvent;
+
+public interface AqpFeedbackEventHandler {
+
+  public enum ACTION {
+    STOP, SAVE_EVENT
+  };
+
+  /**
+   * Handles the {@link AqpFeedbackEvent}
+   * 
+   * If it returns false, the next registered event handler will not get a
+   * chance to handle the event.
+   * 
+   * @param event
+   * @return
+   */
+  public ACTION handle(AqpFeedbackEvent event);
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedback.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedback.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/config/AqpFeedback.java	(revision 0)
@@ -0,0 +1,48 @@
+package org.apache.lucene.queryparser.flexible.aqp.config;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.util.Attribute;
+
+/**
+ * This attribute is used to collect feedback messages and suggestions from the
+ * query parser
+ * 
+ * WARNING: experimental, may change soon!
+ */
+public interface AqpFeedback extends Attribute {
+
+  public enum TYPE {
+    DEBUG, INFO, WARN, ERROR, SYNTAX_SUGGESTION, DEPRECATED
+  };
+
+  /*
+   * I am NOT trying to re-implement a wheel, I am just confused what is the
+   * proper way to wrap SLF4J used by SOLR (but not by Lucene) and not introduce
+   * it as a dependency to Lucene
+   */
+  public AqpFeedbackEvent createEvent(TYPE level,
+      Class<? extends QueryNodeProcessor> qnClass, QueryNode node, String msg,
+      Object... args);
+
+  public void sendEvent(AqpFeedbackEvent event);
+
+  public void registerEventHandler(AqpFeedbackEventHandler handler);
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpNearQueryNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpNearQueryNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpNearQueryNode.java	(revision 0)
@@ -0,0 +1,89 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+import java.util.List;
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpOPERATORProcessor;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeError;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNodeImpl;
+import org.apache.lucene.queryparser.flexible.core.parser.EscapeQuerySyntax;
+
+/**
+ *  For nodes connected through proximity operators, eg.
+ *  
+ *   <pre>
+ *   foo NEAR bar
+ *   </pre>
+ *   
+ *  @see AqpOPERATORProcessor
+ *
+ */
+public class AqpNearQueryNode extends QueryNodeImpl implements QueryNode {
+
+  private static final long serialVersionUID = 8806759327487974314L;
+  private Integer slop = null;
+  private boolean inOrder = true;
+
+  public AqpNearQueryNode(List<QueryNode> children, int proximity) {
+    if (children == null) {
+      throw new QueryNodeError(
+          new MessageImpl(QueryParserMessages.PARAMETER_VALUE_NOT_SUPPORTED,
+              "children", "null"));
+    }
+    allocate();
+    setLeaf(false);
+    add(children);
+    this.slop = proximity;
+  }
+
+  public CharSequence toQueryString(EscapeQuerySyntax escapeSyntaxParser) {
+    if (getChild() == null)
+      return "";
+
+    String leftParenthensis = "";
+    String rightParenthensis = "";
+
+    if (getChild() != null && getChild() instanceof AqpNearQueryNode) {
+      leftParenthensis = "(";
+      rightParenthensis = ")";
+    }
+
+    return leftParenthensis + "#"
+        + getChild().toQueryString(escapeSyntaxParser) + rightParenthensis;
+
+  }
+
+  public String toString() {
+    StringBuffer bo = new StringBuffer();
+    bo.append("<near slop=\"");
+    bo.append(slop);
+    bo.append("\">\n");
+    for (QueryNode child : this.getChildren()) {
+      bo.append(child.toString());
+      bo.append("\n");
+    }
+    bo.append("\n</near>");
+    return bo.toString();
+  }
+
+  public QueryNode getChild() {
+    return getChildren().get(0);
+  }
+
+  public Integer getSlop() {
+    return slop;
+  }
+
+  public void setSlop(Integer prox) {
+    slop = prox;
+  }
+
+  public boolean getInOrder() {
+    return inOrder;
+  }
+
+  public void setInOrder(boolean order) {
+    inOrder = order;
+  }
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpAnalyzedQueryNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpAnalyzedQueryNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpAnalyzedQueryNode.java	(revision 0)
@@ -0,0 +1,63 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpAnalyzerQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNodeImpl;
+import org.apache.lucene.queryparser.flexible.core.parser.EscapeQuerySyntax;
+
+/**
+ * A {@link NonAnalyzedQueryNode} represents a query that was already be
+ * processed by an analyzer. The child (typically only one) is the result of a
+ * call to another analyzer.
+ * 
+ * @see AqpAnalyzerQueryNodeProcessor
+ */
+public class AqpAnalyzedQueryNode extends QueryNodeImpl {
+
+  /**
+   * @param node
+   *          - query node
+   */
+  public AqpAnalyzedQueryNode(QueryNode node) {
+    allocate();
+    setLeaf(false);
+    this.add(node);
+  }
+
+  @Override
+  public String toString() {
+    return "<analyzed>" + this.getChild() + "</analyzed>";
+  }
+
+  @Override
+  public AqpAnalyzedQueryNode cloneTree() throws CloneNotSupportedException {
+    AqpAnalyzedQueryNode clone = (AqpAnalyzedQueryNode) super.cloneTree();
+    // nothing to do here
+    return clone;
+  }
+
+  public CharSequence toQueryString(EscapeQuerySyntax escapeSyntaxParser) {
+    return this.getChildren().get(0).toQueryString(escapeSyntaxParser);
+  }
+
+  public QueryNode getChild() {
+    return this.getChildren().get(0);
+  }
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpAdsabsRegexQueryNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpAdsabsRegexQueryNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpAdsabsRegexQueryNode.java	(revision 0)
@@ -0,0 +1,41 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+import org.apache.lucene.queryparser.flexible.aqp.builders.AqpFieldQueryNodeRegexBuilder;
+import org.apache.lucene.queryparser.flexible.core.builders.QueryTreeBuilder;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.search.RegexpQuery;
+
+/**
+ * This node will be turned into the {@link RegexpQuery} by 
+ * {@link AqpFieldQueryNodeRegexBuilder}. But the appropriate 
+ * builder must be configured. 
+ * 
+ * @see instances of {@link QueryTreeBuilder}
+ *
+ */
+public class AqpAdsabsRegexQueryNode extends AqpNonAnalyzedQueryNode {
+
+  public AqpAdsabsRegexQueryNode(CharSequence field, CharSequence text,
+      int begin, int end) {
+    super(field, text, begin, end);
+  }
+
+  public AqpAdsabsRegexQueryNode(FieldQueryNode fqn) {
+    this(fqn.getField(), fqn.getText(), fqn.getBegin(), fqn.getEnd());
+  }
+
+  @Override
+  public String toString() {
+    return "<regex field='" + this.field + "' term='" + this.text + "'/>";
+  }
+
+  @Override
+  public AqpAdsabsRegexQueryNode cloneTree() throws CloneNotSupportedException {
+    AqpAdsabsRegexQueryNode clone = (AqpAdsabsRegexQueryNode) super.cloneTree();
+
+    // nothing to do here
+
+    return clone;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpDisjunctionQueryNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpDisjunctionQueryNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpDisjunctionQueryNode.java	(revision 0)
@@ -0,0 +1,68 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeError;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNodeImpl;
+import org.apache.lucene.queryparser.flexible.core.parser.EscapeQuerySyntax;
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+
+public class AqpDisjunctionQueryNode extends QueryNodeImpl {
+
+  private Float tieBreaker = null;
+
+  public AqpDisjunctionQueryNode(List<QueryNode> children, float tieBreaker) {
+    if (children == null) {
+      throw new QueryNodeError(
+          new MessageImpl(QueryParserMessages.PARAMETER_VALUE_NOT_SUPPORTED,
+              "children", "null"));
+    }
+    allocate();
+    setLeaf(false);
+    add(children);
+    this.tieBreaker = tieBreaker;
+  }
+
+  public CharSequence toQueryString(EscapeQuerySyntax escapeSyntaxParser) {
+    if (getChildren().size() == 0)
+      return "";
+
+    StringBuilder sb = new StringBuilder();
+    sb.append("(");
+    boolean notFirst = false;
+    for (QueryNode child : getChildren()) {
+      if (notFirst) {
+        sb.append(" | ");
+      }
+      sb.append(child.toQueryString(escapeSyntaxParser));
+      notFirst = true;
+    }
+    sb.append(")");
+    return sb.toString();
+
+  }
+
+  public String toString() {
+    StringBuffer bo = new StringBuffer();
+    bo.append("<disjunction tieBreaker=\"");
+    bo.append(tieBreaker);
+    bo.append("\">\n");
+    for (QueryNode child : this.getChildren()) {
+      bo.append(child.toString());
+      bo.append("\n");
+    }
+    bo.append("\n</disjunction>");
+    return bo.toString();
+  }
+
+  public Float getTieBreaker() {
+    return tieBreaker;
+  }
+
+  public void setTieBreaker(Float tieBreaker) {
+    this.tieBreaker = tieBreaker;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/SlowFuzzyQueryNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/SlowFuzzyQueryNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/SlowFuzzyQueryNode.java	(revision 0)
@@ -0,0 +1,18 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+import org.apache.lucene.queryparser.flexible.core.nodes.FuzzyQueryNode;
+
+/**
+ * Exactly the same as FuzzyQueryNode but it will be transformed into a
+ * SlowFuzzyQuery
+ * 
+ * 
+ */
+public class SlowFuzzyQueryNode extends FuzzyQueryNode {
+
+  public SlowFuzzyQueryNode(CharSequence field, CharSequence term,
+      float minSimilarity, int begin, int end) {
+    super(field, term, minSimilarity, begin, end);
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpANTLRNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpANTLRNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpANTLRNode.java	(revision 0)
@@ -0,0 +1,249 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import org.antlr.runtime.CommonToken;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNodeImpl;
+import org.apache.lucene.queryparser.flexible.core.parser.EscapeQuerySyntax;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpCommonTree;
+
+/**
+ * When Aqp parser starts processing the AST (abstract syntax tree)
+ * every node in the tree is made of {@link AqpANTLRNode} and it wraps
+ * the {@link AqpCommonTree} through which you can access information
+ * about the string, its position, type etc... these are courtesy of 
+ * ANTLR.
+ * 
+ * We provide a few utility methods for setting different attributes
+ * of the original ANTLR object.
+ *
+ */
+public class AqpANTLRNode extends QueryNodeImpl {
+
+  private static final long serialVersionUID = 5128762709928473351L;
+
+  private AqpCommonTree tree;
+
+  private int tokenType;
+
+  private String tokenLabel;
+
+  private String tokenName;
+
+  private String tokenInput = null;
+
+  /**
+   * @param node
+   *          - AST node
+   */
+  public AqpANTLRNode(AqpCommonTree node) {
+
+    tree = node;
+    String input = node.getTokenInput();
+
+    if (input != null) {
+      setTokenInput(input);
+    }
+
+    setTokenLabel(node.getTokenLabel());
+
+    setTokenType(node.getTokenType());
+
+    setTokenName(node.getTypeLabel());
+
+    if (node.getChildCount() > 0) {
+      setLeaf(false);
+      allocate();
+    }
+  }
+
+  public CharSequence toQueryString(EscapeQuerySyntax escaper) {
+    if (getTokenInput() != null) {
+      return "(" + getTokenLabel() + ":" + getTokenInput() + ")";
+    } else {
+      return getTokenLabel();
+    }
+  }
+
+  public String toStringNodeOnly() {
+    if (getTokenInput() != null) {
+      return "<ast" + getTokenName() + " value=\"" + getTokenInput()
+          + "\" start=\"" + getTokenStart() + "\" end=\"" + getTokenEnd()
+          + "\" />";
+    } else {
+      return "<ast" + getTokenName() + " type=\"" + getTokenLabel() + "\" />";
+    }
+  }
+
+  public String toString() {
+    return toString(0);
+  }
+
+  public String toString(int level) {
+    StringBuffer buf = new StringBuffer();
+    buf.append("\n");
+    for (int i = 0; i < level; i++) {
+      buf.append(" ");
+    }
+
+    buf.append("<ast" + getTokenName() + " ");
+
+    if (getTokenInput() != null) {
+      buf.append("value=\"" + getTokenInput() + "\" start=\"" + getTokenStart()
+          + "\" end=\"" + getTokenEnd() + "\"");
+    } else {
+      buf.append("label=\"" + getTokenLabel() + "\"");
+    }
+    buf.append(" name=\"" + getTokenName() + "\"" + " type=\"" + getTokenType()
+        + "\" ");
+
+    List<QueryNode> children = this.getChildren();
+
+    if (children != null) {
+      buf.append(">");
+      for (QueryNode child : children) {
+        if (child instanceof AqpANTLRNode) {
+          buf.append(((AqpANTLRNode) child).toString(level + 4));
+        } else {
+          buf.append(child.toString());
+        }
+      }
+    }
+
+    if (isLeaf()) {
+      buf.append("/>");
+    } else {
+      buf.append("\n");
+      for (int i = 0; i < level; i++) {
+        buf.append(" ");
+      }
+      buf.append("</ast" + getTokenName() + ">");
+    }
+
+    return buf.toString();
+  }
+
+  public int getTokenType() {
+    return tokenType;
+  }
+
+  public void setTokenType(int tokenType) {
+    this.tokenType = tokenType;
+  }
+
+  /**
+   * Label is what is displayed in the AST tree, for example and, And, AND will
+   * all have label=AND
+   * 
+   * (But their internal name is an 'OPERATOR')
+   * 
+   * @return
+   */
+  public String getTokenLabel() {
+    return tokenLabel;
+  }
+
+  public void setTokenLabel(String tokenLabel) {
+    this.tokenLabel = tokenLabel;
+  }
+
+  public String getTokenName() {
+    return tokenName;
+  }
+
+  /**
+   * Name is the name of the group, ie. 'AND' is an OPERATOR (but its label
+   * says: 'AND')
+   * 
+   * @param tokenName
+   */
+  public void setTokenName(String tokenName) {
+    this.tokenName = tokenName;
+  }
+
+  public String getTokenInput() {
+    return tokenInput;
+  }
+
+  public void setTokenInput(String tokenInput) {
+    this.tokenInput = tokenInput;
+  }
+
+  public int getTokenStart() {
+    return tree.getStartIndex();
+  }
+
+  public int getTokenEnd() {
+    return tree.getStopIndex();
+  }
+
+  public AqpCommonTree getTree() {
+    return tree;
+  }
+
+  public int getInputTokenStart() {
+    return ((CommonToken) tree.getToken()).getCharPositionInLine();// getStartIndex();
+  }
+
+  public int getInputTokenEnd() {
+    return ((CommonToken) tree.getToken()).getStopIndex();
+  }
+
+  public void setInputTokenEnd(int stop) {
+    ((CommonToken) tree.getToken()).setStopIndex(stop);
+  }
+
+  public void setInputTokenStart(int start) {
+    ((CommonToken) tree.getToken()).setStartIndex(start);
+  }
+
+  public AqpANTLRNode getChild(String tokenLabel) {
+    List<QueryNode> children = getChildren();
+    if (children != null) {
+      for (QueryNode child : children) {
+        AqpANTLRNode n = (AqpANTLRNode) child;
+        if (n.getTokenLabel().equals(tokenLabel)) {
+          return n;
+        }
+      }
+
+    }
+    return null;
+  }
+
+  public AqpANTLRNode findChild(String tokenLabel) {
+    ArrayList<QueryNode> lst = new ArrayList<QueryNode>();
+    findChild(this, tokenLabel, lst);
+
+    if (lst.size() == 1) {
+      return (AqpANTLRNode) lst.get(0);
+    } else if (lst.size() > 1) {
+      throw new RuntimeException(
+          "This method is not meant to search for n>1 nodes");
+    }
+    return null;
+  }
+
+  private void findChild(QueryNode node, String tokenLabel,
+      ArrayList<QueryNode> lst) {
+    if (((AqpANTLRNode) node).getTokenLabel().equals(tokenLabel)) {
+      lst.add(node);
+    } else {
+      if (!node.isLeaf()) {
+        for (QueryNode child : node.getChildren()) {
+          findChild(child, tokenLabel, lst);
+        }
+      }
+    }
+  }
+
+  public Float getTokenInputFloat() {
+    if (this.tokenInput != null) {
+      return Float.valueOf(this.tokenInput);
+    }
+    return null;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpDefopQueryNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpDefopQueryNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpDefopQueryNode.java	(revision 0)
@@ -0,0 +1,67 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode.Modifier;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler;
+
+/**
+ * A {@link AqpDefopQueryNode} represents the default boolean operation
+ * performed on a list of nodes.
+ * 
+ * This behaves the same way as any AqpBooleanQueryNode but we have the
+ * advantage of knowing which tokens were marked by the DEFOP operator and later
+ * on we can look at them and process specially (in the logic that explicit AND
+ * is stronger than implicit AND)
+ * 
+ * @see AqpBooleanQueryNode
+ * @see StandardQueryConfigHandler.Operator
+ */
+public class AqpDefopQueryNode extends AqpBooleanQueryNode {
+
+  /**
+   * @param clauses
+   *          - the query nodes to be joined
+   */
+  public AqpDefopQueryNode(List<QueryNode> clauses,
+      StandardQueryConfigHandler.Operator op) {
+    super(clauses);
+
+    if ((clauses == null) || (clauses.size() == 0)) {
+      throw new IllegalArgumentException(
+          "DEFOP query must have at least one clause");
+    }
+
+    if (op.equals(StandardQueryConfigHandler.Operator.AND)) {
+      operator = "AND";
+      applyModifier(clauses, Modifier.MOD_REQ);
+    } else if (op.equals(StandardQueryConfigHandler.Operator.OR)) {
+      operator = "OR";
+      applyModifier(clauses, Modifier.MOD_NONE);
+    }
+
+    // unfortunately we have to do it like this (when subclassing from
+    // BooleanQueryNode)
+    set(clauses);
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpBooleanQueryNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpBooleanQueryNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpBooleanQueryNode.java	(revision 0)
@@ -0,0 +1,114 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.nodes.BooleanQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.GroupQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode.Modifier;
+import org.apache.lucene.queryparser.flexible.core.parser.EscapeQuerySyntax;
+
+/**
+ * A {@link AqpBooleanQueryNode} represents base boolean operation performed on
+ * a list of nodes. It will apply the @{link ModifierQueryNode} to the clauses.
+ * The normal behaviour is not to override the ModifierQueryNode values, if
+ * already present.
+ */
+public class AqpBooleanQueryNode extends BooleanQueryNode {
+
+  private static final long serialVersionUID = -5974910790857168198L;
+
+  protected String operator = "DEFOP";
+  protected boolean overrideModifiers = false;
+
+  /**
+   * @param clauses
+   *          - the query nodes to be op'ed
+   */
+  public AqpBooleanQueryNode(List<QueryNode> clauses) {
+    super(clauses);
+
+  }
+
+  @Override
+  public String toString() {
+    if (getChildren() == null || getChildren().size() == 0)
+      return "<boolean operation='" + operator + "'/>";
+    StringBuilder sb = new StringBuilder();
+    sb.append("<boolean operation='" + operator + "'>");
+    for (QueryNode child : getChildren()) {
+      sb.append("\n");
+      sb.append(child.toString());
+
+    }
+    sb.append("\n</boolean>");
+    return sb.toString();
+  }
+
+  @Override
+  public CharSequence toQueryString(EscapeQuerySyntax escapeSyntaxParser) {
+    if (getChildren() == null || getChildren().size() == 0)
+      return "";
+
+    StringBuilder sb = new StringBuilder();
+    String filler = "";
+    for (QueryNode child : getChildren()) {
+      sb.append(filler).append(child.toQueryString(escapeSyntaxParser));
+      filler = " " + operator + " ";
+    }
+
+    // in case is root or the parent is a group node avoid parenthesis
+    if ((getParent() != null && getParent() instanceof GroupQueryNode)
+        || isRoot())
+      return sb.toString();
+    else
+      return "( " + sb.toString() + " )";
+  }
+
+  public void applyModifier(List<QueryNode> clauses, Modifier mod) {
+    for (int i = 0; i < clauses.size(); i++) {
+      QueryNode child = clauses.get(i);
+
+      if (child instanceof ModifierQueryNode || child instanceof GroupQueryNode) {
+        if (overrideModifiers) {
+          clauses
+              .set(i,
+                  new ModifierQueryNode(((ModifierQueryNode) child).getChild(),
+                      mod));
+        }
+      } else {
+        clauses.set(i, new ModifierQueryNode(child, mod));
+      }
+    }
+  }
+
+  public void setOverrideModifiers(boolean val) {
+    this.overrideModifiers = val;
+  }
+
+  public void setOperator(String op) {
+    operator = op;
+  }
+
+  public String getOperator() {
+    return operator;
+  }
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpOrQueryNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpOrQueryNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpOrQueryNode.java	(revision 0)
@@ -0,0 +1,51 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+
+/**
+ * A {@link AqpOrQueryNode} represents an OR boolean operation performed on a
+ * list of nodes.
+ * 
+ * @see AqpBooleanQueryNode
+ */
+public class AqpOrQueryNode extends AqpBooleanQueryNode {
+
+  private static final long serialVersionUID = 8472252510866053747L;
+
+  /**
+   * @param clauses
+   *          - the query nodes to be or'ed
+   */
+  public AqpOrQueryNode(List<QueryNode> clauses) {
+    super(clauses);
+
+    operator = "OR";
+
+    // applyModifier(clauses, Modifier.MOD_NONE);
+
+    // unfortunately we have to do it like this (when subclassing from
+    // BooleanQueryNode)
+    set(clauses);
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpNotQueryNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpNotQueryNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpNotQueryNode.java	(revision 0)
@@ -0,0 +1,72 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode.Modifier;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+
+/**
+ * A {@link AqpNotQueryNode} represents an NOT boolean operation performed on a
+ * list of nodes.
+ * 
+ * <br/>
+ * 
+ * The first node is set to be required
+ * {@link ModifierQueryNode.Modifier#MOD_REQ} and the rest of the clauses will
+ * have a {@link ModifierQueryNode.Modifier#MOD_NOT}
+ * 
+ * @see AqpBooleanQueryNode
+ */
+public class AqpNotQueryNode extends AqpBooleanQueryNode {
+
+  private static final long serialVersionUID = 4054514488434283069L;
+
+  /**
+   * @param clauses
+   *          - the query nodes to be and'ed
+   */
+  public AqpNotQueryNode(List<QueryNode> clauses) {
+    super(clauses);
+
+    operator = "NOT";
+
+    if ((clauses == null) || (clauses.size() < 2)) {
+      throw new IllegalArgumentException(
+          "NOT query must have at least two clauses");
+    }
+
+    QueryNode firstNode = clauses.get(0);
+    applyModifier(clauses, Modifier.MOD_NOT);
+    // reset the first node (if it was wrapped, ie not already having user
+    // specified MODIFIER)
+    if (!firstNode.equals(clauses.get(0))) {
+      clauses
+          .set(
+              0,
+              new ModifierQueryNode(((ModifierQueryNode) clauses.get(0))
+                  .getChild(), Modifier.MOD_REQ));
+    }
+
+    set(clauses);
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpFuzzyModifierNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpFuzzyModifierNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpFuzzyModifierNode.java	(revision 0)
@@ -0,0 +1,69 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpFuzzyModifierProcessor;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeError;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNodeImpl;
+import org.apache.lucene.queryparser.flexible.core.parser.EscapeQuerySyntax;
+
+/**
+ *  {@link AqpFuzzyModifierNode} is consumed by the {@link AqpFuzzyModifierProcessor}
+ *  which will decide what is the appropriate operation for '~' operator. E.g.
+ *  
+ *  <pre>
+ *  
+ *    "foo bar"~5  == slop query node
+ *    "foo"~5      == fuzzy search for 'foo' 
+ *  </pre>
+ */
+public class AqpFuzzyModifierNode extends QueryNodeImpl implements QueryNode {
+
+  private static final long serialVersionUID = -3059874057254791689L;
+  private Float fuzzy;
+
+  public AqpFuzzyModifierNode(QueryNode query, Float fuzzy) {
+    if (query == null) {
+      throw new QueryNodeError(new MessageImpl(
+          QueryParserMessages.PARAMETER_VALUE_NOT_SUPPORTED, "query", "null"));
+    }
+
+    allocate();
+    setLeaf(false);
+    add(query);
+    this.fuzzy = fuzzy;
+  }
+
+  public CharSequence toQueryString(EscapeQuerySyntax escapeSyntaxParser) {
+    if (getChild() == null)
+      return "";
+
+    String leftParenthensis = "";
+    String rightParenthensis = "";
+
+    if (getChild() != null && getChild() instanceof ModifierQueryNode) {
+      leftParenthensis = "(";
+      rightParenthensis = ")";
+    }
+
+    return leftParenthensis + getChild().toQueryString(escapeSyntaxParser)
+        + rightParenthensis + "~" + this.fuzzy.toString();
+
+  }
+
+  public String toString() {
+    return "<fuzzy value='" + this.fuzzy.toString() + "'>" + "\n"
+        + getChild().toString() + "\n</fuzzy>";
+  }
+
+  public QueryNode getChild() {
+    return getChildren().get(0);
+  }
+
+  public Float getFuzzyValue() {
+    return fuzzy;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpAndQueryNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpAndQueryNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpAndQueryNode.java	(revision 0)
@@ -0,0 +1,57 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode.Modifier;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+
+/**
+ * A {@link AqpAndQueryNode} represents an AND boolean operation performed on a
+ * list of nodes.
+ * 
+ * @see AqpBooleanQueryNode
+ */
+public class AqpAndQueryNode extends AqpBooleanQueryNode {
+
+  private static final long serialVersionUID = -4148186404006404927L;
+
+  /**
+   * @param clauses
+   *          - the query nodes to be and'ed
+   */
+  public AqpAndQueryNode(List<QueryNode> clauses) {
+    super(clauses);
+
+    operator = "AND";
+
+    if ((clauses == null) || (clauses.size() == 0)) {
+      throw new IllegalArgumentException(
+          "AND query must have at least one clause");
+    }
+
+    applyModifier(clauses, Modifier.MOD_REQ);
+
+    // unfortunately we have to do it like this (when subclassing from
+    // BooleanQueryNode)
+    set(clauses);
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpNonAnalyzedQueryNode.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpNonAnalyzedQueryNode.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/nodes/AqpNonAnalyzedQueryNode.java	(revision 0)
@@ -0,0 +1,66 @@
+package org.apache.lucene.queryparser.flexible.aqp.nodes;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QuotedFieldQueryNode;
+
+/**
+ * A {@link NonAnalyzedQueryNode} represents a query that will not be processed
+ * by an analyzer. It will be served to the search engine as it is
+ * 
+ * Example: e(+)
+ */
+public class AqpNonAnalyzedQueryNode extends QuotedFieldQueryNode {
+
+  private static final long serialVersionUID = 6921391439471630844L;
+
+  /**
+   * @param field
+   *          - field name
+   * @param text
+   *          - the query
+   * @param begin
+   *          - position in the query string
+   * @param end
+   *          - position in the query string
+   */
+  public AqpNonAnalyzedQueryNode(CharSequence field, CharSequence text,
+      int begin, int end) {
+    super(field, text, begin, end);
+  }
+
+  public AqpNonAnalyzedQueryNode(FieldQueryNode fqn) {
+    this(fqn.getField(), fqn.getText(), fqn.getBegin(), fqn.getEnd());
+  }
+
+  @Override
+  public String toString() {
+    return "<nonAnalyzed field='" + this.field + "' term='" + this.text + "'/>";
+  }
+
+  @Override
+  public AqpNonAnalyzedQueryNode cloneTree() throws CloneNotSupportedException {
+    AqpNonAnalyzedQueryNode clone = (AqpNonAnalyzedQueryNode) super.cloneTree();
+
+    // nothing to do here
+
+    return clone;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpQueryTreeBuilder.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpQueryTreeBuilder.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpQueryTreeBuilder.java	(revision 0)
@@ -0,0 +1,113 @@
+package org.apache.lucene.queryparser.flexible.aqp.builders;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.builders.QueryBuilder;
+import org.apache.lucene.queryparser.flexible.core.builders.QueryTreeBuilder;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.standard.builders.StandardQueryBuilder;
+import org.apache.lucene.queryparser.flexible.standard.processors.StandardQueryNodeProcessorPipeline;
+import org.apache.lucene.search.Query;
+
+/**
+ * This query tree builder only defines the necessary methods for
+ * debugging. <br/>
+ * 
+ * @see QueryTreeBuilder
+ * @see StandardQueryNodeProcessorPipeline
+ */
+public class AqpQueryTreeBuilder extends QueryTreeBuilder implements
+    StandardQueryBuilder {
+
+  private boolean debug = false;
+  private int counter = 0;
+  
+  public AqpQueryTreeBuilder(boolean debug) {
+    this.setDebug(debug);
+    init();
+  }
+
+  public AqpQueryTreeBuilder() {
+    init();
+  }
+
+  public void setDebug(boolean val) {
+  	if (val != debug) {
+  		debug = val;
+  		init();
+  	}
+  	debug = val;
+  }
+  
+  public boolean isInDebugMode() {
+  	return debug;
+  }
+  
+  public void init() {
+  	throw new IllegalAccessError("AqpQueryTreeBuilder must be subclassed and has the init() method");
+  }
+
+  @Override
+  public Query build(QueryNode queryNode) throws QueryNodeException {
+    this.counter = 0;
+    return (Query) super.build(queryNode);
+  }
+
+
+  public void setBuilder(Class<? extends QueryNode> queryNodeClass,
+      QueryBuilder builder) {
+    if (this.debug) {
+      super.setBuilder(queryNodeClass, new DebuggingNodeBuilder(queryNodeClass,
+          builder));
+    } else {
+      super.setBuilder(queryNodeClass, builder);
+    }
+  }
+
+  class DebuggingNodeBuilder implements QueryBuilder {
+    private Class<? extends QueryNode> clazz = null;
+    private QueryBuilder realBuilder = null;
+
+    DebuggingNodeBuilder(Class<? extends QueryNode> queryNodeClass,
+        QueryBuilder builder) {
+      clazz = queryNodeClass;
+      realBuilder = builder;
+    }
+
+    public Object build(QueryNode queryNode) throws QueryNodeException {
+      System.out.println("--------------------------------------------");
+      System.out.println("step     " + counter++ + ".");
+      System.out.println("builder: " + realBuilder.getClass().getName());
+      System.out.println("node:    " + clazz.getName());
+      System.out.println(queryNode.toString());
+      System.out.println("   -->");
+      Object result = realBuilder.build(queryNode);
+      if (result != null) {
+        System.out.println(((Query) result).toString() + "  <"
+            + result.getClass().getName() + ">");
+      } else {
+        System.out.println("null");
+      }
+      System.out.println("--------------------------------------------");
+      return result;
+    }
+
+  };
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpSlowFuzzyQueryNodeBuilder.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpSlowFuzzyQueryNodeBuilder.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpSlowFuzzyQueryNodeBuilder.java	(revision 0)
@@ -0,0 +1,26 @@
+package org.apache.lucene.queryparser.flexible.aqp.builders;
+
+import org.apache.lucene.index.Term;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.SlowFuzzyQueryNode;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.standard.builders.StandardQueryBuilder;
+import org.apache.lucene.sandbox.queries.SlowFuzzyQuery;
+
+@SuppressWarnings("deprecation")
+public class AqpSlowFuzzyQueryNodeBuilder implements StandardQueryBuilder {
+
+  public AqpSlowFuzzyQueryNodeBuilder() {
+    // empty constructor
+  }
+
+  public SlowFuzzyQuery build(QueryNode queryNode) throws QueryNodeException {
+    SlowFuzzyQueryNode fuzzyNode = (SlowFuzzyQueryNode) queryNode;
+
+    return new SlowFuzzyQuery(new Term(fuzzyNode.getFieldAsString(),
+        fuzzyNode.getTextAsString()), fuzzyNode.getSimilarity(),
+        fuzzyNode.getPrefixLength());
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpFieldQueryNodeRegexBuilder.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpFieldQueryNodeRegexBuilder.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpFieldQueryNodeRegexBuilder.java	(revision 0)
@@ -0,0 +1,26 @@
+package org.apache.lucene.queryparser.flexible.aqp.builders;
+
+import org.apache.lucene.index.Term;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.standard.builders.StandardQueryBuilder;
+import org.apache.lucene.search.Query;
+//import org.apache.lucene.sandbox.queries.regex.RegexQuery;
+import org.apache.lucene.search.RegexpQuery;
+
+public class AqpFieldQueryNodeRegexBuilder implements StandardQueryBuilder {
+
+  public AqpFieldQueryNodeRegexBuilder() {
+    // empty constructor
+  }
+
+  public Query build(QueryNode queryNode) throws QueryNodeException {
+    FieldQueryNode fieldNode = (FieldQueryNode) queryNode;
+
+    return new RegexpQuery(new Term(fieldNode.getFieldAsString(),
+        fieldNode.getTextAsString()));
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpFieldQueryNodeBuilder.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpFieldQueryNodeBuilder.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpFieldQueryNodeBuilder.java	(revision 0)
@@ -0,0 +1,31 @@
+package org.apache.lucene.queryparser.flexible.aqp.builders;
+
+import org.apache.lucene.index.Term;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.standard.builders.StandardQueryBuilder;
+import org.apache.lucene.search.MatchAllDocsQuery;
+import org.apache.lucene.search.Query;
+import org.apache.lucene.search.TermQuery;
+
+public class AqpFieldQueryNodeBuilder implements StandardQueryBuilder {
+
+  public AqpFieldQueryNodeBuilder() {
+    // empty constructor
+  }
+
+  public Query build(QueryNode queryNode) throws QueryNodeException {
+    FieldQueryNode fieldNode = (FieldQueryNode) queryNode;
+
+    if (fieldNode.getFieldAsString().equals("*")
+        && fieldNode.getTextAsString().equals("*")) {
+      return new MatchAllDocsQuery();
+    }
+
+    return new TermQuery(new Term(fieldNode.getFieldAsString(),
+        fieldNode.getTextAsString()));
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpNearQueryNodeBuilder.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpNearQueryNodeBuilder.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/builders/AqpNearQueryNodeBuilder.java	(revision 0)
@@ -0,0 +1,213 @@
+package org.apache.lucene.queryparser.flexible.aqp.builders;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.builders.QueryBuilder;
+import org.apache.lucene.queryparser.flexible.core.builders.QueryTreeBuilder;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpNearQueryNode;
+import org.apache.lucene.search.BooleanClause;
+import org.apache.lucene.search.BooleanClause.Occur;
+import org.apache.lucene.search.BooleanQuery;
+import org.apache.lucene.search.PrefixQuery;
+import org.apache.lucene.search.Query;
+import org.apache.lucene.search.TermQuery;
+import org.apache.lucene.search.WildcardQuery;
+import org.apache.lucene.search.spans.SpanMultiTermQueryWrapper;
+import org.apache.lucene.search.spans.SpanNearQuery;
+import org.apache.lucene.search.spans.SpanNotQuery;
+import org.apache.lucene.search.spans.SpanOrQuery;
+import org.apache.lucene.search.spans.SpanQuery;
+import org.apache.lucene.search.spans.SpanTermQuery;
+
+/**
+ *  The builder for the {@link AqpNearQueryNode}, example query:
+ *  
+ *  <pre>
+ *   dog NEAR/5 cat
+ *  </pre>
+ *  
+ *  <p>
+ *  After the AST tree was parsed, and synonyms were found, 
+ *  we may have the following tree:
+ *  
+ *  <p>
+ *  <pre>
+ *        AqpNearQueryNode(5)
+ *                |
+ *            ------------------------------    
+ *           /                              \
+ *         OR                         QueryNode(cat)
+ *          |
+ *       -----------------   
+ *      /                 \ 
+ *   QueryNode(dog)     QueryNode(canin)
+ *   
+ *  </pre>     
+ *  
+ *  
+ * <p>
+ * Since Lucene cannot handle these queries, the flex builder 
+ * must rewrite them, effectively producing
+ *
+ * <pre>
+ * SpanNear(SpanOr(dog | cat), SpanTerm(cat), 5)
+ * </pre>
+ * 
+ * 
+ * This builder does not know (yet) how to handle cases of
+ * mixed boolean operators, eg.
+ * 
+ * <pre>
+ * (dog AND (cat OR fat)) NEAR/5 batman
+ * </pre>
+ * 
+ * @see QueryNodeProcessorPipeline
+ * @see AqpNearQueryNode
+ *
+ */
+public class AqpNearQueryNodeBuilder implements QueryBuilder {
+
+  public AqpNearQueryNodeBuilder() {
+    // empty constructor
+  }
+
+  public Object build(QueryNode queryNode) throws QueryNodeException {
+    AqpNearQueryNode nearNode = (AqpNearQueryNode) queryNode;
+
+    List<QueryNode> children = nearNode.getChildren();
+
+    if (children != null) {
+      SpanQuery[] clauses = new SpanQuery[children.size()];
+
+      int i = 0;
+      for (QueryNode child : children) {
+        Object obj = child.getTag(QueryTreeBuilder.QUERY_TREE_BUILDER_TAGID);
+        if (obj != null) {
+          clauses[i++] = getSpanQuery(obj, nearNode);
+        } else {
+          throw new QueryNodeException(new MessageImpl(
+              QueryParserMessages.LUCENE_QUERY_CONVERSION_ERROR,
+              "One of the clauses inside AqpNearQueryNode is null"));
+        }
+      }
+
+      return new SpanNearQuery(clauses, nearNode.getSlop(),
+          nearNode.getInOrder());
+    }
+
+    throw new QueryNodeException(new MessageImpl(
+        QueryParserMessages.LUCENE_QUERY_CONVERSION_ERROR,
+        "Illegal state for: " + nearNode.toString()));
+  }
+
+  protected SpanQuery getSpanQuery(Object obj, AqpNearQueryNode nearNode)
+      throws QueryNodeException {
+    Query q = (Query) obj;
+    if (q instanceof SpanQuery) {
+      return (SpanQuery) q;
+    } else if (q instanceof TermQuery) {
+      return new SpanTermQuery(((TermQuery) q).getTerm());
+    } else if (q instanceof WildcardQuery) {
+      return new SpanMultiTermQueryWrapper<WildcardQuery>((WildcardQuery) q);
+    } else if (q instanceof PrefixQuery) {
+      return new SpanMultiTermQueryWrapper<PrefixQuery>((PrefixQuery) q);
+    } else if (q instanceof BooleanQuery) {
+      return convertBooleanToSpan((BooleanQuery) q, nearNode);
+    } else {
+      throw new QueryNodeException(new MessageImpl(
+          QueryParserMessages.LUCENE_QUERY_CONVERSION_ERROR, q.toString(),
+          "(yet) Unsupported clause inside span query: "
+              + q.getClass().getName()));
+    }
+  }
+
+  /*
+   * Silly convertor for now it can handle only boolean queries of the same type
+   * (ie not mixed cases). To do that, I have to build a graph (tree) and maybe
+   * of only pairs (?)
+   */
+  protected SpanQuery convertBooleanToSpan(BooleanQuery q,
+      AqpNearQueryNode nearNode) throws QueryNodeException {
+    BooleanClause[] clauses = q.getClauses();
+    SpanQuery[] spanClauses = new SpanQuery[clauses.length];
+    Occur o = null;
+    int i = 0;
+    for (BooleanClause c : clauses) {
+      if (o != null && !o.equals(c.getOccur())) {
+        throw new QueryNodeException(new MessageImpl(
+            QueryParserMessages.LUCENE_QUERY_CONVERSION_ERROR, q.toString(),
+            "(yet) Unsupported clause inside span query: "
+                + q.getClass().getName()));
+      }
+      o = c.getOccur();
+      spanClauses[i] = getSpanQuery(c.getQuery(), nearNode);
+      i++;
+    }
+
+    if (o.equals(Occur.MUST)) {
+      return new SpanNearQuery(spanClauses, nearNode.getSlop(),
+          nearNode.getInOrder());
+    } else if (o.equals(Occur.SHOULD)) {
+      return new SpanOrQuery(spanClauses);
+    } else if (o.equals(Occur.MUST_NOT)) {
+      SpanQuery[] exclude = new SpanQuery[spanClauses.length - 1];
+      for (int j = 1; j < spanClauses.length; j++) {
+        exclude[j - 1] = spanClauses[j];
+      }
+      return new SpanNotQuery(spanClauses[0], new SpanOrQuery(exclude));
+    }
+
+    throw new QueryNodeException(new MessageImpl(
+        QueryParserMessages.LUCENE_QUERY_CONVERSION_ERROR, q.toString(),
+        "Congratulations! You have hit (yet) unsupported case: "
+            + q.getClass().getName()));
+  }
+
+  class Leaf {
+    public List<BooleanClause> members = new ArrayList<BooleanClause>();
+    public BooleanClause left;
+    public Leaf right;
+
+    public Leaf(BooleanClause left, Leaf right) {
+      this.left = left;
+      this.right = right;
+    }
+  }
+
+  /*
+   * Creates a tree of the clauses, according to operator precedence:
+   * 
+   * Thus: D +C -A -B becomes:
+   * 
+   * - / \ A - / \ B + / \ C D
+   */
+  private Leaf constructTree(BooleanClause[] clauses) {
+    List<BooleanClause> toProcess = Arrays.asList(clauses);
+    Leaf leaf = new Leaf(null, null);
+    leaf.members = toProcess;
+
+    // from highest priority
+    // findNots(leaf);
+    // findAnds(leaf);
+    // findOrs(leaf);
+    return leaf;
+  }
+
+  private void findNots(Leaf leaf) {
+
+    for (BooleanClause m : leaf.members) {
+      if (m.getOccur().equals(Occur.MUST_NOT)) {
+        leaf.members.remove(m);
+        leaf.left = m;
+      }
+    }
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/AqpSyntaxParserAbstract.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/AqpSyntaxParserAbstract.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/AqpSyntaxParserAbstract.java	(revision 0)
@@ -0,0 +1,35 @@
+package org.apache.lucene.queryparser.flexible.aqp;
+
+import org.antlr.runtime.TokenStream;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeParseException;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+
+/**
+ *  All ANTLR parsers should subclass {@link AqpSyntaxParser} and 
+ *  provide two methods:
+ *  
+ *  {@link AqpSyntaxParser}{@link #getTokenStream(CharSequence)}
+ *  {@link AqpSyntaxParser}{@link #parseTokenStream(TokenStream, CharSequence, CharSequence)
+ *  
+ *  Optionally, the new class can also override
+ *  
+ *  {@link AqpSyntaxParser}{@link #initializeGrammar(String)
+ *  
+ *  The default implementation is using reflection and is able
+ *  to instantiate any grammar provided that the top parse rule
+ *  is called <b>mainQ</b> and that the grammar is producing 
+ *  AST tree.
+ *
+ */
+public abstract class AqpSyntaxParserAbstract implements AqpSyntaxParser {
+
+	/**
+	 * Parse the query and return the {@link QueryNode}. ANTLR will 
+	 * do the parsing and we return AST.
+	 */
+  public QueryNode parse(CharSequence query, CharSequence field)
+      throws QueryNodeParseException {
+    TokenStream tokens = getTokenStream(query);
+    return parseTokenStream(tokens, query, field);
+  }
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/AqpSyntaxParserLoadableImpl.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/AqpSyntaxParserLoadableImpl.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/AqpSyntaxParserLoadableImpl.java	(revision 0)
@@ -0,0 +1,180 @@
+package org.apache.lucene.queryparser.flexible.aqp;
+
+import java.lang.reflect.Constructor;
+import java.lang.reflect.Method;
+
+import org.antlr.runtime.ANTLRStringStream;
+import org.antlr.runtime.CommonTokenStream;
+import org.antlr.runtime.Lexer;
+import org.antlr.runtime.Parser;
+import org.antlr.runtime.RecognitionException;
+import org.antlr.runtime.TokenSource;
+import org.antlr.runtime.TokenStream;
+import org.antlr.runtime.tree.TreeAdaptor;
+import org.apache.lucene.queryparser.flexible.messages.Message;
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeParseException;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardLuceneParser;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpCommonTree;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpCommonTreeAdaptor;
+
+/**
+ * This implementation can load any AST grammar from the repository of grammars
+ * without a need to provide a Java implementation. It uses reflection, so it
+ * might be slower than a dedicated parsing class.
+ * 
+ * Every grammar must have a top-level rule called <b>mainQ</b>
+ * 
+ * And every grammar must return AST.
+ * 
+ * If you know that you are going to instantiate specific parser, then 
+ * you should not use this generic class. 
+ * 
+ * @see AqpSyntaxParserAbstract
+ * @see AqpStandardLuceneParser#init()
+ * 
+ */
+public class AqpSyntaxParserLoadableImpl extends AqpSyntaxParserAbstract {
+
+  @SuppressWarnings("rawtypes")
+  private Class clsLexer;
+  @SuppressWarnings("rawtypes")
+  private Class clsParser;
+
+  private Object iLexer;
+  private Object iParser;
+
+  private Method invokeMainQ;
+  private Method getTreeMethod;
+  private Method getNumberOfSyntaxErrorsMethod;
+
+  private Lexer lexer;
+  private Parser parser;
+
+  private String[] tokenNames;
+
+  public AqpSyntaxParserLoadableImpl() {
+    // empty constructor
+  }
+
+  @SuppressWarnings({ "unchecked", "rawtypes" })
+  public AqpSyntaxParser initializeGrammar(String grammarName)
+      throws QueryNodeParseException {
+
+    try {
+      // get the Classes
+      clsLexer = Class
+          .forName("org.apache.lucene.queryparser.flexible.aqp.parser."
+              + grammarName + "Lexer");
+      clsParser = Class
+          .forName("org.apache.lucene.queryparser.flexible.aqp.parser."
+              + grammarName + "Parser");
+
+      // instantiate lexer with no parameter
+      Class partypes[] = new Class[0];
+      // partypes[0] = CharStream.class;
+      Constructor ctLexer = clsLexer.getConstructor(partypes);
+      Object arglist[] = new Object[0];
+      iLexer = ctLexer.newInstance(arglist);
+
+      // instantiate parser using no parameters
+      // ANTLRStringStream fakeInput = new ANTLRStringStream("none");
+      CommonTokenStream fakeTokens = new CommonTokenStream(
+          (TokenSource) clsLexer.cast(iLexer));
+      Class partypes2[] = new Class[1];
+      partypes2[0] = TokenStream.class;
+      Constructor ct = clsParser.getConstructor(partypes2);
+      iParser = ct.newInstance(fakeTokens);
+
+      parser = (Parser) iParser;
+      lexer = (Lexer) iLexer;
+
+      // get tokenNames
+      Method getTokenNames = clsParser.getDeclaredMethod("getTokenNames");
+      tokenNames = (String[]) getTokenNames.invoke(iParser);
+
+      // create adaptor
+      AqpCommonTreeAdaptor adaptor = new AqpCommonTreeAdaptor(tokenNames);
+
+      // set adaptor
+      Method setTreeAdaptor = clsParser.getDeclaredMethod("setTreeAdaptor",
+          TreeAdaptor.class);
+      setTreeAdaptor.invoke(iParser, adaptor);
+
+      // get the mainQ parser rule & return value
+      invokeMainQ = clsParser.getDeclaredMethod("mainQ");
+      getTreeMethod = invokeMainQ.getReturnType().getMethod("getTree");
+      getNumberOfSyntaxErrorsMethod = clsParser
+          .getMethod("getNumberOfSyntaxErrors");
+
+      // AqpCommonTree ast = parseTest("hey:joe");
+
+      return this;
+
+    } catch (Exception e) {
+      e.printStackTrace();
+      throw new QueryNodeParseException(e);
+    }
+
+  }
+
+  public TokenStream getTokenStream(CharSequence query) {
+    ANTLRStringStream input = new ANTLRStringStream(query.toString());
+    lexer.setCharStream(input);
+
+    // get tokens
+    CommonTokenStream tokens = new CommonTokenStream(
+        (TokenSource) clsLexer.cast(iLexer));
+    return tokens;
+  }
+
+  public QueryNode parseTokenStream(TokenStream tokens, CharSequence query,
+      CharSequence field) throws QueryNodeParseException {
+
+    // set tokens
+    parser.setTokenStream(tokens);
+
+    // get tree back
+    Object retVal;
+    AqpCommonTree astTree;
+
+    try {
+      retVal = invokeMainQ.invoke(iParser);
+      astTree = (AqpCommonTree) (getTreeMethod.invoke(retVal));
+
+      // this prevents parser from recovering, however it can also interfere
+      // with custom error handling (if present inside the grammar)
+      Object errNo = getNumberOfSyntaxErrorsMethod.invoke(iParser);
+
+      if (errNo instanceof Integer && ((Integer) errNo > 0)) {
+        throw new Error(
+            "The parser reported a syntax error, antlrqueryparser hates errors!");
+      }
+    } catch (Error e) {
+      Message message = new MessageImpl(
+          QueryParserMessages.INVALID_SYNTAX_CANNOT_PARSE, query,
+          e.getMessage());
+      QueryNodeParseException ee = new QueryNodeParseException(e);
+      ee.setQuery(query);
+      ee.setNonLocalizedMessage(message);
+      throw ee;
+    } catch (Exception e) { // TODO: these exceptions are from the code, should
+                            // not be printed
+      // e.printStackTrace();
+      QueryNodeParseException ee = new QueryNodeParseException(e);
+      throw ee;
+    }
+
+    try {
+      return astTree.toQueryNodeTree();
+    } catch (RecognitionException e) {
+      throw new QueryNodeParseException(new MessageImpl(query + " >> "
+          + parser.getErrorMessage(e, parser.getTokenNames())));
+    }
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/NestedParseException.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/NestedParseException.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/NestedParseException.java	(revision 0)
@@ -0,0 +1,32 @@
+package org.apache.lucene.queryparser.flexible.aqp;
+
+/**
+ * This class is used explicitly (and only) for exceptions that happen inside a
+ * QueryParser (AQP). We want to have a mechanism to raise and exception that is
+ * not interfering with existing interfaces. But which is caught by the
+ * {@link AqpAdsabsQueryParser}
+ * 
+ * 
+ */
+
+public class NestedParseException extends RuntimeException {
+
+  private static final long serialVersionUID = -3943145526662562552L;
+
+  public NestedParseException() {
+    super();
+  }
+
+  public NestedParseException(String message, Throwable cause) {
+    super(message, cause);
+  }
+
+  public NestedParseException(String string) {
+    super(string);
+  }
+
+  public NestedParseException(Throwable cause) {
+    super(cause);
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammarParser.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammarParser.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammarParser.java	(revision 0)
@@ -0,0 +1,6079 @@
+// $ANTLR 3.4 /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g 2013-06-27 18:55:22
+
+  package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+
+import org.antlr.runtime.*;
+import java.util.Stack;
+import java.util.List;
+import java.util.ArrayList;
+import java.util.Map;
+import java.util.HashMap;
+
+import org.antlr.runtime.tree.*;
+
+
+@SuppressWarnings({"all", "warnings", "unchecked"})
+public class StandardLuceneGrammarParser extends UnforgivingParser {
+    public static final String[] tokenNames = new String[] {
+        "<invalid>", "<EOR>", "<DOWN>", "<UP>", "AMPER", "AND", "ATOM", "BOOST", "CARAT", "CLAUSE", "COLON", "DATE_TOKEN", "DQUOTE", "ESC_CHAR", "FIELD", "FUZZY", "INT", "LBRACK", "LCURLY", "LPAREN", "MINUS", "MODIFIER", "NOT", "NUMBER", "OPERATOR", "OR", "PHRASE", "PHRASE_ANYTHING", "PLUS", "QANYTHING", "QDATE", "QMARK", "QNORMAL", "QPHRASE", "QPHRASETRUNC", "QRANGEEX", "QRANGEIN", "QTRUNCATED", "RBRACK", "RCURLY", "RPAREN", "SQUOTE", "STAR", "TERM_CHAR", "TERM_NORMAL", "TERM_START_CHAR", "TERM_TRUNCATED", "TILDE", "TMODIFIER", "TO", "VBAR", "WS"
+    };
+
+    public static final int EOF=-1;
+    public static final int AMPER=4;
+    public static final int AND=5;
+    public static final int ATOM=6;
+    public static final int BOOST=7;
+    public static final int CARAT=8;
+    public static final int CLAUSE=9;
+    public static final int COLON=10;
+    public static final int DATE_TOKEN=11;
+    public static final int DQUOTE=12;
+    public static final int ESC_CHAR=13;
+    public static final int FIELD=14;
+    public static final int FUZZY=15;
+    public static final int INT=16;
+    public static final int LBRACK=17;
+    public static final int LCURLY=18;
+    public static final int LPAREN=19;
+    public static final int MINUS=20;
+    public static final int MODIFIER=21;
+    public static final int NOT=22;
+    public static final int NUMBER=23;
+    public static final int OPERATOR=24;
+    public static final int OR=25;
+    public static final int PHRASE=26;
+    public static final int PHRASE_ANYTHING=27;
+    public static final int PLUS=28;
+    public static final int QANYTHING=29;
+    public static final int QDATE=30;
+    public static final int QMARK=31;
+    public static final int QNORMAL=32;
+    public static final int QPHRASE=33;
+    public static final int QPHRASETRUNC=34;
+    public static final int QRANGEEX=35;
+    public static final int QRANGEIN=36;
+    public static final int QTRUNCATED=37;
+    public static final int RBRACK=38;
+    public static final int RCURLY=39;
+    public static final int RPAREN=40;
+    public static final int SQUOTE=41;
+    public static final int STAR=42;
+    public static final int TERM_CHAR=43;
+    public static final int TERM_NORMAL=44;
+    public static final int TERM_START_CHAR=45;
+    public static final int TERM_TRUNCATED=46;
+    public static final int TILDE=47;
+    public static final int TMODIFIER=48;
+    public static final int TO=49;
+    public static final int VBAR=50;
+    public static final int WS=51;
+
+    // delegates
+    public UnforgivingParser[] getDelegates() {
+        return new UnforgivingParser[] {};
+    }
+
+    // delegators
+
+
+    public StandardLuceneGrammarParser(TokenStream input) {
+        this(input, new RecognizerSharedState());
+    }
+    public StandardLuceneGrammarParser(TokenStream input, RecognizerSharedState state) {
+        super(input, state);
+    }
+
+protected TreeAdaptor adaptor = new CommonTreeAdaptor();
+
+public void setTreeAdaptor(TreeAdaptor adaptor) {
+    this.adaptor = adaptor;
+}
+public TreeAdaptor getTreeAdaptor() {
+    return adaptor;
+}
+    public String[] getTokenNames() { return StandardLuceneGrammarParser.tokenNames; }
+    public String getGrammarFileName() { return "/dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g"; }
+
+
+    public static class mainQ_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "mainQ"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:103:1: mainQ : ( clauseOr )+ EOF -> ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ;
+    public final StandardLuceneGrammarParser.mainQ_return mainQ() throws RecognitionException {
+        StandardLuceneGrammarParser.mainQ_return retval = new StandardLuceneGrammarParser.mainQ_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token EOF2=null;
+        StandardLuceneGrammarParser.clauseOr_return clauseOr1 =null;
+
+
+        Object EOF2_tree=null;
+        RewriteRuleTokenStream stream_EOF=new RewriteRuleTokenStream(adaptor,"token EOF");
+        RewriteRuleSubtreeStream stream_clauseOr=new RewriteRuleSubtreeStream(adaptor,"rule clauseOr");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:103:7: ( ( clauseOr )+ EOF -> ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:104:2: ( clauseOr )+ EOF
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:104:2: ( clauseOr )+
+            int cnt1=0;
+            loop1:
+            do {
+                int alt1=2;
+                int LA1_0 = input.LA(1);
+
+                if ( ((LA1_0 >= LBRACK && LA1_0 <= MINUS)||LA1_0==NUMBER||(LA1_0 >= PHRASE && LA1_0 <= PLUS)||LA1_0==QMARK||LA1_0==STAR||LA1_0==TERM_NORMAL||LA1_0==TERM_TRUNCATED) ) {
+                    alt1=1;
+                }
+
+
+                switch (alt1) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:104:2: clauseOr
+            	    {
+            	    pushFollow(FOLLOW_clauseOr_in_mainQ212);
+            	    clauseOr1=clauseOr();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_clauseOr.add(clauseOr1.getTree());
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt1 >= 1 ) break loop1;
+            	    if (state.backtracking>0) {state.failed=true; return retval;}
+                        EarlyExitException eee =
+                            new EarlyExitException(1, input);
+                        throw eee;
+                }
+                cnt1++;
+            } while (true);
+
+
+            EOF2=(Token)match(input,EOF,FOLLOW_EOF_in_mainQ215); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_EOF.add(EOF2);
+
+
+            // AST REWRITE
+            // elements: clauseOr
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 104:16: -> ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:104:19: ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(OPERATOR, "DEFOP")
+                , root_1);
+
+                if ( !(stream_clauseOr.hasNext()) ) {
+                    throw new RewriteEarlyExitException();
+                }
+                while ( stream_clauseOr.hasNext() ) {
+                    adaptor.addChild(root_1, stream_clauseOr.nextTree());
+
+                }
+                stream_clauseOr.reset();
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "mainQ"
+
+
+    public static class clauseOr_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "clauseOr"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:108:1: clauseOr : (first= clauseAnd -> $first) ( or others= clauseAnd -> ^( OPERATOR[\"OR\"] ( clauseAnd )+ ) )* ;
+    public final StandardLuceneGrammarParser.clauseOr_return clauseOr() throws RecognitionException {
+        StandardLuceneGrammarParser.clauseOr_return retval = new StandardLuceneGrammarParser.clauseOr_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        StandardLuceneGrammarParser.clauseAnd_return first =null;
+
+        StandardLuceneGrammarParser.clauseAnd_return others =null;
+
+        StandardLuceneGrammarParser.or_return or3 =null;
+
+
+        RewriteRuleSubtreeStream stream_clauseAnd=new RewriteRuleSubtreeStream(adaptor,"rule clauseAnd");
+        RewriteRuleSubtreeStream stream_or=new RewriteRuleSubtreeStream(adaptor,"rule or");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:109:3: ( (first= clauseAnd -> $first) ( or others= clauseAnd -> ^( OPERATOR[\"OR\"] ( clauseAnd )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:109:5: (first= clauseAnd -> $first) ( or others= clauseAnd -> ^( OPERATOR[\"OR\"] ( clauseAnd )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:109:5: (first= clauseAnd -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:109:6: first= clauseAnd
+            {
+            pushFollow(FOLLOW_clauseAnd_in_clauseOr246);
+            first=clauseAnd();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_clauseAnd.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 109:22: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:109:33: ( or others= clauseAnd -> ^( OPERATOR[\"OR\"] ( clauseAnd )+ ) )*
+            loop2:
+            do {
+                int alt2=2;
+                int LA2_0 = input.LA(1);
+
+                if ( (LA2_0==OR) ) {
+                    alt2=1;
+                }
+
+
+                switch (alt2) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:109:34: or others= clauseAnd
+            	    {
+            	    pushFollow(FOLLOW_or_in_clauseOr255);
+            	    or3=or();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_or.add(or3.getTree());
+
+            	    pushFollow(FOLLOW_clauseAnd_in_clauseOr259);
+            	    others=clauseAnd();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_clauseAnd.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: clauseAnd
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 109:54: -> ^( OPERATOR[\"OR\"] ( clauseAnd )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:109:57: ^( OPERATOR[\"OR\"] ( clauseAnd )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(
+            	        (Object)adaptor.create(OPERATOR, "OR")
+            	        , root_1);
+
+            	        if ( !(stream_clauseAnd.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_clauseAnd.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_clauseAnd.nextTree());
+
+            	        }
+            	        stream_clauseAnd.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop2;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "clauseOr"
+
+
+    public static class clauseAnd_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "clauseAnd"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:112:1: clauseAnd : (first= clauseNot -> $first) ( and others= clauseNot -> ^( OPERATOR[\"AND\"] ( clauseNot )+ ) )* ;
+    public final StandardLuceneGrammarParser.clauseAnd_return clauseAnd() throws RecognitionException {
+        StandardLuceneGrammarParser.clauseAnd_return retval = new StandardLuceneGrammarParser.clauseAnd_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        StandardLuceneGrammarParser.clauseNot_return first =null;
+
+        StandardLuceneGrammarParser.clauseNot_return others =null;
+
+        StandardLuceneGrammarParser.and_return and4 =null;
+
+
+        RewriteRuleSubtreeStream stream_clauseNot=new RewriteRuleSubtreeStream(adaptor,"rule clauseNot");
+        RewriteRuleSubtreeStream stream_and=new RewriteRuleSubtreeStream(adaptor,"rule and");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:113:3: ( (first= clauseNot -> $first) ( and others= clauseNot -> ^( OPERATOR[\"AND\"] ( clauseNot )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:113:5: (first= clauseNot -> $first) ( and others= clauseNot -> ^( OPERATOR[\"AND\"] ( clauseNot )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:113:5: (first= clauseNot -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:113:6: first= clauseNot
+            {
+            pushFollow(FOLLOW_clauseNot_in_clauseAnd288);
+            first=clauseNot();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_clauseNot.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 113:23: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:113:34: ( and others= clauseNot -> ^( OPERATOR[\"AND\"] ( clauseNot )+ ) )*
+            loop3:
+            do {
+                int alt3=2;
+                int LA3_0 = input.LA(1);
+
+                if ( (LA3_0==AND) ) {
+                    alt3=1;
+                }
+
+
+                switch (alt3) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:113:35: and others= clauseNot
+            	    {
+            	    pushFollow(FOLLOW_and_in_clauseAnd298);
+            	    and4=and();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_and.add(and4.getTree());
+
+            	    pushFollow(FOLLOW_clauseNot_in_clauseAnd302);
+            	    others=clauseNot();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_clauseNot.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: clauseNot
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 113:56: -> ^( OPERATOR[\"AND\"] ( clauseNot )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:113:59: ^( OPERATOR[\"AND\"] ( clauseNot )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(
+            	        (Object)adaptor.create(OPERATOR, "AND")
+            	        , root_1);
+
+            	        if ( !(stream_clauseNot.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_clauseNot.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_clauseNot.nextTree());
+
+            	        }
+            	        stream_clauseNot.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop3;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "clauseAnd"
+
+
+    public static class clauseNot_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "clauseNot"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:116:1: clauseNot : (first= clauseBasic -> $first) ( not others= clauseBasic -> ^( OPERATOR[\"NOT\"] ( clauseBasic )+ ) )* ;
+    public final StandardLuceneGrammarParser.clauseNot_return clauseNot() throws RecognitionException {
+        StandardLuceneGrammarParser.clauseNot_return retval = new StandardLuceneGrammarParser.clauseNot_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        StandardLuceneGrammarParser.clauseBasic_return first =null;
+
+        StandardLuceneGrammarParser.clauseBasic_return others =null;
+
+        StandardLuceneGrammarParser.not_return not5 =null;
+
+
+        RewriteRuleSubtreeStream stream_not=new RewriteRuleSubtreeStream(adaptor,"rule not");
+        RewriteRuleSubtreeStream stream_clauseBasic=new RewriteRuleSubtreeStream(adaptor,"rule clauseBasic");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:117:3: ( (first= clauseBasic -> $first) ( not others= clauseBasic -> ^( OPERATOR[\"NOT\"] ( clauseBasic )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:117:5: (first= clauseBasic -> $first) ( not others= clauseBasic -> ^( OPERATOR[\"NOT\"] ( clauseBasic )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:117:5: (first= clauseBasic -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:117:6: first= clauseBasic
+            {
+            pushFollow(FOLLOW_clauseBasic_in_clauseNot333);
+            first=clauseBasic();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_clauseBasic.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 117:24: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:117:35: ( not others= clauseBasic -> ^( OPERATOR[\"NOT\"] ( clauseBasic )+ ) )*
+            loop4:
+            do {
+                int alt4=2;
+                int LA4_0 = input.LA(1);
+
+                if ( (LA4_0==AND) ) {
+                    int LA4_1 = input.LA(2);
+
+                    if ( (LA4_1==NOT) ) {
+                        alt4=1;
+                    }
+
+
+                }
+                else if ( (LA4_0==NOT) ) {
+                    alt4=1;
+                }
+
+
+                switch (alt4) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:117:36: not others= clauseBasic
+            	    {
+            	    pushFollow(FOLLOW_not_in_clauseNot342);
+            	    not5=not();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_not.add(not5.getTree());
+
+            	    pushFollow(FOLLOW_clauseBasic_in_clauseNot346);
+            	    others=clauseBasic();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_clauseBasic.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: clauseBasic
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 117:59: -> ^( OPERATOR[\"NOT\"] ( clauseBasic )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:117:62: ^( OPERATOR[\"NOT\"] ( clauseBasic )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(
+            	        (Object)adaptor.create(OPERATOR, "NOT")
+            	        , root_1);
+
+            	        if ( !(stream_clauseBasic.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_clauseBasic.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_clauseBasic.nextTree());
+
+            	        }
+            	        stream_clauseBasic.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop4;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "clauseNot"
+
+
+    public static class clauseBasic_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "clauseBasic"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:121:1: clauseBasic : ( ( modifier LPAREN ( clauseOr )+ RPAREN )=> ( modifier )? LPAREN ( clauseOr )+ RPAREN ( term_modifier )? -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) ) | ( LPAREN ( clauseOr )+ RPAREN term_modifier )=> ( modifier )? LPAREN ( clauseOr )+ RPAREN ( term_modifier )? -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) ) | ( LPAREN )=> LPAREN ( clauseOr )+ RPAREN -> ( clauseOr )+ | atom );
+    public final StandardLuceneGrammarParser.clauseBasic_return clauseBasic() throws RecognitionException {
+        StandardLuceneGrammarParser.clauseBasic_return retval = new StandardLuceneGrammarParser.clauseBasic_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token LPAREN7=null;
+        Token RPAREN9=null;
+        Token LPAREN12=null;
+        Token RPAREN14=null;
+        Token LPAREN16=null;
+        Token RPAREN18=null;
+        StandardLuceneGrammarParser.modifier_return modifier6 =null;
+
+        StandardLuceneGrammarParser.clauseOr_return clauseOr8 =null;
+
+        StandardLuceneGrammarParser.term_modifier_return term_modifier10 =null;
+
+        StandardLuceneGrammarParser.modifier_return modifier11 =null;
+
+        StandardLuceneGrammarParser.clauseOr_return clauseOr13 =null;
+
+        StandardLuceneGrammarParser.term_modifier_return term_modifier15 =null;
+
+        StandardLuceneGrammarParser.clauseOr_return clauseOr17 =null;
+
+        StandardLuceneGrammarParser.atom_return atom19 =null;
+
+
+        Object LPAREN7_tree=null;
+        Object RPAREN9_tree=null;
+        Object LPAREN12_tree=null;
+        Object RPAREN14_tree=null;
+        Object LPAREN16_tree=null;
+        Object RPAREN18_tree=null;
+        RewriteRuleTokenStream stream_RPAREN=new RewriteRuleTokenStream(adaptor,"token RPAREN");
+        RewriteRuleTokenStream stream_LPAREN=new RewriteRuleTokenStream(adaptor,"token LPAREN");
+        RewriteRuleSubtreeStream stream_modifier=new RewriteRuleSubtreeStream(adaptor,"rule modifier");
+        RewriteRuleSubtreeStream stream_term_modifier=new RewriteRuleSubtreeStream(adaptor,"rule term_modifier");
+        RewriteRuleSubtreeStream stream_clauseOr=new RewriteRuleSubtreeStream(adaptor,"rule clauseOr");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:122:2: ( ( modifier LPAREN ( clauseOr )+ RPAREN )=> ( modifier )? LPAREN ( clauseOr )+ RPAREN ( term_modifier )? -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) ) | ( LPAREN ( clauseOr )+ RPAREN term_modifier )=> ( modifier )? LPAREN ( clauseOr )+ RPAREN ( term_modifier )? -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) ) | ( LPAREN )=> LPAREN ( clauseOr )+ RPAREN -> ( clauseOr )+ | atom )
+            int alt12=4;
+            switch ( input.LA(1) ) {
+            case PLUS:
+                {
+                int LA12_1 = input.LA(2);
+
+                if ( (synpred1_StandardLuceneGrammar()) ) {
+                    alt12=1;
+                }
+                else if ( (synpred2_StandardLuceneGrammar()) ) {
+                    alt12=2;
+                }
+                else if ( (true) ) {
+                    alt12=4;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 12, 1, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            case MINUS:
+                {
+                int LA12_2 = input.LA(2);
+
+                if ( (synpred1_StandardLuceneGrammar()) ) {
+                    alt12=1;
+                }
+                else if ( (synpred2_StandardLuceneGrammar()) ) {
+                    alt12=2;
+                }
+                else if ( (true) ) {
+                    alt12=4;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 12, 2, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            case LPAREN:
+                {
+                int LA12_3 = input.LA(2);
+
+                if ( (synpred1_StandardLuceneGrammar()) ) {
+                    alt12=1;
+                }
+                else if ( (synpred2_StandardLuceneGrammar()) ) {
+                    alt12=2;
+                }
+                else if ( (synpred3_StandardLuceneGrammar()) ) {
+                    alt12=3;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 12, 3, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            case LBRACK:
+            case LCURLY:
+            case NUMBER:
+            case PHRASE:
+            case PHRASE_ANYTHING:
+            case QMARK:
+            case STAR:
+            case TERM_NORMAL:
+            case TERM_TRUNCATED:
+                {
+                alt12=4;
+                }
+                break;
+            default:
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 12, 0, input);
+
+                throw nvae;
+
+            }
+
+            switch (alt12) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:123:2: ( modifier LPAREN ( clauseOr )+ RPAREN )=> ( modifier )? LPAREN ( clauseOr )+ RPAREN ( term_modifier )?
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:123:40: ( modifier )?
+                    int alt5=2;
+                    int LA5_0 = input.LA(1);
+
+                    if ( (LA5_0==MINUS||LA5_0==PLUS) ) {
+                        alt5=1;
+                    }
+                    switch (alt5) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:123:40: modifier
+                            {
+                            pushFollow(FOLLOW_modifier_in_clauseBasic391);
+                            modifier6=modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_modifier.add(modifier6.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    LPAREN7=(Token)match(input,LPAREN,FOLLOW_LPAREN_in_clauseBasic394); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_LPAREN.add(LPAREN7);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:123:57: ( clauseOr )+
+                    int cnt6=0;
+                    loop6:
+                    do {
+                        int alt6=2;
+                        int LA6_0 = input.LA(1);
+
+                        if ( ((LA6_0 >= LBRACK && LA6_0 <= MINUS)||LA6_0==NUMBER||(LA6_0 >= PHRASE && LA6_0 <= PLUS)||LA6_0==QMARK||LA6_0==STAR||LA6_0==TERM_NORMAL||LA6_0==TERM_TRUNCATED) ) {
+                            alt6=1;
+                        }
+
+
+                        switch (alt6) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:123:57: clauseOr
+                    	    {
+                    	    pushFollow(FOLLOW_clauseOr_in_clauseBasic396);
+                    	    clauseOr8=clauseOr();
+
+                    	    state._fsp--;
+                    	    if (state.failed) return retval;
+                    	    if ( state.backtracking==0 ) stream_clauseOr.add(clauseOr8.getTree());
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt6 >= 1 ) break loop6;
+                    	    if (state.backtracking>0) {state.failed=true; return retval;}
+                                EarlyExitException eee =
+                                    new EarlyExitException(6, input);
+                                throw eee;
+                        }
+                        cnt6++;
+                    } while (true);
+
+
+                    RPAREN9=(Token)match(input,RPAREN,FOLLOW_RPAREN_in_clauseBasic399); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_RPAREN.add(RPAREN9);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:123:74: ( term_modifier )?
+                    int alt7=2;
+                    int LA7_0 = input.LA(1);
+
+                    if ( (LA7_0==CARAT||LA7_0==TILDE) ) {
+                        alt7=1;
+                    }
+                    switch (alt7) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:123:74: term_modifier
+                            {
+                            pushFollow(FOLLOW_term_modifier_in_clauseBasic401);
+                            term_modifier10=term_modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_term_modifier.add(term_modifier10.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    // AST REWRITE
+                    // elements: term_modifier, clauseOr, modifier
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 124:3: -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:124:6: ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(CLAUSE, "CLAUSE")
+                        , root_1);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:124:15: ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) )
+                        {
+                        Object root_2 = (Object)adaptor.nil();
+                        root_2 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(MODIFIER, "MODIFIER")
+                        , root_2);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:124:26: ( modifier )?
+                        if ( stream_modifier.hasNext() ) {
+                            adaptor.addChild(root_2, stream_modifier.nextTree());
+
+                        }
+                        stream_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:124:36: ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) )
+                        {
+                        Object root_3 = (Object)adaptor.nil();
+                        root_3 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(TMODIFIER, "TMODIFIER")
+                        , root_3);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:124:48: ( term_modifier )?
+                        if ( stream_term_modifier.hasNext() ) {
+                            adaptor.addChild(root_3, stream_term_modifier.nextTree());
+
+                        }
+                        stream_term_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:124:63: ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ )
+                        {
+                        Object root_4 = (Object)adaptor.nil();
+                        root_4 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(OPERATOR, "DEFOP")
+                        , root_4);
+
+                        if ( !(stream_clauseOr.hasNext()) ) {
+                            throw new RewriteEarlyExitException();
+                        }
+                        while ( stream_clauseOr.hasNext() ) {
+                            adaptor.addChild(root_4, stream_clauseOr.nextTree());
+
+                        }
+                        stream_clauseOr.reset();
+
+                        adaptor.addChild(root_3, root_4);
+                        }
+
+                        adaptor.addChild(root_2, root_3);
+                        }
+
+                        adaptor.addChild(root_1, root_2);
+                        }
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:125:4: ( LPAREN ( clauseOr )+ RPAREN term_modifier )=> ( modifier )? LPAREN ( clauseOr )+ RPAREN ( term_modifier )?
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:125:46: ( modifier )?
+                    int alt8=2;
+                    int LA8_0 = input.LA(1);
+
+                    if ( (LA8_0==MINUS||LA8_0==PLUS) ) {
+                        alt8=1;
+                    }
+                    switch (alt8) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:125:46: modifier
+                            {
+                            pushFollow(FOLLOW_modifier_in_clauseBasic451);
+                            modifier11=modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_modifier.add(modifier11.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    LPAREN12=(Token)match(input,LPAREN,FOLLOW_LPAREN_in_clauseBasic454); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_LPAREN.add(LPAREN12);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:125:63: ( clauseOr )+
+                    int cnt9=0;
+                    loop9:
+                    do {
+                        int alt9=2;
+                        int LA9_0 = input.LA(1);
+
+                        if ( ((LA9_0 >= LBRACK && LA9_0 <= MINUS)||LA9_0==NUMBER||(LA9_0 >= PHRASE && LA9_0 <= PLUS)||LA9_0==QMARK||LA9_0==STAR||LA9_0==TERM_NORMAL||LA9_0==TERM_TRUNCATED) ) {
+                            alt9=1;
+                        }
+
+
+                        switch (alt9) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:125:63: clauseOr
+                    	    {
+                    	    pushFollow(FOLLOW_clauseOr_in_clauseBasic456);
+                    	    clauseOr13=clauseOr();
+
+                    	    state._fsp--;
+                    	    if (state.failed) return retval;
+                    	    if ( state.backtracking==0 ) stream_clauseOr.add(clauseOr13.getTree());
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt9 >= 1 ) break loop9;
+                    	    if (state.backtracking>0) {state.failed=true; return retval;}
+                                EarlyExitException eee =
+                                    new EarlyExitException(9, input);
+                                throw eee;
+                        }
+                        cnt9++;
+                    } while (true);
+
+
+                    RPAREN14=(Token)match(input,RPAREN,FOLLOW_RPAREN_in_clauseBasic459); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_RPAREN.add(RPAREN14);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:125:80: ( term_modifier )?
+                    int alt10=2;
+                    int LA10_0 = input.LA(1);
+
+                    if ( (LA10_0==CARAT||LA10_0==TILDE) ) {
+                        alt10=1;
+                    }
+                    switch (alt10) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:125:80: term_modifier
+                            {
+                            pushFollow(FOLLOW_term_modifier_in_clauseBasic461);
+                            term_modifier15=term_modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_term_modifier.add(term_modifier15.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    // AST REWRITE
+                    // elements: term_modifier, clauseOr, modifier
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 126:3: -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:126:6: ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(CLAUSE, "CLAUSE")
+                        , root_1);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:126:15: ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) )
+                        {
+                        Object root_2 = (Object)adaptor.nil();
+                        root_2 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(MODIFIER, "MODIFIER")
+                        , root_2);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:126:26: ( modifier )?
+                        if ( stream_modifier.hasNext() ) {
+                            adaptor.addChild(root_2, stream_modifier.nextTree());
+
+                        }
+                        stream_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:126:36: ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) )
+                        {
+                        Object root_3 = (Object)adaptor.nil();
+                        root_3 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(TMODIFIER, "TMODIFIER")
+                        , root_3);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:126:48: ( term_modifier )?
+                        if ( stream_term_modifier.hasNext() ) {
+                            adaptor.addChild(root_3, stream_term_modifier.nextTree());
+
+                        }
+                        stream_term_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:126:63: ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ )
+                        {
+                        Object root_4 = (Object)adaptor.nil();
+                        root_4 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(OPERATOR, "DEFOP")
+                        , root_4);
+
+                        if ( !(stream_clauseOr.hasNext()) ) {
+                            throw new RewriteEarlyExitException();
+                        }
+                        while ( stream_clauseOr.hasNext() ) {
+                            adaptor.addChild(root_4, stream_clauseOr.nextTree());
+
+                        }
+                        stream_clauseOr.reset();
+
+                        adaptor.addChild(root_3, root_4);
+                        }
+
+                        adaptor.addChild(root_2, root_3);
+                        }
+
+                        adaptor.addChild(root_1, root_2);
+                        }
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 3 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:127:4: ( LPAREN )=> LPAREN ( clauseOr )+ RPAREN
+                    {
+                    LPAREN16=(Token)match(input,LPAREN,FOLLOW_LPAREN_in_clauseBasic506); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_LPAREN.add(LPAREN16);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:127:24: ( clauseOr )+
+                    int cnt11=0;
+                    loop11:
+                    do {
+                        int alt11=2;
+                        int LA11_0 = input.LA(1);
+
+                        if ( ((LA11_0 >= LBRACK && LA11_0 <= MINUS)||LA11_0==NUMBER||(LA11_0 >= PHRASE && LA11_0 <= PLUS)||LA11_0==QMARK||LA11_0==STAR||LA11_0==TERM_NORMAL||LA11_0==TERM_TRUNCATED) ) {
+                            alt11=1;
+                        }
+
+
+                        switch (alt11) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:127:24: clauseOr
+                    	    {
+                    	    pushFollow(FOLLOW_clauseOr_in_clauseBasic508);
+                    	    clauseOr17=clauseOr();
+
+                    	    state._fsp--;
+                    	    if (state.failed) return retval;
+                    	    if ( state.backtracking==0 ) stream_clauseOr.add(clauseOr17.getTree());
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt11 >= 1 ) break loop11;
+                    	    if (state.backtracking>0) {state.failed=true; return retval;}
+                                EarlyExitException eee =
+                                    new EarlyExitException(11, input);
+                                throw eee;
+                        }
+                        cnt11++;
+                    } while (true);
+
+
+                    RPAREN18=(Token)match(input,RPAREN,FOLLOW_RPAREN_in_clauseBasic511); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_RPAREN.add(RPAREN18);
+
+
+                    // AST REWRITE
+                    // elements: clauseOr
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 128:3: -> ( clauseOr )+
+                    {
+                        if ( !(stream_clauseOr.hasNext()) ) {
+                            throw new RewriteEarlyExitException();
+                        }
+                        while ( stream_clauseOr.hasNext() ) {
+                            adaptor.addChild(root_0, stream_clauseOr.nextTree());
+
+                        }
+                        stream_clauseOr.reset();
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 4 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:129:4: atom
+                    {
+                    root_0 = (Object)adaptor.nil();
+
+
+                    pushFollow(FOLLOW_atom_in_clauseBasic523);
+                    atom19=atom();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) adaptor.addChild(root_0, atom19.getTree());
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "clauseBasic"
+
+
+    public static class atom_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "atom"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:133:1: atom : ( ( modifier )? field multi_value ( term_modifier )? -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD field multi_value ) ) ) ) | ( modifier )? ( field )? value ( term_modifier )? -> ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD ( field )? value ) ) ) );
+    public final StandardLuceneGrammarParser.atom_return atom() throws RecognitionException {
+        StandardLuceneGrammarParser.atom_return retval = new StandardLuceneGrammarParser.atom_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        StandardLuceneGrammarParser.modifier_return modifier20 =null;
+
+        StandardLuceneGrammarParser.field_return field21 =null;
+
+        StandardLuceneGrammarParser.multi_value_return multi_value22 =null;
+
+        StandardLuceneGrammarParser.term_modifier_return term_modifier23 =null;
+
+        StandardLuceneGrammarParser.modifier_return modifier24 =null;
+
+        StandardLuceneGrammarParser.field_return field25 =null;
+
+        StandardLuceneGrammarParser.value_return value26 =null;
+
+        StandardLuceneGrammarParser.term_modifier_return term_modifier27 =null;
+
+
+        RewriteRuleSubtreeStream stream_modifier=new RewriteRuleSubtreeStream(adaptor,"rule modifier");
+        RewriteRuleSubtreeStream stream_field=new RewriteRuleSubtreeStream(adaptor,"rule field");
+        RewriteRuleSubtreeStream stream_term_modifier=new RewriteRuleSubtreeStream(adaptor,"rule term_modifier");
+        RewriteRuleSubtreeStream stream_value=new RewriteRuleSubtreeStream(adaptor,"rule value");
+        RewriteRuleSubtreeStream stream_multi_value=new RewriteRuleSubtreeStream(adaptor,"rule multi_value");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:134:2: ( ( modifier )? field multi_value ( term_modifier )? -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD field multi_value ) ) ) ) | ( modifier )? ( field )? value ( term_modifier )? -> ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD ( field )? value ) ) ) )
+            int alt18=2;
+            switch ( input.LA(1) ) {
+            case PLUS:
+                {
+                int LA18_1 = input.LA(2);
+
+                if ( (LA18_1==TERM_NORMAL) ) {
+                    int LA18_3 = input.LA(3);
+
+                    if ( (LA18_3==COLON) ) {
+                        int LA18_5 = input.LA(4);
+
+                        if ( (LA18_5==LPAREN) ) {
+                            alt18=1;
+                        }
+                        else if ( ((LA18_5 >= LBRACK && LA18_5 <= LCURLY)||LA18_5==NUMBER||(LA18_5 >= PHRASE && LA18_5 <= PHRASE_ANYTHING)||LA18_5==QMARK||LA18_5==STAR||LA18_5==TERM_NORMAL||LA18_5==TERM_TRUNCATED) ) {
+                            alt18=2;
+                        }
+                        else {
+                            if (state.backtracking>0) {state.failed=true; return retval;}
+                            NoViableAltException nvae =
+                                new NoViableAltException("", 18, 5, input);
+
+                            throw nvae;
+
+                        }
+                    }
+                    else if ( (LA18_3==EOF||LA18_3==AND||LA18_3==CARAT||(LA18_3 >= LBRACK && LA18_3 <= MINUS)||(LA18_3 >= NOT && LA18_3 <= NUMBER)||(LA18_3 >= OR && LA18_3 <= PLUS)||LA18_3==QMARK||LA18_3==RPAREN||LA18_3==STAR||LA18_3==TERM_NORMAL||(LA18_3 >= TERM_TRUNCATED && LA18_3 <= TILDE)) ) {
+                        alt18=2;
+                    }
+                    else {
+                        if (state.backtracking>0) {state.failed=true; return retval;}
+                        NoViableAltException nvae =
+                            new NoViableAltException("", 18, 3, input);
+
+                        throw nvae;
+
+                    }
+                }
+                else if ( ((LA18_1 >= LBRACK && LA18_1 <= LCURLY)||LA18_1==NUMBER||(LA18_1 >= PHRASE && LA18_1 <= PHRASE_ANYTHING)||LA18_1==QMARK||LA18_1==STAR||LA18_1==TERM_TRUNCATED) ) {
+                    alt18=2;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 18, 1, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            case MINUS:
+                {
+                int LA18_2 = input.LA(2);
+
+                if ( (LA18_2==TERM_NORMAL) ) {
+                    int LA18_3 = input.LA(3);
+
+                    if ( (LA18_3==COLON) ) {
+                        int LA18_5 = input.LA(4);
+
+                        if ( (LA18_5==LPAREN) ) {
+                            alt18=1;
+                        }
+                        else if ( ((LA18_5 >= LBRACK && LA18_5 <= LCURLY)||LA18_5==NUMBER||(LA18_5 >= PHRASE && LA18_5 <= PHRASE_ANYTHING)||LA18_5==QMARK||LA18_5==STAR||LA18_5==TERM_NORMAL||LA18_5==TERM_TRUNCATED) ) {
+                            alt18=2;
+                        }
+                        else {
+                            if (state.backtracking>0) {state.failed=true; return retval;}
+                            NoViableAltException nvae =
+                                new NoViableAltException("", 18, 5, input);
+
+                            throw nvae;
+
+                        }
+                    }
+                    else if ( (LA18_3==EOF||LA18_3==AND||LA18_3==CARAT||(LA18_3 >= LBRACK && LA18_3 <= MINUS)||(LA18_3 >= NOT && LA18_3 <= NUMBER)||(LA18_3 >= OR && LA18_3 <= PLUS)||LA18_3==QMARK||LA18_3==RPAREN||LA18_3==STAR||LA18_3==TERM_NORMAL||(LA18_3 >= TERM_TRUNCATED && LA18_3 <= TILDE)) ) {
+                        alt18=2;
+                    }
+                    else {
+                        if (state.backtracking>0) {state.failed=true; return retval;}
+                        NoViableAltException nvae =
+                            new NoViableAltException("", 18, 3, input);
+
+                        throw nvae;
+
+                    }
+                }
+                else if ( ((LA18_2 >= LBRACK && LA18_2 <= LCURLY)||LA18_2==NUMBER||(LA18_2 >= PHRASE && LA18_2 <= PHRASE_ANYTHING)||LA18_2==QMARK||LA18_2==STAR||LA18_2==TERM_TRUNCATED) ) {
+                    alt18=2;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 18, 2, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            case TERM_NORMAL:
+                {
+                int LA18_3 = input.LA(2);
+
+                if ( (LA18_3==COLON) ) {
+                    int LA18_5 = input.LA(3);
+
+                    if ( (LA18_5==LPAREN) ) {
+                        alt18=1;
+                    }
+                    else if ( ((LA18_5 >= LBRACK && LA18_5 <= LCURLY)||LA18_5==NUMBER||(LA18_5 >= PHRASE && LA18_5 <= PHRASE_ANYTHING)||LA18_5==QMARK||LA18_5==STAR||LA18_5==TERM_NORMAL||LA18_5==TERM_TRUNCATED) ) {
+                        alt18=2;
+                    }
+                    else {
+                        if (state.backtracking>0) {state.failed=true; return retval;}
+                        NoViableAltException nvae =
+                            new NoViableAltException("", 18, 5, input);
+
+                        throw nvae;
+
+                    }
+                }
+                else if ( (LA18_3==EOF||LA18_3==AND||LA18_3==CARAT||(LA18_3 >= LBRACK && LA18_3 <= MINUS)||(LA18_3 >= NOT && LA18_3 <= NUMBER)||(LA18_3 >= OR && LA18_3 <= PLUS)||LA18_3==QMARK||LA18_3==RPAREN||LA18_3==STAR||LA18_3==TERM_NORMAL||(LA18_3 >= TERM_TRUNCATED && LA18_3 <= TILDE)) ) {
+                    alt18=2;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 18, 3, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            case LBRACK:
+            case LCURLY:
+            case NUMBER:
+            case PHRASE:
+            case PHRASE_ANYTHING:
+            case QMARK:
+            case STAR:
+            case TERM_TRUNCATED:
+                {
+                alt18=2;
+                }
+                break;
+            default:
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 18, 0, input);
+
+                throw nvae;
+
+            }
+
+            switch (alt18) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:135:2: ( modifier )? field multi_value ( term_modifier )?
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:135:2: ( modifier )?
+                    int alt13=2;
+                    int LA13_0 = input.LA(1);
+
+                    if ( (LA13_0==MINUS||LA13_0==PLUS) ) {
+                        alt13=1;
+                    }
+                    switch (alt13) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:135:2: modifier
+                            {
+                            pushFollow(FOLLOW_modifier_in_atom544);
+                            modifier20=modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_modifier.add(modifier20.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    pushFollow(FOLLOW_field_in_atom547);
+                    field21=field();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_field.add(field21.getTree());
+
+                    pushFollow(FOLLOW_multi_value_in_atom549);
+                    multi_value22=multi_value();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_multi_value.add(multi_value22.getTree());
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:135:30: ( term_modifier )?
+                    int alt14=2;
+                    int LA14_0 = input.LA(1);
+
+                    if ( (LA14_0==CARAT||LA14_0==TILDE) ) {
+                        alt14=1;
+                    }
+                    switch (alt14) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:135:30: term_modifier
+                            {
+                            pushFollow(FOLLOW_term_modifier_in_atom551);
+                            term_modifier23=term_modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_term_modifier.add(term_modifier23.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    // AST REWRITE
+                    // elements: multi_value, modifier, field, term_modifier
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 136:3: -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD field multi_value ) ) ) )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:136:6: ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD field multi_value ) ) ) )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(CLAUSE, "CLAUSE")
+                        , root_1);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:136:15: ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD field multi_value ) ) )
+                        {
+                        Object root_2 = (Object)adaptor.nil();
+                        root_2 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(MODIFIER, "MODIFIER")
+                        , root_2);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:136:26: ( modifier )?
+                        if ( stream_modifier.hasNext() ) {
+                            adaptor.addChild(root_2, stream_modifier.nextTree());
+
+                        }
+                        stream_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:136:36: ^( TMODIFIER ( term_modifier )? ^( FIELD field multi_value ) )
+                        {
+                        Object root_3 = (Object)adaptor.nil();
+                        root_3 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(TMODIFIER, "TMODIFIER")
+                        , root_3);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:136:48: ( term_modifier )?
+                        if ( stream_term_modifier.hasNext() ) {
+                            adaptor.addChild(root_3, stream_term_modifier.nextTree());
+
+                        }
+                        stream_term_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:136:63: ^( FIELD field multi_value )
+                        {
+                        Object root_4 = (Object)adaptor.nil();
+                        root_4 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(FIELD, "FIELD")
+                        , root_4);
+
+                        adaptor.addChild(root_4, stream_field.nextTree());
+
+                        adaptor.addChild(root_4, stream_multi_value.nextTree());
+
+                        adaptor.addChild(root_3, root_4);
+                        }
+
+                        adaptor.addChild(root_2, root_3);
+                        }
+
+                        adaptor.addChild(root_1, root_2);
+                        }
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:137:4: ( modifier )? ( field )? value ( term_modifier )?
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:137:4: ( modifier )?
+                    int alt15=2;
+                    int LA15_0 = input.LA(1);
+
+                    if ( (LA15_0==MINUS||LA15_0==PLUS) ) {
+                        alt15=1;
+                    }
+                    switch (alt15) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:137:4: modifier
+                            {
+                            pushFollow(FOLLOW_modifier_in_atom587);
+                            modifier24=modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_modifier.add(modifier24.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:137:14: ( field )?
+                    int alt16=2;
+                    int LA16_0 = input.LA(1);
+
+                    if ( (LA16_0==TERM_NORMAL) ) {
+                        int LA16_1 = input.LA(2);
+
+                        if ( (LA16_1==COLON) ) {
+                            alt16=1;
+                        }
+                    }
+                    switch (alt16) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:137:14: field
+                            {
+                            pushFollow(FOLLOW_field_in_atom590);
+                            field25=field();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_field.add(field25.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    pushFollow(FOLLOW_value_in_atom593);
+                    value26=value();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_value.add(value26.getTree());
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:137:27: ( term_modifier )?
+                    int alt17=2;
+                    int LA17_0 = input.LA(1);
+
+                    if ( (LA17_0==CARAT||LA17_0==TILDE) ) {
+                        alt17=1;
+                    }
+                    switch (alt17) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:137:27: term_modifier
+                            {
+                            pushFollow(FOLLOW_term_modifier_in_atom595);
+                            term_modifier27=term_modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_term_modifier.add(term_modifier27.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    // AST REWRITE
+                    // elements: value, modifier, field, term_modifier
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 138:3: -> ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD ( field )? value ) ) )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:138:6: ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD ( field )? value ) ) )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(MODIFIER, "MODIFIER")
+                        , root_1);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:138:17: ( modifier )?
+                        if ( stream_modifier.hasNext() ) {
+                            adaptor.addChild(root_1, stream_modifier.nextTree());
+
+                        }
+                        stream_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:138:27: ^( TMODIFIER ( term_modifier )? ^( FIELD ( field )? value ) )
+                        {
+                        Object root_2 = (Object)adaptor.nil();
+                        root_2 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(TMODIFIER, "TMODIFIER")
+                        , root_2);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:138:39: ( term_modifier )?
+                        if ( stream_term_modifier.hasNext() ) {
+                            adaptor.addChild(root_2, stream_term_modifier.nextTree());
+
+                        }
+                        stream_term_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:138:54: ^( FIELD ( field )? value )
+                        {
+                        Object root_3 = (Object)adaptor.nil();
+                        root_3 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(FIELD, "FIELD")
+                        , root_3);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:138:62: ( field )?
+                        if ( stream_field.hasNext() ) {
+                            adaptor.addChild(root_3, stream_field.nextTree());
+
+                        }
+                        stream_field.reset();
+
+                        adaptor.addChild(root_3, stream_value.nextTree());
+
+                        adaptor.addChild(root_2, root_3);
+                        }
+
+                        adaptor.addChild(root_1, root_2);
+                        }
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "atom"
+
+
+    public static class field_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "field"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:142:1: field : TERM_NORMAL COLON -> TERM_NORMAL ;
+    public final StandardLuceneGrammarParser.field_return field() throws RecognitionException {
+        StandardLuceneGrammarParser.field_return retval = new StandardLuceneGrammarParser.field_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token TERM_NORMAL28=null;
+        Token COLON29=null;
+
+        Object TERM_NORMAL28_tree=null;
+        Object COLON29_tree=null;
+        RewriteRuleTokenStream stream_COLON=new RewriteRuleTokenStream(adaptor,"token COLON");
+        RewriteRuleTokenStream stream_TERM_NORMAL=new RewriteRuleTokenStream(adaptor,"token TERM_NORMAL");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:143:2: ( TERM_NORMAL COLON -> TERM_NORMAL )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:144:2: TERM_NORMAL COLON
+            {
+            TERM_NORMAL28=(Token)match(input,TERM_NORMAL,FOLLOW_TERM_NORMAL_in_field642); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_TERM_NORMAL.add(TERM_NORMAL28);
+
+
+            COLON29=(Token)match(input,COLON,FOLLOW_COLON_in_field644); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_COLON.add(COLON29);
+
+
+            // AST REWRITE
+            // elements: TERM_NORMAL
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 144:20: -> TERM_NORMAL
+            {
+                adaptor.addChild(root_0, 
+                stream_TERM_NORMAL.nextNode()
+                );
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "field"
+
+
+    public static class value_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "value"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:147:1: value : ( range_term_in -> ^( QRANGEIN range_term_in ) | range_term_ex -> ^( QRANGEEX range_term_ex ) | normal -> ^( QNORMAL normal ) | truncated -> ^( QTRUNCATED truncated ) | quoted -> ^( QPHRASE quoted ) | quoted_truncated -> ^( QPHRASETRUNC quoted_truncated ) | QMARK -> ^( QTRUNCATED QMARK ) | STAR COLON b= STAR -> ^( QANYTHING $b) | STAR -> ^( QTRUNCATED STAR ) );
+    public final StandardLuceneGrammarParser.value_return value() throws RecognitionException {
+        StandardLuceneGrammarParser.value_return retval = new StandardLuceneGrammarParser.value_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token b=null;
+        Token QMARK36=null;
+        Token STAR37=null;
+        Token COLON38=null;
+        Token STAR39=null;
+        StandardLuceneGrammarParser.range_term_in_return range_term_in30 =null;
+
+        StandardLuceneGrammarParser.range_term_ex_return range_term_ex31 =null;
+
+        StandardLuceneGrammarParser.normal_return normal32 =null;
+
+        StandardLuceneGrammarParser.truncated_return truncated33 =null;
+
+        StandardLuceneGrammarParser.quoted_return quoted34 =null;
+
+        StandardLuceneGrammarParser.quoted_truncated_return quoted_truncated35 =null;
+
+
+        Object b_tree=null;
+        Object QMARK36_tree=null;
+        Object STAR37_tree=null;
+        Object COLON38_tree=null;
+        Object STAR39_tree=null;
+        RewriteRuleTokenStream stream_COLON=new RewriteRuleTokenStream(adaptor,"token COLON");
+        RewriteRuleTokenStream stream_STAR=new RewriteRuleTokenStream(adaptor,"token STAR");
+        RewriteRuleTokenStream stream_QMARK=new RewriteRuleTokenStream(adaptor,"token QMARK");
+        RewriteRuleSubtreeStream stream_range_term_ex=new RewriteRuleSubtreeStream(adaptor,"rule range_term_ex");
+        RewriteRuleSubtreeStream stream_normal=new RewriteRuleSubtreeStream(adaptor,"rule normal");
+        RewriteRuleSubtreeStream stream_quoted=new RewriteRuleSubtreeStream(adaptor,"rule quoted");
+        RewriteRuleSubtreeStream stream_quoted_truncated=new RewriteRuleSubtreeStream(adaptor,"rule quoted_truncated");
+        RewriteRuleSubtreeStream stream_truncated=new RewriteRuleSubtreeStream(adaptor,"rule truncated");
+        RewriteRuleSubtreeStream stream_range_term_in=new RewriteRuleSubtreeStream(adaptor,"rule range_term_in");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:148:2: ( range_term_in -> ^( QRANGEIN range_term_in ) | range_term_ex -> ^( QRANGEEX range_term_ex ) | normal -> ^( QNORMAL normal ) | truncated -> ^( QTRUNCATED truncated ) | quoted -> ^( QPHRASE quoted ) | quoted_truncated -> ^( QPHRASETRUNC quoted_truncated ) | QMARK -> ^( QTRUNCATED QMARK ) | STAR COLON b= STAR -> ^( QANYTHING $b) | STAR -> ^( QTRUNCATED STAR ) )
+            int alt19=9;
+            switch ( input.LA(1) ) {
+            case LBRACK:
+                {
+                alt19=1;
+                }
+                break;
+            case LCURLY:
+                {
+                alt19=2;
+                }
+                break;
+            case NUMBER:
+            case TERM_NORMAL:
+                {
+                alt19=3;
+                }
+                break;
+            case TERM_TRUNCATED:
+                {
+                alt19=4;
+                }
+                break;
+            case PHRASE:
+                {
+                alt19=5;
+                }
+                break;
+            case PHRASE_ANYTHING:
+                {
+                alt19=6;
+                }
+                break;
+            case QMARK:
+                {
+                alt19=7;
+                }
+                break;
+            case STAR:
+                {
+                int LA19_8 = input.LA(2);
+
+                if ( (LA19_8==COLON) ) {
+                    alt19=8;
+                }
+                else if ( (LA19_8==EOF||LA19_8==AND||LA19_8==CARAT||(LA19_8 >= LBRACK && LA19_8 <= MINUS)||(LA19_8 >= NOT && LA19_8 <= NUMBER)||(LA19_8 >= OR && LA19_8 <= PLUS)||LA19_8==QMARK||LA19_8==RPAREN||LA19_8==STAR||LA19_8==TERM_NORMAL||(LA19_8 >= TERM_TRUNCATED && LA19_8 <= TILDE)) ) {
+                    alt19=9;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 19, 8, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            default:
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 19, 0, input);
+
+                throw nvae;
+
+            }
+
+            switch (alt19) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:149:2: range_term_in
+                    {
+                    pushFollow(FOLLOW_range_term_in_in_value663);
+                    range_term_in30=range_term_in();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_range_term_in.add(range_term_in30.getTree());
+
+                    // AST REWRITE
+                    // elements: range_term_in
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 149:16: -> ^( QRANGEIN range_term_in )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:149:19: ^( QRANGEIN range_term_in )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QRANGEIN, "QRANGEIN")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_range_term_in.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:150:4: range_term_ex
+                    {
+                    pushFollow(FOLLOW_range_term_ex_in_value676);
+                    range_term_ex31=range_term_ex();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_range_term_ex.add(range_term_ex31.getTree());
+
+                    // AST REWRITE
+                    // elements: range_term_ex
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 150:18: -> ^( QRANGEEX range_term_ex )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:150:21: ^( QRANGEEX range_term_ex )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QRANGEEX, "QRANGEEX")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_range_term_ex.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 3 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:151:4: normal
+                    {
+                    pushFollow(FOLLOW_normal_in_value690);
+                    normal32=normal();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_normal.add(normal32.getTree());
+
+                    // AST REWRITE
+                    // elements: normal
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 151:11: -> ^( QNORMAL normal )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:151:14: ^( QNORMAL normal )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QNORMAL, "QNORMAL")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_normal.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 4 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:152:4: truncated
+                    {
+                    pushFollow(FOLLOW_truncated_in_value704);
+                    truncated33=truncated();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_truncated.add(truncated33.getTree());
+
+                    // AST REWRITE
+                    // elements: truncated
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 152:14: -> ^( QTRUNCATED truncated )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:152:17: ^( QTRUNCATED truncated )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QTRUNCATED, "QTRUNCATED")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_truncated.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 5 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:153:4: quoted
+                    {
+                    pushFollow(FOLLOW_quoted_in_value718);
+                    quoted34=quoted();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_quoted.add(quoted34.getTree());
+
+                    // AST REWRITE
+                    // elements: quoted
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 153:11: -> ^( QPHRASE quoted )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:153:14: ^( QPHRASE quoted )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QPHRASE, "QPHRASE")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_quoted.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 6 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:154:4: quoted_truncated
+                    {
+                    pushFollow(FOLLOW_quoted_truncated_in_value731);
+                    quoted_truncated35=quoted_truncated();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_quoted_truncated.add(quoted_truncated35.getTree());
+
+                    // AST REWRITE
+                    // elements: quoted_truncated
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 154:21: -> ^( QPHRASETRUNC quoted_truncated )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:154:24: ^( QPHRASETRUNC quoted_truncated )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QPHRASETRUNC, "QPHRASETRUNC")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_quoted_truncated.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 7 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:155:4: QMARK
+                    {
+                    QMARK36=(Token)match(input,QMARK,FOLLOW_QMARK_in_value744); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_QMARK.add(QMARK36);
+
+
+                    // AST REWRITE
+                    // elements: QMARK
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 155:10: -> ^( QTRUNCATED QMARK )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:155:13: ^( QTRUNCATED QMARK )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QTRUNCATED, "QTRUNCATED")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_QMARK.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 8 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:156:4: STAR COLON b= STAR
+                    {
+                    STAR37=(Token)match(input,STAR,FOLLOW_STAR_in_value757); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_STAR.add(STAR37);
+
+
+                    COLON38=(Token)match(input,COLON,FOLLOW_COLON_in_value759); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_COLON.add(COLON38);
+
+
+                    b=(Token)match(input,STAR,FOLLOW_STAR_in_value763); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_STAR.add(b);
+
+
+                    // AST REWRITE
+                    // elements: b
+                    // token labels: b
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleTokenStream stream_b=new RewriteRuleTokenStream(adaptor,"token b",b);
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 156:22: -> ^( QANYTHING $b)
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:156:25: ^( QANYTHING $b)
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QANYTHING, "QANYTHING")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_b.nextNode());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 9 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:157:5: STAR
+                    {
+                    STAR39=(Token)match(input,STAR,FOLLOW_STAR_in_value778); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_STAR.add(STAR39);
+
+
+                    // AST REWRITE
+                    // elements: STAR
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 157:10: -> ^( QTRUNCATED STAR )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:157:13: ^( QTRUNCATED STAR )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QTRUNCATED, "QTRUNCATED")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_STAR.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "value"
+
+
+    public static class range_term_in_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "range_term_in"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:162:1: range_term_in : LBRACK (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) ) ( ( TO )? b= range_value -> $a ( $b)? )? RBRACK ;
+    public final StandardLuceneGrammarParser.range_term_in_return range_term_in() throws RecognitionException {
+        StandardLuceneGrammarParser.range_term_in_return retval = new StandardLuceneGrammarParser.range_term_in_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token LBRACK40=null;
+        Token TO41=null;
+        Token RBRACK42=null;
+        StandardLuceneGrammarParser.range_value_return a =null;
+
+        StandardLuceneGrammarParser.range_value_return b =null;
+
+
+        Object LBRACK40_tree=null;
+        Object TO41_tree=null;
+        Object RBRACK42_tree=null;
+        RewriteRuleTokenStream stream_RBRACK=new RewriteRuleTokenStream(adaptor,"token RBRACK");
+        RewriteRuleTokenStream stream_LBRACK=new RewriteRuleTokenStream(adaptor,"token LBRACK");
+        RewriteRuleTokenStream stream_TO=new RewriteRuleTokenStream(adaptor,"token TO");
+        RewriteRuleSubtreeStream stream_range_value=new RewriteRuleSubtreeStream(adaptor,"rule range_value");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:163:2: ( LBRACK (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) ) ( ( TO )? b= range_value -> $a ( $b)? )? RBRACK )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:164:8: LBRACK (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) ) ( ( TO )? b= range_value -> $a ( $b)? )? RBRACK
+            {
+            LBRACK40=(Token)match(input,LBRACK,FOLLOW_LBRACK_in_range_term_in809); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_LBRACK.add(LBRACK40);
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:165:8: (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:165:9: a= range_value
+            {
+            pushFollow(FOLLOW_range_value_in_range_term_in821);
+            a=range_value();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_range_value.add(a.getTree());
+
+            // AST REWRITE
+            // elements: range_value
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 165:23: -> range_value ^( QANYTHING QANYTHING[\"*\"] )
+            {
+                adaptor.addChild(root_0, stream_range_value.nextTree());
+
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:165:38: ^( QANYTHING QANYTHING[\"*\"] )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(QANYTHING, "QANYTHING")
+                , root_1);
+
+                adaptor.addChild(root_1, 
+                (Object)adaptor.create(QANYTHING, "*")
+                );
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:166:8: ( ( TO )? b= range_value -> $a ( $b)? )?
+            int alt21=2;
+            int LA21_0 = input.LA(1);
+
+            if ( (LA21_0==DATE_TOKEN||LA21_0==NUMBER||(LA21_0 >= PHRASE && LA21_0 <= PHRASE_ANYTHING)||LA21_0==STAR||LA21_0==TERM_NORMAL||LA21_0==TERM_TRUNCATED||LA21_0==TO) ) {
+                alt21=1;
+            }
+            switch (alt21) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:166:10: ( TO )? b= range_value
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:166:10: ( TO )?
+                    int alt20=2;
+                    int LA20_0 = input.LA(1);
+
+                    if ( (LA20_0==TO) ) {
+                        alt20=1;
+                    }
+                    switch (alt20) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:166:10: TO
+                            {
+                            TO41=(Token)match(input,TO,FOLLOW_TO_in_range_term_in844); if (state.failed) return retval; 
+                            if ( state.backtracking==0 ) stream_TO.add(TO41);
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    pushFollow(FOLLOW_range_value_in_range_term_in849);
+                    b=range_value();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_range_value.add(b.getTree());
+
+                    // AST REWRITE
+                    // elements: a, b
+                    // token labels: 
+                    // rule labels: retval, b, a
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+                    RewriteRuleSubtreeStream stream_b=new RewriteRuleSubtreeStream(adaptor,"rule b",b!=null?b.tree:null);
+                    RewriteRuleSubtreeStream stream_a=new RewriteRuleSubtreeStream(adaptor,"rule a",a!=null?a.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 166:28: -> $a ( $b)?
+                    {
+                        adaptor.addChild(root_0, stream_a.nextTree());
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:166:35: ( $b)?
+                        if ( stream_b.hasNext() ) {
+                            adaptor.addChild(root_0, stream_b.nextTree());
+
+                        }
+                        stream_b.reset();
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+
+
+            RBRACK42=(Token)match(input,RBRACK,FOLLOW_RBRACK_in_range_term_in870); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_RBRACK.add(RBRACK42);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "range_term_in"
+
+
+    public static class range_term_ex_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "range_term_ex"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:171:1: range_term_ex : LCURLY (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) ) ( ( TO )? b= range_value -> $a ( $b)? )? RCURLY ;
+    public final StandardLuceneGrammarParser.range_term_ex_return range_term_ex() throws RecognitionException {
+        StandardLuceneGrammarParser.range_term_ex_return retval = new StandardLuceneGrammarParser.range_term_ex_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token LCURLY43=null;
+        Token TO44=null;
+        Token RCURLY45=null;
+        StandardLuceneGrammarParser.range_value_return a =null;
+
+        StandardLuceneGrammarParser.range_value_return b =null;
+
+
+        Object LCURLY43_tree=null;
+        Object TO44_tree=null;
+        Object RCURLY45_tree=null;
+        RewriteRuleTokenStream stream_LCURLY=new RewriteRuleTokenStream(adaptor,"token LCURLY");
+        RewriteRuleTokenStream stream_TO=new RewriteRuleTokenStream(adaptor,"token TO");
+        RewriteRuleTokenStream stream_RCURLY=new RewriteRuleTokenStream(adaptor,"token RCURLY");
+        RewriteRuleSubtreeStream stream_range_value=new RewriteRuleSubtreeStream(adaptor,"rule range_value");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:172:2: ( LCURLY (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) ) ( ( TO )? b= range_value -> $a ( $b)? )? RCURLY )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:173:8: LCURLY (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) ) ( ( TO )? b= range_value -> $a ( $b)? )? RCURLY
+            {
+            LCURLY43=(Token)match(input,LCURLY,FOLLOW_LCURLY_in_range_term_ex890); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_LCURLY.add(LCURLY43);
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:174:8: (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:174:10: a= range_value
+            {
+            pushFollow(FOLLOW_range_value_in_range_term_ex903);
+            a=range_value();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_range_value.add(a.getTree());
+
+            // AST REWRITE
+            // elements: range_value
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 174:24: -> range_value ^( QANYTHING QANYTHING[\"*\"] )
+            {
+                adaptor.addChild(root_0, stream_range_value.nextTree());
+
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:174:39: ^( QANYTHING QANYTHING[\"*\"] )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(QANYTHING, "QANYTHING")
+                , root_1);
+
+                adaptor.addChild(root_1, 
+                (Object)adaptor.create(QANYTHING, "*")
+                );
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:175:8: ( ( TO )? b= range_value -> $a ( $b)? )?
+            int alt23=2;
+            int LA23_0 = input.LA(1);
+
+            if ( (LA23_0==DATE_TOKEN||LA23_0==NUMBER||(LA23_0 >= PHRASE && LA23_0 <= PHRASE_ANYTHING)||LA23_0==STAR||LA23_0==TERM_NORMAL||LA23_0==TERM_TRUNCATED||LA23_0==TO) ) {
+                alt23=1;
+            }
+            switch (alt23) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:175:10: ( TO )? b= range_value
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:175:10: ( TO )?
+                    int alt22=2;
+                    int LA22_0 = input.LA(1);
+
+                    if ( (LA22_0==TO) ) {
+                        alt22=1;
+                    }
+                    switch (alt22) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:175:10: TO
+                            {
+                            TO44=(Token)match(input,TO,FOLLOW_TO_in_range_term_ex926); if (state.failed) return retval; 
+                            if ( state.backtracking==0 ) stream_TO.add(TO44);
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    pushFollow(FOLLOW_range_value_in_range_term_ex931);
+                    b=range_value();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_range_value.add(b.getTree());
+
+                    // AST REWRITE
+                    // elements: b, a
+                    // token labels: 
+                    // rule labels: retval, b, a
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+                    RewriteRuleSubtreeStream stream_b=new RewriteRuleSubtreeStream(adaptor,"rule b",b!=null?b.tree:null);
+                    RewriteRuleSubtreeStream stream_a=new RewriteRuleSubtreeStream(adaptor,"rule a",a!=null?a.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 175:28: -> $a ( $b)?
+                    {
+                        adaptor.addChild(root_0, stream_a.nextTree());
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:175:35: ( $b)?
+                        if ( stream_b.hasNext() ) {
+                            adaptor.addChild(root_0, stream_b.nextTree());
+
+                        }
+                        stream_b.reset();
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+
+
+            RCURLY45=(Token)match(input,RCURLY,FOLLOW_RCURLY_in_range_term_ex952); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_RCURLY.add(RCURLY45);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "range_term_ex"
+
+
+    public static class range_value_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "range_value"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:179:1: range_value : ( truncated -> ^( QTRUNCATED truncated ) | quoted -> ^( QPHRASE quoted ) | quoted_truncated -> ^( QPHRASETRUNC quoted_truncated ) | date -> ^( QNORMAL date ) | normal -> ^( QNORMAL normal ) | STAR -> ^( QANYTHING STAR ) );
+    public final StandardLuceneGrammarParser.range_value_return range_value() throws RecognitionException {
+        StandardLuceneGrammarParser.range_value_return retval = new StandardLuceneGrammarParser.range_value_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token STAR51=null;
+        StandardLuceneGrammarParser.truncated_return truncated46 =null;
+
+        StandardLuceneGrammarParser.quoted_return quoted47 =null;
+
+        StandardLuceneGrammarParser.quoted_truncated_return quoted_truncated48 =null;
+
+        StandardLuceneGrammarParser.date_return date49 =null;
+
+        StandardLuceneGrammarParser.normal_return normal50 =null;
+
+
+        Object STAR51_tree=null;
+        RewriteRuleTokenStream stream_STAR=new RewriteRuleTokenStream(adaptor,"token STAR");
+        RewriteRuleSubtreeStream stream_normal=new RewriteRuleSubtreeStream(adaptor,"rule normal");
+        RewriteRuleSubtreeStream stream_quoted=new RewriteRuleSubtreeStream(adaptor,"rule quoted");
+        RewriteRuleSubtreeStream stream_quoted_truncated=new RewriteRuleSubtreeStream(adaptor,"rule quoted_truncated");
+        RewriteRuleSubtreeStream stream_truncated=new RewriteRuleSubtreeStream(adaptor,"rule truncated");
+        RewriteRuleSubtreeStream stream_date=new RewriteRuleSubtreeStream(adaptor,"rule date");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:180:2: ( truncated -> ^( QTRUNCATED truncated ) | quoted -> ^( QPHRASE quoted ) | quoted_truncated -> ^( QPHRASETRUNC quoted_truncated ) | date -> ^( QNORMAL date ) | normal -> ^( QNORMAL normal ) | STAR -> ^( QANYTHING STAR ) )
+            int alt24=6;
+            switch ( input.LA(1) ) {
+            case TERM_TRUNCATED:
+                {
+                alt24=1;
+                }
+                break;
+            case PHRASE:
+                {
+                alt24=2;
+                }
+                break;
+            case PHRASE_ANYTHING:
+                {
+                alt24=3;
+                }
+                break;
+            case DATE_TOKEN:
+                {
+                alt24=4;
+                }
+                break;
+            case NUMBER:
+            case TERM_NORMAL:
+                {
+                alt24=5;
+                }
+                break;
+            case STAR:
+                {
+                alt24=6;
+                }
+                break;
+            default:
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 24, 0, input);
+
+                throw nvae;
+
+            }
+
+            switch (alt24) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:181:2: truncated
+                    {
+                    pushFollow(FOLLOW_truncated_in_range_value966);
+                    truncated46=truncated();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_truncated.add(truncated46.getTree());
+
+                    // AST REWRITE
+                    // elements: truncated
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 181:12: -> ^( QTRUNCATED truncated )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:181:15: ^( QTRUNCATED truncated )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QTRUNCATED, "QTRUNCATED")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_truncated.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:182:4: quoted
+                    {
+                    pushFollow(FOLLOW_quoted_in_range_value979);
+                    quoted47=quoted();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_quoted.add(quoted47.getTree());
+
+                    // AST REWRITE
+                    // elements: quoted
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 182:11: -> ^( QPHRASE quoted )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:182:14: ^( QPHRASE quoted )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QPHRASE, "QPHRASE")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_quoted.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 3 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:183:4: quoted_truncated
+                    {
+                    pushFollow(FOLLOW_quoted_truncated_in_range_value992);
+                    quoted_truncated48=quoted_truncated();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_quoted_truncated.add(quoted_truncated48.getTree());
+
+                    // AST REWRITE
+                    // elements: quoted_truncated
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 183:21: -> ^( QPHRASETRUNC quoted_truncated )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:183:24: ^( QPHRASETRUNC quoted_truncated )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QPHRASETRUNC, "QPHRASETRUNC")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_quoted_truncated.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 4 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:184:4: date
+                    {
+                    pushFollow(FOLLOW_date_in_range_value1005);
+                    date49=date();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_date.add(date49.getTree());
+
+                    // AST REWRITE
+                    // elements: date
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 184:9: -> ^( QNORMAL date )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:184:12: ^( QNORMAL date )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QNORMAL, "QNORMAL")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_date.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 5 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:185:4: normal
+                    {
+                    pushFollow(FOLLOW_normal_in_range_value1018);
+                    normal50=normal();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_normal.add(normal50.getTree());
+
+                    // AST REWRITE
+                    // elements: normal
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 185:11: -> ^( QNORMAL normal )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:185:14: ^( QNORMAL normal )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QNORMAL, "QNORMAL")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_normal.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 6 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:186:4: STAR
+                    {
+                    STAR51=(Token)match(input,STAR,FOLLOW_STAR_in_range_value1032); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_STAR.add(STAR51);
+
+
+                    // AST REWRITE
+                    // elements: STAR
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 186:9: -> ^( QANYTHING STAR )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:186:12: ^( QANYTHING STAR )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QANYTHING, "QANYTHING")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_STAR.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "range_value"
+
+
+    public static class multi_value_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multi_value"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:189:1: multi_value : LPAREN multiClause RPAREN -> multiClause ;
+    public final StandardLuceneGrammarParser.multi_value_return multi_value() throws RecognitionException {
+        StandardLuceneGrammarParser.multi_value_return retval = new StandardLuceneGrammarParser.multi_value_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token LPAREN52=null;
+        Token RPAREN54=null;
+        StandardLuceneGrammarParser.multiClause_return multiClause53 =null;
+
+
+        Object LPAREN52_tree=null;
+        Object RPAREN54_tree=null;
+        RewriteRuleTokenStream stream_RPAREN=new RewriteRuleTokenStream(adaptor,"token RPAREN");
+        RewriteRuleTokenStream stream_LPAREN=new RewriteRuleTokenStream(adaptor,"token LPAREN");
+        RewriteRuleSubtreeStream stream_multiClause=new RewriteRuleSubtreeStream(adaptor,"rule multiClause");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:190:2: ( LPAREN multiClause RPAREN -> multiClause )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:191:2: LPAREN multiClause RPAREN
+            {
+            LPAREN52=(Token)match(input,LPAREN,FOLLOW_LPAREN_in_multi_value1053); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_LPAREN.add(LPAREN52);
+
+
+            pushFollow(FOLLOW_multiClause_in_multi_value1055);
+            multiClause53=multiClause();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_multiClause.add(multiClause53.getTree());
+
+            RPAREN54=(Token)match(input,RPAREN,FOLLOW_RPAREN_in_multi_value1057); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_RPAREN.add(RPAREN54);
+
+
+            // AST REWRITE
+            // elements: multiClause
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 191:28: -> multiClause
+            {
+                adaptor.addChild(root_0, stream_multiClause.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multi_value"
+
+
+    public static class multiClause_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiClause"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:196:1: multiClause : ( clauseOr )+ -> ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ;
+    public final StandardLuceneGrammarParser.multiClause_return multiClause() throws RecognitionException {
+        StandardLuceneGrammarParser.multiClause_return retval = new StandardLuceneGrammarParser.multiClause_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        StandardLuceneGrammarParser.clauseOr_return clauseOr55 =null;
+
+
+        RewriteRuleSubtreeStream stream_clauseOr=new RewriteRuleSubtreeStream(adaptor,"rule clauseOr");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:197:2: ( ( clauseOr )+ -> ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:202:2: ( clauseOr )+
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:202:2: ( clauseOr )+
+            int cnt25=0;
+            loop25:
+            do {
+                int alt25=2;
+                int LA25_0 = input.LA(1);
+
+                if ( ((LA25_0 >= LBRACK && LA25_0 <= MINUS)||LA25_0==NUMBER||(LA25_0 >= PHRASE && LA25_0 <= PLUS)||LA25_0==QMARK||LA25_0==STAR||LA25_0==TERM_NORMAL||LA25_0==TERM_TRUNCATED) ) {
+                    alt25=1;
+                }
+
+
+                switch (alt25) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:202:2: clauseOr
+            	    {
+            	    pushFollow(FOLLOW_clauseOr_in_multiClause1084);
+            	    clauseOr55=clauseOr();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_clauseOr.add(clauseOr55.getTree());
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt25 >= 1 ) break loop25;
+            	    if (state.backtracking>0) {state.failed=true; return retval;}
+                        EarlyExitException eee =
+                            new EarlyExitException(25, input);
+                        throw eee;
+                }
+                cnt25++;
+            } while (true);
+
+
+            // AST REWRITE
+            // elements: clauseOr
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 202:12: -> ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:202:15: ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(OPERATOR, "DEFOP")
+                , root_1);
+
+                if ( !(stream_clauseOr.hasNext()) ) {
+                    throw new RewriteEarlyExitException();
+                }
+                while ( stream_clauseOr.hasNext() ) {
+                    adaptor.addChild(root_1, stream_clauseOr.nextTree());
+
+                }
+                stream_clauseOr.reset();
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiClause"
+
+
+    public static class multiDefault_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiDefault"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:215:1: multiDefault : ( multiOr )+ -> ^( OPERATOR[\"DEFOP\"] ( multiOr )+ ) ;
+    public final StandardLuceneGrammarParser.multiDefault_return multiDefault() throws RecognitionException {
+        StandardLuceneGrammarParser.multiDefault_return retval = new StandardLuceneGrammarParser.multiDefault_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        StandardLuceneGrammarParser.multiOr_return multiOr56 =null;
+
+
+        RewriteRuleSubtreeStream stream_multiOr=new RewriteRuleSubtreeStream(adaptor,"rule multiOr");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:216:2: ( ( multiOr )+ -> ^( OPERATOR[\"DEFOP\"] ( multiOr )+ ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:217:2: ( multiOr )+
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:217:2: ( multiOr )+
+            int cnt26=0;
+            loop26:
+            do {
+                int alt26=2;
+                int LA26_0 = input.LA(1);
+
+                if ( ((LA26_0 >= LBRACK && LA26_0 <= LCURLY)||LA26_0==MINUS||LA26_0==NUMBER||(LA26_0 >= PHRASE && LA26_0 <= PLUS)||LA26_0==QMARK||LA26_0==STAR||LA26_0==TERM_NORMAL||LA26_0==TERM_TRUNCATED) ) {
+                    alt26=1;
+                }
+
+
+                switch (alt26) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:217:2: multiOr
+            	    {
+            	    pushFollow(FOLLOW_multiOr_in_multiDefault1128);
+            	    multiOr56=multiOr();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_multiOr.add(multiOr56.getTree());
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt26 >= 1 ) break loop26;
+            	    if (state.backtracking>0) {state.failed=true; return retval;}
+                        EarlyExitException eee =
+                            new EarlyExitException(26, input);
+                        throw eee;
+                }
+                cnt26++;
+            } while (true);
+
+
+            // AST REWRITE
+            // elements: multiOr
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 217:11: -> ^( OPERATOR[\"DEFOP\"] ( multiOr )+ )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:217:14: ^( OPERATOR[\"DEFOP\"] ( multiOr )+ )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(OPERATOR, "DEFOP")
+                , root_1);
+
+                if ( !(stream_multiOr.hasNext()) ) {
+                    throw new RewriteEarlyExitException();
+                }
+                while ( stream_multiOr.hasNext() ) {
+                    adaptor.addChild(root_1, stream_multiOr.nextTree());
+
+                }
+                stream_multiOr.reset();
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiDefault"
+
+
+    public static class multiOr_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiOr"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:220:1: multiOr : (first= multiAnd -> $first) ( or others= multiAnd -> ^( OPERATOR[\"OR\"] ( multiAnd )+ ) )* ;
+    public final StandardLuceneGrammarParser.multiOr_return multiOr() throws RecognitionException {
+        StandardLuceneGrammarParser.multiOr_return retval = new StandardLuceneGrammarParser.multiOr_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        StandardLuceneGrammarParser.multiAnd_return first =null;
+
+        StandardLuceneGrammarParser.multiAnd_return others =null;
+
+        StandardLuceneGrammarParser.or_return or57 =null;
+
+
+        RewriteRuleSubtreeStream stream_multiAnd=new RewriteRuleSubtreeStream(adaptor,"rule multiAnd");
+        RewriteRuleSubtreeStream stream_or=new RewriteRuleSubtreeStream(adaptor,"rule or");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:221:2: ( (first= multiAnd -> $first) ( or others= multiAnd -> ^( OPERATOR[\"OR\"] ( multiAnd )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:222:2: (first= multiAnd -> $first) ( or others= multiAnd -> ^( OPERATOR[\"OR\"] ( multiAnd )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:222:2: (first= multiAnd -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:222:3: first= multiAnd
+            {
+            pushFollow(FOLLOW_multiAnd_in_multiOr1156);
+            first=multiAnd();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_multiAnd.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 222:19: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:222:30: ( or others= multiAnd -> ^( OPERATOR[\"OR\"] ( multiAnd )+ ) )*
+            loop27:
+            do {
+                int alt27=2;
+                int LA27_0 = input.LA(1);
+
+                if ( (LA27_0==OR) ) {
+                    alt27=1;
+                }
+
+
+                switch (alt27) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:222:31: or others= multiAnd
+            	    {
+            	    pushFollow(FOLLOW_or_in_multiOr1166);
+            	    or57=or();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_or.add(or57.getTree());
+
+            	    pushFollow(FOLLOW_multiAnd_in_multiOr1170);
+            	    others=multiAnd();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_multiAnd.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: multiAnd
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 222:49: -> ^( OPERATOR[\"OR\"] ( multiAnd )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:222:52: ^( OPERATOR[\"OR\"] ( multiAnd )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(
+            	        (Object)adaptor.create(OPERATOR, "OR")
+            	        , root_1);
+
+            	        if ( !(stream_multiAnd.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_multiAnd.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_multiAnd.nextTree());
+
+            	        }
+            	        stream_multiAnd.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop27;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiOr"
+
+
+    public static class multiAnd_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiAnd"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:225:1: multiAnd : (first= multiNot -> $first) ( and others= multiNot -> ^( OPERATOR[\"AND\"] ( multiNot )+ ) )* ;
+    public final StandardLuceneGrammarParser.multiAnd_return multiAnd() throws RecognitionException {
+        StandardLuceneGrammarParser.multiAnd_return retval = new StandardLuceneGrammarParser.multiAnd_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        StandardLuceneGrammarParser.multiNot_return first =null;
+
+        StandardLuceneGrammarParser.multiNot_return others =null;
+
+        StandardLuceneGrammarParser.and_return and58 =null;
+
+
+        RewriteRuleSubtreeStream stream_multiNot=new RewriteRuleSubtreeStream(adaptor,"rule multiNot");
+        RewriteRuleSubtreeStream stream_and=new RewriteRuleSubtreeStream(adaptor,"rule and");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:226:2: ( (first= multiNot -> $first) ( and others= multiNot -> ^( OPERATOR[\"AND\"] ( multiNot )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:227:2: (first= multiNot -> $first) ( and others= multiNot -> ^( OPERATOR[\"AND\"] ( multiNot )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:227:2: (first= multiNot -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:227:3: first= multiNot
+            {
+            pushFollow(FOLLOW_multiNot_in_multiAnd1201);
+            first=multiNot();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_multiNot.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 227:19: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:227:30: ( and others= multiNot -> ^( OPERATOR[\"AND\"] ( multiNot )+ ) )*
+            loop28:
+            do {
+                int alt28=2;
+                int LA28_0 = input.LA(1);
+
+                if ( (LA28_0==AND) ) {
+                    alt28=1;
+                }
+
+
+                switch (alt28) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:227:31: and others= multiNot
+            	    {
+            	    pushFollow(FOLLOW_and_in_multiAnd1211);
+            	    and58=and();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_and.add(and58.getTree());
+
+            	    pushFollow(FOLLOW_multiNot_in_multiAnd1215);
+            	    others=multiNot();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_multiNot.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: multiNot
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 227:51: -> ^( OPERATOR[\"AND\"] ( multiNot )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:227:54: ^( OPERATOR[\"AND\"] ( multiNot )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(
+            	        (Object)adaptor.create(OPERATOR, "AND")
+            	        , root_1);
+
+            	        if ( !(stream_multiNot.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_multiNot.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_multiNot.nextTree());
+
+            	        }
+            	        stream_multiNot.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop28;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiAnd"
+
+
+    public static class multiNot_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiNot"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:230:1: multiNot : (first= multiBasic -> $first) ( not others= multiBasic -> ^( not ( multiBasic )+ ) )* ;
+    public final StandardLuceneGrammarParser.multiNot_return multiNot() throws RecognitionException {
+        StandardLuceneGrammarParser.multiNot_return retval = new StandardLuceneGrammarParser.multiNot_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        StandardLuceneGrammarParser.multiBasic_return first =null;
+
+        StandardLuceneGrammarParser.multiBasic_return others =null;
+
+        StandardLuceneGrammarParser.not_return not59 =null;
+
+
+        RewriteRuleSubtreeStream stream_not=new RewriteRuleSubtreeStream(adaptor,"rule not");
+        RewriteRuleSubtreeStream stream_multiBasic=new RewriteRuleSubtreeStream(adaptor,"rule multiBasic");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:231:2: ( (first= multiBasic -> $first) ( not others= multiBasic -> ^( not ( multiBasic )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:232:2: (first= multiBasic -> $first) ( not others= multiBasic -> ^( not ( multiBasic )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:232:2: (first= multiBasic -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:232:3: first= multiBasic
+            {
+            pushFollow(FOLLOW_multiBasic_in_multiNot1246);
+            first=multiBasic();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_multiBasic.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 232:21: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:232:32: ( not others= multiBasic -> ^( not ( multiBasic )+ ) )*
+            loop29:
+            do {
+                int alt29=2;
+                int LA29_0 = input.LA(1);
+
+                if ( (LA29_0==AND) ) {
+                    int LA29_1 = input.LA(2);
+
+                    if ( (LA29_1==NOT) ) {
+                        alt29=1;
+                    }
+
+
+                }
+                else if ( (LA29_0==NOT) ) {
+                    alt29=1;
+                }
+
+
+                switch (alt29) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:232:33: not others= multiBasic
+            	    {
+            	    pushFollow(FOLLOW_not_in_multiNot1256);
+            	    not59=not();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_not.add(not59.getTree());
+
+            	    pushFollow(FOLLOW_multiBasic_in_multiNot1260);
+            	    others=multiBasic();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_multiBasic.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: not, multiBasic
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 232:54: -> ^( not ( multiBasic )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:232:57: ^( not ( multiBasic )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(stream_not.nextNode(), root_1);
+
+            	        if ( !(stream_multiBasic.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_multiBasic.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_multiBasic.nextTree());
+
+            	        }
+            	        stream_multiBasic.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop29;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiNot"
+
+
+    public static class multiBasic_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiBasic"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:237:1: multiBasic : mterm ;
+    public final StandardLuceneGrammarParser.multiBasic_return multiBasic() throws RecognitionException {
+        StandardLuceneGrammarParser.multiBasic_return retval = new StandardLuceneGrammarParser.multiBasic_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        StandardLuceneGrammarParser.mterm_return mterm60 =null;
+
+
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:238:2: ( mterm )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:239:2: mterm
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            pushFollow(FOLLOW_mterm_in_multiBasic1287);
+            mterm60=mterm();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) adaptor.addChild(root_0, mterm60.getTree());
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiBasic"
+
+
+    public static class mterm_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "mterm"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:242:1: mterm : ( modifier )? value -> ^( MODIFIER ( modifier )? value ) ;
+    public final StandardLuceneGrammarParser.mterm_return mterm() throws RecognitionException {
+        StandardLuceneGrammarParser.mterm_return retval = new StandardLuceneGrammarParser.mterm_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        StandardLuceneGrammarParser.modifier_return modifier61 =null;
+
+        StandardLuceneGrammarParser.value_return value62 =null;
+
+
+        RewriteRuleSubtreeStream stream_modifier=new RewriteRuleSubtreeStream(adaptor,"rule modifier");
+        RewriteRuleSubtreeStream stream_value=new RewriteRuleSubtreeStream(adaptor,"rule value");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:243:2: ( ( modifier )? value -> ^( MODIFIER ( modifier )? value ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:244:2: ( modifier )? value
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:244:2: ( modifier )?
+            int alt30=2;
+            int LA30_0 = input.LA(1);
+
+            if ( (LA30_0==MINUS||LA30_0==PLUS) ) {
+                alt30=1;
+            }
+            switch (alt30) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:244:2: modifier
+                    {
+                    pushFollow(FOLLOW_modifier_in_mterm1303);
+                    modifier61=modifier();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_modifier.add(modifier61.getTree());
+
+                    }
+                    break;
+
+            }
+
+
+            pushFollow(FOLLOW_value_in_mterm1306);
+            value62=value();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_value.add(value62.getTree());
+
+            // AST REWRITE
+            // elements: modifier, value
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 244:18: -> ^( MODIFIER ( modifier )? value )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:244:21: ^( MODIFIER ( modifier )? value )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(MODIFIER, "MODIFIER")
+                , root_1);
+
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:244:32: ( modifier )?
+                if ( stream_modifier.hasNext() ) {
+                    adaptor.addChild(root_1, stream_modifier.nextTree());
+
+                }
+                stream_modifier.reset();
+
+                adaptor.addChild(root_1, stream_value.nextTree());
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "mterm"
+
+
+    public static class normal_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "normal"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:248:1: normal : ( TERM_NORMAL | NUMBER );
+    public final StandardLuceneGrammarParser.normal_return normal() throws RecognitionException {
+        StandardLuceneGrammarParser.normal_return retval = new StandardLuceneGrammarParser.normal_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token set63=null;
+
+        Object set63_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:249:2: ( TERM_NORMAL | NUMBER )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            set63=(Token)input.LT(1);
+
+            if ( input.LA(1)==NUMBER||input.LA(1)==TERM_NORMAL ) {
+                input.consume();
+                if ( state.backtracking==0 ) adaptor.addChild(root_0, 
+                (Object)adaptor.create(set63)
+                );
+                state.errorRecovery=false;
+                state.failed=false;
+            }
+            else {
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                throw mse;
+            }
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "normal"
+
+
+    public static class truncated_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "truncated"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:257:1: truncated : TERM_TRUNCATED ;
+    public final StandardLuceneGrammarParser.truncated_return truncated() throws RecognitionException {
+        StandardLuceneGrammarParser.truncated_return retval = new StandardLuceneGrammarParser.truncated_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token TERM_TRUNCATED64=null;
+
+        Object TERM_TRUNCATED64_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:258:2: ( TERM_TRUNCATED )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:259:2: TERM_TRUNCATED
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            TERM_TRUNCATED64=(Token)match(input,TERM_TRUNCATED,FOLLOW_TERM_TRUNCATED_in_truncated1359); if (state.failed) return retval;
+            if ( state.backtracking==0 ) {
+            TERM_TRUNCATED64_tree = 
+            (Object)adaptor.create(TERM_TRUNCATED64)
+            ;
+            adaptor.addChild(root_0, TERM_TRUNCATED64_tree);
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "truncated"
+
+
+    public static class quoted_truncated_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "quoted_truncated"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:263:1: quoted_truncated : PHRASE_ANYTHING ;
+    public final StandardLuceneGrammarParser.quoted_truncated_return quoted_truncated() throws RecognitionException {
+        StandardLuceneGrammarParser.quoted_truncated_return retval = new StandardLuceneGrammarParser.quoted_truncated_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token PHRASE_ANYTHING65=null;
+
+        Object PHRASE_ANYTHING65_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:264:2: ( PHRASE_ANYTHING )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:265:2: PHRASE_ANYTHING
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            PHRASE_ANYTHING65=(Token)match(input,PHRASE_ANYTHING,FOLLOW_PHRASE_ANYTHING_in_quoted_truncated1374); if (state.failed) return retval;
+            if ( state.backtracking==0 ) {
+            PHRASE_ANYTHING65_tree = 
+            (Object)adaptor.create(PHRASE_ANYTHING65)
+            ;
+            adaptor.addChild(root_0, PHRASE_ANYTHING65_tree);
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "quoted_truncated"
+
+
+    public static class quoted_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "quoted"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:268:1: quoted : PHRASE ;
+    public final StandardLuceneGrammarParser.quoted_return quoted() throws RecognitionException {
+        StandardLuceneGrammarParser.quoted_return retval = new StandardLuceneGrammarParser.quoted_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token PHRASE66=null;
+
+        Object PHRASE66_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:268:8: ( PHRASE )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:269:2: PHRASE
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            PHRASE66=(Token)match(input,PHRASE,FOLLOW_PHRASE_in_quoted1386); if (state.failed) return retval;
+            if ( state.backtracking==0 ) {
+            PHRASE66_tree = 
+            (Object)adaptor.create(PHRASE66)
+            ;
+            adaptor.addChild(root_0, PHRASE66_tree);
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "quoted"
+
+
+    public static class operator_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "operator"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:275:1: operator : ( AND -> OPERATOR[\"AND\"] | OR -> OPERATOR[\"OR\"] | NOT -> OPERATOR[\"NOT\"] ) ;
+    public final StandardLuceneGrammarParser.operator_return operator() throws RecognitionException {
+        StandardLuceneGrammarParser.operator_return retval = new StandardLuceneGrammarParser.operator_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token AND67=null;
+        Token OR68=null;
+        Token NOT69=null;
+
+        Object AND67_tree=null;
+        Object OR68_tree=null;
+        Object NOT69_tree=null;
+        RewriteRuleTokenStream stream_NOT=new RewriteRuleTokenStream(adaptor,"token NOT");
+        RewriteRuleTokenStream stream_AND=new RewriteRuleTokenStream(adaptor,"token AND");
+        RewriteRuleTokenStream stream_OR=new RewriteRuleTokenStream(adaptor,"token OR");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:275:9: ( ( AND -> OPERATOR[\"AND\"] | OR -> OPERATOR[\"OR\"] | NOT -> OPERATOR[\"NOT\"] ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:275:11: ( AND -> OPERATOR[\"AND\"] | OR -> OPERATOR[\"OR\"] | NOT -> OPERATOR[\"NOT\"] )
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:275:11: ( AND -> OPERATOR[\"AND\"] | OR -> OPERATOR[\"OR\"] | NOT -> OPERATOR[\"NOT\"] )
+            int alt31=3;
+            switch ( input.LA(1) ) {
+            case AND:
+                {
+                alt31=1;
+                }
+                break;
+            case OR:
+                {
+                alt31=2;
+                }
+                break;
+            case NOT:
+                {
+                alt31=3;
+                }
+                break;
+            default:
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 31, 0, input);
+
+                throw nvae;
+
+            }
+
+            switch (alt31) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:276:2: AND
+                    {
+                    AND67=(Token)match(input,AND,FOLLOW_AND_in_operator1402); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_AND.add(AND67);
+
+
+                    // AST REWRITE
+                    // elements: 
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 276:6: -> OPERATOR[\"AND\"]
+                    {
+                        adaptor.addChild(root_0, 
+                        (Object)adaptor.create(OPERATOR, "AND")
+                        );
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:277:4: OR
+                    {
+                    OR68=(Token)match(input,OR,FOLLOW_OR_in_operator1412); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_OR.add(OR68);
+
+
+                    // AST REWRITE
+                    // elements: 
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 277:7: -> OPERATOR[\"OR\"]
+                    {
+                        adaptor.addChild(root_0, 
+                        (Object)adaptor.create(OPERATOR, "OR")
+                        );
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 3 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:278:4: NOT
+                    {
+                    NOT69=(Token)match(input,NOT,FOLLOW_NOT_in_operator1422); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_NOT.add(NOT69);
+
+
+                    // AST REWRITE
+                    // elements: 
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 278:8: -> OPERATOR[\"NOT\"]
+                    {
+                        adaptor.addChild(root_0, 
+                        (Object)adaptor.create(OPERATOR, "NOT")
+                        );
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "operator"
+
+
+    public static class modifier_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "modifier"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:281:1: modifier : ( PLUS -> PLUS[\"+\"] | MINUS -> MINUS[\"-\"] );
+    public final StandardLuceneGrammarParser.modifier_return modifier() throws RecognitionException {
+        StandardLuceneGrammarParser.modifier_return retval = new StandardLuceneGrammarParser.modifier_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token PLUS70=null;
+        Token MINUS71=null;
+
+        Object PLUS70_tree=null;
+        Object MINUS71_tree=null;
+        RewriteRuleTokenStream stream_PLUS=new RewriteRuleTokenStream(adaptor,"token PLUS");
+        RewriteRuleTokenStream stream_MINUS=new RewriteRuleTokenStream(adaptor,"token MINUS");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:281:9: ( PLUS -> PLUS[\"+\"] | MINUS -> MINUS[\"-\"] )
+            int alt32=2;
+            int LA32_0 = input.LA(1);
+
+            if ( (LA32_0==PLUS) ) {
+                alt32=1;
+            }
+            else if ( (LA32_0==MINUS) ) {
+                alt32=2;
+            }
+            else {
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 32, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt32) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:282:2: PLUS
+                    {
+                    PLUS70=(Token)match(input,PLUS,FOLLOW_PLUS_in_modifier1439); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_PLUS.add(PLUS70);
+
+
+                    // AST REWRITE
+                    // elements: PLUS
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 282:7: -> PLUS[\"+\"]
+                    {
+                        adaptor.addChild(root_0, 
+                        (Object)adaptor.create(PLUS, "+")
+                        );
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:283:4: MINUS
+                    {
+                    MINUS71=(Token)match(input,MINUS,FOLLOW_MINUS_in_modifier1449); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_MINUS.add(MINUS71);
+
+
+                    // AST REWRITE
+                    // elements: MINUS
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 283:10: -> MINUS[\"-\"]
+                    {
+                        adaptor.addChild(root_0, 
+                        (Object)adaptor.create(MINUS, "-")
+                        );
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "modifier"
+
+
+    public static class term_modifier_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "term_modifier"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:295:1: term_modifier : ( TILDE ( CARAT )? -> ^( BOOST ( CARAT )? ) ^( FUZZY TILDE ) | CARAT ( TILDE )? -> ^( BOOST CARAT ) ^( FUZZY ( TILDE )? ) );
+    public final StandardLuceneGrammarParser.term_modifier_return term_modifier() throws RecognitionException {
+        StandardLuceneGrammarParser.term_modifier_return retval = new StandardLuceneGrammarParser.term_modifier_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token TILDE72=null;
+        Token CARAT73=null;
+        Token CARAT74=null;
+        Token TILDE75=null;
+
+        Object TILDE72_tree=null;
+        Object CARAT73_tree=null;
+        Object CARAT74_tree=null;
+        Object TILDE75_tree=null;
+        RewriteRuleTokenStream stream_CARAT=new RewriteRuleTokenStream(adaptor,"token CARAT");
+        RewriteRuleTokenStream stream_TILDE=new RewriteRuleTokenStream(adaptor,"token TILDE");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:295:15: ( TILDE ( CARAT )? -> ^( BOOST ( CARAT )? ) ^( FUZZY TILDE ) | CARAT ( TILDE )? -> ^( BOOST CARAT ) ^( FUZZY ( TILDE )? ) )
+            int alt35=2;
+            int LA35_0 = input.LA(1);
+
+            if ( (LA35_0==TILDE) ) {
+                alt35=1;
+            }
+            else if ( (LA35_0==CARAT) ) {
+                alt35=2;
+            }
+            else {
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 35, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt35) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:296:2: TILDE ( CARAT )?
+                    {
+                    TILDE72=(Token)match(input,TILDE,FOLLOW_TILDE_in_term_modifier1467); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_TILDE.add(TILDE72);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:296:8: ( CARAT )?
+                    int alt33=2;
+                    int LA33_0 = input.LA(1);
+
+                    if ( (LA33_0==CARAT) ) {
+                        alt33=1;
+                    }
+                    switch (alt33) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:296:8: CARAT
+                            {
+                            CARAT73=(Token)match(input,CARAT,FOLLOW_CARAT_in_term_modifier1469); if (state.failed) return retval; 
+                            if ( state.backtracking==0 ) stream_CARAT.add(CARAT73);
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    // AST REWRITE
+                    // elements: CARAT, TILDE
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 296:15: -> ^( BOOST ( CARAT )? ) ^( FUZZY TILDE )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:296:18: ^( BOOST ( CARAT )? )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(BOOST, "BOOST")
+                        , root_1);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:296:26: ( CARAT )?
+                        if ( stream_CARAT.hasNext() ) {
+                            adaptor.addChild(root_1, 
+                            stream_CARAT.nextNode()
+                            );
+
+                        }
+                        stream_CARAT.reset();
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:296:34: ^( FUZZY TILDE )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(FUZZY, "FUZZY")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_TILDE.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:297:4: CARAT ( TILDE )?
+                    {
+                    CARAT74=(Token)match(input,CARAT,FOLLOW_CARAT_in_term_modifier1491); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_CARAT.add(CARAT74);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:297:10: ( TILDE )?
+                    int alt34=2;
+                    int LA34_0 = input.LA(1);
+
+                    if ( (LA34_0==TILDE) ) {
+                        alt34=1;
+                    }
+                    switch (alt34) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:297:10: TILDE
+                            {
+                            TILDE75=(Token)match(input,TILDE,FOLLOW_TILDE_in_term_modifier1493); if (state.failed) return retval; 
+                            if ( state.backtracking==0 ) stream_TILDE.add(TILDE75);
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    // AST REWRITE
+                    // elements: CARAT, TILDE
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 297:17: -> ^( BOOST CARAT ) ^( FUZZY ( TILDE )? )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:297:20: ^( BOOST CARAT )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(BOOST, "BOOST")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_CARAT.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:297:35: ^( FUZZY ( TILDE )? )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(FUZZY, "FUZZY")
+                        , root_1);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:297:43: ( TILDE )?
+                        if ( stream_TILDE.hasNext() ) {
+                            adaptor.addChild(root_1, 
+                            stream_TILDE.nextNode()
+                            );
+
+                        }
+                        stream_TILDE.reset();
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "term_modifier"
+
+
+    public static class boost_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "boost"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:317:1: boost : ( CARAT -> ^( BOOST NUMBER[\"DEF\"] ) ) ( NUMBER -> ^( BOOST NUMBER ) )? ;
+    public final StandardLuceneGrammarParser.boost_return boost() throws RecognitionException {
+        StandardLuceneGrammarParser.boost_return retval = new StandardLuceneGrammarParser.boost_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token CARAT76=null;
+        Token NUMBER77=null;
+
+        Object CARAT76_tree=null;
+        Object NUMBER77_tree=null;
+        RewriteRuleTokenStream stream_CARAT=new RewriteRuleTokenStream(adaptor,"token CARAT");
+        RewriteRuleTokenStream stream_NUMBER=new RewriteRuleTokenStream(adaptor,"token NUMBER");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:317:7: ( ( CARAT -> ^( BOOST NUMBER[\"DEF\"] ) ) ( NUMBER -> ^( BOOST NUMBER ) )? )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:318:2: ( CARAT -> ^( BOOST NUMBER[\"DEF\"] ) ) ( NUMBER -> ^( BOOST NUMBER ) )?
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:318:2: ( CARAT -> ^( BOOST NUMBER[\"DEF\"] ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:318:3: CARAT
+            {
+            CARAT76=(Token)match(input,CARAT,FOLLOW_CARAT_in_boost1525); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_CARAT.add(CARAT76);
+
+
+            // AST REWRITE
+            // elements: 
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 318:9: -> ^( BOOST NUMBER[\"DEF\"] )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:318:12: ^( BOOST NUMBER[\"DEF\"] )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(BOOST, "BOOST")
+                , root_1);
+
+                adaptor.addChild(root_1, 
+                (Object)adaptor.create(NUMBER, "DEF")
+                );
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:319:2: ( NUMBER -> ^( BOOST NUMBER ) )?
+            int alt36=2;
+            int LA36_0 = input.LA(1);
+
+            if ( (LA36_0==NUMBER) ) {
+                alt36=1;
+            }
+            switch (alt36) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:319:3: NUMBER
+                    {
+                    NUMBER77=(Token)match(input,NUMBER,FOLLOW_NUMBER_in_boost1540); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_NUMBER.add(NUMBER77);
+
+
+                    // AST REWRITE
+                    // elements: NUMBER
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 319:10: -> ^( BOOST NUMBER )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:319:13: ^( BOOST NUMBER )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(BOOST, "BOOST")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_NUMBER.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "boost"
+
+
+    public static class fuzzy_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "fuzzy"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:322:1: fuzzy : ( TILDE -> ^( FUZZY NUMBER[\"DEF\"] ) ) ( NUMBER -> ^( FUZZY NUMBER ) )? ;
+    public final StandardLuceneGrammarParser.fuzzy_return fuzzy() throws RecognitionException {
+        StandardLuceneGrammarParser.fuzzy_return retval = new StandardLuceneGrammarParser.fuzzy_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token TILDE78=null;
+        Token NUMBER79=null;
+
+        Object TILDE78_tree=null;
+        Object NUMBER79_tree=null;
+        RewriteRuleTokenStream stream_TILDE=new RewriteRuleTokenStream(adaptor,"token TILDE");
+        RewriteRuleTokenStream stream_NUMBER=new RewriteRuleTokenStream(adaptor,"token NUMBER");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:322:7: ( ( TILDE -> ^( FUZZY NUMBER[\"DEF\"] ) ) ( NUMBER -> ^( FUZZY NUMBER ) )? )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:323:2: ( TILDE -> ^( FUZZY NUMBER[\"DEF\"] ) ) ( NUMBER -> ^( FUZZY NUMBER ) )?
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:323:2: ( TILDE -> ^( FUZZY NUMBER[\"DEF\"] ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:323:3: TILDE
+            {
+            TILDE78=(Token)match(input,TILDE,FOLLOW_TILDE_in_fuzzy1563); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_TILDE.add(TILDE78);
+
+
+            // AST REWRITE
+            // elements: 
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 323:9: -> ^( FUZZY NUMBER[\"DEF\"] )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:323:12: ^( FUZZY NUMBER[\"DEF\"] )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(FUZZY, "FUZZY")
+                , root_1);
+
+                adaptor.addChild(root_1, 
+                (Object)adaptor.create(NUMBER, "DEF")
+                );
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:324:2: ( NUMBER -> ^( FUZZY NUMBER ) )?
+            int alt37=2;
+            int LA37_0 = input.LA(1);
+
+            if ( (LA37_0==NUMBER) ) {
+                alt37=1;
+            }
+            switch (alt37) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:324:3: NUMBER
+                    {
+                    NUMBER79=(Token)match(input,NUMBER,FOLLOW_NUMBER_in_fuzzy1578); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_NUMBER.add(NUMBER79);
+
+
+                    // AST REWRITE
+                    // elements: NUMBER
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 324:10: -> ^( FUZZY NUMBER )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:324:13: ^( FUZZY NUMBER )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(FUZZY, "FUZZY")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_NUMBER.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "fuzzy"
+
+
+    public static class not_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "not"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:327:1: not : ( ( AND NOT )=> AND NOT | NOT );
+    public final StandardLuceneGrammarParser.not_return not() throws RecognitionException {
+        StandardLuceneGrammarParser.not_return retval = new StandardLuceneGrammarParser.not_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token AND80=null;
+        Token NOT81=null;
+        Token NOT82=null;
+
+        Object AND80_tree=null;
+        Object NOT81_tree=null;
+        Object NOT82_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:327:5: ( ( AND NOT )=> AND NOT | NOT )
+            int alt38=2;
+            int LA38_0 = input.LA(1);
+
+            if ( (LA38_0==AND) && (synpred4_StandardLuceneGrammar())) {
+                alt38=1;
+            }
+            else if ( (LA38_0==NOT) ) {
+                alt38=2;
+            }
+            else {
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 38, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt38) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:328:2: ( AND NOT )=> AND NOT
+                    {
+                    root_0 = (Object)adaptor.nil();
+
+
+                    AND80=(Token)match(input,AND,FOLLOW_AND_in_not1608); if (state.failed) return retval;
+                    if ( state.backtracking==0 ) {
+                    AND80_tree = 
+                    (Object)adaptor.create(AND80)
+                    ;
+                    adaptor.addChild(root_0, AND80_tree);
+                    }
+
+                    NOT81=(Token)match(input,NOT,FOLLOW_NOT_in_not1610); if (state.failed) return retval;
+                    if ( state.backtracking==0 ) {
+                    NOT81_tree = 
+                    (Object)adaptor.create(NOT81)
+                    ;
+                    adaptor.addChild(root_0, NOT81_tree);
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:329:4: NOT
+                    {
+                    root_0 = (Object)adaptor.nil();
+
+
+                    NOT82=(Token)match(input,NOT,FOLLOW_NOT_in_not1615); if (state.failed) return retval;
+                    if ( state.backtracking==0 ) {
+                    NOT82_tree = 
+                    (Object)adaptor.create(NOT82)
+                    ;
+                    adaptor.addChild(root_0, NOT82_tree);
+                    }
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "not"
+
+
+    public static class and_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "and"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:332:1: and : AND ;
+    public final StandardLuceneGrammarParser.and_return and() throws RecognitionException {
+        StandardLuceneGrammarParser.and_return retval = new StandardLuceneGrammarParser.and_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token AND83=null;
+
+        Object AND83_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:332:6: ( AND )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:333:2: AND
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            AND83=(Token)match(input,AND,FOLLOW_AND_in_and1629); if (state.failed) return retval;
+            if ( state.backtracking==0 ) {
+            AND83_tree = 
+            (Object)adaptor.create(AND83)
+            ;
+            adaptor.addChild(root_0, AND83_tree);
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "and"
+
+
+    public static class or_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "or"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:336:1: or : OR ;
+    public final StandardLuceneGrammarParser.or_return or() throws RecognitionException {
+        StandardLuceneGrammarParser.or_return retval = new StandardLuceneGrammarParser.or_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token OR84=null;
+
+        Object OR84_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:336:5: ( OR )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:337:2: OR
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            OR84=(Token)match(input,OR,FOLLOW_OR_in_or1643); if (state.failed) return retval;
+            if ( state.backtracking==0 ) {
+            OR84_tree = 
+            (Object)adaptor.create(OR84)
+            ;
+            adaptor.addChild(root_0, OR84_tree);
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "or"
+
+
+    public static class date_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "date"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:341:1: date : DATE_TOKEN ;
+    public final StandardLuceneGrammarParser.date_return date() throws RecognitionException {
+        StandardLuceneGrammarParser.date_return retval = new StandardLuceneGrammarParser.date_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token DATE_TOKEN85=null;
+
+        Object DATE_TOKEN85_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:341:6: ( DATE_TOKEN )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:343:2: DATE_TOKEN
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            DATE_TOKEN85=(Token)match(input,DATE_TOKEN,FOLLOW_DATE_TOKEN_in_date1660); if (state.failed) return retval;
+            if ( state.backtracking==0 ) {
+            DATE_TOKEN85_tree = 
+            (Object)adaptor.create(DATE_TOKEN85)
+            ;
+            adaptor.addChild(root_0, DATE_TOKEN85_tree);
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "date"
+
+    // $ANTLR start synpred1_StandardLuceneGrammar
+    public final void synpred1_StandardLuceneGrammar_fragment() throws RecognitionException {
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:123:2: ( modifier LPAREN ( clauseOr )+ RPAREN )
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:123:3: modifier LPAREN ( clauseOr )+ RPAREN
+        {
+        pushFollow(FOLLOW_modifier_in_synpred1_StandardLuceneGrammar379);
+        modifier();
+
+        state._fsp--;
+        if (state.failed) return ;
+
+        match(input,LPAREN,FOLLOW_LPAREN_in_synpred1_StandardLuceneGrammar381); if (state.failed) return ;
+
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:123:19: ( clauseOr )+
+        int cnt39=0;
+        loop39:
+        do {
+            int alt39=2;
+            int LA39_0 = input.LA(1);
+
+            if ( ((LA39_0 >= LBRACK && LA39_0 <= MINUS)||LA39_0==NUMBER||(LA39_0 >= PHRASE && LA39_0 <= PLUS)||LA39_0==QMARK||LA39_0==STAR||LA39_0==TERM_NORMAL||LA39_0==TERM_TRUNCATED) ) {
+                alt39=1;
+            }
+
+
+            switch (alt39) {
+        	case 1 :
+        	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:123:19: clauseOr
+        	    {
+        	    pushFollow(FOLLOW_clauseOr_in_synpred1_StandardLuceneGrammar383);
+        	    clauseOr();
+
+        	    state._fsp--;
+        	    if (state.failed) return ;
+
+        	    }
+        	    break;
+
+        	default :
+        	    if ( cnt39 >= 1 ) break loop39;
+        	    if (state.backtracking>0) {state.failed=true; return ;}
+                    EarlyExitException eee =
+                        new EarlyExitException(39, input);
+                    throw eee;
+            }
+            cnt39++;
+        } while (true);
+
+
+        match(input,RPAREN,FOLLOW_RPAREN_in_synpred1_StandardLuceneGrammar386); if (state.failed) return ;
+
+        }
+
+    }
+    // $ANTLR end synpred1_StandardLuceneGrammar
+
+    // $ANTLR start synpred2_StandardLuceneGrammar
+    public final void synpred2_StandardLuceneGrammar_fragment() throws RecognitionException {
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:125:4: ( LPAREN ( clauseOr )+ RPAREN term_modifier )
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:125:5: LPAREN ( clauseOr )+ RPAREN term_modifier
+        {
+        match(input,LPAREN,FOLLOW_LPAREN_in_synpred2_StandardLuceneGrammar440); if (state.failed) return ;
+
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:125:12: ( clauseOr )+
+        int cnt40=0;
+        loop40:
+        do {
+            int alt40=2;
+            int LA40_0 = input.LA(1);
+
+            if ( ((LA40_0 >= LBRACK && LA40_0 <= MINUS)||LA40_0==NUMBER||(LA40_0 >= PHRASE && LA40_0 <= PLUS)||LA40_0==QMARK||LA40_0==STAR||LA40_0==TERM_NORMAL||LA40_0==TERM_TRUNCATED) ) {
+                alt40=1;
+            }
+
+
+            switch (alt40) {
+        	case 1 :
+        	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:125:12: clauseOr
+        	    {
+        	    pushFollow(FOLLOW_clauseOr_in_synpred2_StandardLuceneGrammar442);
+        	    clauseOr();
+
+        	    state._fsp--;
+        	    if (state.failed) return ;
+
+        	    }
+        	    break;
+
+        	default :
+        	    if ( cnt40 >= 1 ) break loop40;
+        	    if (state.backtracking>0) {state.failed=true; return ;}
+                    EarlyExitException eee =
+                        new EarlyExitException(40, input);
+                    throw eee;
+            }
+            cnt40++;
+        } while (true);
+
+
+        match(input,RPAREN,FOLLOW_RPAREN_in_synpred2_StandardLuceneGrammar445); if (state.failed) return ;
+
+        pushFollow(FOLLOW_term_modifier_in_synpred2_StandardLuceneGrammar447);
+        term_modifier();
+
+        state._fsp--;
+        if (state.failed) return ;
+
+        }
+
+    }
+    // $ANTLR end synpred2_StandardLuceneGrammar
+
+    // $ANTLR start synpred3_StandardLuceneGrammar
+    public final void synpred3_StandardLuceneGrammar_fragment() throws RecognitionException {
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:127:4: ( LPAREN )
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:127:5: LPAREN
+        {
+        match(input,LPAREN,FOLLOW_LPAREN_in_synpred3_StandardLuceneGrammar500); if (state.failed) return ;
+
+        }
+
+    }
+    // $ANTLR end synpred3_StandardLuceneGrammar
+
+    // $ANTLR start synpred4_StandardLuceneGrammar
+    public final void synpred4_StandardLuceneGrammar_fragment() throws RecognitionException {
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:328:2: ( AND NOT )
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:328:3: AND NOT
+        {
+        match(input,AND,FOLLOW_AND_in_synpred4_StandardLuceneGrammar1602); if (state.failed) return ;
+
+        match(input,NOT,FOLLOW_NOT_in_synpred4_StandardLuceneGrammar1604); if (state.failed) return ;
+
+        }
+
+    }
+    // $ANTLR end synpred4_StandardLuceneGrammar
+
+    // Delegated rules
+
+    public final boolean synpred1_StandardLuceneGrammar() {
+        state.backtracking++;
+        int start = input.mark();
+        try {
+            synpred1_StandardLuceneGrammar_fragment(); // can never throw exception
+        } catch (RecognitionException re) {
+            System.err.println("impossible: "+re);
+        }
+        boolean success = !state.failed;
+        input.rewind(start);
+        state.backtracking--;
+        state.failed=false;
+        return success;
+    }
+    public final boolean synpred4_StandardLuceneGrammar() {
+        state.backtracking++;
+        int start = input.mark();
+        try {
+            synpred4_StandardLuceneGrammar_fragment(); // can never throw exception
+        } catch (RecognitionException re) {
+            System.err.println("impossible: "+re);
+        }
+        boolean success = !state.failed;
+        input.rewind(start);
+        state.backtracking--;
+        state.failed=false;
+        return success;
+    }
+    public final boolean synpred3_StandardLuceneGrammar() {
+        state.backtracking++;
+        int start = input.mark();
+        try {
+            synpred3_StandardLuceneGrammar_fragment(); // can never throw exception
+        } catch (RecognitionException re) {
+            System.err.println("impossible: "+re);
+        }
+        boolean success = !state.failed;
+        input.rewind(start);
+        state.backtracking--;
+        state.failed=false;
+        return success;
+    }
+    public final boolean synpred2_StandardLuceneGrammar() {
+        state.backtracking++;
+        int start = input.mark();
+        try {
+            synpred2_StandardLuceneGrammar_fragment(); // can never throw exception
+        } catch (RecognitionException re) {
+            System.err.println("impossible: "+re);
+        }
+        boolean success = !state.failed;
+        input.rewind(start);
+        state.backtracking--;
+        state.failed=false;
+        return success;
+    }
+
+
+ 
+
+    public static final BitSet FOLLOW_clauseOr_in_mainQ212 = new BitSet(new long[]{0x000054009C9E0000L});
+    public static final BitSet FOLLOW_EOF_in_mainQ215 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_clauseAnd_in_clauseOr246 = new BitSet(new long[]{0x0000000002000002L});
+    public static final BitSet FOLLOW_or_in_clauseOr255 = new BitSet(new long[]{0x000054009C9E0000L});
+    public static final BitSet FOLLOW_clauseAnd_in_clauseOr259 = new BitSet(new long[]{0x0000000002000002L});
+    public static final BitSet FOLLOW_clauseNot_in_clauseAnd288 = new BitSet(new long[]{0x0000000000000022L});
+    public static final BitSet FOLLOW_and_in_clauseAnd298 = new BitSet(new long[]{0x000054009C9E0000L});
+    public static final BitSet FOLLOW_clauseNot_in_clauseAnd302 = new BitSet(new long[]{0x0000000000000022L});
+    public static final BitSet FOLLOW_clauseBasic_in_clauseNot333 = new BitSet(new long[]{0x0000000000400022L});
+    public static final BitSet FOLLOW_not_in_clauseNot342 = new BitSet(new long[]{0x000054009C9E0000L});
+    public static final BitSet FOLLOW_clauseBasic_in_clauseNot346 = new BitSet(new long[]{0x0000000000400022L});
+    public static final BitSet FOLLOW_modifier_in_clauseBasic391 = new BitSet(new long[]{0x0000000000080000L});
+    public static final BitSet FOLLOW_LPAREN_in_clauseBasic394 = new BitSet(new long[]{0x000054009C9E0000L});
+    public static final BitSet FOLLOW_clauseOr_in_clauseBasic396 = new BitSet(new long[]{0x000055009C9E0000L});
+    public static final BitSet FOLLOW_RPAREN_in_clauseBasic399 = new BitSet(new long[]{0x0000800000000102L});
+    public static final BitSet FOLLOW_term_modifier_in_clauseBasic401 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_modifier_in_clauseBasic451 = new BitSet(new long[]{0x0000000000080000L});
+    public static final BitSet FOLLOW_LPAREN_in_clauseBasic454 = new BitSet(new long[]{0x000054009C9E0000L});
+    public static final BitSet FOLLOW_clauseOr_in_clauseBasic456 = new BitSet(new long[]{0x000055009C9E0000L});
+    public static final BitSet FOLLOW_RPAREN_in_clauseBasic459 = new BitSet(new long[]{0x0000800000000102L});
+    public static final BitSet FOLLOW_term_modifier_in_clauseBasic461 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_LPAREN_in_clauseBasic506 = new BitSet(new long[]{0x000054009C9E0000L});
+    public static final BitSet FOLLOW_clauseOr_in_clauseBasic508 = new BitSet(new long[]{0x000055009C9E0000L});
+    public static final BitSet FOLLOW_RPAREN_in_clauseBasic511 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_atom_in_clauseBasic523 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_modifier_in_atom544 = new BitSet(new long[]{0x0000100000000000L});
+    public static final BitSet FOLLOW_field_in_atom547 = new BitSet(new long[]{0x0000000000080000L});
+    public static final BitSet FOLLOW_multi_value_in_atom549 = new BitSet(new long[]{0x0000800000000102L});
+    public static final BitSet FOLLOW_term_modifier_in_atom551 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_modifier_in_atom587 = new BitSet(new long[]{0x000054008C860000L});
+    public static final BitSet FOLLOW_field_in_atom590 = new BitSet(new long[]{0x000054008C860000L});
+    public static final BitSet FOLLOW_value_in_atom593 = new BitSet(new long[]{0x0000800000000102L});
+    public static final BitSet FOLLOW_term_modifier_in_atom595 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_TERM_NORMAL_in_field642 = new BitSet(new long[]{0x0000000000000400L});
+    public static final BitSet FOLLOW_COLON_in_field644 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_range_term_in_in_value663 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_range_term_ex_in_value676 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_normal_in_value690 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_truncated_in_value704 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_quoted_in_value718 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_quoted_truncated_in_value731 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_QMARK_in_value744 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_STAR_in_value757 = new BitSet(new long[]{0x0000000000000400L});
+    public static final BitSet FOLLOW_COLON_in_value759 = new BitSet(new long[]{0x0000040000000000L});
+    public static final BitSet FOLLOW_STAR_in_value763 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_STAR_in_value778 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_LBRACK_in_range_term_in809 = new BitSet(new long[]{0x000054000C800800L});
+    public static final BitSet FOLLOW_range_value_in_range_term_in821 = new BitSet(new long[]{0x000254400C800800L});
+    public static final BitSet FOLLOW_TO_in_range_term_in844 = new BitSet(new long[]{0x000054000C800800L});
+    public static final BitSet FOLLOW_range_value_in_range_term_in849 = new BitSet(new long[]{0x0000004000000000L});
+    public static final BitSet FOLLOW_RBRACK_in_range_term_in870 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_LCURLY_in_range_term_ex890 = new BitSet(new long[]{0x000054000C800800L});
+    public static final BitSet FOLLOW_range_value_in_range_term_ex903 = new BitSet(new long[]{0x000254800C800800L});
+    public static final BitSet FOLLOW_TO_in_range_term_ex926 = new BitSet(new long[]{0x000054000C800800L});
+    public static final BitSet FOLLOW_range_value_in_range_term_ex931 = new BitSet(new long[]{0x0000008000000000L});
+    public static final BitSet FOLLOW_RCURLY_in_range_term_ex952 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_truncated_in_range_value966 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_quoted_in_range_value979 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_quoted_truncated_in_range_value992 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_date_in_range_value1005 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_normal_in_range_value1018 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_STAR_in_range_value1032 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_LPAREN_in_multi_value1053 = new BitSet(new long[]{0x000054009C9E0000L});
+    public static final BitSet FOLLOW_multiClause_in_multi_value1055 = new BitSet(new long[]{0x0000010000000000L});
+    public static final BitSet FOLLOW_RPAREN_in_multi_value1057 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_clauseOr_in_multiClause1084 = new BitSet(new long[]{0x000054009C9E0002L});
+    public static final BitSet FOLLOW_multiOr_in_multiDefault1128 = new BitSet(new long[]{0x000054009C960002L});
+    public static final BitSet FOLLOW_multiAnd_in_multiOr1156 = new BitSet(new long[]{0x0000000002000002L});
+    public static final BitSet FOLLOW_or_in_multiOr1166 = new BitSet(new long[]{0x000054009C960000L});
+    public static final BitSet FOLLOW_multiAnd_in_multiOr1170 = new BitSet(new long[]{0x0000000002000002L});
+    public static final BitSet FOLLOW_multiNot_in_multiAnd1201 = new BitSet(new long[]{0x0000000000000022L});
+    public static final BitSet FOLLOW_and_in_multiAnd1211 = new BitSet(new long[]{0x000054009C960000L});
+    public static final BitSet FOLLOW_multiNot_in_multiAnd1215 = new BitSet(new long[]{0x0000000000000022L});
+    public static final BitSet FOLLOW_multiBasic_in_multiNot1246 = new BitSet(new long[]{0x0000000000400022L});
+    public static final BitSet FOLLOW_not_in_multiNot1256 = new BitSet(new long[]{0x000054009C960000L});
+    public static final BitSet FOLLOW_multiBasic_in_multiNot1260 = new BitSet(new long[]{0x0000000000400022L});
+    public static final BitSet FOLLOW_mterm_in_multiBasic1287 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_modifier_in_mterm1303 = new BitSet(new long[]{0x000054008C860000L});
+    public static final BitSet FOLLOW_value_in_mterm1306 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_TERM_TRUNCATED_in_truncated1359 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_PHRASE_ANYTHING_in_quoted_truncated1374 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_PHRASE_in_quoted1386 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_AND_in_operator1402 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_OR_in_operator1412 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_NOT_in_operator1422 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_PLUS_in_modifier1439 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_MINUS_in_modifier1449 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_TILDE_in_term_modifier1467 = new BitSet(new long[]{0x0000000000000102L});
+    public static final BitSet FOLLOW_CARAT_in_term_modifier1469 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_CARAT_in_term_modifier1491 = new BitSet(new long[]{0x0000800000000002L});
+    public static final BitSet FOLLOW_TILDE_in_term_modifier1493 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_CARAT_in_boost1525 = new BitSet(new long[]{0x0000000000800002L});
+    public static final BitSet FOLLOW_NUMBER_in_boost1540 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_TILDE_in_fuzzy1563 = new BitSet(new long[]{0x0000000000800002L});
+    public static final BitSet FOLLOW_NUMBER_in_fuzzy1578 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_AND_in_not1608 = new BitSet(new long[]{0x0000000000400000L});
+    public static final BitSet FOLLOW_NOT_in_not1610 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_NOT_in_not1615 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_AND_in_and1629 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_OR_in_or1643 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_DATE_TOKEN_in_date1660 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_modifier_in_synpred1_StandardLuceneGrammar379 = new BitSet(new long[]{0x0000000000080000L});
+    public static final BitSet FOLLOW_LPAREN_in_synpred1_StandardLuceneGrammar381 = new BitSet(new long[]{0x000054009C9E0000L});
+    public static final BitSet FOLLOW_clauseOr_in_synpred1_StandardLuceneGrammar383 = new BitSet(new long[]{0x000055009C9E0000L});
+    public static final BitSet FOLLOW_RPAREN_in_synpred1_StandardLuceneGrammar386 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_LPAREN_in_synpred2_StandardLuceneGrammar440 = new BitSet(new long[]{0x000054009C9E0000L});
+    public static final BitSet FOLLOW_clauseOr_in_synpred2_StandardLuceneGrammar442 = new BitSet(new long[]{0x000055009C9E0000L});
+    public static final BitSet FOLLOW_RPAREN_in_synpred2_StandardLuceneGrammar445 = new BitSet(new long[]{0x0000800000000100L});
+    public static final BitSet FOLLOW_term_modifier_in_synpred2_StandardLuceneGrammar447 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_LPAREN_in_synpred3_StandardLuceneGrammar500 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_AND_in_synpred4_StandardLuceneGrammar1602 = new BitSet(new long[]{0x0000000000400000L});
+    public static final BitSet FOLLOW_NOT_in_synpred4_StandardLuceneGrammar1604 = new BitSet(new long[]{0x0000000000000002L});
+
+}
\ No newline at end of file
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammarParser.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammarParser.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammarParser.java	(revision 0)
@@ -0,0 +1,6557 @@
+// $ANTLR 3.4 /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g 2013-06-27 18:55:44
+
+  package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+
+import org.antlr.runtime.*;
+import java.util.Stack;
+import java.util.List;
+import java.util.ArrayList;
+import java.util.Map;
+import java.util.HashMap;
+
+import org.antlr.runtime.tree.*;
+
+
+@SuppressWarnings({"all", "warnings", "unchecked"})
+public class ExtendedLuceneGrammarParser extends UnforgivingParser {
+    public static final String[] tokenNames = new String[] {
+        "<invalid>", "<EOR>", "<DOWN>", "<UP>", "AMPER", "AND", "ATOM", "BOOST", "CARAT", "CLAUSE", "COLON", "DATE_TOKEN", "DQUOTE", "ESC_CHAR", "FIELD", "FUZZY", "INT", "LBRACK", "LCURLY", "LPAREN", "MINUS", "MODIFIER", "NEAR", "NOT", "NUMBER", "OPERATOR", "OR", "PHRASE", "PHRASE_ANYTHING", "PLUS", "QANYTHING", "QDATE", "QMARK", "QNORMAL", "QPHRASE", "QPHRASETRUNC", "QRANGEEX", "QRANGEIN", "QTRUNCATED", "RBRACK", "RCURLY", "RPAREN", "SQUOTE", "STAR", "TERM_CHAR", "TERM_NORMAL", "TERM_START_CHAR", "TERM_TRUNCATED", "TILDE", "TMODIFIER", "TO", "VBAR", "WS"
+    };
+
+    public static final int EOF=-1;
+    public static final int AMPER=4;
+    public static final int AND=5;
+    public static final int ATOM=6;
+    public static final int BOOST=7;
+    public static final int CARAT=8;
+    public static final int CLAUSE=9;
+    public static final int COLON=10;
+    public static final int DATE_TOKEN=11;
+    public static final int DQUOTE=12;
+    public static final int ESC_CHAR=13;
+    public static final int FIELD=14;
+    public static final int FUZZY=15;
+    public static final int INT=16;
+    public static final int LBRACK=17;
+    public static final int LCURLY=18;
+    public static final int LPAREN=19;
+    public static final int MINUS=20;
+    public static final int MODIFIER=21;
+    public static final int NEAR=22;
+    public static final int NOT=23;
+    public static final int NUMBER=24;
+    public static final int OPERATOR=25;
+    public static final int OR=26;
+    public static final int PHRASE=27;
+    public static final int PHRASE_ANYTHING=28;
+    public static final int PLUS=29;
+    public static final int QANYTHING=30;
+    public static final int QDATE=31;
+    public static final int QMARK=32;
+    public static final int QNORMAL=33;
+    public static final int QPHRASE=34;
+    public static final int QPHRASETRUNC=35;
+    public static final int QRANGEEX=36;
+    public static final int QRANGEIN=37;
+    public static final int QTRUNCATED=38;
+    public static final int RBRACK=39;
+    public static final int RCURLY=40;
+    public static final int RPAREN=41;
+    public static final int SQUOTE=42;
+    public static final int STAR=43;
+    public static final int TERM_CHAR=44;
+    public static final int TERM_NORMAL=45;
+    public static final int TERM_START_CHAR=46;
+    public static final int TERM_TRUNCATED=47;
+    public static final int TILDE=48;
+    public static final int TMODIFIER=49;
+    public static final int TO=50;
+    public static final int VBAR=51;
+    public static final int WS=52;
+
+    // delegates
+    public UnforgivingParser[] getDelegates() {
+        return new UnforgivingParser[] {};
+    }
+
+    // delegators
+
+
+    public ExtendedLuceneGrammarParser(TokenStream input) {
+        this(input, new RecognizerSharedState());
+    }
+    public ExtendedLuceneGrammarParser(TokenStream input, RecognizerSharedState state) {
+        super(input, state);
+    }
+
+protected TreeAdaptor adaptor = new CommonTreeAdaptor();
+
+public void setTreeAdaptor(TreeAdaptor adaptor) {
+    this.adaptor = adaptor;
+}
+public TreeAdaptor getTreeAdaptor() {
+    return adaptor;
+}
+    public String[] getTokenNames() { return ExtendedLuceneGrammarParser.tokenNames; }
+    public String getGrammarFileName() { return "/dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g"; }
+
+
+    public static class mainQ_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "mainQ"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:103:1: mainQ : ( clauseOr )+ EOF -> ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ;
+    public final ExtendedLuceneGrammarParser.mainQ_return mainQ() throws RecognitionException {
+        ExtendedLuceneGrammarParser.mainQ_return retval = new ExtendedLuceneGrammarParser.mainQ_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token EOF2=null;
+        ExtendedLuceneGrammarParser.clauseOr_return clauseOr1 =null;
+
+
+        Object EOF2_tree=null;
+        RewriteRuleTokenStream stream_EOF=new RewriteRuleTokenStream(adaptor,"token EOF");
+        RewriteRuleSubtreeStream stream_clauseOr=new RewriteRuleSubtreeStream(adaptor,"rule clauseOr");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:103:7: ( ( clauseOr )+ EOF -> ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:104:2: ( clauseOr )+ EOF
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:104:2: ( clauseOr )+
+            int cnt1=0;
+            loop1:
+            do {
+                int alt1=2;
+                int LA1_0 = input.LA(1);
+
+                if ( ((LA1_0 >= LBRACK && LA1_0 <= MINUS)||LA1_0==NUMBER||(LA1_0 >= PHRASE && LA1_0 <= PLUS)||LA1_0==QMARK||LA1_0==STAR||LA1_0==TERM_NORMAL||LA1_0==TERM_TRUNCATED) ) {
+                    alt1=1;
+                }
+
+
+                switch (alt1) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:104:2: clauseOr
+            	    {
+            	    pushFollow(FOLLOW_clauseOr_in_mainQ212);
+            	    clauseOr1=clauseOr();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_clauseOr.add(clauseOr1.getTree());
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt1 >= 1 ) break loop1;
+            	    if (state.backtracking>0) {state.failed=true; return retval;}
+                        EarlyExitException eee =
+                            new EarlyExitException(1, input);
+                        throw eee;
+                }
+                cnt1++;
+            } while (true);
+
+
+            EOF2=(Token)match(input,EOF,FOLLOW_EOF_in_mainQ215); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_EOF.add(EOF2);
+
+
+            // AST REWRITE
+            // elements: clauseOr
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 104:16: -> ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:104:19: ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(OPERATOR, "DEFOP")
+                , root_1);
+
+                if ( !(stream_clauseOr.hasNext()) ) {
+                    throw new RewriteEarlyExitException();
+                }
+                while ( stream_clauseOr.hasNext() ) {
+                    adaptor.addChild(root_1, stream_clauseOr.nextTree());
+
+                }
+                stream_clauseOr.reset();
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "mainQ"
+
+
+    public static class clauseOr_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "clauseOr"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:107:1: clauseOr : (first= clauseAnd -> $first) ( or others= clauseAnd -> ^( OPERATOR[\"OR\"] ( clauseAnd )+ ) )* ;
+    public final ExtendedLuceneGrammarParser.clauseOr_return clauseOr() throws RecognitionException {
+        ExtendedLuceneGrammarParser.clauseOr_return retval = new ExtendedLuceneGrammarParser.clauseOr_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.clauseAnd_return first =null;
+
+        ExtendedLuceneGrammarParser.clauseAnd_return others =null;
+
+        ExtendedLuceneGrammarParser.or_return or3 =null;
+
+
+        RewriteRuleSubtreeStream stream_clauseAnd=new RewriteRuleSubtreeStream(adaptor,"rule clauseAnd");
+        RewriteRuleSubtreeStream stream_or=new RewriteRuleSubtreeStream(adaptor,"rule or");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:108:3: ( (first= clauseAnd -> $first) ( or others= clauseAnd -> ^( OPERATOR[\"OR\"] ( clauseAnd )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:108:5: (first= clauseAnd -> $first) ( or others= clauseAnd -> ^( OPERATOR[\"OR\"] ( clauseAnd )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:108:5: (first= clauseAnd -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:108:6: first= clauseAnd
+            {
+            pushFollow(FOLLOW_clauseAnd_in_clauseOr242);
+            first=clauseAnd();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_clauseAnd.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 108:22: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:108:33: ( or others= clauseAnd -> ^( OPERATOR[\"OR\"] ( clauseAnd )+ ) )*
+            loop2:
+            do {
+                int alt2=2;
+                int LA2_0 = input.LA(1);
+
+                if ( (LA2_0==OR) ) {
+                    alt2=1;
+                }
+
+
+                switch (alt2) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:108:34: or others= clauseAnd
+            	    {
+            	    pushFollow(FOLLOW_or_in_clauseOr251);
+            	    or3=or();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_or.add(or3.getTree());
+
+            	    pushFollow(FOLLOW_clauseAnd_in_clauseOr255);
+            	    others=clauseAnd();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_clauseAnd.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: clauseAnd
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 108:54: -> ^( OPERATOR[\"OR\"] ( clauseAnd )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:108:57: ^( OPERATOR[\"OR\"] ( clauseAnd )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(
+            	        (Object)adaptor.create(OPERATOR, "OR")
+            	        , root_1);
+
+            	        if ( !(stream_clauseAnd.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_clauseAnd.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_clauseAnd.nextTree());
+
+            	        }
+            	        stream_clauseAnd.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop2;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "clauseOr"
+
+
+    public static class clauseAnd_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "clauseAnd"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:111:1: clauseAnd : (first= clauseNot -> $first) ( and others= clauseNot -> ^( OPERATOR[\"AND\"] ( clauseNot )+ ) )* ;
+    public final ExtendedLuceneGrammarParser.clauseAnd_return clauseAnd() throws RecognitionException {
+        ExtendedLuceneGrammarParser.clauseAnd_return retval = new ExtendedLuceneGrammarParser.clauseAnd_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.clauseNot_return first =null;
+
+        ExtendedLuceneGrammarParser.clauseNot_return others =null;
+
+        ExtendedLuceneGrammarParser.and_return and4 =null;
+
+
+        RewriteRuleSubtreeStream stream_clauseNot=new RewriteRuleSubtreeStream(adaptor,"rule clauseNot");
+        RewriteRuleSubtreeStream stream_and=new RewriteRuleSubtreeStream(adaptor,"rule and");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:112:3: ( (first= clauseNot -> $first) ( and others= clauseNot -> ^( OPERATOR[\"AND\"] ( clauseNot )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:112:5: (first= clauseNot -> $first) ( and others= clauseNot -> ^( OPERATOR[\"AND\"] ( clauseNot )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:112:5: (first= clauseNot -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:112:6: first= clauseNot
+            {
+            pushFollow(FOLLOW_clauseNot_in_clauseAnd284);
+            first=clauseNot();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_clauseNot.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 112:23: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:112:34: ( and others= clauseNot -> ^( OPERATOR[\"AND\"] ( clauseNot )+ ) )*
+            loop3:
+            do {
+                int alt3=2;
+                int LA3_0 = input.LA(1);
+
+                if ( (LA3_0==AND) ) {
+                    alt3=1;
+                }
+
+
+                switch (alt3) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:112:35: and others= clauseNot
+            	    {
+            	    pushFollow(FOLLOW_and_in_clauseAnd294);
+            	    and4=and();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_and.add(and4.getTree());
+
+            	    pushFollow(FOLLOW_clauseNot_in_clauseAnd298);
+            	    others=clauseNot();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_clauseNot.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: clauseNot
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 112:56: -> ^( OPERATOR[\"AND\"] ( clauseNot )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:112:59: ^( OPERATOR[\"AND\"] ( clauseNot )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(
+            	        (Object)adaptor.create(OPERATOR, "AND")
+            	        , root_1);
+
+            	        if ( !(stream_clauseNot.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_clauseNot.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_clauseNot.nextTree());
+
+            	        }
+            	        stream_clauseNot.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop3;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "clauseAnd"
+
+
+    public static class clauseNot_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "clauseNot"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:115:1: clauseNot : (first= clauseNear -> $first) ( not others= clauseNear -> ^( OPERATOR[\"NOT\"] ( clauseNear )+ ) )* ;
+    public final ExtendedLuceneGrammarParser.clauseNot_return clauseNot() throws RecognitionException {
+        ExtendedLuceneGrammarParser.clauseNot_return retval = new ExtendedLuceneGrammarParser.clauseNot_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.clauseNear_return first =null;
+
+        ExtendedLuceneGrammarParser.clauseNear_return others =null;
+
+        ExtendedLuceneGrammarParser.not_return not5 =null;
+
+
+        RewriteRuleSubtreeStream stream_not=new RewriteRuleSubtreeStream(adaptor,"rule not");
+        RewriteRuleSubtreeStream stream_clauseNear=new RewriteRuleSubtreeStream(adaptor,"rule clauseNear");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:116:3: ( (first= clauseNear -> $first) ( not others= clauseNear -> ^( OPERATOR[\"NOT\"] ( clauseNear )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:116:5: (first= clauseNear -> $first) ( not others= clauseNear -> ^( OPERATOR[\"NOT\"] ( clauseNear )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:116:5: (first= clauseNear -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:116:6: first= clauseNear
+            {
+            pushFollow(FOLLOW_clauseNear_in_clauseNot329);
+            first=clauseNear();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_clauseNear.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 116:23: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:116:34: ( not others= clauseNear -> ^( OPERATOR[\"NOT\"] ( clauseNear )+ ) )*
+            loop4:
+            do {
+                int alt4=2;
+                int LA4_0 = input.LA(1);
+
+                if ( (LA4_0==AND) ) {
+                    int LA4_1 = input.LA(2);
+
+                    if ( (LA4_1==NOT) ) {
+                        alt4=1;
+                    }
+
+
+                }
+                else if ( (LA4_0==NOT) ) {
+                    alt4=1;
+                }
+
+
+                switch (alt4) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:116:35: not others= clauseNear
+            	    {
+            	    pushFollow(FOLLOW_not_in_clauseNot338);
+            	    not5=not();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_not.add(not5.getTree());
+
+            	    pushFollow(FOLLOW_clauseNear_in_clauseNot342);
+            	    others=clauseNear();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_clauseNear.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: clauseNear
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 116:57: -> ^( OPERATOR[\"NOT\"] ( clauseNear )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:116:60: ^( OPERATOR[\"NOT\"] ( clauseNear )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(
+            	        (Object)adaptor.create(OPERATOR, "NOT")
+            	        , root_1);
+
+            	        if ( !(stream_clauseNear.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_clauseNear.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_clauseNear.nextTree());
+
+            	        }
+            	        stream_clauseNear.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop4;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "clauseNot"
+
+
+    public static class clauseNear_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "clauseNear"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:119:1: clauseNear : (first= clauseBasic -> $first) ( near others= clauseBasic -> ^( near ( clauseBasic )+ ) )* ;
+    public final ExtendedLuceneGrammarParser.clauseNear_return clauseNear() throws RecognitionException {
+        ExtendedLuceneGrammarParser.clauseNear_return retval = new ExtendedLuceneGrammarParser.clauseNear_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.clauseBasic_return first =null;
+
+        ExtendedLuceneGrammarParser.clauseBasic_return others =null;
+
+        ExtendedLuceneGrammarParser.near_return near6 =null;
+
+
+        RewriteRuleSubtreeStream stream_clauseBasic=new RewriteRuleSubtreeStream(adaptor,"rule clauseBasic");
+        RewriteRuleSubtreeStream stream_near=new RewriteRuleSubtreeStream(adaptor,"rule near");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:120:3: ( (first= clauseBasic -> $first) ( near others= clauseBasic -> ^( near ( clauseBasic )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:120:5: (first= clauseBasic -> $first) ( near others= clauseBasic -> ^( near ( clauseBasic )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:120:5: (first= clauseBasic -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:120:6: first= clauseBasic
+            {
+            pushFollow(FOLLOW_clauseBasic_in_clauseNear373);
+            first=clauseBasic();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_clauseBasic.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 120:24: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:120:35: ( near others= clauseBasic -> ^( near ( clauseBasic )+ ) )*
+            loop5:
+            do {
+                int alt5=2;
+                int LA5_0 = input.LA(1);
+
+                if ( (LA5_0==NEAR) ) {
+                    alt5=1;
+                }
+
+
+                switch (alt5) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:120:36: near others= clauseBasic
+            	    {
+            	    pushFollow(FOLLOW_near_in_clauseNear382);
+            	    near6=near();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_near.add(near6.getTree());
+
+            	    pushFollow(FOLLOW_clauseBasic_in_clauseNear386);
+            	    others=clauseBasic();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_clauseBasic.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: clauseBasic, near
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 120:60: -> ^( near ( clauseBasic )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:120:63: ^( near ( clauseBasic )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(stream_near.nextNode(), root_1);
+
+            	        if ( !(stream_clauseBasic.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_clauseBasic.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_clauseBasic.nextTree());
+
+            	        }
+            	        stream_clauseBasic.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop5;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "clauseNear"
+
+
+    public static class clauseBasic_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "clauseBasic"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:123:1: clauseBasic : ( ( modifier LPAREN ( clauseOr )+ RPAREN )=> ( modifier )? LPAREN ( clauseOr )+ RPAREN ( term_modifier )? -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) ) | ( LPAREN ( clauseOr )+ RPAREN term_modifier )=> ( modifier )? LPAREN ( clauseOr )+ RPAREN ( term_modifier )? -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) ) | ( LPAREN )=> LPAREN ( clauseOr )+ RPAREN -> ( clauseOr )+ | atom );
+    public final ExtendedLuceneGrammarParser.clauseBasic_return clauseBasic() throws RecognitionException {
+        ExtendedLuceneGrammarParser.clauseBasic_return retval = new ExtendedLuceneGrammarParser.clauseBasic_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token LPAREN8=null;
+        Token RPAREN10=null;
+        Token LPAREN13=null;
+        Token RPAREN15=null;
+        Token LPAREN17=null;
+        Token RPAREN19=null;
+        ExtendedLuceneGrammarParser.modifier_return modifier7 =null;
+
+        ExtendedLuceneGrammarParser.clauseOr_return clauseOr9 =null;
+
+        ExtendedLuceneGrammarParser.term_modifier_return term_modifier11 =null;
+
+        ExtendedLuceneGrammarParser.modifier_return modifier12 =null;
+
+        ExtendedLuceneGrammarParser.clauseOr_return clauseOr14 =null;
+
+        ExtendedLuceneGrammarParser.term_modifier_return term_modifier16 =null;
+
+        ExtendedLuceneGrammarParser.clauseOr_return clauseOr18 =null;
+
+        ExtendedLuceneGrammarParser.atom_return atom20 =null;
+
+
+        Object LPAREN8_tree=null;
+        Object RPAREN10_tree=null;
+        Object LPAREN13_tree=null;
+        Object RPAREN15_tree=null;
+        Object LPAREN17_tree=null;
+        Object RPAREN19_tree=null;
+        RewriteRuleTokenStream stream_RPAREN=new RewriteRuleTokenStream(adaptor,"token RPAREN");
+        RewriteRuleTokenStream stream_LPAREN=new RewriteRuleTokenStream(adaptor,"token LPAREN");
+        RewriteRuleSubtreeStream stream_modifier=new RewriteRuleSubtreeStream(adaptor,"rule modifier");
+        RewriteRuleSubtreeStream stream_term_modifier=new RewriteRuleSubtreeStream(adaptor,"rule term_modifier");
+        RewriteRuleSubtreeStream stream_clauseOr=new RewriteRuleSubtreeStream(adaptor,"rule clauseOr");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:124:2: ( ( modifier LPAREN ( clauseOr )+ RPAREN )=> ( modifier )? LPAREN ( clauseOr )+ RPAREN ( term_modifier )? -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) ) | ( LPAREN ( clauseOr )+ RPAREN term_modifier )=> ( modifier )? LPAREN ( clauseOr )+ RPAREN ( term_modifier )? -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) ) | ( LPAREN )=> LPAREN ( clauseOr )+ RPAREN -> ( clauseOr )+ | atom )
+            int alt13=4;
+            switch ( input.LA(1) ) {
+            case PLUS:
+                {
+                int LA13_1 = input.LA(2);
+
+                if ( (synpred1_ExtendedLuceneGrammar()) ) {
+                    alt13=1;
+                }
+                else if ( (synpred2_ExtendedLuceneGrammar()) ) {
+                    alt13=2;
+                }
+                else if ( (true) ) {
+                    alt13=4;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 13, 1, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            case MINUS:
+                {
+                int LA13_2 = input.LA(2);
+
+                if ( (synpred1_ExtendedLuceneGrammar()) ) {
+                    alt13=1;
+                }
+                else if ( (synpred2_ExtendedLuceneGrammar()) ) {
+                    alt13=2;
+                }
+                else if ( (true) ) {
+                    alt13=4;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 13, 2, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            case LPAREN:
+                {
+                int LA13_3 = input.LA(2);
+
+                if ( (synpred1_ExtendedLuceneGrammar()) ) {
+                    alt13=1;
+                }
+                else if ( (synpred2_ExtendedLuceneGrammar()) ) {
+                    alt13=2;
+                }
+                else if ( (synpred3_ExtendedLuceneGrammar()) ) {
+                    alt13=3;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 13, 3, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            case LBRACK:
+            case LCURLY:
+            case NUMBER:
+            case PHRASE:
+            case PHRASE_ANYTHING:
+            case QMARK:
+            case STAR:
+            case TERM_NORMAL:
+            case TERM_TRUNCATED:
+                {
+                alt13=4;
+                }
+                break;
+            default:
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 13, 0, input);
+
+                throw nvae;
+
+            }
+
+            switch (alt13) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:125:2: ( modifier LPAREN ( clauseOr )+ RPAREN )=> ( modifier )? LPAREN ( clauseOr )+ RPAREN ( term_modifier )?
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:125:40: ( modifier )?
+                    int alt6=2;
+                    int LA6_0 = input.LA(1);
+
+                    if ( (LA6_0==MINUS||LA6_0==PLUS) ) {
+                        alt6=1;
+                    }
+                    switch (alt6) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:125:40: modifier
+                            {
+                            pushFollow(FOLLOW_modifier_in_clauseBasic427);
+                            modifier7=modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_modifier.add(modifier7.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    LPAREN8=(Token)match(input,LPAREN,FOLLOW_LPAREN_in_clauseBasic430); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_LPAREN.add(LPAREN8);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:125:57: ( clauseOr )+
+                    int cnt7=0;
+                    loop7:
+                    do {
+                        int alt7=2;
+                        int LA7_0 = input.LA(1);
+
+                        if ( ((LA7_0 >= LBRACK && LA7_0 <= MINUS)||LA7_0==NUMBER||(LA7_0 >= PHRASE && LA7_0 <= PLUS)||LA7_0==QMARK||LA7_0==STAR||LA7_0==TERM_NORMAL||LA7_0==TERM_TRUNCATED) ) {
+                            alt7=1;
+                        }
+
+
+                        switch (alt7) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:125:57: clauseOr
+                    	    {
+                    	    pushFollow(FOLLOW_clauseOr_in_clauseBasic432);
+                    	    clauseOr9=clauseOr();
+
+                    	    state._fsp--;
+                    	    if (state.failed) return retval;
+                    	    if ( state.backtracking==0 ) stream_clauseOr.add(clauseOr9.getTree());
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt7 >= 1 ) break loop7;
+                    	    if (state.backtracking>0) {state.failed=true; return retval;}
+                                EarlyExitException eee =
+                                    new EarlyExitException(7, input);
+                                throw eee;
+                        }
+                        cnt7++;
+                    } while (true);
+
+
+                    RPAREN10=(Token)match(input,RPAREN,FOLLOW_RPAREN_in_clauseBasic435); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_RPAREN.add(RPAREN10);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:125:74: ( term_modifier )?
+                    int alt8=2;
+                    int LA8_0 = input.LA(1);
+
+                    if ( (LA8_0==CARAT||LA8_0==TILDE) ) {
+                        alt8=1;
+                    }
+                    switch (alt8) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:125:74: term_modifier
+                            {
+                            pushFollow(FOLLOW_term_modifier_in_clauseBasic437);
+                            term_modifier11=term_modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_term_modifier.add(term_modifier11.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    // AST REWRITE
+                    // elements: clauseOr, modifier, term_modifier
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 126:3: -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:126:6: ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(CLAUSE, "CLAUSE")
+                        , root_1);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:126:15: ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) )
+                        {
+                        Object root_2 = (Object)adaptor.nil();
+                        root_2 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(MODIFIER, "MODIFIER")
+                        , root_2);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:126:26: ( modifier )?
+                        if ( stream_modifier.hasNext() ) {
+                            adaptor.addChild(root_2, stream_modifier.nextTree());
+
+                        }
+                        stream_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:126:36: ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) )
+                        {
+                        Object root_3 = (Object)adaptor.nil();
+                        root_3 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(TMODIFIER, "TMODIFIER")
+                        , root_3);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:126:48: ( term_modifier )?
+                        if ( stream_term_modifier.hasNext() ) {
+                            adaptor.addChild(root_3, stream_term_modifier.nextTree());
+
+                        }
+                        stream_term_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:126:63: ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ )
+                        {
+                        Object root_4 = (Object)adaptor.nil();
+                        root_4 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(OPERATOR, "DEFOP")
+                        , root_4);
+
+                        if ( !(stream_clauseOr.hasNext()) ) {
+                            throw new RewriteEarlyExitException();
+                        }
+                        while ( stream_clauseOr.hasNext() ) {
+                            adaptor.addChild(root_4, stream_clauseOr.nextTree());
+
+                        }
+                        stream_clauseOr.reset();
+
+                        adaptor.addChild(root_3, root_4);
+                        }
+
+                        adaptor.addChild(root_2, root_3);
+                        }
+
+                        adaptor.addChild(root_1, root_2);
+                        }
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:127:4: ( LPAREN ( clauseOr )+ RPAREN term_modifier )=> ( modifier )? LPAREN ( clauseOr )+ RPAREN ( term_modifier )?
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:127:46: ( modifier )?
+                    int alt9=2;
+                    int LA9_0 = input.LA(1);
+
+                    if ( (LA9_0==MINUS||LA9_0==PLUS) ) {
+                        alt9=1;
+                    }
+                    switch (alt9) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:127:46: modifier
+                            {
+                            pushFollow(FOLLOW_modifier_in_clauseBasic487);
+                            modifier12=modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_modifier.add(modifier12.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    LPAREN13=(Token)match(input,LPAREN,FOLLOW_LPAREN_in_clauseBasic490); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_LPAREN.add(LPAREN13);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:127:63: ( clauseOr )+
+                    int cnt10=0;
+                    loop10:
+                    do {
+                        int alt10=2;
+                        int LA10_0 = input.LA(1);
+
+                        if ( ((LA10_0 >= LBRACK && LA10_0 <= MINUS)||LA10_0==NUMBER||(LA10_0 >= PHRASE && LA10_0 <= PLUS)||LA10_0==QMARK||LA10_0==STAR||LA10_0==TERM_NORMAL||LA10_0==TERM_TRUNCATED) ) {
+                            alt10=1;
+                        }
+
+
+                        switch (alt10) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:127:63: clauseOr
+                    	    {
+                    	    pushFollow(FOLLOW_clauseOr_in_clauseBasic492);
+                    	    clauseOr14=clauseOr();
+
+                    	    state._fsp--;
+                    	    if (state.failed) return retval;
+                    	    if ( state.backtracking==0 ) stream_clauseOr.add(clauseOr14.getTree());
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt10 >= 1 ) break loop10;
+                    	    if (state.backtracking>0) {state.failed=true; return retval;}
+                                EarlyExitException eee =
+                                    new EarlyExitException(10, input);
+                                throw eee;
+                        }
+                        cnt10++;
+                    } while (true);
+
+
+                    RPAREN15=(Token)match(input,RPAREN,FOLLOW_RPAREN_in_clauseBasic495); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_RPAREN.add(RPAREN15);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:127:80: ( term_modifier )?
+                    int alt11=2;
+                    int LA11_0 = input.LA(1);
+
+                    if ( (LA11_0==CARAT||LA11_0==TILDE) ) {
+                        alt11=1;
+                    }
+                    switch (alt11) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:127:80: term_modifier
+                            {
+                            pushFollow(FOLLOW_term_modifier_in_clauseBasic497);
+                            term_modifier16=term_modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_term_modifier.add(term_modifier16.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    // AST REWRITE
+                    // elements: clauseOr, term_modifier, modifier
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 128:3: -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:128:6: ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) ) )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(CLAUSE, "CLAUSE")
+                        , root_1);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:128:15: ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ) )
+                        {
+                        Object root_2 = (Object)adaptor.nil();
+                        root_2 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(MODIFIER, "MODIFIER")
+                        , root_2);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:128:26: ( modifier )?
+                        if ( stream_modifier.hasNext() ) {
+                            adaptor.addChild(root_2, stream_modifier.nextTree());
+
+                        }
+                        stream_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:128:36: ^( TMODIFIER ( term_modifier )? ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) )
+                        {
+                        Object root_3 = (Object)adaptor.nil();
+                        root_3 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(TMODIFIER, "TMODIFIER")
+                        , root_3);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:128:48: ( term_modifier )?
+                        if ( stream_term_modifier.hasNext() ) {
+                            adaptor.addChild(root_3, stream_term_modifier.nextTree());
+
+                        }
+                        stream_term_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:128:63: ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ )
+                        {
+                        Object root_4 = (Object)adaptor.nil();
+                        root_4 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(OPERATOR, "DEFOP")
+                        , root_4);
+
+                        if ( !(stream_clauseOr.hasNext()) ) {
+                            throw new RewriteEarlyExitException();
+                        }
+                        while ( stream_clauseOr.hasNext() ) {
+                            adaptor.addChild(root_4, stream_clauseOr.nextTree());
+
+                        }
+                        stream_clauseOr.reset();
+
+                        adaptor.addChild(root_3, root_4);
+                        }
+
+                        adaptor.addChild(root_2, root_3);
+                        }
+
+                        adaptor.addChild(root_1, root_2);
+                        }
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 3 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:129:4: ( LPAREN )=> LPAREN ( clauseOr )+ RPAREN
+                    {
+                    LPAREN17=(Token)match(input,LPAREN,FOLLOW_LPAREN_in_clauseBasic542); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_LPAREN.add(LPAREN17);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:129:24: ( clauseOr )+
+                    int cnt12=0;
+                    loop12:
+                    do {
+                        int alt12=2;
+                        int LA12_0 = input.LA(1);
+
+                        if ( ((LA12_0 >= LBRACK && LA12_0 <= MINUS)||LA12_0==NUMBER||(LA12_0 >= PHRASE && LA12_0 <= PLUS)||LA12_0==QMARK||LA12_0==STAR||LA12_0==TERM_NORMAL||LA12_0==TERM_TRUNCATED) ) {
+                            alt12=1;
+                        }
+
+
+                        switch (alt12) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:129:24: clauseOr
+                    	    {
+                    	    pushFollow(FOLLOW_clauseOr_in_clauseBasic544);
+                    	    clauseOr18=clauseOr();
+
+                    	    state._fsp--;
+                    	    if (state.failed) return retval;
+                    	    if ( state.backtracking==0 ) stream_clauseOr.add(clauseOr18.getTree());
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt12 >= 1 ) break loop12;
+                    	    if (state.backtracking>0) {state.failed=true; return retval;}
+                                EarlyExitException eee =
+                                    new EarlyExitException(12, input);
+                                throw eee;
+                        }
+                        cnt12++;
+                    } while (true);
+
+
+                    RPAREN19=(Token)match(input,RPAREN,FOLLOW_RPAREN_in_clauseBasic547); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_RPAREN.add(RPAREN19);
+
+
+                    // AST REWRITE
+                    // elements: clauseOr
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 130:3: -> ( clauseOr )+
+                    {
+                        if ( !(stream_clauseOr.hasNext()) ) {
+                            throw new RewriteEarlyExitException();
+                        }
+                        while ( stream_clauseOr.hasNext() ) {
+                            adaptor.addChild(root_0, stream_clauseOr.nextTree());
+
+                        }
+                        stream_clauseOr.reset();
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 4 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:131:4: atom
+                    {
+                    root_0 = (Object)adaptor.nil();
+
+
+                    pushFollow(FOLLOW_atom_in_clauseBasic559);
+                    atom20=atom();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) adaptor.addChild(root_0, atom20.getTree());
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "clauseBasic"
+
+
+    public static class atom_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "atom"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:135:1: atom : ( ( modifier )? field multi_value ( term_modifier )? -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD field multi_value ) ) ) ) | ( modifier )? ( field )? value ( term_modifier )? -> ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD ( field )? value ) ) ) );
+    public final ExtendedLuceneGrammarParser.atom_return atom() throws RecognitionException {
+        ExtendedLuceneGrammarParser.atom_return retval = new ExtendedLuceneGrammarParser.atom_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.modifier_return modifier21 =null;
+
+        ExtendedLuceneGrammarParser.field_return field22 =null;
+
+        ExtendedLuceneGrammarParser.multi_value_return multi_value23 =null;
+
+        ExtendedLuceneGrammarParser.term_modifier_return term_modifier24 =null;
+
+        ExtendedLuceneGrammarParser.modifier_return modifier25 =null;
+
+        ExtendedLuceneGrammarParser.field_return field26 =null;
+
+        ExtendedLuceneGrammarParser.value_return value27 =null;
+
+        ExtendedLuceneGrammarParser.term_modifier_return term_modifier28 =null;
+
+
+        RewriteRuleSubtreeStream stream_modifier=new RewriteRuleSubtreeStream(adaptor,"rule modifier");
+        RewriteRuleSubtreeStream stream_field=new RewriteRuleSubtreeStream(adaptor,"rule field");
+        RewriteRuleSubtreeStream stream_term_modifier=new RewriteRuleSubtreeStream(adaptor,"rule term_modifier");
+        RewriteRuleSubtreeStream stream_value=new RewriteRuleSubtreeStream(adaptor,"rule value");
+        RewriteRuleSubtreeStream stream_multi_value=new RewriteRuleSubtreeStream(adaptor,"rule multi_value");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:136:2: ( ( modifier )? field multi_value ( term_modifier )? -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD field multi_value ) ) ) ) | ( modifier )? ( field )? value ( term_modifier )? -> ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD ( field )? value ) ) ) )
+            int alt19=2;
+            switch ( input.LA(1) ) {
+            case PLUS:
+                {
+                int LA19_1 = input.LA(2);
+
+                if ( (LA19_1==TERM_NORMAL) ) {
+                    int LA19_3 = input.LA(3);
+
+                    if ( (LA19_3==COLON) ) {
+                        int LA19_5 = input.LA(4);
+
+                        if ( (LA19_5==LPAREN) ) {
+                            alt19=1;
+                        }
+                        else if ( ((LA19_5 >= LBRACK && LA19_5 <= LCURLY)||LA19_5==NUMBER||(LA19_5 >= PHRASE && LA19_5 <= PHRASE_ANYTHING)||LA19_5==QMARK||LA19_5==STAR||LA19_5==TERM_NORMAL||LA19_5==TERM_TRUNCATED) ) {
+                            alt19=2;
+                        }
+                        else {
+                            if (state.backtracking>0) {state.failed=true; return retval;}
+                            NoViableAltException nvae =
+                                new NoViableAltException("", 19, 5, input);
+
+                            throw nvae;
+
+                        }
+                    }
+                    else if ( (LA19_3==EOF||LA19_3==AND||LA19_3==CARAT||(LA19_3 >= LBRACK && LA19_3 <= MINUS)||(LA19_3 >= NEAR && LA19_3 <= NUMBER)||(LA19_3 >= OR && LA19_3 <= PLUS)||LA19_3==QMARK||LA19_3==RPAREN||LA19_3==STAR||LA19_3==TERM_NORMAL||(LA19_3 >= TERM_TRUNCATED && LA19_3 <= TILDE)) ) {
+                        alt19=2;
+                    }
+                    else {
+                        if (state.backtracking>0) {state.failed=true; return retval;}
+                        NoViableAltException nvae =
+                            new NoViableAltException("", 19, 3, input);
+
+                        throw nvae;
+
+                    }
+                }
+                else if ( ((LA19_1 >= LBRACK && LA19_1 <= LCURLY)||LA19_1==NUMBER||(LA19_1 >= PHRASE && LA19_1 <= PHRASE_ANYTHING)||LA19_1==QMARK||LA19_1==STAR||LA19_1==TERM_TRUNCATED) ) {
+                    alt19=2;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 19, 1, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            case MINUS:
+                {
+                int LA19_2 = input.LA(2);
+
+                if ( (LA19_2==TERM_NORMAL) ) {
+                    int LA19_3 = input.LA(3);
+
+                    if ( (LA19_3==COLON) ) {
+                        int LA19_5 = input.LA(4);
+
+                        if ( (LA19_5==LPAREN) ) {
+                            alt19=1;
+                        }
+                        else if ( ((LA19_5 >= LBRACK && LA19_5 <= LCURLY)||LA19_5==NUMBER||(LA19_5 >= PHRASE && LA19_5 <= PHRASE_ANYTHING)||LA19_5==QMARK||LA19_5==STAR||LA19_5==TERM_NORMAL||LA19_5==TERM_TRUNCATED) ) {
+                            alt19=2;
+                        }
+                        else {
+                            if (state.backtracking>0) {state.failed=true; return retval;}
+                            NoViableAltException nvae =
+                                new NoViableAltException("", 19, 5, input);
+
+                            throw nvae;
+
+                        }
+                    }
+                    else if ( (LA19_3==EOF||LA19_3==AND||LA19_3==CARAT||(LA19_3 >= LBRACK && LA19_3 <= MINUS)||(LA19_3 >= NEAR && LA19_3 <= NUMBER)||(LA19_3 >= OR && LA19_3 <= PLUS)||LA19_3==QMARK||LA19_3==RPAREN||LA19_3==STAR||LA19_3==TERM_NORMAL||(LA19_3 >= TERM_TRUNCATED && LA19_3 <= TILDE)) ) {
+                        alt19=2;
+                    }
+                    else {
+                        if (state.backtracking>0) {state.failed=true; return retval;}
+                        NoViableAltException nvae =
+                            new NoViableAltException("", 19, 3, input);
+
+                        throw nvae;
+
+                    }
+                }
+                else if ( ((LA19_2 >= LBRACK && LA19_2 <= LCURLY)||LA19_2==NUMBER||(LA19_2 >= PHRASE && LA19_2 <= PHRASE_ANYTHING)||LA19_2==QMARK||LA19_2==STAR||LA19_2==TERM_TRUNCATED) ) {
+                    alt19=2;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 19, 2, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            case TERM_NORMAL:
+                {
+                int LA19_3 = input.LA(2);
+
+                if ( (LA19_3==COLON) ) {
+                    int LA19_5 = input.LA(3);
+
+                    if ( (LA19_5==LPAREN) ) {
+                        alt19=1;
+                    }
+                    else if ( ((LA19_5 >= LBRACK && LA19_5 <= LCURLY)||LA19_5==NUMBER||(LA19_5 >= PHRASE && LA19_5 <= PHRASE_ANYTHING)||LA19_5==QMARK||LA19_5==STAR||LA19_5==TERM_NORMAL||LA19_5==TERM_TRUNCATED) ) {
+                        alt19=2;
+                    }
+                    else {
+                        if (state.backtracking>0) {state.failed=true; return retval;}
+                        NoViableAltException nvae =
+                            new NoViableAltException("", 19, 5, input);
+
+                        throw nvae;
+
+                    }
+                }
+                else if ( (LA19_3==EOF||LA19_3==AND||LA19_3==CARAT||(LA19_3 >= LBRACK && LA19_3 <= MINUS)||(LA19_3 >= NEAR && LA19_3 <= NUMBER)||(LA19_3 >= OR && LA19_3 <= PLUS)||LA19_3==QMARK||LA19_3==RPAREN||LA19_3==STAR||LA19_3==TERM_NORMAL||(LA19_3 >= TERM_TRUNCATED && LA19_3 <= TILDE)) ) {
+                    alt19=2;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 19, 3, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            case LBRACK:
+            case LCURLY:
+            case NUMBER:
+            case PHRASE:
+            case PHRASE_ANYTHING:
+            case QMARK:
+            case STAR:
+            case TERM_TRUNCATED:
+                {
+                alt19=2;
+                }
+                break;
+            default:
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 19, 0, input);
+
+                throw nvae;
+
+            }
+
+            switch (alt19) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:137:2: ( modifier )? field multi_value ( term_modifier )?
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:137:2: ( modifier )?
+                    int alt14=2;
+                    int LA14_0 = input.LA(1);
+
+                    if ( (LA14_0==MINUS||LA14_0==PLUS) ) {
+                        alt14=1;
+                    }
+                    switch (alt14) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:137:2: modifier
+                            {
+                            pushFollow(FOLLOW_modifier_in_atom580);
+                            modifier21=modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_modifier.add(modifier21.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    pushFollow(FOLLOW_field_in_atom583);
+                    field22=field();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_field.add(field22.getTree());
+
+                    pushFollow(FOLLOW_multi_value_in_atom585);
+                    multi_value23=multi_value();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_multi_value.add(multi_value23.getTree());
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:137:30: ( term_modifier )?
+                    int alt15=2;
+                    int LA15_0 = input.LA(1);
+
+                    if ( (LA15_0==CARAT||LA15_0==TILDE) ) {
+                        alt15=1;
+                    }
+                    switch (alt15) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:137:30: term_modifier
+                            {
+                            pushFollow(FOLLOW_term_modifier_in_atom587);
+                            term_modifier24=term_modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_term_modifier.add(term_modifier24.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    // AST REWRITE
+                    // elements: modifier, term_modifier, multi_value, field
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 138:3: -> ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD field multi_value ) ) ) )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:138:6: ^( CLAUSE ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD field multi_value ) ) ) )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(CLAUSE, "CLAUSE")
+                        , root_1);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:138:15: ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD field multi_value ) ) )
+                        {
+                        Object root_2 = (Object)adaptor.nil();
+                        root_2 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(MODIFIER, "MODIFIER")
+                        , root_2);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:138:26: ( modifier )?
+                        if ( stream_modifier.hasNext() ) {
+                            adaptor.addChild(root_2, stream_modifier.nextTree());
+
+                        }
+                        stream_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:138:36: ^( TMODIFIER ( term_modifier )? ^( FIELD field multi_value ) )
+                        {
+                        Object root_3 = (Object)adaptor.nil();
+                        root_3 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(TMODIFIER, "TMODIFIER")
+                        , root_3);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:138:48: ( term_modifier )?
+                        if ( stream_term_modifier.hasNext() ) {
+                            adaptor.addChild(root_3, stream_term_modifier.nextTree());
+
+                        }
+                        stream_term_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:138:63: ^( FIELD field multi_value )
+                        {
+                        Object root_4 = (Object)adaptor.nil();
+                        root_4 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(FIELD, "FIELD")
+                        , root_4);
+
+                        adaptor.addChild(root_4, stream_field.nextTree());
+
+                        adaptor.addChild(root_4, stream_multi_value.nextTree());
+
+                        adaptor.addChild(root_3, root_4);
+                        }
+
+                        adaptor.addChild(root_2, root_3);
+                        }
+
+                        adaptor.addChild(root_1, root_2);
+                        }
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:139:4: ( modifier )? ( field )? value ( term_modifier )?
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:139:4: ( modifier )?
+                    int alt16=2;
+                    int LA16_0 = input.LA(1);
+
+                    if ( (LA16_0==MINUS||LA16_0==PLUS) ) {
+                        alt16=1;
+                    }
+                    switch (alt16) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:139:4: modifier
+                            {
+                            pushFollow(FOLLOW_modifier_in_atom623);
+                            modifier25=modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_modifier.add(modifier25.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:139:14: ( field )?
+                    int alt17=2;
+                    int LA17_0 = input.LA(1);
+
+                    if ( (LA17_0==TERM_NORMAL) ) {
+                        int LA17_1 = input.LA(2);
+
+                        if ( (LA17_1==COLON) ) {
+                            alt17=1;
+                        }
+                    }
+                    switch (alt17) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:139:14: field
+                            {
+                            pushFollow(FOLLOW_field_in_atom626);
+                            field26=field();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_field.add(field26.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    pushFollow(FOLLOW_value_in_atom629);
+                    value27=value();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_value.add(value27.getTree());
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:139:27: ( term_modifier )?
+                    int alt18=2;
+                    int LA18_0 = input.LA(1);
+
+                    if ( (LA18_0==CARAT||LA18_0==TILDE) ) {
+                        alt18=1;
+                    }
+                    switch (alt18) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:139:27: term_modifier
+                            {
+                            pushFollow(FOLLOW_term_modifier_in_atom631);
+                            term_modifier28=term_modifier();
+
+                            state._fsp--;
+                            if (state.failed) return retval;
+                            if ( state.backtracking==0 ) stream_term_modifier.add(term_modifier28.getTree());
+
+                            }
+                            break;
+
+                    }
+
+
+                    // AST REWRITE
+                    // elements: field, modifier, value, term_modifier
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 140:3: -> ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD ( field )? value ) ) )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:140:6: ^( MODIFIER ( modifier )? ^( TMODIFIER ( term_modifier )? ^( FIELD ( field )? value ) ) )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(MODIFIER, "MODIFIER")
+                        , root_1);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:140:17: ( modifier )?
+                        if ( stream_modifier.hasNext() ) {
+                            adaptor.addChild(root_1, stream_modifier.nextTree());
+
+                        }
+                        stream_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:140:27: ^( TMODIFIER ( term_modifier )? ^( FIELD ( field )? value ) )
+                        {
+                        Object root_2 = (Object)adaptor.nil();
+                        root_2 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(TMODIFIER, "TMODIFIER")
+                        , root_2);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:140:39: ( term_modifier )?
+                        if ( stream_term_modifier.hasNext() ) {
+                            adaptor.addChild(root_2, stream_term_modifier.nextTree());
+
+                        }
+                        stream_term_modifier.reset();
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:140:54: ^( FIELD ( field )? value )
+                        {
+                        Object root_3 = (Object)adaptor.nil();
+                        root_3 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(FIELD, "FIELD")
+                        , root_3);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:140:62: ( field )?
+                        if ( stream_field.hasNext() ) {
+                            adaptor.addChild(root_3, stream_field.nextTree());
+
+                        }
+                        stream_field.reset();
+
+                        adaptor.addChild(root_3, stream_value.nextTree());
+
+                        adaptor.addChild(root_2, root_3);
+                        }
+
+                        adaptor.addChild(root_1, root_2);
+                        }
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "atom"
+
+
+    public static class field_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "field"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:144:1: field : TERM_NORMAL COLON -> TERM_NORMAL ;
+    public final ExtendedLuceneGrammarParser.field_return field() throws RecognitionException {
+        ExtendedLuceneGrammarParser.field_return retval = new ExtendedLuceneGrammarParser.field_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token TERM_NORMAL29=null;
+        Token COLON30=null;
+
+        Object TERM_NORMAL29_tree=null;
+        Object COLON30_tree=null;
+        RewriteRuleTokenStream stream_COLON=new RewriteRuleTokenStream(adaptor,"token COLON");
+        RewriteRuleTokenStream stream_TERM_NORMAL=new RewriteRuleTokenStream(adaptor,"token TERM_NORMAL");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:145:2: ( TERM_NORMAL COLON -> TERM_NORMAL )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:146:2: TERM_NORMAL COLON
+            {
+            TERM_NORMAL29=(Token)match(input,TERM_NORMAL,FOLLOW_TERM_NORMAL_in_field678); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_TERM_NORMAL.add(TERM_NORMAL29);
+
+
+            COLON30=(Token)match(input,COLON,FOLLOW_COLON_in_field680); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_COLON.add(COLON30);
+
+
+            // AST REWRITE
+            // elements: TERM_NORMAL
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 146:20: -> TERM_NORMAL
+            {
+                adaptor.addChild(root_0, 
+                stream_TERM_NORMAL.nextNode()
+                );
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "field"
+
+
+    public static class value_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "value"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:149:1: value : ( range_term_in -> ^( QRANGEIN range_term_in ) | range_term_ex -> ^( QRANGEEX range_term_ex ) | normal -> ^( QNORMAL normal ) | truncated -> ^( QTRUNCATED truncated ) | quoted -> ^( QPHRASE quoted ) | quoted_truncated -> ^( QPHRASETRUNC quoted_truncated ) | QMARK -> ^( QTRUNCATED QMARK ) | STAR COLON b= STAR -> ^( QANYTHING $b) | STAR -> ^( QTRUNCATED STAR ) );
+    public final ExtendedLuceneGrammarParser.value_return value() throws RecognitionException {
+        ExtendedLuceneGrammarParser.value_return retval = new ExtendedLuceneGrammarParser.value_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token b=null;
+        Token QMARK37=null;
+        Token STAR38=null;
+        Token COLON39=null;
+        Token STAR40=null;
+        ExtendedLuceneGrammarParser.range_term_in_return range_term_in31 =null;
+
+        ExtendedLuceneGrammarParser.range_term_ex_return range_term_ex32 =null;
+
+        ExtendedLuceneGrammarParser.normal_return normal33 =null;
+
+        ExtendedLuceneGrammarParser.truncated_return truncated34 =null;
+
+        ExtendedLuceneGrammarParser.quoted_return quoted35 =null;
+
+        ExtendedLuceneGrammarParser.quoted_truncated_return quoted_truncated36 =null;
+
+
+        Object b_tree=null;
+        Object QMARK37_tree=null;
+        Object STAR38_tree=null;
+        Object COLON39_tree=null;
+        Object STAR40_tree=null;
+        RewriteRuleTokenStream stream_COLON=new RewriteRuleTokenStream(adaptor,"token COLON");
+        RewriteRuleTokenStream stream_STAR=new RewriteRuleTokenStream(adaptor,"token STAR");
+        RewriteRuleTokenStream stream_QMARK=new RewriteRuleTokenStream(adaptor,"token QMARK");
+        RewriteRuleSubtreeStream stream_range_term_ex=new RewriteRuleSubtreeStream(adaptor,"rule range_term_ex");
+        RewriteRuleSubtreeStream stream_normal=new RewriteRuleSubtreeStream(adaptor,"rule normal");
+        RewriteRuleSubtreeStream stream_quoted=new RewriteRuleSubtreeStream(adaptor,"rule quoted");
+        RewriteRuleSubtreeStream stream_quoted_truncated=new RewriteRuleSubtreeStream(adaptor,"rule quoted_truncated");
+        RewriteRuleSubtreeStream stream_truncated=new RewriteRuleSubtreeStream(adaptor,"rule truncated");
+        RewriteRuleSubtreeStream stream_range_term_in=new RewriteRuleSubtreeStream(adaptor,"rule range_term_in");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:150:2: ( range_term_in -> ^( QRANGEIN range_term_in ) | range_term_ex -> ^( QRANGEEX range_term_ex ) | normal -> ^( QNORMAL normal ) | truncated -> ^( QTRUNCATED truncated ) | quoted -> ^( QPHRASE quoted ) | quoted_truncated -> ^( QPHRASETRUNC quoted_truncated ) | QMARK -> ^( QTRUNCATED QMARK ) | STAR COLON b= STAR -> ^( QANYTHING $b) | STAR -> ^( QTRUNCATED STAR ) )
+            int alt20=9;
+            switch ( input.LA(1) ) {
+            case LBRACK:
+                {
+                alt20=1;
+                }
+                break;
+            case LCURLY:
+                {
+                alt20=2;
+                }
+                break;
+            case NUMBER:
+            case TERM_NORMAL:
+                {
+                alt20=3;
+                }
+                break;
+            case TERM_TRUNCATED:
+                {
+                alt20=4;
+                }
+                break;
+            case PHRASE:
+                {
+                alt20=5;
+                }
+                break;
+            case PHRASE_ANYTHING:
+                {
+                alt20=6;
+                }
+                break;
+            case QMARK:
+                {
+                alt20=7;
+                }
+                break;
+            case STAR:
+                {
+                int LA20_8 = input.LA(2);
+
+                if ( (LA20_8==COLON) ) {
+                    alt20=8;
+                }
+                else if ( (LA20_8==EOF||LA20_8==AND||LA20_8==CARAT||(LA20_8 >= LBRACK && LA20_8 <= MINUS)||(LA20_8 >= NEAR && LA20_8 <= NUMBER)||(LA20_8 >= OR && LA20_8 <= PLUS)||LA20_8==QMARK||LA20_8==RPAREN||LA20_8==STAR||LA20_8==TERM_NORMAL||(LA20_8 >= TERM_TRUNCATED && LA20_8 <= TILDE)) ) {
+                    alt20=9;
+                }
+                else {
+                    if (state.backtracking>0) {state.failed=true; return retval;}
+                    NoViableAltException nvae =
+                        new NoViableAltException("", 20, 8, input);
+
+                    throw nvae;
+
+                }
+                }
+                break;
+            default:
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 20, 0, input);
+
+                throw nvae;
+
+            }
+
+            switch (alt20) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:151:2: range_term_in
+                    {
+                    pushFollow(FOLLOW_range_term_in_in_value699);
+                    range_term_in31=range_term_in();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_range_term_in.add(range_term_in31.getTree());
+
+                    // AST REWRITE
+                    // elements: range_term_in
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 151:16: -> ^( QRANGEIN range_term_in )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:151:19: ^( QRANGEIN range_term_in )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QRANGEIN, "QRANGEIN")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_range_term_in.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:152:4: range_term_ex
+                    {
+                    pushFollow(FOLLOW_range_term_ex_in_value712);
+                    range_term_ex32=range_term_ex();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_range_term_ex.add(range_term_ex32.getTree());
+
+                    // AST REWRITE
+                    // elements: range_term_ex
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 152:18: -> ^( QRANGEEX range_term_ex )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:152:21: ^( QRANGEEX range_term_ex )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QRANGEEX, "QRANGEEX")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_range_term_ex.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 3 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:153:4: normal
+                    {
+                    pushFollow(FOLLOW_normal_in_value726);
+                    normal33=normal();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_normal.add(normal33.getTree());
+
+                    // AST REWRITE
+                    // elements: normal
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 153:11: -> ^( QNORMAL normal )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:153:14: ^( QNORMAL normal )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QNORMAL, "QNORMAL")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_normal.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 4 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:154:4: truncated
+                    {
+                    pushFollow(FOLLOW_truncated_in_value740);
+                    truncated34=truncated();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_truncated.add(truncated34.getTree());
+
+                    // AST REWRITE
+                    // elements: truncated
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 154:14: -> ^( QTRUNCATED truncated )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:154:17: ^( QTRUNCATED truncated )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QTRUNCATED, "QTRUNCATED")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_truncated.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 5 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:155:4: quoted
+                    {
+                    pushFollow(FOLLOW_quoted_in_value754);
+                    quoted35=quoted();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_quoted.add(quoted35.getTree());
+
+                    // AST REWRITE
+                    // elements: quoted
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 155:11: -> ^( QPHRASE quoted )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:155:14: ^( QPHRASE quoted )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QPHRASE, "QPHRASE")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_quoted.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 6 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:156:4: quoted_truncated
+                    {
+                    pushFollow(FOLLOW_quoted_truncated_in_value767);
+                    quoted_truncated36=quoted_truncated();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_quoted_truncated.add(quoted_truncated36.getTree());
+
+                    // AST REWRITE
+                    // elements: quoted_truncated
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 156:21: -> ^( QPHRASETRUNC quoted_truncated )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:156:24: ^( QPHRASETRUNC quoted_truncated )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QPHRASETRUNC, "QPHRASETRUNC")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_quoted_truncated.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 7 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:157:4: QMARK
+                    {
+                    QMARK37=(Token)match(input,QMARK,FOLLOW_QMARK_in_value780); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_QMARK.add(QMARK37);
+
+
+                    // AST REWRITE
+                    // elements: QMARK
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 157:10: -> ^( QTRUNCATED QMARK )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:157:13: ^( QTRUNCATED QMARK )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QTRUNCATED, "QTRUNCATED")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_QMARK.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 8 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:158:4: STAR COLON b= STAR
+                    {
+                    STAR38=(Token)match(input,STAR,FOLLOW_STAR_in_value793); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_STAR.add(STAR38);
+
+
+                    COLON39=(Token)match(input,COLON,FOLLOW_COLON_in_value795); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_COLON.add(COLON39);
+
+
+                    b=(Token)match(input,STAR,FOLLOW_STAR_in_value799); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_STAR.add(b);
+
+
+                    // AST REWRITE
+                    // elements: b
+                    // token labels: b
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleTokenStream stream_b=new RewriteRuleTokenStream(adaptor,"token b",b);
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 158:22: -> ^( QANYTHING $b)
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:158:25: ^( QANYTHING $b)
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QANYTHING, "QANYTHING")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_b.nextNode());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 9 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:159:5: STAR
+                    {
+                    STAR40=(Token)match(input,STAR,FOLLOW_STAR_in_value814); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_STAR.add(STAR40);
+
+
+                    // AST REWRITE
+                    // elements: STAR
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 159:10: -> ^( QTRUNCATED STAR )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:159:13: ^( QTRUNCATED STAR )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QTRUNCATED, "QTRUNCATED")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_STAR.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "value"
+
+
+    public static class range_term_in_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "range_term_in"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:164:1: range_term_in : LBRACK (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) ) ( ( TO )? b= range_value -> $a ( $b)? )? RBRACK ;
+    public final ExtendedLuceneGrammarParser.range_term_in_return range_term_in() throws RecognitionException {
+        ExtendedLuceneGrammarParser.range_term_in_return retval = new ExtendedLuceneGrammarParser.range_term_in_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token LBRACK41=null;
+        Token TO42=null;
+        Token RBRACK43=null;
+        ExtendedLuceneGrammarParser.range_value_return a =null;
+
+        ExtendedLuceneGrammarParser.range_value_return b =null;
+
+
+        Object LBRACK41_tree=null;
+        Object TO42_tree=null;
+        Object RBRACK43_tree=null;
+        RewriteRuleTokenStream stream_RBRACK=new RewriteRuleTokenStream(adaptor,"token RBRACK");
+        RewriteRuleTokenStream stream_LBRACK=new RewriteRuleTokenStream(adaptor,"token LBRACK");
+        RewriteRuleTokenStream stream_TO=new RewriteRuleTokenStream(adaptor,"token TO");
+        RewriteRuleSubtreeStream stream_range_value=new RewriteRuleSubtreeStream(adaptor,"rule range_value");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:165:2: ( LBRACK (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) ) ( ( TO )? b= range_value -> $a ( $b)? )? RBRACK )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:166:8: LBRACK (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) ) ( ( TO )? b= range_value -> $a ( $b)? )? RBRACK
+            {
+            LBRACK41=(Token)match(input,LBRACK,FOLLOW_LBRACK_in_range_term_in845); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_LBRACK.add(LBRACK41);
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:167:8: (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:167:9: a= range_value
+            {
+            pushFollow(FOLLOW_range_value_in_range_term_in857);
+            a=range_value();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_range_value.add(a.getTree());
+
+            // AST REWRITE
+            // elements: range_value
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 167:23: -> range_value ^( QANYTHING QANYTHING[\"*\"] )
+            {
+                adaptor.addChild(root_0, stream_range_value.nextTree());
+
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:167:38: ^( QANYTHING QANYTHING[\"*\"] )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(QANYTHING, "QANYTHING")
+                , root_1);
+
+                adaptor.addChild(root_1, 
+                (Object)adaptor.create(QANYTHING, "*")
+                );
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:168:8: ( ( TO )? b= range_value -> $a ( $b)? )?
+            int alt22=2;
+            int LA22_0 = input.LA(1);
+
+            if ( (LA22_0==DATE_TOKEN||LA22_0==NUMBER||(LA22_0 >= PHRASE && LA22_0 <= PHRASE_ANYTHING)||LA22_0==STAR||LA22_0==TERM_NORMAL||LA22_0==TERM_TRUNCATED||LA22_0==TO) ) {
+                alt22=1;
+            }
+            switch (alt22) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:168:10: ( TO )? b= range_value
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:168:10: ( TO )?
+                    int alt21=2;
+                    int LA21_0 = input.LA(1);
+
+                    if ( (LA21_0==TO) ) {
+                        alt21=1;
+                    }
+                    switch (alt21) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:168:10: TO
+                            {
+                            TO42=(Token)match(input,TO,FOLLOW_TO_in_range_term_in880); if (state.failed) return retval; 
+                            if ( state.backtracking==0 ) stream_TO.add(TO42);
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    pushFollow(FOLLOW_range_value_in_range_term_in885);
+                    b=range_value();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_range_value.add(b.getTree());
+
+                    // AST REWRITE
+                    // elements: a, b
+                    // token labels: 
+                    // rule labels: retval, b, a
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+                    RewriteRuleSubtreeStream stream_b=new RewriteRuleSubtreeStream(adaptor,"rule b",b!=null?b.tree:null);
+                    RewriteRuleSubtreeStream stream_a=new RewriteRuleSubtreeStream(adaptor,"rule a",a!=null?a.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 168:28: -> $a ( $b)?
+                    {
+                        adaptor.addChild(root_0, stream_a.nextTree());
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:168:35: ( $b)?
+                        if ( stream_b.hasNext() ) {
+                            adaptor.addChild(root_0, stream_b.nextTree());
+
+                        }
+                        stream_b.reset();
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+
+
+            RBRACK43=(Token)match(input,RBRACK,FOLLOW_RBRACK_in_range_term_in906); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_RBRACK.add(RBRACK43);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "range_term_in"
+
+
+    public static class range_term_ex_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "range_term_ex"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:173:1: range_term_ex : LCURLY (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) ) ( ( TO )? b= range_value -> $a ( $b)? )? RCURLY ;
+    public final ExtendedLuceneGrammarParser.range_term_ex_return range_term_ex() throws RecognitionException {
+        ExtendedLuceneGrammarParser.range_term_ex_return retval = new ExtendedLuceneGrammarParser.range_term_ex_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token LCURLY44=null;
+        Token TO45=null;
+        Token RCURLY46=null;
+        ExtendedLuceneGrammarParser.range_value_return a =null;
+
+        ExtendedLuceneGrammarParser.range_value_return b =null;
+
+
+        Object LCURLY44_tree=null;
+        Object TO45_tree=null;
+        Object RCURLY46_tree=null;
+        RewriteRuleTokenStream stream_LCURLY=new RewriteRuleTokenStream(adaptor,"token LCURLY");
+        RewriteRuleTokenStream stream_TO=new RewriteRuleTokenStream(adaptor,"token TO");
+        RewriteRuleTokenStream stream_RCURLY=new RewriteRuleTokenStream(adaptor,"token RCURLY");
+        RewriteRuleSubtreeStream stream_range_value=new RewriteRuleSubtreeStream(adaptor,"rule range_value");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:174:2: ( LCURLY (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) ) ( ( TO )? b= range_value -> $a ( $b)? )? RCURLY )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:175:8: LCURLY (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) ) ( ( TO )? b= range_value -> $a ( $b)? )? RCURLY
+            {
+            LCURLY44=(Token)match(input,LCURLY,FOLLOW_LCURLY_in_range_term_ex926); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_LCURLY.add(LCURLY44);
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:176:8: (a= range_value -> range_value ^( QANYTHING QANYTHING[\"*\"] ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:176:10: a= range_value
+            {
+            pushFollow(FOLLOW_range_value_in_range_term_ex939);
+            a=range_value();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_range_value.add(a.getTree());
+
+            // AST REWRITE
+            // elements: range_value
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 176:24: -> range_value ^( QANYTHING QANYTHING[\"*\"] )
+            {
+                adaptor.addChild(root_0, stream_range_value.nextTree());
+
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:176:39: ^( QANYTHING QANYTHING[\"*\"] )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(QANYTHING, "QANYTHING")
+                , root_1);
+
+                adaptor.addChild(root_1, 
+                (Object)adaptor.create(QANYTHING, "*")
+                );
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:177:8: ( ( TO )? b= range_value -> $a ( $b)? )?
+            int alt24=2;
+            int LA24_0 = input.LA(1);
+
+            if ( (LA24_0==DATE_TOKEN||LA24_0==NUMBER||(LA24_0 >= PHRASE && LA24_0 <= PHRASE_ANYTHING)||LA24_0==STAR||LA24_0==TERM_NORMAL||LA24_0==TERM_TRUNCATED||LA24_0==TO) ) {
+                alt24=1;
+            }
+            switch (alt24) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:177:10: ( TO )? b= range_value
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:177:10: ( TO )?
+                    int alt23=2;
+                    int LA23_0 = input.LA(1);
+
+                    if ( (LA23_0==TO) ) {
+                        alt23=1;
+                    }
+                    switch (alt23) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:177:10: TO
+                            {
+                            TO45=(Token)match(input,TO,FOLLOW_TO_in_range_term_ex962); if (state.failed) return retval; 
+                            if ( state.backtracking==0 ) stream_TO.add(TO45);
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    pushFollow(FOLLOW_range_value_in_range_term_ex967);
+                    b=range_value();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_range_value.add(b.getTree());
+
+                    // AST REWRITE
+                    // elements: a, b
+                    // token labels: 
+                    // rule labels: retval, b, a
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+                    RewriteRuleSubtreeStream stream_b=new RewriteRuleSubtreeStream(adaptor,"rule b",b!=null?b.tree:null);
+                    RewriteRuleSubtreeStream stream_a=new RewriteRuleSubtreeStream(adaptor,"rule a",a!=null?a.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 177:28: -> $a ( $b)?
+                    {
+                        adaptor.addChild(root_0, stream_a.nextTree());
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:177:35: ( $b)?
+                        if ( stream_b.hasNext() ) {
+                            adaptor.addChild(root_0, stream_b.nextTree());
+
+                        }
+                        stream_b.reset();
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+
+
+            RCURLY46=(Token)match(input,RCURLY,FOLLOW_RCURLY_in_range_term_ex988); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_RCURLY.add(RCURLY46);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "range_term_ex"
+
+
+    public static class range_value_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "range_value"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:181:1: range_value : ( truncated -> ^( QTRUNCATED truncated ) | quoted -> ^( QPHRASE quoted ) | quoted_truncated -> ^( QPHRASETRUNC quoted_truncated ) | date -> ^( QNORMAL date ) | normal -> ^( QNORMAL normal ) | STAR -> ^( QANYTHING STAR ) );
+    public final ExtendedLuceneGrammarParser.range_value_return range_value() throws RecognitionException {
+        ExtendedLuceneGrammarParser.range_value_return retval = new ExtendedLuceneGrammarParser.range_value_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token STAR52=null;
+        ExtendedLuceneGrammarParser.truncated_return truncated47 =null;
+
+        ExtendedLuceneGrammarParser.quoted_return quoted48 =null;
+
+        ExtendedLuceneGrammarParser.quoted_truncated_return quoted_truncated49 =null;
+
+        ExtendedLuceneGrammarParser.date_return date50 =null;
+
+        ExtendedLuceneGrammarParser.normal_return normal51 =null;
+
+
+        Object STAR52_tree=null;
+        RewriteRuleTokenStream stream_STAR=new RewriteRuleTokenStream(adaptor,"token STAR");
+        RewriteRuleSubtreeStream stream_normal=new RewriteRuleSubtreeStream(adaptor,"rule normal");
+        RewriteRuleSubtreeStream stream_quoted=new RewriteRuleSubtreeStream(adaptor,"rule quoted");
+        RewriteRuleSubtreeStream stream_quoted_truncated=new RewriteRuleSubtreeStream(adaptor,"rule quoted_truncated");
+        RewriteRuleSubtreeStream stream_truncated=new RewriteRuleSubtreeStream(adaptor,"rule truncated");
+        RewriteRuleSubtreeStream stream_date=new RewriteRuleSubtreeStream(adaptor,"rule date");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:182:2: ( truncated -> ^( QTRUNCATED truncated ) | quoted -> ^( QPHRASE quoted ) | quoted_truncated -> ^( QPHRASETRUNC quoted_truncated ) | date -> ^( QNORMAL date ) | normal -> ^( QNORMAL normal ) | STAR -> ^( QANYTHING STAR ) )
+            int alt25=6;
+            switch ( input.LA(1) ) {
+            case TERM_TRUNCATED:
+                {
+                alt25=1;
+                }
+                break;
+            case PHRASE:
+                {
+                alt25=2;
+                }
+                break;
+            case PHRASE_ANYTHING:
+                {
+                alt25=3;
+                }
+                break;
+            case DATE_TOKEN:
+                {
+                alt25=4;
+                }
+                break;
+            case NUMBER:
+            case TERM_NORMAL:
+                {
+                alt25=5;
+                }
+                break;
+            case STAR:
+                {
+                alt25=6;
+                }
+                break;
+            default:
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 25, 0, input);
+
+                throw nvae;
+
+            }
+
+            switch (alt25) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:183:2: truncated
+                    {
+                    pushFollow(FOLLOW_truncated_in_range_value1002);
+                    truncated47=truncated();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_truncated.add(truncated47.getTree());
+
+                    // AST REWRITE
+                    // elements: truncated
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 183:12: -> ^( QTRUNCATED truncated )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:183:15: ^( QTRUNCATED truncated )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QTRUNCATED, "QTRUNCATED")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_truncated.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:184:4: quoted
+                    {
+                    pushFollow(FOLLOW_quoted_in_range_value1015);
+                    quoted48=quoted();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_quoted.add(quoted48.getTree());
+
+                    // AST REWRITE
+                    // elements: quoted
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 184:11: -> ^( QPHRASE quoted )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:184:14: ^( QPHRASE quoted )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QPHRASE, "QPHRASE")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_quoted.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 3 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:185:4: quoted_truncated
+                    {
+                    pushFollow(FOLLOW_quoted_truncated_in_range_value1028);
+                    quoted_truncated49=quoted_truncated();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_quoted_truncated.add(quoted_truncated49.getTree());
+
+                    // AST REWRITE
+                    // elements: quoted_truncated
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 185:21: -> ^( QPHRASETRUNC quoted_truncated )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:185:24: ^( QPHRASETRUNC quoted_truncated )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QPHRASETRUNC, "QPHRASETRUNC")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_quoted_truncated.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 4 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:186:4: date
+                    {
+                    pushFollow(FOLLOW_date_in_range_value1041);
+                    date50=date();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_date.add(date50.getTree());
+
+                    // AST REWRITE
+                    // elements: date
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 186:9: -> ^( QNORMAL date )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:186:12: ^( QNORMAL date )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QNORMAL, "QNORMAL")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_date.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 5 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:187:4: normal
+                    {
+                    pushFollow(FOLLOW_normal_in_range_value1054);
+                    normal51=normal();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_normal.add(normal51.getTree());
+
+                    // AST REWRITE
+                    // elements: normal
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 187:11: -> ^( QNORMAL normal )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:187:14: ^( QNORMAL normal )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QNORMAL, "QNORMAL")
+                        , root_1);
+
+                        adaptor.addChild(root_1, stream_normal.nextTree());
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 6 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:188:4: STAR
+                    {
+                    STAR52=(Token)match(input,STAR,FOLLOW_STAR_in_range_value1068); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_STAR.add(STAR52);
+
+
+                    // AST REWRITE
+                    // elements: STAR
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 188:9: -> ^( QANYTHING STAR )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:188:12: ^( QANYTHING STAR )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(QANYTHING, "QANYTHING")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_STAR.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "range_value"
+
+
+    public static class multi_value_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multi_value"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:191:1: multi_value : LPAREN multiClause RPAREN -> multiClause ;
+    public final ExtendedLuceneGrammarParser.multi_value_return multi_value() throws RecognitionException {
+        ExtendedLuceneGrammarParser.multi_value_return retval = new ExtendedLuceneGrammarParser.multi_value_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token LPAREN53=null;
+        Token RPAREN55=null;
+        ExtendedLuceneGrammarParser.multiClause_return multiClause54 =null;
+
+
+        Object LPAREN53_tree=null;
+        Object RPAREN55_tree=null;
+        RewriteRuleTokenStream stream_RPAREN=new RewriteRuleTokenStream(adaptor,"token RPAREN");
+        RewriteRuleTokenStream stream_LPAREN=new RewriteRuleTokenStream(adaptor,"token LPAREN");
+        RewriteRuleSubtreeStream stream_multiClause=new RewriteRuleSubtreeStream(adaptor,"rule multiClause");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:192:2: ( LPAREN multiClause RPAREN -> multiClause )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:193:2: LPAREN multiClause RPAREN
+            {
+            LPAREN53=(Token)match(input,LPAREN,FOLLOW_LPAREN_in_multi_value1089); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_LPAREN.add(LPAREN53);
+
+
+            pushFollow(FOLLOW_multiClause_in_multi_value1091);
+            multiClause54=multiClause();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_multiClause.add(multiClause54.getTree());
+
+            RPAREN55=(Token)match(input,RPAREN,FOLLOW_RPAREN_in_multi_value1093); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_RPAREN.add(RPAREN55);
+
+
+            // AST REWRITE
+            // elements: multiClause
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 193:28: -> multiClause
+            {
+                adaptor.addChild(root_0, stream_multiClause.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multi_value"
+
+
+    public static class multiClause_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiClause"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:198:1: multiClause : ( clauseOr )+ -> ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) ;
+    public final ExtendedLuceneGrammarParser.multiClause_return multiClause() throws RecognitionException {
+        ExtendedLuceneGrammarParser.multiClause_return retval = new ExtendedLuceneGrammarParser.multiClause_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.clauseOr_return clauseOr56 =null;
+
+
+        RewriteRuleSubtreeStream stream_clauseOr=new RewriteRuleSubtreeStream(adaptor,"rule clauseOr");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:199:2: ( ( clauseOr )+ -> ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:204:2: ( clauseOr )+
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:204:2: ( clauseOr )+
+            int cnt26=0;
+            loop26:
+            do {
+                int alt26=2;
+                int LA26_0 = input.LA(1);
+
+                if ( ((LA26_0 >= LBRACK && LA26_0 <= MINUS)||LA26_0==NUMBER||(LA26_0 >= PHRASE && LA26_0 <= PLUS)||LA26_0==QMARK||LA26_0==STAR||LA26_0==TERM_NORMAL||LA26_0==TERM_TRUNCATED) ) {
+                    alt26=1;
+                }
+
+
+                switch (alt26) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:204:2: clauseOr
+            	    {
+            	    pushFollow(FOLLOW_clauseOr_in_multiClause1120);
+            	    clauseOr56=clauseOr();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_clauseOr.add(clauseOr56.getTree());
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt26 >= 1 ) break loop26;
+            	    if (state.backtracking>0) {state.failed=true; return retval;}
+                        EarlyExitException eee =
+                            new EarlyExitException(26, input);
+                        throw eee;
+                }
+                cnt26++;
+            } while (true);
+
+
+            // AST REWRITE
+            // elements: clauseOr
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 204:12: -> ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:204:15: ^( OPERATOR[\"DEFOP\"] ( clauseOr )+ )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(OPERATOR, "DEFOP")
+                , root_1);
+
+                if ( !(stream_clauseOr.hasNext()) ) {
+                    throw new RewriteEarlyExitException();
+                }
+                while ( stream_clauseOr.hasNext() ) {
+                    adaptor.addChild(root_1, stream_clauseOr.nextTree());
+
+                }
+                stream_clauseOr.reset();
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiClause"
+
+
+    public static class multiDefault_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiDefault"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:217:1: multiDefault : ( multiOr )+ -> ^( OPERATOR[\"DEFOP\"] ( multiOr )+ ) ;
+    public final ExtendedLuceneGrammarParser.multiDefault_return multiDefault() throws RecognitionException {
+        ExtendedLuceneGrammarParser.multiDefault_return retval = new ExtendedLuceneGrammarParser.multiDefault_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.multiOr_return multiOr57 =null;
+
+
+        RewriteRuleSubtreeStream stream_multiOr=new RewriteRuleSubtreeStream(adaptor,"rule multiOr");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:218:2: ( ( multiOr )+ -> ^( OPERATOR[\"DEFOP\"] ( multiOr )+ ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:219:2: ( multiOr )+
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:219:2: ( multiOr )+
+            int cnt27=0;
+            loop27:
+            do {
+                int alt27=2;
+                int LA27_0 = input.LA(1);
+
+                if ( ((LA27_0 >= LBRACK && LA27_0 <= LCURLY)||LA27_0==MINUS||LA27_0==NUMBER||(LA27_0 >= PHRASE && LA27_0 <= PLUS)||LA27_0==QMARK||LA27_0==STAR||LA27_0==TERM_NORMAL||LA27_0==TERM_TRUNCATED) ) {
+                    alt27=1;
+                }
+
+
+                switch (alt27) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:219:2: multiOr
+            	    {
+            	    pushFollow(FOLLOW_multiOr_in_multiDefault1164);
+            	    multiOr57=multiOr();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_multiOr.add(multiOr57.getTree());
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt27 >= 1 ) break loop27;
+            	    if (state.backtracking>0) {state.failed=true; return retval;}
+                        EarlyExitException eee =
+                            new EarlyExitException(27, input);
+                        throw eee;
+                }
+                cnt27++;
+            } while (true);
+
+
+            // AST REWRITE
+            // elements: multiOr
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 219:11: -> ^( OPERATOR[\"DEFOP\"] ( multiOr )+ )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:219:14: ^( OPERATOR[\"DEFOP\"] ( multiOr )+ )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(OPERATOR, "DEFOP")
+                , root_1);
+
+                if ( !(stream_multiOr.hasNext()) ) {
+                    throw new RewriteEarlyExitException();
+                }
+                while ( stream_multiOr.hasNext() ) {
+                    adaptor.addChild(root_1, stream_multiOr.nextTree());
+
+                }
+                stream_multiOr.reset();
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiDefault"
+
+
+    public static class multiOr_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiOr"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:222:1: multiOr : (first= multiAnd -> $first) ( or others= multiAnd -> ^( OPERATOR[\"OR\"] ( multiAnd )+ ) )* ;
+    public final ExtendedLuceneGrammarParser.multiOr_return multiOr() throws RecognitionException {
+        ExtendedLuceneGrammarParser.multiOr_return retval = new ExtendedLuceneGrammarParser.multiOr_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.multiAnd_return first =null;
+
+        ExtendedLuceneGrammarParser.multiAnd_return others =null;
+
+        ExtendedLuceneGrammarParser.or_return or58 =null;
+
+
+        RewriteRuleSubtreeStream stream_multiAnd=new RewriteRuleSubtreeStream(adaptor,"rule multiAnd");
+        RewriteRuleSubtreeStream stream_or=new RewriteRuleSubtreeStream(adaptor,"rule or");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:223:2: ( (first= multiAnd -> $first) ( or others= multiAnd -> ^( OPERATOR[\"OR\"] ( multiAnd )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:224:2: (first= multiAnd -> $first) ( or others= multiAnd -> ^( OPERATOR[\"OR\"] ( multiAnd )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:224:2: (first= multiAnd -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:224:3: first= multiAnd
+            {
+            pushFollow(FOLLOW_multiAnd_in_multiOr1192);
+            first=multiAnd();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_multiAnd.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 224:19: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:224:30: ( or others= multiAnd -> ^( OPERATOR[\"OR\"] ( multiAnd )+ ) )*
+            loop28:
+            do {
+                int alt28=2;
+                int LA28_0 = input.LA(1);
+
+                if ( (LA28_0==OR) ) {
+                    alt28=1;
+                }
+
+
+                switch (alt28) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:224:31: or others= multiAnd
+            	    {
+            	    pushFollow(FOLLOW_or_in_multiOr1202);
+            	    or58=or();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_or.add(or58.getTree());
+
+            	    pushFollow(FOLLOW_multiAnd_in_multiOr1206);
+            	    others=multiAnd();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_multiAnd.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: multiAnd
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 224:49: -> ^( OPERATOR[\"OR\"] ( multiAnd )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:224:52: ^( OPERATOR[\"OR\"] ( multiAnd )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(
+            	        (Object)adaptor.create(OPERATOR, "OR")
+            	        , root_1);
+
+            	        if ( !(stream_multiAnd.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_multiAnd.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_multiAnd.nextTree());
+
+            	        }
+            	        stream_multiAnd.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop28;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiOr"
+
+
+    public static class multiAnd_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiAnd"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:227:1: multiAnd : (first= multiNot -> $first) ( and others= multiNot -> ^( OPERATOR[\"AND\"] ( multiNot )+ ) )* ;
+    public final ExtendedLuceneGrammarParser.multiAnd_return multiAnd() throws RecognitionException {
+        ExtendedLuceneGrammarParser.multiAnd_return retval = new ExtendedLuceneGrammarParser.multiAnd_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.multiNot_return first =null;
+
+        ExtendedLuceneGrammarParser.multiNot_return others =null;
+
+        ExtendedLuceneGrammarParser.and_return and59 =null;
+
+
+        RewriteRuleSubtreeStream stream_multiNot=new RewriteRuleSubtreeStream(adaptor,"rule multiNot");
+        RewriteRuleSubtreeStream stream_and=new RewriteRuleSubtreeStream(adaptor,"rule and");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:228:2: ( (first= multiNot -> $first) ( and others= multiNot -> ^( OPERATOR[\"AND\"] ( multiNot )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:229:2: (first= multiNot -> $first) ( and others= multiNot -> ^( OPERATOR[\"AND\"] ( multiNot )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:229:2: (first= multiNot -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:229:3: first= multiNot
+            {
+            pushFollow(FOLLOW_multiNot_in_multiAnd1237);
+            first=multiNot();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_multiNot.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 229:19: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:229:30: ( and others= multiNot -> ^( OPERATOR[\"AND\"] ( multiNot )+ ) )*
+            loop29:
+            do {
+                int alt29=2;
+                int LA29_0 = input.LA(1);
+
+                if ( (LA29_0==AND) ) {
+                    alt29=1;
+                }
+
+
+                switch (alt29) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:229:31: and others= multiNot
+            	    {
+            	    pushFollow(FOLLOW_and_in_multiAnd1247);
+            	    and59=and();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_and.add(and59.getTree());
+
+            	    pushFollow(FOLLOW_multiNot_in_multiAnd1251);
+            	    others=multiNot();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_multiNot.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: multiNot
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 229:51: -> ^( OPERATOR[\"AND\"] ( multiNot )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:229:54: ^( OPERATOR[\"AND\"] ( multiNot )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(
+            	        (Object)adaptor.create(OPERATOR, "AND")
+            	        , root_1);
+
+            	        if ( !(stream_multiNot.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_multiNot.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_multiNot.nextTree());
+
+            	        }
+            	        stream_multiNot.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop29;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiAnd"
+
+
+    public static class multiNot_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiNot"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:232:1: multiNot : (first= multiNear -> $first) ( not others= multiNear -> ^( OPERATOR[\"NOT\"] ( multiNear )+ ) )* ;
+    public final ExtendedLuceneGrammarParser.multiNot_return multiNot() throws RecognitionException {
+        ExtendedLuceneGrammarParser.multiNot_return retval = new ExtendedLuceneGrammarParser.multiNot_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.multiNear_return first =null;
+
+        ExtendedLuceneGrammarParser.multiNear_return others =null;
+
+        ExtendedLuceneGrammarParser.not_return not60 =null;
+
+
+        RewriteRuleSubtreeStream stream_not=new RewriteRuleSubtreeStream(adaptor,"rule not");
+        RewriteRuleSubtreeStream stream_multiNear=new RewriteRuleSubtreeStream(adaptor,"rule multiNear");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:233:2: ( (first= multiNear -> $first) ( not others= multiNear -> ^( OPERATOR[\"NOT\"] ( multiNear )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:234:2: (first= multiNear -> $first) ( not others= multiNear -> ^( OPERATOR[\"NOT\"] ( multiNear )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:234:2: (first= multiNear -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:234:3: first= multiNear
+            {
+            pushFollow(FOLLOW_multiNear_in_multiNot1282);
+            first=multiNear();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_multiNear.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 234:20: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:234:31: ( not others= multiNear -> ^( OPERATOR[\"NOT\"] ( multiNear )+ ) )*
+            loop30:
+            do {
+                int alt30=2;
+                int LA30_0 = input.LA(1);
+
+                if ( (LA30_0==AND) ) {
+                    int LA30_1 = input.LA(2);
+
+                    if ( (LA30_1==NOT) ) {
+                        alt30=1;
+                    }
+
+
+                }
+                else if ( (LA30_0==NOT) ) {
+                    alt30=1;
+                }
+
+
+                switch (alt30) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:234:32: not others= multiNear
+            	    {
+            	    pushFollow(FOLLOW_not_in_multiNot1292);
+            	    not60=not();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_not.add(not60.getTree());
+
+            	    pushFollow(FOLLOW_multiNear_in_multiNot1296);
+            	    others=multiNear();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_multiNear.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: multiNear
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 234:52: -> ^( OPERATOR[\"NOT\"] ( multiNear )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:234:55: ^( OPERATOR[\"NOT\"] ( multiNear )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(
+            	        (Object)adaptor.create(OPERATOR, "NOT")
+            	        , root_1);
+
+            	        if ( !(stream_multiNear.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_multiNear.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_multiNear.nextTree());
+
+            	        }
+            	        stream_multiNear.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop30;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiNot"
+
+
+    public static class multiNear_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiNear"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:237:1: multiNear : (first= multiBasic -> $first) ( near others= multiBasic -> ^( near ( multiBasic )+ ) )* ;
+    public final ExtendedLuceneGrammarParser.multiNear_return multiNear() throws RecognitionException {
+        ExtendedLuceneGrammarParser.multiNear_return retval = new ExtendedLuceneGrammarParser.multiNear_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.multiBasic_return first =null;
+
+        ExtendedLuceneGrammarParser.multiBasic_return others =null;
+
+        ExtendedLuceneGrammarParser.near_return near61 =null;
+
+
+        RewriteRuleSubtreeStream stream_near=new RewriteRuleSubtreeStream(adaptor,"rule near");
+        RewriteRuleSubtreeStream stream_multiBasic=new RewriteRuleSubtreeStream(adaptor,"rule multiBasic");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:238:2: ( (first= multiBasic -> $first) ( near others= multiBasic -> ^( near ( multiBasic )+ ) )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:239:2: (first= multiBasic -> $first) ( near others= multiBasic -> ^( near ( multiBasic )+ ) )*
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:239:2: (first= multiBasic -> $first)
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:239:3: first= multiBasic
+            {
+            pushFollow(FOLLOW_multiBasic_in_multiNear1326);
+            first=multiBasic();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_multiBasic.add(first.getTree());
+
+            // AST REWRITE
+            // elements: first
+            // token labels: 
+            // rule labels: retval, first
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+            RewriteRuleSubtreeStream stream_first=new RewriteRuleSubtreeStream(adaptor,"rule first",first!=null?first.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 239:21: -> $first
+            {
+                adaptor.addChild(root_0, stream_first.nextTree());
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:239:32: ( near others= multiBasic -> ^( near ( multiBasic )+ ) )*
+            loop31:
+            do {
+                int alt31=2;
+                int LA31_0 = input.LA(1);
+
+                if ( (LA31_0==NEAR) ) {
+                    alt31=1;
+                }
+
+
+                switch (alt31) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:239:33: near others= multiBasic
+            	    {
+            	    pushFollow(FOLLOW_near_in_multiNear1336);
+            	    near61=near();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_near.add(near61.getTree());
+
+            	    pushFollow(FOLLOW_multiBasic_in_multiNear1340);
+            	    others=multiBasic();
+
+            	    state._fsp--;
+            	    if (state.failed) return retval;
+            	    if ( state.backtracking==0 ) stream_multiBasic.add(others.getTree());
+
+            	    // AST REWRITE
+            	    // elements: multiBasic, near
+            	    // token labels: 
+            	    // rule labels: retval
+            	    // token list labels: 
+            	    // rule list labels: 
+            	    // wildcard labels: 
+            	    if ( state.backtracking==0 ) {
+
+            	    retval.tree = root_0;
+            	    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            	    root_0 = (Object)adaptor.nil();
+            	    // 239:55: -> ^( near ( multiBasic )+ )
+            	    {
+            	        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:239:58: ^( near ( multiBasic )+ )
+            	        {
+            	        Object root_1 = (Object)adaptor.nil();
+            	        root_1 = (Object)adaptor.becomeRoot(stream_near.nextNode(), root_1);
+
+            	        if ( !(stream_multiBasic.hasNext()) ) {
+            	            throw new RewriteEarlyExitException();
+            	        }
+            	        while ( stream_multiBasic.hasNext() ) {
+            	            adaptor.addChild(root_1, stream_multiBasic.nextTree());
+
+            	        }
+            	        stream_multiBasic.reset();
+
+            	        adaptor.addChild(root_0, root_1);
+            	        }
+
+            	    }
+
+
+            	    retval.tree = root_0;
+            	    }
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop31;
+                }
+            } while (true);
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiNear"
+
+
+    public static class multiBasic_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "multiBasic"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:243:1: multiBasic : mterm ;
+    public final ExtendedLuceneGrammarParser.multiBasic_return multiBasic() throws RecognitionException {
+        ExtendedLuceneGrammarParser.multiBasic_return retval = new ExtendedLuceneGrammarParser.multiBasic_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.mterm_return mterm62 =null;
+
+
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:244:2: ( mterm )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:245:2: mterm
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            pushFollow(FOLLOW_mterm_in_multiBasic1366);
+            mterm62=mterm();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) adaptor.addChild(root_0, mterm62.getTree());
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "multiBasic"
+
+
+    public static class mterm_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "mterm"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:248:1: mterm : ( modifier )? value -> ^( MODIFIER ( modifier )? value ) ;
+    public final ExtendedLuceneGrammarParser.mterm_return mterm() throws RecognitionException {
+        ExtendedLuceneGrammarParser.mterm_return retval = new ExtendedLuceneGrammarParser.mterm_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        ExtendedLuceneGrammarParser.modifier_return modifier63 =null;
+
+        ExtendedLuceneGrammarParser.value_return value64 =null;
+
+
+        RewriteRuleSubtreeStream stream_modifier=new RewriteRuleSubtreeStream(adaptor,"rule modifier");
+        RewriteRuleSubtreeStream stream_value=new RewriteRuleSubtreeStream(adaptor,"rule value");
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:249:2: ( ( modifier )? value -> ^( MODIFIER ( modifier )? value ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:250:2: ( modifier )? value
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:250:2: ( modifier )?
+            int alt32=2;
+            int LA32_0 = input.LA(1);
+
+            if ( (LA32_0==MINUS||LA32_0==PLUS) ) {
+                alt32=1;
+            }
+            switch (alt32) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:250:2: modifier
+                    {
+                    pushFollow(FOLLOW_modifier_in_mterm1382);
+                    modifier63=modifier();
+
+                    state._fsp--;
+                    if (state.failed) return retval;
+                    if ( state.backtracking==0 ) stream_modifier.add(modifier63.getTree());
+
+                    }
+                    break;
+
+            }
+
+
+            pushFollow(FOLLOW_value_in_mterm1385);
+            value64=value();
+
+            state._fsp--;
+            if (state.failed) return retval;
+            if ( state.backtracking==0 ) stream_value.add(value64.getTree());
+
+            // AST REWRITE
+            // elements: modifier, value
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 250:18: -> ^( MODIFIER ( modifier )? value )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:250:21: ^( MODIFIER ( modifier )? value )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(MODIFIER, "MODIFIER")
+                , root_1);
+
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:250:32: ( modifier )?
+                if ( stream_modifier.hasNext() ) {
+                    adaptor.addChild(root_1, stream_modifier.nextTree());
+
+                }
+                stream_modifier.reset();
+
+                adaptor.addChild(root_1, stream_value.nextTree());
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "mterm"
+
+
+    public static class normal_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "normal"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:254:1: normal : ( TERM_NORMAL | NUMBER );
+    public final ExtendedLuceneGrammarParser.normal_return normal() throws RecognitionException {
+        ExtendedLuceneGrammarParser.normal_return retval = new ExtendedLuceneGrammarParser.normal_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token set65=null;
+
+        Object set65_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:255:2: ( TERM_NORMAL | NUMBER )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            set65=(Token)input.LT(1);
+
+            if ( input.LA(1)==NUMBER||input.LA(1)==TERM_NORMAL ) {
+                input.consume();
+                if ( state.backtracking==0 ) adaptor.addChild(root_0, 
+                (Object)adaptor.create(set65)
+                );
+                state.errorRecovery=false;
+                state.failed=false;
+            }
+            else {
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                throw mse;
+            }
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "normal"
+
+
+    public static class truncated_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "truncated"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:263:1: truncated : TERM_TRUNCATED ;
+    public final ExtendedLuceneGrammarParser.truncated_return truncated() throws RecognitionException {
+        ExtendedLuceneGrammarParser.truncated_return retval = new ExtendedLuceneGrammarParser.truncated_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token TERM_TRUNCATED66=null;
+
+        Object TERM_TRUNCATED66_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:264:2: ( TERM_TRUNCATED )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:265:2: TERM_TRUNCATED
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            TERM_TRUNCATED66=(Token)match(input,TERM_TRUNCATED,FOLLOW_TERM_TRUNCATED_in_truncated1438); if (state.failed) return retval;
+            if ( state.backtracking==0 ) {
+            TERM_TRUNCATED66_tree = 
+            (Object)adaptor.create(TERM_TRUNCATED66)
+            ;
+            adaptor.addChild(root_0, TERM_TRUNCATED66_tree);
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "truncated"
+
+
+    public static class quoted_truncated_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "quoted_truncated"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:269:1: quoted_truncated : PHRASE_ANYTHING ;
+    public final ExtendedLuceneGrammarParser.quoted_truncated_return quoted_truncated() throws RecognitionException {
+        ExtendedLuceneGrammarParser.quoted_truncated_return retval = new ExtendedLuceneGrammarParser.quoted_truncated_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token PHRASE_ANYTHING67=null;
+
+        Object PHRASE_ANYTHING67_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:270:2: ( PHRASE_ANYTHING )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:271:2: PHRASE_ANYTHING
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            PHRASE_ANYTHING67=(Token)match(input,PHRASE_ANYTHING,FOLLOW_PHRASE_ANYTHING_in_quoted_truncated1453); if (state.failed) return retval;
+            if ( state.backtracking==0 ) {
+            PHRASE_ANYTHING67_tree = 
+            (Object)adaptor.create(PHRASE_ANYTHING67)
+            ;
+            adaptor.addChild(root_0, PHRASE_ANYTHING67_tree);
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "quoted_truncated"
+
+
+    public static class quoted_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "quoted"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:274:1: quoted : PHRASE ;
+    public final ExtendedLuceneGrammarParser.quoted_return quoted() throws RecognitionException {
+        ExtendedLuceneGrammarParser.quoted_return retval = new ExtendedLuceneGrammarParser.quoted_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token PHRASE68=null;
+
+        Object PHRASE68_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:274:8: ( PHRASE )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:275:2: PHRASE
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            PHRASE68=(Token)match(input,PHRASE,FOLLOW_PHRASE_in_quoted1465); if (state.failed) return retval;
+            if ( state.backtracking==0 ) {
+            PHRASE68_tree = 
+            (Object)adaptor.create(PHRASE68)
+            ;
+            adaptor.addChild(root_0, PHRASE68_tree);
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "quoted"
+
+
+    public static class operator_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "operator"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:281:1: operator : ( AND -> OPERATOR[\"AND\"] | OR -> OPERATOR[\"OR\"] | NOT -> OPERATOR[\"NOT\"] | NEAR -> OPERATOR[\"NEAR\"] ) ;
+    public final ExtendedLuceneGrammarParser.operator_return operator() throws RecognitionException {
+        ExtendedLuceneGrammarParser.operator_return retval = new ExtendedLuceneGrammarParser.operator_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token AND69=null;
+        Token OR70=null;
+        Token NOT71=null;
+        Token NEAR72=null;
+
+        Object AND69_tree=null;
+        Object OR70_tree=null;
+        Object NOT71_tree=null;
+        Object NEAR72_tree=null;
+        RewriteRuleTokenStream stream_NEAR=new RewriteRuleTokenStream(adaptor,"token NEAR");
+        RewriteRuleTokenStream stream_NOT=new RewriteRuleTokenStream(adaptor,"token NOT");
+        RewriteRuleTokenStream stream_AND=new RewriteRuleTokenStream(adaptor,"token AND");
+        RewriteRuleTokenStream stream_OR=new RewriteRuleTokenStream(adaptor,"token OR");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:281:9: ( ( AND -> OPERATOR[\"AND\"] | OR -> OPERATOR[\"OR\"] | NOT -> OPERATOR[\"NOT\"] | NEAR -> OPERATOR[\"NEAR\"] ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:281:11: ( AND -> OPERATOR[\"AND\"] | OR -> OPERATOR[\"OR\"] | NOT -> OPERATOR[\"NOT\"] | NEAR -> OPERATOR[\"NEAR\"] )
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:281:11: ( AND -> OPERATOR[\"AND\"] | OR -> OPERATOR[\"OR\"] | NOT -> OPERATOR[\"NOT\"] | NEAR -> OPERATOR[\"NEAR\"] )
+            int alt33=4;
+            switch ( input.LA(1) ) {
+            case AND:
+                {
+                alt33=1;
+                }
+                break;
+            case OR:
+                {
+                alt33=2;
+                }
+                break;
+            case NOT:
+                {
+                alt33=3;
+                }
+                break;
+            case NEAR:
+                {
+                alt33=4;
+                }
+                break;
+            default:
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 33, 0, input);
+
+                throw nvae;
+
+            }
+
+            switch (alt33) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:282:2: AND
+                    {
+                    AND69=(Token)match(input,AND,FOLLOW_AND_in_operator1481); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_AND.add(AND69);
+
+
+                    // AST REWRITE
+                    // elements: 
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 282:6: -> OPERATOR[\"AND\"]
+                    {
+                        adaptor.addChild(root_0, 
+                        (Object)adaptor.create(OPERATOR, "AND")
+                        );
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:283:4: OR
+                    {
+                    OR70=(Token)match(input,OR,FOLLOW_OR_in_operator1491); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_OR.add(OR70);
+
+
+                    // AST REWRITE
+                    // elements: 
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 283:7: -> OPERATOR[\"OR\"]
+                    {
+                        adaptor.addChild(root_0, 
+                        (Object)adaptor.create(OPERATOR, "OR")
+                        );
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 3 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:284:4: NOT
+                    {
+                    NOT71=(Token)match(input,NOT,FOLLOW_NOT_in_operator1501); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_NOT.add(NOT71);
+
+
+                    // AST REWRITE
+                    // elements: 
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 284:8: -> OPERATOR[\"NOT\"]
+                    {
+                        adaptor.addChild(root_0, 
+                        (Object)adaptor.create(OPERATOR, "NOT")
+                        );
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 4 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:285:4: NEAR
+                    {
+                    NEAR72=(Token)match(input,NEAR,FOLLOW_NEAR_in_operator1511); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_NEAR.add(NEAR72);
+
+
+                    // AST REWRITE
+                    // elements: 
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 285:9: -> OPERATOR[\"NEAR\"]
+                    {
+                        adaptor.addChild(root_0, 
+                        (Object)adaptor.create(OPERATOR, "NEAR")
+                        );
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "operator"
+
+
+    public static class modifier_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "modifier"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:288:1: modifier : ( PLUS -> PLUS[\"+\"] | MINUS -> MINUS[\"-\"] );
+    public final ExtendedLuceneGrammarParser.modifier_return modifier() throws RecognitionException {
+        ExtendedLuceneGrammarParser.modifier_return retval = new ExtendedLuceneGrammarParser.modifier_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token PLUS73=null;
+        Token MINUS74=null;
+
+        Object PLUS73_tree=null;
+        Object MINUS74_tree=null;
+        RewriteRuleTokenStream stream_PLUS=new RewriteRuleTokenStream(adaptor,"token PLUS");
+        RewriteRuleTokenStream stream_MINUS=new RewriteRuleTokenStream(adaptor,"token MINUS");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:288:9: ( PLUS -> PLUS[\"+\"] | MINUS -> MINUS[\"-\"] )
+            int alt34=2;
+            int LA34_0 = input.LA(1);
+
+            if ( (LA34_0==PLUS) ) {
+                alt34=1;
+            }
+            else if ( (LA34_0==MINUS) ) {
+                alt34=2;
+            }
+            else {
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 34, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt34) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:289:2: PLUS
+                    {
+                    PLUS73=(Token)match(input,PLUS,FOLLOW_PLUS_in_modifier1528); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_PLUS.add(PLUS73);
+
+
+                    // AST REWRITE
+                    // elements: PLUS
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 289:7: -> PLUS[\"+\"]
+                    {
+                        adaptor.addChild(root_0, 
+                        (Object)adaptor.create(PLUS, "+")
+                        );
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:290:4: MINUS
+                    {
+                    MINUS74=(Token)match(input,MINUS,FOLLOW_MINUS_in_modifier1538); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_MINUS.add(MINUS74);
+
+
+                    // AST REWRITE
+                    // elements: MINUS
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 290:10: -> MINUS[\"-\"]
+                    {
+                        adaptor.addChild(root_0, 
+                        (Object)adaptor.create(MINUS, "-")
+                        );
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "modifier"
+
+
+    public static class term_modifier_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "term_modifier"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:302:1: term_modifier : ( TILDE ( CARAT )? -> ^( BOOST ( CARAT )? ) ^( FUZZY TILDE ) | CARAT ( TILDE )? -> ^( BOOST CARAT ) ^( FUZZY ( TILDE )? ) );
+    public final ExtendedLuceneGrammarParser.term_modifier_return term_modifier() throws RecognitionException {
+        ExtendedLuceneGrammarParser.term_modifier_return retval = new ExtendedLuceneGrammarParser.term_modifier_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token TILDE75=null;
+        Token CARAT76=null;
+        Token CARAT77=null;
+        Token TILDE78=null;
+
+        Object TILDE75_tree=null;
+        Object CARAT76_tree=null;
+        Object CARAT77_tree=null;
+        Object TILDE78_tree=null;
+        RewriteRuleTokenStream stream_CARAT=new RewriteRuleTokenStream(adaptor,"token CARAT");
+        RewriteRuleTokenStream stream_TILDE=new RewriteRuleTokenStream(adaptor,"token TILDE");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:302:15: ( TILDE ( CARAT )? -> ^( BOOST ( CARAT )? ) ^( FUZZY TILDE ) | CARAT ( TILDE )? -> ^( BOOST CARAT ) ^( FUZZY ( TILDE )? ) )
+            int alt37=2;
+            int LA37_0 = input.LA(1);
+
+            if ( (LA37_0==TILDE) ) {
+                alt37=1;
+            }
+            else if ( (LA37_0==CARAT) ) {
+                alt37=2;
+            }
+            else {
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 37, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt37) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:303:2: TILDE ( CARAT )?
+                    {
+                    TILDE75=(Token)match(input,TILDE,FOLLOW_TILDE_in_term_modifier1556); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_TILDE.add(TILDE75);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:303:8: ( CARAT )?
+                    int alt35=2;
+                    int LA35_0 = input.LA(1);
+
+                    if ( (LA35_0==CARAT) ) {
+                        alt35=1;
+                    }
+                    switch (alt35) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:303:8: CARAT
+                            {
+                            CARAT76=(Token)match(input,CARAT,FOLLOW_CARAT_in_term_modifier1558); if (state.failed) return retval; 
+                            if ( state.backtracking==0 ) stream_CARAT.add(CARAT76);
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    // AST REWRITE
+                    // elements: TILDE, CARAT
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 303:15: -> ^( BOOST ( CARAT )? ) ^( FUZZY TILDE )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:303:18: ^( BOOST ( CARAT )? )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(BOOST, "BOOST")
+                        , root_1);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:303:26: ( CARAT )?
+                        if ( stream_CARAT.hasNext() ) {
+                            adaptor.addChild(root_1, 
+                            stream_CARAT.nextNode()
+                            );
+
+                        }
+                        stream_CARAT.reset();
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:303:34: ^( FUZZY TILDE )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(FUZZY, "FUZZY")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_TILDE.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:304:4: CARAT ( TILDE )?
+                    {
+                    CARAT77=(Token)match(input,CARAT,FOLLOW_CARAT_in_term_modifier1580); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_CARAT.add(CARAT77);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:304:10: ( TILDE )?
+                    int alt36=2;
+                    int LA36_0 = input.LA(1);
+
+                    if ( (LA36_0==TILDE) ) {
+                        alt36=1;
+                    }
+                    switch (alt36) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:304:10: TILDE
+                            {
+                            TILDE78=(Token)match(input,TILDE,FOLLOW_TILDE_in_term_modifier1582); if (state.failed) return retval; 
+                            if ( state.backtracking==0 ) stream_TILDE.add(TILDE78);
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    // AST REWRITE
+                    // elements: TILDE, CARAT
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 304:17: -> ^( BOOST CARAT ) ^( FUZZY ( TILDE )? )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:304:20: ^( BOOST CARAT )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(BOOST, "BOOST")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_CARAT.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:304:35: ^( FUZZY ( TILDE )? )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(FUZZY, "FUZZY")
+                        , root_1);
+
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:304:43: ( TILDE )?
+                        if ( stream_TILDE.hasNext() ) {
+                            adaptor.addChild(root_1, 
+                            stream_TILDE.nextNode()
+                            );
+
+                        }
+                        stream_TILDE.reset();
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "term_modifier"
+
+
+    public static class boost_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "boost"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:324:1: boost : ( CARAT -> ^( BOOST NUMBER[\"DEF\"] ) ) ( NUMBER -> ^( BOOST NUMBER ) )? ;
+    public final ExtendedLuceneGrammarParser.boost_return boost() throws RecognitionException {
+        ExtendedLuceneGrammarParser.boost_return retval = new ExtendedLuceneGrammarParser.boost_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token CARAT79=null;
+        Token NUMBER80=null;
+
+        Object CARAT79_tree=null;
+        Object NUMBER80_tree=null;
+        RewriteRuleTokenStream stream_CARAT=new RewriteRuleTokenStream(adaptor,"token CARAT");
+        RewriteRuleTokenStream stream_NUMBER=new RewriteRuleTokenStream(adaptor,"token NUMBER");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:324:7: ( ( CARAT -> ^( BOOST NUMBER[\"DEF\"] ) ) ( NUMBER -> ^( BOOST NUMBER ) )? )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:325:2: ( CARAT -> ^( BOOST NUMBER[\"DEF\"] ) ) ( NUMBER -> ^( BOOST NUMBER ) )?
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:325:2: ( CARAT -> ^( BOOST NUMBER[\"DEF\"] ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:325:3: CARAT
+            {
+            CARAT79=(Token)match(input,CARAT,FOLLOW_CARAT_in_boost1614); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_CARAT.add(CARAT79);
+
+
+            // AST REWRITE
+            // elements: 
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 325:9: -> ^( BOOST NUMBER[\"DEF\"] )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:325:12: ^( BOOST NUMBER[\"DEF\"] )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(BOOST, "BOOST")
+                , root_1);
+
+                adaptor.addChild(root_1, 
+                (Object)adaptor.create(NUMBER, "DEF")
+                );
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:326:2: ( NUMBER -> ^( BOOST NUMBER ) )?
+            int alt38=2;
+            int LA38_0 = input.LA(1);
+
+            if ( (LA38_0==NUMBER) ) {
+                alt38=1;
+            }
+            switch (alt38) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:326:3: NUMBER
+                    {
+                    NUMBER80=(Token)match(input,NUMBER,FOLLOW_NUMBER_in_boost1629); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_NUMBER.add(NUMBER80);
+
+
+                    // AST REWRITE
+                    // elements: NUMBER
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 326:10: -> ^( BOOST NUMBER )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:326:13: ^( BOOST NUMBER )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(BOOST, "BOOST")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_NUMBER.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "boost"
+
+
+    public static class fuzzy_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "fuzzy"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:329:1: fuzzy : ( TILDE -> ^( FUZZY NUMBER[\"DEF\"] ) ) ( NUMBER -> ^( FUZZY NUMBER ) )? ;
+    public final ExtendedLuceneGrammarParser.fuzzy_return fuzzy() throws RecognitionException {
+        ExtendedLuceneGrammarParser.fuzzy_return retval = new ExtendedLuceneGrammarParser.fuzzy_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token TILDE81=null;
+        Token NUMBER82=null;
+
+        Object TILDE81_tree=null;
+        Object NUMBER82_tree=null;
+        RewriteRuleTokenStream stream_TILDE=new RewriteRuleTokenStream(adaptor,"token TILDE");
+        RewriteRuleTokenStream stream_NUMBER=new RewriteRuleTokenStream(adaptor,"token NUMBER");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:329:7: ( ( TILDE -> ^( FUZZY NUMBER[\"DEF\"] ) ) ( NUMBER -> ^( FUZZY NUMBER ) )? )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:330:2: ( TILDE -> ^( FUZZY NUMBER[\"DEF\"] ) ) ( NUMBER -> ^( FUZZY NUMBER ) )?
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:330:2: ( TILDE -> ^( FUZZY NUMBER[\"DEF\"] ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:330:3: TILDE
+            {
+            TILDE81=(Token)match(input,TILDE,FOLLOW_TILDE_in_fuzzy1652); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_TILDE.add(TILDE81);
+
+
+            // AST REWRITE
+            // elements: 
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 330:9: -> ^( FUZZY NUMBER[\"DEF\"] )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:330:12: ^( FUZZY NUMBER[\"DEF\"] )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(FUZZY, "FUZZY")
+                , root_1);
+
+                adaptor.addChild(root_1, 
+                (Object)adaptor.create(NUMBER, "DEF")
+                );
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:331:2: ( NUMBER -> ^( FUZZY NUMBER ) )?
+            int alt39=2;
+            int LA39_0 = input.LA(1);
+
+            if ( (LA39_0==NUMBER) ) {
+                alt39=1;
+            }
+            switch (alt39) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:331:3: NUMBER
+                    {
+                    NUMBER82=(Token)match(input,NUMBER,FOLLOW_NUMBER_in_fuzzy1667); if (state.failed) return retval; 
+                    if ( state.backtracking==0 ) stream_NUMBER.add(NUMBER82);
+
+
+                    // AST REWRITE
+                    // elements: NUMBER
+                    // token labels: 
+                    // rule labels: retval
+                    // token list labels: 
+                    // rule list labels: 
+                    // wildcard labels: 
+                    if ( state.backtracking==0 ) {
+
+                    retval.tree = root_0;
+                    RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+                    root_0 = (Object)adaptor.nil();
+                    // 331:10: -> ^( FUZZY NUMBER )
+                    {
+                        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:331:13: ^( FUZZY NUMBER )
+                        {
+                        Object root_1 = (Object)adaptor.nil();
+                        root_1 = (Object)adaptor.becomeRoot(
+                        (Object)adaptor.create(FUZZY, "FUZZY")
+                        , root_1);
+
+                        adaptor.addChild(root_1, 
+                        stream_NUMBER.nextNode()
+                        );
+
+                        adaptor.addChild(root_0, root_1);
+                        }
+
+                    }
+
+
+                    retval.tree = root_0;
+                    }
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "fuzzy"
+
+
+    public static class not_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "not"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:334:1: not : ( ( AND NOT )=> AND NOT | NOT );
+    public final ExtendedLuceneGrammarParser.not_return not() throws RecognitionException {
+        ExtendedLuceneGrammarParser.not_return retval = new ExtendedLuceneGrammarParser.not_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token AND83=null;
+        Token NOT84=null;
+        Token NOT85=null;
+
+        Object AND83_tree=null;
+        Object NOT84_tree=null;
+        Object NOT85_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:334:5: ( ( AND NOT )=> AND NOT | NOT )
+            int alt40=2;
+            int LA40_0 = input.LA(1);
+
+            if ( (LA40_0==AND) && (synpred4_ExtendedLuceneGrammar())) {
+                alt40=1;
+            }
+            else if ( (LA40_0==NOT) ) {
+                alt40=2;
+            }
+            else {
+                if (state.backtracking>0) {state.failed=true; return retval;}
+                NoViableAltException nvae =
+                    new NoViableAltException("", 40, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt40) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:335:2: ( AND NOT )=> AND NOT
+                    {
+                    root_0 = (Object)adaptor.nil();
+
+
+                    AND83=(Token)match(input,AND,FOLLOW_AND_in_not1697); if (state.failed) return retval;
+                    if ( state.backtracking==0 ) {
+                    AND83_tree = 
+                    (Object)adaptor.create(AND83)
+                    ;
+                    adaptor.addChild(root_0, AND83_tree);
+                    }
+
+                    NOT84=(Token)match(input,NOT,FOLLOW_NOT_in_not1699); if (state.failed) return retval;
+                    if ( state.backtracking==0 ) {
+                    NOT84_tree = 
+                    (Object)adaptor.create(NOT84)
+                    ;
+                    adaptor.addChild(root_0, NOT84_tree);
+                    }
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:336:4: NOT
+                    {
+                    root_0 = (Object)adaptor.nil();
+
+
+                    NOT85=(Token)match(input,NOT,FOLLOW_NOT_in_not1704); if (state.failed) return retval;
+                    if ( state.backtracking==0 ) {
+                    NOT85_tree = 
+                    (Object)adaptor.create(NOT85)
+                    ;
+                    adaptor.addChild(root_0, NOT85_tree);
+                    }
+
+                    }
+                    break;
+
+            }
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "not"
+
+
+    public static class and_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "and"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:339:1: and : AND ;
+    public final ExtendedLuceneGrammarParser.and_return and() throws RecognitionException {
+        ExtendedLuceneGrammarParser.and_return retval = new ExtendedLuceneGrammarParser.and_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token AND86=null;
+
+        Object AND86_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:339:6: ( AND )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:340:2: AND
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            AND86=(Token)match(input,AND,FOLLOW_AND_in_and1718); if (state.failed) return retval;
+            if ( state.backtracking==0 ) {
+            AND86_tree = 
+            (Object)adaptor.create(AND86)
+            ;
+            adaptor.addChild(root_0, AND86_tree);
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "and"
+
+
+    public static class or_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "or"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:343:1: or : OR ;
+    public final ExtendedLuceneGrammarParser.or_return or() throws RecognitionException {
+        ExtendedLuceneGrammarParser.or_return retval = new ExtendedLuceneGrammarParser.or_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token OR87=null;
+
+        Object OR87_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:343:5: ( OR )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:344:2: OR
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            OR87=(Token)match(input,OR,FOLLOW_OR_in_or1732); if (state.failed) return retval;
+            if ( state.backtracking==0 ) {
+            OR87_tree = 
+            (Object)adaptor.create(OR87)
+            ;
+            adaptor.addChild(root_0, OR87_tree);
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "or"
+
+
+    public static class near_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "near"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:347:1: near : ( NEAR -> ^( OPERATOR[$NEAR] ) ) ;
+    public final ExtendedLuceneGrammarParser.near_return near() throws RecognitionException {
+        ExtendedLuceneGrammarParser.near_return retval = new ExtendedLuceneGrammarParser.near_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token NEAR88=null;
+
+        Object NEAR88_tree=null;
+        RewriteRuleTokenStream stream_NEAR=new RewriteRuleTokenStream(adaptor,"token NEAR");
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:347:7: ( ( NEAR -> ^( OPERATOR[$NEAR] ) ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:348:3: ( NEAR -> ^( OPERATOR[$NEAR] ) )
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:348:3: ( NEAR -> ^( OPERATOR[$NEAR] ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:348:4: NEAR
+            {
+            NEAR88=(Token)match(input,NEAR,FOLLOW_NEAR_in_near1749); if (state.failed) return retval; 
+            if ( state.backtracking==0 ) stream_NEAR.add(NEAR88);
+
+
+            // AST REWRITE
+            // elements: 
+            // token labels: 
+            // rule labels: retval
+            // token list labels: 
+            // rule list labels: 
+            // wildcard labels: 
+            if ( state.backtracking==0 ) {
+
+            retval.tree = root_0;
+            RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,"rule retval",retval!=null?retval.tree:null);
+
+            root_0 = (Object)adaptor.nil();
+            // 348:9: -> ^( OPERATOR[$NEAR] )
+            {
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:348:12: ^( OPERATOR[$NEAR] )
+                {
+                Object root_1 = (Object)adaptor.nil();
+                root_1 = (Object)adaptor.becomeRoot(
+                (Object)adaptor.create(OPERATOR, NEAR88)
+                , root_1);
+
+                adaptor.addChild(root_0, root_1);
+                }
+
+            }
+
+
+            retval.tree = root_0;
+            }
+
+            }
+
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "near"
+
+
+    public static class date_return extends ParserRuleReturnScope {
+        Object tree;
+        public Object getTree() { return tree; }
+    };
+
+
+    // $ANTLR start "date"
+    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:351:1: date : DATE_TOKEN ;
+    public final ExtendedLuceneGrammarParser.date_return date() throws RecognitionException {
+        ExtendedLuceneGrammarParser.date_return retval = new ExtendedLuceneGrammarParser.date_return();
+        retval.start = input.LT(1);
+
+
+        Object root_0 = null;
+
+        Token DATE_TOKEN89=null;
+
+        Object DATE_TOKEN89_tree=null;
+
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:351:6: ( DATE_TOKEN )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:353:2: DATE_TOKEN
+            {
+            root_0 = (Object)adaptor.nil();
+
+
+            DATE_TOKEN89=(Token)match(input,DATE_TOKEN,FOLLOW_DATE_TOKEN_in_date1773); if (state.failed) return retval;
+            if ( state.backtracking==0 ) {
+            DATE_TOKEN89_tree = 
+            (Object)adaptor.create(DATE_TOKEN89)
+            ;
+            adaptor.addChild(root_0, DATE_TOKEN89_tree);
+            }
+
+            }
+
+            retval.stop = input.LT(-1);
+
+
+            if ( state.backtracking==0 ) {
+
+            retval.tree = (Object)adaptor.rulePostProcessing(root_0);
+            adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);
+            }
+        }
+        catch (RecognitionException re) {
+            reportError(re);
+            recover(input,re);
+    	retval.tree = (Object)adaptor.errorNode(input, retval.start, input.LT(-1), re);
+
+        }
+
+        finally {
+        	// do for sure before leaving
+        }
+        return retval;
+    }
+    // $ANTLR end "date"
+
+    // $ANTLR start synpred1_ExtendedLuceneGrammar
+    public final void synpred1_ExtendedLuceneGrammar_fragment() throws RecognitionException {
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:125:2: ( modifier LPAREN ( clauseOr )+ RPAREN )
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:125:3: modifier LPAREN ( clauseOr )+ RPAREN
+        {
+        pushFollow(FOLLOW_modifier_in_synpred1_ExtendedLuceneGrammar415);
+        modifier();
+
+        state._fsp--;
+        if (state.failed) return ;
+
+        match(input,LPAREN,FOLLOW_LPAREN_in_synpred1_ExtendedLuceneGrammar417); if (state.failed) return ;
+
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:125:19: ( clauseOr )+
+        int cnt41=0;
+        loop41:
+        do {
+            int alt41=2;
+            int LA41_0 = input.LA(1);
+
+            if ( ((LA41_0 >= LBRACK && LA41_0 <= MINUS)||LA41_0==NUMBER||(LA41_0 >= PHRASE && LA41_0 <= PLUS)||LA41_0==QMARK||LA41_0==STAR||LA41_0==TERM_NORMAL||LA41_0==TERM_TRUNCATED) ) {
+                alt41=1;
+            }
+
+
+            switch (alt41) {
+        	case 1 :
+        	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:125:19: clauseOr
+        	    {
+        	    pushFollow(FOLLOW_clauseOr_in_synpred1_ExtendedLuceneGrammar419);
+        	    clauseOr();
+
+        	    state._fsp--;
+        	    if (state.failed) return ;
+
+        	    }
+        	    break;
+
+        	default :
+        	    if ( cnt41 >= 1 ) break loop41;
+        	    if (state.backtracking>0) {state.failed=true; return ;}
+                    EarlyExitException eee =
+                        new EarlyExitException(41, input);
+                    throw eee;
+            }
+            cnt41++;
+        } while (true);
+
+
+        match(input,RPAREN,FOLLOW_RPAREN_in_synpred1_ExtendedLuceneGrammar422); if (state.failed) return ;
+
+        }
+
+    }
+    // $ANTLR end synpred1_ExtendedLuceneGrammar
+
+    // $ANTLR start synpred2_ExtendedLuceneGrammar
+    public final void synpred2_ExtendedLuceneGrammar_fragment() throws RecognitionException {
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:127:4: ( LPAREN ( clauseOr )+ RPAREN term_modifier )
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:127:5: LPAREN ( clauseOr )+ RPAREN term_modifier
+        {
+        match(input,LPAREN,FOLLOW_LPAREN_in_synpred2_ExtendedLuceneGrammar476); if (state.failed) return ;
+
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:127:12: ( clauseOr )+
+        int cnt42=0;
+        loop42:
+        do {
+            int alt42=2;
+            int LA42_0 = input.LA(1);
+
+            if ( ((LA42_0 >= LBRACK && LA42_0 <= MINUS)||LA42_0==NUMBER||(LA42_0 >= PHRASE && LA42_0 <= PLUS)||LA42_0==QMARK||LA42_0==STAR||LA42_0==TERM_NORMAL||LA42_0==TERM_TRUNCATED) ) {
+                alt42=1;
+            }
+
+
+            switch (alt42) {
+        	case 1 :
+        	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:127:12: clauseOr
+        	    {
+        	    pushFollow(FOLLOW_clauseOr_in_synpred2_ExtendedLuceneGrammar478);
+        	    clauseOr();
+
+        	    state._fsp--;
+        	    if (state.failed) return ;
+
+        	    }
+        	    break;
+
+        	default :
+        	    if ( cnt42 >= 1 ) break loop42;
+        	    if (state.backtracking>0) {state.failed=true; return ;}
+                    EarlyExitException eee =
+                        new EarlyExitException(42, input);
+                    throw eee;
+            }
+            cnt42++;
+        } while (true);
+
+
+        match(input,RPAREN,FOLLOW_RPAREN_in_synpred2_ExtendedLuceneGrammar481); if (state.failed) return ;
+
+        pushFollow(FOLLOW_term_modifier_in_synpred2_ExtendedLuceneGrammar483);
+        term_modifier();
+
+        state._fsp--;
+        if (state.failed) return ;
+
+        }
+
+    }
+    // $ANTLR end synpred2_ExtendedLuceneGrammar
+
+    // $ANTLR start synpred3_ExtendedLuceneGrammar
+    public final void synpred3_ExtendedLuceneGrammar_fragment() throws RecognitionException {
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:129:4: ( LPAREN )
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:129:5: LPAREN
+        {
+        match(input,LPAREN,FOLLOW_LPAREN_in_synpred3_ExtendedLuceneGrammar536); if (state.failed) return ;
+
+        }
+
+    }
+    // $ANTLR end synpred3_ExtendedLuceneGrammar
+
+    // $ANTLR start synpred4_ExtendedLuceneGrammar
+    public final void synpred4_ExtendedLuceneGrammar_fragment() throws RecognitionException {
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:335:2: ( AND NOT )
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:335:3: AND NOT
+        {
+        match(input,AND,FOLLOW_AND_in_synpred4_ExtendedLuceneGrammar1691); if (state.failed) return ;
+
+        match(input,NOT,FOLLOW_NOT_in_synpred4_ExtendedLuceneGrammar1693); if (state.failed) return ;
+
+        }
+
+    }
+    // $ANTLR end synpred4_ExtendedLuceneGrammar
+
+    // Delegated rules
+
+    public final boolean synpred3_ExtendedLuceneGrammar() {
+        state.backtracking++;
+        int start = input.mark();
+        try {
+            synpred3_ExtendedLuceneGrammar_fragment(); // can never throw exception
+        } catch (RecognitionException re) {
+            System.err.println("impossible: "+re);
+        }
+        boolean success = !state.failed;
+        input.rewind(start);
+        state.backtracking--;
+        state.failed=false;
+        return success;
+    }
+    public final boolean synpred1_ExtendedLuceneGrammar() {
+        state.backtracking++;
+        int start = input.mark();
+        try {
+            synpred1_ExtendedLuceneGrammar_fragment(); // can never throw exception
+        } catch (RecognitionException re) {
+            System.err.println("impossible: "+re);
+        }
+        boolean success = !state.failed;
+        input.rewind(start);
+        state.backtracking--;
+        state.failed=false;
+        return success;
+    }
+    public final boolean synpred2_ExtendedLuceneGrammar() {
+        state.backtracking++;
+        int start = input.mark();
+        try {
+            synpred2_ExtendedLuceneGrammar_fragment(); // can never throw exception
+        } catch (RecognitionException re) {
+            System.err.println("impossible: "+re);
+        }
+        boolean success = !state.failed;
+        input.rewind(start);
+        state.backtracking--;
+        state.failed=false;
+        return success;
+    }
+    public final boolean synpred4_ExtendedLuceneGrammar() {
+        state.backtracking++;
+        int start = input.mark();
+        try {
+            synpred4_ExtendedLuceneGrammar_fragment(); // can never throw exception
+        } catch (RecognitionException re) {
+            System.err.println("impossible: "+re);
+        }
+        boolean success = !state.failed;
+        input.rewind(start);
+        state.backtracking--;
+        state.failed=false;
+        return success;
+    }
+
+
+ 
+
+    public static final BitSet FOLLOW_clauseOr_in_mainQ212 = new BitSet(new long[]{0x0000A801391E0000L});
+    public static final BitSet FOLLOW_EOF_in_mainQ215 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_clauseAnd_in_clauseOr242 = new BitSet(new long[]{0x0000000004000002L});
+    public static final BitSet FOLLOW_or_in_clauseOr251 = new BitSet(new long[]{0x0000A801391E0000L});
+    public static final BitSet FOLLOW_clauseAnd_in_clauseOr255 = new BitSet(new long[]{0x0000000004000002L});
+    public static final BitSet FOLLOW_clauseNot_in_clauseAnd284 = new BitSet(new long[]{0x0000000000000022L});
+    public static final BitSet FOLLOW_and_in_clauseAnd294 = new BitSet(new long[]{0x0000A801391E0000L});
+    public static final BitSet FOLLOW_clauseNot_in_clauseAnd298 = new BitSet(new long[]{0x0000000000000022L});
+    public static final BitSet FOLLOW_clauseNear_in_clauseNot329 = new BitSet(new long[]{0x0000000000800022L});
+    public static final BitSet FOLLOW_not_in_clauseNot338 = new BitSet(new long[]{0x0000A801391E0000L});
+    public static final BitSet FOLLOW_clauseNear_in_clauseNot342 = new BitSet(new long[]{0x0000000000800022L});
+    public static final BitSet FOLLOW_clauseBasic_in_clauseNear373 = new BitSet(new long[]{0x0000000000400002L});
+    public static final BitSet FOLLOW_near_in_clauseNear382 = new BitSet(new long[]{0x0000A801391E0000L});
+    public static final BitSet FOLLOW_clauseBasic_in_clauseNear386 = new BitSet(new long[]{0x0000000000400002L});
+    public static final BitSet FOLLOW_modifier_in_clauseBasic427 = new BitSet(new long[]{0x0000000000080000L});
+    public static final BitSet FOLLOW_LPAREN_in_clauseBasic430 = new BitSet(new long[]{0x0000A801391E0000L});
+    public static final BitSet FOLLOW_clauseOr_in_clauseBasic432 = new BitSet(new long[]{0x0000AA01391E0000L});
+    public static final BitSet FOLLOW_RPAREN_in_clauseBasic435 = new BitSet(new long[]{0x0001000000000102L});
+    public static final BitSet FOLLOW_term_modifier_in_clauseBasic437 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_modifier_in_clauseBasic487 = new BitSet(new long[]{0x0000000000080000L});
+    public static final BitSet FOLLOW_LPAREN_in_clauseBasic490 = new BitSet(new long[]{0x0000A801391E0000L});
+    public static final BitSet FOLLOW_clauseOr_in_clauseBasic492 = new BitSet(new long[]{0x0000AA01391E0000L});
+    public static final BitSet FOLLOW_RPAREN_in_clauseBasic495 = new BitSet(new long[]{0x0001000000000102L});
+    public static final BitSet FOLLOW_term_modifier_in_clauseBasic497 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_LPAREN_in_clauseBasic542 = new BitSet(new long[]{0x0000A801391E0000L});
+    public static final BitSet FOLLOW_clauseOr_in_clauseBasic544 = new BitSet(new long[]{0x0000AA01391E0000L});
+    public static final BitSet FOLLOW_RPAREN_in_clauseBasic547 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_atom_in_clauseBasic559 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_modifier_in_atom580 = new BitSet(new long[]{0x0000200000000000L});
+    public static final BitSet FOLLOW_field_in_atom583 = new BitSet(new long[]{0x0000000000080000L});
+    public static final BitSet FOLLOW_multi_value_in_atom585 = new BitSet(new long[]{0x0001000000000102L});
+    public static final BitSet FOLLOW_term_modifier_in_atom587 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_modifier_in_atom623 = new BitSet(new long[]{0x0000A80119060000L});
+    public static final BitSet FOLLOW_field_in_atom626 = new BitSet(new long[]{0x0000A80119060000L});
+    public static final BitSet FOLLOW_value_in_atom629 = new BitSet(new long[]{0x0001000000000102L});
+    public static final BitSet FOLLOW_term_modifier_in_atom631 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_TERM_NORMAL_in_field678 = new BitSet(new long[]{0x0000000000000400L});
+    public static final BitSet FOLLOW_COLON_in_field680 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_range_term_in_in_value699 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_range_term_ex_in_value712 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_normal_in_value726 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_truncated_in_value740 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_quoted_in_value754 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_quoted_truncated_in_value767 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_QMARK_in_value780 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_STAR_in_value793 = new BitSet(new long[]{0x0000000000000400L});
+    public static final BitSet FOLLOW_COLON_in_value795 = new BitSet(new long[]{0x0000080000000000L});
+    public static final BitSet FOLLOW_STAR_in_value799 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_STAR_in_value814 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_LBRACK_in_range_term_in845 = new BitSet(new long[]{0x0000A80019000800L});
+    public static final BitSet FOLLOW_range_value_in_range_term_in857 = new BitSet(new long[]{0x0004A88019000800L});
+    public static final BitSet FOLLOW_TO_in_range_term_in880 = new BitSet(new long[]{0x0000A80019000800L});
+    public static final BitSet FOLLOW_range_value_in_range_term_in885 = new BitSet(new long[]{0x0000008000000000L});
+    public static final BitSet FOLLOW_RBRACK_in_range_term_in906 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_LCURLY_in_range_term_ex926 = new BitSet(new long[]{0x0000A80019000800L});
+    public static final BitSet FOLLOW_range_value_in_range_term_ex939 = new BitSet(new long[]{0x0004A90019000800L});
+    public static final BitSet FOLLOW_TO_in_range_term_ex962 = new BitSet(new long[]{0x0000A80019000800L});
+    public static final BitSet FOLLOW_range_value_in_range_term_ex967 = new BitSet(new long[]{0x0000010000000000L});
+    public static final BitSet FOLLOW_RCURLY_in_range_term_ex988 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_truncated_in_range_value1002 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_quoted_in_range_value1015 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_quoted_truncated_in_range_value1028 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_date_in_range_value1041 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_normal_in_range_value1054 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_STAR_in_range_value1068 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_LPAREN_in_multi_value1089 = new BitSet(new long[]{0x0000A801391E0000L});
+    public static final BitSet FOLLOW_multiClause_in_multi_value1091 = new BitSet(new long[]{0x0000020000000000L});
+    public static final BitSet FOLLOW_RPAREN_in_multi_value1093 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_clauseOr_in_multiClause1120 = new BitSet(new long[]{0x0000A801391E0002L});
+    public static final BitSet FOLLOW_multiOr_in_multiDefault1164 = new BitSet(new long[]{0x0000A80139160002L});
+    public static final BitSet FOLLOW_multiAnd_in_multiOr1192 = new BitSet(new long[]{0x0000000004000002L});
+    public static final BitSet FOLLOW_or_in_multiOr1202 = new BitSet(new long[]{0x0000A80139160000L});
+    public static final BitSet FOLLOW_multiAnd_in_multiOr1206 = new BitSet(new long[]{0x0000000004000002L});
+    public static final BitSet FOLLOW_multiNot_in_multiAnd1237 = new BitSet(new long[]{0x0000000000000022L});
+    public static final BitSet FOLLOW_and_in_multiAnd1247 = new BitSet(new long[]{0x0000A80139160000L});
+    public static final BitSet FOLLOW_multiNot_in_multiAnd1251 = new BitSet(new long[]{0x0000000000000022L});
+    public static final BitSet FOLLOW_multiNear_in_multiNot1282 = new BitSet(new long[]{0x0000000000800022L});
+    public static final BitSet FOLLOW_not_in_multiNot1292 = new BitSet(new long[]{0x0000A80139160000L});
+    public static final BitSet FOLLOW_multiNear_in_multiNot1296 = new BitSet(new long[]{0x0000000000800022L});
+    public static final BitSet FOLLOW_multiBasic_in_multiNear1326 = new BitSet(new long[]{0x0000000000400002L});
+    public static final BitSet FOLLOW_near_in_multiNear1336 = new BitSet(new long[]{0x0000A80139160000L});
+    public static final BitSet FOLLOW_multiBasic_in_multiNear1340 = new BitSet(new long[]{0x0000000000400002L});
+    public static final BitSet FOLLOW_mterm_in_multiBasic1366 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_modifier_in_mterm1382 = new BitSet(new long[]{0x0000A80119060000L});
+    public static final BitSet FOLLOW_value_in_mterm1385 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_TERM_TRUNCATED_in_truncated1438 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_PHRASE_ANYTHING_in_quoted_truncated1453 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_PHRASE_in_quoted1465 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_AND_in_operator1481 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_OR_in_operator1491 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_NOT_in_operator1501 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_NEAR_in_operator1511 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_PLUS_in_modifier1528 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_MINUS_in_modifier1538 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_TILDE_in_term_modifier1556 = new BitSet(new long[]{0x0000000000000102L});
+    public static final BitSet FOLLOW_CARAT_in_term_modifier1558 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_CARAT_in_term_modifier1580 = new BitSet(new long[]{0x0001000000000002L});
+    public static final BitSet FOLLOW_TILDE_in_term_modifier1582 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_CARAT_in_boost1614 = new BitSet(new long[]{0x0000000001000002L});
+    public static final BitSet FOLLOW_NUMBER_in_boost1629 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_TILDE_in_fuzzy1652 = new BitSet(new long[]{0x0000000001000002L});
+    public static final BitSet FOLLOW_NUMBER_in_fuzzy1667 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_AND_in_not1697 = new BitSet(new long[]{0x0000000000800000L});
+    public static final BitSet FOLLOW_NOT_in_not1699 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_NOT_in_not1704 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_AND_in_and1718 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_OR_in_or1732 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_NEAR_in_near1749 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_DATE_TOKEN_in_date1773 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_modifier_in_synpred1_ExtendedLuceneGrammar415 = new BitSet(new long[]{0x0000000000080000L});
+    public static final BitSet FOLLOW_LPAREN_in_synpred1_ExtendedLuceneGrammar417 = new BitSet(new long[]{0x0000A801391E0000L});
+    public static final BitSet FOLLOW_clauseOr_in_synpred1_ExtendedLuceneGrammar419 = new BitSet(new long[]{0x0000AA01391E0000L});
+    public static final BitSet FOLLOW_RPAREN_in_synpred1_ExtendedLuceneGrammar422 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_LPAREN_in_synpred2_ExtendedLuceneGrammar476 = new BitSet(new long[]{0x0000A801391E0000L});
+    public static final BitSet FOLLOW_clauseOr_in_synpred2_ExtendedLuceneGrammar478 = new BitSet(new long[]{0x0000AA01391E0000L});
+    public static final BitSet FOLLOW_RPAREN_in_synpred2_ExtendedLuceneGrammar481 = new BitSet(new long[]{0x0001000000000100L});
+    public static final BitSet FOLLOW_term_modifier_in_synpred2_ExtendedLuceneGrammar483 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_LPAREN_in_synpred3_ExtendedLuceneGrammar536 = new BitSet(new long[]{0x0000000000000002L});
+    public static final BitSet FOLLOW_AND_in_synpred4_ExtendedLuceneGrammar1691 = new BitSet(new long[]{0x0000000000800000L});
+    public static final BitSet FOLLOW_NOT_in_synpred4_ExtendedLuceneGrammar1693 = new BitSet(new long[]{0x0000000000000002L});
+
+}
\ No newline at end of file
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpStandardQueryNodeProcessorPipeline.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpStandardQueryNodeProcessorPipeline.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpStandardQueryNodeProcessorPipeline.java	(revision 0)
@@ -0,0 +1,141 @@
+package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.processors.NoChildOptimizationQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorPipeline;
+import org.apache.lucene.queryparser.flexible.core.processors.RemoveDeletedQueryNodesProcessor;
+import org.apache.lucene.queryparser.flexible.standard.builders.StandardQueryTreeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.standard.parser.StandardSyntaxParser;
+import org.apache.lucene.queryparser.flexible.standard.processors.AllowLeadingWildcardProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.AnalyzerQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.BooleanSingleChildOptimizationQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.BoostQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.DefaultPhraseSlopQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.FuzzyQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.LowercaseExpandedTermsQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.MatchAllDocsQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.MultiFieldQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.MultiTermRewriteMethodProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.NumericQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.NumericRangeQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.OpenRangeQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.PhraseSlopQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.RemoveEmptyNonLeafQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.TermRangeQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.WildcardQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpBOOSTProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpCLAUSEProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpDEFOPProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpFIELDProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpFUZZYProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpFuzzyModifierProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpGroupQueryOptimizerProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpMODIFIERProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpOPERATORProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpOptimizationProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpQANYTHINGProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpQNORMALProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpQPHRASEProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpQPHRASETRUNCProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpQRANGEEXProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpQRANGEINProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpQTRUNCATEDProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpTMODIFIERProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpTreeRewriteProcessor;
+import org.apache.lucene.search.Query;
+
+/**
+ * This is based on the standard/processors
+ * 
+ * This pipeline has all the processors needed to process a query node tree,
+ * generated by {@link StandardSyntaxParser}, already assembled. <br/>
+ * <br/>
+ * The order they are assembled affects the results. <br/>
+ * <br/>
+ * This processor pipeline was designed to work with
+ * {@link StandardQueryConfigHandler}. <br/>
+ * <br/>
+ * The result query node tree can be used to build a {@link Query} object using
+ * {@link StandardQueryTreeBuilder}. <br/>
+ * 
+ * @see StandardQueryTreeBuilder
+ * @see StandardQueryConfigHandler
+ * @see StandardSyntaxParser
+ */
+public class AqpStandardQueryNodeProcessorPipeline extends
+    QueryNodeProcessorPipeline {
+
+  public AqpStandardQueryNodeProcessorPipeline(QueryConfigHandler queryConfig) {
+    super(queryConfig);
+
+    add(new AqpDEFOPProcessor());
+    add(new AqpTreeRewriteProcessor());
+
+    add(new AqpCLAUSEProcessor());
+    add(new AqpMODIFIERProcessor());
+
+    add(new AqpOPERATORProcessor());
+    add(new AqpTMODIFIERProcessor());
+    add(new AqpBOOSTProcessor());
+    add(new AqpFUZZYProcessor());
+
+    add(new AqpQRANGEINProcessor());
+    add(new AqpQRANGEEXProcessor());
+    add(new AqpQNORMALProcessor());
+    add(new AqpQPHRASEProcessor());
+    add(new AqpQPHRASETRUNCProcessor());
+    add(new AqpQTRUNCATEDProcessor());
+    add(new AqpQRANGEINProcessor());
+    add(new AqpQRANGEEXProcessor());
+    add(new AqpQANYTHINGProcessor());
+    add(new AqpFIELDProcessor());
+
+    add(new AqpFuzzyModifierProcessor());
+
+    // TODO: remove the processors which are not needed
+    // these were the standard guys before AQP ones were added
+
+    add(new WildcardQueryNodeProcessor());
+    add(new MultiFieldQueryNodeProcessor());
+    add(new FuzzyQueryNodeProcessor());
+    add(new MatchAllDocsQueryNodeProcessor());
+    add(new OpenRangeQueryNodeProcessor());
+    add(new NumericQueryNodeProcessor());
+    add(new NumericRangeQueryNodeProcessor());
+    add(new LowercaseExpandedTermsQueryNodeProcessor());
+    add(new TermRangeQueryNodeProcessor());
+    add(new AllowLeadingWildcardProcessor());
+    add(new AnalyzerQueryNodeProcessor());
+    add(new PhraseSlopQueryNodeProcessor());
+    // add(new GroupQueryNodeProcessor());
+    add(new NoChildOptimizationQueryNodeProcessor());
+    add(new RemoveDeletedQueryNodesProcessor());
+    add(new RemoveEmptyNonLeafQueryNodeProcessor());
+    add(new BooleanSingleChildOptimizationQueryNodeProcessor());
+    add(new DefaultPhraseSlopQueryNodeProcessor());
+    add(new BoostQueryNodeProcessor());
+    add(new MultiTermRewriteMethodProcessor());
+
+    add(new AqpOptimizationProcessor());
+    add(new AqpGroupQueryOptimizerProcessor());
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammar.tokens
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammar.tokens	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammar.tokens	(revision 0)
@@ -0,0 +1,48 @@
+AMPER=4
+AND=5
+ATOM=6
+BOOST=7
+CARAT=8
+CLAUSE=9
+COLON=10
+DATE_TOKEN=11
+DQUOTE=12
+ESC_CHAR=13
+FIELD=14
+FUZZY=15
+INT=16
+LBRACK=17
+LCURLY=18
+LPAREN=19
+MINUS=20
+MODIFIER=21
+NOT=22
+NUMBER=23
+OPERATOR=24
+OR=25
+PHRASE=26
+PHRASE_ANYTHING=27
+PLUS=28
+QANYTHING=29
+QDATE=30
+QMARK=31
+QNORMAL=32
+QPHRASE=33
+QPHRASETRUNC=34
+QRANGEEX=35
+QRANGEIN=36
+QTRUNCATED=37
+RBRACK=38
+RCURLY=39
+RPAREN=40
+SQUOTE=41
+STAR=42
+TERM_CHAR=43
+TERM_NORMAL=44
+TERM_START_CHAR=45
+TERM_TRUNCATED=46
+TILDE=47
+TMODIFIER=48
+TO=49
+VBAR=50
+WS=51
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammar.tokens
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammar.tokens	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammar.tokens	(revision 0)
@@ -0,0 +1,49 @@
+AMPER=4
+AND=5
+ATOM=6
+BOOST=7
+CARAT=8
+CLAUSE=9
+COLON=10
+DATE_TOKEN=11
+DQUOTE=12
+ESC_CHAR=13
+FIELD=14
+FUZZY=15
+INT=16
+LBRACK=17
+LCURLY=18
+LPAREN=19
+MINUS=20
+MODIFIER=21
+NEAR=22
+NOT=23
+NUMBER=24
+OPERATOR=25
+OR=26
+PHRASE=27
+PHRASE_ANYTHING=28
+PLUS=29
+QANYTHING=30
+QDATE=31
+QMARK=32
+QNORMAL=33
+QPHRASE=34
+QPHRASETRUNC=35
+QRANGEEX=36
+QRANGEIN=37
+QTRUNCATED=38
+RBRACK=39
+RCURLY=40
+RPAREN=41
+SQUOTE=42
+STAR=43
+TERM_CHAR=44
+TERM_NORMAL=45
+TERM_START_CHAR=46
+TERM_TRUNCATED=47
+TILDE=48
+TMODIFIER=49
+TO=50
+VBAR=51
+WS=52
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammarSyntaxParser.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammarSyntaxParser.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammarSyntaxParser.java	(revision 0)
@@ -0,0 +1,85 @@
+
+                
+package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+
+/**
+ * Automatically generated SyntaxParser wrapper built by ant
+ * from the grammar source: /dvt/workspace/lucene_4x/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammar.g
+ * 
+ * YOUR CHANGES WILL BE OVERWRITTEN BY NEXT ANT RUN!
+ */
+
+import org.antlr.runtime.ANTLRStringStream;
+import org.antlr.runtime.CommonTokenStream;
+import org.antlr.runtime.RecognitionException;
+import org.antlr.runtime.TokenStream;
+import org.apache.lucene.queryparser.flexible.messages.Message;
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpCommonTree;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpCommonTreeAdaptor;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeParseException;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+
+import org.apache.lucene.queryparser.flexible.aqp.AqpSyntaxParser;            	
+import org.apache.lucene.queryparser.flexible.aqp.AqpSyntaxParserAbstract;
+import org.apache.lucene.queryparser.flexible.aqp.parser.StandardLuceneGrammarLexer;
+import org.apache.lucene.queryparser.flexible.aqp.parser.StandardLuceneGrammarParser;
+
+
+public class StandardLuceneGrammarSyntaxParser extends AqpSyntaxParserAbstract {
+  public AqpSyntaxParser initializeGrammar(String grammarName)
+          throws QueryNodeParseException {
+    return this;
+  }
+
+  public TokenStream getTokenStream(CharSequence input) {
+    ANTLRStringStream in = new ANTLRStringStream(input.toString());
+    StandardLuceneGrammarLexer lexer = new StandardLuceneGrammarLexer(in);
+    CommonTokenStream tokens = new CommonTokenStream(lexer);
+    return tokens;
+  }
+
+  public QueryNode parseTokenStream(TokenStream tokens, CharSequence query,
+          CharSequence field) throws QueryNodeParseException {
+    StandardLuceneGrammarParser parser = new StandardLuceneGrammarParser(tokens);
+    StandardLuceneGrammarParser.mainQ_return returnValue;
+    
+    AqpCommonTreeAdaptor adaptor = new AqpCommonTreeAdaptor(parser.getTokenNames());
+    parser.setTreeAdaptor(adaptor);
+    
+    AqpCommonTree astTree;
+    
+    try {
+      returnValue = parser.mainQ();
+      // this prevents parser from recovering, however it can also interfere
+      // with custom error handling (if present inside the grammar)
+    	if (parser.getNumberOfSyntaxErrors() > 0) {
+            throw new Exception("The parser reported a syntax error, antlrqueryparser hates errors!");
+      }
+      astTree = (AqpCommonTree) returnValue.getTree();
+      return astTree.toQueryNodeTree();
+    } catch (RecognitionException e) {
+      throw new QueryNodeParseException(new MessageImpl(query + " " + parser.getErrorMessage(e, parser.getTokenNames())));
+    } catch (Exception e) {
+      Message message = new MessageImpl(
+              QueryParserMessages.INVALID_SYNTAX_CANNOT_PARSE, query,
+              e.getMessage());
+      QueryNodeParseException ee = new QueryNodeParseException(e);
+      ee.setQuery(query);
+      ee.setNonLocalizedMessage(message);
+      throw ee;
+    } catch (Error e) {
+      Message message = new MessageImpl(
+              QueryParserMessages.INVALID_SYNTAX_CANNOT_PARSE, query,
+              e.getMessage());
+      QueryNodeParseException ee = new QueryNodeParseException(e);
+      ee.setQuery(query);
+      ee.setNonLocalizedMessage(message);
+      throw ee;
+    }
+  }
+}
+
+            
\ No newline at end of file
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammarSyntaxParser.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammarSyntaxParser.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammarSyntaxParser.java	(revision 0)
@@ -0,0 +1,85 @@
+
+                
+package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+
+/**
+ * Automatically generated SyntaxParser wrapper built by ant
+ * from the grammar source: /dvt/workspace/lucene_4x/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammar.g
+ * 
+ * YOUR CHANGES WILL BE OVERWRITTEN BY NEXT ANT RUN!
+ */
+
+import org.antlr.runtime.ANTLRStringStream;
+import org.antlr.runtime.CommonTokenStream;
+import org.antlr.runtime.RecognitionException;
+import org.antlr.runtime.TokenStream;
+import org.apache.lucene.queryparser.flexible.messages.Message;
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpCommonTree;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpCommonTreeAdaptor;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeParseException;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+
+import org.apache.lucene.queryparser.flexible.aqp.AqpSyntaxParser;            	
+import org.apache.lucene.queryparser.flexible.aqp.AqpSyntaxParserAbstract;
+import org.apache.lucene.queryparser.flexible.aqp.parser.ExtendedLuceneGrammarLexer;
+import org.apache.lucene.queryparser.flexible.aqp.parser.ExtendedLuceneGrammarParser;
+
+
+public class ExtendedLuceneGrammarSyntaxParser extends AqpSyntaxParserAbstract {
+  public AqpSyntaxParser initializeGrammar(String grammarName)
+          throws QueryNodeParseException {
+    return this;
+  }
+
+  public TokenStream getTokenStream(CharSequence input) {
+    ANTLRStringStream in = new ANTLRStringStream(input.toString());
+    ExtendedLuceneGrammarLexer lexer = new ExtendedLuceneGrammarLexer(in);
+    CommonTokenStream tokens = new CommonTokenStream(lexer);
+    return tokens;
+  }
+
+  public QueryNode parseTokenStream(TokenStream tokens, CharSequence query,
+          CharSequence field) throws QueryNodeParseException {
+    ExtendedLuceneGrammarParser parser = new ExtendedLuceneGrammarParser(tokens);
+    ExtendedLuceneGrammarParser.mainQ_return returnValue;
+    
+    AqpCommonTreeAdaptor adaptor = new AqpCommonTreeAdaptor(parser.getTokenNames());
+    parser.setTreeAdaptor(adaptor);
+    
+    AqpCommonTree astTree;
+    
+    try {
+      returnValue = parser.mainQ();
+      // this prevents parser from recovering, however it can also interfere
+      // with custom error handling (if present inside the grammar)
+    	if (parser.getNumberOfSyntaxErrors() > 0) {
+            throw new Exception("The parser reported a syntax error, antlrqueryparser hates errors!");
+      }
+      astTree = (AqpCommonTree) returnValue.getTree();
+      return astTree.toQueryNodeTree();
+    } catch (RecognitionException e) {
+      throw new QueryNodeParseException(new MessageImpl(query + " " + parser.getErrorMessage(e, parser.getTokenNames())));
+    } catch (Exception e) {
+      Message message = new MessageImpl(
+              QueryParserMessages.INVALID_SYNTAX_CANNOT_PARSE, query,
+              e.getMessage());
+      QueryNodeParseException ee = new QueryNodeParseException(e);
+      ee.setQuery(query);
+      ee.setNonLocalizedMessage(message);
+      throw ee;
+    } catch (Error e) {
+      Message message = new MessageImpl(
+              QueryParserMessages.INVALID_SYNTAX_CANNOT_PARSE, query,
+              e.getMessage());
+      QueryNodeParseException ee = new QueryNodeParseException(e);
+      ee.setQuery(query);
+      ee.setNonLocalizedMessage(message);
+      throw ee;
+    }
+  }
+}
+
+            
\ No newline at end of file
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammarLexer.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammarLexer.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/StandardLuceneGrammarLexer.java	(revision 0)
@@ -0,0 +1,3952 @@
+// $ANTLR 3.4 /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g 2013-06-27 18:55:23
+
+  package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+
+import org.antlr.runtime.*;
+import java.util.Stack;
+import java.util.List;
+import java.util.ArrayList;
+
+@SuppressWarnings({"all", "warnings", "unchecked"})
+public class StandardLuceneGrammarLexer extends Lexer {
+    public static final int EOF=-1;
+    public static final int AMPER=4;
+    public static final int AND=5;
+    public static final int ATOM=6;
+    public static final int BOOST=7;
+    public static final int CARAT=8;
+    public static final int CLAUSE=9;
+    public static final int COLON=10;
+    public static final int DATE_TOKEN=11;
+    public static final int DQUOTE=12;
+    public static final int ESC_CHAR=13;
+    public static final int FIELD=14;
+    public static final int FUZZY=15;
+    public static final int INT=16;
+    public static final int LBRACK=17;
+    public static final int LCURLY=18;
+    public static final int LPAREN=19;
+    public static final int MINUS=20;
+    public static final int MODIFIER=21;
+    public static final int NOT=22;
+    public static final int NUMBER=23;
+    public static final int OPERATOR=24;
+    public static final int OR=25;
+    public static final int PHRASE=26;
+    public static final int PHRASE_ANYTHING=27;
+    public static final int PLUS=28;
+    public static final int QANYTHING=29;
+    public static final int QDATE=30;
+    public static final int QMARK=31;
+    public static final int QNORMAL=32;
+    public static final int QPHRASE=33;
+    public static final int QPHRASETRUNC=34;
+    public static final int QRANGEEX=35;
+    public static final int QRANGEIN=36;
+    public static final int QTRUNCATED=37;
+    public static final int RBRACK=38;
+    public static final int RCURLY=39;
+    public static final int RPAREN=40;
+    public static final int SQUOTE=41;
+    public static final int STAR=42;
+    public static final int TERM_CHAR=43;
+    public static final int TERM_NORMAL=44;
+    public static final int TERM_START_CHAR=45;
+    public static final int TERM_TRUNCATED=46;
+    public static final int TILDE=47;
+    public static final int TMODIFIER=48;
+    public static final int TO=49;
+    public static final int VBAR=50;
+    public static final int WS=51;
+
+    	public void recover(RecognitionException re) {
+    		// throw unchecked exception
+    	  throw new RuntimeException(re);
+    	}
+
+
+    // delegates
+    // delegators
+    public Lexer[] getDelegates() {
+        return new Lexer[] {};
+    }
+
+    public StandardLuceneGrammarLexer() {} 
+    public StandardLuceneGrammarLexer(CharStream input) {
+        this(input, new RecognizerSharedState());
+    }
+    public StandardLuceneGrammarLexer(CharStream input, RecognizerSharedState state) {
+        super(input,state);
+    }
+    public String getGrammarFileName() { return "/dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g"; }
+
+    // $ANTLR start "LPAREN"
+    public final void mLPAREN() throws RecognitionException {
+        try {
+            int _type = LPAREN;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:353:9: ( '(' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:353:11: '('
+            {
+            match('('); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "LPAREN"
+
+    // $ANTLR start "RPAREN"
+    public final void mRPAREN() throws RecognitionException {
+        try {
+            int _type = RPAREN;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:355:9: ( ')' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:355:11: ')'
+            {
+            match(')'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "RPAREN"
+
+    // $ANTLR start "LBRACK"
+    public final void mLBRACK() throws RecognitionException {
+        try {
+            int _type = LBRACK;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:357:9: ( '[' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:357:11: '['
+            {
+            match('['); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "LBRACK"
+
+    // $ANTLR start "RBRACK"
+    public final void mRBRACK() throws RecognitionException {
+        try {
+            int _type = RBRACK;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:359:9: ( ']' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:359:11: ']'
+            {
+            match(']'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "RBRACK"
+
+    // $ANTLR start "COLON"
+    public final void mCOLON() throws RecognitionException {
+        try {
+            int _type = COLON;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:361:9: ( ':' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:361:11: ':'
+            {
+            match(':'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "COLON"
+
+    // $ANTLR start "PLUS"
+    public final void mPLUS() throws RecognitionException {
+        try {
+            int _type = PLUS;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:363:7: ( '+' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:363:9: '+'
+            {
+            match('+'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "PLUS"
+
+    // $ANTLR start "MINUS"
+    public final void mMINUS() throws RecognitionException {
+        try {
+            int _type = MINUS;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:365:7: ( ( '-' | '\\!' ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+            {
+            if ( input.LA(1)=='!'||input.LA(1)=='-' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "MINUS"
+
+    // $ANTLR start "STAR"
+    public final void mSTAR() throws RecognitionException {
+        try {
+            int _type = STAR;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:367:7: ( '*' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:367:9: '*'
+            {
+            match('*'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "STAR"
+
+    // $ANTLR start "QMARK"
+    public final void mQMARK() throws RecognitionException {
+        try {
+            int _type = QMARK;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:369:8: ( ( '?' )+ )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:369:10: ( '?' )+
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:369:10: ( '?' )+
+            int cnt1=0;
+            loop1:
+            do {
+                int alt1=2;
+                int LA1_0 = input.LA(1);
+
+                if ( (LA1_0=='?') ) {
+                    alt1=1;
+                }
+
+
+                switch (alt1) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:369:10: '?'
+            	    {
+            	    match('?'); 
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt1 >= 1 ) break loop1;
+                        EarlyExitException eee =
+                            new EarlyExitException(1, input);
+                        throw eee;
+                }
+                cnt1++;
+            } while (true);
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "QMARK"
+
+    // $ANTLR start "VBAR"
+    public final void mVBAR() throws RecognitionException {
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:371:16: ( '|' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:371:18: '|'
+            {
+            match('|'); 
+
+            }
+
+
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "VBAR"
+
+    // $ANTLR start "AMPER"
+    public final void mAMPER() throws RecognitionException {
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:373:16: ( '&' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:373:18: '&'
+            {
+            match('&'); 
+
+            }
+
+
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "AMPER"
+
+    // $ANTLR start "LCURLY"
+    public final void mLCURLY() throws RecognitionException {
+        try {
+            int _type = LCURLY;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:375:9: ( '{' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:375:11: '{'
+            {
+            match('{'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "LCURLY"
+
+    // $ANTLR start "RCURLY"
+    public final void mRCURLY() throws RecognitionException {
+        try {
+            int _type = RCURLY;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:377:9: ( '}' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:377:11: '}'
+            {
+            match('}'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "RCURLY"
+
+    // $ANTLR start "CARAT"
+    public final void mCARAT() throws RecognitionException {
+        try {
+            int _type = CARAT;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:379:7: ( '^' ( ( INT )+ ( '.' ( INT )+ )? )? )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:379:9: '^' ( ( INT )+ ( '.' ( INT )+ )? )?
+            {
+            match('^'); 
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:379:13: ( ( INT )+ ( '.' ( INT )+ )? )?
+            int alt5=2;
+            int LA5_0 = input.LA(1);
+
+            if ( ((LA5_0 >= '0' && LA5_0 <= '9')) ) {
+                alt5=1;
+            }
+            switch (alt5) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:379:14: ( INT )+ ( '.' ( INT )+ )?
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:379:14: ( INT )+
+                    int cnt2=0;
+                    loop2:
+                    do {
+                        int alt2=2;
+                        int LA2_0 = input.LA(1);
+
+                        if ( ((LA2_0 >= '0' && LA2_0 <= '9')) ) {
+                            alt2=1;
+                        }
+
+
+                        switch (alt2) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+                    	    {
+                    	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                    	        input.consume();
+                    	    }
+                    	    else {
+                    	        MismatchedSetException mse = new MismatchedSetException(null,input);
+                    	        recover(mse);
+                    	        throw mse;
+                    	    }
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt2 >= 1 ) break loop2;
+                                EarlyExitException eee =
+                                    new EarlyExitException(2, input);
+                                throw eee;
+                        }
+                        cnt2++;
+                    } while (true);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:379:19: ( '.' ( INT )+ )?
+                    int alt4=2;
+                    int LA4_0 = input.LA(1);
+
+                    if ( (LA4_0=='.') ) {
+                        alt4=1;
+                    }
+                    switch (alt4) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:379:20: '.' ( INT )+
+                            {
+                            match('.'); 
+
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:379:24: ( INT )+
+                            int cnt3=0;
+                            loop3:
+                            do {
+                                int alt3=2;
+                                int LA3_0 = input.LA(1);
+
+                                if ( ((LA3_0 >= '0' && LA3_0 <= '9')) ) {
+                                    alt3=1;
+                                }
+
+
+                                switch (alt3) {
+                            	case 1 :
+                            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+                            	    {
+                            	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                            	        input.consume();
+                            	    }
+                            	    else {
+                            	        MismatchedSetException mse = new MismatchedSetException(null,input);
+                            	        recover(mse);
+                            	        throw mse;
+                            	    }
+
+
+                            	    }
+                            	    break;
+
+                            	default :
+                            	    if ( cnt3 >= 1 ) break loop3;
+                                        EarlyExitException eee =
+                                            new EarlyExitException(3, input);
+                                        throw eee;
+                                }
+                                cnt3++;
+                            } while (true);
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "CARAT"
+
+    // $ANTLR start "TILDE"
+    public final void mTILDE() throws RecognitionException {
+        try {
+            int _type = TILDE;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:381:7: ( '~' ( ( INT )+ ( '.' ( INT )+ )? )? )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:381:9: '~' ( ( INT )+ ( '.' ( INT )+ )? )?
+            {
+            match('~'); 
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:381:13: ( ( INT )+ ( '.' ( INT )+ )? )?
+            int alt9=2;
+            int LA9_0 = input.LA(1);
+
+            if ( ((LA9_0 >= '0' && LA9_0 <= '9')) ) {
+                alt9=1;
+            }
+            switch (alt9) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:381:14: ( INT )+ ( '.' ( INT )+ )?
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:381:14: ( INT )+
+                    int cnt6=0;
+                    loop6:
+                    do {
+                        int alt6=2;
+                        int LA6_0 = input.LA(1);
+
+                        if ( ((LA6_0 >= '0' && LA6_0 <= '9')) ) {
+                            alt6=1;
+                        }
+
+
+                        switch (alt6) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+                    	    {
+                    	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                    	        input.consume();
+                    	    }
+                    	    else {
+                    	        MismatchedSetException mse = new MismatchedSetException(null,input);
+                    	        recover(mse);
+                    	        throw mse;
+                    	    }
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt6 >= 1 ) break loop6;
+                                EarlyExitException eee =
+                                    new EarlyExitException(6, input);
+                                throw eee;
+                        }
+                        cnt6++;
+                    } while (true);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:381:19: ( '.' ( INT )+ )?
+                    int alt8=2;
+                    int LA8_0 = input.LA(1);
+
+                    if ( (LA8_0=='.') ) {
+                        alt8=1;
+                    }
+                    switch (alt8) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:381:20: '.' ( INT )+
+                            {
+                            match('.'); 
+
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:381:24: ( INT )+
+                            int cnt7=0;
+                            loop7:
+                            do {
+                                int alt7=2;
+                                int LA7_0 = input.LA(1);
+
+                                if ( ((LA7_0 >= '0' && LA7_0 <= '9')) ) {
+                                    alt7=1;
+                                }
+
+
+                                switch (alt7) {
+                            	case 1 :
+                            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+                            	    {
+                            	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                            	        input.consume();
+                            	    }
+                            	    else {
+                            	        MismatchedSetException mse = new MismatchedSetException(null,input);
+                            	        recover(mse);
+                            	        throw mse;
+                            	    }
+
+
+                            	    }
+                            	    break;
+
+                            	default :
+                            	    if ( cnt7 >= 1 ) break loop7;
+                                        EarlyExitException eee =
+                                            new EarlyExitException(7, input);
+                                        throw eee;
+                                }
+                                cnt7++;
+                            } while (true);
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "TILDE"
+
+    // $ANTLR start "DQUOTE"
+    public final void mDQUOTE() throws RecognitionException {
+        try {
+            int _type = DQUOTE;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:384:2: ( '\\\"' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:384:4: '\\\"'
+            {
+            match('\"'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "DQUOTE"
+
+    // $ANTLR start "SQUOTE"
+    public final void mSQUOTE() throws RecognitionException {
+        try {
+            int _type = SQUOTE;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:387:2: ( '\\'' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:387:4: '\\''
+            {
+            match('\''); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "SQUOTE"
+
+    // $ANTLR start "TO"
+    public final void mTO() throws RecognitionException {
+        try {
+            int _type = TO;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:392:4: ( 'TO' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:392:6: 'TO'
+            {
+            match("TO"); 
+
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "TO"
+
+    // $ANTLR start "AND"
+    public final void mAND() throws RecognitionException {
+        try {
+            int _type = AND;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:395:7: ( ( ( 'a' | 'A' ) ( 'n' | 'N' ) ( 'd' | 'D' ) | ( AMPER ( AMPER )? ) ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:395:9: ( ( 'a' | 'A' ) ( 'n' | 'N' ) ( 'd' | 'D' ) | ( AMPER ( AMPER )? ) )
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:395:9: ( ( 'a' | 'A' ) ( 'n' | 'N' ) ( 'd' | 'D' ) | ( AMPER ( AMPER )? ) )
+            int alt11=2;
+            int LA11_0 = input.LA(1);
+
+            if ( (LA11_0=='A'||LA11_0=='a') ) {
+                alt11=1;
+            }
+            else if ( (LA11_0=='&') ) {
+                alt11=2;
+            }
+            else {
+                NoViableAltException nvae =
+                    new NoViableAltException("", 11, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt11) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:395:10: ( 'a' | 'A' ) ( 'n' | 'N' ) ( 'd' | 'D' )
+                    {
+                    if ( input.LA(1)=='A'||input.LA(1)=='a' ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    if ( input.LA(1)=='N'||input.LA(1)=='n' ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    if ( input.LA(1)=='D'||input.LA(1)=='d' ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:395:48: ( AMPER ( AMPER )? )
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:395:48: ( AMPER ( AMPER )? )
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:395:49: AMPER ( AMPER )?
+                    {
+                    mAMPER(); 
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:395:55: ( AMPER )?
+                    int alt10=2;
+                    int LA10_0 = input.LA(1);
+
+                    if ( (LA10_0=='&') ) {
+                        alt10=1;
+                    }
+                    switch (alt10) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+                            {
+                            if ( input.LA(1)=='&' ) {
+                                input.consume();
+                            }
+                            else {
+                                MismatchedSetException mse = new MismatchedSetException(null,input);
+                                recover(mse);
+                                throw mse;
+                            }
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    }
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "AND"
+
+    // $ANTLR start "OR"
+    public final void mOR() throws RecognitionException {
+        try {
+            int _type = OR;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:396:5: ( ( ( 'o' | 'O' ) ( 'r' | 'R' ) | ( VBAR ( VBAR )? ) ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:396:7: ( ( 'o' | 'O' ) ( 'r' | 'R' ) | ( VBAR ( VBAR )? ) )
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:396:7: ( ( 'o' | 'O' ) ( 'r' | 'R' ) | ( VBAR ( VBAR )? ) )
+            int alt13=2;
+            int LA13_0 = input.LA(1);
+
+            if ( (LA13_0=='O'||LA13_0=='o') ) {
+                alt13=1;
+            }
+            else if ( (LA13_0=='|') ) {
+                alt13=2;
+            }
+            else {
+                NoViableAltException nvae =
+                    new NoViableAltException("", 13, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt13) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:396:8: ( 'o' | 'O' ) ( 'r' | 'R' )
+                    {
+                    if ( input.LA(1)=='O'||input.LA(1)=='o' ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    if ( input.LA(1)=='R'||input.LA(1)=='r' ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:396:34: ( VBAR ( VBAR )? )
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:396:34: ( VBAR ( VBAR )? )
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:396:35: VBAR ( VBAR )?
+                    {
+                    mVBAR(); 
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:396:40: ( VBAR )?
+                    int alt12=2;
+                    int LA12_0 = input.LA(1);
+
+                    if ( (LA12_0=='|') ) {
+                        alt12=1;
+                    }
+                    switch (alt12) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+                            {
+                            if ( input.LA(1)=='|' ) {
+                                input.consume();
+                            }
+                            else {
+                                MismatchedSetException mse = new MismatchedSetException(null,input);
+                                recover(mse);
+                                throw mse;
+                            }
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    }
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "OR"
+
+    // $ANTLR start "NOT"
+    public final void mNOT() throws RecognitionException {
+        try {
+            int _type = NOT;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:397:7: ( ( 'n' | 'N' ) ( 'o' | 'O' ) ( 't' | 'T' ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:397:9: ( 'n' | 'N' ) ( 'o' | 'O' ) ( 't' | 'T' )
+            {
+            if ( input.LA(1)=='N'||input.LA(1)=='n' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            if ( input.LA(1)=='O'||input.LA(1)=='o' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            if ( input.LA(1)=='T'||input.LA(1)=='t' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "NOT"
+
+    // $ANTLR start "WS"
+    public final void mWS() throws RecognitionException {
+        try {
+            int _type = WS;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:400:5: ( ( ' ' | '\\t' | '\\r' | '\\n' | '\\u3000' ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:400:9: ( ' ' | '\\t' | '\\r' | '\\n' | '\\u3000' )
+            {
+            if ( (input.LA(1) >= '\t' && input.LA(1) <= '\n')||input.LA(1)=='\r'||input.LA(1)==' '||input.LA(1)=='\u3000' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            _channel=HIDDEN;
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "WS"
+
+    // $ANTLR start "INT"
+    public final void mINT() throws RecognitionException {
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:421:13: ( '0' .. '9' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+            {
+            if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            }
+
+
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "INT"
+
+    // $ANTLR start "ESC_CHAR"
+    public final void mESC_CHAR() throws RecognitionException {
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:424:18: ( '\\\\' . )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:424:21: '\\\\' .
+            {
+            match('\\'); 
+
+            matchAny(); 
+
+            }
+
+
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "ESC_CHAR"
+
+    // $ANTLR start "TERM_START_CHAR"
+    public final void mTERM_START_CHAR() throws RecognitionException {
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:428:2: ( (~ ( ' ' | '\\t' | '\\n' | '\\r' | '\\u3000' | '\\'' | '\\\"' | '(' | ')' | '[' | ']' | '{' | '}' | '+' | '-' | '!' | ':' | '~' | '^' | '?' | '*' | '\\\\' ) | ESC_CHAR ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:429:2: (~ ( ' ' | '\\t' | '\\n' | '\\r' | '\\u3000' | '\\'' | '\\\"' | '(' | ')' | '[' | ']' | '{' | '}' | '+' | '-' | '!' | ':' | '~' | '^' | '?' | '*' | '\\\\' ) | ESC_CHAR )
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:429:2: (~ ( ' ' | '\\t' | '\\n' | '\\r' | '\\u3000' | '\\'' | '\\\"' | '(' | ')' | '[' | ']' | '{' | '}' | '+' | '-' | '!' | ':' | '~' | '^' | '?' | '*' | '\\\\' ) | ESC_CHAR )
+            int alt14=2;
+            int LA14_0 = input.LA(1);
+
+            if ( ((LA14_0 >= '\u0000' && LA14_0 <= '\b')||(LA14_0 >= '\u000B' && LA14_0 <= '\f')||(LA14_0 >= '\u000E' && LA14_0 <= '\u001F')||(LA14_0 >= '#' && LA14_0 <= '&')||LA14_0==','||(LA14_0 >= '.' && LA14_0 <= '9')||(LA14_0 >= ';' && LA14_0 <= '>')||(LA14_0 >= '@' && LA14_0 <= 'Z')||(LA14_0 >= '_' && LA14_0 <= 'z')||LA14_0=='|'||(LA14_0 >= '\u007F' && LA14_0 <= '\u2FFF')||(LA14_0 >= '\u3001' && LA14_0 <= '\uFFFF')) ) {
+                alt14=1;
+            }
+            else if ( (LA14_0=='\\') ) {
+                alt14=2;
+            }
+            else {
+                NoViableAltException nvae =
+                    new NoViableAltException("", 14, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt14) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:429:3: ~ ( ' ' | '\\t' | '\\n' | '\\r' | '\\u3000' | '\\'' | '\\\"' | '(' | ')' | '[' | ']' | '{' | '}' | '+' | '-' | '!' | ':' | '~' | '^' | '?' | '*' | '\\\\' )
+                    {
+                    if ( (input.LA(1) >= '\u0000' && input.LA(1) <= '\b')||(input.LA(1) >= '\u000B' && input.LA(1) <= '\f')||(input.LA(1) >= '\u000E' && input.LA(1) <= '\u001F')||(input.LA(1) >= '#' && input.LA(1) <= '&')||input.LA(1)==','||(input.LA(1) >= '.' && input.LA(1) <= '9')||(input.LA(1) >= ';' && input.LA(1) <= '>')||(input.LA(1) >= '@' && input.LA(1) <= 'Z')||(input.LA(1) >= '_' && input.LA(1) <= 'z')||input.LA(1)=='|'||(input.LA(1) >= '\u007F' && input.LA(1) <= '\u2FFF')||(input.LA(1) >= '\u3001' && input.LA(1) <= '\uFFFF') ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:435:5: ESC_CHAR
+                    {
+                    mESC_CHAR(); 
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "TERM_START_CHAR"
+
+    // $ANTLR start "TERM_CHAR"
+    public final void mTERM_CHAR() throws RecognitionException {
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:439:2: ( ( TERM_START_CHAR | '-' | '+' ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:440:2: ( TERM_START_CHAR | '-' | '+' )
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:440:2: ( TERM_START_CHAR | '-' | '+' )
+            int alt15=3;
+            int LA15_0 = input.LA(1);
+
+            if ( ((LA15_0 >= '\u0000' && LA15_0 <= '\b')||(LA15_0 >= '\u000B' && LA15_0 <= '\f')||(LA15_0 >= '\u000E' && LA15_0 <= '\u001F')||(LA15_0 >= '#' && LA15_0 <= '&')||LA15_0==','||(LA15_0 >= '.' && LA15_0 <= '9')||(LA15_0 >= ';' && LA15_0 <= '>')||(LA15_0 >= '@' && LA15_0 <= 'Z')||LA15_0=='\\'||(LA15_0 >= '_' && LA15_0 <= 'z')||LA15_0=='|'||(LA15_0 >= '\u007F' && LA15_0 <= '\u2FFF')||(LA15_0 >= '\u3001' && LA15_0 <= '\uFFFF')) ) {
+                alt15=1;
+            }
+            else if ( (LA15_0=='-') ) {
+                alt15=2;
+            }
+            else if ( (LA15_0=='+') ) {
+                alt15=3;
+            }
+            else {
+                NoViableAltException nvae =
+                    new NoViableAltException("", 15, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt15) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:440:3: TERM_START_CHAR
+                    {
+                    mTERM_START_CHAR(); 
+
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:440:21: '-'
+                    {
+                    match('-'); 
+
+                    }
+                    break;
+                case 3 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:440:27: '+'
+                    {
+                    match('+'); 
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "TERM_CHAR"
+
+    // $ANTLR start "NUMBER"
+    public final void mNUMBER() throws RecognitionException {
+        try {
+            int _type = NUMBER;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:445:2: ( ( INT )+ ( '.' ( INT )+ )? )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:446:2: ( INT )+ ( '.' ( INT )+ )?
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:446:2: ( INT )+
+            int cnt16=0;
+            loop16:
+            do {
+                int alt16=2;
+                int LA16_0 = input.LA(1);
+
+                if ( ((LA16_0 >= '0' && LA16_0 <= '9')) ) {
+                    alt16=1;
+                }
+
+
+                switch (alt16) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+            	    {
+            	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+            	        input.consume();
+            	    }
+            	    else {
+            	        MismatchedSetException mse = new MismatchedSetException(null,input);
+            	        recover(mse);
+            	        throw mse;
+            	    }
+
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt16 >= 1 ) break loop16;
+                        EarlyExitException eee =
+                            new EarlyExitException(16, input);
+                        throw eee;
+                }
+                cnt16++;
+            } while (true);
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:446:7: ( '.' ( INT )+ )?
+            int alt18=2;
+            int LA18_0 = input.LA(1);
+
+            if ( (LA18_0=='.') ) {
+                alt18=1;
+            }
+            switch (alt18) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:446:8: '.' ( INT )+
+                    {
+                    match('.'); 
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:446:12: ( INT )+
+                    int cnt17=0;
+                    loop17:
+                    do {
+                        int alt17=2;
+                        int LA17_0 = input.LA(1);
+
+                        if ( ((LA17_0 >= '0' && LA17_0 <= '9')) ) {
+                            alt17=1;
+                        }
+
+
+                        switch (alt17) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+                    	    {
+                    	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                    	        input.consume();
+                    	    }
+                    	    else {
+                    	        MismatchedSetException mse = new MismatchedSetException(null,input);
+                    	        recover(mse);
+                    	        throw mse;
+                    	    }
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt17 >= 1 ) break loop17;
+                                EarlyExitException eee =
+                                    new EarlyExitException(17, input);
+                                throw eee;
+                        }
+                        cnt17++;
+                    } while (true);
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "NUMBER"
+
+    // $ANTLR start "DATE_TOKEN"
+    public final void mDATE_TOKEN() throws RecognitionException {
+        try {
+            int _type = DATE_TOKEN;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:450:2: ( INT ( INT )? ( '/' | '-' | '.' ) INT ( INT )? ( '/' | '-' | '.' ) INT INT ( INT INT )? )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:451:2: INT ( INT )? ( '/' | '-' | '.' ) INT ( INT )? ( '/' | '-' | '.' ) INT INT ( INT INT )?
+            {
+            mINT(); 
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:451:6: ( INT )?
+            int alt19=2;
+            int LA19_0 = input.LA(1);
+
+            if ( ((LA19_0 >= '0' && LA19_0 <= '9')) ) {
+                alt19=1;
+            }
+            switch (alt19) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+                    {
+                    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    }
+                    break;
+
+            }
+
+
+            if ( (input.LA(1) >= '-' && input.LA(1) <= '/') ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            mINT(); 
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:451:29: ( INT )?
+            int alt20=2;
+            int LA20_0 = input.LA(1);
+
+            if ( ((LA20_0 >= '0' && LA20_0 <= '9')) ) {
+                alt20=1;
+            }
+            switch (alt20) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:
+                    {
+                    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    }
+                    break;
+
+            }
+
+
+            if ( (input.LA(1) >= '-' && input.LA(1) <= '/') ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            mINT(); 
+
+
+            mINT(); 
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:451:56: ( INT INT )?
+            int alt21=2;
+            int LA21_0 = input.LA(1);
+
+            if ( ((LA21_0 >= '0' && LA21_0 <= '9')) ) {
+                alt21=1;
+            }
+            switch (alt21) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:451:57: INT INT
+                    {
+                    mINT(); 
+
+
+                    mINT(); 
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "DATE_TOKEN"
+
+    // $ANTLR start "TERM_NORMAL"
+    public final void mTERM_NORMAL() throws RecognitionException {
+        try {
+            int _type = TERM_NORMAL;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:455:2: ( TERM_START_CHAR ( TERM_CHAR )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:456:2: TERM_START_CHAR ( TERM_CHAR )*
+            {
+            mTERM_START_CHAR(); 
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:456:18: ( TERM_CHAR )*
+            loop22:
+            do {
+                int alt22=2;
+                int LA22_0 = input.LA(1);
+
+                if ( ((LA22_0 >= '\u0000' && LA22_0 <= '\b')||(LA22_0 >= '\u000B' && LA22_0 <= '\f')||(LA22_0 >= '\u000E' && LA22_0 <= '\u001F')||(LA22_0 >= '#' && LA22_0 <= '&')||(LA22_0 >= '+' && LA22_0 <= '9')||(LA22_0 >= ';' && LA22_0 <= '>')||(LA22_0 >= '@' && LA22_0 <= 'Z')||LA22_0=='\\'||(LA22_0 >= '_' && LA22_0 <= 'z')||LA22_0=='|'||(LA22_0 >= '\u007F' && LA22_0 <= '\u2FFF')||(LA22_0 >= '\u3001' && LA22_0 <= '\uFFFF')) ) {
+                    alt22=1;
+                }
+
+
+                switch (alt22) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:456:20: TERM_CHAR
+            	    {
+            	    mTERM_CHAR(); 
+
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop22;
+                }
+            } while (true);
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "TERM_NORMAL"
+
+    // $ANTLR start "TERM_TRUNCATED"
+    public final void mTERM_TRUNCATED() throws RecognitionException {
+        try {
+            int _type = TERM_TRUNCATED;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:460:15: ( ( STAR | QMARK ) ( ( TERM_CHAR )+ ( QMARK | STAR ) )+ ( TERM_CHAR )* | TERM_START_CHAR ( ( TERM_CHAR )* ( QMARK | STAR ) )+ ( TERM_CHAR )* | ( STAR | QMARK ) ( TERM_CHAR )+ )
+            int alt34=3;
+            alt34 = dfa34.predict(input);
+            switch (alt34) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:2: ( STAR | QMARK ) ( ( TERM_CHAR )+ ( QMARK | STAR ) )+ ( TERM_CHAR )*
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:2: ( STAR | QMARK )
+                    int alt23=2;
+                    int LA23_0 = input.LA(1);
+
+                    if ( (LA23_0=='*') ) {
+                        alt23=1;
+                    }
+                    else if ( (LA23_0=='?') ) {
+                        alt23=2;
+                    }
+                    else {
+                        NoViableAltException nvae =
+                            new NoViableAltException("", 23, 0, input);
+
+                        throw nvae;
+
+                    }
+                    switch (alt23) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:3: STAR
+                            {
+                            mSTAR(); 
+
+
+                            }
+                            break;
+                        case 2 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:8: QMARK
+                            {
+                            mQMARK(); 
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:15: ( ( TERM_CHAR )+ ( QMARK | STAR ) )+
+                    int cnt26=0;
+                    loop26:
+                    do {
+                        int alt26=2;
+                        alt26 = dfa26.predict(input);
+                        switch (alt26) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:16: ( TERM_CHAR )+ ( QMARK | STAR )
+                    	    {
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:16: ( TERM_CHAR )+
+                    	    int cnt24=0;
+                    	    loop24:
+                    	    do {
+                    	        int alt24=2;
+                    	        int LA24_0 = input.LA(1);
+
+                    	        if ( ((LA24_0 >= '\u0000' && LA24_0 <= '\b')||(LA24_0 >= '\u000B' && LA24_0 <= '\f')||(LA24_0 >= '\u000E' && LA24_0 <= '\u001F')||(LA24_0 >= '#' && LA24_0 <= '&')||(LA24_0 >= '+' && LA24_0 <= '9')||(LA24_0 >= ';' && LA24_0 <= '>')||(LA24_0 >= '@' && LA24_0 <= 'Z')||LA24_0=='\\'||(LA24_0 >= '_' && LA24_0 <= 'z')||LA24_0=='|'||(LA24_0 >= '\u007F' && LA24_0 <= '\u2FFF')||(LA24_0 >= '\u3001' && LA24_0 <= '\uFFFF')) ) {
+                    	            alt24=1;
+                    	        }
+
+
+                    	        switch (alt24) {
+                    	    	case 1 :
+                    	    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:16: TERM_CHAR
+                    	    	    {
+                    	    	    mTERM_CHAR(); 
+
+
+                    	    	    }
+                    	    	    break;
+
+                    	    	default :
+                    	    	    if ( cnt24 >= 1 ) break loop24;
+                    	                EarlyExitException eee =
+                    	                    new EarlyExitException(24, input);
+                    	                throw eee;
+                    	        }
+                    	        cnt24++;
+                    	    } while (true);
+
+
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:27: ( QMARK | STAR )
+                    	    int alt25=2;
+                    	    int LA25_0 = input.LA(1);
+
+                    	    if ( (LA25_0=='?') ) {
+                    	        alt25=1;
+                    	    }
+                    	    else if ( (LA25_0=='*') ) {
+                    	        alt25=2;
+                    	    }
+                    	    else {
+                    	        NoViableAltException nvae =
+                    	            new NoViableAltException("", 25, 0, input);
+
+                    	        throw nvae;
+
+                    	    }
+                    	    switch (alt25) {
+                    	        case 1 :
+                    	            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:28: QMARK
+                    	            {
+                    	            mQMARK(); 
+
+
+                    	            }
+                    	            break;
+                    	        case 2 :
+                    	            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:34: STAR
+                    	            {
+                    	            mSTAR(); 
+
+
+                    	            }
+                    	            break;
+
+                    	    }
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt26 >= 1 ) break loop26;
+                                EarlyExitException eee =
+                                    new EarlyExitException(26, input);
+                                throw eee;
+                        }
+                        cnt26++;
+                    } while (true);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:42: ( TERM_CHAR )*
+                    loop27:
+                    do {
+                        int alt27=2;
+                        int LA27_0 = input.LA(1);
+
+                        if ( ((LA27_0 >= '\u0000' && LA27_0 <= '\b')||(LA27_0 >= '\u000B' && LA27_0 <= '\f')||(LA27_0 >= '\u000E' && LA27_0 <= '\u001F')||(LA27_0 >= '#' && LA27_0 <= '&')||(LA27_0 >= '+' && LA27_0 <= '9')||(LA27_0 >= ';' && LA27_0 <= '>')||(LA27_0 >= '@' && LA27_0 <= 'Z')||LA27_0=='\\'||(LA27_0 >= '_' && LA27_0 <= 'z')||LA27_0=='|'||(LA27_0 >= '\u007F' && LA27_0 <= '\u2FFF')||(LA27_0 >= '\u3001' && LA27_0 <= '\uFFFF')) ) {
+                            alt27=1;
+                        }
+
+
+                        switch (alt27) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:461:43: TERM_CHAR
+                    	    {
+                    	    mTERM_CHAR(); 
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    break loop27;
+                        }
+                    } while (true);
+
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:462:4: TERM_START_CHAR ( ( TERM_CHAR )* ( QMARK | STAR ) )+ ( TERM_CHAR )*
+                    {
+                    mTERM_START_CHAR(); 
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:462:20: ( ( TERM_CHAR )* ( QMARK | STAR ) )+
+                    int cnt30=0;
+                    loop30:
+                    do {
+                        int alt30=2;
+                        alt30 = dfa30.predict(input);
+                        switch (alt30) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:462:21: ( TERM_CHAR )* ( QMARK | STAR )
+                    	    {
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:462:21: ( TERM_CHAR )*
+                    	    loop28:
+                    	    do {
+                    	        int alt28=2;
+                    	        int LA28_0 = input.LA(1);
+
+                    	        if ( ((LA28_0 >= '\u0000' && LA28_0 <= '\b')||(LA28_0 >= '\u000B' && LA28_0 <= '\f')||(LA28_0 >= '\u000E' && LA28_0 <= '\u001F')||(LA28_0 >= '#' && LA28_0 <= '&')||(LA28_0 >= '+' && LA28_0 <= '9')||(LA28_0 >= ';' && LA28_0 <= '>')||(LA28_0 >= '@' && LA28_0 <= 'Z')||LA28_0=='\\'||(LA28_0 >= '_' && LA28_0 <= 'z')||LA28_0=='|'||(LA28_0 >= '\u007F' && LA28_0 <= '\u2FFF')||(LA28_0 >= '\u3001' && LA28_0 <= '\uFFFF')) ) {
+                    	            alt28=1;
+                    	        }
+
+
+                    	        switch (alt28) {
+                    	    	case 1 :
+                    	    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:462:21: TERM_CHAR
+                    	    	    {
+                    	    	    mTERM_CHAR(); 
+
+
+                    	    	    }
+                    	    	    break;
+
+                    	    	default :
+                    	    	    break loop28;
+                    	        }
+                    	    } while (true);
+
+
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:462:32: ( QMARK | STAR )
+                    	    int alt29=2;
+                    	    int LA29_0 = input.LA(1);
+
+                    	    if ( (LA29_0=='?') ) {
+                    	        alt29=1;
+                    	    }
+                    	    else if ( (LA29_0=='*') ) {
+                    	        alt29=2;
+                    	    }
+                    	    else {
+                    	        NoViableAltException nvae =
+                    	            new NoViableAltException("", 29, 0, input);
+
+                    	        throw nvae;
+
+                    	    }
+                    	    switch (alt29) {
+                    	        case 1 :
+                    	            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:462:33: QMARK
+                    	            {
+                    	            mQMARK(); 
+
+
+                    	            }
+                    	            break;
+                    	        case 2 :
+                    	            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:462:39: STAR
+                    	            {
+                    	            mSTAR(); 
+
+
+                    	            }
+                    	            break;
+
+                    	    }
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt30 >= 1 ) break loop30;
+                                EarlyExitException eee =
+                                    new EarlyExitException(30, input);
+                                throw eee;
+                        }
+                        cnt30++;
+                    } while (true);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:462:47: ( TERM_CHAR )*
+                    loop31:
+                    do {
+                        int alt31=2;
+                        int LA31_0 = input.LA(1);
+
+                        if ( ((LA31_0 >= '\u0000' && LA31_0 <= '\b')||(LA31_0 >= '\u000B' && LA31_0 <= '\f')||(LA31_0 >= '\u000E' && LA31_0 <= '\u001F')||(LA31_0 >= '#' && LA31_0 <= '&')||(LA31_0 >= '+' && LA31_0 <= '9')||(LA31_0 >= ';' && LA31_0 <= '>')||(LA31_0 >= '@' && LA31_0 <= 'Z')||LA31_0=='\\'||(LA31_0 >= '_' && LA31_0 <= 'z')||LA31_0=='|'||(LA31_0 >= '\u007F' && LA31_0 <= '\u2FFF')||(LA31_0 >= '\u3001' && LA31_0 <= '\uFFFF')) ) {
+                            alt31=1;
+                        }
+
+
+                        switch (alt31) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:462:48: TERM_CHAR
+                    	    {
+                    	    mTERM_CHAR(); 
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    break loop31;
+                        }
+                    } while (true);
+
+
+                    }
+                    break;
+                case 3 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:463:4: ( STAR | QMARK ) ( TERM_CHAR )+
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:463:4: ( STAR | QMARK )
+                    int alt32=2;
+                    int LA32_0 = input.LA(1);
+
+                    if ( (LA32_0=='*') ) {
+                        alt32=1;
+                    }
+                    else if ( (LA32_0=='?') ) {
+                        alt32=2;
+                    }
+                    else {
+                        NoViableAltException nvae =
+                            new NoViableAltException("", 32, 0, input);
+
+                        throw nvae;
+
+                    }
+                    switch (alt32) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:463:5: STAR
+                            {
+                            mSTAR(); 
+
+
+                            }
+                            break;
+                        case 2 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:463:10: QMARK
+                            {
+                            mQMARK(); 
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:463:17: ( TERM_CHAR )+
+                    int cnt33=0;
+                    loop33:
+                    do {
+                        int alt33=2;
+                        int LA33_0 = input.LA(1);
+
+                        if ( ((LA33_0 >= '\u0000' && LA33_0 <= '\b')||(LA33_0 >= '\u000B' && LA33_0 <= '\f')||(LA33_0 >= '\u000E' && LA33_0 <= '\u001F')||(LA33_0 >= '#' && LA33_0 <= '&')||(LA33_0 >= '+' && LA33_0 <= '9')||(LA33_0 >= ';' && LA33_0 <= '>')||(LA33_0 >= '@' && LA33_0 <= 'Z')||LA33_0=='\\'||(LA33_0 >= '_' && LA33_0 <= 'z')||LA33_0=='|'||(LA33_0 >= '\u007F' && LA33_0 <= '\u2FFF')||(LA33_0 >= '\u3001' && LA33_0 <= '\uFFFF')) ) {
+                            alt33=1;
+                        }
+
+
+                        switch (alt33) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:463:17: TERM_CHAR
+                    	    {
+                    	    mTERM_CHAR(); 
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt33 >= 1 ) break loop33;
+                                EarlyExitException eee =
+                                    new EarlyExitException(33, input);
+                                throw eee;
+                        }
+                        cnt33++;
+                    } while (true);
+
+
+                    }
+                    break;
+
+            }
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "TERM_TRUNCATED"
+
+    // $ANTLR start "PHRASE"
+    public final void mPHRASE() throws RecognitionException {
+        try {
+            int _type = PHRASE;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:468:2: ( DQUOTE ( ESC_CHAR |~ ( '\\\"' | '\\\\' | '?' | '*' ) )+ DQUOTE )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:469:2: DQUOTE ( ESC_CHAR |~ ( '\\\"' | '\\\\' | '?' | '*' ) )+ DQUOTE
+            {
+            mDQUOTE(); 
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:469:9: ( ESC_CHAR |~ ( '\\\"' | '\\\\' | '?' | '*' ) )+
+            int cnt35=0;
+            loop35:
+            do {
+                int alt35=3;
+                int LA35_0 = input.LA(1);
+
+                if ( (LA35_0=='\\') ) {
+                    alt35=1;
+                }
+                else if ( ((LA35_0 >= '\u0000' && LA35_0 <= '!')||(LA35_0 >= '#' && LA35_0 <= ')')||(LA35_0 >= '+' && LA35_0 <= '>')||(LA35_0 >= '@' && LA35_0 <= '[')||(LA35_0 >= ']' && LA35_0 <= '\uFFFF')) ) {
+                    alt35=2;
+                }
+
+
+                switch (alt35) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:469:10: ESC_CHAR
+            	    {
+            	    mESC_CHAR(); 
+
+
+            	    }
+            	    break;
+            	case 2 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:469:19: ~ ( '\\\"' | '\\\\' | '?' | '*' )
+            	    {
+            	    if ( (input.LA(1) >= '\u0000' && input.LA(1) <= '!')||(input.LA(1) >= '#' && input.LA(1) <= ')')||(input.LA(1) >= '+' && input.LA(1) <= '>')||(input.LA(1) >= '@' && input.LA(1) <= '[')||(input.LA(1) >= ']' && input.LA(1) <= '\uFFFF') ) {
+            	        input.consume();
+            	    }
+            	    else {
+            	        MismatchedSetException mse = new MismatchedSetException(null,input);
+            	        recover(mse);
+            	        throw mse;
+            	    }
+
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt35 >= 1 ) break loop35;
+                        EarlyExitException eee =
+                            new EarlyExitException(35, input);
+                        throw eee;
+                }
+                cnt35++;
+            } while (true);
+
+
+            mDQUOTE(); 
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "PHRASE"
+
+    // $ANTLR start "PHRASE_ANYTHING"
+    public final void mPHRASE_ANYTHING() throws RecognitionException {
+        try {
+            int _type = PHRASE_ANYTHING;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:472:17: ( DQUOTE ( ESC_CHAR |~ ( '\\\"' | '\\\\' ) )+ DQUOTE )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:473:2: DQUOTE ( ESC_CHAR |~ ( '\\\"' | '\\\\' ) )+ DQUOTE
+            {
+            mDQUOTE(); 
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:473:9: ( ESC_CHAR |~ ( '\\\"' | '\\\\' ) )+
+            int cnt36=0;
+            loop36:
+            do {
+                int alt36=3;
+                int LA36_0 = input.LA(1);
+
+                if ( (LA36_0=='\\') ) {
+                    alt36=1;
+                }
+                else if ( ((LA36_0 >= '\u0000' && LA36_0 <= '!')||(LA36_0 >= '#' && LA36_0 <= '[')||(LA36_0 >= ']' && LA36_0 <= '\uFFFF')) ) {
+                    alt36=2;
+                }
+
+
+                switch (alt36) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:473:10: ESC_CHAR
+            	    {
+            	    mESC_CHAR(); 
+
+
+            	    }
+            	    break;
+            	case 2 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:473:19: ~ ( '\\\"' | '\\\\' )
+            	    {
+            	    if ( (input.LA(1) >= '\u0000' && input.LA(1) <= '!')||(input.LA(1) >= '#' && input.LA(1) <= '[')||(input.LA(1) >= ']' && input.LA(1) <= '\uFFFF') ) {
+            	        input.consume();
+            	    }
+            	    else {
+            	        MismatchedSetException mse = new MismatchedSetException(null,input);
+            	        recover(mse);
+            	        throw mse;
+            	    }
+
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt36 >= 1 ) break loop36;
+                        EarlyExitException eee =
+                            new EarlyExitException(36, input);
+                        throw eee;
+                }
+                cnt36++;
+            } while (true);
+
+
+            mDQUOTE(); 
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "PHRASE_ANYTHING"
+
+    public void mTokens() throws RecognitionException {
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:8: ( LPAREN | RPAREN | LBRACK | RBRACK | COLON | PLUS | MINUS | STAR | QMARK | LCURLY | RCURLY | CARAT | TILDE | DQUOTE | SQUOTE | TO | AND | OR | NOT | WS | NUMBER | DATE_TOKEN | TERM_NORMAL | TERM_TRUNCATED | PHRASE | PHRASE_ANYTHING )
+        int alt37=26;
+        alt37 = dfa37.predict(input);
+        switch (alt37) {
+            case 1 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:10: LPAREN
+                {
+                mLPAREN(); 
+
+
+                }
+                break;
+            case 2 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:17: RPAREN
+                {
+                mRPAREN(); 
+
+
+                }
+                break;
+            case 3 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:24: LBRACK
+                {
+                mLBRACK(); 
+
+
+                }
+                break;
+            case 4 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:31: RBRACK
+                {
+                mRBRACK(); 
+
+
+                }
+                break;
+            case 5 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:38: COLON
+                {
+                mCOLON(); 
+
+
+                }
+                break;
+            case 6 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:44: PLUS
+                {
+                mPLUS(); 
+
+
+                }
+                break;
+            case 7 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:49: MINUS
+                {
+                mMINUS(); 
+
+
+                }
+                break;
+            case 8 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:55: STAR
+                {
+                mSTAR(); 
+
+
+                }
+                break;
+            case 9 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:60: QMARK
+                {
+                mQMARK(); 
+
+
+                }
+                break;
+            case 10 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:66: LCURLY
+                {
+                mLCURLY(); 
+
+
+                }
+                break;
+            case 11 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:73: RCURLY
+                {
+                mRCURLY(); 
+
+
+                }
+                break;
+            case 12 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:80: CARAT
+                {
+                mCARAT(); 
+
+
+                }
+                break;
+            case 13 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:86: TILDE
+                {
+                mTILDE(); 
+
+
+                }
+                break;
+            case 14 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:92: DQUOTE
+                {
+                mDQUOTE(); 
+
+
+                }
+                break;
+            case 15 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:99: SQUOTE
+                {
+                mSQUOTE(); 
+
+
+                }
+                break;
+            case 16 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:106: TO
+                {
+                mTO(); 
+
+
+                }
+                break;
+            case 17 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:109: AND
+                {
+                mAND(); 
+
+
+                }
+                break;
+            case 18 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:113: OR
+                {
+                mOR(); 
+
+
+                }
+                break;
+            case 19 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:116: NOT
+                {
+                mNOT(); 
+
+
+                }
+                break;
+            case 20 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:120: WS
+                {
+                mWS(); 
+
+
+                }
+                break;
+            case 21 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:123: NUMBER
+                {
+                mNUMBER(); 
+
+
+                }
+                break;
+            case 22 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:130: DATE_TOKEN
+                {
+                mDATE_TOKEN(); 
+
+
+                }
+                break;
+            case 23 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:141: TERM_NORMAL
+                {
+                mTERM_NORMAL(); 
+
+
+                }
+                break;
+            case 24 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:153: TERM_TRUNCATED
+                {
+                mTERM_TRUNCATED(); 
+
+
+                }
+                break;
+            case 25 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:168: PHRASE
+                {
+                mPHRASE(); 
+
+
+                }
+                break;
+            case 26 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/StandardLuceneGrammar.g:1:175: PHRASE_ANYTHING
+                {
+                mPHRASE_ANYTHING(); 
+
+
+                }
+                break;
+
+        }
+
+    }
+
+
+    protected DFA34 dfa34 = new DFA34(this);
+    protected DFA26 dfa26 = new DFA26(this);
+    protected DFA30 dfa30 = new DFA30(this);
+    protected DFA37 dfa37 = new DFA37(this);
+    static final String DFA34_eotS =
+        "\4\uffff\1\10\1\uffff\2\10\2\uffff\1\10";
+    static final String DFA34_eofS =
+        "\13\uffff";
+    static final String DFA34_minS =
+        "\3\0\1\uffff\4\0\2\uffff\1\0";
+    static final String DFA34_maxS =
+        "\3\uffff\1\uffff\4\uffff\2\uffff\1\uffff";
+    static final String DFA34_acceptS =
+        "\3\uffff\1\2\4\uffff\1\3\1\1\1\uffff";
+    static final String DFA34_specialS =
+        "\1\1\1\0\1\5\1\uffff\1\2\1\6\1\7\1\4\2\uffff\1\3}>";
+    static final String[] DFA34_transitionS = {
+            "\11\3\2\uffff\2\3\1\uffff\22\3\3\uffff\4\3\3\uffff\1\1\1\uffff"+
+            "\1\3\1\uffff\14\3\1\uffff\4\3\1\2\33\3\1\uffff\1\3\2\uffff\34"+
+            "\3\1\uffff\1\3\2\uffff\u2f81\3\1\uffff\ucfff\3",
+            "\11\4\2\uffff\2\4\1\uffff\22\4\3\uffff\4\4\4\uffff\1\7\1\4"+
+            "\1\6\14\4\1\uffff\4\4\1\uffff\33\4\1\uffff\1\5\2\uffff\34\4"+
+            "\1\uffff\1\4\2\uffff\u2f81\4\1\uffff\ucfff\4",
+            "\11\4\2\uffff\2\4\1\uffff\22\4\3\uffff\4\4\4\uffff\1\7\1\4"+
+            "\1\6\14\4\1\uffff\4\4\1\2\33\4\1\uffff\1\5\2\uffff\34\4\1\uffff"+
+            "\1\4\2\uffff\u2f81\4\1\uffff\ucfff\4",
+            "",
+            "\11\4\2\uffff\2\4\1\uffff\22\4\3\uffff\4\4\3\uffff\1\11\1\7"+
+            "\1\4\1\6\14\4\1\uffff\4\4\1\11\33\4\1\uffff\1\5\2\uffff\34\4"+
+            "\1\uffff\1\4\2\uffff\u2f81\4\1\uffff\ucfff\4",
+            "\0\12",
+            "\11\4\2\uffff\2\4\1\uffff\22\4\3\uffff\4\4\3\uffff\1\11\1\7"+
+            "\1\4\1\6\14\4\1\uffff\4\4\1\11\33\4\1\uffff\1\5\2\uffff\34\4"+
+            "\1\uffff\1\4\2\uffff\u2f81\4\1\uffff\ucfff\4",
+            "\11\4\2\uffff\2\4\1\uffff\22\4\3\uffff\4\4\3\uffff\1\11\1\7"+
+            "\1\4\1\6\14\4\1\uffff\4\4\1\11\33\4\1\uffff\1\5\2\uffff\34\4"+
+            "\1\uffff\1\4\2\uffff\u2f81\4\1\uffff\ucfff\4",
+            "",
+            "",
+            "\11\4\2\uffff\2\4\1\uffff\22\4\3\uffff\4\4\3\uffff\1\11\1\7"+
+            "\1\4\1\6\14\4\1\uffff\4\4\1\11\33\4\1\uffff\1\5\2\uffff\34\4"+
+            "\1\uffff\1\4\2\uffff\u2f81\4\1\uffff\ucfff\4"
+    };
+
+    static final short[] DFA34_eot = DFA.unpackEncodedString(DFA34_eotS);
+    static final short[] DFA34_eof = DFA.unpackEncodedString(DFA34_eofS);
+    static final char[] DFA34_min = DFA.unpackEncodedStringToUnsignedChars(DFA34_minS);
+    static final char[] DFA34_max = DFA.unpackEncodedStringToUnsignedChars(DFA34_maxS);
+    static final short[] DFA34_accept = DFA.unpackEncodedString(DFA34_acceptS);
+    static final short[] DFA34_special = DFA.unpackEncodedString(DFA34_specialS);
+    static final short[][] DFA34_transition;
+
+    static {
+        int numStates = DFA34_transitionS.length;
+        DFA34_transition = new short[numStates][];
+        for (int i=0; i<numStates; i++) {
+            DFA34_transition[i] = DFA.unpackEncodedString(DFA34_transitionS[i]);
+        }
+    }
+
+    class DFA34 extends DFA {
+
+        public DFA34(BaseRecognizer recognizer) {
+            this.recognizer = recognizer;
+            this.decisionNumber = 34;
+            this.eot = DFA34_eot;
+            this.eof = DFA34_eof;
+            this.min = DFA34_min;
+            this.max = DFA34_max;
+            this.accept = DFA34_accept;
+            this.special = DFA34_special;
+            this.transition = DFA34_transition;
+        }
+        public String getDescription() {
+            return "460:1: TERM_TRUNCATED : ( ( STAR | QMARK ) ( ( TERM_CHAR )+ ( QMARK | STAR ) )+ ( TERM_CHAR )* | TERM_START_CHAR ( ( TERM_CHAR )* ( QMARK | STAR ) )+ ( TERM_CHAR )* | ( STAR | QMARK ) ( TERM_CHAR )+ );";
+        }
+        public int specialStateTransition(int s, IntStream _input) throws NoViableAltException {
+            IntStream input = _input;
+        	int _s = s;
+            switch ( s ) {
+                    case 0 : 
+                        int LA34_1 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA34_1 >= '\u0000' && LA34_1 <= '\b')||(LA34_1 >= '\u000B' && LA34_1 <= '\f')||(LA34_1 >= '\u000E' && LA34_1 <= '\u001F')||(LA34_1 >= '#' && LA34_1 <= '&')||LA34_1==','||(LA34_1 >= '.' && LA34_1 <= '9')||(LA34_1 >= ';' && LA34_1 <= '>')||(LA34_1 >= '@' && LA34_1 <= 'Z')||(LA34_1 >= '_' && LA34_1 <= 'z')||LA34_1=='|'||(LA34_1 >= '\u007F' && LA34_1 <= '\u2FFF')||(LA34_1 >= '\u3001' && LA34_1 <= '\uFFFF')) ) {s = 4;}
+
+                        else if ( (LA34_1=='\\') ) {s = 5;}
+
+                        else if ( (LA34_1=='-') ) {s = 6;}
+
+                        else if ( (LA34_1=='+') ) {s = 7;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 1 : 
+                        int LA34_0 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA34_0=='*') ) {s = 1;}
+
+                        else if ( (LA34_0=='?') ) {s = 2;}
+
+                        else if ( ((LA34_0 >= '\u0000' && LA34_0 <= '\b')||(LA34_0 >= '\u000B' && LA34_0 <= '\f')||(LA34_0 >= '\u000E' && LA34_0 <= '\u001F')||(LA34_0 >= '#' && LA34_0 <= '&')||LA34_0==','||(LA34_0 >= '.' && LA34_0 <= '9')||(LA34_0 >= ';' && LA34_0 <= '>')||(LA34_0 >= '@' && LA34_0 <= 'Z')||LA34_0=='\\'||(LA34_0 >= '_' && LA34_0 <= 'z')||LA34_0=='|'||(LA34_0 >= '\u007F' && LA34_0 <= '\u2FFF')||(LA34_0 >= '\u3001' && LA34_0 <= '\uFFFF')) ) {s = 3;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 2 : 
+                        int LA34_4 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA34_4=='*'||LA34_4=='?') ) {s = 9;}
+
+                        else if ( ((LA34_4 >= '\u0000' && LA34_4 <= '\b')||(LA34_4 >= '\u000B' && LA34_4 <= '\f')||(LA34_4 >= '\u000E' && LA34_4 <= '\u001F')||(LA34_4 >= '#' && LA34_4 <= '&')||LA34_4==','||(LA34_4 >= '.' && LA34_4 <= '9')||(LA34_4 >= ';' && LA34_4 <= '>')||(LA34_4 >= '@' && LA34_4 <= 'Z')||(LA34_4 >= '_' && LA34_4 <= 'z')||LA34_4=='|'||(LA34_4 >= '\u007F' && LA34_4 <= '\u2FFF')||(LA34_4 >= '\u3001' && LA34_4 <= '\uFFFF')) ) {s = 4;}
+
+                        else if ( (LA34_4=='\\') ) {s = 5;}
+
+                        else if ( (LA34_4=='-') ) {s = 6;}
+
+                        else if ( (LA34_4=='+') ) {s = 7;}
+
+                        else s = 8;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 3 : 
+                        int LA34_10 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA34_10=='*'||LA34_10=='?') ) {s = 9;}
+
+                        else if ( ((LA34_10 >= '\u0000' && LA34_10 <= '\b')||(LA34_10 >= '\u000B' && LA34_10 <= '\f')||(LA34_10 >= '\u000E' && LA34_10 <= '\u001F')||(LA34_10 >= '#' && LA34_10 <= '&')||LA34_10==','||(LA34_10 >= '.' && LA34_10 <= '9')||(LA34_10 >= ';' && LA34_10 <= '>')||(LA34_10 >= '@' && LA34_10 <= 'Z')||(LA34_10 >= '_' && LA34_10 <= 'z')||LA34_10=='|'||(LA34_10 >= '\u007F' && LA34_10 <= '\u2FFF')||(LA34_10 >= '\u3001' && LA34_10 <= '\uFFFF')) ) {s = 4;}
+
+                        else if ( (LA34_10=='\\') ) {s = 5;}
+
+                        else if ( (LA34_10=='-') ) {s = 6;}
+
+                        else if ( (LA34_10=='+') ) {s = 7;}
+
+                        else s = 8;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 4 : 
+                        int LA34_7 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA34_7=='*'||LA34_7=='?') ) {s = 9;}
+
+                        else if ( ((LA34_7 >= '\u0000' && LA34_7 <= '\b')||(LA34_7 >= '\u000B' && LA34_7 <= '\f')||(LA34_7 >= '\u000E' && LA34_7 <= '\u001F')||(LA34_7 >= '#' && LA34_7 <= '&')||LA34_7==','||(LA34_7 >= '.' && LA34_7 <= '9')||(LA34_7 >= ';' && LA34_7 <= '>')||(LA34_7 >= '@' && LA34_7 <= 'Z')||(LA34_7 >= '_' && LA34_7 <= 'z')||LA34_7=='|'||(LA34_7 >= '\u007F' && LA34_7 <= '\u2FFF')||(LA34_7 >= '\u3001' && LA34_7 <= '\uFFFF')) ) {s = 4;}
+
+                        else if ( (LA34_7=='\\') ) {s = 5;}
+
+                        else if ( (LA34_7=='-') ) {s = 6;}
+
+                        else if ( (LA34_7=='+') ) {s = 7;}
+
+                        else s = 8;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 5 : 
+                        int LA34_2 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA34_2 >= '\u0000' && LA34_2 <= '\b')||(LA34_2 >= '\u000B' && LA34_2 <= '\f')||(LA34_2 >= '\u000E' && LA34_2 <= '\u001F')||(LA34_2 >= '#' && LA34_2 <= '&')||LA34_2==','||(LA34_2 >= '.' && LA34_2 <= '9')||(LA34_2 >= ';' && LA34_2 <= '>')||(LA34_2 >= '@' && LA34_2 <= 'Z')||(LA34_2 >= '_' && LA34_2 <= 'z')||LA34_2=='|'||(LA34_2 >= '\u007F' && LA34_2 <= '\u2FFF')||(LA34_2 >= '\u3001' && LA34_2 <= '\uFFFF')) ) {s = 4;}
+
+                        else if ( (LA34_2=='\\') ) {s = 5;}
+
+                        else if ( (LA34_2=='-') ) {s = 6;}
+
+                        else if ( (LA34_2=='+') ) {s = 7;}
+
+                        else if ( (LA34_2=='?') ) {s = 2;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 6 : 
+                        int LA34_5 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA34_5 >= '\u0000' && LA34_5 <= '\uFFFF')) ) {s = 10;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 7 : 
+                        int LA34_6 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA34_6=='*'||LA34_6=='?') ) {s = 9;}
+
+                        else if ( ((LA34_6 >= '\u0000' && LA34_6 <= '\b')||(LA34_6 >= '\u000B' && LA34_6 <= '\f')||(LA34_6 >= '\u000E' && LA34_6 <= '\u001F')||(LA34_6 >= '#' && LA34_6 <= '&')||LA34_6==','||(LA34_6 >= '.' && LA34_6 <= '9')||(LA34_6 >= ';' && LA34_6 <= '>')||(LA34_6 >= '@' && LA34_6 <= 'Z')||(LA34_6 >= '_' && LA34_6 <= 'z')||LA34_6=='|'||(LA34_6 >= '\u007F' && LA34_6 <= '\u2FFF')||(LA34_6 >= '\u3001' && LA34_6 <= '\uFFFF')) ) {s = 4;}
+
+                        else if ( (LA34_6=='\\') ) {s = 5;}
+
+                        else if ( (LA34_6=='-') ) {s = 6;}
+
+                        else if ( (LA34_6=='+') ) {s = 7;}
+
+                        else s = 8;
+
+                        if ( s>=0 ) return s;
+                        break;
+            }
+            NoViableAltException nvae =
+                new NoViableAltException(getDescription(), 34, _s, input);
+            error(nvae);
+            throw nvae;
+        }
+
+    }
+    static final String DFA26_eotS =
+        "\2\5\1\uffff\2\5\2\uffff\1\5";
+    static final String DFA26_eofS =
+        "\10\uffff";
+    static final String DFA26_minS =
+        "\5\0\2\uffff\1\0";
+    static final String DFA26_maxS =
+        "\5\uffff\2\uffff\1\uffff";
+    static final String DFA26_acceptS =
+        "\5\uffff\1\2\1\1\1\uffff";
+    static final String DFA26_specialS =
+        "\1\2\1\3\1\0\1\5\1\4\2\uffff\1\1}>";
+    static final String[] DFA26_transitionS = {
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\4\uffff\1\4\1\1\1"+
+            "\3\14\1\1\uffff\4\1\1\uffff\33\1\1\uffff\1\2\2\uffff\34\1\1"+
+            "\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "\0\7",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "",
+            "",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1"
+    };
+
+    static final short[] DFA26_eot = DFA.unpackEncodedString(DFA26_eotS);
+    static final short[] DFA26_eof = DFA.unpackEncodedString(DFA26_eofS);
+    static final char[] DFA26_min = DFA.unpackEncodedStringToUnsignedChars(DFA26_minS);
+    static final char[] DFA26_max = DFA.unpackEncodedStringToUnsignedChars(DFA26_maxS);
+    static final short[] DFA26_accept = DFA.unpackEncodedString(DFA26_acceptS);
+    static final short[] DFA26_special = DFA.unpackEncodedString(DFA26_specialS);
+    static final short[][] DFA26_transition;
+
+    static {
+        int numStates = DFA26_transitionS.length;
+        DFA26_transition = new short[numStates][];
+        for (int i=0; i<numStates; i++) {
+            DFA26_transition[i] = DFA.unpackEncodedString(DFA26_transitionS[i]);
+        }
+    }
+
+    class DFA26 extends DFA {
+
+        public DFA26(BaseRecognizer recognizer) {
+            this.recognizer = recognizer;
+            this.decisionNumber = 26;
+            this.eot = DFA26_eot;
+            this.eof = DFA26_eof;
+            this.min = DFA26_min;
+            this.max = DFA26_max;
+            this.accept = DFA26_accept;
+            this.special = DFA26_special;
+            this.transition = DFA26_transition;
+        }
+        public String getDescription() {
+            return "()+ loopback of 461:15: ( ( TERM_CHAR )+ ( QMARK | STAR ) )+";
+        }
+        public int specialStateTransition(int s, IntStream _input) throws NoViableAltException {
+            IntStream input = _input;
+        	int _s = s;
+            switch ( s ) {
+                    case 0 : 
+                        int LA26_2 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA26_2 >= '\u0000' && LA26_2 <= '\uFFFF')) ) {s = 7;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 1 : 
+                        int LA26_7 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA26_7 >= '\u0000' && LA26_7 <= '\b')||(LA26_7 >= '\u000B' && LA26_7 <= '\f')||(LA26_7 >= '\u000E' && LA26_7 <= '\u001F')||(LA26_7 >= '#' && LA26_7 <= '&')||LA26_7==','||(LA26_7 >= '.' && LA26_7 <= '9')||(LA26_7 >= ';' && LA26_7 <= '>')||(LA26_7 >= '@' && LA26_7 <= 'Z')||(LA26_7 >= '_' && LA26_7 <= 'z')||LA26_7=='|'||(LA26_7 >= '\u007F' && LA26_7 <= '\u2FFF')||(LA26_7 >= '\u3001' && LA26_7 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA26_7=='\\') ) {s = 2;}
+
+                        else if ( (LA26_7=='-') ) {s = 3;}
+
+                        else if ( (LA26_7=='+') ) {s = 4;}
+
+                        else if ( (LA26_7=='*'||LA26_7=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 2 : 
+                        int LA26_0 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA26_0 >= '\u0000' && LA26_0 <= '\b')||(LA26_0 >= '\u000B' && LA26_0 <= '\f')||(LA26_0 >= '\u000E' && LA26_0 <= '\u001F')||(LA26_0 >= '#' && LA26_0 <= '&')||LA26_0==','||(LA26_0 >= '.' && LA26_0 <= '9')||(LA26_0 >= ';' && LA26_0 <= '>')||(LA26_0 >= '@' && LA26_0 <= 'Z')||(LA26_0 >= '_' && LA26_0 <= 'z')||LA26_0=='|'||(LA26_0 >= '\u007F' && LA26_0 <= '\u2FFF')||(LA26_0 >= '\u3001' && LA26_0 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA26_0=='\\') ) {s = 2;}
+
+                        else if ( (LA26_0=='-') ) {s = 3;}
+
+                        else if ( (LA26_0=='+') ) {s = 4;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 3 : 
+                        int LA26_1 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA26_1 >= '\u0000' && LA26_1 <= '\b')||(LA26_1 >= '\u000B' && LA26_1 <= '\f')||(LA26_1 >= '\u000E' && LA26_1 <= '\u001F')||(LA26_1 >= '#' && LA26_1 <= '&')||LA26_1==','||(LA26_1 >= '.' && LA26_1 <= '9')||(LA26_1 >= ';' && LA26_1 <= '>')||(LA26_1 >= '@' && LA26_1 <= 'Z')||(LA26_1 >= '_' && LA26_1 <= 'z')||LA26_1=='|'||(LA26_1 >= '\u007F' && LA26_1 <= '\u2FFF')||(LA26_1 >= '\u3001' && LA26_1 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA26_1=='\\') ) {s = 2;}
+
+                        else if ( (LA26_1=='-') ) {s = 3;}
+
+                        else if ( (LA26_1=='+') ) {s = 4;}
+
+                        else if ( (LA26_1=='*'||LA26_1=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 4 : 
+                        int LA26_4 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA26_4 >= '\u0000' && LA26_4 <= '\b')||(LA26_4 >= '\u000B' && LA26_4 <= '\f')||(LA26_4 >= '\u000E' && LA26_4 <= '\u001F')||(LA26_4 >= '#' && LA26_4 <= '&')||LA26_4==','||(LA26_4 >= '.' && LA26_4 <= '9')||(LA26_4 >= ';' && LA26_4 <= '>')||(LA26_4 >= '@' && LA26_4 <= 'Z')||(LA26_4 >= '_' && LA26_4 <= 'z')||LA26_4=='|'||(LA26_4 >= '\u007F' && LA26_4 <= '\u2FFF')||(LA26_4 >= '\u3001' && LA26_4 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA26_4=='\\') ) {s = 2;}
+
+                        else if ( (LA26_4=='-') ) {s = 3;}
+
+                        else if ( (LA26_4=='+') ) {s = 4;}
+
+                        else if ( (LA26_4=='*'||LA26_4=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 5 : 
+                        int LA26_3 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA26_3 >= '\u0000' && LA26_3 <= '\b')||(LA26_3 >= '\u000B' && LA26_3 <= '\f')||(LA26_3 >= '\u000E' && LA26_3 <= '\u001F')||(LA26_3 >= '#' && LA26_3 <= '&')||LA26_3==','||(LA26_3 >= '.' && LA26_3 <= '9')||(LA26_3 >= ';' && LA26_3 <= '>')||(LA26_3 >= '@' && LA26_3 <= 'Z')||(LA26_3 >= '_' && LA26_3 <= 'z')||LA26_3=='|'||(LA26_3 >= '\u007F' && LA26_3 <= '\u2FFF')||(LA26_3 >= '\u3001' && LA26_3 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA26_3=='\\') ) {s = 2;}
+
+                        else if ( (LA26_3=='-') ) {s = 3;}
+
+                        else if ( (LA26_3=='+') ) {s = 4;}
+
+                        else if ( (LA26_3=='*'||LA26_3=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+            }
+            NoViableAltException nvae =
+                new NoViableAltException(getDescription(), 26, _s, input);
+            error(nvae);
+            throw nvae;
+        }
+
+    }
+    static final String DFA30_eotS =
+        "\2\5\1\uffff\2\5\2\uffff\1\5";
+    static final String DFA30_eofS =
+        "\10\uffff";
+    static final String DFA30_minS =
+        "\5\0\2\uffff\1\0";
+    static final String DFA30_maxS =
+        "\5\uffff\2\uffff\1\uffff";
+    static final String DFA30_acceptS =
+        "\5\uffff\1\2\1\1\1\uffff";
+    static final String DFA30_specialS =
+        "\1\0\1\4\1\1\1\2\1\3\2\uffff\1\5}>";
+    static final String[] DFA30_transitionS = {
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4\1"+
+            "\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1\1"+
+            "\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "\0\7",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "",
+            "",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1"
+    };
+
+    static final short[] DFA30_eot = DFA.unpackEncodedString(DFA30_eotS);
+    static final short[] DFA30_eof = DFA.unpackEncodedString(DFA30_eofS);
+    static final char[] DFA30_min = DFA.unpackEncodedStringToUnsignedChars(DFA30_minS);
+    static final char[] DFA30_max = DFA.unpackEncodedStringToUnsignedChars(DFA30_maxS);
+    static final short[] DFA30_accept = DFA.unpackEncodedString(DFA30_acceptS);
+    static final short[] DFA30_special = DFA.unpackEncodedString(DFA30_specialS);
+    static final short[][] DFA30_transition;
+
+    static {
+        int numStates = DFA30_transitionS.length;
+        DFA30_transition = new short[numStates][];
+        for (int i=0; i<numStates; i++) {
+            DFA30_transition[i] = DFA.unpackEncodedString(DFA30_transitionS[i]);
+        }
+    }
+
+    class DFA30 extends DFA {
+
+        public DFA30(BaseRecognizer recognizer) {
+            this.recognizer = recognizer;
+            this.decisionNumber = 30;
+            this.eot = DFA30_eot;
+            this.eof = DFA30_eof;
+            this.min = DFA30_min;
+            this.max = DFA30_max;
+            this.accept = DFA30_accept;
+            this.special = DFA30_special;
+            this.transition = DFA30_transition;
+        }
+        public String getDescription() {
+            return "()+ loopback of 462:20: ( ( TERM_CHAR )* ( QMARK | STAR ) )+";
+        }
+        public int specialStateTransition(int s, IntStream _input) throws NoViableAltException {
+            IntStream input = _input;
+        	int _s = s;
+            switch ( s ) {
+                    case 0 : 
+                        int LA30_0 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA30_0 >= '\u0000' && LA30_0 <= '\b')||(LA30_0 >= '\u000B' && LA30_0 <= '\f')||(LA30_0 >= '\u000E' && LA30_0 <= '\u001F')||(LA30_0 >= '#' && LA30_0 <= '&')||LA30_0==','||(LA30_0 >= '.' && LA30_0 <= '9')||(LA30_0 >= ';' && LA30_0 <= '>')||(LA30_0 >= '@' && LA30_0 <= 'Z')||(LA30_0 >= '_' && LA30_0 <= 'z')||LA30_0=='|'||(LA30_0 >= '\u007F' && LA30_0 <= '\u2FFF')||(LA30_0 >= '\u3001' && LA30_0 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA30_0=='\\') ) {s = 2;}
+
+                        else if ( (LA30_0=='-') ) {s = 3;}
+
+                        else if ( (LA30_0=='+') ) {s = 4;}
+
+                        else if ( (LA30_0=='*'||LA30_0=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 1 : 
+                        int LA30_2 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA30_2 >= '\u0000' && LA30_2 <= '\uFFFF')) ) {s = 7;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 2 : 
+                        int LA30_3 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA30_3 >= '\u0000' && LA30_3 <= '\b')||(LA30_3 >= '\u000B' && LA30_3 <= '\f')||(LA30_3 >= '\u000E' && LA30_3 <= '\u001F')||(LA30_3 >= '#' && LA30_3 <= '&')||LA30_3==','||(LA30_3 >= '.' && LA30_3 <= '9')||(LA30_3 >= ';' && LA30_3 <= '>')||(LA30_3 >= '@' && LA30_3 <= 'Z')||(LA30_3 >= '_' && LA30_3 <= 'z')||LA30_3=='|'||(LA30_3 >= '\u007F' && LA30_3 <= '\u2FFF')||(LA30_3 >= '\u3001' && LA30_3 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA30_3=='\\') ) {s = 2;}
+
+                        else if ( (LA30_3=='-') ) {s = 3;}
+
+                        else if ( (LA30_3=='+') ) {s = 4;}
+
+                        else if ( (LA30_3=='*'||LA30_3=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 3 : 
+                        int LA30_4 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA30_4 >= '\u0000' && LA30_4 <= '\b')||(LA30_4 >= '\u000B' && LA30_4 <= '\f')||(LA30_4 >= '\u000E' && LA30_4 <= '\u001F')||(LA30_4 >= '#' && LA30_4 <= '&')||LA30_4==','||(LA30_4 >= '.' && LA30_4 <= '9')||(LA30_4 >= ';' && LA30_4 <= '>')||(LA30_4 >= '@' && LA30_4 <= 'Z')||(LA30_4 >= '_' && LA30_4 <= 'z')||LA30_4=='|'||(LA30_4 >= '\u007F' && LA30_4 <= '\u2FFF')||(LA30_4 >= '\u3001' && LA30_4 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA30_4=='\\') ) {s = 2;}
+
+                        else if ( (LA30_4=='-') ) {s = 3;}
+
+                        else if ( (LA30_4=='+') ) {s = 4;}
+
+                        else if ( (LA30_4=='*'||LA30_4=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 4 : 
+                        int LA30_1 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA30_1 >= '\u0000' && LA30_1 <= '\b')||(LA30_1 >= '\u000B' && LA30_1 <= '\f')||(LA30_1 >= '\u000E' && LA30_1 <= '\u001F')||(LA30_1 >= '#' && LA30_1 <= '&')||LA30_1==','||(LA30_1 >= '.' && LA30_1 <= '9')||(LA30_1 >= ';' && LA30_1 <= '>')||(LA30_1 >= '@' && LA30_1 <= 'Z')||(LA30_1 >= '_' && LA30_1 <= 'z')||LA30_1=='|'||(LA30_1 >= '\u007F' && LA30_1 <= '\u2FFF')||(LA30_1 >= '\u3001' && LA30_1 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA30_1=='\\') ) {s = 2;}
+
+                        else if ( (LA30_1=='-') ) {s = 3;}
+
+                        else if ( (LA30_1=='+') ) {s = 4;}
+
+                        else if ( (LA30_1=='*'||LA30_1=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 5 : 
+                        int LA30_7 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA30_7 >= '\u0000' && LA30_7 <= '\b')||(LA30_7 >= '\u000B' && LA30_7 <= '\f')||(LA30_7 >= '\u000E' && LA30_7 <= '\u001F')||(LA30_7 >= '#' && LA30_7 <= '&')||LA30_7==','||(LA30_7 >= '.' && LA30_7 <= '9')||(LA30_7 >= ';' && LA30_7 <= '>')||(LA30_7 >= '@' && LA30_7 <= 'Z')||(LA30_7 >= '_' && LA30_7 <= 'z')||LA30_7=='|'||(LA30_7 >= '\u007F' && LA30_7 <= '\u2FFF')||(LA30_7 >= '\u3001' && LA30_7 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA30_7=='\\') ) {s = 2;}
+
+                        else if ( (LA30_7=='-') ) {s = 3;}
+
+                        else if ( (LA30_7=='+') ) {s = 4;}
+
+                        else if ( (LA30_7=='*'||LA30_7=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+            }
+            NoViableAltException nvae =
+                new NoViableAltException(getDescription(), 30, _s, input);
+            error(nvae);
+            throw nvae;
+        }
+
+    }
+    static final String DFA37_eotS =
+        "\10\uffff\1\32\1\34\4\uffff\1\35\1\uffff\2\42\1\50\1\42\1\53\1\42"+
+        "\1\uffff\1\57\1\42\10\uffff\1\66\1\uffff\1\42\1\uffff\3\42\1\uffff"+
+        "\1\50\1\53\1\uffff\1\53\2\42\1\uffff\1\57\3\42\3\uffff\1\42\1\50"+
+        "\1\76\2\57\1\42\2\uffff\1\57\4\42\1\57\1\42\1\107\1\uffff\1\42\1"+
+        "\107";
+    static final String DFA37_eofS =
+        "\112\uffff";
+    static final String DFA37_minS =
+        "\1\0\7\uffff\2\0\4\uffff\1\0\1\uffff\6\0\1\uffff\3\0\4\uffff\2\0"+
+        "\1\uffff\1\0\1\uffff\5\0\1\uffff\2\0\1\uffff\3\0\1\uffff\5\0\2\uffff"+
+        "\6\0\2\uffff\10\0\1\uffff\2\0";
+    static final String DFA37_maxS =
+        "\1\uffff\7\uffff\2\uffff\4\uffff\1\uffff\1\uffff\6\uffff\1\uffff"+
+        "\3\uffff\4\uffff\2\uffff\1\uffff\1\uffff\1\uffff\5\uffff\1\uffff"+
+        "\2\uffff\1\uffff\3\uffff\1\uffff\5\uffff\2\uffff\6\uffff\2\uffff"+
+        "\10\uffff\1\uffff\2\uffff";
+    static final String DFA37_acceptS =
+        "\1\uffff\1\1\1\2\1\3\1\4\1\5\1\6\1\7\2\uffff\1\12\1\13\1\14\1\15"+
+        "\1\uffff\1\17\6\uffff\1\24\3\uffff\1\10\1\30\1\11\1\16\2\uffff\1"+
+        "\32\1\uffff\1\27\5\uffff\1\21\2\uffff\1\22\3\uffff\1\25\5\uffff"+
+        "\1\31\1\20\6\uffff\1\31\1\23\10\uffff\1\26\2\uffff";
+    static final String DFA37_specialS =
+        "\1\14\7\uffff\1\45\1\6\4\uffff\1\31\1\uffff\1\27\1\25\1\4\1\33\1"+
+        "\11\1\40\1\uffff\1\12\1\5\1\35\4\uffff\1\32\1\17\1\uffff\1\20\1"+
+        "\uffff\1\34\1\36\1\41\1\42\1\10\1\uffff\1\56\1\3\1\uffff\1\30\1"+
+        "\50\1\51\1\uffff\1\7\1\23\1\2\1\55\1\13\2\uffff\1\44\1\21\1\43\1"+
+        "\54\1\52\1\53\2\uffff\1\22\1\26\1\16\1\15\1\24\1\1\1\37\1\46\1\uffff"+
+        "\1\47\1\0}>";
+    static final String[] DFA37_transitionS = {
+            "\11\30\2\26\2\30\1\26\22\30\1\26\1\7\1\16\3\30\1\22\1\17\1\1"+
+            "\1\2\1\10\1\6\1\30\1\7\2\30\12\27\1\5\4\30\1\11\1\30\1\21\14"+
+            "\30\1\25\1\23\4\30\1\20\6\30\1\3\1\31\1\4\1\14\2\30\1\21\14"+
+            "\30\1\25\1\23\13\30\1\12\1\24\1\13\1\15\u2f81\30\1\26\ucfff"+
+            "\30",
+            "",
+            "",
+            "",
+            "",
+            "",
+            "",
+            "",
+            "\11\33\2\uffff\2\33\1\uffff\22\33\3\uffff\4\33\4\uffff\17\33"+
+            "\1\uffff\4\33\1\uffff\33\33\1\uffff\1\33\2\uffff\34\33\1\uffff"+
+            "\1\33\2\uffff\u2f81\33\1\uffff\ucfff\33",
+            "\11\33\2\uffff\2\33\1\uffff\22\33\3\uffff\4\33\4\uffff\17\33"+
+            "\1\uffff\4\33\1\11\33\33\1\uffff\1\33\2\uffff\34\33\1\uffff"+
+            "\1\33\2\uffff\u2f81\33\1\uffff\ucfff\33",
+            "",
+            "",
+            "",
+            "",
+            "\42\37\1\uffff\7\37\1\40\24\37\1\40\34\37\1\36\uffa3\37",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\17\43\1\41\13\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\16\43\1\47\14\43\1\uffff"+
+            "\1\44\2\uffff\17\43\1\47\14\43\1\uffff\1\43\2\uffff\u2f81\43"+
+            "\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\3\43\1\51\3\uffff"+
+            "\1\33\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1"+
+            "\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\22\43\1\52\10\43\1\uffff"+
+            "\1\44\2\uffff\23\43\1\52\10\43\1\uffff\1\43\2\uffff\u2f81\43"+
+            "\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\54\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\17\43\1\55\13\43\1\uffff"+
+            "\1\44\2\uffff\20\43\1\55\13\43\1\uffff\1\43\2\uffff\u2f81\43"+
+            "\1\uffff\ucfff\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\62\1\56\1\61\12\60\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\0\63",
+            "",
+            "",
+            "",
+            "",
+            "\0\64",
+            "\42\37\1\65\7\37\1\40\24\37\1\40\34\37\1\36\uffa3\37",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\0\67",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\4\43\1\70\26\43\1\uffff"+
+            "\1\44\2\uffff\5\43\1\70\26\43\1\uffff\1\43\2\uffff\u2f81\43"+
+            "\1\uffff\ucfff\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\24\43\1\71\6\43\1\uffff"+
+            "\1\44\2\uffff\25\43\1\71\6\43\1\uffff\1\43\2\uffff\u2f81\43"+
+            "\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\72\1\uffff\4\43\1\33\33\43\1\uffff\1"+
+            "\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\62\1\56\1\61\12\73\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\74\1\uffff\4\43\1\33\33\43\1\uffff\1"+
+            "\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\74\1\uffff\4\43\1\33\33\43\1\uffff\1"+
+            "\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\42\37\1\65\7\37\1\40\24\37\1\40\34\37\1\36\uffa3\37",
+            "",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\101\2\100\12\77\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\1\102\1\43\12\73\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\101\2\100\12\103\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\101\2\100\12\104\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\105\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\105\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\104\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\101\2\100\12\43\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\104\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\106\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\110\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\111\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43"
+    };
+
+    static final short[] DFA37_eot = DFA.unpackEncodedString(DFA37_eotS);
+    static final short[] DFA37_eof = DFA.unpackEncodedString(DFA37_eofS);
+    static final char[] DFA37_min = DFA.unpackEncodedStringToUnsignedChars(DFA37_minS);
+    static final char[] DFA37_max = DFA.unpackEncodedStringToUnsignedChars(DFA37_maxS);
+    static final short[] DFA37_accept = DFA.unpackEncodedString(DFA37_acceptS);
+    static final short[] DFA37_special = DFA.unpackEncodedString(DFA37_specialS);
+    static final short[][] DFA37_transition;
+
+    static {
+        int numStates = DFA37_transitionS.length;
+        DFA37_transition = new short[numStates][];
+        for (int i=0; i<numStates; i++) {
+            DFA37_transition[i] = DFA.unpackEncodedString(DFA37_transitionS[i]);
+        }
+    }
+
+    class DFA37 extends DFA {
+
+        public DFA37(BaseRecognizer recognizer) {
+            this.recognizer = recognizer;
+            this.decisionNumber = 37;
+            this.eot = DFA37_eot;
+            this.eof = DFA37_eof;
+            this.min = DFA37_min;
+            this.max = DFA37_max;
+            this.accept = DFA37_accept;
+            this.special = DFA37_special;
+            this.transition = DFA37_transition;
+        }
+        public String getDescription() {
+            return "1:1: Tokens : ( LPAREN | RPAREN | LBRACK | RBRACK | COLON | PLUS | MINUS | STAR | QMARK | LCURLY | RCURLY | CARAT | TILDE | DQUOTE | SQUOTE | TO | AND | OR | NOT | WS | NUMBER | DATE_TOKEN | TERM_NORMAL | TERM_TRUNCATED | PHRASE | PHRASE_ANYTHING );";
+        }
+        public int specialStateTransition(int s, IntStream _input) throws NoViableAltException {
+            IntStream input = _input;
+        	int _s = s;
+            switch ( s ) {
+                    case 0 : 
+                        int LA37_73 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_73 >= '\u0000' && LA37_73 <= '\b')||(LA37_73 >= '\u000B' && LA37_73 <= '\f')||(LA37_73 >= '\u000E' && LA37_73 <= '\u001F')||(LA37_73 >= '#' && LA37_73 <= '&')||LA37_73==','||(LA37_73 >= '.' && LA37_73 <= '9')||(LA37_73 >= ';' && LA37_73 <= '>')||(LA37_73 >= '@' && LA37_73 <= 'Z')||(LA37_73 >= '_' && LA37_73 <= 'z')||LA37_73=='|'||(LA37_73 >= '\u007F' && LA37_73 <= '\u2FFF')||(LA37_73 >= '\u3001' && LA37_73 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_73=='\\') ) {s = 36;}
+
+                        else if ( (LA37_73=='-') ) {s = 37;}
+
+                        else if ( (LA37_73=='+') ) {s = 38;}
+
+                        else if ( (LA37_73=='*'||LA37_73=='?') ) {s = 27;}
+
+                        else s = 71;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 1 : 
+                        int LA37_68 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_68 >= '0' && LA37_68 <= '9')) ) {s = 68;}
+
+                        else if ( ((LA37_68 >= '\u0000' && LA37_68 <= '\b')||(LA37_68 >= '\u000B' && LA37_68 <= '\f')||(LA37_68 >= '\u000E' && LA37_68 <= '\u001F')||(LA37_68 >= '#' && LA37_68 <= '&')||LA37_68==','||(LA37_68 >= '.' && LA37_68 <= '/')||(LA37_68 >= ';' && LA37_68 <= '>')||(LA37_68 >= '@' && LA37_68 <= 'Z')||(LA37_68 >= '_' && LA37_68 <= 'z')||LA37_68=='|'||(LA37_68 >= '\u007F' && LA37_68 <= '\u2FFF')||(LA37_68 >= '\u3001' && LA37_68 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_68=='\\') ) {s = 36;}
+
+                        else if ( (LA37_68=='-') ) {s = 37;}
+
+                        else if ( (LA37_68=='+') ) {s = 38;}
+
+                        else if ( (LA37_68=='*'||LA37_68=='?') ) {s = 27;}
+
+                        else s = 47;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 2 : 
+                        int LA37_50 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_50 >= '0' && LA37_50 <= '9')) ) {s = 60;}
+
+                        else if ( ((LA37_50 >= '\u0000' && LA37_50 <= '\b')||(LA37_50 >= '\u000B' && LA37_50 <= '\f')||(LA37_50 >= '\u000E' && LA37_50 <= '\u001F')||(LA37_50 >= '#' && LA37_50 <= '&')||LA37_50==','||(LA37_50 >= '.' && LA37_50 <= '/')||(LA37_50 >= ';' && LA37_50 <= '>')||(LA37_50 >= '@' && LA37_50 <= 'Z')||(LA37_50 >= '_' && LA37_50 <= 'z')||LA37_50=='|'||(LA37_50 >= '\u007F' && LA37_50 <= '\u2FFF')||(LA37_50 >= '\u3001' && LA37_50 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_50=='\\') ) {s = 36;}
+
+                        else if ( (LA37_50=='-') ) {s = 37;}
+
+                        else if ( (LA37_50=='+') ) {s = 38;}
+
+                        else if ( (LA37_50=='*'||LA37_50=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 3 : 
+                        int LA37_42 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_42 >= '\u0000' && LA37_42 <= '\b')||(LA37_42 >= '\u000B' && LA37_42 <= '\f')||(LA37_42 >= '\u000E' && LA37_42 <= '\u001F')||(LA37_42 >= '#' && LA37_42 <= '&')||LA37_42==','||(LA37_42 >= '.' && LA37_42 <= '9')||(LA37_42 >= ';' && LA37_42 <= '>')||(LA37_42 >= '@' && LA37_42 <= 'Z')||(LA37_42 >= '_' && LA37_42 <= 'z')||LA37_42=='|'||(LA37_42 >= '\u007F' && LA37_42 <= '\u2FFF')||(LA37_42 >= '\u3001' && LA37_42 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_42=='\\') ) {s = 36;}
+
+                        else if ( (LA37_42=='-') ) {s = 37;}
+
+                        else if ( (LA37_42=='+') ) {s = 38;}
+
+                        else if ( (LA37_42=='*'||LA37_42=='?') ) {s = 27;}
+
+                        else s = 43;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 4 : 
+                        int LA37_18 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_18=='&') ) {s = 41;}
+
+                        else if ( ((LA37_18 >= '\u0000' && LA37_18 <= '\b')||(LA37_18 >= '\u000B' && LA37_18 <= '\f')||(LA37_18 >= '\u000E' && LA37_18 <= '\u001F')||(LA37_18 >= '#' && LA37_18 <= '%')||LA37_18==','||(LA37_18 >= '.' && LA37_18 <= '9')||(LA37_18 >= ';' && LA37_18 <= '>')||(LA37_18 >= '@' && LA37_18 <= 'Z')||(LA37_18 >= '_' && LA37_18 <= 'z')||LA37_18=='|'||(LA37_18 >= '\u007F' && LA37_18 <= '\u2FFF')||(LA37_18 >= '\u3001' && LA37_18 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_18=='\\') ) {s = 36;}
+
+                        else if ( (LA37_18=='-') ) {s = 37;}
+
+                        else if ( (LA37_18=='+') ) {s = 38;}
+
+                        else if ( (LA37_18=='*'||LA37_18=='?') ) {s = 27;}
+
+                        else s = 40;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 5 : 
+                        int LA37_24 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_24 >= '\u0000' && LA37_24 <= '\b')||(LA37_24 >= '\u000B' && LA37_24 <= '\f')||(LA37_24 >= '\u000E' && LA37_24 <= '\u001F')||(LA37_24 >= '#' && LA37_24 <= '&')||LA37_24==','||(LA37_24 >= '.' && LA37_24 <= '9')||(LA37_24 >= ';' && LA37_24 <= '>')||(LA37_24 >= '@' && LA37_24 <= 'Z')||(LA37_24 >= '_' && LA37_24 <= 'z')||LA37_24=='|'||(LA37_24 >= '\u007F' && LA37_24 <= '\u2FFF')||(LA37_24 >= '\u3001' && LA37_24 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_24=='\\') ) {s = 36;}
+
+                        else if ( (LA37_24=='-') ) {s = 37;}
+
+                        else if ( (LA37_24=='+') ) {s = 38;}
+
+                        else if ( (LA37_24=='*'||LA37_24=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 6 : 
+                        int LA37_9 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_9=='?') ) {s = 9;}
+
+                        else if ( ((LA37_9 >= '\u0000' && LA37_9 <= '\b')||(LA37_9 >= '\u000B' && LA37_9 <= '\f')||(LA37_9 >= '\u000E' && LA37_9 <= '\u001F')||(LA37_9 >= '#' && LA37_9 <= '&')||(LA37_9 >= '+' && LA37_9 <= '9')||(LA37_9 >= ';' && LA37_9 <= '>')||(LA37_9 >= '@' && LA37_9 <= 'Z')||LA37_9=='\\'||(LA37_9 >= '_' && LA37_9 <= 'z')||LA37_9=='|'||(LA37_9 >= '\u007F' && LA37_9 <= '\u2FFF')||(LA37_9 >= '\u3001' && LA37_9 <= '\uFFFF')) ) {s = 27;}
+
+                        else s = 28;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 7 : 
+                        int LA37_48 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_48=='.') ) {s = 46;}
+
+                        else if ( ((LA37_48 >= '0' && LA37_48 <= '9')) ) {s = 59;}
+
+                        else if ( (LA37_48=='/') ) {s = 49;}
+
+                        else if ( (LA37_48=='-') ) {s = 50;}
+
+                        else if ( ((LA37_48 >= '\u0000' && LA37_48 <= '\b')||(LA37_48 >= '\u000B' && LA37_48 <= '\f')||(LA37_48 >= '\u000E' && LA37_48 <= '\u001F')||(LA37_48 >= '#' && LA37_48 <= '&')||LA37_48==','||(LA37_48 >= ';' && LA37_48 <= '>')||(LA37_48 >= '@' && LA37_48 <= 'Z')||(LA37_48 >= '_' && LA37_48 <= 'z')||LA37_48=='|'||(LA37_48 >= '\u007F' && LA37_48 <= '\u2FFF')||(LA37_48 >= '\u3001' && LA37_48 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_48=='\\') ) {s = 36;}
+
+                        else if ( (LA37_48=='+') ) {s = 38;}
+
+                        else if ( (LA37_48=='*'||LA37_48=='?') ) {s = 27;}
+
+                        else s = 47;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 8 : 
+                        int LA37_39 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_39=='D'||LA37_39=='d') ) {s = 56;}
+
+                        else if ( ((LA37_39 >= '\u0000' && LA37_39 <= '\b')||(LA37_39 >= '\u000B' && LA37_39 <= '\f')||(LA37_39 >= '\u000E' && LA37_39 <= '\u001F')||(LA37_39 >= '#' && LA37_39 <= '&')||LA37_39==','||(LA37_39 >= '.' && LA37_39 <= '9')||(LA37_39 >= ';' && LA37_39 <= '>')||(LA37_39 >= '@' && LA37_39 <= 'C')||(LA37_39 >= 'E' && LA37_39 <= 'Z')||(LA37_39 >= '_' && LA37_39 <= 'c')||(LA37_39 >= 'e' && LA37_39 <= 'z')||LA37_39=='|'||(LA37_39 >= '\u007F' && LA37_39 <= '\u2FFF')||(LA37_39 >= '\u3001' && LA37_39 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_39=='\\') ) {s = 36;}
+
+                        else if ( (LA37_39=='-') ) {s = 37;}
+
+                        else if ( (LA37_39=='+') ) {s = 38;}
+
+                        else if ( (LA37_39=='*'||LA37_39=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 9 : 
+                        int LA37_20 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_20=='|') ) {s = 44;}
+
+                        else if ( ((LA37_20 >= '\u0000' && LA37_20 <= '\b')||(LA37_20 >= '\u000B' && LA37_20 <= '\f')||(LA37_20 >= '\u000E' && LA37_20 <= '\u001F')||(LA37_20 >= '#' && LA37_20 <= '&')||LA37_20==','||(LA37_20 >= '.' && LA37_20 <= '9')||(LA37_20 >= ';' && LA37_20 <= '>')||(LA37_20 >= '@' && LA37_20 <= 'Z')||(LA37_20 >= '_' && LA37_20 <= 'z')||(LA37_20 >= '\u007F' && LA37_20 <= '\u2FFF')||(LA37_20 >= '\u3001' && LA37_20 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_20=='\\') ) {s = 36;}
+
+                        else if ( (LA37_20=='-') ) {s = 37;}
+
+                        else if ( (LA37_20=='+') ) {s = 38;}
+
+                        else if ( (LA37_20=='*'||LA37_20=='?') ) {s = 27;}
+
+                        else s = 43;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 10 : 
+                        int LA37_23 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_23=='.') ) {s = 46;}
+
+                        else if ( ((LA37_23 >= '0' && LA37_23 <= '9')) ) {s = 48;}
+
+                        else if ( (LA37_23=='/') ) {s = 49;}
+
+                        else if ( (LA37_23=='-') ) {s = 50;}
+
+                        else if ( ((LA37_23 >= '\u0000' && LA37_23 <= '\b')||(LA37_23 >= '\u000B' && LA37_23 <= '\f')||(LA37_23 >= '\u000E' && LA37_23 <= '\u001F')||(LA37_23 >= '#' && LA37_23 <= '&')||LA37_23==','||(LA37_23 >= ';' && LA37_23 <= '>')||(LA37_23 >= '@' && LA37_23 <= 'Z')||(LA37_23 >= '_' && LA37_23 <= 'z')||LA37_23=='|'||(LA37_23 >= '\u007F' && LA37_23 <= '\u2FFF')||(LA37_23 >= '\u3001' && LA37_23 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_23=='\\') ) {s = 36;}
+
+                        else if ( (LA37_23=='+') ) {s = 38;}
+
+                        else if ( (LA37_23=='*'||LA37_23=='?') ) {s = 27;}
+
+                        else s = 47;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 11 : 
+                        int LA37_52 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_52=='\"') ) {s = 53;}
+
+                        else if ( (LA37_52=='\\') ) {s = 30;}
+
+                        else if ( ((LA37_52 >= '\u0000' && LA37_52 <= '!')||(LA37_52 >= '#' && LA37_52 <= ')')||(LA37_52 >= '+' && LA37_52 <= '>')||(LA37_52 >= '@' && LA37_52 <= '[')||(LA37_52 >= ']' && LA37_52 <= '\uFFFF')) ) {s = 31;}
+
+                        else if ( (LA37_52=='*'||LA37_52=='?') ) {s = 32;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 12 : 
+                        int LA37_0 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_0=='(') ) {s = 1;}
+
+                        else if ( (LA37_0==')') ) {s = 2;}
+
+                        else if ( (LA37_0=='[') ) {s = 3;}
+
+                        else if ( (LA37_0==']') ) {s = 4;}
+
+                        else if ( (LA37_0==':') ) {s = 5;}
+
+                        else if ( (LA37_0=='+') ) {s = 6;}
+
+                        else if ( (LA37_0=='!'||LA37_0=='-') ) {s = 7;}
+
+                        else if ( (LA37_0=='*') ) {s = 8;}
+
+                        else if ( (LA37_0=='?') ) {s = 9;}
+
+                        else if ( (LA37_0=='{') ) {s = 10;}
+
+                        else if ( (LA37_0=='}') ) {s = 11;}
+
+                        else if ( (LA37_0=='^') ) {s = 12;}
+
+                        else if ( (LA37_0=='~') ) {s = 13;}
+
+                        else if ( (LA37_0=='\"') ) {s = 14;}
+
+                        else if ( (LA37_0=='\'') ) {s = 15;}
+
+                        else if ( (LA37_0=='T') ) {s = 16;}
+
+                        else if ( (LA37_0=='A'||LA37_0=='a') ) {s = 17;}
+
+                        else if ( (LA37_0=='&') ) {s = 18;}
+
+                        else if ( (LA37_0=='O'||LA37_0=='o') ) {s = 19;}
+
+                        else if ( (LA37_0=='|') ) {s = 20;}
+
+                        else if ( (LA37_0=='N'||LA37_0=='n') ) {s = 21;}
+
+                        else if ( ((LA37_0 >= '\t' && LA37_0 <= '\n')||LA37_0=='\r'||LA37_0==' '||LA37_0=='\u3000') ) {s = 22;}
+
+                        else if ( ((LA37_0 >= '0' && LA37_0 <= '9')) ) {s = 23;}
+
+                        else if ( ((LA37_0 >= '\u0000' && LA37_0 <= '\b')||(LA37_0 >= '\u000B' && LA37_0 <= '\f')||(LA37_0 >= '\u000E' && LA37_0 <= '\u001F')||(LA37_0 >= '#' && LA37_0 <= '%')||LA37_0==','||(LA37_0 >= '.' && LA37_0 <= '/')||(LA37_0 >= ';' && LA37_0 <= '>')||LA37_0=='@'||(LA37_0 >= 'B' && LA37_0 <= 'M')||(LA37_0 >= 'P' && LA37_0 <= 'S')||(LA37_0 >= 'U' && LA37_0 <= 'Z')||(LA37_0 >= '_' && LA37_0 <= '`')||(LA37_0 >= 'b' && LA37_0 <= 'm')||(LA37_0 >= 'p' && LA37_0 <= 'z')||(LA37_0 >= '\u007F' && LA37_0 <= '\u2FFF')||(LA37_0 >= '\u3001' && LA37_0 <= '\uFFFF')) ) {s = 24;}
+
+                        else if ( (LA37_0=='\\') ) {s = 25;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 13 : 
+                        int LA37_66 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_66 >= '0' && LA37_66 <= '9')) ) {s = 68;}
+
+                        else if ( ((LA37_66 >= '\u0000' && LA37_66 <= '\b')||(LA37_66 >= '\u000B' && LA37_66 <= '\f')||(LA37_66 >= '\u000E' && LA37_66 <= '\u001F')||(LA37_66 >= '#' && LA37_66 <= '&')||LA37_66==','||(LA37_66 >= '.' && LA37_66 <= '/')||(LA37_66 >= ';' && LA37_66 <= '>')||(LA37_66 >= '@' && LA37_66 <= 'Z')||(LA37_66 >= '_' && LA37_66 <= 'z')||LA37_66=='|'||(LA37_66 >= '\u007F' && LA37_66 <= '\u2FFF')||(LA37_66 >= '\u3001' && LA37_66 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_66=='\\') ) {s = 36;}
+
+                        else if ( (LA37_66=='-') ) {s = 37;}
+
+                        else if ( (LA37_66=='+') ) {s = 38;}
+
+                        else if ( (LA37_66=='*'||LA37_66=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 14 : 
+                        int LA37_65 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_65 >= '0' && LA37_65 <= '9')) ) {s = 69;}
+
+                        else if ( ((LA37_65 >= '\u0000' && LA37_65 <= '\b')||(LA37_65 >= '\u000B' && LA37_65 <= '\f')||(LA37_65 >= '\u000E' && LA37_65 <= '\u001F')||(LA37_65 >= '#' && LA37_65 <= '&')||LA37_65==','||(LA37_65 >= '.' && LA37_65 <= '/')||(LA37_65 >= ';' && LA37_65 <= '>')||(LA37_65 >= '@' && LA37_65 <= 'Z')||(LA37_65 >= '_' && LA37_65 <= 'z')||LA37_65=='|'||(LA37_65 >= '\u007F' && LA37_65 <= '\u2FFF')||(LA37_65 >= '\u3001' && LA37_65 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_65=='\\') ) {s = 36;}
+
+                        else if ( (LA37_65=='-') ) {s = 37;}
+
+                        else if ( (LA37_65=='+') ) {s = 38;}
+
+                        else if ( (LA37_65=='*'||LA37_65=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 15 : 
+                        int LA37_31 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_31=='\"') ) {s = 53;}
+
+                        else if ( (LA37_31=='\\') ) {s = 30;}
+
+                        else if ( ((LA37_31 >= '\u0000' && LA37_31 <= '!')||(LA37_31 >= '#' && LA37_31 <= ')')||(LA37_31 >= '+' && LA37_31 <= '>')||(LA37_31 >= '@' && LA37_31 <= '[')||(LA37_31 >= ']' && LA37_31 <= '\uFFFF')) ) {s = 31;}
+
+                        else if ( (LA37_31=='*'||LA37_31=='?') ) {s = 32;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 16 : 
+                        int LA37_33 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_33 >= '\u0000' && LA37_33 <= '\b')||(LA37_33 >= '\u000B' && LA37_33 <= '\f')||(LA37_33 >= '\u000E' && LA37_33 <= '\u001F')||(LA37_33 >= '#' && LA37_33 <= '&')||LA37_33==','||(LA37_33 >= '.' && LA37_33 <= '9')||(LA37_33 >= ';' && LA37_33 <= '>')||(LA37_33 >= '@' && LA37_33 <= 'Z')||(LA37_33 >= '_' && LA37_33 <= 'z')||LA37_33=='|'||(LA37_33 >= '\u007F' && LA37_33 <= '\u2FFF')||(LA37_33 >= '\u3001' && LA37_33 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_33=='\\') ) {s = 36;}
+
+                        else if ( (LA37_33=='-') ) {s = 37;}
+
+                        else if ( (LA37_33=='+') ) {s = 38;}
+
+                        else if ( (LA37_33=='*'||LA37_33=='?') ) {s = 27;}
+
+                        else s = 54;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 17 : 
+                        int LA37_56 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_56 >= '\u0000' && LA37_56 <= '\b')||(LA37_56 >= '\u000B' && LA37_56 <= '\f')||(LA37_56 >= '\u000E' && LA37_56 <= '\u001F')||(LA37_56 >= '#' && LA37_56 <= '&')||LA37_56==','||(LA37_56 >= '.' && LA37_56 <= '9')||(LA37_56 >= ';' && LA37_56 <= '>')||(LA37_56 >= '@' && LA37_56 <= 'Z')||(LA37_56 >= '_' && LA37_56 <= 'z')||LA37_56=='|'||(LA37_56 >= '\u007F' && LA37_56 <= '\u2FFF')||(LA37_56 >= '\u3001' && LA37_56 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_56=='\\') ) {s = 36;}
+
+                        else if ( (LA37_56=='-') ) {s = 37;}
+
+                        else if ( (LA37_56=='+') ) {s = 38;}
+
+                        else if ( (LA37_56=='*'||LA37_56=='?') ) {s = 27;}
+
+                        else s = 40;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 18 : 
+                        int LA37_63 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_63 >= '0' && LA37_63 <= '9')) ) {s = 68;}
+
+                        else if ( ((LA37_63 >= '.' && LA37_63 <= '/')) ) {s = 64;}
+
+                        else if ( (LA37_63=='-') ) {s = 65;}
+
+                        else if ( ((LA37_63 >= '\u0000' && LA37_63 <= '\b')||(LA37_63 >= '\u000B' && LA37_63 <= '\f')||(LA37_63 >= '\u000E' && LA37_63 <= '\u001F')||(LA37_63 >= '#' && LA37_63 <= '&')||LA37_63==','||(LA37_63 >= ';' && LA37_63 <= '>')||(LA37_63 >= '@' && LA37_63 <= 'Z')||(LA37_63 >= '_' && LA37_63 <= 'z')||LA37_63=='|'||(LA37_63 >= '\u007F' && LA37_63 <= '\u2FFF')||(LA37_63 >= '\u3001' && LA37_63 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_63=='\\') ) {s = 36;}
+
+                        else if ( (LA37_63=='+') ) {s = 38;}
+
+                        else if ( (LA37_63=='*'||LA37_63=='?') ) {s = 27;}
+
+                        else s = 47;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 19 : 
+                        int LA37_49 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_49 >= '0' && LA37_49 <= '9')) ) {s = 60;}
+
+                        else if ( ((LA37_49 >= '\u0000' && LA37_49 <= '\b')||(LA37_49 >= '\u000B' && LA37_49 <= '\f')||(LA37_49 >= '\u000E' && LA37_49 <= '\u001F')||(LA37_49 >= '#' && LA37_49 <= '&')||LA37_49==','||(LA37_49 >= '.' && LA37_49 <= '/')||(LA37_49 >= ';' && LA37_49 <= '>')||(LA37_49 >= '@' && LA37_49 <= 'Z')||(LA37_49 >= '_' && LA37_49 <= 'z')||LA37_49=='|'||(LA37_49 >= '\u007F' && LA37_49 <= '\u2FFF')||(LA37_49 >= '\u3001' && LA37_49 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_49=='\\') ) {s = 36;}
+
+                        else if ( (LA37_49=='-') ) {s = 37;}
+
+                        else if ( (LA37_49=='+') ) {s = 38;}
+
+                        else if ( (LA37_49=='*'||LA37_49=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 20 : 
+                        int LA37_67 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_67 >= '.' && LA37_67 <= '/')) ) {s = 64;}
+
+                        else if ( (LA37_67=='-') ) {s = 65;}
+
+                        else if ( ((LA37_67 >= '\u0000' && LA37_67 <= '\b')||(LA37_67 >= '\u000B' && LA37_67 <= '\f')||(LA37_67 >= '\u000E' && LA37_67 <= '\u001F')||(LA37_67 >= '#' && LA37_67 <= '&')||LA37_67==','||(LA37_67 >= '0' && LA37_67 <= '9')||(LA37_67 >= ';' && LA37_67 <= '>')||(LA37_67 >= '@' && LA37_67 <= 'Z')||(LA37_67 >= '_' && LA37_67 <= 'z')||LA37_67=='|'||(LA37_67 >= '\u007F' && LA37_67 <= '\u2FFF')||(LA37_67 >= '\u3001' && LA37_67 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_67=='\\') ) {s = 36;}
+
+                        else if ( (LA37_67=='+') ) {s = 38;}
+
+                        else if ( (LA37_67=='*'||LA37_67=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 21 : 
+                        int LA37_17 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_17=='N'||LA37_17=='n') ) {s = 39;}
+
+                        else if ( ((LA37_17 >= '\u0000' && LA37_17 <= '\b')||(LA37_17 >= '\u000B' && LA37_17 <= '\f')||(LA37_17 >= '\u000E' && LA37_17 <= '\u001F')||(LA37_17 >= '#' && LA37_17 <= '&')||LA37_17==','||(LA37_17 >= '.' && LA37_17 <= '9')||(LA37_17 >= ';' && LA37_17 <= '>')||(LA37_17 >= '@' && LA37_17 <= 'M')||(LA37_17 >= 'O' && LA37_17 <= 'Z')||(LA37_17 >= '_' && LA37_17 <= 'm')||(LA37_17 >= 'o' && LA37_17 <= 'z')||LA37_17=='|'||(LA37_17 >= '\u007F' && LA37_17 <= '\u2FFF')||(LA37_17 >= '\u3001' && LA37_17 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_17=='\\') ) {s = 36;}
+
+                        else if ( (LA37_17=='-') ) {s = 37;}
+
+                        else if ( (LA37_17=='+') ) {s = 38;}
+
+                        else if ( (LA37_17=='*'||LA37_17=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 22 : 
+                        int LA37_64 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_64 >= '0' && LA37_64 <= '9')) ) {s = 69;}
+
+                        else if ( ((LA37_64 >= '\u0000' && LA37_64 <= '\b')||(LA37_64 >= '\u000B' && LA37_64 <= '\f')||(LA37_64 >= '\u000E' && LA37_64 <= '\u001F')||(LA37_64 >= '#' && LA37_64 <= '&')||LA37_64==','||(LA37_64 >= '.' && LA37_64 <= '/')||(LA37_64 >= ';' && LA37_64 <= '>')||(LA37_64 >= '@' && LA37_64 <= 'Z')||(LA37_64 >= '_' && LA37_64 <= 'z')||LA37_64=='|'||(LA37_64 >= '\u007F' && LA37_64 <= '\u2FFF')||(LA37_64 >= '\u3001' && LA37_64 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_64=='\\') ) {s = 36;}
+
+                        else if ( (LA37_64=='-') ) {s = 37;}
+
+                        else if ( (LA37_64=='+') ) {s = 38;}
+
+                        else if ( (LA37_64=='*'||LA37_64=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 23 : 
+                        int LA37_16 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_16=='O') ) {s = 33;}
+
+                        else if ( ((LA37_16 >= '\u0000' && LA37_16 <= '\b')||(LA37_16 >= '\u000B' && LA37_16 <= '\f')||(LA37_16 >= '\u000E' && LA37_16 <= '\u001F')||(LA37_16 >= '#' && LA37_16 <= '&')||LA37_16==','||(LA37_16 >= '.' && LA37_16 <= '9')||(LA37_16 >= ';' && LA37_16 <= '>')||(LA37_16 >= '@' && LA37_16 <= 'N')||(LA37_16 >= 'P' && LA37_16 <= 'Z')||(LA37_16 >= '_' && LA37_16 <= 'z')||LA37_16=='|'||(LA37_16 >= '\u007F' && LA37_16 <= '\u2FFF')||(LA37_16 >= '\u3001' && LA37_16 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_16=='\\') ) {s = 36;}
+
+                        else if ( (LA37_16=='-') ) {s = 37;}
+
+                        else if ( (LA37_16=='+') ) {s = 38;}
+
+                        else if ( (LA37_16=='*'||LA37_16=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 24 : 
+                        int LA37_44 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_44 >= '\u0000' && LA37_44 <= '\b')||(LA37_44 >= '\u000B' && LA37_44 <= '\f')||(LA37_44 >= '\u000E' && LA37_44 <= '\u001F')||(LA37_44 >= '#' && LA37_44 <= '&')||LA37_44==','||(LA37_44 >= '.' && LA37_44 <= '9')||(LA37_44 >= ';' && LA37_44 <= '>')||(LA37_44 >= '@' && LA37_44 <= 'Z')||(LA37_44 >= '_' && LA37_44 <= 'z')||LA37_44=='|'||(LA37_44 >= '\u007F' && LA37_44 <= '\u2FFF')||(LA37_44 >= '\u3001' && LA37_44 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_44=='\\') ) {s = 36;}
+
+                        else if ( (LA37_44=='-') ) {s = 37;}
+
+                        else if ( (LA37_44=='+') ) {s = 38;}
+
+                        else if ( (LA37_44=='*'||LA37_44=='?') ) {s = 27;}
+
+                        else s = 43;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 25 : 
+                        int LA37_14 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_14=='\\') ) {s = 30;}
+
+                        else if ( ((LA37_14 >= '\u0000' && LA37_14 <= '!')||(LA37_14 >= '#' && LA37_14 <= ')')||(LA37_14 >= '+' && LA37_14 <= '>')||(LA37_14 >= '@' && LA37_14 <= '[')||(LA37_14 >= ']' && LA37_14 <= '\uFFFF')) ) {s = 31;}
+
+                        else if ( (LA37_14=='*'||LA37_14=='?') ) {s = 32;}
+
+                        else s = 29;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 26 : 
+                        int LA37_30 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_30 >= '\u0000' && LA37_30 <= '\uFFFF')) ) {s = 52;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 27 : 
+                        int LA37_19 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_19=='R'||LA37_19=='r') ) {s = 42;}
+
+                        else if ( ((LA37_19 >= '\u0000' && LA37_19 <= '\b')||(LA37_19 >= '\u000B' && LA37_19 <= '\f')||(LA37_19 >= '\u000E' && LA37_19 <= '\u001F')||(LA37_19 >= '#' && LA37_19 <= '&')||LA37_19==','||(LA37_19 >= '.' && LA37_19 <= '9')||(LA37_19 >= ';' && LA37_19 <= '>')||(LA37_19 >= '@' && LA37_19 <= 'Q')||(LA37_19 >= 'S' && LA37_19 <= 'Z')||(LA37_19 >= '_' && LA37_19 <= 'q')||(LA37_19 >= 's' && LA37_19 <= 'z')||LA37_19=='|'||(LA37_19 >= '\u007F' && LA37_19 <= '\u2FFF')||(LA37_19 >= '\u3001' && LA37_19 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_19=='\\') ) {s = 36;}
+
+                        else if ( (LA37_19=='-') ) {s = 37;}
+
+                        else if ( (LA37_19=='+') ) {s = 38;}
+
+                        else if ( (LA37_19=='*'||LA37_19=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 28 : 
+                        int LA37_35 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_35 >= '\u0000' && LA37_35 <= '\b')||(LA37_35 >= '\u000B' && LA37_35 <= '\f')||(LA37_35 >= '\u000E' && LA37_35 <= '\u001F')||(LA37_35 >= '#' && LA37_35 <= '&')||LA37_35==','||(LA37_35 >= '.' && LA37_35 <= '9')||(LA37_35 >= ';' && LA37_35 <= '>')||(LA37_35 >= '@' && LA37_35 <= 'Z')||(LA37_35 >= '_' && LA37_35 <= 'z')||LA37_35=='|'||(LA37_35 >= '\u007F' && LA37_35 <= '\u2FFF')||(LA37_35 >= '\u3001' && LA37_35 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_35=='\\') ) {s = 36;}
+
+                        else if ( (LA37_35=='-') ) {s = 37;}
+
+                        else if ( (LA37_35=='+') ) {s = 38;}
+
+                        else if ( (LA37_35=='*'||LA37_35=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 29 : 
+                        int LA37_25 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_25 >= '\u0000' && LA37_25 <= '\uFFFF')) ) {s = 51;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 30 : 
+                        int LA37_36 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_36 >= '\u0000' && LA37_36 <= '\uFFFF')) ) {s = 55;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 31 : 
+                        int LA37_69 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_69 >= '0' && LA37_69 <= '9')) ) {s = 70;}
+
+                        else if ( ((LA37_69 >= '\u0000' && LA37_69 <= '\b')||(LA37_69 >= '\u000B' && LA37_69 <= '\f')||(LA37_69 >= '\u000E' && LA37_69 <= '\u001F')||(LA37_69 >= '#' && LA37_69 <= '&')||LA37_69==','||(LA37_69 >= '.' && LA37_69 <= '/')||(LA37_69 >= ';' && LA37_69 <= '>')||(LA37_69 >= '@' && LA37_69 <= 'Z')||(LA37_69 >= '_' && LA37_69 <= 'z')||LA37_69=='|'||(LA37_69 >= '\u007F' && LA37_69 <= '\u2FFF')||(LA37_69 >= '\u3001' && LA37_69 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_69=='\\') ) {s = 36;}
+
+                        else if ( (LA37_69=='-') ) {s = 37;}
+
+                        else if ( (LA37_69=='+') ) {s = 38;}
+
+                        else if ( (LA37_69=='*'||LA37_69=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 32 : 
+                        int LA37_21 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_21=='O'||LA37_21=='o') ) {s = 45;}
+
+                        else if ( ((LA37_21 >= '\u0000' && LA37_21 <= '\b')||(LA37_21 >= '\u000B' && LA37_21 <= '\f')||(LA37_21 >= '\u000E' && LA37_21 <= '\u001F')||(LA37_21 >= '#' && LA37_21 <= '&')||LA37_21==','||(LA37_21 >= '.' && LA37_21 <= '9')||(LA37_21 >= ';' && LA37_21 <= '>')||(LA37_21 >= '@' && LA37_21 <= 'N')||(LA37_21 >= 'P' && LA37_21 <= 'Z')||(LA37_21 >= '_' && LA37_21 <= 'n')||(LA37_21 >= 'p' && LA37_21 <= 'z')||LA37_21=='|'||(LA37_21 >= '\u007F' && LA37_21 <= '\u2FFF')||(LA37_21 >= '\u3001' && LA37_21 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_21=='\\') ) {s = 36;}
+
+                        else if ( (LA37_21=='-') ) {s = 37;}
+
+                        else if ( (LA37_21=='+') ) {s = 38;}
+
+                        else if ( (LA37_21=='*'||LA37_21=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 33 : 
+                        int LA37_37 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_37 >= '\u0000' && LA37_37 <= '\b')||(LA37_37 >= '\u000B' && LA37_37 <= '\f')||(LA37_37 >= '\u000E' && LA37_37 <= '\u001F')||(LA37_37 >= '#' && LA37_37 <= '&')||LA37_37==','||(LA37_37 >= '.' && LA37_37 <= '9')||(LA37_37 >= ';' && LA37_37 <= '>')||(LA37_37 >= '@' && LA37_37 <= 'Z')||(LA37_37 >= '_' && LA37_37 <= 'z')||LA37_37=='|'||(LA37_37 >= '\u007F' && LA37_37 <= '\u2FFF')||(LA37_37 >= '\u3001' && LA37_37 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_37=='\\') ) {s = 36;}
+
+                        else if ( (LA37_37=='-') ) {s = 37;}
+
+                        else if ( (LA37_37=='+') ) {s = 38;}
+
+                        else if ( (LA37_37=='*'||LA37_37=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 34 : 
+                        int LA37_38 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_38 >= '\u0000' && LA37_38 <= '\b')||(LA37_38 >= '\u000B' && LA37_38 <= '\f')||(LA37_38 >= '\u000E' && LA37_38 <= '\u001F')||(LA37_38 >= '#' && LA37_38 <= '&')||LA37_38==','||(LA37_38 >= '.' && LA37_38 <= '9')||(LA37_38 >= ';' && LA37_38 <= '>')||(LA37_38 >= '@' && LA37_38 <= 'Z')||(LA37_38 >= '_' && LA37_38 <= 'z')||LA37_38=='|'||(LA37_38 >= '\u007F' && LA37_38 <= '\u2FFF')||(LA37_38 >= '\u3001' && LA37_38 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_38=='\\') ) {s = 36;}
+
+                        else if ( (LA37_38=='-') ) {s = 37;}
+
+                        else if ( (LA37_38=='+') ) {s = 38;}
+
+                        else if ( (LA37_38=='*'||LA37_38=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 35 : 
+                        int LA37_57 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_57 >= '\u0000' && LA37_57 <= '\b')||(LA37_57 >= '\u000B' && LA37_57 <= '\f')||(LA37_57 >= '\u000E' && LA37_57 <= '\u001F')||(LA37_57 >= '#' && LA37_57 <= '&')||LA37_57==','||(LA37_57 >= '.' && LA37_57 <= '9')||(LA37_57 >= ';' && LA37_57 <= '>')||(LA37_57 >= '@' && LA37_57 <= 'Z')||(LA37_57 >= '_' && LA37_57 <= 'z')||LA37_57=='|'||(LA37_57 >= '\u007F' && LA37_57 <= '\u2FFF')||(LA37_57 >= '\u3001' && LA37_57 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_57=='\\') ) {s = 36;}
+
+                        else if ( (LA37_57=='-') ) {s = 37;}
+
+                        else if ( (LA37_57=='+') ) {s = 38;}
+
+                        else if ( (LA37_57=='*'||LA37_57=='?') ) {s = 27;}
+
+                        else s = 62;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 36 : 
+                        int LA37_55 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_55 >= '\u0000' && LA37_55 <= '\b')||(LA37_55 >= '\u000B' && LA37_55 <= '\f')||(LA37_55 >= '\u000E' && LA37_55 <= '\u001F')||(LA37_55 >= '#' && LA37_55 <= '&')||LA37_55==','||(LA37_55 >= '.' && LA37_55 <= '9')||(LA37_55 >= ';' && LA37_55 <= '>')||(LA37_55 >= '@' && LA37_55 <= 'Z')||(LA37_55 >= '_' && LA37_55 <= 'z')||LA37_55=='|'||(LA37_55 >= '\u007F' && LA37_55 <= '\u2FFF')||(LA37_55 >= '\u3001' && LA37_55 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_55=='\\') ) {s = 36;}
+
+                        else if ( (LA37_55=='-') ) {s = 37;}
+
+                        else if ( (LA37_55=='+') ) {s = 38;}
+
+                        else if ( (LA37_55=='*'||LA37_55=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 37 : 
+                        int LA37_8 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_8 >= '\u0000' && LA37_8 <= '\b')||(LA37_8 >= '\u000B' && LA37_8 <= '\f')||(LA37_8 >= '\u000E' && LA37_8 <= '\u001F')||(LA37_8 >= '#' && LA37_8 <= '&')||(LA37_8 >= '+' && LA37_8 <= '9')||(LA37_8 >= ';' && LA37_8 <= '>')||(LA37_8 >= '@' && LA37_8 <= 'Z')||LA37_8=='\\'||(LA37_8 >= '_' && LA37_8 <= 'z')||LA37_8=='|'||(LA37_8 >= '\u007F' && LA37_8 <= '\u2FFF')||(LA37_8 >= '\u3001' && LA37_8 <= '\uFFFF')) ) {s = 27;}
+
+                        else s = 26;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 38 : 
+                        int LA37_70 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_70 >= '0' && LA37_70 <= '9')) ) {s = 72;}
+
+                        else if ( ((LA37_70 >= '\u0000' && LA37_70 <= '\b')||(LA37_70 >= '\u000B' && LA37_70 <= '\f')||(LA37_70 >= '\u000E' && LA37_70 <= '\u001F')||(LA37_70 >= '#' && LA37_70 <= '&')||LA37_70==','||(LA37_70 >= '.' && LA37_70 <= '/')||(LA37_70 >= ';' && LA37_70 <= '>')||(LA37_70 >= '@' && LA37_70 <= 'Z')||(LA37_70 >= '_' && LA37_70 <= 'z')||LA37_70=='|'||(LA37_70 >= '\u007F' && LA37_70 <= '\u2FFF')||(LA37_70 >= '\u3001' && LA37_70 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_70=='\\') ) {s = 36;}
+
+                        else if ( (LA37_70=='-') ) {s = 37;}
+
+                        else if ( (LA37_70=='+') ) {s = 38;}
+
+                        else if ( (LA37_70=='*'||LA37_70=='?') ) {s = 27;}
+
+                        else s = 71;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 39 : 
+                        int LA37_72 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_72 >= '0' && LA37_72 <= '9')) ) {s = 73;}
+
+                        else if ( ((LA37_72 >= '\u0000' && LA37_72 <= '\b')||(LA37_72 >= '\u000B' && LA37_72 <= '\f')||(LA37_72 >= '\u000E' && LA37_72 <= '\u001F')||(LA37_72 >= '#' && LA37_72 <= '&')||LA37_72==','||(LA37_72 >= '.' && LA37_72 <= '/')||(LA37_72 >= ';' && LA37_72 <= '>')||(LA37_72 >= '@' && LA37_72 <= 'Z')||(LA37_72 >= '_' && LA37_72 <= 'z')||LA37_72=='|'||(LA37_72 >= '\u007F' && LA37_72 <= '\u2FFF')||(LA37_72 >= '\u3001' && LA37_72 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_72=='\\') ) {s = 36;}
+
+                        else if ( (LA37_72=='-') ) {s = 37;}
+
+                        else if ( (LA37_72=='+') ) {s = 38;}
+
+                        else if ( (LA37_72=='*'||LA37_72=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 40 : 
+                        int LA37_45 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_45=='T'||LA37_45=='t') ) {s = 57;}
+
+                        else if ( ((LA37_45 >= '\u0000' && LA37_45 <= '\b')||(LA37_45 >= '\u000B' && LA37_45 <= '\f')||(LA37_45 >= '\u000E' && LA37_45 <= '\u001F')||(LA37_45 >= '#' && LA37_45 <= '&')||LA37_45==','||(LA37_45 >= '.' && LA37_45 <= '9')||(LA37_45 >= ';' && LA37_45 <= '>')||(LA37_45 >= '@' && LA37_45 <= 'S')||(LA37_45 >= 'U' && LA37_45 <= 'Z')||(LA37_45 >= '_' && LA37_45 <= 's')||(LA37_45 >= 'u' && LA37_45 <= 'z')||LA37_45=='|'||(LA37_45 >= '\u007F' && LA37_45 <= '\u2FFF')||(LA37_45 >= '\u3001' && LA37_45 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_45=='\\') ) {s = 36;}
+
+                        else if ( (LA37_45=='-') ) {s = 37;}
+
+                        else if ( (LA37_45=='+') ) {s = 38;}
+
+                        else if ( (LA37_45=='*'||LA37_45=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 41 : 
+                        int LA37_46 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_46 >= '0' && LA37_46 <= '9')) ) {s = 58;}
+
+                        else if ( ((LA37_46 >= '\u0000' && LA37_46 <= '\b')||(LA37_46 >= '\u000B' && LA37_46 <= '\f')||(LA37_46 >= '\u000E' && LA37_46 <= '\u001F')||(LA37_46 >= '#' && LA37_46 <= '&')||LA37_46==','||(LA37_46 >= '.' && LA37_46 <= '/')||(LA37_46 >= ';' && LA37_46 <= '>')||(LA37_46 >= '@' && LA37_46 <= 'Z')||(LA37_46 >= '_' && LA37_46 <= 'z')||LA37_46=='|'||(LA37_46 >= '\u007F' && LA37_46 <= '\u2FFF')||(LA37_46 >= '\u3001' && LA37_46 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_46=='\\') ) {s = 36;}
+
+                        else if ( (LA37_46=='-') ) {s = 37;}
+
+                        else if ( (LA37_46=='+') ) {s = 38;}
+
+                        else if ( (LA37_46=='*'||LA37_46=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 42 : 
+                        int LA37_59 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA37_59=='.') ) {s = 66;}
+
+                        else if ( ((LA37_59 >= '0' && LA37_59 <= '9')) ) {s = 59;}
+
+                        else if ( ((LA37_59 >= '\u0000' && LA37_59 <= '\b')||(LA37_59 >= '\u000B' && LA37_59 <= '\f')||(LA37_59 >= '\u000E' && LA37_59 <= '\u001F')||(LA37_59 >= '#' && LA37_59 <= '&')||LA37_59==','||LA37_59=='/'||(LA37_59 >= ';' && LA37_59 <= '>')||(LA37_59 >= '@' && LA37_59 <= 'Z')||(LA37_59 >= '_' && LA37_59 <= 'z')||LA37_59=='|'||(LA37_59 >= '\u007F' && LA37_59 <= '\u2FFF')||(LA37_59 >= '\u3001' && LA37_59 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_59=='\\') ) {s = 36;}
+
+                        else if ( (LA37_59=='-') ) {s = 37;}
+
+                        else if ( (LA37_59=='+') ) {s = 38;}
+
+                        else if ( (LA37_59=='*'||LA37_59=='?') ) {s = 27;}
+
+                        else s = 47;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 43 : 
+                        int LA37_60 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_60 >= '0' && LA37_60 <= '9')) ) {s = 67;}
+
+                        else if ( ((LA37_60 >= '.' && LA37_60 <= '/')) ) {s = 64;}
+
+                        else if ( (LA37_60=='-') ) {s = 65;}
+
+                        else if ( ((LA37_60 >= '\u0000' && LA37_60 <= '\b')||(LA37_60 >= '\u000B' && LA37_60 <= '\f')||(LA37_60 >= '\u000E' && LA37_60 <= '\u001F')||(LA37_60 >= '#' && LA37_60 <= '&')||LA37_60==','||(LA37_60 >= ';' && LA37_60 <= '>')||(LA37_60 >= '@' && LA37_60 <= 'Z')||(LA37_60 >= '_' && LA37_60 <= 'z')||LA37_60=='|'||(LA37_60 >= '\u007F' && LA37_60 <= '\u2FFF')||(LA37_60 >= '\u3001' && LA37_60 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_60=='\\') ) {s = 36;}
+
+                        else if ( (LA37_60=='+') ) {s = 38;}
+
+                        else if ( (LA37_60=='*'||LA37_60=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 44 : 
+                        int LA37_58 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_58 >= '0' && LA37_58 <= '9')) ) {s = 63;}
+
+                        else if ( ((LA37_58 >= '.' && LA37_58 <= '/')) ) {s = 64;}
+
+                        else if ( (LA37_58=='-') ) {s = 65;}
+
+                        else if ( ((LA37_58 >= '\u0000' && LA37_58 <= '\b')||(LA37_58 >= '\u000B' && LA37_58 <= '\f')||(LA37_58 >= '\u000E' && LA37_58 <= '\u001F')||(LA37_58 >= '#' && LA37_58 <= '&')||LA37_58==','||(LA37_58 >= ';' && LA37_58 <= '>')||(LA37_58 >= '@' && LA37_58 <= 'Z')||(LA37_58 >= '_' && LA37_58 <= 'z')||LA37_58=='|'||(LA37_58 >= '\u007F' && LA37_58 <= '\u2FFF')||(LA37_58 >= '\u3001' && LA37_58 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_58=='\\') ) {s = 36;}
+
+                        else if ( (LA37_58=='+') ) {s = 38;}
+
+                        else if ( (LA37_58=='*'||LA37_58=='?') ) {s = 27;}
+
+                        else s = 47;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 45 : 
+                        int LA37_51 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_51 >= '\u0000' && LA37_51 <= '\b')||(LA37_51 >= '\u000B' && LA37_51 <= '\f')||(LA37_51 >= '\u000E' && LA37_51 <= '\u001F')||(LA37_51 >= '#' && LA37_51 <= '&')||LA37_51==','||(LA37_51 >= '.' && LA37_51 <= '9')||(LA37_51 >= ';' && LA37_51 <= '>')||(LA37_51 >= '@' && LA37_51 <= 'Z')||(LA37_51 >= '_' && LA37_51 <= 'z')||LA37_51=='|'||(LA37_51 >= '\u007F' && LA37_51 <= '\u2FFF')||(LA37_51 >= '\u3001' && LA37_51 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_51=='\\') ) {s = 36;}
+
+                        else if ( (LA37_51=='-') ) {s = 37;}
+
+                        else if ( (LA37_51=='+') ) {s = 38;}
+
+                        else if ( (LA37_51=='*'||LA37_51=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 46 : 
+                        int LA37_41 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA37_41 >= '\u0000' && LA37_41 <= '\b')||(LA37_41 >= '\u000B' && LA37_41 <= '\f')||(LA37_41 >= '\u000E' && LA37_41 <= '\u001F')||(LA37_41 >= '#' && LA37_41 <= '&')||LA37_41==','||(LA37_41 >= '.' && LA37_41 <= '9')||(LA37_41 >= ';' && LA37_41 <= '>')||(LA37_41 >= '@' && LA37_41 <= 'Z')||(LA37_41 >= '_' && LA37_41 <= 'z')||LA37_41=='|'||(LA37_41 >= '\u007F' && LA37_41 <= '\u2FFF')||(LA37_41 >= '\u3001' && LA37_41 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA37_41=='\\') ) {s = 36;}
+
+                        else if ( (LA37_41=='-') ) {s = 37;}
+
+                        else if ( (LA37_41=='+') ) {s = 38;}
+
+                        else if ( (LA37_41=='*'||LA37_41=='?') ) {s = 27;}
+
+                        else s = 40;
+
+                        if ( s>=0 ) return s;
+                        break;
+            }
+            NoViableAltException nvae =
+                new NoViableAltException(getDescription(), 37, _s, input);
+            error(nvae);
+            throw nvae;
+        }
+
+    }
+ 
+
+}
\ No newline at end of file
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammarLexer.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammarLexer.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/ExtendedLuceneGrammarLexer.java	(revision 0)
@@ -0,0 +1,4153 @@
+// $ANTLR 3.4 /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g 2013-06-27 18:55:45
+
+  package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+
+import org.antlr.runtime.*;
+import java.util.Stack;
+import java.util.List;
+import java.util.ArrayList;
+
+@SuppressWarnings({"all", "warnings", "unchecked"})
+public class ExtendedLuceneGrammarLexer extends Lexer {
+    public static final int EOF=-1;
+    public static final int AMPER=4;
+    public static final int AND=5;
+    public static final int ATOM=6;
+    public static final int BOOST=7;
+    public static final int CARAT=8;
+    public static final int CLAUSE=9;
+    public static final int COLON=10;
+    public static final int DATE_TOKEN=11;
+    public static final int DQUOTE=12;
+    public static final int ESC_CHAR=13;
+    public static final int FIELD=14;
+    public static final int FUZZY=15;
+    public static final int INT=16;
+    public static final int LBRACK=17;
+    public static final int LCURLY=18;
+    public static final int LPAREN=19;
+    public static final int MINUS=20;
+    public static final int MODIFIER=21;
+    public static final int NEAR=22;
+    public static final int NOT=23;
+    public static final int NUMBER=24;
+    public static final int OPERATOR=25;
+    public static final int OR=26;
+    public static final int PHRASE=27;
+    public static final int PHRASE_ANYTHING=28;
+    public static final int PLUS=29;
+    public static final int QANYTHING=30;
+    public static final int QDATE=31;
+    public static final int QMARK=32;
+    public static final int QNORMAL=33;
+    public static final int QPHRASE=34;
+    public static final int QPHRASETRUNC=35;
+    public static final int QRANGEEX=36;
+    public static final int QRANGEIN=37;
+    public static final int QTRUNCATED=38;
+    public static final int RBRACK=39;
+    public static final int RCURLY=40;
+    public static final int RPAREN=41;
+    public static final int SQUOTE=42;
+    public static final int STAR=43;
+    public static final int TERM_CHAR=44;
+    public static final int TERM_NORMAL=45;
+    public static final int TERM_START_CHAR=46;
+    public static final int TERM_TRUNCATED=47;
+    public static final int TILDE=48;
+    public static final int TMODIFIER=49;
+    public static final int TO=50;
+    public static final int VBAR=51;
+    public static final int WS=52;
+
+    	public void recover(RecognitionException re) {
+    		// throw unchecked exception
+    	  throw new RuntimeException(re);
+    	}
+
+
+    // delegates
+    // delegators
+    public Lexer[] getDelegates() {
+        return new Lexer[] {};
+    }
+
+    public ExtendedLuceneGrammarLexer() {} 
+    public ExtendedLuceneGrammarLexer(CharStream input) {
+        this(input, new RecognizerSharedState());
+    }
+    public ExtendedLuceneGrammarLexer(CharStream input, RecognizerSharedState state) {
+        super(input,state);
+    }
+    public String getGrammarFileName() { return "/dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g"; }
+
+    // $ANTLR start "LPAREN"
+    public final void mLPAREN() throws RecognitionException {
+        try {
+            int _type = LPAREN;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:363:9: ( '(' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:363:11: '('
+            {
+            match('('); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "LPAREN"
+
+    // $ANTLR start "RPAREN"
+    public final void mRPAREN() throws RecognitionException {
+        try {
+            int _type = RPAREN;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:365:9: ( ')' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:365:11: ')'
+            {
+            match(')'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "RPAREN"
+
+    // $ANTLR start "LBRACK"
+    public final void mLBRACK() throws RecognitionException {
+        try {
+            int _type = LBRACK;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:367:9: ( '[' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:367:11: '['
+            {
+            match('['); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "LBRACK"
+
+    // $ANTLR start "RBRACK"
+    public final void mRBRACK() throws RecognitionException {
+        try {
+            int _type = RBRACK;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:369:9: ( ']' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:369:11: ']'
+            {
+            match(']'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "RBRACK"
+
+    // $ANTLR start "COLON"
+    public final void mCOLON() throws RecognitionException {
+        try {
+            int _type = COLON;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:371:9: ( ':' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:371:11: ':'
+            {
+            match(':'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "COLON"
+
+    // $ANTLR start "PLUS"
+    public final void mPLUS() throws RecognitionException {
+        try {
+            int _type = PLUS;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:373:7: ( '+' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:373:9: '+'
+            {
+            match('+'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "PLUS"
+
+    // $ANTLR start "MINUS"
+    public final void mMINUS() throws RecognitionException {
+        try {
+            int _type = MINUS;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:375:7: ( ( '-' | '\\!' ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+            {
+            if ( input.LA(1)=='!'||input.LA(1)=='-' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "MINUS"
+
+    // $ANTLR start "STAR"
+    public final void mSTAR() throws RecognitionException {
+        try {
+            int _type = STAR;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:377:7: ( '*' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:377:9: '*'
+            {
+            match('*'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "STAR"
+
+    // $ANTLR start "QMARK"
+    public final void mQMARK() throws RecognitionException {
+        try {
+            int _type = QMARK;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:379:8: ( ( '?' )+ )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:379:10: ( '?' )+
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:379:10: ( '?' )+
+            int cnt1=0;
+            loop1:
+            do {
+                int alt1=2;
+                int LA1_0 = input.LA(1);
+
+                if ( (LA1_0=='?') ) {
+                    alt1=1;
+                }
+
+
+                switch (alt1) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:379:10: '?'
+            	    {
+            	    match('?'); 
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt1 >= 1 ) break loop1;
+                        EarlyExitException eee =
+                            new EarlyExitException(1, input);
+                        throw eee;
+                }
+                cnt1++;
+            } while (true);
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "QMARK"
+
+    // $ANTLR start "VBAR"
+    public final void mVBAR() throws RecognitionException {
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:381:16: ( '|' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:381:18: '|'
+            {
+            match('|'); 
+
+            }
+
+
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "VBAR"
+
+    // $ANTLR start "AMPER"
+    public final void mAMPER() throws RecognitionException {
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:383:16: ( '&' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:383:18: '&'
+            {
+            match('&'); 
+
+            }
+
+
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "AMPER"
+
+    // $ANTLR start "LCURLY"
+    public final void mLCURLY() throws RecognitionException {
+        try {
+            int _type = LCURLY;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:385:9: ( '{' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:385:11: '{'
+            {
+            match('{'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "LCURLY"
+
+    // $ANTLR start "RCURLY"
+    public final void mRCURLY() throws RecognitionException {
+        try {
+            int _type = RCURLY;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:387:9: ( '}' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:387:11: '}'
+            {
+            match('}'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "RCURLY"
+
+    // $ANTLR start "CARAT"
+    public final void mCARAT() throws RecognitionException {
+        try {
+            int _type = CARAT;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:389:7: ( '^' ( ( INT )+ ( '.' ( INT )+ )? )? )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:389:9: '^' ( ( INT )+ ( '.' ( INT )+ )? )?
+            {
+            match('^'); 
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:389:13: ( ( INT )+ ( '.' ( INT )+ )? )?
+            int alt5=2;
+            int LA5_0 = input.LA(1);
+
+            if ( ((LA5_0 >= '0' && LA5_0 <= '9')) ) {
+                alt5=1;
+            }
+            switch (alt5) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:389:14: ( INT )+ ( '.' ( INT )+ )?
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:389:14: ( INT )+
+                    int cnt2=0;
+                    loop2:
+                    do {
+                        int alt2=2;
+                        int LA2_0 = input.LA(1);
+
+                        if ( ((LA2_0 >= '0' && LA2_0 <= '9')) ) {
+                            alt2=1;
+                        }
+
+
+                        switch (alt2) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+                    	    {
+                    	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                    	        input.consume();
+                    	    }
+                    	    else {
+                    	        MismatchedSetException mse = new MismatchedSetException(null,input);
+                    	        recover(mse);
+                    	        throw mse;
+                    	    }
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt2 >= 1 ) break loop2;
+                                EarlyExitException eee =
+                                    new EarlyExitException(2, input);
+                                throw eee;
+                        }
+                        cnt2++;
+                    } while (true);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:389:19: ( '.' ( INT )+ )?
+                    int alt4=2;
+                    int LA4_0 = input.LA(1);
+
+                    if ( (LA4_0=='.') ) {
+                        alt4=1;
+                    }
+                    switch (alt4) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:389:20: '.' ( INT )+
+                            {
+                            match('.'); 
+
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:389:24: ( INT )+
+                            int cnt3=0;
+                            loop3:
+                            do {
+                                int alt3=2;
+                                int LA3_0 = input.LA(1);
+
+                                if ( ((LA3_0 >= '0' && LA3_0 <= '9')) ) {
+                                    alt3=1;
+                                }
+
+
+                                switch (alt3) {
+                            	case 1 :
+                            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+                            	    {
+                            	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                            	        input.consume();
+                            	    }
+                            	    else {
+                            	        MismatchedSetException mse = new MismatchedSetException(null,input);
+                            	        recover(mse);
+                            	        throw mse;
+                            	    }
+
+
+                            	    }
+                            	    break;
+
+                            	default :
+                            	    if ( cnt3 >= 1 ) break loop3;
+                                        EarlyExitException eee =
+                                            new EarlyExitException(3, input);
+                                        throw eee;
+                                }
+                                cnt3++;
+                            } while (true);
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "CARAT"
+
+    // $ANTLR start "TILDE"
+    public final void mTILDE() throws RecognitionException {
+        try {
+            int _type = TILDE;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:391:7: ( '~' ( ( INT )+ ( '.' ( INT )+ )? )? )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:391:9: '~' ( ( INT )+ ( '.' ( INT )+ )? )?
+            {
+            match('~'); 
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:391:13: ( ( INT )+ ( '.' ( INT )+ )? )?
+            int alt9=2;
+            int LA9_0 = input.LA(1);
+
+            if ( ((LA9_0 >= '0' && LA9_0 <= '9')) ) {
+                alt9=1;
+            }
+            switch (alt9) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:391:14: ( INT )+ ( '.' ( INT )+ )?
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:391:14: ( INT )+
+                    int cnt6=0;
+                    loop6:
+                    do {
+                        int alt6=2;
+                        int LA6_0 = input.LA(1);
+
+                        if ( ((LA6_0 >= '0' && LA6_0 <= '9')) ) {
+                            alt6=1;
+                        }
+
+
+                        switch (alt6) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+                    	    {
+                    	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                    	        input.consume();
+                    	    }
+                    	    else {
+                    	        MismatchedSetException mse = new MismatchedSetException(null,input);
+                    	        recover(mse);
+                    	        throw mse;
+                    	    }
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt6 >= 1 ) break loop6;
+                                EarlyExitException eee =
+                                    new EarlyExitException(6, input);
+                                throw eee;
+                        }
+                        cnt6++;
+                    } while (true);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:391:19: ( '.' ( INT )+ )?
+                    int alt8=2;
+                    int LA8_0 = input.LA(1);
+
+                    if ( (LA8_0=='.') ) {
+                        alt8=1;
+                    }
+                    switch (alt8) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:391:20: '.' ( INT )+
+                            {
+                            match('.'); 
+
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:391:24: ( INT )+
+                            int cnt7=0;
+                            loop7:
+                            do {
+                                int alt7=2;
+                                int LA7_0 = input.LA(1);
+
+                                if ( ((LA7_0 >= '0' && LA7_0 <= '9')) ) {
+                                    alt7=1;
+                                }
+
+
+                                switch (alt7) {
+                            	case 1 :
+                            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+                            	    {
+                            	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                            	        input.consume();
+                            	    }
+                            	    else {
+                            	        MismatchedSetException mse = new MismatchedSetException(null,input);
+                            	        recover(mse);
+                            	        throw mse;
+                            	    }
+
+
+                            	    }
+                            	    break;
+
+                            	default :
+                            	    if ( cnt7 >= 1 ) break loop7;
+                                        EarlyExitException eee =
+                                            new EarlyExitException(7, input);
+                                        throw eee;
+                                }
+                                cnt7++;
+                            } while (true);
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "TILDE"
+
+    // $ANTLR start "DQUOTE"
+    public final void mDQUOTE() throws RecognitionException {
+        try {
+            int _type = DQUOTE;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:394:2: ( '\\\"' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:394:4: '\\\"'
+            {
+            match('\"'); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "DQUOTE"
+
+    // $ANTLR start "SQUOTE"
+    public final void mSQUOTE() throws RecognitionException {
+        try {
+            int _type = SQUOTE;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:397:2: ( '\\'' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:397:4: '\\''
+            {
+            match('\''); 
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "SQUOTE"
+
+    // $ANTLR start "TO"
+    public final void mTO() throws RecognitionException {
+        try {
+            int _type = TO;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:402:4: ( 'TO' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:402:6: 'TO'
+            {
+            match("TO"); 
+
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "TO"
+
+    // $ANTLR start "AND"
+    public final void mAND() throws RecognitionException {
+        try {
+            int _type = AND;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:405:7: ( ( ( 'a' | 'A' ) ( 'n' | 'N' ) ( 'd' | 'D' ) | ( AMPER ( AMPER )? ) ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:405:9: ( ( 'a' | 'A' ) ( 'n' | 'N' ) ( 'd' | 'D' ) | ( AMPER ( AMPER )? ) )
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:405:9: ( ( 'a' | 'A' ) ( 'n' | 'N' ) ( 'd' | 'D' ) | ( AMPER ( AMPER )? ) )
+            int alt11=2;
+            int LA11_0 = input.LA(1);
+
+            if ( (LA11_0=='A'||LA11_0=='a') ) {
+                alt11=1;
+            }
+            else if ( (LA11_0=='&') ) {
+                alt11=2;
+            }
+            else {
+                NoViableAltException nvae =
+                    new NoViableAltException("", 11, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt11) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:405:10: ( 'a' | 'A' ) ( 'n' | 'N' ) ( 'd' | 'D' )
+                    {
+                    if ( input.LA(1)=='A'||input.LA(1)=='a' ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    if ( input.LA(1)=='N'||input.LA(1)=='n' ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    if ( input.LA(1)=='D'||input.LA(1)=='d' ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:405:48: ( AMPER ( AMPER )? )
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:405:48: ( AMPER ( AMPER )? )
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:405:49: AMPER ( AMPER )?
+                    {
+                    mAMPER(); 
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:405:55: ( AMPER )?
+                    int alt10=2;
+                    int LA10_0 = input.LA(1);
+
+                    if ( (LA10_0=='&') ) {
+                        alt10=1;
+                    }
+                    switch (alt10) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+                            {
+                            if ( input.LA(1)=='&' ) {
+                                input.consume();
+                            }
+                            else {
+                                MismatchedSetException mse = new MismatchedSetException(null,input);
+                                recover(mse);
+                                throw mse;
+                            }
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    }
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "AND"
+
+    // $ANTLR start "OR"
+    public final void mOR() throws RecognitionException {
+        try {
+            int _type = OR;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:406:5: ( ( ( 'o' | 'O' ) ( 'r' | 'R' ) | ( VBAR ( VBAR )? ) ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:406:7: ( ( 'o' | 'O' ) ( 'r' | 'R' ) | ( VBAR ( VBAR )? ) )
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:406:7: ( ( 'o' | 'O' ) ( 'r' | 'R' ) | ( VBAR ( VBAR )? ) )
+            int alt13=2;
+            int LA13_0 = input.LA(1);
+
+            if ( (LA13_0=='O'||LA13_0=='o') ) {
+                alt13=1;
+            }
+            else if ( (LA13_0=='|') ) {
+                alt13=2;
+            }
+            else {
+                NoViableAltException nvae =
+                    new NoViableAltException("", 13, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt13) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:406:8: ( 'o' | 'O' ) ( 'r' | 'R' )
+                    {
+                    if ( input.LA(1)=='O'||input.LA(1)=='o' ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    if ( input.LA(1)=='R'||input.LA(1)=='r' ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:406:34: ( VBAR ( VBAR )? )
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:406:34: ( VBAR ( VBAR )? )
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:406:35: VBAR ( VBAR )?
+                    {
+                    mVBAR(); 
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:406:40: ( VBAR )?
+                    int alt12=2;
+                    int LA12_0 = input.LA(1);
+
+                    if ( (LA12_0=='|') ) {
+                        alt12=1;
+                    }
+                    switch (alt12) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+                            {
+                            if ( input.LA(1)=='|' ) {
+                                input.consume();
+                            }
+                            else {
+                                MismatchedSetException mse = new MismatchedSetException(null,input);
+                                recover(mse);
+                                throw mse;
+                            }
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    }
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "OR"
+
+    // $ANTLR start "NOT"
+    public final void mNOT() throws RecognitionException {
+        try {
+            int _type = NOT;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:407:7: ( ( 'n' | 'N' ) ( 'o' | 'O' ) ( 't' | 'T' ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:407:9: ( 'n' | 'N' ) ( 'o' | 'O' ) ( 't' | 'T' )
+            {
+            if ( input.LA(1)=='N'||input.LA(1)=='n' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            if ( input.LA(1)=='O'||input.LA(1)=='o' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            if ( input.LA(1)=='T'||input.LA(1)=='t' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "NOT"
+
+    // $ANTLR start "NEAR"
+    public final void mNEAR() throws RecognitionException {
+        try {
+            int _type = NEAR;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:408:7: ( ( 'n' | 'N' ) ( 'e' | 'E' ) ( 'a' | 'A' ) ( 'r' | 'R' ) ( '0' .. '9' )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:408:9: ( 'n' | 'N' ) ( 'e' | 'E' ) ( 'a' | 'A' ) ( 'r' | 'R' ) ( '0' .. '9' )*
+            {
+            if ( input.LA(1)=='N'||input.LA(1)=='n' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            if ( input.LA(1)=='E'||input.LA(1)=='e' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            if ( input.LA(1)=='A'||input.LA(1)=='a' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            if ( input.LA(1)=='R'||input.LA(1)=='r' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:408:57: ( '0' .. '9' )*
+            loop14:
+            do {
+                int alt14=2;
+                int LA14_0 = input.LA(1);
+
+                if ( ((LA14_0 >= '0' && LA14_0 <= '9')) ) {
+                    alt14=1;
+                }
+
+
+                switch (alt14) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+            	    {
+            	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+            	        input.consume();
+            	    }
+            	    else {
+            	        MismatchedSetException mse = new MismatchedSetException(null,input);
+            	        recover(mse);
+            	        throw mse;
+            	    }
+
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop14;
+                }
+            } while (true);
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "NEAR"
+
+    // $ANTLR start "WS"
+    public final void mWS() throws RecognitionException {
+        try {
+            int _type = WS;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:411:5: ( ( ' ' | '\\t' | '\\r' | '\\n' | '\\u3000' ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:411:9: ( ' ' | '\\t' | '\\r' | '\\n' | '\\u3000' )
+            {
+            if ( (input.LA(1) >= '\t' && input.LA(1) <= '\n')||input.LA(1)=='\r'||input.LA(1)==' '||input.LA(1)=='\u3000' ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            _channel=HIDDEN;
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "WS"
+
+    // $ANTLR start "INT"
+    public final void mINT() throws RecognitionException {
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:432:13: ( '0' .. '9' )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+            {
+            if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            }
+
+
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "INT"
+
+    // $ANTLR start "ESC_CHAR"
+    public final void mESC_CHAR() throws RecognitionException {
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:435:18: ( '\\\\' . )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:435:21: '\\\\' .
+            {
+            match('\\'); 
+
+            matchAny(); 
+
+            }
+
+
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "ESC_CHAR"
+
+    // $ANTLR start "TERM_START_CHAR"
+    public final void mTERM_START_CHAR() throws RecognitionException {
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:439:2: ( (~ ( ' ' | '\\t' | '\\n' | '\\r' | '\\u3000' | '\\'' | '\\\"' | '(' | ')' | '[' | ']' | '{' | '}' | '+' | '-' | '!' | ':' | '~' | '^' | '?' | '*' | '\\\\' ) | ESC_CHAR ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:440:2: (~ ( ' ' | '\\t' | '\\n' | '\\r' | '\\u3000' | '\\'' | '\\\"' | '(' | ')' | '[' | ']' | '{' | '}' | '+' | '-' | '!' | ':' | '~' | '^' | '?' | '*' | '\\\\' ) | ESC_CHAR )
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:440:2: (~ ( ' ' | '\\t' | '\\n' | '\\r' | '\\u3000' | '\\'' | '\\\"' | '(' | ')' | '[' | ']' | '{' | '}' | '+' | '-' | '!' | ':' | '~' | '^' | '?' | '*' | '\\\\' ) | ESC_CHAR )
+            int alt15=2;
+            int LA15_0 = input.LA(1);
+
+            if ( ((LA15_0 >= '\u0000' && LA15_0 <= '\b')||(LA15_0 >= '\u000B' && LA15_0 <= '\f')||(LA15_0 >= '\u000E' && LA15_0 <= '\u001F')||(LA15_0 >= '#' && LA15_0 <= '&')||LA15_0==','||(LA15_0 >= '.' && LA15_0 <= '9')||(LA15_0 >= ';' && LA15_0 <= '>')||(LA15_0 >= '@' && LA15_0 <= 'Z')||(LA15_0 >= '_' && LA15_0 <= 'z')||LA15_0=='|'||(LA15_0 >= '\u007F' && LA15_0 <= '\u2FFF')||(LA15_0 >= '\u3001' && LA15_0 <= '\uFFFF')) ) {
+                alt15=1;
+            }
+            else if ( (LA15_0=='\\') ) {
+                alt15=2;
+            }
+            else {
+                NoViableAltException nvae =
+                    new NoViableAltException("", 15, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt15) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:440:3: ~ ( ' ' | '\\t' | '\\n' | '\\r' | '\\u3000' | '\\'' | '\\\"' | '(' | ')' | '[' | ']' | '{' | '}' | '+' | '-' | '!' | ':' | '~' | '^' | '?' | '*' | '\\\\' )
+                    {
+                    if ( (input.LA(1) >= '\u0000' && input.LA(1) <= '\b')||(input.LA(1) >= '\u000B' && input.LA(1) <= '\f')||(input.LA(1) >= '\u000E' && input.LA(1) <= '\u001F')||(input.LA(1) >= '#' && input.LA(1) <= '&')||input.LA(1)==','||(input.LA(1) >= '.' && input.LA(1) <= '9')||(input.LA(1) >= ';' && input.LA(1) <= '>')||(input.LA(1) >= '@' && input.LA(1) <= 'Z')||(input.LA(1) >= '_' && input.LA(1) <= 'z')||input.LA(1)=='|'||(input.LA(1) >= '\u007F' && input.LA(1) <= '\u2FFF')||(input.LA(1) >= '\u3001' && input.LA(1) <= '\uFFFF') ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:446:5: ESC_CHAR
+                    {
+                    mESC_CHAR(); 
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "TERM_START_CHAR"
+
+    // $ANTLR start "TERM_CHAR"
+    public final void mTERM_CHAR() throws RecognitionException {
+        try {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:450:2: ( ( TERM_START_CHAR | '-' | '+' ) )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:451:2: ( TERM_START_CHAR | '-' | '+' )
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:451:2: ( TERM_START_CHAR | '-' | '+' )
+            int alt16=3;
+            int LA16_0 = input.LA(1);
+
+            if ( ((LA16_0 >= '\u0000' && LA16_0 <= '\b')||(LA16_0 >= '\u000B' && LA16_0 <= '\f')||(LA16_0 >= '\u000E' && LA16_0 <= '\u001F')||(LA16_0 >= '#' && LA16_0 <= '&')||LA16_0==','||(LA16_0 >= '.' && LA16_0 <= '9')||(LA16_0 >= ';' && LA16_0 <= '>')||(LA16_0 >= '@' && LA16_0 <= 'Z')||LA16_0=='\\'||(LA16_0 >= '_' && LA16_0 <= 'z')||LA16_0=='|'||(LA16_0 >= '\u007F' && LA16_0 <= '\u2FFF')||(LA16_0 >= '\u3001' && LA16_0 <= '\uFFFF')) ) {
+                alt16=1;
+            }
+            else if ( (LA16_0=='-') ) {
+                alt16=2;
+            }
+            else if ( (LA16_0=='+') ) {
+                alt16=3;
+            }
+            else {
+                NoViableAltException nvae =
+                    new NoViableAltException("", 16, 0, input);
+
+                throw nvae;
+
+            }
+            switch (alt16) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:451:3: TERM_START_CHAR
+                    {
+                    mTERM_START_CHAR(); 
+
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:451:21: '-'
+                    {
+                    match('-'); 
+
+                    }
+                    break;
+                case 3 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:451:27: '+'
+                    {
+                    match('+'); 
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "TERM_CHAR"
+
+    // $ANTLR start "NUMBER"
+    public final void mNUMBER() throws RecognitionException {
+        try {
+            int _type = NUMBER;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:456:2: ( ( INT )+ ( '.' ( INT )+ )? )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:457:2: ( INT )+ ( '.' ( INT )+ )?
+            {
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:457:2: ( INT )+
+            int cnt17=0;
+            loop17:
+            do {
+                int alt17=2;
+                int LA17_0 = input.LA(1);
+
+                if ( ((LA17_0 >= '0' && LA17_0 <= '9')) ) {
+                    alt17=1;
+                }
+
+
+                switch (alt17) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+            	    {
+            	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+            	        input.consume();
+            	    }
+            	    else {
+            	        MismatchedSetException mse = new MismatchedSetException(null,input);
+            	        recover(mse);
+            	        throw mse;
+            	    }
+
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt17 >= 1 ) break loop17;
+                        EarlyExitException eee =
+                            new EarlyExitException(17, input);
+                        throw eee;
+                }
+                cnt17++;
+            } while (true);
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:457:7: ( '.' ( INT )+ )?
+            int alt19=2;
+            int LA19_0 = input.LA(1);
+
+            if ( (LA19_0=='.') ) {
+                alt19=1;
+            }
+            switch (alt19) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:457:8: '.' ( INT )+
+                    {
+                    match('.'); 
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:457:12: ( INT )+
+                    int cnt18=0;
+                    loop18:
+                    do {
+                        int alt18=2;
+                        int LA18_0 = input.LA(1);
+
+                        if ( ((LA18_0 >= '0' && LA18_0 <= '9')) ) {
+                            alt18=1;
+                        }
+
+
+                        switch (alt18) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+                    	    {
+                    	    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                    	        input.consume();
+                    	    }
+                    	    else {
+                    	        MismatchedSetException mse = new MismatchedSetException(null,input);
+                    	        recover(mse);
+                    	        throw mse;
+                    	    }
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt18 >= 1 ) break loop18;
+                                EarlyExitException eee =
+                                    new EarlyExitException(18, input);
+                                throw eee;
+                        }
+                        cnt18++;
+                    } while (true);
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "NUMBER"
+
+    // $ANTLR start "DATE_TOKEN"
+    public final void mDATE_TOKEN() throws RecognitionException {
+        try {
+            int _type = DATE_TOKEN;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:461:2: ( INT ( INT )? ( '/' | '-' | '.' ) INT ( INT )? ( '/' | '-' | '.' ) INT INT ( INT INT )? )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:462:2: INT ( INT )? ( '/' | '-' | '.' ) INT ( INT )? ( '/' | '-' | '.' ) INT INT ( INT INT )?
+            {
+            mINT(); 
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:462:6: ( INT )?
+            int alt20=2;
+            int LA20_0 = input.LA(1);
+
+            if ( ((LA20_0 >= '0' && LA20_0 <= '9')) ) {
+                alt20=1;
+            }
+            switch (alt20) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+                    {
+                    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    }
+                    break;
+
+            }
+
+
+            if ( (input.LA(1) >= '-' && input.LA(1) <= '/') ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            mINT(); 
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:462:29: ( INT )?
+            int alt21=2;
+            int LA21_0 = input.LA(1);
+
+            if ( ((LA21_0 >= '0' && LA21_0 <= '9')) ) {
+                alt21=1;
+            }
+            switch (alt21) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:
+                    {
+                    if ( (input.LA(1) >= '0' && input.LA(1) <= '9') ) {
+                        input.consume();
+                    }
+                    else {
+                        MismatchedSetException mse = new MismatchedSetException(null,input);
+                        recover(mse);
+                        throw mse;
+                    }
+
+
+                    }
+                    break;
+
+            }
+
+
+            if ( (input.LA(1) >= '-' && input.LA(1) <= '/') ) {
+                input.consume();
+            }
+            else {
+                MismatchedSetException mse = new MismatchedSetException(null,input);
+                recover(mse);
+                throw mse;
+            }
+
+
+            mINT(); 
+
+
+            mINT(); 
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:462:56: ( INT INT )?
+            int alt22=2;
+            int LA22_0 = input.LA(1);
+
+            if ( ((LA22_0 >= '0' && LA22_0 <= '9')) ) {
+                alt22=1;
+            }
+            switch (alt22) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:462:57: INT INT
+                    {
+                    mINT(); 
+
+
+                    mINT(); 
+
+
+                    }
+                    break;
+
+            }
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "DATE_TOKEN"
+
+    // $ANTLR start "TERM_NORMAL"
+    public final void mTERM_NORMAL() throws RecognitionException {
+        try {
+            int _type = TERM_NORMAL;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:466:2: ( TERM_START_CHAR ( TERM_CHAR )* )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:467:2: TERM_START_CHAR ( TERM_CHAR )*
+            {
+            mTERM_START_CHAR(); 
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:467:18: ( TERM_CHAR )*
+            loop23:
+            do {
+                int alt23=2;
+                int LA23_0 = input.LA(1);
+
+                if ( ((LA23_0 >= '\u0000' && LA23_0 <= '\b')||(LA23_0 >= '\u000B' && LA23_0 <= '\f')||(LA23_0 >= '\u000E' && LA23_0 <= '\u001F')||(LA23_0 >= '#' && LA23_0 <= '&')||(LA23_0 >= '+' && LA23_0 <= '9')||(LA23_0 >= ';' && LA23_0 <= '>')||(LA23_0 >= '@' && LA23_0 <= 'Z')||LA23_0=='\\'||(LA23_0 >= '_' && LA23_0 <= 'z')||LA23_0=='|'||(LA23_0 >= '\u007F' && LA23_0 <= '\u2FFF')||(LA23_0 >= '\u3001' && LA23_0 <= '\uFFFF')) ) {
+                    alt23=1;
+                }
+
+
+                switch (alt23) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:467:20: TERM_CHAR
+            	    {
+            	    mTERM_CHAR(); 
+
+
+            	    }
+            	    break;
+
+            	default :
+            	    break loop23;
+                }
+            } while (true);
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "TERM_NORMAL"
+
+    // $ANTLR start "TERM_TRUNCATED"
+    public final void mTERM_TRUNCATED() throws RecognitionException {
+        try {
+            int _type = TERM_TRUNCATED;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:471:15: ( ( STAR | QMARK ) ( ( TERM_CHAR )+ ( QMARK | STAR ) )+ ( TERM_CHAR )* | TERM_START_CHAR ( ( TERM_CHAR )* ( QMARK | STAR ) )+ ( TERM_CHAR )* | ( STAR | QMARK ) ( TERM_CHAR )+ )
+            int alt35=3;
+            alt35 = dfa35.predict(input);
+            switch (alt35) {
+                case 1 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:2: ( STAR | QMARK ) ( ( TERM_CHAR )+ ( QMARK | STAR ) )+ ( TERM_CHAR )*
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:2: ( STAR | QMARK )
+                    int alt24=2;
+                    int LA24_0 = input.LA(1);
+
+                    if ( (LA24_0=='*') ) {
+                        alt24=1;
+                    }
+                    else if ( (LA24_0=='?') ) {
+                        alt24=2;
+                    }
+                    else {
+                        NoViableAltException nvae =
+                            new NoViableAltException("", 24, 0, input);
+
+                        throw nvae;
+
+                    }
+                    switch (alt24) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:3: STAR
+                            {
+                            mSTAR(); 
+
+
+                            }
+                            break;
+                        case 2 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:8: QMARK
+                            {
+                            mQMARK(); 
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:15: ( ( TERM_CHAR )+ ( QMARK | STAR ) )+
+                    int cnt27=0;
+                    loop27:
+                    do {
+                        int alt27=2;
+                        alt27 = dfa27.predict(input);
+                        switch (alt27) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:16: ( TERM_CHAR )+ ( QMARK | STAR )
+                    	    {
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:16: ( TERM_CHAR )+
+                    	    int cnt25=0;
+                    	    loop25:
+                    	    do {
+                    	        int alt25=2;
+                    	        int LA25_0 = input.LA(1);
+
+                    	        if ( ((LA25_0 >= '\u0000' && LA25_0 <= '\b')||(LA25_0 >= '\u000B' && LA25_0 <= '\f')||(LA25_0 >= '\u000E' && LA25_0 <= '\u001F')||(LA25_0 >= '#' && LA25_0 <= '&')||(LA25_0 >= '+' && LA25_0 <= '9')||(LA25_0 >= ';' && LA25_0 <= '>')||(LA25_0 >= '@' && LA25_0 <= 'Z')||LA25_0=='\\'||(LA25_0 >= '_' && LA25_0 <= 'z')||LA25_0=='|'||(LA25_0 >= '\u007F' && LA25_0 <= '\u2FFF')||(LA25_0 >= '\u3001' && LA25_0 <= '\uFFFF')) ) {
+                    	            alt25=1;
+                    	        }
+
+
+                    	        switch (alt25) {
+                    	    	case 1 :
+                    	    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:16: TERM_CHAR
+                    	    	    {
+                    	    	    mTERM_CHAR(); 
+
+
+                    	    	    }
+                    	    	    break;
+
+                    	    	default :
+                    	    	    if ( cnt25 >= 1 ) break loop25;
+                    	                EarlyExitException eee =
+                    	                    new EarlyExitException(25, input);
+                    	                throw eee;
+                    	        }
+                    	        cnt25++;
+                    	    } while (true);
+
+
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:27: ( QMARK | STAR )
+                    	    int alt26=2;
+                    	    int LA26_0 = input.LA(1);
+
+                    	    if ( (LA26_0=='?') ) {
+                    	        alt26=1;
+                    	    }
+                    	    else if ( (LA26_0=='*') ) {
+                    	        alt26=2;
+                    	    }
+                    	    else {
+                    	        NoViableAltException nvae =
+                    	            new NoViableAltException("", 26, 0, input);
+
+                    	        throw nvae;
+
+                    	    }
+                    	    switch (alt26) {
+                    	        case 1 :
+                    	            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:28: QMARK
+                    	            {
+                    	            mQMARK(); 
+
+
+                    	            }
+                    	            break;
+                    	        case 2 :
+                    	            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:34: STAR
+                    	            {
+                    	            mSTAR(); 
+
+
+                    	            }
+                    	            break;
+
+                    	    }
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt27 >= 1 ) break loop27;
+                                EarlyExitException eee =
+                                    new EarlyExitException(27, input);
+                                throw eee;
+                        }
+                        cnt27++;
+                    } while (true);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:42: ( TERM_CHAR )*
+                    loop28:
+                    do {
+                        int alt28=2;
+                        int LA28_0 = input.LA(1);
+
+                        if ( ((LA28_0 >= '\u0000' && LA28_0 <= '\b')||(LA28_0 >= '\u000B' && LA28_0 <= '\f')||(LA28_0 >= '\u000E' && LA28_0 <= '\u001F')||(LA28_0 >= '#' && LA28_0 <= '&')||(LA28_0 >= '+' && LA28_0 <= '9')||(LA28_0 >= ';' && LA28_0 <= '>')||(LA28_0 >= '@' && LA28_0 <= 'Z')||LA28_0=='\\'||(LA28_0 >= '_' && LA28_0 <= 'z')||LA28_0=='|'||(LA28_0 >= '\u007F' && LA28_0 <= '\u2FFF')||(LA28_0 >= '\u3001' && LA28_0 <= '\uFFFF')) ) {
+                            alt28=1;
+                        }
+
+
+                        switch (alt28) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:472:43: TERM_CHAR
+                    	    {
+                    	    mTERM_CHAR(); 
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    break loop28;
+                        }
+                    } while (true);
+
+
+                    }
+                    break;
+                case 2 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:473:4: TERM_START_CHAR ( ( TERM_CHAR )* ( QMARK | STAR ) )+ ( TERM_CHAR )*
+                    {
+                    mTERM_START_CHAR(); 
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:473:20: ( ( TERM_CHAR )* ( QMARK | STAR ) )+
+                    int cnt31=0;
+                    loop31:
+                    do {
+                        int alt31=2;
+                        alt31 = dfa31.predict(input);
+                        switch (alt31) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:473:21: ( TERM_CHAR )* ( QMARK | STAR )
+                    	    {
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:473:21: ( TERM_CHAR )*
+                    	    loop29:
+                    	    do {
+                    	        int alt29=2;
+                    	        int LA29_0 = input.LA(1);
+
+                    	        if ( ((LA29_0 >= '\u0000' && LA29_0 <= '\b')||(LA29_0 >= '\u000B' && LA29_0 <= '\f')||(LA29_0 >= '\u000E' && LA29_0 <= '\u001F')||(LA29_0 >= '#' && LA29_0 <= '&')||(LA29_0 >= '+' && LA29_0 <= '9')||(LA29_0 >= ';' && LA29_0 <= '>')||(LA29_0 >= '@' && LA29_0 <= 'Z')||LA29_0=='\\'||(LA29_0 >= '_' && LA29_0 <= 'z')||LA29_0=='|'||(LA29_0 >= '\u007F' && LA29_0 <= '\u2FFF')||(LA29_0 >= '\u3001' && LA29_0 <= '\uFFFF')) ) {
+                    	            alt29=1;
+                    	        }
+
+
+                    	        switch (alt29) {
+                    	    	case 1 :
+                    	    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:473:21: TERM_CHAR
+                    	    	    {
+                    	    	    mTERM_CHAR(); 
+
+
+                    	    	    }
+                    	    	    break;
+
+                    	    	default :
+                    	    	    break loop29;
+                    	        }
+                    	    } while (true);
+
+
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:473:32: ( QMARK | STAR )
+                    	    int alt30=2;
+                    	    int LA30_0 = input.LA(1);
+
+                    	    if ( (LA30_0=='?') ) {
+                    	        alt30=1;
+                    	    }
+                    	    else if ( (LA30_0=='*') ) {
+                    	        alt30=2;
+                    	    }
+                    	    else {
+                    	        NoViableAltException nvae =
+                    	            new NoViableAltException("", 30, 0, input);
+
+                    	        throw nvae;
+
+                    	    }
+                    	    switch (alt30) {
+                    	        case 1 :
+                    	            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:473:33: QMARK
+                    	            {
+                    	            mQMARK(); 
+
+
+                    	            }
+                    	            break;
+                    	        case 2 :
+                    	            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:473:39: STAR
+                    	            {
+                    	            mSTAR(); 
+
+
+                    	            }
+                    	            break;
+
+                    	    }
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt31 >= 1 ) break loop31;
+                                EarlyExitException eee =
+                                    new EarlyExitException(31, input);
+                                throw eee;
+                        }
+                        cnt31++;
+                    } while (true);
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:473:47: ( TERM_CHAR )*
+                    loop32:
+                    do {
+                        int alt32=2;
+                        int LA32_0 = input.LA(1);
+
+                        if ( ((LA32_0 >= '\u0000' && LA32_0 <= '\b')||(LA32_0 >= '\u000B' && LA32_0 <= '\f')||(LA32_0 >= '\u000E' && LA32_0 <= '\u001F')||(LA32_0 >= '#' && LA32_0 <= '&')||(LA32_0 >= '+' && LA32_0 <= '9')||(LA32_0 >= ';' && LA32_0 <= '>')||(LA32_0 >= '@' && LA32_0 <= 'Z')||LA32_0=='\\'||(LA32_0 >= '_' && LA32_0 <= 'z')||LA32_0=='|'||(LA32_0 >= '\u007F' && LA32_0 <= '\u2FFF')||(LA32_0 >= '\u3001' && LA32_0 <= '\uFFFF')) ) {
+                            alt32=1;
+                        }
+
+
+                        switch (alt32) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:473:48: TERM_CHAR
+                    	    {
+                    	    mTERM_CHAR(); 
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    break loop32;
+                        }
+                    } while (true);
+
+
+                    }
+                    break;
+                case 3 :
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:474:4: ( STAR | QMARK ) ( TERM_CHAR )+
+                    {
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:474:4: ( STAR | QMARK )
+                    int alt33=2;
+                    int LA33_0 = input.LA(1);
+
+                    if ( (LA33_0=='*') ) {
+                        alt33=1;
+                    }
+                    else if ( (LA33_0=='?') ) {
+                        alt33=2;
+                    }
+                    else {
+                        NoViableAltException nvae =
+                            new NoViableAltException("", 33, 0, input);
+
+                        throw nvae;
+
+                    }
+                    switch (alt33) {
+                        case 1 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:474:5: STAR
+                            {
+                            mSTAR(); 
+
+
+                            }
+                            break;
+                        case 2 :
+                            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:474:10: QMARK
+                            {
+                            mQMARK(); 
+
+
+                            }
+                            break;
+
+                    }
+
+
+                    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:474:17: ( TERM_CHAR )+
+                    int cnt34=0;
+                    loop34:
+                    do {
+                        int alt34=2;
+                        int LA34_0 = input.LA(1);
+
+                        if ( ((LA34_0 >= '\u0000' && LA34_0 <= '\b')||(LA34_0 >= '\u000B' && LA34_0 <= '\f')||(LA34_0 >= '\u000E' && LA34_0 <= '\u001F')||(LA34_0 >= '#' && LA34_0 <= '&')||(LA34_0 >= '+' && LA34_0 <= '9')||(LA34_0 >= ';' && LA34_0 <= '>')||(LA34_0 >= '@' && LA34_0 <= 'Z')||LA34_0=='\\'||(LA34_0 >= '_' && LA34_0 <= 'z')||LA34_0=='|'||(LA34_0 >= '\u007F' && LA34_0 <= '\u2FFF')||(LA34_0 >= '\u3001' && LA34_0 <= '\uFFFF')) ) {
+                            alt34=1;
+                        }
+
+
+                        switch (alt34) {
+                    	case 1 :
+                    	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:474:17: TERM_CHAR
+                    	    {
+                    	    mTERM_CHAR(); 
+
+
+                    	    }
+                    	    break;
+
+                    	default :
+                    	    if ( cnt34 >= 1 ) break loop34;
+                                EarlyExitException eee =
+                                    new EarlyExitException(34, input);
+                                throw eee;
+                        }
+                        cnt34++;
+                    } while (true);
+
+
+                    }
+                    break;
+
+            }
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "TERM_TRUNCATED"
+
+    // $ANTLR start "PHRASE"
+    public final void mPHRASE() throws RecognitionException {
+        try {
+            int _type = PHRASE;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:479:2: ( DQUOTE ( ESC_CHAR |~ ( '\\\"' | '\\\\' | '?' | '*' ) )+ DQUOTE )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:480:2: DQUOTE ( ESC_CHAR |~ ( '\\\"' | '\\\\' | '?' | '*' ) )+ DQUOTE
+            {
+            mDQUOTE(); 
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:480:9: ( ESC_CHAR |~ ( '\\\"' | '\\\\' | '?' | '*' ) )+
+            int cnt36=0;
+            loop36:
+            do {
+                int alt36=3;
+                int LA36_0 = input.LA(1);
+
+                if ( (LA36_0=='\\') ) {
+                    alt36=1;
+                }
+                else if ( ((LA36_0 >= '\u0000' && LA36_0 <= '!')||(LA36_0 >= '#' && LA36_0 <= ')')||(LA36_0 >= '+' && LA36_0 <= '>')||(LA36_0 >= '@' && LA36_0 <= '[')||(LA36_0 >= ']' && LA36_0 <= '\uFFFF')) ) {
+                    alt36=2;
+                }
+
+
+                switch (alt36) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:480:10: ESC_CHAR
+            	    {
+            	    mESC_CHAR(); 
+
+
+            	    }
+            	    break;
+            	case 2 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:480:19: ~ ( '\\\"' | '\\\\' | '?' | '*' )
+            	    {
+            	    if ( (input.LA(1) >= '\u0000' && input.LA(1) <= '!')||(input.LA(1) >= '#' && input.LA(1) <= ')')||(input.LA(1) >= '+' && input.LA(1) <= '>')||(input.LA(1) >= '@' && input.LA(1) <= '[')||(input.LA(1) >= ']' && input.LA(1) <= '\uFFFF') ) {
+            	        input.consume();
+            	    }
+            	    else {
+            	        MismatchedSetException mse = new MismatchedSetException(null,input);
+            	        recover(mse);
+            	        throw mse;
+            	    }
+
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt36 >= 1 ) break loop36;
+                        EarlyExitException eee =
+                            new EarlyExitException(36, input);
+                        throw eee;
+                }
+                cnt36++;
+            } while (true);
+
+
+            mDQUOTE(); 
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "PHRASE"
+
+    // $ANTLR start "PHRASE_ANYTHING"
+    public final void mPHRASE_ANYTHING() throws RecognitionException {
+        try {
+            int _type = PHRASE_ANYTHING;
+            int _channel = DEFAULT_TOKEN_CHANNEL;
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:483:17: ( DQUOTE ( ESC_CHAR |~ ( '\\\"' | '\\\\' ) )+ DQUOTE )
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:484:2: DQUOTE ( ESC_CHAR |~ ( '\\\"' | '\\\\' ) )+ DQUOTE
+            {
+            mDQUOTE(); 
+
+
+            // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:484:9: ( ESC_CHAR |~ ( '\\\"' | '\\\\' ) )+
+            int cnt37=0;
+            loop37:
+            do {
+                int alt37=3;
+                int LA37_0 = input.LA(1);
+
+                if ( (LA37_0=='\\') ) {
+                    alt37=1;
+                }
+                else if ( ((LA37_0 >= '\u0000' && LA37_0 <= '!')||(LA37_0 >= '#' && LA37_0 <= '[')||(LA37_0 >= ']' && LA37_0 <= '\uFFFF')) ) {
+                    alt37=2;
+                }
+
+
+                switch (alt37) {
+            	case 1 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:484:10: ESC_CHAR
+            	    {
+            	    mESC_CHAR(); 
+
+
+            	    }
+            	    break;
+            	case 2 :
+            	    // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:484:19: ~ ( '\\\"' | '\\\\' )
+            	    {
+            	    if ( (input.LA(1) >= '\u0000' && input.LA(1) <= '!')||(input.LA(1) >= '#' && input.LA(1) <= '[')||(input.LA(1) >= ']' && input.LA(1) <= '\uFFFF') ) {
+            	        input.consume();
+            	    }
+            	    else {
+            	        MismatchedSetException mse = new MismatchedSetException(null,input);
+            	        recover(mse);
+            	        throw mse;
+            	    }
+
+
+            	    }
+            	    break;
+
+            	default :
+            	    if ( cnt37 >= 1 ) break loop37;
+                        EarlyExitException eee =
+                            new EarlyExitException(37, input);
+                        throw eee;
+                }
+                cnt37++;
+            } while (true);
+
+
+            mDQUOTE(); 
+
+
+            }
+
+            state.type = _type;
+            state.channel = _channel;
+        }
+        finally {
+        	// do for sure before leaving
+        }
+    }
+    // $ANTLR end "PHRASE_ANYTHING"
+
+    public void mTokens() throws RecognitionException {
+        // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:8: ( LPAREN | RPAREN | LBRACK | RBRACK | COLON | PLUS | MINUS | STAR | QMARK | LCURLY | RCURLY | CARAT | TILDE | DQUOTE | SQUOTE | TO | AND | OR | NOT | NEAR | WS | NUMBER | DATE_TOKEN | TERM_NORMAL | TERM_TRUNCATED | PHRASE | PHRASE_ANYTHING )
+        int alt38=27;
+        alt38 = dfa38.predict(input);
+        switch (alt38) {
+            case 1 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:10: LPAREN
+                {
+                mLPAREN(); 
+
+
+                }
+                break;
+            case 2 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:17: RPAREN
+                {
+                mRPAREN(); 
+
+
+                }
+                break;
+            case 3 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:24: LBRACK
+                {
+                mLBRACK(); 
+
+
+                }
+                break;
+            case 4 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:31: RBRACK
+                {
+                mRBRACK(); 
+
+
+                }
+                break;
+            case 5 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:38: COLON
+                {
+                mCOLON(); 
+
+
+                }
+                break;
+            case 6 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:44: PLUS
+                {
+                mPLUS(); 
+
+
+                }
+                break;
+            case 7 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:49: MINUS
+                {
+                mMINUS(); 
+
+
+                }
+                break;
+            case 8 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:55: STAR
+                {
+                mSTAR(); 
+
+
+                }
+                break;
+            case 9 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:60: QMARK
+                {
+                mQMARK(); 
+
+
+                }
+                break;
+            case 10 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:66: LCURLY
+                {
+                mLCURLY(); 
+
+
+                }
+                break;
+            case 11 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:73: RCURLY
+                {
+                mRCURLY(); 
+
+
+                }
+                break;
+            case 12 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:80: CARAT
+                {
+                mCARAT(); 
+
+
+                }
+                break;
+            case 13 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:86: TILDE
+                {
+                mTILDE(); 
+
+
+                }
+                break;
+            case 14 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:92: DQUOTE
+                {
+                mDQUOTE(); 
+
+
+                }
+                break;
+            case 15 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:99: SQUOTE
+                {
+                mSQUOTE(); 
+
+
+                }
+                break;
+            case 16 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:106: TO
+                {
+                mTO(); 
+
+
+                }
+                break;
+            case 17 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:109: AND
+                {
+                mAND(); 
+
+
+                }
+                break;
+            case 18 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:113: OR
+                {
+                mOR(); 
+
+
+                }
+                break;
+            case 19 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:116: NOT
+                {
+                mNOT(); 
+
+
+                }
+                break;
+            case 20 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:120: NEAR
+                {
+                mNEAR(); 
+
+
+                }
+                break;
+            case 21 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:125: WS
+                {
+                mWS(); 
+
+
+                }
+                break;
+            case 22 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:128: NUMBER
+                {
+                mNUMBER(); 
+
+
+                }
+                break;
+            case 23 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:135: DATE_TOKEN
+                {
+                mDATE_TOKEN(); 
+
+
+                }
+                break;
+            case 24 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:146: TERM_NORMAL
+                {
+                mTERM_NORMAL(); 
+
+
+                }
+                break;
+            case 25 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:158: TERM_TRUNCATED
+                {
+                mTERM_TRUNCATED(); 
+
+
+                }
+                break;
+            case 26 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:173: PHRASE
+                {
+                mPHRASE(); 
+
+
+                }
+                break;
+            case 27 :
+                // /dvt/workspace/lucene_4x/lucene/queryparser/grammars/ExtendedLuceneGrammar.g:1:180: PHRASE_ANYTHING
+                {
+                mPHRASE_ANYTHING(); 
+
+
+                }
+                break;
+
+        }
+
+    }
+
+
+    protected DFA35 dfa35 = new DFA35(this);
+    protected DFA27 dfa27 = new DFA27(this);
+    protected DFA31 dfa31 = new DFA31(this);
+    protected DFA38 dfa38 = new DFA38(this);
+    static final String DFA35_eotS =
+        "\4\uffff\1\10\1\uffff\2\10\2\uffff\1\10";
+    static final String DFA35_eofS =
+        "\13\uffff";
+    static final String DFA35_minS =
+        "\3\0\1\uffff\4\0\2\uffff\1\0";
+    static final String DFA35_maxS =
+        "\3\uffff\1\uffff\4\uffff\2\uffff\1\uffff";
+    static final String DFA35_acceptS =
+        "\3\uffff\1\2\4\uffff\1\3\1\1\1\uffff";
+    static final String DFA35_specialS =
+        "\1\2\1\3\1\4\1\uffff\1\7\1\0\1\5\1\1\2\uffff\1\6}>";
+    static final String[] DFA35_transitionS = {
+            "\11\3\2\uffff\2\3\1\uffff\22\3\3\uffff\4\3\3\uffff\1\1\1\uffff"+
+            "\1\3\1\uffff\14\3\1\uffff\4\3\1\2\33\3\1\uffff\1\3\2\uffff\34"+
+            "\3\1\uffff\1\3\2\uffff\u2f81\3\1\uffff\ucfff\3",
+            "\11\4\2\uffff\2\4\1\uffff\22\4\3\uffff\4\4\4\uffff\1\7\1\4"+
+            "\1\6\14\4\1\uffff\4\4\1\uffff\33\4\1\uffff\1\5\2\uffff\34\4"+
+            "\1\uffff\1\4\2\uffff\u2f81\4\1\uffff\ucfff\4",
+            "\11\4\2\uffff\2\4\1\uffff\22\4\3\uffff\4\4\4\uffff\1\7\1\4"+
+            "\1\6\14\4\1\uffff\4\4\1\2\33\4\1\uffff\1\5\2\uffff\34\4\1\uffff"+
+            "\1\4\2\uffff\u2f81\4\1\uffff\ucfff\4",
+            "",
+            "\11\4\2\uffff\2\4\1\uffff\22\4\3\uffff\4\4\3\uffff\1\11\1\7"+
+            "\1\4\1\6\14\4\1\uffff\4\4\1\11\33\4\1\uffff\1\5\2\uffff\34\4"+
+            "\1\uffff\1\4\2\uffff\u2f81\4\1\uffff\ucfff\4",
+            "\0\12",
+            "\11\4\2\uffff\2\4\1\uffff\22\4\3\uffff\4\4\3\uffff\1\11\1\7"+
+            "\1\4\1\6\14\4\1\uffff\4\4\1\11\33\4\1\uffff\1\5\2\uffff\34\4"+
+            "\1\uffff\1\4\2\uffff\u2f81\4\1\uffff\ucfff\4",
+            "\11\4\2\uffff\2\4\1\uffff\22\4\3\uffff\4\4\3\uffff\1\11\1\7"+
+            "\1\4\1\6\14\4\1\uffff\4\4\1\11\33\4\1\uffff\1\5\2\uffff\34\4"+
+            "\1\uffff\1\4\2\uffff\u2f81\4\1\uffff\ucfff\4",
+            "",
+            "",
+            "\11\4\2\uffff\2\4\1\uffff\22\4\3\uffff\4\4\3\uffff\1\11\1\7"+
+            "\1\4\1\6\14\4\1\uffff\4\4\1\11\33\4\1\uffff\1\5\2\uffff\34\4"+
+            "\1\uffff\1\4\2\uffff\u2f81\4\1\uffff\ucfff\4"
+    };
+
+    static final short[] DFA35_eot = DFA.unpackEncodedString(DFA35_eotS);
+    static final short[] DFA35_eof = DFA.unpackEncodedString(DFA35_eofS);
+    static final char[] DFA35_min = DFA.unpackEncodedStringToUnsignedChars(DFA35_minS);
+    static final char[] DFA35_max = DFA.unpackEncodedStringToUnsignedChars(DFA35_maxS);
+    static final short[] DFA35_accept = DFA.unpackEncodedString(DFA35_acceptS);
+    static final short[] DFA35_special = DFA.unpackEncodedString(DFA35_specialS);
+    static final short[][] DFA35_transition;
+
+    static {
+        int numStates = DFA35_transitionS.length;
+        DFA35_transition = new short[numStates][];
+        for (int i=0; i<numStates; i++) {
+            DFA35_transition[i] = DFA.unpackEncodedString(DFA35_transitionS[i]);
+        }
+    }
+
+    class DFA35 extends DFA {
+
+        public DFA35(BaseRecognizer recognizer) {
+            this.recognizer = recognizer;
+            this.decisionNumber = 35;
+            this.eot = DFA35_eot;
+            this.eof = DFA35_eof;
+            this.min = DFA35_min;
+            this.max = DFA35_max;
+            this.accept = DFA35_accept;
+            this.special = DFA35_special;
+            this.transition = DFA35_transition;
+        }
+        public String getDescription() {
+            return "471:1: TERM_TRUNCATED : ( ( STAR | QMARK ) ( ( TERM_CHAR )+ ( QMARK | STAR ) )+ ( TERM_CHAR )* | TERM_START_CHAR ( ( TERM_CHAR )* ( QMARK | STAR ) )+ ( TERM_CHAR )* | ( STAR | QMARK ) ( TERM_CHAR )+ );";
+        }
+        public int specialStateTransition(int s, IntStream _input) throws NoViableAltException {
+            IntStream input = _input;
+        	int _s = s;
+            switch ( s ) {
+                    case 0 : 
+                        int LA35_5 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA35_5 >= '\u0000' && LA35_5 <= '\uFFFF')) ) {s = 10;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 1 : 
+                        int LA35_7 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA35_7=='*'||LA35_7=='?') ) {s = 9;}
+
+                        else if ( ((LA35_7 >= '\u0000' && LA35_7 <= '\b')||(LA35_7 >= '\u000B' && LA35_7 <= '\f')||(LA35_7 >= '\u000E' && LA35_7 <= '\u001F')||(LA35_7 >= '#' && LA35_7 <= '&')||LA35_7==','||(LA35_7 >= '.' && LA35_7 <= '9')||(LA35_7 >= ';' && LA35_7 <= '>')||(LA35_7 >= '@' && LA35_7 <= 'Z')||(LA35_7 >= '_' && LA35_7 <= 'z')||LA35_7=='|'||(LA35_7 >= '\u007F' && LA35_7 <= '\u2FFF')||(LA35_7 >= '\u3001' && LA35_7 <= '\uFFFF')) ) {s = 4;}
+
+                        else if ( (LA35_7=='\\') ) {s = 5;}
+
+                        else if ( (LA35_7=='-') ) {s = 6;}
+
+                        else if ( (LA35_7=='+') ) {s = 7;}
+
+                        else s = 8;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 2 : 
+                        int LA35_0 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA35_0=='*') ) {s = 1;}
+
+                        else if ( (LA35_0=='?') ) {s = 2;}
+
+                        else if ( ((LA35_0 >= '\u0000' && LA35_0 <= '\b')||(LA35_0 >= '\u000B' && LA35_0 <= '\f')||(LA35_0 >= '\u000E' && LA35_0 <= '\u001F')||(LA35_0 >= '#' && LA35_0 <= '&')||LA35_0==','||(LA35_0 >= '.' && LA35_0 <= '9')||(LA35_0 >= ';' && LA35_0 <= '>')||(LA35_0 >= '@' && LA35_0 <= 'Z')||LA35_0=='\\'||(LA35_0 >= '_' && LA35_0 <= 'z')||LA35_0=='|'||(LA35_0 >= '\u007F' && LA35_0 <= '\u2FFF')||(LA35_0 >= '\u3001' && LA35_0 <= '\uFFFF')) ) {s = 3;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 3 : 
+                        int LA35_1 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA35_1 >= '\u0000' && LA35_1 <= '\b')||(LA35_1 >= '\u000B' && LA35_1 <= '\f')||(LA35_1 >= '\u000E' && LA35_1 <= '\u001F')||(LA35_1 >= '#' && LA35_1 <= '&')||LA35_1==','||(LA35_1 >= '.' && LA35_1 <= '9')||(LA35_1 >= ';' && LA35_1 <= '>')||(LA35_1 >= '@' && LA35_1 <= 'Z')||(LA35_1 >= '_' && LA35_1 <= 'z')||LA35_1=='|'||(LA35_1 >= '\u007F' && LA35_1 <= '\u2FFF')||(LA35_1 >= '\u3001' && LA35_1 <= '\uFFFF')) ) {s = 4;}
+
+                        else if ( (LA35_1=='\\') ) {s = 5;}
+
+                        else if ( (LA35_1=='-') ) {s = 6;}
+
+                        else if ( (LA35_1=='+') ) {s = 7;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 4 : 
+                        int LA35_2 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA35_2 >= '\u0000' && LA35_2 <= '\b')||(LA35_2 >= '\u000B' && LA35_2 <= '\f')||(LA35_2 >= '\u000E' && LA35_2 <= '\u001F')||(LA35_2 >= '#' && LA35_2 <= '&')||LA35_2==','||(LA35_2 >= '.' && LA35_2 <= '9')||(LA35_2 >= ';' && LA35_2 <= '>')||(LA35_2 >= '@' && LA35_2 <= 'Z')||(LA35_2 >= '_' && LA35_2 <= 'z')||LA35_2=='|'||(LA35_2 >= '\u007F' && LA35_2 <= '\u2FFF')||(LA35_2 >= '\u3001' && LA35_2 <= '\uFFFF')) ) {s = 4;}
+
+                        else if ( (LA35_2=='\\') ) {s = 5;}
+
+                        else if ( (LA35_2=='-') ) {s = 6;}
+
+                        else if ( (LA35_2=='+') ) {s = 7;}
+
+                        else if ( (LA35_2=='?') ) {s = 2;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 5 : 
+                        int LA35_6 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA35_6=='*'||LA35_6=='?') ) {s = 9;}
+
+                        else if ( ((LA35_6 >= '\u0000' && LA35_6 <= '\b')||(LA35_6 >= '\u000B' && LA35_6 <= '\f')||(LA35_6 >= '\u000E' && LA35_6 <= '\u001F')||(LA35_6 >= '#' && LA35_6 <= '&')||LA35_6==','||(LA35_6 >= '.' && LA35_6 <= '9')||(LA35_6 >= ';' && LA35_6 <= '>')||(LA35_6 >= '@' && LA35_6 <= 'Z')||(LA35_6 >= '_' && LA35_6 <= 'z')||LA35_6=='|'||(LA35_6 >= '\u007F' && LA35_6 <= '\u2FFF')||(LA35_6 >= '\u3001' && LA35_6 <= '\uFFFF')) ) {s = 4;}
+
+                        else if ( (LA35_6=='\\') ) {s = 5;}
+
+                        else if ( (LA35_6=='-') ) {s = 6;}
+
+                        else if ( (LA35_6=='+') ) {s = 7;}
+
+                        else s = 8;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 6 : 
+                        int LA35_10 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA35_10=='*'||LA35_10=='?') ) {s = 9;}
+
+                        else if ( ((LA35_10 >= '\u0000' && LA35_10 <= '\b')||(LA35_10 >= '\u000B' && LA35_10 <= '\f')||(LA35_10 >= '\u000E' && LA35_10 <= '\u001F')||(LA35_10 >= '#' && LA35_10 <= '&')||LA35_10==','||(LA35_10 >= '.' && LA35_10 <= '9')||(LA35_10 >= ';' && LA35_10 <= '>')||(LA35_10 >= '@' && LA35_10 <= 'Z')||(LA35_10 >= '_' && LA35_10 <= 'z')||LA35_10=='|'||(LA35_10 >= '\u007F' && LA35_10 <= '\u2FFF')||(LA35_10 >= '\u3001' && LA35_10 <= '\uFFFF')) ) {s = 4;}
+
+                        else if ( (LA35_10=='\\') ) {s = 5;}
+
+                        else if ( (LA35_10=='-') ) {s = 6;}
+
+                        else if ( (LA35_10=='+') ) {s = 7;}
+
+                        else s = 8;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 7 : 
+                        int LA35_4 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA35_4=='*'||LA35_4=='?') ) {s = 9;}
+
+                        else if ( ((LA35_4 >= '\u0000' && LA35_4 <= '\b')||(LA35_4 >= '\u000B' && LA35_4 <= '\f')||(LA35_4 >= '\u000E' && LA35_4 <= '\u001F')||(LA35_4 >= '#' && LA35_4 <= '&')||LA35_4==','||(LA35_4 >= '.' && LA35_4 <= '9')||(LA35_4 >= ';' && LA35_4 <= '>')||(LA35_4 >= '@' && LA35_4 <= 'Z')||(LA35_4 >= '_' && LA35_4 <= 'z')||LA35_4=='|'||(LA35_4 >= '\u007F' && LA35_4 <= '\u2FFF')||(LA35_4 >= '\u3001' && LA35_4 <= '\uFFFF')) ) {s = 4;}
+
+                        else if ( (LA35_4=='\\') ) {s = 5;}
+
+                        else if ( (LA35_4=='-') ) {s = 6;}
+
+                        else if ( (LA35_4=='+') ) {s = 7;}
+
+                        else s = 8;
+
+                        if ( s>=0 ) return s;
+                        break;
+            }
+            NoViableAltException nvae =
+                new NoViableAltException(getDescription(), 35, _s, input);
+            error(nvae);
+            throw nvae;
+        }
+
+    }
+    static final String DFA27_eotS =
+        "\2\5\1\uffff\2\5\2\uffff\1\5";
+    static final String DFA27_eofS =
+        "\10\uffff";
+    static final String DFA27_minS =
+        "\5\0\2\uffff\1\0";
+    static final String DFA27_maxS =
+        "\5\uffff\2\uffff\1\uffff";
+    static final String DFA27_acceptS =
+        "\5\uffff\1\2\1\1\1\uffff";
+    static final String DFA27_specialS =
+        "\1\3\1\5\1\0\1\2\1\1\2\uffff\1\4}>";
+    static final String[] DFA27_transitionS = {
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\4\uffff\1\4\1\1\1"+
+            "\3\14\1\1\uffff\4\1\1\uffff\33\1\1\uffff\1\2\2\uffff\34\1\1"+
+            "\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "\0\7",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "",
+            "",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1"
+    };
+
+    static final short[] DFA27_eot = DFA.unpackEncodedString(DFA27_eotS);
+    static final short[] DFA27_eof = DFA.unpackEncodedString(DFA27_eofS);
+    static final char[] DFA27_min = DFA.unpackEncodedStringToUnsignedChars(DFA27_minS);
+    static final char[] DFA27_max = DFA.unpackEncodedStringToUnsignedChars(DFA27_maxS);
+    static final short[] DFA27_accept = DFA.unpackEncodedString(DFA27_acceptS);
+    static final short[] DFA27_special = DFA.unpackEncodedString(DFA27_specialS);
+    static final short[][] DFA27_transition;
+
+    static {
+        int numStates = DFA27_transitionS.length;
+        DFA27_transition = new short[numStates][];
+        for (int i=0; i<numStates; i++) {
+            DFA27_transition[i] = DFA.unpackEncodedString(DFA27_transitionS[i]);
+        }
+    }
+
+    class DFA27 extends DFA {
+
+        public DFA27(BaseRecognizer recognizer) {
+            this.recognizer = recognizer;
+            this.decisionNumber = 27;
+            this.eot = DFA27_eot;
+            this.eof = DFA27_eof;
+            this.min = DFA27_min;
+            this.max = DFA27_max;
+            this.accept = DFA27_accept;
+            this.special = DFA27_special;
+            this.transition = DFA27_transition;
+        }
+        public String getDescription() {
+            return "()+ loopback of 472:15: ( ( TERM_CHAR )+ ( QMARK | STAR ) )+";
+        }
+        public int specialStateTransition(int s, IntStream _input) throws NoViableAltException {
+            IntStream input = _input;
+        	int _s = s;
+            switch ( s ) {
+                    case 0 : 
+                        int LA27_2 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA27_2 >= '\u0000' && LA27_2 <= '\uFFFF')) ) {s = 7;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 1 : 
+                        int LA27_4 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA27_4 >= '\u0000' && LA27_4 <= '\b')||(LA27_4 >= '\u000B' && LA27_4 <= '\f')||(LA27_4 >= '\u000E' && LA27_4 <= '\u001F')||(LA27_4 >= '#' && LA27_4 <= '&')||LA27_4==','||(LA27_4 >= '.' && LA27_4 <= '9')||(LA27_4 >= ';' && LA27_4 <= '>')||(LA27_4 >= '@' && LA27_4 <= 'Z')||(LA27_4 >= '_' && LA27_4 <= 'z')||LA27_4=='|'||(LA27_4 >= '\u007F' && LA27_4 <= '\u2FFF')||(LA27_4 >= '\u3001' && LA27_4 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA27_4=='\\') ) {s = 2;}
+
+                        else if ( (LA27_4=='-') ) {s = 3;}
+
+                        else if ( (LA27_4=='+') ) {s = 4;}
+
+                        else if ( (LA27_4=='*'||LA27_4=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 2 : 
+                        int LA27_3 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA27_3 >= '\u0000' && LA27_3 <= '\b')||(LA27_3 >= '\u000B' && LA27_3 <= '\f')||(LA27_3 >= '\u000E' && LA27_3 <= '\u001F')||(LA27_3 >= '#' && LA27_3 <= '&')||LA27_3==','||(LA27_3 >= '.' && LA27_3 <= '9')||(LA27_3 >= ';' && LA27_3 <= '>')||(LA27_3 >= '@' && LA27_3 <= 'Z')||(LA27_3 >= '_' && LA27_3 <= 'z')||LA27_3=='|'||(LA27_3 >= '\u007F' && LA27_3 <= '\u2FFF')||(LA27_3 >= '\u3001' && LA27_3 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA27_3=='\\') ) {s = 2;}
+
+                        else if ( (LA27_3=='-') ) {s = 3;}
+
+                        else if ( (LA27_3=='+') ) {s = 4;}
+
+                        else if ( (LA27_3=='*'||LA27_3=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 3 : 
+                        int LA27_0 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA27_0 >= '\u0000' && LA27_0 <= '\b')||(LA27_0 >= '\u000B' && LA27_0 <= '\f')||(LA27_0 >= '\u000E' && LA27_0 <= '\u001F')||(LA27_0 >= '#' && LA27_0 <= '&')||LA27_0==','||(LA27_0 >= '.' && LA27_0 <= '9')||(LA27_0 >= ';' && LA27_0 <= '>')||(LA27_0 >= '@' && LA27_0 <= 'Z')||(LA27_0 >= '_' && LA27_0 <= 'z')||LA27_0=='|'||(LA27_0 >= '\u007F' && LA27_0 <= '\u2FFF')||(LA27_0 >= '\u3001' && LA27_0 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA27_0=='\\') ) {s = 2;}
+
+                        else if ( (LA27_0=='-') ) {s = 3;}
+
+                        else if ( (LA27_0=='+') ) {s = 4;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 4 : 
+                        int LA27_7 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA27_7 >= '\u0000' && LA27_7 <= '\b')||(LA27_7 >= '\u000B' && LA27_7 <= '\f')||(LA27_7 >= '\u000E' && LA27_7 <= '\u001F')||(LA27_7 >= '#' && LA27_7 <= '&')||LA27_7==','||(LA27_7 >= '.' && LA27_7 <= '9')||(LA27_7 >= ';' && LA27_7 <= '>')||(LA27_7 >= '@' && LA27_7 <= 'Z')||(LA27_7 >= '_' && LA27_7 <= 'z')||LA27_7=='|'||(LA27_7 >= '\u007F' && LA27_7 <= '\u2FFF')||(LA27_7 >= '\u3001' && LA27_7 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA27_7=='\\') ) {s = 2;}
+
+                        else if ( (LA27_7=='-') ) {s = 3;}
+
+                        else if ( (LA27_7=='+') ) {s = 4;}
+
+                        else if ( (LA27_7=='*'||LA27_7=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 5 : 
+                        int LA27_1 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA27_1 >= '\u0000' && LA27_1 <= '\b')||(LA27_1 >= '\u000B' && LA27_1 <= '\f')||(LA27_1 >= '\u000E' && LA27_1 <= '\u001F')||(LA27_1 >= '#' && LA27_1 <= '&')||LA27_1==','||(LA27_1 >= '.' && LA27_1 <= '9')||(LA27_1 >= ';' && LA27_1 <= '>')||(LA27_1 >= '@' && LA27_1 <= 'Z')||(LA27_1 >= '_' && LA27_1 <= 'z')||LA27_1=='|'||(LA27_1 >= '\u007F' && LA27_1 <= '\u2FFF')||(LA27_1 >= '\u3001' && LA27_1 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA27_1=='\\') ) {s = 2;}
+
+                        else if ( (LA27_1=='-') ) {s = 3;}
+
+                        else if ( (LA27_1=='+') ) {s = 4;}
+
+                        else if ( (LA27_1=='*'||LA27_1=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+            }
+            NoViableAltException nvae =
+                new NoViableAltException(getDescription(), 27, _s, input);
+            error(nvae);
+            throw nvae;
+        }
+
+    }
+    static final String DFA31_eotS =
+        "\2\5\1\uffff\2\5\2\uffff\1\5";
+    static final String DFA31_eofS =
+        "\10\uffff";
+    static final String DFA31_minS =
+        "\5\0\2\uffff\1\0";
+    static final String DFA31_maxS =
+        "\5\uffff\2\uffff\1\uffff";
+    static final String DFA31_acceptS =
+        "\5\uffff\1\2\1\1\1\uffff";
+    static final String DFA31_specialS =
+        "\1\5\1\3\1\0\1\2\1\4\2\uffff\1\1}>";
+    static final String[] DFA31_transitionS = {
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4\1"+
+            "\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1\1"+
+            "\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "\0\7",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1",
+            "",
+            "",
+            "\11\1\2\uffff\2\1\1\uffff\22\1\3\uffff\4\1\3\uffff\1\6\1\4"+
+            "\1\1\1\3\14\1\1\uffff\4\1\1\6\33\1\1\uffff\1\2\2\uffff\34\1"+
+            "\1\uffff\1\1\2\uffff\u2f81\1\1\uffff\ucfff\1"
+    };
+
+    static final short[] DFA31_eot = DFA.unpackEncodedString(DFA31_eotS);
+    static final short[] DFA31_eof = DFA.unpackEncodedString(DFA31_eofS);
+    static final char[] DFA31_min = DFA.unpackEncodedStringToUnsignedChars(DFA31_minS);
+    static final char[] DFA31_max = DFA.unpackEncodedStringToUnsignedChars(DFA31_maxS);
+    static final short[] DFA31_accept = DFA.unpackEncodedString(DFA31_acceptS);
+    static final short[] DFA31_special = DFA.unpackEncodedString(DFA31_specialS);
+    static final short[][] DFA31_transition;
+
+    static {
+        int numStates = DFA31_transitionS.length;
+        DFA31_transition = new short[numStates][];
+        for (int i=0; i<numStates; i++) {
+            DFA31_transition[i] = DFA.unpackEncodedString(DFA31_transitionS[i]);
+        }
+    }
+
+    class DFA31 extends DFA {
+
+        public DFA31(BaseRecognizer recognizer) {
+            this.recognizer = recognizer;
+            this.decisionNumber = 31;
+            this.eot = DFA31_eot;
+            this.eof = DFA31_eof;
+            this.min = DFA31_min;
+            this.max = DFA31_max;
+            this.accept = DFA31_accept;
+            this.special = DFA31_special;
+            this.transition = DFA31_transition;
+        }
+        public String getDescription() {
+            return "()+ loopback of 473:20: ( ( TERM_CHAR )* ( QMARK | STAR ) )+";
+        }
+        public int specialStateTransition(int s, IntStream _input) throws NoViableAltException {
+            IntStream input = _input;
+        	int _s = s;
+            switch ( s ) {
+                    case 0 : 
+                        int LA31_2 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA31_2 >= '\u0000' && LA31_2 <= '\uFFFF')) ) {s = 7;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 1 : 
+                        int LA31_7 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA31_7 >= '\u0000' && LA31_7 <= '\b')||(LA31_7 >= '\u000B' && LA31_7 <= '\f')||(LA31_7 >= '\u000E' && LA31_7 <= '\u001F')||(LA31_7 >= '#' && LA31_7 <= '&')||LA31_7==','||(LA31_7 >= '.' && LA31_7 <= '9')||(LA31_7 >= ';' && LA31_7 <= '>')||(LA31_7 >= '@' && LA31_7 <= 'Z')||(LA31_7 >= '_' && LA31_7 <= 'z')||LA31_7=='|'||(LA31_7 >= '\u007F' && LA31_7 <= '\u2FFF')||(LA31_7 >= '\u3001' && LA31_7 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA31_7=='\\') ) {s = 2;}
+
+                        else if ( (LA31_7=='-') ) {s = 3;}
+
+                        else if ( (LA31_7=='+') ) {s = 4;}
+
+                        else if ( (LA31_7=='*'||LA31_7=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 2 : 
+                        int LA31_3 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA31_3 >= '\u0000' && LA31_3 <= '\b')||(LA31_3 >= '\u000B' && LA31_3 <= '\f')||(LA31_3 >= '\u000E' && LA31_3 <= '\u001F')||(LA31_3 >= '#' && LA31_3 <= '&')||LA31_3==','||(LA31_3 >= '.' && LA31_3 <= '9')||(LA31_3 >= ';' && LA31_3 <= '>')||(LA31_3 >= '@' && LA31_3 <= 'Z')||(LA31_3 >= '_' && LA31_3 <= 'z')||LA31_3=='|'||(LA31_3 >= '\u007F' && LA31_3 <= '\u2FFF')||(LA31_3 >= '\u3001' && LA31_3 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA31_3=='\\') ) {s = 2;}
+
+                        else if ( (LA31_3=='-') ) {s = 3;}
+
+                        else if ( (LA31_3=='+') ) {s = 4;}
+
+                        else if ( (LA31_3=='*'||LA31_3=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 3 : 
+                        int LA31_1 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA31_1 >= '\u0000' && LA31_1 <= '\b')||(LA31_1 >= '\u000B' && LA31_1 <= '\f')||(LA31_1 >= '\u000E' && LA31_1 <= '\u001F')||(LA31_1 >= '#' && LA31_1 <= '&')||LA31_1==','||(LA31_1 >= '.' && LA31_1 <= '9')||(LA31_1 >= ';' && LA31_1 <= '>')||(LA31_1 >= '@' && LA31_1 <= 'Z')||(LA31_1 >= '_' && LA31_1 <= 'z')||LA31_1=='|'||(LA31_1 >= '\u007F' && LA31_1 <= '\u2FFF')||(LA31_1 >= '\u3001' && LA31_1 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA31_1=='\\') ) {s = 2;}
+
+                        else if ( (LA31_1=='-') ) {s = 3;}
+
+                        else if ( (LA31_1=='+') ) {s = 4;}
+
+                        else if ( (LA31_1=='*'||LA31_1=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 4 : 
+                        int LA31_4 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA31_4 >= '\u0000' && LA31_4 <= '\b')||(LA31_4 >= '\u000B' && LA31_4 <= '\f')||(LA31_4 >= '\u000E' && LA31_4 <= '\u001F')||(LA31_4 >= '#' && LA31_4 <= '&')||LA31_4==','||(LA31_4 >= '.' && LA31_4 <= '9')||(LA31_4 >= ';' && LA31_4 <= '>')||(LA31_4 >= '@' && LA31_4 <= 'Z')||(LA31_4 >= '_' && LA31_4 <= 'z')||LA31_4=='|'||(LA31_4 >= '\u007F' && LA31_4 <= '\u2FFF')||(LA31_4 >= '\u3001' && LA31_4 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA31_4=='\\') ) {s = 2;}
+
+                        else if ( (LA31_4=='-') ) {s = 3;}
+
+                        else if ( (LA31_4=='+') ) {s = 4;}
+
+                        else if ( (LA31_4=='*'||LA31_4=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 5 : 
+                        int LA31_0 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA31_0 >= '\u0000' && LA31_0 <= '\b')||(LA31_0 >= '\u000B' && LA31_0 <= '\f')||(LA31_0 >= '\u000E' && LA31_0 <= '\u001F')||(LA31_0 >= '#' && LA31_0 <= '&')||LA31_0==','||(LA31_0 >= '.' && LA31_0 <= '9')||(LA31_0 >= ';' && LA31_0 <= '>')||(LA31_0 >= '@' && LA31_0 <= 'Z')||(LA31_0 >= '_' && LA31_0 <= 'z')||LA31_0=='|'||(LA31_0 >= '\u007F' && LA31_0 <= '\u2FFF')||(LA31_0 >= '\u3001' && LA31_0 <= '\uFFFF')) ) {s = 1;}
+
+                        else if ( (LA31_0=='\\') ) {s = 2;}
+
+                        else if ( (LA31_0=='-') ) {s = 3;}
+
+                        else if ( (LA31_0=='+') ) {s = 4;}
+
+                        else if ( (LA31_0=='*'||LA31_0=='?') ) {s = 6;}
+
+                        else s = 5;
+
+                        if ( s>=0 ) return s;
+                        break;
+            }
+            NoViableAltException nvae =
+                new NoViableAltException(getDescription(), 31, _s, input);
+            error(nvae);
+            throw nvae;
+        }
+
+    }
+    static final String DFA38_eotS =
+        "\10\uffff\1\32\1\34\4\uffff\1\35\1\uffff\2\42\1\50\1\42\1\53\1\42"+
+        "\1\uffff\1\60\1\42\10\uffff\1\67\1\uffff\1\42\1\uffff\3\42\1\uffff"+
+        "\1\50\1\53\1\uffff\1\53\3\42\1\uffff\1\60\3\42\3\uffff\1\42\1\50"+
+        "\1\100\1\42\2\60\1\42\2\uffff\1\110\1\60\4\42\1\110\1\uffff\1\60"+
+        "\1\42\1\114\1\uffff\1\42\1\114";
+    static final String DFA38_eofS =
+        "\117\uffff";
+    static final String DFA38_minS =
+        "\1\0\7\uffff\2\0\4\uffff\1\0\1\uffff\6\0\1\uffff\3\0\4\uffff\2\0"+
+        "\1\uffff\1\0\1\uffff\5\0\1\uffff\2\0\1\uffff\4\0\1\uffff\5\0\2\uffff"+
+        "\7\0\2\uffff\7\0\1\uffff\3\0\1\uffff\2\0";
+    static final String DFA38_maxS =
+        "\1\uffff\7\uffff\2\uffff\4\uffff\1\uffff\1\uffff\6\uffff\1\uffff"+
+        "\3\uffff\4\uffff\2\uffff\1\uffff\1\uffff\1\uffff\5\uffff\1\uffff"+
+        "\2\uffff\1\uffff\4\uffff\1\uffff\5\uffff\2\uffff\7\uffff\2\uffff"+
+        "\7\uffff\1\uffff\3\uffff\1\uffff\2\uffff";
+    static final String DFA38_acceptS =
+        "\1\uffff\1\1\1\2\1\3\1\4\1\5\1\6\1\7\2\uffff\1\12\1\13\1\14\1\15"+
+        "\1\uffff\1\17\6\uffff\1\25\3\uffff\1\10\1\31\1\11\1\16\2\uffff\1"+
+        "\33\1\uffff\1\30\5\uffff\1\21\2\uffff\1\22\4\uffff\1\26\5\uffff"+
+        "\1\32\1\20\7\uffff\1\32\1\23\7\uffff\1\24\3\uffff\1\27\2\uffff";
+    static final String DFA38_specialS =
+        "\1\32\7\uffff\1\62\1\43\4\uffff\1\4\1\uffff\1\35\1\25\1\31\1\15"+
+        "\1\44\1\36\1\uffff\1\41\1\45\1\52\4\uffff\1\46\1\11\1\uffff\1\34"+
+        "\1\uffff\1\21\1\53\1\14\1\16\1\51\1\uffff\1\37\1\60\1\uffff\1\10"+
+        "\1\2\1\27\1\6\1\uffff\1\54\1\55\1\61\1\26\1\3\2\uffff\1\50\1\1\1"+
+        "\17\1\30\1\42\1\23\1\0\2\uffff\1\22\1\40\1\47\1\57\1\33\1\7\1\13"+
+        "\1\uffff\1\5\1\20\1\12\1\uffff\1\24\1\56}>";
+    static final String[] DFA38_transitionS = {
+            "\11\30\2\26\2\30\1\26\22\30\1\26\1\7\1\16\3\30\1\22\1\17\1\1"+
+            "\1\2\1\10\1\6\1\30\1\7\2\30\12\27\1\5\4\30\1\11\1\30\1\21\14"+
+            "\30\1\25\1\23\4\30\1\20\6\30\1\3\1\31\1\4\1\14\2\30\1\21\14"+
+            "\30\1\25\1\23\13\30\1\12\1\24\1\13\1\15\u2f81\30\1\26\ucfff"+
+            "\30",
+            "",
+            "",
+            "",
+            "",
+            "",
+            "",
+            "",
+            "\11\33\2\uffff\2\33\1\uffff\22\33\3\uffff\4\33\4\uffff\17\33"+
+            "\1\uffff\4\33\1\uffff\33\33\1\uffff\1\33\2\uffff\34\33\1\uffff"+
+            "\1\33\2\uffff\u2f81\33\1\uffff\ucfff\33",
+            "\11\33\2\uffff\2\33\1\uffff\22\33\3\uffff\4\33\4\uffff\17\33"+
+            "\1\uffff\4\33\1\11\33\33\1\uffff\1\33\2\uffff\34\33\1\uffff"+
+            "\1\33\2\uffff\u2f81\33\1\uffff\ucfff\33",
+            "",
+            "",
+            "",
+            "",
+            "\42\37\1\uffff\7\37\1\40\24\37\1\40\34\37\1\36\uffa3\37",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\17\43\1\41\13\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\16\43\1\47\14\43\1\uffff"+
+            "\1\44\2\uffff\17\43\1\47\14\43\1\uffff\1\43\2\uffff\u2f81\43"+
+            "\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\3\43\1\51\3\uffff"+
+            "\1\33\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1"+
+            "\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\22\43\1\52\10\43\1\uffff"+
+            "\1\44\2\uffff\23\43\1\52\10\43\1\uffff\1\43\2\uffff\u2f81\43"+
+            "\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\54\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\5\43\1\56\11\43\1\55"+
+            "\13\43\1\uffff\1\44\2\uffff\6\43\1\56\11\43\1\55\13\43\1\uffff"+
+            "\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\63\1\57\1\62\12\61\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\0\64",
+            "",
+            "",
+            "",
+            "",
+            "\0\65",
+            "\42\37\1\66\7\37\1\40\24\37\1\40\34\37\1\36\uffa3\37",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\0\70",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\4\43\1\71\26\43\1\uffff"+
+            "\1\44\2\uffff\5\43\1\71\26\43\1\uffff\1\43\2\uffff\u2f81\43"+
+            "\1\uffff\ucfff\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\24\43\1\72\6\43\1\uffff"+
+            "\1\44\2\uffff\25\43\1\72\6\43\1\uffff\1\43\2\uffff\u2f81\43"+
+            "\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\1\43\1\73\31\43\1\uffff"+
+            "\1\44\2\uffff\2\43\1\73\31\43\1\uffff\1\43\2\uffff\u2f81\43"+
+            "\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\74\1\uffff\4\43\1\33\33\43\1\uffff\1"+
+            "\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\63\1\57\1\62\12\75\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\76\1\uffff\4\43\1\33\33\43\1\uffff\1"+
+            "\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\76\1\uffff\4\43\1\33\33\43\1\uffff\1"+
+            "\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\42\37\1\66\7\37\1\40\24\37\1\40\34\37\1\36\uffa3\37",
+            "",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\22\43\1\101\10\43\1"+
+            "\uffff\1\44\2\uffff\23\43\1\101\10\43\1\uffff\1\43\2\uffff\u2f81"+
+            "\43\1\uffff\ucfff\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\104\2\103\12\102\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\1\105\1\43\12\75\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\104\2\103\12\106\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\107\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\104\2\103\12\111\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\112\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\112\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\111\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\104\2\103\12\43\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\107\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\111\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\113\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\115\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\2\43\12\116\1\uffff\4\43\1\33\33\43\1\uffff"+
+            "\1\44\2\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff"+
+            "\43",
+            "\11\43\2\uffff\2\43\1\uffff\22\43\3\uffff\4\43\3\uffff\1\33"+
+            "\1\46\1\43\1\45\14\43\1\uffff\4\43\1\33\33\43\1\uffff\1\44\2"+
+            "\uffff\34\43\1\uffff\1\43\2\uffff\u2f81\43\1\uffff\ucfff\43"
+    };
+
+    static final short[] DFA38_eot = DFA.unpackEncodedString(DFA38_eotS);
+    static final short[] DFA38_eof = DFA.unpackEncodedString(DFA38_eofS);
+    static final char[] DFA38_min = DFA.unpackEncodedStringToUnsignedChars(DFA38_minS);
+    static final char[] DFA38_max = DFA.unpackEncodedStringToUnsignedChars(DFA38_maxS);
+    static final short[] DFA38_accept = DFA.unpackEncodedString(DFA38_acceptS);
+    static final short[] DFA38_special = DFA.unpackEncodedString(DFA38_specialS);
+    static final short[][] DFA38_transition;
+
+    static {
+        int numStates = DFA38_transitionS.length;
+        DFA38_transition = new short[numStates][];
+        for (int i=0; i<numStates; i++) {
+            DFA38_transition[i] = DFA.unpackEncodedString(DFA38_transitionS[i]);
+        }
+    }
+
+    class DFA38 extends DFA {
+
+        public DFA38(BaseRecognizer recognizer) {
+            this.recognizer = recognizer;
+            this.decisionNumber = 38;
+            this.eot = DFA38_eot;
+            this.eof = DFA38_eof;
+            this.min = DFA38_min;
+            this.max = DFA38_max;
+            this.accept = DFA38_accept;
+            this.special = DFA38_special;
+            this.transition = DFA38_transition;
+        }
+        public String getDescription() {
+            return "1:1: Tokens : ( LPAREN | RPAREN | LBRACK | RBRACK | COLON | PLUS | MINUS | STAR | QMARK | LCURLY | RCURLY | CARAT | TILDE | DQUOTE | SQUOTE | TO | AND | OR | NOT | NEAR | WS | NUMBER | DATE_TOKEN | TERM_NORMAL | TERM_TRUNCATED | PHRASE | PHRASE_ANYTHING );";
+        }
+        public int specialStateTransition(int s, IntStream _input) throws NoViableAltException {
+            IntStream input = _input;
+        	int _s = s;
+            switch ( s ) {
+                    case 0 : 
+                        int LA38_62 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_62 >= '0' && LA38_62 <= '9')) ) {s = 70;}
+
+                        else if ( ((LA38_62 >= '.' && LA38_62 <= '/')) ) {s = 67;}
+
+                        else if ( (LA38_62=='-') ) {s = 68;}
+
+                        else if ( ((LA38_62 >= '\u0000' && LA38_62 <= '\b')||(LA38_62 >= '\u000B' && LA38_62 <= '\f')||(LA38_62 >= '\u000E' && LA38_62 <= '\u001F')||(LA38_62 >= '#' && LA38_62 <= '&')||LA38_62==','||(LA38_62 >= ';' && LA38_62 <= '>')||(LA38_62 >= '@' && LA38_62 <= 'Z')||(LA38_62 >= '_' && LA38_62 <= 'z')||LA38_62=='|'||(LA38_62 >= '\u007F' && LA38_62 <= '\u2FFF')||(LA38_62 >= '\u3001' && LA38_62 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_62=='\\') ) {s = 36;}
+
+                        else if ( (LA38_62=='+') ) {s = 38;}
+
+                        else if ( (LA38_62=='*'||LA38_62=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 1 : 
+                        int LA38_57 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_57 >= '\u0000' && LA38_57 <= '\b')||(LA38_57 >= '\u000B' && LA38_57 <= '\f')||(LA38_57 >= '\u000E' && LA38_57 <= '\u001F')||(LA38_57 >= '#' && LA38_57 <= '&')||LA38_57==','||(LA38_57 >= '.' && LA38_57 <= '9')||(LA38_57 >= ';' && LA38_57 <= '>')||(LA38_57 >= '@' && LA38_57 <= 'Z')||(LA38_57 >= '_' && LA38_57 <= 'z')||LA38_57=='|'||(LA38_57 >= '\u007F' && LA38_57 <= '\u2FFF')||(LA38_57 >= '\u3001' && LA38_57 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_57=='\\') ) {s = 36;}
+
+                        else if ( (LA38_57=='-') ) {s = 37;}
+
+                        else if ( (LA38_57=='+') ) {s = 38;}
+
+                        else if ( (LA38_57=='*'||LA38_57=='?') ) {s = 27;}
+
+                        else s = 40;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 2 : 
+                        int LA38_45 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_45=='T'||LA38_45=='t') ) {s = 58;}
+
+                        else if ( ((LA38_45 >= '\u0000' && LA38_45 <= '\b')||(LA38_45 >= '\u000B' && LA38_45 <= '\f')||(LA38_45 >= '\u000E' && LA38_45 <= '\u001F')||(LA38_45 >= '#' && LA38_45 <= '&')||LA38_45==','||(LA38_45 >= '.' && LA38_45 <= '9')||(LA38_45 >= ';' && LA38_45 <= '>')||(LA38_45 >= '@' && LA38_45 <= 'S')||(LA38_45 >= 'U' && LA38_45 <= 'Z')||(LA38_45 >= '_' && LA38_45 <= 's')||(LA38_45 >= 'u' && LA38_45 <= 'z')||LA38_45=='|'||(LA38_45 >= '\u007F' && LA38_45 <= '\u2FFF')||(LA38_45 >= '\u3001' && LA38_45 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_45=='\\') ) {s = 36;}
+
+                        else if ( (LA38_45=='-') ) {s = 37;}
+
+                        else if ( (LA38_45=='+') ) {s = 38;}
+
+                        else if ( (LA38_45=='*'||LA38_45=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 3 : 
+                        int LA38_53 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_53=='\"') ) {s = 54;}
+
+                        else if ( (LA38_53=='\\') ) {s = 30;}
+
+                        else if ( ((LA38_53 >= '\u0000' && LA38_53 <= '!')||(LA38_53 >= '#' && LA38_53 <= ')')||(LA38_53 >= '+' && LA38_53 <= '>')||(LA38_53 >= '@' && LA38_53 <= '[')||(LA38_53 >= ']' && LA38_53 <= '\uFFFF')) ) {s = 31;}
+
+                        else if ( (LA38_53=='*'||LA38_53=='?') ) {s = 32;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 4 : 
+                        int LA38_14 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_14=='\\') ) {s = 30;}
+
+                        else if ( ((LA38_14 >= '\u0000' && LA38_14 <= '!')||(LA38_14 >= '#' && LA38_14 <= ')')||(LA38_14 >= '+' && LA38_14 <= '>')||(LA38_14 >= '@' && LA38_14 <= '[')||(LA38_14 >= ']' && LA38_14 <= '\uFFFF')) ) {s = 31;}
+
+                        else if ( (LA38_14=='*'||LA38_14=='?') ) {s = 32;}
+
+                        else s = 29;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 5 : 
+                        int LA38_73 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_73 >= '0' && LA38_73 <= '9')) ) {s = 73;}
+
+                        else if ( ((LA38_73 >= '\u0000' && LA38_73 <= '\b')||(LA38_73 >= '\u000B' && LA38_73 <= '\f')||(LA38_73 >= '\u000E' && LA38_73 <= '\u001F')||(LA38_73 >= '#' && LA38_73 <= '&')||LA38_73==','||(LA38_73 >= '.' && LA38_73 <= '/')||(LA38_73 >= ';' && LA38_73 <= '>')||(LA38_73 >= '@' && LA38_73 <= 'Z')||(LA38_73 >= '_' && LA38_73 <= 'z')||LA38_73=='|'||(LA38_73 >= '\u007F' && LA38_73 <= '\u2FFF')||(LA38_73 >= '\u3001' && LA38_73 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_73=='\\') ) {s = 36;}
+
+                        else if ( (LA38_73=='-') ) {s = 37;}
+
+                        else if ( (LA38_73=='+') ) {s = 38;}
+
+                        else if ( (LA38_73=='*'||LA38_73=='?') ) {s = 27;}
+
+                        else s = 48;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 6 : 
+                        int LA38_47 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_47 >= '0' && LA38_47 <= '9')) ) {s = 60;}
+
+                        else if ( ((LA38_47 >= '\u0000' && LA38_47 <= '\b')||(LA38_47 >= '\u000B' && LA38_47 <= '\f')||(LA38_47 >= '\u000E' && LA38_47 <= '\u001F')||(LA38_47 >= '#' && LA38_47 <= '&')||LA38_47==','||(LA38_47 >= '.' && LA38_47 <= '/')||(LA38_47 >= ';' && LA38_47 <= '>')||(LA38_47 >= '@' && LA38_47 <= 'Z')||(LA38_47 >= '_' && LA38_47 <= 'z')||LA38_47=='|'||(LA38_47 >= '\u007F' && LA38_47 <= '\u2FFF')||(LA38_47 >= '\u3001' && LA38_47 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_47=='\\') ) {s = 36;}
+
+                        else if ( (LA38_47=='-') ) {s = 37;}
+
+                        else if ( (LA38_47=='+') ) {s = 38;}
+
+                        else if ( (LA38_47=='*'||LA38_47=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 7 : 
+                        int LA38_70 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_70 >= '.' && LA38_70 <= '/')) ) {s = 67;}
+
+                        else if ( (LA38_70=='-') ) {s = 68;}
+
+                        else if ( ((LA38_70 >= '\u0000' && LA38_70 <= '\b')||(LA38_70 >= '\u000B' && LA38_70 <= '\f')||(LA38_70 >= '\u000E' && LA38_70 <= '\u001F')||(LA38_70 >= '#' && LA38_70 <= '&')||LA38_70==','||(LA38_70 >= '0' && LA38_70 <= '9')||(LA38_70 >= ';' && LA38_70 <= '>')||(LA38_70 >= '@' && LA38_70 <= 'Z')||(LA38_70 >= '_' && LA38_70 <= 'z')||LA38_70=='|'||(LA38_70 >= '\u007F' && LA38_70 <= '\u2FFF')||(LA38_70 >= '\u3001' && LA38_70 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_70=='\\') ) {s = 36;}
+
+                        else if ( (LA38_70=='+') ) {s = 38;}
+
+                        else if ( (LA38_70=='*'||LA38_70=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 8 : 
+                        int LA38_44 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_44 >= '\u0000' && LA38_44 <= '\b')||(LA38_44 >= '\u000B' && LA38_44 <= '\f')||(LA38_44 >= '\u000E' && LA38_44 <= '\u001F')||(LA38_44 >= '#' && LA38_44 <= '&')||LA38_44==','||(LA38_44 >= '.' && LA38_44 <= '9')||(LA38_44 >= ';' && LA38_44 <= '>')||(LA38_44 >= '@' && LA38_44 <= 'Z')||(LA38_44 >= '_' && LA38_44 <= 'z')||LA38_44=='|'||(LA38_44 >= '\u007F' && LA38_44 <= '\u2FFF')||(LA38_44 >= '\u3001' && LA38_44 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_44=='\\') ) {s = 36;}
+
+                        else if ( (LA38_44=='-') ) {s = 37;}
+
+                        else if ( (LA38_44=='+') ) {s = 38;}
+
+                        else if ( (LA38_44=='*'||LA38_44=='?') ) {s = 27;}
+
+                        else s = 43;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 9 : 
+                        int LA38_31 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_31=='\"') ) {s = 54;}
+
+                        else if ( (LA38_31=='\\') ) {s = 30;}
+
+                        else if ( ((LA38_31 >= '\u0000' && LA38_31 <= '!')||(LA38_31 >= '#' && LA38_31 <= ')')||(LA38_31 >= '+' && LA38_31 <= '>')||(LA38_31 >= '@' && LA38_31 <= '[')||(LA38_31 >= ']' && LA38_31 <= '\uFFFF')) ) {s = 31;}
+
+                        else if ( (LA38_31=='*'||LA38_31=='?') ) {s = 32;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 10 : 
+                        int LA38_75 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_75 >= '0' && LA38_75 <= '9')) ) {s = 77;}
+
+                        else if ( ((LA38_75 >= '\u0000' && LA38_75 <= '\b')||(LA38_75 >= '\u000B' && LA38_75 <= '\f')||(LA38_75 >= '\u000E' && LA38_75 <= '\u001F')||(LA38_75 >= '#' && LA38_75 <= '&')||LA38_75==','||(LA38_75 >= '.' && LA38_75 <= '/')||(LA38_75 >= ';' && LA38_75 <= '>')||(LA38_75 >= '@' && LA38_75 <= 'Z')||(LA38_75 >= '_' && LA38_75 <= 'z')||LA38_75=='|'||(LA38_75 >= '\u007F' && LA38_75 <= '\u2FFF')||(LA38_75 >= '\u3001' && LA38_75 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_75=='\\') ) {s = 36;}
+
+                        else if ( (LA38_75=='-') ) {s = 37;}
+
+                        else if ( (LA38_75=='+') ) {s = 38;}
+
+                        else if ( (LA38_75=='*'||LA38_75=='?') ) {s = 27;}
+
+                        else s = 76;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 11 : 
+                        int LA38_71 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_71 >= '0' && LA38_71 <= '9')) ) {s = 71;}
+
+                        else if ( ((LA38_71 >= '\u0000' && LA38_71 <= '\b')||(LA38_71 >= '\u000B' && LA38_71 <= '\f')||(LA38_71 >= '\u000E' && LA38_71 <= '\u001F')||(LA38_71 >= '#' && LA38_71 <= '&')||LA38_71==','||(LA38_71 >= '.' && LA38_71 <= '/')||(LA38_71 >= ';' && LA38_71 <= '>')||(LA38_71 >= '@' && LA38_71 <= 'Z')||(LA38_71 >= '_' && LA38_71 <= 'z')||LA38_71=='|'||(LA38_71 >= '\u007F' && LA38_71 <= '\u2FFF')||(LA38_71 >= '\u3001' && LA38_71 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_71=='\\') ) {s = 36;}
+
+                        else if ( (LA38_71=='-') ) {s = 37;}
+
+                        else if ( (LA38_71=='+') ) {s = 38;}
+
+                        else if ( (LA38_71=='*'||LA38_71=='?') ) {s = 27;}
+
+                        else s = 72;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 12 : 
+                        int LA38_37 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_37 >= '\u0000' && LA38_37 <= '\b')||(LA38_37 >= '\u000B' && LA38_37 <= '\f')||(LA38_37 >= '\u000E' && LA38_37 <= '\u001F')||(LA38_37 >= '#' && LA38_37 <= '&')||LA38_37==','||(LA38_37 >= '.' && LA38_37 <= '9')||(LA38_37 >= ';' && LA38_37 <= '>')||(LA38_37 >= '@' && LA38_37 <= 'Z')||(LA38_37 >= '_' && LA38_37 <= 'z')||LA38_37=='|'||(LA38_37 >= '\u007F' && LA38_37 <= '\u2FFF')||(LA38_37 >= '\u3001' && LA38_37 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_37=='\\') ) {s = 36;}
+
+                        else if ( (LA38_37=='-') ) {s = 37;}
+
+                        else if ( (LA38_37=='+') ) {s = 38;}
+
+                        else if ( (LA38_37=='*'||LA38_37=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 13 : 
+                        int LA38_19 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_19=='R'||LA38_19=='r') ) {s = 42;}
+
+                        else if ( ((LA38_19 >= '\u0000' && LA38_19 <= '\b')||(LA38_19 >= '\u000B' && LA38_19 <= '\f')||(LA38_19 >= '\u000E' && LA38_19 <= '\u001F')||(LA38_19 >= '#' && LA38_19 <= '&')||LA38_19==','||(LA38_19 >= '.' && LA38_19 <= '9')||(LA38_19 >= ';' && LA38_19 <= '>')||(LA38_19 >= '@' && LA38_19 <= 'Q')||(LA38_19 >= 'S' && LA38_19 <= 'Z')||(LA38_19 >= '_' && LA38_19 <= 'q')||(LA38_19 >= 's' && LA38_19 <= 'z')||LA38_19=='|'||(LA38_19 >= '\u007F' && LA38_19 <= '\u2FFF')||(LA38_19 >= '\u3001' && LA38_19 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_19=='\\') ) {s = 36;}
+
+                        else if ( (LA38_19=='-') ) {s = 37;}
+
+                        else if ( (LA38_19=='+') ) {s = 38;}
+
+                        else if ( (LA38_19=='*'||LA38_19=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 14 : 
+                        int LA38_38 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_38 >= '\u0000' && LA38_38 <= '\b')||(LA38_38 >= '\u000B' && LA38_38 <= '\f')||(LA38_38 >= '\u000E' && LA38_38 <= '\u001F')||(LA38_38 >= '#' && LA38_38 <= '&')||LA38_38==','||(LA38_38 >= '.' && LA38_38 <= '9')||(LA38_38 >= ';' && LA38_38 <= '>')||(LA38_38 >= '@' && LA38_38 <= 'Z')||(LA38_38 >= '_' && LA38_38 <= 'z')||LA38_38=='|'||(LA38_38 >= '\u007F' && LA38_38 <= '\u2FFF')||(LA38_38 >= '\u3001' && LA38_38 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_38=='\\') ) {s = 36;}
+
+                        else if ( (LA38_38=='-') ) {s = 37;}
+
+                        else if ( (LA38_38=='+') ) {s = 38;}
+
+                        else if ( (LA38_38=='*'||LA38_38=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 15 : 
+                        int LA38_58 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_58 >= '\u0000' && LA38_58 <= '\b')||(LA38_58 >= '\u000B' && LA38_58 <= '\f')||(LA38_58 >= '\u000E' && LA38_58 <= '\u001F')||(LA38_58 >= '#' && LA38_58 <= '&')||LA38_58==','||(LA38_58 >= '.' && LA38_58 <= '9')||(LA38_58 >= ';' && LA38_58 <= '>')||(LA38_58 >= '@' && LA38_58 <= 'Z')||(LA38_58 >= '_' && LA38_58 <= 'z')||LA38_58=='|'||(LA38_58 >= '\u007F' && LA38_58 <= '\u2FFF')||(LA38_58 >= '\u3001' && LA38_58 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_58=='\\') ) {s = 36;}
+
+                        else if ( (LA38_58=='-') ) {s = 37;}
+
+                        else if ( (LA38_58=='+') ) {s = 38;}
+
+                        else if ( (LA38_58=='*'||LA38_58=='?') ) {s = 27;}
+
+                        else s = 64;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 16 : 
+                        int LA38_74 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_74 >= '0' && LA38_74 <= '9')) ) {s = 75;}
+
+                        else if ( ((LA38_74 >= '\u0000' && LA38_74 <= '\b')||(LA38_74 >= '\u000B' && LA38_74 <= '\f')||(LA38_74 >= '\u000E' && LA38_74 <= '\u001F')||(LA38_74 >= '#' && LA38_74 <= '&')||LA38_74==','||(LA38_74 >= '.' && LA38_74 <= '/')||(LA38_74 >= ';' && LA38_74 <= '>')||(LA38_74 >= '@' && LA38_74 <= 'Z')||(LA38_74 >= '_' && LA38_74 <= 'z')||LA38_74=='|'||(LA38_74 >= '\u007F' && LA38_74 <= '\u2FFF')||(LA38_74 >= '\u3001' && LA38_74 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_74=='\\') ) {s = 36;}
+
+                        else if ( (LA38_74=='-') ) {s = 37;}
+
+                        else if ( (LA38_74=='+') ) {s = 38;}
+
+                        else if ( (LA38_74=='*'||LA38_74=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 17 : 
+                        int LA38_35 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_35 >= '\u0000' && LA38_35 <= '\b')||(LA38_35 >= '\u000B' && LA38_35 <= '\f')||(LA38_35 >= '\u000E' && LA38_35 <= '\u001F')||(LA38_35 >= '#' && LA38_35 <= '&')||LA38_35==','||(LA38_35 >= '.' && LA38_35 <= '9')||(LA38_35 >= ';' && LA38_35 <= '>')||(LA38_35 >= '@' && LA38_35 <= 'Z')||(LA38_35 >= '_' && LA38_35 <= 'z')||LA38_35=='|'||(LA38_35 >= '\u007F' && LA38_35 <= '\u2FFF')||(LA38_35 >= '\u3001' && LA38_35 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_35=='\\') ) {s = 36;}
+
+                        else if ( (LA38_35=='-') ) {s = 37;}
+
+                        else if ( (LA38_35=='+') ) {s = 38;}
+
+                        else if ( (LA38_35=='*'||LA38_35=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 18 : 
+                        int LA38_65 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_65 >= '0' && LA38_65 <= '9')) ) {s = 71;}
+
+                        else if ( ((LA38_65 >= '\u0000' && LA38_65 <= '\b')||(LA38_65 >= '\u000B' && LA38_65 <= '\f')||(LA38_65 >= '\u000E' && LA38_65 <= '\u001F')||(LA38_65 >= '#' && LA38_65 <= '&')||LA38_65==','||(LA38_65 >= '.' && LA38_65 <= '/')||(LA38_65 >= ';' && LA38_65 <= '>')||(LA38_65 >= '@' && LA38_65 <= 'Z')||(LA38_65 >= '_' && LA38_65 <= 'z')||LA38_65=='|'||(LA38_65 >= '\u007F' && LA38_65 <= '\u2FFF')||(LA38_65 >= '\u3001' && LA38_65 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_65=='\\') ) {s = 36;}
+
+                        else if ( (LA38_65=='-') ) {s = 37;}
+
+                        else if ( (LA38_65=='+') ) {s = 38;}
+
+                        else if ( (LA38_65=='*'||LA38_65=='?') ) {s = 27;}
+
+                        else s = 72;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 19 : 
+                        int LA38_61 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_61=='.') ) {s = 69;}
+
+                        else if ( ((LA38_61 >= '0' && LA38_61 <= '9')) ) {s = 61;}
+
+                        else if ( ((LA38_61 >= '\u0000' && LA38_61 <= '\b')||(LA38_61 >= '\u000B' && LA38_61 <= '\f')||(LA38_61 >= '\u000E' && LA38_61 <= '\u001F')||(LA38_61 >= '#' && LA38_61 <= '&')||LA38_61==','||LA38_61=='/'||(LA38_61 >= ';' && LA38_61 <= '>')||(LA38_61 >= '@' && LA38_61 <= 'Z')||(LA38_61 >= '_' && LA38_61 <= 'z')||LA38_61=='|'||(LA38_61 >= '\u007F' && LA38_61 <= '\u2FFF')||(LA38_61 >= '\u3001' && LA38_61 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_61=='\\') ) {s = 36;}
+
+                        else if ( (LA38_61=='-') ) {s = 37;}
+
+                        else if ( (LA38_61=='+') ) {s = 38;}
+
+                        else if ( (LA38_61=='*'||LA38_61=='?') ) {s = 27;}
+
+                        else s = 48;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 20 : 
+                        int LA38_77 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_77 >= '0' && LA38_77 <= '9')) ) {s = 78;}
+
+                        else if ( ((LA38_77 >= '\u0000' && LA38_77 <= '\b')||(LA38_77 >= '\u000B' && LA38_77 <= '\f')||(LA38_77 >= '\u000E' && LA38_77 <= '\u001F')||(LA38_77 >= '#' && LA38_77 <= '&')||LA38_77==','||(LA38_77 >= '.' && LA38_77 <= '/')||(LA38_77 >= ';' && LA38_77 <= '>')||(LA38_77 >= '@' && LA38_77 <= 'Z')||(LA38_77 >= '_' && LA38_77 <= 'z')||LA38_77=='|'||(LA38_77 >= '\u007F' && LA38_77 <= '\u2FFF')||(LA38_77 >= '\u3001' && LA38_77 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_77=='\\') ) {s = 36;}
+
+                        else if ( (LA38_77=='-') ) {s = 37;}
+
+                        else if ( (LA38_77=='+') ) {s = 38;}
+
+                        else if ( (LA38_77=='*'||LA38_77=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 21 : 
+                        int LA38_17 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_17=='N'||LA38_17=='n') ) {s = 39;}
+
+                        else if ( ((LA38_17 >= '\u0000' && LA38_17 <= '\b')||(LA38_17 >= '\u000B' && LA38_17 <= '\f')||(LA38_17 >= '\u000E' && LA38_17 <= '\u001F')||(LA38_17 >= '#' && LA38_17 <= '&')||LA38_17==','||(LA38_17 >= '.' && LA38_17 <= '9')||(LA38_17 >= ';' && LA38_17 <= '>')||(LA38_17 >= '@' && LA38_17 <= 'M')||(LA38_17 >= 'O' && LA38_17 <= 'Z')||(LA38_17 >= '_' && LA38_17 <= 'm')||(LA38_17 >= 'o' && LA38_17 <= 'z')||LA38_17=='|'||(LA38_17 >= '\u007F' && LA38_17 <= '\u2FFF')||(LA38_17 >= '\u3001' && LA38_17 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_17=='\\') ) {s = 36;}
+
+                        else if ( (LA38_17=='-') ) {s = 37;}
+
+                        else if ( (LA38_17=='+') ) {s = 38;}
+
+                        else if ( (LA38_17=='*'||LA38_17=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 22 : 
+                        int LA38_52 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_52 >= '\u0000' && LA38_52 <= '\b')||(LA38_52 >= '\u000B' && LA38_52 <= '\f')||(LA38_52 >= '\u000E' && LA38_52 <= '\u001F')||(LA38_52 >= '#' && LA38_52 <= '&')||LA38_52==','||(LA38_52 >= '.' && LA38_52 <= '9')||(LA38_52 >= ';' && LA38_52 <= '>')||(LA38_52 >= '@' && LA38_52 <= 'Z')||(LA38_52 >= '_' && LA38_52 <= 'z')||LA38_52=='|'||(LA38_52 >= '\u007F' && LA38_52 <= '\u2FFF')||(LA38_52 >= '\u3001' && LA38_52 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_52=='\\') ) {s = 36;}
+
+                        else if ( (LA38_52=='-') ) {s = 37;}
+
+                        else if ( (LA38_52=='+') ) {s = 38;}
+
+                        else if ( (LA38_52=='*'||LA38_52=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 23 : 
+                        int LA38_46 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_46=='A'||LA38_46=='a') ) {s = 59;}
+
+                        else if ( ((LA38_46 >= '\u0000' && LA38_46 <= '\b')||(LA38_46 >= '\u000B' && LA38_46 <= '\f')||(LA38_46 >= '\u000E' && LA38_46 <= '\u001F')||(LA38_46 >= '#' && LA38_46 <= '&')||LA38_46==','||(LA38_46 >= '.' && LA38_46 <= '9')||(LA38_46 >= ';' && LA38_46 <= '>')||LA38_46=='@'||(LA38_46 >= 'B' && LA38_46 <= 'Z')||(LA38_46 >= '_' && LA38_46 <= '`')||(LA38_46 >= 'b' && LA38_46 <= 'z')||LA38_46=='|'||(LA38_46 >= '\u007F' && LA38_46 <= '\u2FFF')||(LA38_46 >= '\u3001' && LA38_46 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_46=='\\') ) {s = 36;}
+
+                        else if ( (LA38_46=='-') ) {s = 37;}
+
+                        else if ( (LA38_46=='+') ) {s = 38;}
+
+                        else if ( (LA38_46=='*'||LA38_46=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 24 : 
+                        int LA38_59 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_59=='R'||LA38_59=='r') ) {s = 65;}
+
+                        else if ( ((LA38_59 >= '\u0000' && LA38_59 <= '\b')||(LA38_59 >= '\u000B' && LA38_59 <= '\f')||(LA38_59 >= '\u000E' && LA38_59 <= '\u001F')||(LA38_59 >= '#' && LA38_59 <= '&')||LA38_59==','||(LA38_59 >= '.' && LA38_59 <= '9')||(LA38_59 >= ';' && LA38_59 <= '>')||(LA38_59 >= '@' && LA38_59 <= 'Q')||(LA38_59 >= 'S' && LA38_59 <= 'Z')||(LA38_59 >= '_' && LA38_59 <= 'q')||(LA38_59 >= 's' && LA38_59 <= 'z')||LA38_59=='|'||(LA38_59 >= '\u007F' && LA38_59 <= '\u2FFF')||(LA38_59 >= '\u3001' && LA38_59 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_59=='\\') ) {s = 36;}
+
+                        else if ( (LA38_59=='-') ) {s = 37;}
+
+                        else if ( (LA38_59=='+') ) {s = 38;}
+
+                        else if ( (LA38_59=='*'||LA38_59=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 25 : 
+                        int LA38_18 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_18=='&') ) {s = 41;}
+
+                        else if ( ((LA38_18 >= '\u0000' && LA38_18 <= '\b')||(LA38_18 >= '\u000B' && LA38_18 <= '\f')||(LA38_18 >= '\u000E' && LA38_18 <= '\u001F')||(LA38_18 >= '#' && LA38_18 <= '%')||LA38_18==','||(LA38_18 >= '.' && LA38_18 <= '9')||(LA38_18 >= ';' && LA38_18 <= '>')||(LA38_18 >= '@' && LA38_18 <= 'Z')||(LA38_18 >= '_' && LA38_18 <= 'z')||LA38_18=='|'||(LA38_18 >= '\u007F' && LA38_18 <= '\u2FFF')||(LA38_18 >= '\u3001' && LA38_18 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_18=='\\') ) {s = 36;}
+
+                        else if ( (LA38_18=='-') ) {s = 37;}
+
+                        else if ( (LA38_18=='+') ) {s = 38;}
+
+                        else if ( (LA38_18=='*'||LA38_18=='?') ) {s = 27;}
+
+                        else s = 40;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 26 : 
+                        int LA38_0 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_0=='(') ) {s = 1;}
+
+                        else if ( (LA38_0==')') ) {s = 2;}
+
+                        else if ( (LA38_0=='[') ) {s = 3;}
+
+                        else if ( (LA38_0==']') ) {s = 4;}
+
+                        else if ( (LA38_0==':') ) {s = 5;}
+
+                        else if ( (LA38_0=='+') ) {s = 6;}
+
+                        else if ( (LA38_0=='!'||LA38_0=='-') ) {s = 7;}
+
+                        else if ( (LA38_0=='*') ) {s = 8;}
+
+                        else if ( (LA38_0=='?') ) {s = 9;}
+
+                        else if ( (LA38_0=='{') ) {s = 10;}
+
+                        else if ( (LA38_0=='}') ) {s = 11;}
+
+                        else if ( (LA38_0=='^') ) {s = 12;}
+
+                        else if ( (LA38_0=='~') ) {s = 13;}
+
+                        else if ( (LA38_0=='\"') ) {s = 14;}
+
+                        else if ( (LA38_0=='\'') ) {s = 15;}
+
+                        else if ( (LA38_0=='T') ) {s = 16;}
+
+                        else if ( (LA38_0=='A'||LA38_0=='a') ) {s = 17;}
+
+                        else if ( (LA38_0=='&') ) {s = 18;}
+
+                        else if ( (LA38_0=='O'||LA38_0=='o') ) {s = 19;}
+
+                        else if ( (LA38_0=='|') ) {s = 20;}
+
+                        else if ( (LA38_0=='N'||LA38_0=='n') ) {s = 21;}
+
+                        else if ( ((LA38_0 >= '\t' && LA38_0 <= '\n')||LA38_0=='\r'||LA38_0==' '||LA38_0=='\u3000') ) {s = 22;}
+
+                        else if ( ((LA38_0 >= '0' && LA38_0 <= '9')) ) {s = 23;}
+
+                        else if ( ((LA38_0 >= '\u0000' && LA38_0 <= '\b')||(LA38_0 >= '\u000B' && LA38_0 <= '\f')||(LA38_0 >= '\u000E' && LA38_0 <= '\u001F')||(LA38_0 >= '#' && LA38_0 <= '%')||LA38_0==','||(LA38_0 >= '.' && LA38_0 <= '/')||(LA38_0 >= ';' && LA38_0 <= '>')||LA38_0=='@'||(LA38_0 >= 'B' && LA38_0 <= 'M')||(LA38_0 >= 'P' && LA38_0 <= 'S')||(LA38_0 >= 'U' && LA38_0 <= 'Z')||(LA38_0 >= '_' && LA38_0 <= '`')||(LA38_0 >= 'b' && LA38_0 <= 'm')||(LA38_0 >= 'p' && LA38_0 <= 'z')||(LA38_0 >= '\u007F' && LA38_0 <= '\u2FFF')||(LA38_0 >= '\u3001' && LA38_0 <= '\uFFFF')) ) {s = 24;}
+
+                        else if ( (LA38_0=='\\') ) {s = 25;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 27 : 
+                        int LA38_69 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_69 >= '0' && LA38_69 <= '9')) ) {s = 73;}
+
+                        else if ( ((LA38_69 >= '\u0000' && LA38_69 <= '\b')||(LA38_69 >= '\u000B' && LA38_69 <= '\f')||(LA38_69 >= '\u000E' && LA38_69 <= '\u001F')||(LA38_69 >= '#' && LA38_69 <= '&')||LA38_69==','||(LA38_69 >= '.' && LA38_69 <= '/')||(LA38_69 >= ';' && LA38_69 <= '>')||(LA38_69 >= '@' && LA38_69 <= 'Z')||(LA38_69 >= '_' && LA38_69 <= 'z')||LA38_69=='|'||(LA38_69 >= '\u007F' && LA38_69 <= '\u2FFF')||(LA38_69 >= '\u3001' && LA38_69 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_69=='\\') ) {s = 36;}
+
+                        else if ( (LA38_69=='-') ) {s = 37;}
+
+                        else if ( (LA38_69=='+') ) {s = 38;}
+
+                        else if ( (LA38_69=='*'||LA38_69=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 28 : 
+                        int LA38_33 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_33 >= '\u0000' && LA38_33 <= '\b')||(LA38_33 >= '\u000B' && LA38_33 <= '\f')||(LA38_33 >= '\u000E' && LA38_33 <= '\u001F')||(LA38_33 >= '#' && LA38_33 <= '&')||LA38_33==','||(LA38_33 >= '.' && LA38_33 <= '9')||(LA38_33 >= ';' && LA38_33 <= '>')||(LA38_33 >= '@' && LA38_33 <= 'Z')||(LA38_33 >= '_' && LA38_33 <= 'z')||LA38_33=='|'||(LA38_33 >= '\u007F' && LA38_33 <= '\u2FFF')||(LA38_33 >= '\u3001' && LA38_33 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_33=='\\') ) {s = 36;}
+
+                        else if ( (LA38_33=='-') ) {s = 37;}
+
+                        else if ( (LA38_33=='+') ) {s = 38;}
+
+                        else if ( (LA38_33=='*'||LA38_33=='?') ) {s = 27;}
+
+                        else s = 55;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 29 : 
+                        int LA38_16 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_16=='O') ) {s = 33;}
+
+                        else if ( ((LA38_16 >= '\u0000' && LA38_16 <= '\b')||(LA38_16 >= '\u000B' && LA38_16 <= '\f')||(LA38_16 >= '\u000E' && LA38_16 <= '\u001F')||(LA38_16 >= '#' && LA38_16 <= '&')||LA38_16==','||(LA38_16 >= '.' && LA38_16 <= '9')||(LA38_16 >= ';' && LA38_16 <= '>')||(LA38_16 >= '@' && LA38_16 <= 'N')||(LA38_16 >= 'P' && LA38_16 <= 'Z')||(LA38_16 >= '_' && LA38_16 <= 'z')||LA38_16=='|'||(LA38_16 >= '\u007F' && LA38_16 <= '\u2FFF')||(LA38_16 >= '\u3001' && LA38_16 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_16=='\\') ) {s = 36;}
+
+                        else if ( (LA38_16=='-') ) {s = 37;}
+
+                        else if ( (LA38_16=='+') ) {s = 38;}
+
+                        else if ( (LA38_16=='*'||LA38_16=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 30 : 
+                        int LA38_21 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_21=='O'||LA38_21=='o') ) {s = 45;}
+
+                        else if ( (LA38_21=='E'||LA38_21=='e') ) {s = 46;}
+
+                        else if ( ((LA38_21 >= '\u0000' && LA38_21 <= '\b')||(LA38_21 >= '\u000B' && LA38_21 <= '\f')||(LA38_21 >= '\u000E' && LA38_21 <= '\u001F')||(LA38_21 >= '#' && LA38_21 <= '&')||LA38_21==','||(LA38_21 >= '.' && LA38_21 <= '9')||(LA38_21 >= ';' && LA38_21 <= '>')||(LA38_21 >= '@' && LA38_21 <= 'D')||(LA38_21 >= 'F' && LA38_21 <= 'N')||(LA38_21 >= 'P' && LA38_21 <= 'Z')||(LA38_21 >= '_' && LA38_21 <= 'd')||(LA38_21 >= 'f' && LA38_21 <= 'n')||(LA38_21 >= 'p' && LA38_21 <= 'z')||LA38_21=='|'||(LA38_21 >= '\u007F' && LA38_21 <= '\u2FFF')||(LA38_21 >= '\u3001' && LA38_21 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_21=='\\') ) {s = 36;}
+
+                        else if ( (LA38_21=='-') ) {s = 37;}
+
+                        else if ( (LA38_21=='+') ) {s = 38;}
+
+                        else if ( (LA38_21=='*'||LA38_21=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 31 : 
+                        int LA38_41 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_41 >= '\u0000' && LA38_41 <= '\b')||(LA38_41 >= '\u000B' && LA38_41 <= '\f')||(LA38_41 >= '\u000E' && LA38_41 <= '\u001F')||(LA38_41 >= '#' && LA38_41 <= '&')||LA38_41==','||(LA38_41 >= '.' && LA38_41 <= '9')||(LA38_41 >= ';' && LA38_41 <= '>')||(LA38_41 >= '@' && LA38_41 <= 'Z')||(LA38_41 >= '_' && LA38_41 <= 'z')||LA38_41=='|'||(LA38_41 >= '\u007F' && LA38_41 <= '\u2FFF')||(LA38_41 >= '\u3001' && LA38_41 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_41=='\\') ) {s = 36;}
+
+                        else if ( (LA38_41=='-') ) {s = 37;}
+
+                        else if ( (LA38_41=='+') ) {s = 38;}
+
+                        else if ( (LA38_41=='*'||LA38_41=='?') ) {s = 27;}
+
+                        else s = 40;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 32 : 
+                        int LA38_66 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_66 >= '0' && LA38_66 <= '9')) ) {s = 73;}
+
+                        else if ( ((LA38_66 >= '.' && LA38_66 <= '/')) ) {s = 67;}
+
+                        else if ( (LA38_66=='-') ) {s = 68;}
+
+                        else if ( ((LA38_66 >= '\u0000' && LA38_66 <= '\b')||(LA38_66 >= '\u000B' && LA38_66 <= '\f')||(LA38_66 >= '\u000E' && LA38_66 <= '\u001F')||(LA38_66 >= '#' && LA38_66 <= '&')||LA38_66==','||(LA38_66 >= ';' && LA38_66 <= '>')||(LA38_66 >= '@' && LA38_66 <= 'Z')||(LA38_66 >= '_' && LA38_66 <= 'z')||LA38_66=='|'||(LA38_66 >= '\u007F' && LA38_66 <= '\u2FFF')||(LA38_66 >= '\u3001' && LA38_66 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_66=='\\') ) {s = 36;}
+
+                        else if ( (LA38_66=='+') ) {s = 38;}
+
+                        else if ( (LA38_66=='*'||LA38_66=='?') ) {s = 27;}
+
+                        else s = 48;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 33 : 
+                        int LA38_23 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_23=='.') ) {s = 47;}
+
+                        else if ( ((LA38_23 >= '0' && LA38_23 <= '9')) ) {s = 49;}
+
+                        else if ( (LA38_23=='/') ) {s = 50;}
+
+                        else if ( (LA38_23=='-') ) {s = 51;}
+
+                        else if ( ((LA38_23 >= '\u0000' && LA38_23 <= '\b')||(LA38_23 >= '\u000B' && LA38_23 <= '\f')||(LA38_23 >= '\u000E' && LA38_23 <= '\u001F')||(LA38_23 >= '#' && LA38_23 <= '&')||LA38_23==','||(LA38_23 >= ';' && LA38_23 <= '>')||(LA38_23 >= '@' && LA38_23 <= 'Z')||(LA38_23 >= '_' && LA38_23 <= 'z')||LA38_23=='|'||(LA38_23 >= '\u007F' && LA38_23 <= '\u2FFF')||(LA38_23 >= '\u3001' && LA38_23 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_23=='\\') ) {s = 36;}
+
+                        else if ( (LA38_23=='+') ) {s = 38;}
+
+                        else if ( (LA38_23=='*'||LA38_23=='?') ) {s = 27;}
+
+                        else s = 48;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 34 : 
+                        int LA38_60 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_60 >= '0' && LA38_60 <= '9')) ) {s = 66;}
+
+                        else if ( ((LA38_60 >= '.' && LA38_60 <= '/')) ) {s = 67;}
+
+                        else if ( (LA38_60=='-') ) {s = 68;}
+
+                        else if ( ((LA38_60 >= '\u0000' && LA38_60 <= '\b')||(LA38_60 >= '\u000B' && LA38_60 <= '\f')||(LA38_60 >= '\u000E' && LA38_60 <= '\u001F')||(LA38_60 >= '#' && LA38_60 <= '&')||LA38_60==','||(LA38_60 >= ';' && LA38_60 <= '>')||(LA38_60 >= '@' && LA38_60 <= 'Z')||(LA38_60 >= '_' && LA38_60 <= 'z')||LA38_60=='|'||(LA38_60 >= '\u007F' && LA38_60 <= '\u2FFF')||(LA38_60 >= '\u3001' && LA38_60 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_60=='\\') ) {s = 36;}
+
+                        else if ( (LA38_60=='+') ) {s = 38;}
+
+                        else if ( (LA38_60=='*'||LA38_60=='?') ) {s = 27;}
+
+                        else s = 48;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 35 : 
+                        int LA38_9 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_9=='?') ) {s = 9;}
+
+                        else if ( ((LA38_9 >= '\u0000' && LA38_9 <= '\b')||(LA38_9 >= '\u000B' && LA38_9 <= '\f')||(LA38_9 >= '\u000E' && LA38_9 <= '\u001F')||(LA38_9 >= '#' && LA38_9 <= '&')||(LA38_9 >= '+' && LA38_9 <= '9')||(LA38_9 >= ';' && LA38_9 <= '>')||(LA38_9 >= '@' && LA38_9 <= 'Z')||LA38_9=='\\'||(LA38_9 >= '_' && LA38_9 <= 'z')||LA38_9=='|'||(LA38_9 >= '\u007F' && LA38_9 <= '\u2FFF')||(LA38_9 >= '\u3001' && LA38_9 <= '\uFFFF')) ) {s = 27;}
+
+                        else s = 28;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 36 : 
+                        int LA38_20 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_20=='|') ) {s = 44;}
+
+                        else if ( ((LA38_20 >= '\u0000' && LA38_20 <= '\b')||(LA38_20 >= '\u000B' && LA38_20 <= '\f')||(LA38_20 >= '\u000E' && LA38_20 <= '\u001F')||(LA38_20 >= '#' && LA38_20 <= '&')||LA38_20==','||(LA38_20 >= '.' && LA38_20 <= '9')||(LA38_20 >= ';' && LA38_20 <= '>')||(LA38_20 >= '@' && LA38_20 <= 'Z')||(LA38_20 >= '_' && LA38_20 <= 'z')||(LA38_20 >= '\u007F' && LA38_20 <= '\u2FFF')||(LA38_20 >= '\u3001' && LA38_20 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_20=='\\') ) {s = 36;}
+
+                        else if ( (LA38_20=='-') ) {s = 37;}
+
+                        else if ( (LA38_20=='+') ) {s = 38;}
+
+                        else if ( (LA38_20=='*'||LA38_20=='?') ) {s = 27;}
+
+                        else s = 43;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 37 : 
+                        int LA38_24 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_24 >= '\u0000' && LA38_24 <= '\b')||(LA38_24 >= '\u000B' && LA38_24 <= '\f')||(LA38_24 >= '\u000E' && LA38_24 <= '\u001F')||(LA38_24 >= '#' && LA38_24 <= '&')||LA38_24==','||(LA38_24 >= '.' && LA38_24 <= '9')||(LA38_24 >= ';' && LA38_24 <= '>')||(LA38_24 >= '@' && LA38_24 <= 'Z')||(LA38_24 >= '_' && LA38_24 <= 'z')||LA38_24=='|'||(LA38_24 >= '\u007F' && LA38_24 <= '\u2FFF')||(LA38_24 >= '\u3001' && LA38_24 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_24=='\\') ) {s = 36;}
+
+                        else if ( (LA38_24=='-') ) {s = 37;}
+
+                        else if ( (LA38_24=='+') ) {s = 38;}
+
+                        else if ( (LA38_24=='*'||LA38_24=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 38 : 
+                        int LA38_30 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_30 >= '\u0000' && LA38_30 <= '\uFFFF')) ) {s = 53;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 39 : 
+                        int LA38_67 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_67 >= '0' && LA38_67 <= '9')) ) {s = 74;}
+
+                        else if ( ((LA38_67 >= '\u0000' && LA38_67 <= '\b')||(LA38_67 >= '\u000B' && LA38_67 <= '\f')||(LA38_67 >= '\u000E' && LA38_67 <= '\u001F')||(LA38_67 >= '#' && LA38_67 <= '&')||LA38_67==','||(LA38_67 >= '.' && LA38_67 <= '/')||(LA38_67 >= ';' && LA38_67 <= '>')||(LA38_67 >= '@' && LA38_67 <= 'Z')||(LA38_67 >= '_' && LA38_67 <= 'z')||LA38_67=='|'||(LA38_67 >= '\u007F' && LA38_67 <= '\u2FFF')||(LA38_67 >= '\u3001' && LA38_67 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_67=='\\') ) {s = 36;}
+
+                        else if ( (LA38_67=='-') ) {s = 37;}
+
+                        else if ( (LA38_67=='+') ) {s = 38;}
+
+                        else if ( (LA38_67=='*'||LA38_67=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 40 : 
+                        int LA38_56 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_56 >= '\u0000' && LA38_56 <= '\b')||(LA38_56 >= '\u000B' && LA38_56 <= '\f')||(LA38_56 >= '\u000E' && LA38_56 <= '\u001F')||(LA38_56 >= '#' && LA38_56 <= '&')||LA38_56==','||(LA38_56 >= '.' && LA38_56 <= '9')||(LA38_56 >= ';' && LA38_56 <= '>')||(LA38_56 >= '@' && LA38_56 <= 'Z')||(LA38_56 >= '_' && LA38_56 <= 'z')||LA38_56=='|'||(LA38_56 >= '\u007F' && LA38_56 <= '\u2FFF')||(LA38_56 >= '\u3001' && LA38_56 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_56=='\\') ) {s = 36;}
+
+                        else if ( (LA38_56=='-') ) {s = 37;}
+
+                        else if ( (LA38_56=='+') ) {s = 38;}
+
+                        else if ( (LA38_56=='*'||LA38_56=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 41 : 
+                        int LA38_39 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_39=='D'||LA38_39=='d') ) {s = 57;}
+
+                        else if ( ((LA38_39 >= '\u0000' && LA38_39 <= '\b')||(LA38_39 >= '\u000B' && LA38_39 <= '\f')||(LA38_39 >= '\u000E' && LA38_39 <= '\u001F')||(LA38_39 >= '#' && LA38_39 <= '&')||LA38_39==','||(LA38_39 >= '.' && LA38_39 <= '9')||(LA38_39 >= ';' && LA38_39 <= '>')||(LA38_39 >= '@' && LA38_39 <= 'C')||(LA38_39 >= 'E' && LA38_39 <= 'Z')||(LA38_39 >= '_' && LA38_39 <= 'c')||(LA38_39 >= 'e' && LA38_39 <= 'z')||LA38_39=='|'||(LA38_39 >= '\u007F' && LA38_39 <= '\u2FFF')||(LA38_39 >= '\u3001' && LA38_39 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_39=='\\') ) {s = 36;}
+
+                        else if ( (LA38_39=='-') ) {s = 37;}
+
+                        else if ( (LA38_39=='+') ) {s = 38;}
+
+                        else if ( (LA38_39=='*'||LA38_39=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 42 : 
+                        int LA38_25 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_25 >= '\u0000' && LA38_25 <= '\uFFFF')) ) {s = 52;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 43 : 
+                        int LA38_36 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_36 >= '\u0000' && LA38_36 <= '\uFFFF')) ) {s = 56;}
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 44 : 
+                        int LA38_49 = input.LA(1);
+
+                        s = -1;
+                        if ( (LA38_49=='.') ) {s = 47;}
+
+                        else if ( ((LA38_49 >= '0' && LA38_49 <= '9')) ) {s = 61;}
+
+                        else if ( (LA38_49=='/') ) {s = 50;}
+
+                        else if ( (LA38_49=='-') ) {s = 51;}
+
+                        else if ( ((LA38_49 >= '\u0000' && LA38_49 <= '\b')||(LA38_49 >= '\u000B' && LA38_49 <= '\f')||(LA38_49 >= '\u000E' && LA38_49 <= '\u001F')||(LA38_49 >= '#' && LA38_49 <= '&')||LA38_49==','||(LA38_49 >= ';' && LA38_49 <= '>')||(LA38_49 >= '@' && LA38_49 <= 'Z')||(LA38_49 >= '_' && LA38_49 <= 'z')||LA38_49=='|'||(LA38_49 >= '\u007F' && LA38_49 <= '\u2FFF')||(LA38_49 >= '\u3001' && LA38_49 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_49=='\\') ) {s = 36;}
+
+                        else if ( (LA38_49=='+') ) {s = 38;}
+
+                        else if ( (LA38_49=='*'||LA38_49=='?') ) {s = 27;}
+
+                        else s = 48;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 45 : 
+                        int LA38_50 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_50 >= '0' && LA38_50 <= '9')) ) {s = 62;}
+
+                        else if ( ((LA38_50 >= '\u0000' && LA38_50 <= '\b')||(LA38_50 >= '\u000B' && LA38_50 <= '\f')||(LA38_50 >= '\u000E' && LA38_50 <= '\u001F')||(LA38_50 >= '#' && LA38_50 <= '&')||LA38_50==','||(LA38_50 >= '.' && LA38_50 <= '/')||(LA38_50 >= ';' && LA38_50 <= '>')||(LA38_50 >= '@' && LA38_50 <= 'Z')||(LA38_50 >= '_' && LA38_50 <= 'z')||LA38_50=='|'||(LA38_50 >= '\u007F' && LA38_50 <= '\u2FFF')||(LA38_50 >= '\u3001' && LA38_50 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_50=='\\') ) {s = 36;}
+
+                        else if ( (LA38_50=='-') ) {s = 37;}
+
+                        else if ( (LA38_50=='+') ) {s = 38;}
+
+                        else if ( (LA38_50=='*'||LA38_50=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 46 : 
+                        int LA38_78 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_78 >= '\u0000' && LA38_78 <= '\b')||(LA38_78 >= '\u000B' && LA38_78 <= '\f')||(LA38_78 >= '\u000E' && LA38_78 <= '\u001F')||(LA38_78 >= '#' && LA38_78 <= '&')||LA38_78==','||(LA38_78 >= '.' && LA38_78 <= '9')||(LA38_78 >= ';' && LA38_78 <= '>')||(LA38_78 >= '@' && LA38_78 <= 'Z')||(LA38_78 >= '_' && LA38_78 <= 'z')||LA38_78=='|'||(LA38_78 >= '\u007F' && LA38_78 <= '\u2FFF')||(LA38_78 >= '\u3001' && LA38_78 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_78=='\\') ) {s = 36;}
+
+                        else if ( (LA38_78=='-') ) {s = 37;}
+
+                        else if ( (LA38_78=='+') ) {s = 38;}
+
+                        else if ( (LA38_78=='*'||LA38_78=='?') ) {s = 27;}
+
+                        else s = 76;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 47 : 
+                        int LA38_68 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_68 >= '0' && LA38_68 <= '9')) ) {s = 74;}
+
+                        else if ( ((LA38_68 >= '\u0000' && LA38_68 <= '\b')||(LA38_68 >= '\u000B' && LA38_68 <= '\f')||(LA38_68 >= '\u000E' && LA38_68 <= '\u001F')||(LA38_68 >= '#' && LA38_68 <= '&')||LA38_68==','||(LA38_68 >= '.' && LA38_68 <= '/')||(LA38_68 >= ';' && LA38_68 <= '>')||(LA38_68 >= '@' && LA38_68 <= 'Z')||(LA38_68 >= '_' && LA38_68 <= 'z')||LA38_68=='|'||(LA38_68 >= '\u007F' && LA38_68 <= '\u2FFF')||(LA38_68 >= '\u3001' && LA38_68 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_68=='\\') ) {s = 36;}
+
+                        else if ( (LA38_68=='-') ) {s = 37;}
+
+                        else if ( (LA38_68=='+') ) {s = 38;}
+
+                        else if ( (LA38_68=='*'||LA38_68=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 48 : 
+                        int LA38_42 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_42 >= '\u0000' && LA38_42 <= '\b')||(LA38_42 >= '\u000B' && LA38_42 <= '\f')||(LA38_42 >= '\u000E' && LA38_42 <= '\u001F')||(LA38_42 >= '#' && LA38_42 <= '&')||LA38_42==','||(LA38_42 >= '.' && LA38_42 <= '9')||(LA38_42 >= ';' && LA38_42 <= '>')||(LA38_42 >= '@' && LA38_42 <= 'Z')||(LA38_42 >= '_' && LA38_42 <= 'z')||LA38_42=='|'||(LA38_42 >= '\u007F' && LA38_42 <= '\u2FFF')||(LA38_42 >= '\u3001' && LA38_42 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_42=='\\') ) {s = 36;}
+
+                        else if ( (LA38_42=='-') ) {s = 37;}
+
+                        else if ( (LA38_42=='+') ) {s = 38;}
+
+                        else if ( (LA38_42=='*'||LA38_42=='?') ) {s = 27;}
+
+                        else s = 43;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 49 : 
+                        int LA38_51 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_51 >= '0' && LA38_51 <= '9')) ) {s = 62;}
+
+                        else if ( ((LA38_51 >= '\u0000' && LA38_51 <= '\b')||(LA38_51 >= '\u000B' && LA38_51 <= '\f')||(LA38_51 >= '\u000E' && LA38_51 <= '\u001F')||(LA38_51 >= '#' && LA38_51 <= '&')||LA38_51==','||(LA38_51 >= '.' && LA38_51 <= '/')||(LA38_51 >= ';' && LA38_51 <= '>')||(LA38_51 >= '@' && LA38_51 <= 'Z')||(LA38_51 >= '_' && LA38_51 <= 'z')||LA38_51=='|'||(LA38_51 >= '\u007F' && LA38_51 <= '\u2FFF')||(LA38_51 >= '\u3001' && LA38_51 <= '\uFFFF')) ) {s = 35;}
+
+                        else if ( (LA38_51=='\\') ) {s = 36;}
+
+                        else if ( (LA38_51=='-') ) {s = 37;}
+
+                        else if ( (LA38_51=='+') ) {s = 38;}
+
+                        else if ( (LA38_51=='*'||LA38_51=='?') ) {s = 27;}
+
+                        else s = 34;
+
+                        if ( s>=0 ) return s;
+                        break;
+                    case 50 : 
+                        int LA38_8 = input.LA(1);
+
+                        s = -1;
+                        if ( ((LA38_8 >= '\u0000' && LA38_8 <= '\b')||(LA38_8 >= '\u000B' && LA38_8 <= '\f')||(LA38_8 >= '\u000E' && LA38_8 <= '\u001F')||(LA38_8 >= '#' && LA38_8 <= '&')||(LA38_8 >= '+' && LA38_8 <= '9')||(LA38_8 >= ';' && LA38_8 <= '>')||(LA38_8 >= '@' && LA38_8 <= 'Z')||LA38_8=='\\'||(LA38_8 >= '_' && LA38_8 <= 'z')||LA38_8=='|'||(LA38_8 >= '\u007F' && LA38_8 <= '\u2FFF')||(LA38_8 >= '\u3001' && LA38_8 <= '\uFFFF')) ) {s = 27;}
+
+                        else s = 26;
+
+                        if ( s>=0 ) return s;
+                        break;
+            }
+            NoViableAltException nvae =
+                new NoViableAltException(getDescription(), 38, _s, input);
+            error(nvae);
+            throw nvae;
+        }
+
+    }
+ 
+
+}
\ No newline at end of file
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/UnforgivingParser.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/UnforgivingParser.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/UnforgivingParser.java	(revision 0)
@@ -0,0 +1,33 @@
+package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+import org.antlr.runtime.BitSet;
+import org.antlr.runtime.IntStream;
+import org.antlr.runtime.MismatchedTokenException;
+import org.antlr.runtime.Parser;
+import org.antlr.runtime.RecognitionException;
+import org.antlr.runtime.RecognizerSharedState;
+import org.antlr.runtime.TokenStream;
+
+public class UnforgivingParser extends Parser {
+	
+	public UnforgivingParser(TokenStream input) {
+	  super(input);
+	  // TODO Auto-generated constructor stub
+  }
+
+	public UnforgivingParser(TokenStream input, RecognizerSharedState state) {
+	  super(input, state);
+	  // TODO Auto-generated constructor stub
+  }
+	
+	@Override
+	protected Object recoverFromMismatchedToken(IntStream input, int ttype, BitSet follow)
+	throws RecognitionException
+	{
+		//do not try to recover
+		MismatchedTokenException e = new MismatchedTokenException(ttype, input);
+		throw e;
+	}
+	
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpStandardLuceneParser.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpStandardLuceneParser.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpStandardLuceneParser.java	(revision 0)
@@ -0,0 +1,60 @@
+package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+import org.apache.lucene.analysis.Analyzer;
+import org.apache.lucene.queryparser.flexible.aqp.AqpQueryParser;
+import org.apache.lucene.queryparser.flexible.aqp.AqpSyntaxParserLoadableImpl;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeParseException;
+import org.apache.lucene.queryparser.flexible.standard.StandardQueryParser;
+
+public class AqpStandardLuceneParser {
+
+  /**
+   * Constructs a {@link StandardQueryParser} object. The default grammar used
+   * is "LuceneGrammar" {@see AqpQueryParser#AqpQueryParser(String)}
+   * 
+   * @throws Exception
+   */
+
+  public static AqpQueryParser init(String grammarName)
+      throws QueryNodeParseException {
+    return new AqpQueryParser(new AqpStandardQueryConfigHandler(),
+        new AqpSyntaxParserLoadableImpl().initializeGrammar(grammarName),
+        new AqpStandardQueryNodeProcessorPipeline(null),
+        new AqpStandardQueryTreeBuilder());
+  }
+
+  /**
+   * Instantiates {@link StandardLuceneGrammarSyntaxParser}, this method
+   * is using a dedicated parser class, instead of loading the parser
+   * by its grammar name
+   * 
+   * @return
+   * @throws QueryNodeParseException
+   */
+  public static AqpQueryParser init() throws QueryNodeParseException {
+  	return new AqpQueryParser(new AqpStandardQueryConfigHandler(),
+  			new StandardLuceneGrammarSyntaxParser(),
+        new AqpStandardQueryNodeProcessorPipeline(null),
+        new AqpStandardQueryTreeBuilder());
+  	
+  }
+
+  /**
+   * Constructs a {@link StandardQueryParser} object and sets an
+   * {@link Analyzer} to it. The same as:
+   * 
+   * <ul>
+   * StandardQueryParser qp = new StandardQueryParser();
+   * qp.getQueryConfigHandler().setAnalyzer(analyzer);
+   * </ul>
+   * 
+   * @param analyzer
+   *          the analyzer to be used by this query parser helper
+   * @throws Exception
+   */
+  public AqpQueryParser init(Analyzer analyzer) throws Exception {
+    AqpQueryParser p = AqpStandardLuceneParser.init("StandardLuceneGrammar");
+    p.setAnalyzer(analyzer);
+    return p;
+  }
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpExtendedLuceneParser.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpExtendedLuceneParser.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpExtendedLuceneParser.java	(revision 0)
@@ -0,0 +1,60 @@
+package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+import org.apache.lucene.analysis.Analyzer;
+import org.apache.lucene.queryparser.flexible.aqp.AqpQueryParser;
+import org.apache.lucene.queryparser.flexible.aqp.AqpSyntaxParserLoadableImpl;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeParseException;
+import org.apache.lucene.queryparser.flexible.standard.StandardQueryParser;
+
+public class AqpExtendedLuceneParser {
+
+  /**
+   * Constructs a {@link StandardQueryParser} object. The default grammar used
+   * is "LuceneGrammar" {@see AqpQueryParser#AqpQueryParser(String)}
+   * 
+   * @throws Exception
+   */
+
+  public static AqpQueryParser init(String grammarName)
+      throws QueryNodeParseException {
+    return new AqpQueryParser(new AqpStandardQueryConfigHandler(),
+        new AqpSyntaxParserLoadableImpl().initializeGrammar(grammarName),
+        new AqpStandardQueryNodeProcessorPipeline(null),
+        new AqpExtendedLuceneQueryTreeBuilder());
+  }
+
+  /**
+   * Instantiates {@link StandardLuceneGrammarSyntaxParser}, this method
+   * is using a dedicated parser class, instead of loading the parser
+   * by its grammar name
+   * 
+   * @return
+   * @throws QueryNodeParseException
+   */
+  public static AqpQueryParser init() throws QueryNodeParseException {
+  	return new AqpQueryParser(new AqpStandardQueryConfigHandler(),
+  			new ExtendedLuceneGrammarSyntaxParser(),
+        new AqpStandardQueryNodeProcessorPipeline(null),
+        new AqpExtendedLuceneQueryTreeBuilder());
+  	
+  }
+
+  /**
+   * Constructs a {@link StandardQueryParser} object and sets an
+   * {@link Analyzer} to it. The same as:
+   * 
+   * <ul>
+   * StandardQueryParser qp = new StandardQueryParser();
+   * qp.getQueryConfigHandler().setAnalyzer(analyzer);
+   * </ul>
+   * 
+   * @param analyzer
+   *          the analyzer to be used by this query parser helper
+   * @throws Exception
+   */
+  public AqpQueryParser init(Analyzer analyzer) throws Exception {
+    AqpQueryParser p = AqpStandardLuceneParser.init("ExtendedLuceneGrammar");
+    p.setAnalyzer(analyzer);
+    return p;
+  }
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpExtendedLuceneQueryTreeBuilder.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpExtendedLuceneQueryTreeBuilder.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpExtendedLuceneQueryTreeBuilder.java	(revision 0)
@@ -0,0 +1,14 @@
+package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+import org.apache.lucene.queryparser.flexible.aqp.builders.AqpNearQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpNearQueryNode;
+
+public class AqpExtendedLuceneQueryTreeBuilder extends
+    AqpStandardQueryTreeBuilder {
+	
+	public void init() {
+		super.init();
+		setBuilder(AqpNearQueryNode.class,	new AqpNearQueryNodeBuilder());
+	}
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpStandardQueryConfigHandler.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpStandardQueryConfigHandler.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpStandardQueryConfigHandler.java	(revision 0)
@@ -0,0 +1,126 @@
+package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+import java.util.HashMap;
+import java.util.Map;
+
+import org.apache.lucene.queryparser.flexible.core.config.ConfigurationKey;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.standard.processors.PhraseSlopQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.config.AqpFeedback;
+import org.apache.lucene.queryparser.flexible.aqp.config.AqpFeedbackEvent;
+import org.apache.lucene.queryparser.flexible.aqp.config.AqpFeedbackEventHandler;
+import org.apache.lucene.queryparser.flexible.aqp.config.AqpFeedbackImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpFuzzyModifierNode;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpBOOSTProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpDEFOPProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpFUZZYProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpFuzzyModifierProcessor;
+import org.apache.lucene.queryparser.flexible.aqp.processors.AqpQNORMALProcessor;
+
+public class AqpStandardQueryConfigHandler extends StandardQueryConfigHandler {
+
+  final public static class ConfigurationKeys {
+
+    /**
+     * This attribute is used by {@link AqpQNORMALProcessor} processor and must
+     * be defined in the {@link QueryConfigHandler}. This attribute tells the
+     * processor what is the default field when no field is defined in a phrase. <br/>
+     * 
+     */
+    final public static ConfigurationKey<String> DEFAULT_FIELD = ConfigurationKey
+        .newInstance();
+
+    /**
+     * This attribute is used by {@link PhraseSlopQueryNodeProcessor} processor
+     * and must be defined in the {@link QueryConfigHandler}. This attribute
+     * tells the processor what is the default phrase slop when no slop is
+     * defined in a phrase. <br/>
+     * 
+     */
+    final public static ConfigurationKey<Integer> DEFAULT_PROXIMITY = ConfigurationKey
+        .newInstance();
+
+    /**
+     * This attribute is used by {@link AqpDEFOPProcessor} processor and must be
+     * defined in the {@link QueryConfigHandler}. This attribute tells the
+     * processor what are the allowed values when user submits them. <br/>
+     * 
+     */
+    final public static ConfigurationKey<int[]> ALLOWED_PROXIMITY_RANGE = ConfigurationKey
+        .newInstance();
+
+    /**
+     * Value of the default boost, to be used when user specified '^' without a
+     * value
+     * 
+     * @see AqpBOOSTProcessor
+     */
+    final public static ConfigurationKey<Float> IMPLICIT_BOOST = ConfigurationKey
+        .newInstance();
+
+    /**
+     * This attribute is used to collect feedback messages and suggestions from
+     * the query parser
+     * 
+     * @see AqpFeedback#registerEventHandler(AqpFeedbackEventHandler)
+     * @see AqpFeedback#sendEvent(AqpFeedbackEvent)
+     */
+    final public static ConfigurationKey<AqpFeedback> FEEDBACK = ConfigurationKey
+        .newInstance();
+
+    /**
+     * Default fuzzy value when user specified only 'term~'
+     * 
+     * @see AqpFUZZYProcessor
+     * @see AqpFuzzyModifierNode
+     * @see AqpFuzzyModifierProcessor
+     */
+    final public static ConfigurationKey<Float> IMPLICIT_FUZZY = ConfigurationKey
+        .newInstance();
+
+    /**
+     * Allow to use the old-style 0.0-1.0f fuzzy value and let it be handled by
+     * the SlowFuzzyQuery
+     * 
+     * @see AqpFuzzyModifierProcessor
+     * 
+     */
+    final public static ConfigurationKey<Boolean> ALLOW_SLOW_FUZZY = ConfigurationKey
+        .newInstance();
+
+    /**
+     * Translation mapping for index names
+     */
+    final public static ConfigurationKey<Map<String, String>> FIELD_MAPPER = ConfigurationKey
+        .newInstance();
+
+    /**
+     * Translation mapping for index names (after analysis was done)
+     */
+    final public static ConfigurationKey<Map<String, String>> FIELD_MAPPER_POST_ANALYSIS = ConfigurationKey
+        .newInstance();
+
+  }
+
+  public AqpStandardQueryConfigHandler() {
+    super();
+
+    // Add listener that will build the FieldConfig attributes.
+    // None for now
+
+    // Default Values (besides the standard ones)
+    set(ConfigurationKeys.DEFAULT_FIELD, null);
+    set(ConfigurationKeys.DEFAULT_PROXIMITY, 5);
+    set(ConfigurationKeys.ALLOWED_PROXIMITY_RANGE, new int[] { 1, 5 });
+    set(ConfigurationKeys.IMPLICIT_BOOST, 1.0f);
+    set(ConfigurationKeys.IMPLICIT_FUZZY, 0.5f);
+    set(ConfigurationKeys.FEEDBACK, new AqpFeedbackImpl());
+    set(ConfigurationKeys.ALLOW_SLOW_FUZZY, false);
+    set(ConfigurationKeys.FIELD_MAPPER, new HashMap<String, String>());
+    set(ConfigurationKeys.FIELD_MAPPER_POST_ANALYSIS,
+        new HashMap<String, String>());
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpStandardQueryTreeBuilder.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpStandardQueryTreeBuilder.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/parser/AqpStandardQueryTreeBuilder.java	(revision 0)
@@ -0,0 +1,96 @@
+package org.apache.lucene.queryparser.flexible.aqp.parser;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import org.apache.lucene.queryparser.flexible.core.nodes.BooleanQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.BoostQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.FuzzyQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.GroupQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.MatchAllDocsQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.MatchNoDocsQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.SlopQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.TokenizedPhraseQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.builders.BooleanQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.BoostQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.DummyQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.FuzzyQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.GroupQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.MatchAllDocsQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.MatchNoDocsQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.ModifierQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.MultiPhraseQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.NumericRangeQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.PhraseQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.PrefixWildcardQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.RegexpQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.SlopQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.StandardBooleanQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.StandardQueryBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.TermRangeQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.builders.WildcardQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.nodes.MultiPhraseQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.NumericQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.NumericRangeQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.PrefixWildcardQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.RegexpQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.StandardBooleanQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.TermRangeQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.WildcardQueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.builders.AqpFieldQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.aqp.builders.AqpQueryTreeBuilder;
+import org.apache.lucene.queryparser.flexible.aqp.builders.AqpSlowFuzzyQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.SlowFuzzyQueryNode;
+
+/**
+ * This query tree builder provides configuration for the standard
+ * lucene syntax. <br/>
+ * 
+ * @see AqpStandardLuceneParser
+ */
+public class AqpStandardQueryTreeBuilder extends AqpQueryTreeBuilder implements
+    StandardQueryBuilder {
+
+
+  public void init() {
+    setBuilder(GroupQueryNode.class, new GroupQueryNodeBuilder());
+    setBuilder(FieldQueryNode.class, new AqpFieldQueryNodeBuilder());
+    setBuilder(BooleanQueryNode.class, new BooleanQueryNodeBuilder());
+    setBuilder(SlowFuzzyQueryNode.class, new AqpSlowFuzzyQueryNodeBuilder());
+    setBuilder(FuzzyQueryNode.class, new FuzzyQueryNodeBuilder());
+    setBuilder(NumericQueryNode.class, new DummyQueryNodeBuilder());
+    setBuilder(NumericRangeQueryNode.class, new NumericRangeQueryNodeBuilder());
+    setBuilder(BoostQueryNode.class, new BoostQueryNodeBuilder());
+    setBuilder(ModifierQueryNode.class, new ModifierQueryNodeBuilder());
+    setBuilder(WildcardQueryNode.class, new WildcardQueryNodeBuilder());
+    setBuilder(TokenizedPhraseQueryNode.class, new PhraseQueryNodeBuilder());
+    setBuilder(MatchNoDocsQueryNode.class, new MatchNoDocsQueryNodeBuilder());
+    setBuilder(PrefixWildcardQueryNode.class,
+        new PrefixWildcardQueryNodeBuilder());
+    setBuilder(TermRangeQueryNode.class, new TermRangeQueryNodeBuilder());
+    setBuilder(RegexpQueryNode.class, new RegexpQueryNodeBuilder());
+    setBuilder(SlopQueryNode.class, new SlopQueryNodeBuilder());
+    setBuilder(StandardBooleanQueryNode.class,
+        new StandardBooleanQueryNodeBuilder());
+    setBuilder(MultiPhraseQueryNode.class, new MultiPhraseQueryNodeBuilder());
+    setBuilder(MatchAllDocsQueryNode.class, new MatchAllDocsQueryNodeBuilder());
+  }
+
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpDebuggingQueryNodeProcessorPipeline.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpDebuggingQueryNodeProcessorPipeline.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpDebuggingQueryNodeProcessorPipeline.java	(revision 0)
@@ -0,0 +1,118 @@
+package org.apache.lucene.queryparser.flexible.aqp.util;
+
+import java.util.Iterator;
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.parser.EscapeQuerySyntax;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorPipeline;
+import org.apache.lucene.queryparser.flexible.standard.parser.EscapeQuerySyntaxImpl;
+
+/**
+ *  This class is used for debugging purposes (eg. from unittests
+ *  or when the query parser was invoked with debuqQuery=true)
+ *  
+ *  The debugging output shows the stage of the AST tree after
+ *  each processing stage completed. Including the changes in 
+ *  the internal 'map'.
+ * 
+ */
+public class AqpDebuggingQueryNodeProcessorPipeline extends
+    QueryNodeProcessorPipeline {
+
+  EscapeQuerySyntax escaper = new EscapeQuerySyntaxImpl();
+	private Class<? extends QueryNodeProcessorPipeline> originalProcessorClass;
+
+  public AqpDebuggingQueryNodeProcessorPipeline(QueryConfigHandler queryConfig, 
+  		Class<? extends QueryNodeProcessorPipeline> originalClass) {
+    super(queryConfig);
+    originalProcessorClass = originalClass;
+  }
+
+  public QueryNode process(QueryNode queryTree) throws QueryNodeException {
+    String oldVal = null;
+    String newVal = null;
+    String oldMap = null;
+    String newMap = null;
+
+    oldVal = queryTree.toString();
+    oldMap = harvestTagMap(queryTree);
+    newMap = oldMap;
+
+    int i = 1;
+    System.out.println("     0. starting");
+    System.out.println("--------------------------------------------");
+    System.out.println(oldVal);
+
+    Iterator<QueryNodeProcessor> it = this.iterator();
+
+    QueryNodeProcessor processor;
+    while (it.hasNext()) {
+      processor = it.next();
+
+      System.out.println("     " + i + ". step "
+          + processor.getClass().toString());
+      queryTree = processor.process(queryTree);
+      newVal = queryTree.toString();
+      newMap = harvestTagMap(queryTree);
+      System.out.println("     Tree changed: "
+          + (newVal.equals(oldVal) ? "NO" : "YES"));
+
+      if (!newMap.equals(oldMap)) {
+        System.out.println("     Tags changed: YES");
+        System.out.println("     -----------------");
+        System.out.println(newMap);
+        System.out.println("     -----------------");
+      }
+
+      System.out.println("--------------------------------------------");
+
+      System.out.println(newVal.equals(oldVal) ? "" : newVal);
+
+      oldVal = newVal;
+      oldMap = newMap;
+      i += 1;
+    }
+
+    System.out.println("");
+    System.out.println("final result:");
+    System.out.println("--------------------------------------------");
+    System.out.println(queryTree.toString());
+    return queryTree;
+
+  }
+
+  private String harvestTagMap(QueryNode queryTree) {
+    StringBuffer output = new StringBuffer();
+    harvestTagMapDesc(queryTree, output, 0);
+    return output.toString().trim();
+  }
+
+  private void harvestTagMapDesc(QueryNode queryTree, StringBuffer output,
+      int level) {
+    if (queryTree.getTagMap().size() > 0) {
+      for (int i = 0; i < level; i++) {
+        output.append("");
+      }
+      output.append(queryTree.toQueryString(escaper));
+      output.append(" : ");
+      // output.append(queryTree.getClass().getSimpleName());
+      // output.append(" : ");
+      output.append(queryTree.getTagMap());
+      output.append("\n");
+    }
+    List<QueryNode> children = queryTree.getChildren();
+    if (children != null) {
+      for (QueryNode child : queryTree.getChildren()) {
+        harvestTagMapDesc(child, output, level + 1);
+      }
+    }
+  }
+  
+  public Class<? extends QueryNodeProcessorPipeline> getOriginalProcessorClass() {
+  	return originalProcessorClass;
+  }
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpUtils.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpUtils.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpUtils.java	(revision 0)
@@ -0,0 +1,57 @@
+package org.apache.lucene.queryparser.flexible.aqp.util;
+
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+public class AqpUtils {
+
+  public enum Modifier {
+    PLUS, MINUS, UNKNOWN;
+  }
+
+  public static String getFirstChildInputString(QueryNode node) {
+    return getFirstChildInputString((AqpANTLRNode) node);
+  }
+
+  public static String getFirstChildInputString(AqpANTLRNode node) {
+    if (node != null && node.getChildren() != null) {
+      return ((AqpANTLRNode) node.getChildren().get(0)).getTokenInput();
+    }
+    return null;
+  }
+
+  public static Float getFirstChildInputFloat(AqpANTLRNode node) {
+    if (node != null && node.getChildren() != null) {
+      return Float.valueOf(((AqpANTLRNode) node.getChildren().get(0))
+          .getTokenInput());
+    }
+    return null;
+  }
+
+  public static Modifier getFirstChildInputModifier(AqpANTLRNode node) {
+    if (node != null && node.getChildren() != null) {
+      String val = ((AqpANTLRNode) node.getChildren().get(0)).getTokenName();
+      if (val.equals("PLUS")) {
+        return Modifier.PLUS;
+      } else if (val.equals("MINUS")) {
+        return Modifier.MINUS;
+      } else {
+        return Modifier.UNKNOWN;
+      }
+    }
+    return null;
+  }
+
+  public static void applyFieldToAllChildren(String field, QueryNode node) {
+
+    if (node instanceof FieldQueryNode) {
+      ((FieldQueryNode) node).setField(field);
+    }
+    if (node.getChildren() != null) {
+      for (QueryNode child : node.getChildren()) {
+        applyFieldToAllChildren(field, child);
+      }
+    }
+  }
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpQueryParserUtil.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpQueryParserUtil.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpQueryParserUtil.java	(revision 0)
@@ -0,0 +1,199 @@
+package org.apache.lucene.queryparser.flexible.aqp.util;
+
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import org.apache.lucene.analysis.Analyzer;
+import org.apache.lucene.queryparser.flexible.aqp.AqpQueryParser;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.search.BooleanClause;
+import org.apache.lucene.search.BooleanQuery;
+import org.apache.lucene.search.Query;
+
+/**
+ * This class defines utility methods to (help) parse query strings into
+ * {@link Query} objects.
+ */
+final public class AqpQueryParserUtil {
+
+  /**
+   * Parses a query which searches on the fields specified.
+   * <p>
+   * If x fields are specified, this effectively constructs:
+   * 
+   * <pre>
+   * &lt;code&gt;
+   * (field1:query1) (field2:query2) (field3:query3)...(fieldx:queryx)
+   * &lt;/code&gt;
+   * </pre>
+   * 
+   * @param queries
+   *          Queries strings to parse
+   * @param fields
+   *          Fields to search on
+   * @param analyzer
+   *          Analyzer to use
+   * @throws IllegalArgumentException
+   *           if the length of the queries array differs from the length of the
+   *           fields array
+   */
+  public static Query parse(AqpQueryParser qp, String[] queries, String[] fields)
+      throws QueryNodeException {
+    if (queries.length != fields.length)
+      throw new IllegalArgumentException("queries.length != fields.length");
+    BooleanQuery bQuery = new BooleanQuery();
+
+    for (int i = 0; i < fields.length; i++) {
+      Query q = qp.parse(queries[i], fields[i]);
+
+      if (q != null && // q never null, just being defensive
+          (!(q instanceof BooleanQuery) || ((BooleanQuery) q).getClauses().length > 0)) {
+        bQuery.add(q, BooleanClause.Occur.SHOULD);
+      }
+    }
+    return bQuery;
+  }
+
+  /**
+   * Parses a query, searching on the fields specified. Use this if you need to
+   * specify certain fields as required, and others as prohibited.
+   * <p>
+   * 
+   * <pre>
+   * Usage:
+   * &lt;code&gt;
+   * String[] fields = {&quot;filename&quot;, &quot;contents&quot;, &quot;description&quot;};
+   * BooleanClause.Occur[] flags = {BooleanClause.Occur.SHOULD,
+   *                BooleanClause.Occur.MUST,
+   *                BooleanClause.Occur.MUST_NOT};
+   * MultiFieldQueryParser.parse(&quot;query&quot;, fields, flags, analyzer);
+   * &lt;/code&gt;
+   * </pre>
+   * <p>
+   * The code above would construct a query:
+   * 
+   * <pre>
+   * &lt;code&gt;
+   * (filename:query) +(contents:query) -(description:query)
+   * &lt;/code&gt;
+   * </pre>
+   * 
+   * @param query
+   *          Query string to parse
+   * @param fields
+   *          Fields to search on
+   * @param flags
+   *          Flags describing the fields
+   * @param analyzer
+   *          Analyzer to use
+   * @throws IllegalArgumentException
+   *           if the length of the fields array differs from the length of the
+   *           flags array
+   */
+  public static Query parse(AqpQueryParser qp, String query, String[] fields,
+      BooleanClause.Occur[] flags, Analyzer analyzer) throws QueryNodeException {
+    if (fields.length != flags.length)
+      throw new IllegalArgumentException("fields.length != flags.length");
+    BooleanQuery bQuery = new BooleanQuery();
+
+    for (int i = 0; i < fields.length; i++) {
+      Query q = qp.parse(query, fields[i]);
+
+      if (q != null && // q never null, just being defensive
+          (!(q instanceof BooleanQuery) || ((BooleanQuery) q).getClauses().length > 0)) {
+        bQuery.add(q, flags[i]);
+      }
+    }
+    return bQuery;
+  }
+
+  /**
+   * Parses a query, searching on the fields specified. Use this if you need to
+   * specify certain fields as required, and others as prohibited.
+   * <p>
+   * 
+   * <pre>
+   * Usage:
+   * &lt;code&gt;
+   * String[] query = {&quot;query1&quot;, &quot;query2&quot;, &quot;query3&quot;};
+   * String[] fields = {&quot;filename&quot;, &quot;contents&quot;, &quot;description&quot;};
+   * BooleanClause.Occur[] flags = {BooleanClause.Occur.SHOULD,
+   *                BooleanClause.Occur.MUST,
+   *                BooleanClause.Occur.MUST_NOT};
+   * MultiFieldQueryParser.parse(query, fields, flags, analyzer);
+   * &lt;/code&gt;
+   * </pre>
+   * <p>
+   * The code above would construct a query:
+   * 
+   * <pre>
+   * &lt;code&gt;
+   * (filename:query1) +(contents:query2) -(description:query3)
+   * &lt;/code&gt;
+   * </pre>
+   * 
+   * @param queries
+   *          Queries string to parse
+   * @param fields
+   *          Fields to search on
+   * @param flags
+   *          Flags describing the fields
+   * @param analyzer
+   *          Analyzer to use
+   * @throws IllegalArgumentException
+   *           if the length of the queries, fields, and flags array differ
+   */
+  public static Query parse(AqpQueryParser qp, String[] queries,
+      String[] fields, BooleanClause.Occur[] flags, Analyzer analyzer)
+      throws QueryNodeException {
+    if (!(queries.length == fields.length && queries.length == flags.length))
+      throw new IllegalArgumentException(
+          "queries, fields, and flags array have have different length");
+    BooleanQuery bQuery = new BooleanQuery();
+
+    for (int i = 0; i < fields.length; i++) {
+      Query q = qp.parse(queries[i], fields[i]);
+
+      if (q != null && // q never null, just being defensive
+          (!(q instanceof BooleanQuery) || ((BooleanQuery) q).getClauses().length > 0)) {
+        bQuery.add(q, flags[i]);
+      }
+    }
+    return bQuery;
+  }
+
+  /**
+   * Returns a String where those characters that TextParser expects to be
+   * escaped are escaped by a preceding <code>\</code>.
+   */
+  public static String escape(String s) {
+    StringBuilder sb = new StringBuilder();
+    for (int i = 0; i < s.length(); i++) {
+      char c = s.charAt(i);
+      // These characters are part of the query syntax and must be escaped
+      if (c == '\\' || c == '+' || c == '-' || c == '!' || c == '(' || c == ')'
+          || c == ':' || c == '^' || c == '[' || c == ']' || c == '\"'
+          || c == '{' || c == '}' || c == '~' || c == '*' || c == '?'
+          || c == '|' || c == '&') {
+        sb.append('\\');
+      }
+      sb.append(c);
+    }
+    return sb.toString();
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpCommonTreeAdaptor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpCommonTreeAdaptor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpCommonTreeAdaptor.java	(revision 0)
@@ -0,0 +1,46 @@
+package org.apache.lucene.queryparser.flexible.aqp.util;
+
+import java.util.HashMap;
+import java.util.Map;
+
+import org.antlr.runtime.Token;
+import org.antlr.runtime.tree.CommonTreeAdaptor;
+
+
+public class AqpCommonTreeAdaptor extends CommonTreeAdaptor {
+
+  private Map<Integer, String> typeToNameMap;
+
+  public AqpCommonTreeAdaptor(String[] tokenNames) {
+    typeToNameMap = computeTypeToNameMap(tokenNames);
+  }
+
+  public Object create(Token payload) {
+    AqpCommonTree tree = new AqpCommonTree(payload);
+    tree.setTypeToNameMap(this.typeToNameMap);
+    return tree;
+  }
+
+  public Token getToken(Object t) {
+    if (t instanceof AqpCommonTree) {
+      return ((AqpCommonTree) t).getToken();
+    }
+    return null; // no idea what to do
+  }
+
+  /*
+   * translate token types into meaningful names it will be used later on
+   */
+  public Map<Integer, String> computeTypeToNameMap(String[] tokenNames) {
+    Map<Integer, String> m = new HashMap<Integer, String>();
+    if (tokenNames == null) {
+      return m;
+    }
+    for (int ttype = Token.MIN_TOKEN_TYPE; ttype < tokenNames.length; ttype++) {
+      String name = tokenNames[ttype];
+      m.put(new Integer(ttype), name);
+    }
+    return m;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpCommonTree.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpCommonTree.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/util/AqpCommonTree.java	(revision 0)
@@ -0,0 +1,126 @@
+package org.apache.lucene.queryparser.flexible.aqp.util;
+
+import java.util.Map;
+
+import org.antlr.runtime.CharStream;
+import org.antlr.runtime.CommonToken;
+import org.antlr.runtime.RecognitionException;
+import org.antlr.runtime.Token;
+import org.antlr.runtime.tree.CommonErrorNode;
+import org.antlr.runtime.tree.CommonTree;
+import org.antlr.runtime.tree.Tree;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+
+/**
+ * A wrapper for the objects produced by ANTLR. These 
+ * will be consumed by the aqp parser.
+ *
+ */
+public class AqpCommonTree extends CommonTree {
+
+  protected Map<Integer, String> typeToNameMap;
+
+  public AqpCommonTree() {
+    super();
+  }
+
+  public AqpCommonTree(CommonTree node) {
+    super(node);
+  }
+
+  public AqpCommonTree(AqpCommonTree node) {
+    super(node);
+  }
+
+  public AqpCommonTree(Token t) {
+    this.token = t;
+  }
+
+  public Tree dupNode() {
+    AqpCommonTree r = new AqpCommonTree(this);
+    r.setTypeToNameMap(this.typeToNameMap);
+    return r;
+  }
+
+  /** Return the whole tree converted to QueryNode tree */
+  public QueryNode toQueryNodeTree() throws RecognitionException {
+    if (children == null || children.size() == 0) {
+      return this.toQueryNode();
+    }
+
+    QueryNode buf = toQueryNode();
+    for (int i = 0; children != null && i < children.size(); i++) {
+      Object child = children.get(i);
+      if (child instanceof CommonErrorNode) {
+        throw ((CommonErrorNode) child).trappedException;
+      }
+      AqpCommonTree t = (AqpCommonTree) child;
+      buf.add(t.toQueryNodeTree());
+    }
+    return buf;
+  }
+
+  public QueryNode toQueryNode() {
+    return (QueryNode) new AqpANTLRNode(this);
+  }
+
+  public String getTokenLabel() {
+    if (isNil()) {
+      return "nil";
+    }
+    if (getType() == Token.INVALID_TOKEN_TYPE) {
+      return "<errornode>";
+    }
+    if (token == null) {
+      return null;
+    }
+    return token.getText();
+  }
+
+  public String getTokenInput() {
+    CharStream is = token.getInputStream();
+    if (is == null) {
+      return null;
+    }
+    int n = is.size();
+    if (getStartIndex() < n && getStopIndex() < n) {
+      return is.substring(getStartIndex(), getStopIndex());
+    } else {
+      return "<EOF>";
+    }
+  }
+
+  public int getTokenType() {
+    return token.getType();
+  }
+
+  public String getTypeLabel() {
+    int t = getTokenType();
+    return typeToNameMap.get(t);
+  }
+
+  public int getStartIndex() {
+    return ((CommonToken) token).getStartIndex();
+    // return startIndex;
+  }
+
+  public int getStopIndex() {
+    // return stopIndex;
+    return ((CommonToken) token).getStopIndex();
+  }
+
+  public void setStartIndex(int start) {
+    ((CommonToken) token).setStartIndex(start);
+  }
+
+  public void setStopIndex(int end) {
+    ((CommonToken) token).setStopIndex(end);
+  }
+
+  public void setTypeToNameMap(Map<Integer, String> typeMap) {
+    typeToNameMap = typeMap;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpGroupQueryOptimizerProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpGroupQueryOptimizerProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpGroupQueryOptimizerProcessor.java	(revision 0)
@@ -0,0 +1,171 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.BooleanQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.BoostQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.GroupQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.standard.nodes.BooleanModifierNode;
+
+/**
+ * Optimizes the query by removing the superfluous GroupQuery nodes. We harvest
+ * all parameters from fuzzy, boost, and modifier nodes and apply those that are
+ * closest to the actual query.
+ * 
+ * <br/>
+ * Example:
+ * 
+ * <pre>
+ * this (+(-(+(-(that thus))^0.1))^0.3)
+ * </pre>
+ * 
+ * Will be optimized into (when DEFOP = AND):
+ * 
+ * <pre>
+ * +field:this -((+field:that +field:thus)^0.1)
+ * </pre>
+ * 
+ * 
+ */
+public class AqpGroupQueryOptimizerProcessor extends QueryNodeProcessorImpl
+    implements QueryNodeProcessor {
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    if (node instanceof GroupQueryNode) {
+      QueryNode immediateChild = node.getChildren().get(0);
+      ClauseData data = harvestData(immediateChild);
+      QueryNode changedNode = data.getLastChild();
+
+      if (data.getLevelsDeep() > 0) {
+        boolean modified = false;
+        if (data.getBoost() != null) {
+          changedNode = new BoostQueryNode(changedNode, data.getBoost());
+          modified = true;
+        }
+        if (data.getModifier() != null) {
+          changedNode = new BooleanModifierNode(changedNode, data.getModifier());
+          modified = true;
+          /*
+           * Why was I doing this? Firstly, it is buggy, the second branch
+           * always executes - why am i creating new BooleanNode?
+           * List<QueryNode> children = new ArrayList<QueryNode>(); if
+           * (children.size() == 1) { return children.get(0); } else {
+           * children.add(new ModifierQueryNode(node, data.getModifier())); node
+           * = new BooleanQueryNode(children); }
+           */
+        }
+        /*
+         * if (modified && node.getParent()==null) { List<QueryNode> children =
+         * new ArrayList<QueryNode>(); children.add(node); changedNode = new
+         * BooleanQueryNode(children); }
+         */
+        return changedNode;
+      }
+      return immediateChild;
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+  /*
+   * methods below not used now, but might be added - it tries to compact
+   * consecutive CLAUSE nodes into one clause, taking only the last
+   * modifier/tmodifier values
+   */
+  private ClauseData harvestData(QueryNode clauseNode) {
+    ClauseData data = new ClauseData();
+    harvestData(clauseNode, data);
+    return data;
+  }
+
+  private void harvestData(QueryNode node, ClauseData data) {
+
+    if (node instanceof ModifierQueryNode) {
+      data.setModifier(((ModifierQueryNode) node).getModifier());
+    } else if (node instanceof BoostQueryNode) {
+      data.setBoost(((BoostQueryNode) node).getValue());
+    } else if (node instanceof GroupQueryNode) {
+      data.addLevelsDeep();
+    } else {
+      data.setLastChild(node);
+      return; // break processing
+    }
+    if (!node.isLeaf() && node.getChildren().size() == 1) {
+      harvestData(node.getChildren().get(0), data);
+    }
+
+  }
+
+  class ClauseData {
+    private ModifierQueryNode.Modifier modifier;
+    private Float boost;
+    private QueryNode lastValidNode;
+    private boolean keepOutmost = true; // change this to false if you want that
+    // modifiers that are closer to the clause are applied to ti
+    private int levelsDeep = 0;
+
+    ClauseData() {
+    }
+
+    ClauseData(ModifierQueryNode.Modifier mod, Float boost) {
+      this.modifier = mod;
+      this.boost = boost;
+    }
+
+    public ModifierQueryNode.Modifier getModifier() {
+      return modifier;
+    }
+
+    public void setModifier(ModifierQueryNode.Modifier modifier) {
+      if (keepOutmost && this.modifier != null) {
+        return;
+      }
+      this.modifier = modifier;
+    }
+
+    public Float getBoost() {
+      return boost;
+    }
+
+    public void setBoost(Float boost) {
+      if (keepOutmost && this.boost != null) {
+        return;
+      }
+      this.boost = boost;
+    }
+
+    public QueryNode getLastChild() {
+      return lastValidNode;
+    }
+
+    public void setLastChild(QueryNode lastNonClause) {
+      this.lastValidNode = lastNonClause;
+    }
+
+    public int getLevelsDeep() {
+      return levelsDeep;
+    }
+
+    public void addLevelsDeep() {
+      this.levelsDeep++;
+    }
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpBOOSTProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpBOOSTProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpBOOSTProcessor.java	(revision 0)
@@ -0,0 +1,103 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.BoostQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardQueryConfigHandler;
+
+/**
+ * Sets the node into the BoostQueryNode, this processor requires that
+ * {@link AqpTMODIFIERProcessor} ran before. Because we depend on the proper
+ * tree shape. <br/>
+ * 
+ * If BOOST node contains only one child, we return that child and do nothing. <br/>
+ * 
+ * If BOOST node contains two children, we take the first and check its input,
+ * eg.
+ * 
+ * <pre>
+ * 					BOOST
+ *                  /  \
+ *               ^0.1  rest
+ * </pre>
+ * 
+ * We create a new node BoostQueryNode(rest, 0.1) and return that node. <br/>
+ * 
+ * Presence of the BOOST node child means user specified at least "^" We'll use
+ * the default from the configuration {@see BoostAttribute}
+ * 
+ * @see AqpTMODIFIERProcessor
+ * @see AqpFUZZYProcessor
+ */
+public class AqpBOOSTProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    if (node instanceof AqpANTLRNode
+        && ((AqpANTLRNode) node).getTokenLabel().equals("BOOST")) {
+
+      if (node.getChildren().size() == 1) {
+        return node.getChildren().get(0);
+      }
+
+      Float boost = getBoostValue(node);
+      if (boost == null) {
+        return node.getChildren().get(node.getChildren().size() - 1);
+      }
+      return new BoostQueryNode(node.getChildren().get(
+          node.getChildren().size() - 1), boost);
+
+    }
+    return node;
+
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+  private Float getBoostValue(QueryNode boostNode) throws QueryNodeException {
+    if (boostNode.getChildren() != null) {
+
+      AqpANTLRNode child = ((AqpANTLRNode) boostNode.getChildren().get(0));
+      String input = child.getTokenInput();
+      float boost;
+
+      if (input.equals("^")) {
+        QueryConfigHandler queryConfig = getQueryConfigHandler();
+        if (queryConfig == null
+            || !queryConfig
+                .has(AqpStandardQueryConfigHandler.ConfigurationKeys.IMPLICIT_BOOST)) {
+          throw new QueryNodeException(new MessageImpl(
+              QueryParserMessages.LUCENE_QUERY_CONVERSION_ERROR,
+              "Configuration error: IMPLICIT_BOOST value is missing"));
+        }
+        boost = queryConfig
+            .get(AqpStandardQueryConfigHandler.ConfigurationKeys.IMPLICIT_BOOST);
+      } else {
+        boost = Float.valueOf(input.replace("^", ""));
+      }
+
+      return boost;
+
+    }
+    return null;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpOptimizationProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpOptimizationProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpOptimizationProcessor.java	(revision 0)
@@ -0,0 +1,87 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpBooleanQueryNode;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.BooleanQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode.Modifier;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+
+/**
+ * Optimizes the query tree - on root node - turns +whathever into whatever if
+ * there is only one child (but only if Modifier is positive, MOD_REQ or
+ * MOD_NONE)
+ * 
+ */
+public class AqpOptimizationProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    if (node.getParent() == null && node.getChildren() != null
+        && node.getChildren().size() == 1) {
+      if (node instanceof BooleanQueryNode) {
+        QueryNode c = node.getChildren().get(0);
+        if (c instanceof ModifierQueryNode
+            && ((ModifierQueryNode) c).getModifier() != Modifier.MOD_NOT) {
+          return ((ModifierQueryNode) c).getChild();
+        }
+      }
+    } else if (node instanceof AqpBooleanQueryNode) {
+
+      List<QueryNode> children = node.getChildren();
+      String thisOp = ((AqpBooleanQueryNode) node).getOperator();
+      boolean rewriteSafe = true;
+
+      QueryNode modifier;
+      QueryNode subClause;
+      for (int i = 0; i < children.size(); i++) {
+        modifier = children.get(i);
+        if (modifier.isLeaf()) {
+          rewriteSafe = false;
+          break;
+        }
+        subClause = modifier.getChildren().get(0);
+        if (!(subClause instanceof AqpBooleanQueryNode && ((AqpBooleanQueryNode) subClause)
+            .getOperator().equals(thisOp))) {
+          rewriteSafe = false;
+          break;
+        }
+      }
+
+      if (rewriteSafe == true) {
+        List<QueryNode> childrenList = new ArrayList<QueryNode>();
+
+        for (int i = 0; i < children.size(); i++) {
+          subClause = children.get(i).getChildren().get(0);
+          for (QueryNode nod : subClause.getChildren()) {
+            childrenList.add(nod);
+          }
+        }
+
+        children.clear();
+        node.set(childrenList);
+      }
+    }
+
+    return node;
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpFUZZYProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpFUZZYProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpFUZZYProcessor.java	(revision 0)
@@ -0,0 +1,116 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpFuzzyModifierNode;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardQueryConfigHandler;
+
+/**
+ * Sets the node into the BoostQueryNode, this processor requires that
+ * {@link AqpTMODIFIERProcessor} ran before. Because we depend on the proper
+ * tree shape.
+ * 
+ * <br/>
+ * 
+ * If BOOST node contains only one child, we return that child and do nothing.
+ * 
+ * <br/>
+ * 
+ * If BOOST node contains two children, we take the first and check its input,
+ * eg.
+ * 
+ * <pre>
+ *                  FUZZY
+ *                  /  \
+ *               ~0.1  rest
+ * </pre>
+ * 
+ * We create a new node {@@link AqpFuzzyModifierNode} (rest, 0.1) and
+ * return that node.
+ * 
+ * <br/>
+ * 
+ * Presence of the BOOST node child means user specified at least "^" We'll use
+ * the default from the configuration {@link BoostAttribute}
+ * 
+ * @see AqpTMODIFIERProcessor
+ * @see AqpFUZZYProcessor
+ */
+public class AqpFUZZYProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    if (node instanceof AqpANTLRNode
+        && ((AqpANTLRNode) node).getTokenLabel().equals("FUZZY")) {
+
+      if (node.getChildren().size() == 1) {
+        return node.getChildren().get(0);
+      }
+
+      Float fuzzy = getFuzzyValue(node);
+
+      if (fuzzy == null) {
+        return node.getChildren().get(node.getChildren().size() - 1);
+      }
+
+      return new AqpFuzzyModifierNode(node.getChildren().get(
+          node.getChildren().size() - 1), fuzzy);
+
+    }
+    return node;
+
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+  private Float getFuzzyValue(QueryNode fuzzyNode) throws QueryNodeException {
+    if (fuzzyNode.getChildren() != null) {
+
+      AqpANTLRNode child = ((AqpANTLRNode) fuzzyNode.getChildren().get(0));
+      String input = child.getTokenInput();
+      float fuzzy;
+
+      if (input.equals("~")) {
+        QueryConfigHandler queryConfig = getQueryConfigHandler();
+        if (queryConfig == null
+            || !queryConfig
+                .has(AqpStandardQueryConfigHandler.ConfigurationKeys.IMPLICIT_FUZZY)) {
+          throw new QueryNodeException(
+              new MessageImpl(
+                  QueryParserMessages.LUCENE_QUERY_CONVERSION_ERROR,
+                  "Configuration error: "
+                      + AqpStandardQueryConfigHandler.ConfigurationKeys.IMPLICIT_FUZZY
+                          .toString() + " is missing"));
+        }
+        fuzzy = queryConfig
+            .get(AqpStandardQueryConfigHandler.ConfigurationKeys.IMPLICIT_FUZZY);
+      } else {
+        fuzzy = Float.valueOf(input.replace("~", ""));
+      }
+
+      return fuzzy;
+
+    }
+    return null;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpMULTIVALUEProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpMULTIVALUEProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpMULTIVALUEProcessor.java	(revision 0)
@@ -0,0 +1,34 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+public class AqpMULTIVALUEProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    if (node instanceof AqpANTLRNode
+        && ((AqpANTLRNode) node).getTokenLabel().equals("MULTIVALUE")) {
+      return node;
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpFieldMapperProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpFieldMapperProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpFieldMapperProcessor.java	(revision 0)
@@ -0,0 +1,73 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+import java.util.Map;
+
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardQueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardQueryConfigHandler.ConfigurationKeys;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.ConfigurationKey;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+
+/**
+ * Looks at the QueryNode(s) and translates the field name if we have a mapping
+ * for it. It is used to change the field names on-the-fly
+ * 
+ * @see AqpFieldMapper
+ * @see QueryConfigHandler
+ * 
+ */
+public class AqpFieldMapperProcessor extends QueryNodeProcessorImpl {
+
+  private Map<String, String> fieldMap;
+  ConfigurationKey<Map<String, String>> mapKey = AqpStandardQueryConfigHandler.ConfigurationKeys.FIELD_MAPPER;
+
+  public AqpFieldMapperProcessor() {
+    // empty constructor
+  }
+
+  @Override
+  public QueryNode process(QueryNode queryTree) throws QueryNodeException {
+    if (getQueryConfigHandler().has(mapKey)) {
+      fieldMap = getQueryConfigHandler().get(mapKey);
+      if (this.fieldMap != null) {
+        return super.process(queryTree);
+      }
+    }
+
+    return queryTree;
+  }
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    if (node instanceof FieldQueryNode) {
+      String field = ((FieldQueryNode) node).getFieldAsString();
+      if (fieldMap.containsKey(field)) {
+        String newField = fieldMap.get(field);
+        if (newField == null) {
+          throw new QueryNodeException(new MessageImpl("Server error",
+              "The configuration error, field " + field
+                  + " is translated to: null"));
+        }
+        ((FieldQueryNode) node).setField(newField);
+      }
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQREGEXProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQREGEXProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQREGEXProcessor.java	(revision 0)
@@ -0,0 +1,45 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.RegexpQueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpAdsabsRegexQueryNode;
+
+/**
+ * Converts QREGEX node into @{link {@link RegexpQueryNode}. The field value is
+ * the @{link DefaultFieldAttribute} specified in the configuration.
+ * 
+ * <br/>
+ * 
+ * If the user specified a field, it will be set by the @{link
+ * AqpFIELDProcessor} Therefore the {@link AqpQNORMALProcessor} should run
+ * before it.
+ * 
+ * 
+ * @see QueryConfigHandler
+ * @see DefaultFieldAttribute
+ * 
+ */
+public class AqpQREGEXProcessor extends AqpQProcessor {
+
+  public boolean nodeIsWanted(AqpANTLRNode node) {
+    if (node.getTokenLabel().equals("QREGEX")) {
+      return true;
+    }
+    return false;
+  }
+
+  public QueryNode createQNode(AqpANTLRNode node) throws QueryNodeException {
+    String field = getDefaultFieldName();
+
+    AqpANTLRNode subChild = (AqpANTLRNode) node.getChildren().get(0);
+    String input = subChild.getTokenInput();
+    return new AqpAdsabsRegexQueryNode(field, input.substring(1,
+        input.length() - 1), subChild.getTokenStart(), subChild.getTokenEnd());
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpOPERATORProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpOPERATORProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpOPERATORProcessor.java	(revision 0)
@@ -0,0 +1,137 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.AndQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.OrQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpAndQueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpDefopQueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpNearQueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpNotQueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpOrQueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardQueryConfigHandler;
+
+/**
+ * This processor operates on OPERATOR nodes, these are the nodes with labels
+ * AND, OR, NOT, DEFOP, NEAR and possibly others. <br/>
+ * I have decided to create special QueryNodes for each type of the operator,
+ * because the default implementation ({@link AndQueryNode}, {@link OrQueryNode}
+ * ) was confusing.
+ * 
+ * <pre>
+ *   AND
+ *   	- creates {@link AqpAndQueryNode}
+ *   OR
+ *   	- creates {@link AqpOrQueryNode}
+ *   NOT
+ *   	- creates {@link AqpNotQueryNode}
+ *   NEAR
+ *   	- creates {@link AqpNearQueryNode}
+ *   WITH
+ *   	- not implemented yet
+ *   PARAGRAPH
+ *   	- not implemented yet
+ * </pre>
+ * 
+ * This processor should run after {@link AqpDEFOPProcessor}, and also after
+ * {@link AqpMODIFIERProcessor} because modifiers should have precedence over
+ * operators. Like in the query: "this OR +that"
+ * 
+ */
+public class AqpOPERATORProcessor extends AqpQProcessorPost {
+
+  @Override
+  public boolean nodeIsWanted(AqpANTLRNode node) {
+    if (node.getTokenName().equals("OPERATOR")) {
+      return true;
+    }
+    return false;
+  }
+
+  @Override
+  public QueryNode createQNode(AqpANTLRNode node) throws QueryNodeException {
+
+    String label = node.getTokenLabel();
+
+    if (label.equals("DEFOP")) {
+      return new AqpDefopQueryNode(node.getChildren(), getDefaultOperator());
+    } else if (label.equals("AND")) {
+      return new AqpAndQueryNode(node.getChildren());
+    } else if (label.equals("OR")) {
+      return new AqpOrQueryNode(node.getChildren());
+    } else if (label.equals("NOT")) {
+      return new AqpNotQueryNode(node.getChildren());
+    } else if (label.toUpperCase().contains("NEAR")) {
+      if (label.length() <= 4) {
+        return new AqpNearQueryNode(node.getChildren(),
+            getDefaultProximityValue());
+      } else {
+        int distance = Integer.parseInt(label.substring(4));
+        if (isProximityValueAllowed(distance)) {
+          return new AqpNearQueryNode(node.getChildren(), distance);
+        } else {
+          throw new QueryNodeException(new MessageImpl(
+              QueryParserMessages.INVALID_SYNTAX,
+              "Proximity is only allowed in a range: " + getRange()[0] + "-" + getRange()[1]));
+        }
+      }
+
+    } else {
+      throw new QueryNodeException(new MessageImpl(
+          QueryParserMessages.INVALID_SYNTAX, "Unknown operator " + label));
+    }
+
+  }
+
+  private Integer getDefaultProximityValue() throws QueryNodeException {
+    QueryConfigHandler queryConfig = getQueryConfigHandler();
+    if (queryConfig == null
+        || !queryConfig
+            .has(AqpStandardQueryConfigHandler.ConfigurationKeys.DEFAULT_PROXIMITY)) {
+      throw new QueryNodeException(new MessageImpl(
+          QueryParserMessages.LUCENE_QUERY_CONVERSION_ERROR,
+          "Configuration error: " + "DefaultProximity value is missing"));
+    }
+    return queryConfig
+        .get(AqpStandardQueryConfigHandler.ConfigurationKeys.DEFAULT_PROXIMITY);
+  }
+
+  private int[] getRange() {
+    QueryConfigHandler queryConfig = getQueryConfigHandler();
+    return queryConfig
+        .get(AqpStandardQueryConfigHandler.ConfigurationKeys.ALLOWED_PROXIMITY_RANGE);
+
+  }
+
+  private boolean isProximityValueAllowed(int userValue) {
+    int[] range = getRange();
+    if (userValue >= range[0] && userValue <= range[1]) {
+      return true;
+    }
+    return false;
+  }
+
+  protected StandardQueryConfigHandler.Operator getDefaultOperator()
+      throws QueryNodeException {
+    QueryConfigHandler queryConfig = getQueryConfigHandler();
+
+    if (queryConfig != null) {
+      if (queryConfig
+          .has(StandardQueryConfigHandler.ConfigurationKeys.DEFAULT_OPERATOR)) {
+        return queryConfig
+            .get(StandardQueryConfigHandler.ConfigurationKeys.DEFAULT_OPERATOR);
+      }
+    }
+    throw new QueryNodeException(new MessageImpl(
+        QueryParserMessages.LUCENE_QUERY_CONVERSION_ERROR,
+        "Configuration error: "
+            + StandardQueryConfigHandler.ConfigurationKeys.class.toString()
+            + " is missing"));
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpDEFOPProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpDEFOPProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpDEFOPProcessor.java	(revision 0)
@@ -0,0 +1,149 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.aqp.AqpQueryParser;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/**
+ * Finds the {@link AqpANTLRNode} with tokenLabel
+ * 
+ * <pre>
+ * DEFOP
+ * </pre>
+ * 
+ * and sets their @{code tokenInput} to be the name of the default operator.
+ * 
+ * If there is only one child, the child is returned and we remove the operator.
+ * This happens mainly for simple queries such as
+ * 
+ * <pre>
+ * field:value
+ * </pre>
+ * 
+ * But also for queries which are itself clauses, like:
+ * 
+ * <pre>
+ * +(this that)
+ * </pre>
+ * 
+ * which produces:
+ * 
+ * <pre>
+ *            DEFOP
+ *              |
+ *           MODIFIER
+ *            /   \
+ *               TMODIFIER
+ *                  |
+ *                CLAUSE
+ *                  | 
+ *                DEFOP
+ *                /   \
+ *          MODIFIER MODIFIER   
+ *             |        |
+ * </pre>
+ * 
+ * 
+ * @see DefaultOperatorAttribute
+ * @see AqpQueryParser#setDefaultOperator(org.apache.lucene.queryparser.flexible.standard.config.DefaultOperatorAttribute.Operator)
+ * 
+ */
+public class AqpDEFOPProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+
+    if (node instanceof AqpANTLRNode
+        && ((AqpANTLRNode) node).getTokenLabel().equals("DEFOP")) {
+
+      // only one child, we'll simplify the tree
+      if (node.getChildren().size() == 1) {
+        QueryNode child = node.getChildren().get(0);
+        while (child instanceof AqpANTLRNode
+            && ((AqpANTLRNode) child).getTokenLabel().equals("DEFOP")) {
+          child = child.getChildren().get(0);
+        }
+        return child;
+      }
+
+      /*
+       * This used to be here to modify the AST tree, but is now handled by the
+       * AqpOptimizationProcessor
+       * 
+       * AqpANTLRNode thisNode = (AqpANTLRNode) node;
+       * StandardQueryConfigHandler.Operator op = getDefaultOperator();
+       * 
+       * // Turn the DEFOP into the default operator
+       * thisNode.setTokenLabel(op.name());
+       * 
+       * List<QueryNode> children = node.getChildren(); if (children != null &&
+       * children.size() == 1) { AqpANTLRNode child = (AqpANTLRNode)
+       * children.get(0); if (child.getTokenName().equals("OPERATOR") ||
+       * child.getTokenLabel().equals("CLAUSE") ||
+       * child.getTokenLabel().equals("ATOM")) { return child; } } else if
+       * (children != null && children.size() > 1) { // several childeren
+       * (=clauses) below the operator // we check if we can put them together,
+       * ie // (this) AND (that) --> this AND that
+       * 
+       * String thisOp = thisNode.getTokenLabel(); String last = ((AqpANTLRNode)
+       * children.get(0)).getTokenLabel(); boolean rewriteSafe = true;
+       * 
+       * for (int i = 1; i < children.size(); i++) { AqpANTLRNode t =
+       * (AqpANTLRNode) children.get(i); String tt = t.getTokenLabel(); if
+       * (!(tt.equals(last) && t.getTokenLabel().equals(thisOp))) { rewriteSafe
+       * = false; break; } }
+       * 
+       * if (rewriteSafe == true) { QueryNode firstChild = children.get(0);
+       * List<QueryNode> childrenList = firstChild.getChildren();
+       * 
+       * for (int i = 1; i < children.size(); i++) { QueryNode otherChild =
+       * children.get(i); for (QueryNode nod : otherChild.getChildren()) {
+       * childrenList.add(nod); } }
+       * 
+       * children.clear(); thisNode.set(childrenList); } }
+       */
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+  protected StandardQueryConfigHandler.Operator getDefaultOperator()
+      throws QueryNodeException {
+    QueryConfigHandler queryConfig = getQueryConfigHandler();
+
+    if (queryConfig != null) {
+
+      if (queryConfig
+          .has(StandardQueryConfigHandler.ConfigurationKeys.DEFAULT_OPERATOR)) {
+        return queryConfig
+            .get(StandardQueryConfigHandler.ConfigurationKeys.DEFAULT_OPERATOR);
+      }
+    }
+    throw new QueryNodeException(new MessageImpl(
+        QueryParserMessages.LUCENE_QUERY_CONVERSION_ERROR,
+        "Configuration error: "
+            + StandardQueryConfigHandler.ConfigurationKeys.class.toString()
+            + " is missing"));
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpMODIFIERProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpMODIFIERProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpMODIFIERProcessor.java	(revision 0)
@@ -0,0 +1,92 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode.Modifier;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/**
+ * Creates a {@link ModifierQueryNode} from the MODIFIER node last child
+ * 
+ * If MODIFIER node contains only one child, we return that child and do
+ * nothing. <br/>
+ * 
+ * If BOOST node contains two children, we take the first and check its input,
+ * eg.
+ * 
+ * <pre>
+ *               MODIFIER
+ *                  /  \
+ *                 +  rest
+ * </pre>
+ * 
+ * We create a new node ModifierQueryNode(rest, Modifier) and return that node. <br/>
+ * 
+ * This processor should run before {@link AqpOPERATORProcessor} to ensure that
+ * local modifiers have precedence over the boolean operations. For example:
+ * 
+ * <pre>
+ * title:(+a -b c)
+ * </pre>
+ * 
+ * Should produce (when OR is a default operator):
+ * 
+ * <pre>
+ *  +title:a -title:b title:c
+ * </pre>
+ * 
+ * and when AND is the default operator:
+ * 
+ * <pre>
+ *  +title:a -title:b +title:c
+ * </pre>
+ * 
+ * @see Modifier
+ * @see AqpBooleanQueryNode
+ */
+public class AqpMODIFIERProcessor extends AqpQProcessor {
+
+  public boolean nodeIsWanted(AqpANTLRNode node) {
+    if (node.getTokenLabel().equals("MODIFIER")) {
+      return true;
+    }
+    return false;
+  }
+
+  public AqpANTLRNode getModifierNode(QueryNode node) {
+    return ((AqpANTLRNode) node.getChildren().get(0));
+  }
+
+  public QueryNode getValueNode(QueryNode node) {
+    return node.getChildren().get(node.getChildren().size() - 1);
+  }
+
+  public QueryNode createQNode(AqpANTLRNode node) throws QueryNodeException {
+
+    if (node.getChildren().size() == 1) {
+      return node.getChildren().get(0);
+    }
+
+    AqpANTLRNode modifierNode = getModifierNode(node);
+    String modifier = modifierNode.getTokenName();
+
+    QueryNode childNode = getValueNode(node);
+
+    if (modifier.equals("PLUS")) {
+      return new ModifierQueryNode(childNode,
+          ModifierQueryNode.Modifier.MOD_REQ);
+    } else if (modifier.equals("MINUS")) {
+      return new ModifierQueryNode(childNode,
+          ModifierQueryNode.Modifier.MOD_NOT);
+    } else {
+      throw new QueryNodeException(new MessageImpl(
+          QueryParserMessages.LUCENE_QUERY_CONVERSION_ERROR,
+          "Unknown modifier: " + modifier + "\n" + node.toString()));
+    }
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQProcessor.java	(revision 0)
@@ -0,0 +1,188 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.antlr.runtime.CharStream;
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.standard.parser.ParseException;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.aqp.config.AqpFeedback;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardQueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpCommonTree;
+
+/**
+ * A generic class that is used by other query processors, eg.
+ * {@link AqpQNORMALProcessor}
+ * 
+ * 
+ * 
+ */
+public class AqpQProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  public String defaultField = null;
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    if (node instanceof AqpANTLRNode) {
+      AqpANTLRNode n = (AqpANTLRNode) node;
+      if (nodeIsWanted(n)) {
+        return createQNode(n);
+      }
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+  public boolean nodeIsWanted(AqpANTLRNode node) {
+    throw new UnsupportedOperationException();
+  }
+
+  public QueryNode createQNode(AqpANTLRNode node) throws QueryNodeException {
+    throw new UnsupportedOperationException();
+  }
+
+  public String getDefaultFieldName() throws QueryNodeException {
+    QueryConfigHandler queryConfig = getQueryConfigHandler();
+
+    String defaultField = null;
+    if (queryConfig != null) {
+
+      if (queryConfig
+          .has(AqpStandardQueryConfigHandler.ConfigurationKeys.DEFAULT_FIELD)) {
+        defaultField = queryConfig
+            .get(AqpStandardQueryConfigHandler.ConfigurationKeys.DEFAULT_FIELD);
+      }
+      return defaultField;
+    }
+    throw new QueryNodeException(new MessageImpl(
+        QueryParserMessages.LUCENE_QUERY_CONVERSION_ERROR,
+        "Configuration error: DEFAULT_FIELD is missing"));
+  }
+
+  public AqpFeedback getFeedbackAttr() throws QueryNodeException {
+    QueryConfigHandler config = getQueryConfigHandler();
+    if (config.has(AqpStandardQueryConfigHandler.ConfigurationKeys.FEEDBACK)) {
+      return config
+          .get(AqpStandardQueryConfigHandler.ConfigurationKeys.FEEDBACK);
+    } else {
+      throw new QueryNodeException(new MessageImpl(
+          QueryParserMessages.NODE_ACTION_NOT_SUPPORTED,
+          "Configuration error, missing AqpFeedback.class in the config!"));
+    }
+  }
+
+  public QueryNode getTerminalNode(QueryNode node) {
+    while (!node.isLeaf()) {
+      return getTerminalNode(node.getChildren().get(
+          node.getChildren().size() - 1));
+    }
+    return node;
+  }
+
+  public static OriginalInput getOriginalInput(AqpANTLRNode node)
+      throws ParseException {
+
+    CharStream inputStream = getInputStream(node);
+    if (inputStream == null) {
+      throw new ParseException(new MessageImpl(
+          "The supplied tree doesn't have input stream"));
+    }
+    int[] startIndex = new int[] { inputStream.size() };
+    getTheLowestIndex(startIndex, node);
+    if (startIndex[0] == -1) {
+      throw new ParseException(new MessageImpl(
+          "We cannot find where the input starts"));
+    }
+    int[] lastIndex = new int[] { startIndex[0] };
+    getTheHighestIndex(lastIndex, node);
+    if (lastIndex[0] < startIndex[0]) {
+      throw new ParseException(new MessageImpl(
+          "We cannot find where the input ends"));
+    }
+    // if (lastIndex[0]+1 < inputStream.size()) {
+    // lastIndex[0] += 1;
+    // }
+    return new OriginalInput(
+        inputStream.substring(startIndex[0], lastIndex[0]), startIndex[0],
+        lastIndex[0]);
+  }
+
+  public static CharStream getInputStream(QueryNode node) {
+    if (node.isLeaf()) {
+      if (node instanceof AqpANTLRNode) {
+        if (((AqpANTLRNode) node).getTree().getToken().getInputStream() != null) {
+          return ((AqpANTLRNode) node).getTree().getToken().getInputStream();
+        }
+      }
+    } else {
+      for (QueryNode child : node.getChildren()) {
+        CharStream r = getInputStream(child);
+        if (r != null) {
+          return r;
+        }
+      }
+    }
+    return null;
+  }
+
+  private static void getTheHighestIndex(int[] i, QueryNode node) {
+    if (!node.isLeaf()) {
+      for (QueryNode n : node.getChildren()) {
+        getTheHighestIndex(i, n);
+      }
+    }
+    if (node instanceof AqpANTLRNode) {
+      int si = ((AqpANTLRNode) node).getInputTokenEnd();
+      if (i[0] < si) {
+        i[0] = si;
+      }
+    }
+  }
+
+  private static void getTheLowestIndex(int[] i, QueryNode node) {
+    if (!node.isLeaf()) {
+      for (QueryNode n : node.getChildren()) {
+        getTheLowestIndex(i, n);
+      }
+    }
+    if (node instanceof AqpANTLRNode) {
+      int si = ((AqpANTLRNode) node).getInputTokenStart();
+      if (si > -1 && si < i[0]) {
+        i[0] = si;
+      }
+    }
+  }
+
+  public static class OriginalInput {
+    public String value;
+    public int start;
+    public int end;
+
+    public OriginalInput(String value, int startIndex, int endIndex) {
+      this.value = value;
+      this.start = startIndex;
+      this.end = endIndex;
+    }
+
+    public String toString() {
+      return String.format("%s [%d:%d]", this.value, this.start, this.end);
+    }
+  }
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpATOMProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpATOMProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpATOMProcessor.java	(revision 0)
@@ -0,0 +1,50 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+public class AqpATOMProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+
+    if (node instanceof AqpANTLRNode
+        && ((AqpANTLRNode) node).getTokenLabel().equals("ATOM")) {
+
+      AqpANTLRNode atomNode = (AqpANTLRNode) node;
+
+      List<QueryNode> children = node.getChildren();
+      QueryNode modifierNode = children.get(0); // MODIFIER
+      node = children.get(1); // NUCLEUS
+
+      if (modifierNode.getChildren() != null) {
+        String modifier = ((AqpANTLRNode) modifierNode.getChildren().get(0))
+            .getTokenName();
+        node = new ModifierQueryNode(node,
+            modifier.equals("PLUS") ? ModifierQueryNode.Modifier.MOD_REQ
+                : ModifierQueryNode.Modifier.MOD_NOT);
+      }
+      return node;
+    }
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpTreeRewriteProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpTreeRewriteProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpTreeRewriteProcessor.java	(revision 0)
@@ -0,0 +1,76 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/*
+ * Processor which massages the AST tree before other processors work
+ * with it.
+ * 	- replaces chain of OPERATORs with the lowest ie. (AND (AND (AND..)))
+ *    becomes (AND ...); this happens only if the OPERATOR has one 
+ *    single child of type: OPERATOR, ATOM, CLAUSE
+ *    
+ *    Useful mostly for the DEFOP operator as our ANTLR grammars
+ *    usually group same clauses under one operator
+ *    
+ *  - 
+ */
+public class AqpTreeRewriteProcessor extends QueryNodeProcessorImpl {
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+
+    if (node instanceof AqpANTLRNode && node.getChildren() != null) {
+      List<QueryNode> children = node.getChildren();
+      AqpANTLRNode n = (AqpANTLRNode) node;
+      AqpANTLRNode child;
+
+      // turn (AND (AND (CLAUSE...))) into (AND (CLAUSE...))
+      // also (AND (ATOM ....)) into (ATOM...)
+      if (n.getTokenName().equals("OPERATOR") && children.size() == 1) {
+        child = (AqpANTLRNode) children.get(0);
+        if (child.getTokenName().equals("OPERATOR")
+            || child.getTokenName().equals("ATOM")
+            || child.getTokenName().equals("CLAUSE")) {
+          return child;
+        }
+      }
+
+      /*
+       * if (node.getParent()==null && children.size() > 1) { // it is a root
+       * mode String last = ((AqpANTLRNode)children.get(0)).getTokenLabel();
+       * boolean rewriteSafe = true; // check all children nodes are of the same
+       * type for (int i=1;i<children.size();i++) { AqpANTLRNode t =
+       * (AqpANTLRNode) children.get(i); String tt = t.getTokenLabel(); if
+       * (!(tt.equals(last) && t.getTokenName().equals("OPERATOR"))) {
+       * rewriteSafe = false; break; } } if (rewriteSafe==true) {
+       * 
+       * QueryNode firstChild = children.get(0); List<QueryNode> childrenList =
+       * firstChild.getChildren();
+       * 
+       * for (int i=1;i<children.size();i++) { QueryNode otherChild =
+       * children.get(i); for (QueryNode nod: otherChild.getChildren()) {
+       * childrenList.add(nod); } }
+       * 
+       * children.clear(); n.set(childrenList); } }
+       */
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQANYTHINGProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQANYTHINGProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQANYTHINGProcessor.java	(revision 0)
@@ -0,0 +1,26 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.MatchAllDocsQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/**
+ * Converts QANYTHING node into @{link {@link MatchAllDocsQueryNode}. The field
+ * value is the @{link DefaultFieldAttribute} specified in the configuration.
+ * 
+ */
+public class AqpQANYTHINGProcessor extends AqpQProcessor {
+
+  public boolean nodeIsWanted(AqpANTLRNode node) {
+    if (node.getTokenLabel().equals("QANYTHING")) {
+      return true;
+    }
+    return false;
+  }
+
+  public QueryNode createQNode(AqpANTLRNode node) throws QueryNodeException {
+    return new MatchAllDocsQueryNode();
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQPHRASEProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQPHRASEProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQPHRASEProcessor.java	(revision 0)
@@ -0,0 +1,46 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QuotedFieldQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.parser.EscapeQuerySyntaxImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/**
+ * Converts QPHRASE node into @{link {@link QuotedFieldQueryNode}. The field
+ * value is the @{link DefaultFieldAttribute} specified in the configuration.
+ * 
+ * <br/>
+ * 
+ * If the user specified a field, it will be set by the @{link
+ * AqpFIELDProcessor} Therefore the {@link AqpQPHRASEProcessor} should run
+ * before it.
+ * 
+ * 
+ * @see QueryConfigHandler
+ * @see DefaultFieldAttribute
+ * 
+ */
+public class AqpQPHRASEProcessor extends AqpQProcessor {
+
+  public boolean nodeIsWanted(AqpANTLRNode node) {
+    if (node.getTokenLabel().equals("QPHRASE")) {
+      return true;
+    }
+    return false;
+  }
+
+  public QueryNode createQNode(AqpANTLRNode node) throws QueryNodeException {
+    String field = getDefaultFieldName();
+
+    AqpANTLRNode subChild = (AqpANTLRNode) node.getChildren().get(0);
+
+    return new QuotedFieldQueryNode(field,
+        EscapeQuerySyntaxImpl.discardEscapeChar(subChild.getTokenInput()
+            .substring(1, subChild.getTokenInput().length() - 1)),
+        subChild.getTokenStart() + 1, subChild.getTokenEnd() - 1);
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQRANGEINProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQRANGEINProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQRANGEINProcessor.java	(revision 0)
@@ -0,0 +1,101 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.TermRangeQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.parser.EscapeQuerySyntaxImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/**
+ * Converts QRANGEIN node into @{link {@link ParametricQueryNode}. The field
+ * value is the @{link DefaultFieldAttribute} specified in the configuration.
+ * 
+ * Because QRANGE nodes have this shape:
+ * 
+ * <pre>
+ *                      QRANGE
+ *                      /    \
+ *                 QNORMAL  QPHRASE
+ *                   /          \
+ *                 some       "phrase"
+ * </pre>
+ * 
+ * It is important to queue {@AqpQRANGEEProcessor} and
+ * {@AqpQRANGEINProcessor} <b>before</b> processors that
+ * transform QNORMAL, QPHRASE and other Q nodes <br/>
+ * 
+ * If the user specified a field, it will be set by the @{link
+ * AqpFIELDProcessor} Therefore this processor should queue before @{link
+ * AqpFIELDProcessor}.
+ * 
+ * 
+ * @see QueryConfigHandler
+ * @see DefaultFieldAttribute
+ * @see AqpQRANGEEXProcessor
+ * @see AqpQueryNodeProcessorPipeline
+ * 
+ */
+public class AqpQRANGEINProcessor extends AqpQProcessor {
+
+  protected boolean lowerInclusive = true;
+  protected boolean upperInclusive = true;
+
+  public boolean nodeIsWanted(AqpANTLRNode node) {
+    if (node.getTokenLabel().equals("QRANGEIN")) {
+      return true;
+    }
+    return false;
+  }
+
+  public QueryNode createQNode(AqpANTLRNode node) throws QueryNodeException {
+    String field = getDefaultFieldName();
+
+    AqpANTLRNode lowerNode = (AqpANTLRNode) node.getChildren().get(0);
+    AqpANTLRNode upperNode = (AqpANTLRNode) node.getChildren().get(1);
+
+    NodeData lower = getTokenInput(lowerNode);
+    NodeData upper = getTokenInput(upperNode);
+
+    FieldQueryNode lowerBound = new FieldQueryNode(field,
+        EscapeQuerySyntaxImpl.discardEscapeChar(lower.value), lower.start,
+        lower.end);
+    FieldQueryNode upperBound = new FieldQueryNode(field,
+        EscapeQuerySyntaxImpl.discardEscapeChar(upper.value), upper.start,
+        upper.end);
+
+    return new TermRangeQueryNode(lowerBound, upperBound, lowerInclusive,
+        upperInclusive);
+
+  }
+
+  public NodeData getTokenInput(AqpANTLRNode node) {
+    String label = node.getTokenLabel();
+    AqpANTLRNode subNode = (AqpANTLRNode) node.getChildren().get(0);
+
+    if (label.equals("QANYTHING")) {
+      return new NodeData("*", subNode.getTokenStart(), subNode.getTokenEnd());
+    } else if (label.contains("PHRASE")) {
+      return new NodeData(subNode.getTokenInput().substring(1,
+          subNode.getTokenInput().length() - 1), subNode.getTokenStart() + 1,
+          subNode.getTokenEnd() - 1);
+    } else {
+      return new NodeData(subNode.getTokenInput(), subNode.getTokenStart(),
+          subNode.getTokenEnd());
+    }
+  }
+
+  class NodeData {
+    public String value;
+    public int start;
+    public int end;
+
+    NodeData(String value, int start, int end) {
+      this.value = value;
+      this.start = start;
+      this.end = end;
+    }
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpFuzzyModifierProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpFuzzyModifierProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpFuzzyModifierProcessor.java	(revision 0)
@@ -0,0 +1,108 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.FuzzyQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QuotedFieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.SlopQueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.standard.nodes.WildcardQueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.builders.AqpSlowFuzzyQueryNodeBuilder;
+import org.apache.lucene.queryparser.flexible.aqp.config.AqpFeedback;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpFuzzyModifierNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.SlowFuzzyQueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardQueryConfigHandler;
+
+/**
+ * Rewrites the query node which is below the {@link AqpFuzzyModifierNode}
+ * 
+ * The actions are: </br> 
+ * 
+ * 
+ * {@link FieldQueryNode} </br> 
+ *    - query is turned into {@link FuzzyQueryNode} or {@link SlowFuzzyQueryNode} </br>
+ *      depending the configuration of {@link AqpStandardQueryConfigHandler}.ConfigurationKeys.ALLOW_SLOW_FUZZY
+ *    - invalid syntax is raised if not 0.0 > fuzzy < 1.0  </br>
+ *  
+ * {@link WildcardQueryNode}, {@link QuotedFieldQueryNode} </br>
+ *   - becomes {@link SlopQueryNode} </br>
+ * 
+ * 
+ * {@link QuotedFieldQueryNode} </br>
+ *   - wrapped with {@link SlopQueryNode} </br>
+ * 
+ * 
+ */
+public class AqpFuzzyModifierProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    if (node instanceof AqpFuzzyModifierNode) {
+      QueryNode child = ((AqpFuzzyModifierNode) node).getChild();
+      Float fuzzy = ((AqpFuzzyModifierNode) node).getFuzzyValue();
+
+      QueryConfigHandler config = getQueryConfigHandler();
+
+      if (child instanceof QuotedFieldQueryNode
+          || child instanceof WildcardQueryNode) {
+
+        if (fuzzy.intValue() < fuzzy) {
+
+          if (config
+              .has(AqpStandardQueryConfigHandler.ConfigurationKeys.FEEDBACK)) {
+            AqpFeedback feedback = config
+                .get(AqpStandardQueryConfigHandler.ConfigurationKeys.FEEDBACK);
+            feedback.sendEvent(feedback.createEvent(AqpFeedback.TYPE.WARN,
+                this.getClass(), node,
+                "For phrases and wildcard queries the float attribute " + fuzzy
+                    + " is automatically converted to: " + fuzzy.intValue()));
+          }
+        }
+        return new SlopQueryNode(child, fuzzy.intValue());
+      } else if (child instanceof FieldQueryNode) {
+
+        FieldQueryNode fn = (FieldQueryNode) child;
+
+        if (config
+            .has(AqpStandardQueryConfigHandler.ConfigurationKeys.ALLOW_SLOW_FUZZY) != false
+            && config
+                .get(AqpStandardQueryConfigHandler.ConfigurationKeys.ALLOW_SLOW_FUZZY) == true) {
+          if (fuzzy > 0.0f && fuzzy <= 1.0f) {
+            return new SlowFuzzyQueryNode(fn.getFieldAsString(),
+                fn.getTextAsString(), fuzzy, fn.getBegin(), fn.getEnd());
+          }
+        }
+
+        return new FuzzyQueryNode(fn.getFieldAsString(), fn.getTextAsString(),
+            fuzzy, fn.getBegin(), fn.getEnd());
+
+      } else {
+        throw new QueryNodeException(new MessageImpl(
+            QueryParserMessages.INVALID_SYNTAX, node.toString()
+                + "\nUse of ~ is not allowed here"));
+      }
+
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQProcessorPost.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQProcessorPost.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQProcessorPost.java	(revision 0)
@@ -0,0 +1,42 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/**
+ * The class that is used for ANTLR query nodes, it is the same as
+ * {@link AqpQPHRASEProcessor}, the only difference is that it works in
+ * postProcessor phase (instead of pre-process phase)
+ * 
+ * 
+ */
+
+public class AqpQProcessorPost extends AqpQProcessor {
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    if (node instanceof AqpANTLRNode) {
+      AqpANTLRNode n = (AqpANTLRNode) node;
+      if (nodeIsWanted(n)) {
+        return createQNode(n);
+      }
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  public boolean nodeIsWanted(AqpANTLRNode node) {
+    throw new UnsupportedOperationException();
+  }
+
+  @Override
+  public QueryNode createQNode(AqpANTLRNode node) throws QueryNodeException {
+    throw new UnsupportedOperationException();
+  }
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQNORMALProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQNORMALProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQNORMALProcessor.java	(revision 0)
@@ -0,0 +1,46 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.standard.parser.EscapeQuerySyntaxImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/**
+ * Converts QNORMAL node into @{link {@link FieldQueryNode}. The field value is
+ * the @{link DefaultFieldAttribute} specified in the configuration.
+ * 
+ * <br/>
+ * 
+ * If the user specified a field, it will be set by the @{link
+ * AqpFIELDProcessor} Therefore the {@link AqpQNORMALProcessor} should run
+ * before it.
+ * 
+ * 
+ * @see QueryConfigHandler
+ * @see DefaultFieldAttribute
+ * 
+ */
+public class AqpQNORMALProcessor extends AqpQProcessor {
+
+  public boolean nodeIsWanted(AqpANTLRNode node) {
+    if (node.getTokenLabel().equals("QNORMAL")) {
+      return true;
+    }
+    return false;
+  }
+
+  public QueryNode createQNode(AqpANTLRNode node) throws QueryNodeException {
+    String field = getDefaultFieldName();
+
+    AqpANTLRNode subChild = (AqpANTLRNode) node.getChildren().get(0);
+
+    return new FieldQueryNode(field,
+        EscapeQuerySyntaxImpl.discardEscapeChar(subChild.getTokenInput()),
+        subChild.getTokenStart(), subChild.getTokenEnd());
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQTRUNCATEDProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQTRUNCATEDProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQTRUNCATEDProcessor.java	(revision 0)
@@ -0,0 +1,55 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import org.apache.lucene.queryparser.flexible.messages.MessageImpl;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.messages.QueryParserMessages;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.WildcardQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.parser.EscapeQuerySyntaxImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/**
+ * Converts QTRUNCATED node into @{link {@link WildcardQueryNode}. The field
+ * value used is the @{link DefaultFieldAttribute} specified in the
+ * configuration.
+ * 
+ * <br/>
+ * 
+ * If the user specified a field, it will be set by the @{link
+ * AqpFIELDProcessor} Therefore the {@link AqpQTRUNCATEDProcessor} should run
+ * before it.
+ * 
+ * 
+ * @see QueryConfigHandler
+ * @see DefaultFieldAttribute
+ * 
+ */
+public class AqpQTRUNCATEDProcessor extends AqpQProcessor {
+
+  public boolean nodeIsWanted(AqpANTLRNode node) {
+    if (node.getTokenLabel().equals("QTRUNCATED")) {
+      return true;
+    }
+    return false;
+  }
+
+  public QueryNode createQNode(AqpANTLRNode node) throws QueryNodeException {
+    String field = getDefaultFieldName();
+
+    AqpANTLRNode subChild = (AqpANTLRNode) node.getChildren().get(0);
+    String input = subChild.getTokenInput();
+
+    if (input.contains("*?") || input.contains("?*")) {
+      throw new QueryNodeException(new MessageImpl(
+          QueryParserMessages.INVALID_SYNTAX,
+          "It is not allowed to put * next to ?" + input));
+    }
+
+    return new WildcardQueryNode(field,
+        EscapeQuerySyntaxImpl.discardEscapeChar(input),
+        subChild.getTokenStart(), subChild.getTokenEnd());
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQRANGEEXProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQRANGEEXProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQRANGEEXProcessor.java	(revision 0)
@@ -0,0 +1,49 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/**
+ * Converts QRANGEEX node into @{link {@link ParametricQueryNode}. The field
+ * value is the @{link DefaultFieldAttribute} specified in the configuration.
+ * 
+ * Because QRANGE nodes have this shape:
+ * 
+ * <pre>
+ *                      QRANGE
+ *                      /    \
+ *                 QNORMAL  QPHRASE
+ *                   /          \
+ *                 some       "phrase"
+ * </pre>
+ * 
+ * It is important to queue {@AqpQRANGEEProcessor} and
+ * {@AqpQRANGEINProcessor} <b>before</b> processors that
+ * transform QNORMAL, QPHRASE and other Q nodes <br/>
+ * 
+ * If the user specified a field, it will be set by the @{link
+ * AqpFIELDProcessor} Therefore this processor should queue before @{link
+ * AqpFIELDProcessor}.
+ * 
+ * 
+ * @see QueryConfigHandler
+ * @see DefaultFieldAttribute
+ * @see AqpQRANGEINProcessor
+ * @see AqpQueryNodeProcessorPipeline
+ * 
+ */
+public class AqpQRANGEEXProcessor extends AqpQRANGEINProcessor {
+
+  public AqpQRANGEEXProcessor() {
+    lowerInclusive = false;
+    upperInclusive = false;
+  }
+
+  public boolean nodeIsWanted(AqpANTLRNode node) {
+    if (node.getTokenLabel().equals("QRANGEEX")) {
+      return true;
+    }
+    return false;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpCLAUSEProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpCLAUSEProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpCLAUSEProcessor.java	(revision 0)
@@ -0,0 +1,43 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.GroupQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/**
+ * Converts CLAUSE node into @{link {@link GroupQueryNode}
+ * 
+ * 
+ */
+public class AqpCLAUSEProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+
+    if (node instanceof AqpANTLRNode
+        && ((AqpANTLRNode) node).getTokenLabel().equals("CLAUSE")) {
+
+      return new GroupQueryNode(node.getChildren().get(0));
+      // return new BooleanQueryNode(node.getChildren());
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpNUCLEUSProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpNUCLEUSProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpNUCLEUSProcessor.java	(revision 0)
@@ -0,0 +1,56 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.standard.parser.EscapeQuerySyntaxImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpUtils;
+
+public class AqpNUCLEUSProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    if (node instanceof AqpANTLRNode
+        && ((AqpANTLRNode) node).getTokenLabel().equals("NUCLEUS")) {
+      List<QueryNode> children = node.getChildren();
+      AqpANTLRNode fieldNode = (AqpANTLRNode) children.remove(0);
+      String field = getFieldValue(fieldNode);
+      QueryNode valueNode = children.get(0);
+      if (field != null) {
+        AqpUtils.applyFieldToAllChildren(EscapeQuerySyntaxImpl.discardEscapeChar(field)
+            .toString(), valueNode);
+      }
+      return valueNode;
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+  private String getFieldValue(AqpANTLRNode fieldNode)
+      throws QueryNodeException {
+
+    if (fieldNode != null && fieldNode.getChildren() != null) {
+      return ((AqpANTLRNode) fieldNode.getChildren().get(0)).getTokenInput();
+    }
+    return null;
+
+  }
+
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQPHRASETRUNCProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQPHRASETRUNCProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpQPHRASETRUNCProcessor.java	(revision 0)
@@ -0,0 +1,47 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.WildcardQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.parser.EscapeQuerySyntaxImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/**
+ * Converts QPHRASETRUNC node into @{link {@link WildcardQueryNode}. The field
+ * value used is the @{link DefaultFieldAttribute} specified in the
+ * configuration.
+ * 
+ * <br/>
+ * 
+ * If the user specified a field, it will be set by the @{link
+ * AqpFIELDProcessor} Therefore the {@link AqpQTRUNCATEDProcessor} should run
+ * before it.
+ * 
+ * 
+ * @see QueryConfigHandler
+ * @see DefaultFieldAttribute
+ * 
+ */
+public class AqpQPHRASETRUNCProcessor extends AqpQProcessor {
+
+  public boolean nodeIsWanted(AqpANTLRNode node) {
+    if (node.getTokenLabel().equals("QPHRASETRUNC")) {
+      return true;
+    }
+    return false;
+  }
+
+  public QueryNode createQNode(AqpANTLRNode node) throws QueryNodeException {
+    String field = getDefaultFieldName();
+
+    AqpANTLRNode subChild = (AqpANTLRNode) node.getChildren().get(0);
+
+    return new WildcardQueryNode(field,
+        EscapeQuerySyntaxImpl.discardEscapeChar(subChild.getTokenInput()
+            .substring(1, subChild.getTokenInput().length() - 1)),
+        subChild.getTokenStart() + 1, subChild.getTokenEnd() - 1);
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpAnalyzerQueryNodeProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpAnalyzerQueryNodeProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpAnalyzerQueryNodeProcessor.java	(revision 0)
@@ -0,0 +1,402 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.io.IOException;
+import java.io.StringReader;
+import java.util.ArrayList;
+import java.util.LinkedList;
+import java.util.List;
+
+import org.apache.lucene.analysis.Analyzer;
+import org.apache.lucene.analysis.CachingTokenFilter;
+import org.apache.lucene.analysis.TokenStream;
+import org.apache.lucene.analysis.tokenattributes.CharTermAttribute;
+import org.apache.lucene.analysis.tokenattributes.OffsetAttribute;
+import org.apache.lucene.analysis.tokenattributes.PositionIncrementAttribute;
+import org.apache.lucene.analysis.tokenattributes.TypeAttribute;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.FuzzyQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.GroupQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.NoTokenFoundQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QuotedFieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.RangeQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.TextableQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.TokenizedPhraseQueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler.ConfigurationKeys;
+import org.apache.lucene.queryparser.flexible.standard.nodes.MultiPhraseQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.RegexpQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.StandardBooleanQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.nodes.WildcardQueryNode;
+import org.apache.lucene.queryparser.flexible.standard.processors.AnalyzerQueryNodeProcessor;
+
+/**
+ * This is an improved version of the {@link AnalyzerQueryNodeProcessor} it is
+ * better because it keeps track of the position offset which is absolutely
+ * indispensable for proper parsing of expanded queries. And also we save the
+ * type attribute name with the node
+ * 
+ * TODO: send a patch and make them accept it
+ * 
+ * This processor verifies if {@link ConfigurationKeys#ANALYZER} is defined in
+ * the {@link QueryConfigHandler}. If it is and the analyzer is not
+ * <code>null</code>, it looks for every {@link FieldQueryNode} that is not
+ * {@link WildcardQueryNode}, {@link FuzzyQueryNode} or {@link RangeQueryNode}
+ * contained in the query node tree, then it applies the analyzer to that
+ * {@link FieldQueryNode} object. <br/>
+ * <br/>
+ * If the analyzer return only one term, the returned term is set to the
+ * {@link FieldQueryNode} and it's returned. <br/>
+ * <br/>
+ * If the analyzer return more than one term, a {@link TokenizedPhraseQueryNode}
+ * or {@link MultiPhraseQueryNode} is created, whether there is one or more
+ * terms at the same position, and it's returned. <br/>
+ * <br/>
+ * If no term is returned by the analyzer a {@link NoTokenFoundQueryNode} object
+ * is returned. <br/>
+ * 
+ * @see ConfigurationKeys#ANALYZER
+ * @see Analyzer
+ * @see TokenStream
+ */
+
+public class AqpAnalyzerQueryNodeProcessor extends QueryNodeProcessorImpl {
+
+  public String TYPE_ATTRIBUTE = "token_type_attribute";
+  private Analyzer analyzer;
+
+  private boolean positionIncrementsEnabled;
+
+  public AqpAnalyzerQueryNodeProcessor() {
+    // empty constructor
+  }
+
+  @Override
+  public QueryNode process(QueryNode queryTree) throws QueryNodeException {
+    Analyzer analyzer = getQueryConfigHandler().get(ConfigurationKeys.ANALYZER);
+
+    if (analyzer != null) {
+      this.analyzer = analyzer;
+      this.positionIncrementsEnabled = false;
+      Boolean positionIncrementsEnabled = getQueryConfigHandler().get(
+          ConfigurationKeys.ENABLE_POSITION_INCREMENTS);
+
+      if (positionIncrementsEnabled != null) {
+        this.positionIncrementsEnabled = positionIncrementsEnabled;
+      }
+
+      if (this.analyzer != null) {
+        return super.process(queryTree);
+      }
+
+    }
+
+    return queryTree;
+
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+
+    if (node instanceof TextableQueryNode
+        && !(node instanceof WildcardQueryNode)
+        && !(node instanceof FuzzyQueryNode)
+        && !(node instanceof RegexpQueryNode)
+        && !(node.getParent() instanceof RangeQueryNode)) {
+
+      FieldQueryNode fieldNode = ((FieldQueryNode) node);
+      int queryStart = Math.max(fieldNode.getBegin(), 0); // could be -1
+      String text = fieldNode.getTextAsString();
+      String field = fieldNode.getFieldAsString();
+
+      TokenStream source;
+      try {
+        source = this.analyzer.tokenStream(field, new StringReader(text));
+        source.reset();
+      } catch (IOException e1) {
+        throw new RuntimeException(e1);
+      }
+      CachingTokenFilter buffer = new CachingTokenFilter(source);
+
+      PositionIncrementAttribute posIncrAtt = null;
+      int numTokens = 0;
+      int positionCount = 0;
+      boolean severalTokensAtSamePosition = false;
+
+      if (buffer.hasAttribute(PositionIncrementAttribute.class)) {
+        posIncrAtt = buffer.getAttribute(PositionIncrementAttribute.class);
+      }
+
+      TypeAttribute typeAtt = null;
+      if (buffer.hasAttribute(TypeAttribute.class)) {
+        typeAtt = buffer.getAttribute(TypeAttribute.class);
+      }
+
+      try {
+
+        while (buffer.incrementToken()) {
+          numTokens++;
+          int positionIncrement = (posIncrAtt != null) ? posIncrAtt
+              .getPositionIncrement() : 1;
+          if (positionIncrement != 0) {
+            positionCount += positionIncrement;
+
+          } else {
+            severalTokensAtSamePosition = true;
+          }
+
+        }
+
+      } catch (IOException e) {
+        // ignore
+      }
+
+      try {
+        // rewind the buffer stream
+        buffer.reset();
+
+        // close original stream - all tokens buffered
+        source.close();
+      } catch (IOException e) {
+        // ignore
+      }
+
+      if (!buffer.hasAttribute(CharTermAttribute.class)) {
+        return new NoTokenFoundQueryNode();
+      }
+
+      CharTermAttribute termAtt = buffer.getAttribute(CharTermAttribute.class);
+
+      int offsetStart = -1;
+      int offsetEnd = -1;
+      OffsetAttribute offsetAtt;
+      if (buffer.hasAttribute(OffsetAttribute.class)) {
+        offsetAtt = buffer.getAttribute(OffsetAttribute.class);
+      } else {
+        offsetAtt = null;
+      }
+
+      if (numTokens == 0) {
+        return new NoTokenFoundQueryNode();
+
+      } else if (numTokens == 1) {
+        String term = null;
+        try {
+          boolean hasNext;
+          hasNext = buffer.incrementToken();
+          assert hasNext == true;
+          term = termAtt.toString();
+
+        } catch (IOException e) {
+          // safe to ignore, because we know the number of tokens
+        }
+
+        fieldNode.setText(term);
+        if (offsetAtt != null) {
+          fieldNode.setBegin(queryStart + offsetAtt.startOffset());
+          fieldNode.setEnd(queryStart + offsetAtt.endOffset());
+        }
+        if (typeAtt != null)
+          fieldNode.setTag(TYPE_ATTRIBUTE, typeAtt.type());
+        return fieldNode;
+
+      } else if (severalTokensAtSamePosition
+          || !(node instanceof QuotedFieldQueryNode)) {
+        if (positionCount == 1 || !(node instanceof QuotedFieldQueryNode)) {
+          // no phrase query:
+          LinkedList<QueryNode> children = new LinkedList<QueryNode>();
+
+          for (int i = 0; i < numTokens; i++) {
+            String term = null;
+            offsetStart = offsetEnd = -1;
+            try {
+              boolean hasNext = buffer.incrementToken();
+              assert hasNext == true;
+              term = termAtt.toString();
+              if (offsetAtt != null) {
+                offsetStart = queryStart + offsetAtt.startOffset();
+                offsetEnd = queryStart + offsetAtt.endOffset();
+              }
+
+            } catch (IOException e) {
+              // safe to ignore, because we know the number of tokens
+            }
+
+            FieldQueryNode fq = new FieldQueryNode(field, term, offsetStart,
+                offsetEnd);
+            if (typeAtt != null)
+              fq.setTag(TYPE_ATTRIBUTE, typeAtt.type());
+            children.add(fq);
+
+          }
+          return new GroupQueryNode(new StandardBooleanQueryNode(children,
+              positionCount == 1));
+        } else {
+          // phrase query:
+          MultiPhraseQueryNode mpq = new MultiPhraseQueryNode();
+
+          List<FieldQueryNode> multiTerms = new ArrayList<FieldQueryNode>();
+          int position = -1;
+          int i = 0;
+          int termGroupCount = 0;
+
+          for (; i < numTokens; i++) {
+            String term = null;
+            offsetStart = offsetEnd = -1;
+            int positionIncrement = 1;
+            String tokenType = null;
+            try {
+              boolean hasNext = buffer.incrementToken();
+              assert hasNext == true;
+              term = termAtt.toString();
+              if (posIncrAtt != null) {
+                positionIncrement = posIncrAtt.getPositionIncrement();
+              }
+              if (offsetAtt != null) {
+                offsetStart = queryStart + offsetAtt.startOffset();
+                offsetEnd = queryStart + offsetAtt.endOffset();
+              }
+              if (typeAtt != null)
+                tokenType = typeAtt.type();
+            } catch (IOException e) {
+              // safe to ignore, because we know the number of tokens
+            }
+
+            if (positionIncrement > 0 && multiTerms.size() > 0) {
+
+              for (FieldQueryNode termNode : multiTerms) {
+
+                if (this.positionIncrementsEnabled) {
+                  termNode.setPositionIncrement(position);
+                } else {
+                  termNode.setPositionIncrement(termGroupCount);
+                }
+
+                mpq.add(termNode);
+
+              }
+
+              // Only increment once for each "group" of
+              // terms that were in the same position:
+              termGroupCount++;
+
+              multiTerms.clear();
+
+            }
+
+            position += positionIncrement;
+            FieldQueryNode fq = new FieldQueryNode(field, term, offsetStart,
+                offsetEnd);
+            fq.setTag(TYPE_ATTRIBUTE, tokenType);
+            multiTerms.add(fq);
+
+          }
+
+          for (FieldQueryNode termNode : multiTerms) {
+
+            if (this.positionIncrementsEnabled) {
+              termNode.setPositionIncrement(position);
+
+            } else {
+              termNode.setPositionIncrement(termGroupCount);
+            }
+
+            mpq.add(termNode);
+
+          }
+
+          return mpq;
+
+        }
+
+      } else {
+
+        TokenizedPhraseQueryNode pq = new TokenizedPhraseQueryNode();
+
+        int position = -1;
+
+        for (int i = 0; i < numTokens; i++) {
+          String term = null;
+          int positionIncrement = 1;
+          offsetStart = offsetEnd = -1;
+
+          try {
+            boolean hasNext = buffer.incrementToken();
+            assert hasNext == true;
+            term = termAtt.toString();
+
+            if (posIncrAtt != null) {
+              positionIncrement = posIncrAtt.getPositionIncrement();
+            }
+
+            if (offsetAtt != null) {
+              offsetStart = queryStart + offsetAtt.startOffset();
+              offsetEnd = queryStart + offsetAtt.endOffset();
+            }
+
+          } catch (IOException e) {
+            // safe to ignore, because we know the number of tokens
+          }
+
+          FieldQueryNode newFieldNode = new FieldQueryNode(field, term,
+              offsetStart, offsetEnd);
+          if (typeAtt != null)
+            newFieldNode.setTag(TYPE_ATTRIBUTE, typeAtt.type());
+
+          if (this.positionIncrementsEnabled) {
+            position += positionIncrement;
+            newFieldNode.setPositionIncrement(position);
+
+          } else {
+            newFieldNode.setPositionIncrement(i);
+          }
+
+          pq.add(newFieldNode);
+
+        }
+
+        return pq;
+
+      }
+
+    }
+
+    return node;
+
+  }
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+
+    return node;
+
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+
+    return children;
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpMULTITERMProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpMULTITERMProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpMULTITERMProcessor.java	(revision 0)
@@ -0,0 +1,82 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.BoostQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.ModifierQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.OrQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.core.util.UnescapedCharSequence;
+import org.apache.lucene.queryparser.flexible.standard.parser.EscapeQuerySyntaxImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpUtils;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpUtils.Modifier;
+
+public class AqpMULTITERMProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    if (node instanceof AqpANTLRNode
+        && ((AqpANTLRNode) node).getTokenLabel().equals("MULTITERM")) {
+      AqpANTLRNode mNode = (AqpANTLRNode) node;
+      AqpANTLRNode modifierNode = (AqpANTLRNode) mNode.getChild("MODIFIER");
+      AqpANTLRNode fieldNode = (AqpANTLRNode) mNode.getChild("FIELD");
+      AqpANTLRNode multiNode = (AqpANTLRNode) mNode.getChild("MULTIATOM");
+      AqpANTLRNode tModifierNode = (AqpANTLRNode) mNode.getChild("TMODIFIER");
+
+      String field = AqpUtils.getFirstChildInputString(fieldNode);
+      Modifier modifier = AqpUtils.getFirstChildInputModifier(modifierNode);
+
+      if (field != null) {
+        AqpUtils.applyFieldToAllChildren(EscapeQuerySyntaxImpl
+            .discardEscapeChar(field).toString(), multiNode);
+      }
+
+      node = new OrQueryNode(multiNode.getChildren());
+
+      if (tModifierNode != null) {
+        AqpANTLRNode boostNode = tModifierNode.getChild("BOOST");
+        Float boost = AqpUtils.getFirstChildInputFloat(boostNode);
+        if (boost != null) {
+          node = new BoostQueryNode(node, boost);
+        }
+      }
+
+      if (modifier != null) {
+        node = new ModifierQueryNode(node,
+            modifier == Modifier.PLUS ? ModifierQueryNode.Modifier.MOD_REQ
+                : ModifierQueryNode.Modifier.MOD_NOT);
+      }
+
+      return node;
+
+    }
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+  private String getFieldValue(AqpANTLRNode fieldNode)
+      throws QueryNodeException {
+
+    if (fieldNode != null && fieldNode.getChildren() != null) {
+      return ((AqpANTLRNode) fieldNode.getChildren().get(0)).getTokenInput();
+    }
+    return null;
+
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpTMODIFIERProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpTMODIFIERProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpTMODIFIERProcessor.java	(revision 0)
@@ -0,0 +1,98 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+
+/**
+ * TMODIFIER node contains FUZZY, BOOST, FIELD nodes. This processor changes the
+ * tree from this shape:
+ * 
+ * <pre>
+ *               TMODIFIER
+ *               /   |   \
+ *           BOOST FUZZY FIELD
+ *             /           \
+ *            ^1           ...
+ * </pre>
+ * 
+ * To this shape:
+ * 
+ * <pre>
+ *               BOOST
+ *                / \
+ *              ^1  FUZZY
+ *                    |
+ *                    FIELD
+ *                      \
+ *                     ...
+ * </pre>
+ * 
+ * After the processor ran, the TMODIFIER node is removed and we return the
+ * FUZZY node <br/>
+ * 
+ * If TMODIFIER contains only single child, we return that child (thus remove
+ * the TMODIFIER node from the tree). <br/>
+ * 
+ * @see AqpFUZZYProcessor
+ * @see AqpBOOSTProcessor
+ * @see AqpFIELDProcessor
+ */
+public class AqpTMODIFIERProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+
+    if (node instanceof AqpANTLRNode
+        && ((AqpANTLRNode) node).getTokenLabel().equals("TMODIFIER")) {
+
+      List<QueryNode> children = node.getChildren();
+
+      if (children.size() == 1) {
+        return children.get(0);
+      }
+
+      QueryNode masterChild = null;
+      QueryNode currentChild;
+      List<QueryNode> currentChildren;
+
+      for (int i = 0; i < children.size(); i++) {
+        currentChild = children.get(i);
+        if (currentChild.isLeaf()) {
+          continue;
+        }
+        if (masterChild == null) {
+          masterChild = currentChild;
+          node = masterChild;
+          continue;
+        }
+        currentChildren = masterChild.getChildren();
+        currentChildren.add(currentChild);
+        // masterChild.set(currentChildren);
+        masterChild = children.get(i);
+      }
+
+      return node;
+
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpFIELDProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpFIELDProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpFIELDProcessor.java	(revision 0)
@@ -0,0 +1,65 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldableNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.standard.parser.EscapeQuerySyntaxImpl;
+import org.apache.lucene.queryparser.flexible.aqp.nodes.AqpANTLRNode;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpUtils;
+
+/**
+ * This processor applies the user-submitted value to all {@link FieldableNode}
+ * nodes which are below it. The FIELD node itself will be discarded. <br/>
+ * If the FIELD has only one child, the child will be returned
+ * 
+ * @see FieldableNode
+ * @see AqpQNORMALProcessor and similar
+ * 
+ */
+public class AqpFIELDProcessor extends QueryNodeProcessorImpl implements
+    QueryNodeProcessor {
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    if (node instanceof AqpANTLRNode
+        && ((AqpANTLRNode) node).getTokenLabel().equals("FIELD")) {
+      if (node.getChildren().size() == 1) {
+        return node.getChildren().get(0);
+      }
+
+      String field = getFieldValue(node);
+      node = node.getChildren().get(node.getChildren().size() - 1);
+      if (field != null) {
+        AqpUtils.applyFieldToAllChildren(EscapeQuerySyntaxImpl.discardEscapeChar(field)
+            .toString(), node);
+      }
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+  private String getFieldValue(QueryNode fieldNode) throws QueryNodeException {
+
+    if (fieldNode != null && fieldNode.getChildren() != null) {
+      return ((AqpANTLRNode) fieldNode.getChildren().get(0)).getTokenInput();
+    }
+    return null;
+  }
+
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpNullDefaultFieldProcessor.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpNullDefaultFieldProcessor.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/processors/AqpNullDefaultFieldProcessor.java	(revision 0)
@@ -0,0 +1,66 @@
+package org.apache.lucene.queryparser.flexible.aqp.processors;
+
+import java.util.List;
+
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldQueryNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.FieldableNode;
+import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorImpl;
+import org.apache.lucene.queryparser.flexible.standard.processors.AnalyzerQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.MatchAllDocsQueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.standard.processors.MultiFieldQueryNodeProcessor;
+
+/**
+ * This processor changes field value 'null' into ''.
+ * 
+ * The processor solves the following problem (probably affecting SOLR only):
+ * 
+ * {@link MultiFieldQueryNodeProcessor} looks at {@link FieldableNode} and
+ * eventually creates several instances of them (eg. "query" becomes field:query
+ * fieldb:query). But this works only when the initial field==null. If it was
+ * '', nothing happens. If the current configuration contains
+ * {@link MultiFieldQueryNodeProcessor} but it is empty, also the field will be
+ * null (because {@link DefaultFieldAttribute} is by default null)
+ * 
+ * {@link AnalyzerQueryNodeProcessor}, on the other hand, expects that field is
+ * a string value - to be precise, it asks the current analyzer to check the
+ * field. And if the field was null, then with SOLR this throws
+ * {@link NullPointerException}
+ * 
+ * Please put {@link AqpNullDefaultFieldProcessor} also before
+ * {@link MatchAllDocsQueryNodeProcessor} otherwise you will get
+ * {@link NullPointerException} if the default field is null
+ * 
+ * @see FieldableNode
+ * @see MultiFieldQueryNodeProcessor
+ * @see AnalyzerQueryNodeProcessor
+ * @see AqpInvenioQueryParser
+ * @see DefaultFieldAttribute
+ * 
+ */
+public class AqpNullDefaultFieldProcessor extends QueryNodeProcessorImpl
+    implements QueryNodeProcessor {
+
+  @Override
+  protected QueryNode preProcessNode(QueryNode node) throws QueryNodeException {
+    if (node instanceof FieldQueryNode
+        && ((FieldQueryNode) node).getField() == null) {
+      ((FieldQueryNode) node).setField("");
+    }
+    return node;
+  }
+
+  @Override
+  protected QueryNode postProcessNode(QueryNode node) throws QueryNodeException {
+    return node;
+  }
+
+  @Override
+  protected List<QueryNode> setChildrenOrder(List<QueryNode> children)
+      throws QueryNodeException {
+    return children;
+  }
+
+}
Index: lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/AqpQueryParser.java
===================================================================
--- lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/AqpQueryParser.java	(revision 0)
+++ lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/aqp/AqpQueryParser.java	(revision 0)
@@ -0,0 +1,680 @@
+package org.apache.lucene.queryparser.flexible.aqp;
+
+/**
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.lang.reflect.Constructor;
+import java.lang.reflect.InvocationTargetException;
+import java.util.List;
+import java.util.ListIterator;
+import java.util.Locale;
+import java.util.Map;
+import java.util.TooManyListenersException;
+
+import org.apache.lucene.analysis.Analyzer;
+import org.apache.lucene.document.DateTools;
+import org.apache.lucene.document.DateTools.Resolution;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.QueryParserHelper;
+import org.apache.lucene.queryparser.flexible.core.builders.QueryBuilder;
+import org.apache.lucene.queryparser.flexible.core.builders.QueryTreeBuilder;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessor;
+import org.apache.lucene.queryparser.flexible.core.processors.QueryNodeProcessorPipeline;
+import org.apache.lucene.queryparser.flexible.standard.StandardQueryParser;
+import org.apache.lucene.queryparser.flexible.standard.builders.StandardQueryTreeBuilder;
+import org.apache.lucene.queryparser.flexible.standard.config.FuzzyConfig;
+import org.apache.lucene.queryparser.flexible.standard.config.NumericConfig;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler.ConfigurationKeys;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler.Operator;
+import org.apache.lucene.queryparser.flexible.standard.parser.StandardSyntaxParser;
+import org.apache.lucene.queryparser.flexible.standard.processors.StandardQueryNodeProcessorPipeline;
+import org.apache.lucene.queryparser.flexible.aqp.AqpSyntaxParser;
+import org.apache.lucene.queryparser.flexible.aqp.builders.AqpQueryTreeBuilder;
+import org.apache.lucene.queryparser.flexible.aqp.config.AqpFeedback;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardQueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.aqp.util.AqpDebuggingQueryNodeProcessorPipeline;
+import org.apache.lucene.search.FuzzyQuery;
+import org.apache.lucene.search.MultiTermQuery;
+import org.apache.lucene.search.Query;
+
+/**
+ * <p>
+ * This class is a helper that enables users to easily use the Lucene query
+ * parser written in EBNF grammar using ANTLR
+ * </p>
+ * <p>
+ * To construct a Query object from a query string, use the
+ * {@link #parse(String, String)} method:
+ * <ul>
+ * ANTLRQueryParser queryParserHelper = new ANTLRQueryParser(); <br/>
+ * Query query = queryParserHelper.parse("a AND b", "defaultField");
+ * </ul>
+ * <p>
+ * To change any configuration before parsing the query string do, for example:
+ * <p/>
+ * <ul>
+ * // the query config handler returned by {@link StandardQueryParser} is a
+ * {@link StandardQueryConfigHandler} <br/>
+ * queryParserHelper.getQueryConfigHandler().setAnalyzer(new
+ * WhitespaceAnalyzer());
+ * </ul>
+ * <p>
+ * The syntax for query strings is as follows (copied from the old QueryParser
+ * javadoc):
+ * <ul>
+ * A Query is a series of clauses. A clause may be prefixed by:
+ * <ul>
+ * <li>a plus (<code>+</code>) or a minus (<code>-</code>) sign, indicating that
+ * the clause is required or prohibited respectively; or
+ * <li>a term followed by a colon, indicating the field to be searched. This
+ * enables one to construct queries which search multiple fields.
+ * </ul>
+ * 
+ * A clause may be either:
+ * <ul>
+ * <li>a term, indicating all the documents that contain this term; or
+ * <li>a nested query, enclosed in parentheses. Note that this may be used with
+ * a <code>+</code>/<code>-</code> prefix to require any of a set of terms.
+ * </ul>
+ * 
+ * Thus, in BNF, the query grammar is:
+ * 
+ * <pre>
+ *   Query  ::= ( Clause )*
+ *   Clause ::= [&quot;+&quot;, &quot;-&quot;] [&lt;TERM&gt; &quot;:&quot;] ( &lt;TERM&gt; | &quot;(&quot; Query &quot;)&quot; )
+ * </pre>
+ * 
+ * <p>
+ * Examples of appropriately formatted queries can be found in the <a
+ * href="../../../../../../queryparsersyntax.html">query syntax
+ * documentation</a>.
+ * </p>
+ * </ul>
+ * <p>
+ * The text parser used by this helper is a {@link StandardSyntaxParser}.
+ * <p/>
+ * <p>
+ * The query node processor used by this helper is a
+ * {@link StandardQueryNodeProcessorPipeline}.
+ * <p/>
+ * <p>
+ * The builder used by this helper is a {@link StandardQueryTreeBuilder}.
+ * <p/>
+ * 
+ * @see StandardQueryParser
+ * @see StandardQueryConfigHandler
+ * @see StandardSyntaxParser
+ * @see StandardQueryNodeProcessorPipeline
+ * @see StandardQueryTreeBuilder
+ * 
+ * 
+ *      TODO: add the constructor to the SQP and remove the duplicated code
+ * 
+ *      public StandardQueryParser(QueryConfigHandler config, SyntaxParser
+ *      parser, QueryNodeProcessor processor, QueryBuilder builder) {
+ *      super(config, parser,processor, builder); }
+ */
+public class AqpQueryParser extends QueryParserHelper {
+
+  private boolean debugMode = false;
+  private String syntaxName = null;
+
+  public AqpQueryParser(QueryConfigHandler config, AqpSyntaxParser parser,
+      QueryNodeProcessorPipeline processor, QueryTreeBuilder builder) {
+
+    super(config, parser, processor, builder);
+    syntaxName = parser.getClass().getName();
+  }
+
+  @Override
+  public String toString() {
+    return "<AqpQueryParser config=\"" + this.getQueryConfigHandler()
+        + "\" grammar=\"" + syntaxName + "\"/>";
+  }
+
+  /**
+   * De/activates the debugging output of the query parser
+   * 
+   * It works by wrapping the processor pipeline into a debugging
+   * class and by calling setDebug on the underlying builder.
+   * @throws SecurityException 
+   * @throws NoSuchMethodException 
+   * @throws InvocationTargetException 
+   * @throws IllegalArgumentException 
+   * 
+   * @see AqpDebuggingQueryNodeProcessorPipeline
+   * @see AqpQueryTreeBuilder
+   */
+  @SuppressWarnings("unchecked")
+  public void setDebug(boolean debug) throws InstantiationException,
+      IllegalAccessException, NoSuchMethodException, SecurityException, IllegalArgumentException, InvocationTargetException {
+  	
+  	if (debugMode != debug) {
+  		
+  		QueryNodeProcessorPipeline processor = (QueryNodeProcessorPipeline) this.getQueryNodeProcessor();
+  		QueryBuilder builder = this.getQueryBuilder();
+  		
+  		QueryNodeProcessorPipeline newPipeline;
+  		
+  		QueryConfigHandler configHandler = this.getQueryConfigHandler();
+  		
+	    if (debug) {
+	      newPipeline = new AqpDebuggingQueryNodeProcessorPipeline(
+	      		this.getQueryConfigHandler(), processor.getClass());
+	    }
+	    else {
+	    	// can't use the simple form because parser pipelines may be using config to adjust themselves
+	    	// newPipeline = clazz.newInstance();
+	    	
+	    	Class<? extends QueryNodeProcessorPipeline> clazz = ((AqpDebuggingQueryNodeProcessorPipeline) processor)
+    								.getOriginalProcessorClass();
+	    	Constructor<? extends QueryNodeProcessorPipeline> constructor = clazz.getConstructor(QueryConfigHandler.class);
+	    	newPipeline = constructor.newInstance(new Object[]{configHandler});
+	    }
+	    
+
+      List<QueryNodeProcessor> listOfProcessors = (List<QueryNodeProcessor>) processor;
+      ListIterator<QueryNodeProcessor> it = listOfProcessors.listIterator();
+      while (it.hasNext()) {
+        newPipeline.add(it.next());
+      }
+      this.setQueryNodeProcessor(newPipeline);
+	
+	      
+      QueryBuilder newBuilder = builder.getClass().newInstance();
+      if (newBuilder instanceof AqpQueryTreeBuilder) {
+        ((AqpQueryTreeBuilder) newBuilder).setDebug(debug);
+        this.setQueryBuilder(newBuilder);
+      }
+	
+  	}
+    debugMode = debug;
+  }
+
+  public boolean getDebug() {
+    return debugMode;
+  }
+
+  /**
+   * Overrides {@link QueryParserHelper#parse(String, String)} so it casts the
+   * return object to {@link Query}. For more reference about this method, check
+   * {@link QueryParserHelper#parse(String, String)}.
+   * 
+   * @param query
+   *          the query string
+   * @param defaultField
+   *          the default field used by the text parser
+   * 
+   * @return the object built from the query
+   * 
+   * @throws QueryNodeException
+   *           if something wrong happens along the three phases
+   */
+  @Override
+  public Query parse(String query, String defaultField)
+      throws QueryNodeException {
+
+    if (defaultField != null) {
+      setDefaultField(defaultField);
+    }
+    try {
+      return (Query) super.parse(query, defaultField);
+    } catch (NestedParseException e) {
+      throw new QueryNodeException(e);
+    }
+
+  }
+
+  public String getDefaultField() {
+    return getQueryConfigHandler().get(
+        AqpStandardQueryConfigHandler.ConfigurationKeys.DEFAULT_FIELD);
+  }
+
+  public void setDefaultField(String field) {
+    getQueryConfigHandler().set(
+        AqpStandardQueryConfigHandler.ConfigurationKeys.DEFAULT_FIELD, field);
+  }
+
+  public Integer getDefaultProximity() {
+    return getQueryConfigHandler().get(
+        AqpStandardQueryConfigHandler.ConfigurationKeys.DEFAULT_PROXIMITY);
+  }
+
+  public void setDefaultProximity(Integer value) {
+    getQueryConfigHandler().set(
+        AqpStandardQueryConfigHandler.ConfigurationKeys.DEFAULT_PROXIMITY,
+        value);
+  }
+
+  public Float getImplicitBoost() {
+    return getQueryConfigHandler().get(
+        AqpStandardQueryConfigHandler.ConfigurationKeys.IMPLICIT_BOOST);
+  }
+
+  public void setImplicitBoost(Float value) {
+    getQueryConfigHandler().set(
+        AqpStandardQueryConfigHandler.ConfigurationKeys.IMPLICIT_BOOST, value);
+  }
+
+  public AqpFeedback getFeedback() {
+    return getQueryConfigHandler().get(
+        AqpStandardQueryConfigHandler.ConfigurationKeys.FEEDBACK);
+  }
+
+  public void setFeedback(AqpFeedback feedbackInstance) {
+    getQueryConfigHandler().set(
+        AqpStandardQueryConfigHandler.ConfigurationKeys.FEEDBACK,
+        feedbackInstance);
+  }
+
+  public Float getImplicitFuzzy() {
+    return getQueryConfigHandler().get(
+        AqpStandardQueryConfigHandler.ConfigurationKeys.IMPLICIT_FUZZY);
+  }
+
+  public void setImplicitFuzzy(Float value) {
+    getQueryConfigHandler().set(
+        AqpStandardQueryConfigHandler.ConfigurationKeys.IMPLICIT_FUZZY, value);
+  }
+
+  public Boolean getAllowSlowFuzzy() {
+    return getQueryConfigHandler().get(
+        AqpStandardQueryConfigHandler.ConfigurationKeys.ALLOW_SLOW_FUZZY);
+  }
+
+  public void setAllowSlowFuzzy(Boolean value) {
+    getQueryConfigHandler()
+        .set(AqpStandardQueryConfigHandler.ConfigurationKeys.ALLOW_SLOW_FUZZY,
+            value);
+  }
+
+  /********************************************************************
+   * Everything below is simpy copy of the StandardQueryParser *
+   *******************************************************************/
+
+  /**
+   * Gets implicit operator setting, which will be either {@link Operator#AND}
+   * or {@link Operator#OR}.
+   */
+  public StandardQueryConfigHandler.Operator getDefaultOperator() {
+  	return getQueryConfigHandler().get(ConfigurationKeys.DEFAULT_OPERATOR);
+    
+  }
+
+  /**
+   * Sets the boolean operator of the QueryParser. In default mode (
+   * {@link Operator#OR}) terms without any modifiers are considered optional:
+   * for example <code>capital of Hungary</code> is equal to
+   * <code>capital OR of OR Hungary</code>.<br/>
+   * In {@link Operator#AND} mode terms are considered to be in conjunction: the
+   * above mentioned query is parsed as <code>capital AND of AND Hungary</code>
+   */
+  public void setDefaultOperator(StandardQueryConfigHandler.Operator operator) {
+    getQueryConfigHandler().set(ConfigurationKeys.DEFAULT_OPERATOR, operator);
+  }
+
+  /**
+   * Set to <code>true</code> to allow leading wildcard characters.
+   * <p>
+   * When set, <code>*</code> or <code>?</code> are allowed as the first
+   * character of a PrefixQuery and WildcardQuery. Note that this can produce
+   * very slow queries on big indexes.
+   * <p>
+   * Default: false.
+   */
+  public void setLowercaseExpandedTerms(boolean lowercaseExpandedTerms) {
+    getQueryConfigHandler().set(ConfigurationKeys.LOWERCASE_EXPANDED_TERMS,
+        lowercaseExpandedTerms);
+  }
+
+  /**
+   * @see #setLowercaseExpandedTerms(boolean)
+   */
+  public boolean getLowercaseExpandedTerms() {
+    Boolean lowercaseExpandedTerms = getQueryConfigHandler().get(
+        ConfigurationKeys.LOWERCASE_EXPANDED_TERMS);
+
+    if (lowercaseExpandedTerms == null) {
+      return true;
+
+    } else {
+      return lowercaseExpandedTerms;
+    }
+
+  }
+
+  /**
+   * Set to <code>true</code> to allow leading wildcard characters.
+   * <p>
+   * When set, <code>*</code> or <code>?</code> are allowed as the first
+   * character of a PrefixQuery and WildcardQuery. Note that this can produce
+   * very slow queries on big indexes.
+   * <p>
+   * Default: false.
+   */
+  public void setAllowLeadingWildcard(boolean allowLeadingWildcard) {
+    getQueryConfigHandler().set(ConfigurationKeys.ALLOW_LEADING_WILDCARD,
+        allowLeadingWildcard);
+  }
+
+  /**
+   * Set to <code>true</code> to enable position increments in result query.
+   * <p>
+   * When set, result phrase and multi-phrase queries will be aware of position
+   * increments. Useful when e.g. a StopFilter increases the position increment
+   * of the token that follows an omitted token.
+   * <p>
+   * Default: false.
+   */
+  public void setEnablePositionIncrements(boolean enabled) {
+    getQueryConfigHandler().set(ConfigurationKeys.ENABLE_POSITION_INCREMENTS,
+        enabled);
+  }
+
+  /**
+   * @see #setEnablePositionIncrements(boolean)
+   */
+  public boolean getEnablePositionIncrements() {
+    Boolean enablePositionsIncrements = getQueryConfigHandler().get(
+        ConfigurationKeys.ENABLE_POSITION_INCREMENTS);
+
+    if (enablePositionsIncrements == null) {
+      return false;
+
+    } else {
+      return enablePositionsIncrements;
+    }
+
+  }
+
+  /**
+   * By default, it uses
+   * {@link MultiTermQuery#CONSTANT_SCORE_AUTO_REWRITE_DEFAULT} when creating a
+   * prefix, wildcard and range queries. This implementation is generally
+   * preferable because it a) Runs faster b) Does not have the scarcity of terms
+   * unduly influence score c) avoids any {@link TooManyListenersException}
+   * exception. However, if your application really needs to use the
+   * old-fashioned boolean queries expansion rewriting and the above points are
+   * not relevant then use this change the rewrite method.
+   */
+  public void setMultiTermRewriteMethod(MultiTermQuery.RewriteMethod method) {
+    getQueryConfigHandler().set(ConfigurationKeys.MULTI_TERM_REWRITE_METHOD,
+        method);
+  }
+
+  /**
+   * @see #setMultiTermRewriteMethod(org.apache.lucene.search.MultiTermQuery.RewriteMethod)
+   */
+  public MultiTermQuery.RewriteMethod getMultiTermRewriteMethod() {
+    return getQueryConfigHandler().get(
+        ConfigurationKeys.MULTI_TERM_REWRITE_METHOD);
+  }
+
+  /**
+   * Set the fields a query should be expanded to when the field is
+   * <code>null</code>
+   * 
+   * @param fields
+   *          the fields used to expand the query
+   */
+  public void setMultiFields(CharSequence[] fields) {
+
+    if (fields == null) {
+      fields = new CharSequence[0];
+    }
+
+    getQueryConfigHandler().set(ConfigurationKeys.MULTI_FIELDS, fields);
+
+  }
+
+  /**
+   * Returns the fields used to expand the query when the field for a certain
+   * query is <code>null</code>
+   * 
+   * @param fields
+   *          the fields used to expand the query
+   */
+  public void getMultiFields(CharSequence[] fields) {
+    getQueryConfigHandler().get(ConfigurationKeys.MULTI_FIELDS);
+  }
+
+  /**
+   * Set the prefix length for fuzzy queries. Default is 0.
+   * 
+   * @param fuzzyPrefixLength
+   *          The fuzzyPrefixLength to set.
+   */
+  public void setFuzzyPrefixLength(int fuzzyPrefixLength) {
+    QueryConfigHandler config = getQueryConfigHandler();
+    FuzzyConfig fuzzyConfig = config.get(ConfigurationKeys.FUZZY_CONFIG);
+
+    if (fuzzyConfig == null) {
+      fuzzyConfig = new FuzzyConfig();
+      config.set(ConfigurationKeys.FUZZY_CONFIG, fuzzyConfig);
+    }
+
+    fuzzyConfig.setPrefixLength(fuzzyPrefixLength);
+
+  }
+
+  public void setNumericConfigMap(Map<String, NumericConfig> numericConfigMap) {
+    getQueryConfigHandler().set(ConfigurationKeys.NUMERIC_CONFIG_MAP,
+        numericConfigMap);
+  }
+
+  public Map<String, NumericConfig> getNumericConfigMap() {
+    return getQueryConfigHandler().get(ConfigurationKeys.NUMERIC_CONFIG_MAP);
+  }
+
+  /**
+   * Set locale used by date range parsing.
+   */
+  public void setLocale(Locale locale) {
+    getQueryConfigHandler().set(ConfigurationKeys.LOCALE, locale);
+  }
+
+  /**
+   * Returns current locale, allowing access by subclasses.
+   */
+  public Locale getLocale() {
+    return getQueryConfigHandler().get(ConfigurationKeys.LOCALE);
+  }
+
+  /**
+   * Sets the default slop for phrases. If zero, then exact phrase matches are
+   * required. Default value is zero.
+   * 
+   * @deprecated renamed to {@link #setPhraseSlop(int)}
+   */
+  @Deprecated
+  public void setDefaultPhraseSlop(int defaultPhraseSlop) {
+    getQueryConfigHandler().set(ConfigurationKeys.PHRASE_SLOP,
+        defaultPhraseSlop);
+  }
+
+  /**
+   * Sets the default slop for phrases. If zero, then exact phrase matches are
+   * required. Default value is zero.
+   */
+  public void setPhraseSlop(int defaultPhraseSlop) {
+    getQueryConfigHandler().set(ConfigurationKeys.PHRASE_SLOP,
+        defaultPhraseSlop);
+  }
+
+  public void setAnalyzer(Analyzer analyzer) {
+    getQueryConfigHandler().set(ConfigurationKeys.ANALYZER, analyzer);
+  }
+
+  public Analyzer getAnalyzer() {
+    return getQueryConfigHandler().get(ConfigurationKeys.ANALYZER);
+  }
+
+  /**
+   * @see #setAllowLeadingWildcard(boolean)
+   */
+  public boolean getAllowLeadingWildcard() {
+    Boolean allowLeadingWildcard = getQueryConfigHandler().get(
+        ConfigurationKeys.ALLOW_LEADING_WILDCARD);
+
+    if (allowLeadingWildcard == null) {
+      return false;
+
+    } else {
+      return allowLeadingWildcard;
+    }
+  }
+
+  /**
+   * Get the minimal similarity for fuzzy queries.
+   */
+  public float getFuzzyMinSim() {
+    FuzzyConfig fuzzyConfig = getQueryConfigHandler().get(
+        ConfigurationKeys.FUZZY_CONFIG);
+
+    if (fuzzyConfig == null) {
+      return FuzzyQuery.defaultMinSimilarity;
+    } else {
+      return fuzzyConfig.getMinSimilarity();
+    }
+  }
+
+  /**
+   * Get the prefix length for fuzzy queries.
+   * 
+   * @return Returns the fuzzyPrefixLength.
+   */
+  public int getFuzzyPrefixLength() {
+    FuzzyConfig fuzzyConfig = getQueryConfigHandler().get(
+        ConfigurationKeys.FUZZY_CONFIG);
+
+    if (fuzzyConfig == null) {
+      return FuzzyQuery.defaultPrefixLength;
+    } else {
+      return fuzzyConfig.getPrefixLength();
+    }
+  }
+
+  /**
+   * Gets the default slop for phrases.
+   */
+  public int getPhraseSlop() {
+    Integer phraseSlop = getQueryConfigHandler().get(
+        ConfigurationKeys.PHRASE_SLOP);
+
+    if (phraseSlop == null) {
+      return 0;
+
+    } else {
+      return phraseSlop;
+    }
+  }
+
+  /**
+   * Set the minimum similarity for fuzzy queries. Default is defined on
+   * {@link FuzzyQuery#defaultMinSimilarity}.
+   */
+  public void setFuzzyMinSim(float fuzzyMinSim) {
+    QueryConfigHandler config = getQueryConfigHandler();
+    FuzzyConfig fuzzyConfig = config.get(ConfigurationKeys.FUZZY_CONFIG);
+
+    if (fuzzyConfig == null) {
+      fuzzyConfig = new FuzzyConfig();
+      config.set(ConfigurationKeys.FUZZY_CONFIG, fuzzyConfig);
+    }
+
+    fuzzyConfig.setMinSimilarity(fuzzyMinSim);
+  }
+
+  /**
+   * Sets the boost used for each field.
+   * 
+   * @param boosts
+   *          a collection that maps a field to its boost
+   */
+  public void setFieldsBoost(Map<String, Float> boosts) {
+    getQueryConfigHandler().set(ConfigurationKeys.FIELD_BOOST_MAP, boosts);
+  }
+
+  /**
+   * Returns the field to boost map used to set boost for each field.
+   * 
+   * @return the field to boost map
+   */
+  public Map<String, Float> getFieldsBoost() {
+    return getQueryConfigHandler().get(ConfigurationKeys.FIELD_BOOST_MAP);
+  }
+
+  /**
+   * Sets the default {@link Resolution} used for certain field when no
+   * {@link Resolution} is defined for this field.
+   * 
+   * @param dateResolution
+   *          the default {@link Resolution}
+   */
+  public void setDateResolution(DateTools.Resolution dateResolution) {
+    getQueryConfigHandler().set(ConfigurationKeys.DATE_RESOLUTION,
+        dateResolution);
+  }
+
+  /**
+   * Returns the default {@link Resolution} used for certain field when no
+   * {@link Resolution} is defined for this field.
+   * 
+   * @return the default {@link Resolution}
+   */
+  public DateTools.Resolution getDateResolution() {
+    return getQueryConfigHandler().get(ConfigurationKeys.DATE_RESOLUTION);
+  }
+
+  /**
+   * Sets the {@link Resolution} used for each field
+   * 
+   * @param dateRes
+   *          a collection that maps a field to its {@link Resolution}
+   * 
+   * @deprecated this method was renamed to {@link #setDateResolutionMap(Map)}
+   */
+  @Deprecated
+  public void setDateResolution(Map<CharSequence, DateTools.Resolution> dateRes) {
+    setDateResolutionMap(dateRes);
+  }
+
+  /**
+   * Returns the field to {@link Resolution} map used to normalize each date
+   * field.
+   * 
+   * @return the field to {@link Resolution} map
+   */
+  public Map<CharSequence, DateTools.Resolution> getDateResolutionMap() {
+    return getQueryConfigHandler().get(
+        ConfigurationKeys.FIELD_DATE_RESOLUTION_MAP);
+  }
+
+  /**
+   * Sets the {@link Resolution} used for each field
+   * 
+   * @param dateRes
+   *          a collection that maps a field to its {@link Resolution}
+   */
+  public void setDateResolutionMap(
+      Map<CharSequence, DateTools.Resolution> dateRes) {
+    getQueryConfigHandler().set(ConfigurationKeys.FIELD_DATE_RESOLUTION_MAP,
+        dateRes);
+  }
+}
Index: lucene/queryparser/grammars/StandardLuceneGrammar.html
===================================================================
--- lucene/queryparser/grammars/StandardLuceneGrammar.html	(revision 0)
+++ lucene/queryparser/grammars/StandardLuceneGrammar.html	(revision 0)
@@ -0,0 +1 @@
+To generate this file, run: ant -f aqp-build.xml generate-html
Index: lucene/queryparser/grammars/StandardLuceneGrammar.g
===================================================================
--- lucene/queryparser/grammars/StandardLuceneGrammar.g	(revision 0)
+++ lucene/queryparser/grammars/StandardLuceneGrammar.g	(revision 0)
@@ -0,0 +1,475 @@
+grammar StandardLuceneGrammar;
+
+//
+//  This is a re-implementation of the standard lucene syntax with ANTLR3
+//   http://lucene.apache.org/core/4_3_0/queryparser/index.html
+//   
+//   The query syntax is complete and supports the same features as the 
+//   original parser written in JCC. The advantage of this grammar is that it
+//   is 'pluggable' into Lucene's modern flexible parser, so that you can 
+//   add custom logic on top of the 'rigid' query syntax. Besides...the grammar
+//   is not that 'rigid' - you can modify the grammar and easily recompile.
+//   
+//   # run this commad inside antlrqueryparser
+//   
+//      $ ant generate-antlr -Dgrammar=MyNewGrammar
+//   
+//   # or if you want to test things, do:
+//   
+//      $ ant try-view -Dgrammar=MyNewGrammar -Dquery="foo AND bar"
+//   
+//   
+//   Implementation note: I have tried hard to avoid putting language specific details
+//   into the grammar, unfortunately this was not always possible. But it is kept
+//   at minimum. You can generate parser code in your language of choice
+//   if you change the following:
+//   
+//   options  : 
+//     language=<your-target-language-supported-by-antlr3>
+//     superClass= the default is to subclass 'UnforgivingParser', this java class
+//                         lives in the package oal.queryparser.flixible.aqp.parser
+//                         and its purpose is to bark everytime when an exception
+//                         happens (otherwise, ANTLR tries to recover from some situations
+//                         -- you may want to remove this definition, or add your own
+//                         error recovery logic there)
+//
+//   @header:  this adds the java declaration to the generated parser file,
+//                    feel free to remove (if you want to test the grammar using
+//                    ANTLRWorks, you want to remove it)
+//   @lexer::header: dtto but for lexer
+//   @lexer::members: again, necessary for being strict and prevent error 
+//                                recovery, but this applies only to lexer errors.
+//
+//  One last note - if you want to implement your own error recovery, have a look
+//  at the generated java class 
+//       
+//      oal.queryparser.flixible.aqp.parser.<GrammarName>SyntaxParser.java
+//
+//  There we are raising parse exception as well
+//
+
+
+options {
+  language = Java;
+  output = AST;
+  superClass = UnforgivingParser;
+}
+
+tokens {
+  OPERATOR;
+  ATOM;
+  MODIFIER;
+  TMODIFIER;
+  CLAUSE;
+  FIELD;
+  FUZZY;
+  BOOST;
+  QNORMAL;
+  QPHRASE;
+  QPHRASETRUNC;
+  QTRUNCATED;
+  QRANGEIN;
+  QRANGEEX;
+  QANYTHING;
+  QDATE;
+}
+
+
+// java-specific and error recovery-unfriendly details.... 
+
+@header{
+  package org.apache.lucene.queryparser.flexible.aqp.parser;
+}
+@lexer::header {
+  package org.apache.lucene.queryparser.flexible.aqp.parser;
+}
+
+// this is for exceptions on lexer level - we are preventing error 
+// recovery (ANTLRv3 does not seem to have a better way to modify
+// the default behaviour - eg. from a parent abstract class)
+@lexer::members {
+	public void recover(RecognitionException re) {
+		// throw unchecked exception
+	  throw new RuntimeException(re);
+	}
+}
+
+// ...below this point, language agnostic EBNF grammar lives.
+
+
+
+
+
+mainQ : 
+	clauseOr+ EOF -> ^(OPERATOR["DEFOP"] clauseOr+)
+	;
+   
+  
+clauseOr
+  : (first=clauseAnd -> $first) (or others=clauseAnd -> ^(OPERATOR["OR"] clauseAnd+ ))*
+  ;
+
+clauseAnd
+  : (first=clauseNot  -> $first) (and others=clauseNot -> ^(OPERATOR["AND"] clauseNot+ ))*
+  ;
+  
+clauseNot
+  : (first=clauseBasic -> $first) (not others=clauseBasic -> ^(OPERATOR["NOT"] clauseBasic+) )* 
+  ;
+  
+  
+clauseBasic
+	:
+	(modifier LPAREN clauseOr+ RPAREN )=> modifier? LPAREN clauseOr+ RPAREN term_modifier? 
+	 -> ^(CLAUSE ^(MODIFIER modifier? ^(TMODIFIER term_modifier? ^(OPERATOR["DEFOP"] clauseOr+)))) // Default operator
+	| (LPAREN clauseOr+ RPAREN term_modifier)=> modifier? LPAREN clauseOr+ RPAREN term_modifier? 
+	 -> ^(CLAUSE ^(MODIFIER modifier? ^(TMODIFIER term_modifier? ^(OPERATOR["DEFOP"] clauseOr+)))) // Default operator
+	| (LPAREN  )=> LPAREN clauseOr+ RPAREN
+	 -> clauseOr+
+	| atom
+	;
+    
+
+atom   
+	: 
+	modifier? field multi_value term_modifier?
+	 -> ^(CLAUSE ^(MODIFIER modifier? ^(TMODIFIER term_modifier? ^(FIELD field multi_value))))
+	| modifier? field? value term_modifier? 
+	 -> ^(MODIFIER modifier? ^(TMODIFIER term_modifier? ^(FIELD field? value)))
+	;
+   
+
+field	
+	:	
+	TERM_NORMAL COLON -> TERM_NORMAL
+	;
+
+value  
+	: 
+	range_term_in -> ^(QRANGEIN range_term_in)
+	| range_term_ex -> ^(QRANGEEX range_term_ex) 
+	| normal -> ^(QNORMAL normal)	
+	| truncated -> ^(QTRUNCATED truncated)	
+	| quoted -> ^(QPHRASE quoted)
+	| quoted_truncated -> ^(QPHRASETRUNC quoted_truncated)
+	| QMARK -> ^(QTRUNCATED QMARK)
+	| STAR COLON b=STAR -> ^(QANYTHING $b)
+  | STAR -> ^(QTRUNCATED STAR)
+  ;
+
+	
+
+range_term_in
+	:	
+       LBRACK
+       (a=range_value -> range_value ^(QANYTHING QANYTHING["*"]))
+       ( TO? b=range_value -> $a $b? )?
+       RBRACK
+	;
+
+
+range_term_ex
+	:	
+       LCURLY
+       ( a=range_value -> range_value ^(QANYTHING QANYTHING["*"]))
+       ( TO? b=range_value -> $a $b? )?
+       RCURLY
+	;	
+
+range_value
+	:	
+	truncated -> ^(QTRUNCATED truncated)
+	| quoted -> ^(QPHRASE quoted)
+	| quoted_truncated -> ^(QPHRASETRUNC quoted_truncated)
+	| date -> ^(QNORMAL date)
+	| normal -> ^(QNORMAL normal)	
+	| STAR -> ^(QANYTHING STAR)
+	;
+
+multi_value
+	: 
+	LPAREN multiClause RPAREN -> multiClause
+	;
+
+
+
+multiClause	
+	:
+	
+	//m:(a b AND c OR d OR e)
+	
+	// without duplicating the rules (but it allows recursion)
+	clauseOr+ -> ^(OPERATOR["DEFOP"] clauseOr+)
+	
+	// allows only limited set of operations
+	//multiDefault
+	
+	// this is also working, but i want operator precedence
+	//multiClause:
+	//(mterm+ -> mterm+)
+	//(op=operator rhs=fclause -> ^(OPERATOR ^(OPERATOR["DEFOP"] $mclause) $rhs))?
+	//;
+	//flause:mclause;
+	;
+
+multiDefault
+	:	
+	multiOr+ -> ^(OPERATOR["DEFOP"] multiOr+)
+	;
+
+multiOr	
+	:	
+	(first=multiAnd  -> $first) (or others=multiAnd-> ^(OPERATOR["OR"] multiAnd+ ))*
+	;	
+		
+multiAnd
+	:	
+	(first=multiNot  -> $first) (and others=multiNot -> ^(OPERATOR["AND"] multiNot+ ))*
+	;	
+
+multiNot	
+	:	
+	(first=multiBasic  -> $first) (not others=multiBasic-> ^(not multiBasic+ ))*
+	;	
+
+
+
+multiBasic
+	:	
+	mterm
+	;
+		
+mterm	
+	:	
+	modifier? value -> ^(MODIFIER modifier? value)
+	;
+	
+
+normal	
+	:	
+	TERM_NORMAL
+	| NUMBER
+	;	
+
+	
+
+			
+truncated
+	:	
+	TERM_TRUNCATED
+	; 
+
+
+quoted_truncated
+	:	
+	PHRASE_ANYTHING
+	;
+
+quoted	:	
+	PHRASE
+	;
+
+
+
+	
+operator: (
+	AND -> OPERATOR["AND"]
+	| OR -> OPERATOR["OR"]
+	| NOT -> OPERATOR["NOT"]
+	);
+
+modifier: 
+	PLUS -> PLUS["+"]
+	| MINUS -> MINUS["-"];
+
+
+/*
+This terribly convoluted grammar is here because of weird AST rewrite rules
+and because we need to allow for default value when TILDE is not followed by
+anything
+
+This grammar has problem with following
+	:	term^4~ 9999
+	where 999 is another term, not a fuzzy value
+*/
+term_modifier	:	
+	TILDE CARAT? -> ^(BOOST CARAT?) ^(FUZZY TILDE) 
+	| CARAT TILDE? -> ^(BOOST CARAT) ^(FUZZY TILDE?)
+/*
+	// first alternative
+	(
+	  (CARAT b=NUMBER -> ^(BOOST $b) ^(FUZZY )
+	 ) 
+	( //syntactic predicate
+	 (TILDE NUMBER )=>TILDE f=NUMBER -> ^(BOOST $b) ^(FUZZY $f)
+	 | TILDE -> ^(BOOST $b) ^(FUZZY NUMBER["0.5"])
+	 )* // set the default value
+	
+	)
+	// second alternative [only ~ | ~NUMBER]
+	| 
+	  (TILDE -> ^(BOOST) ^(FUZZY NUMBER["0.5"])) // set the default value
+	  ((~(WS|TILDE|CARAT))=>f=NUMBER -> ^(BOOST) ^(FUZZY $f?) )* //replace the default but '~' must not be followed by WS
+*/	
+	;
+
+
+boost	:
+	(CARAT -> ^(BOOST NUMBER["DEF"])) // set the default value
+	(NUMBER -> ^(BOOST NUMBER))? //replace the default with user input
+	;
+
+fuzzy	:
+	(TILDE -> ^(FUZZY NUMBER["DEF"])) // set the default value
+	(NUMBER -> ^(FUZZY NUMBER))? //replace the default with user input
+	;
+
+not	:	
+	(AND NOT)=> AND NOT
+	| NOT
+	;
+	
+and 	:	
+	AND
+	;
+	
+or 	:	
+	OR
+	;		
+
+
+date	:	
+	//a=NUMBER '/' b=NUMBER '/' c=NUMBER -> ^(QDATE $a $b $c)
+	DATE_TOKEN
+	;
+
+/* ================================================================
+ * =                     LEXER                                    =
+ * ================================================================
+ */
+
+
+
+LPAREN  : '(';
+
+RPAREN  : ')';
+
+LBRACK  : '[';
+
+RBRACK  : ']';
+
+COLON   : ':' ;  //this must NOT be fragment
+
+PLUS  : '+' ;
+
+MINUS : ('-'|'\!');
+
+STAR  : '*' ;
+
+QMARK  : '?'+ ;
+
+fragment VBAR  : '|' ;
+
+fragment AMPER : '&' ;
+
+LCURLY  : '{' ;
+
+RCURLY  : '}' ;
+
+CARAT : '^' (INT+ ('.' INT+)?)?;
+
+TILDE : '~' (INT+ ('.' INT+)?)?;
+
+DQUOTE	
+	:	'\"';
+
+SQUOTE
+	:	'\'';
+
+
+
+
+TO	:	'TO';
+
+/* We want to be case insensitive */
+AND   : (('a' | 'A') ('n' | 'N') ('d' | 'D') | (AMPER AMPER?)) ;
+OR  : (('o' | 'O') ('r' | 'R') | (VBAR VBAR?));
+NOT   : ('n' | 'N') ('o' | 'O') ('t' | 'T');
+
+
+WS  :   ( ' '
+        | '\t'
+        | '\r'
+        | '\n'
+        | '\u3000'
+        ) 
+        {$channel=HIDDEN;}
+    ;
+
+      
+/*	
+fragment TERM_CHAR  : 
+     ~(' ' | '\t' | '\n' | '\r' | '\u3000'
+      | '\\' | '\'' | '\"' 
+      | '(' | ')' | '[' | ']' | '{' | '}'
+      | '+' | '-' | '!' | ':' | '~' | '^' 
+      | '*' | '|' | '&' | '?' | '\\\"' | '/'  //this line is not present in lucene StandardParser.jj
+      );  	
+*/
+
+
+fragment INT: '0' .. '9';
+
+
+fragment ESC_CHAR:  '\\' .; 
+
+
+fragment TERM_START_CHAR
+	:
+	(~(' ' | '\t' | '\n' | '\r' | '\u3000'
+	      | '\'' | '\"' 
+	      | '(' | ')' | '[' | ']' | '{' | '}'
+	      | '+' | '-' | '!' | ':' | '~' | '^' 
+	      | '?' | '*' | '\\'
+	      )
+	 | ESC_CHAR );  	
+
+
+fragment TERM_CHAR
+	:	
+	(TERM_START_CHAR | '-' | '+')
+	;
+
+
+NUMBER  
+	: 
+	INT+ ('.' INT+)?
+	;
+
+DATE_TOKEN
+	:	
+	INT INT? ('/'|'-'|'.') INT INT? ('/'|'-'|'.') INT INT (INT INT)?
+	;
+
+TERM_NORMAL
+	: 
+	TERM_START_CHAR ( TERM_CHAR )*
+	;
+
+
+TERM_TRUNCATED: 
+	(STAR|QMARK) (TERM_CHAR+ (QMARK|STAR))+ (TERM_CHAR)*
+	| TERM_START_CHAR (TERM_CHAR* (QMARK|STAR))+ (TERM_CHAR)*
+	| (STAR|QMARK) TERM_CHAR+
+	;
+
+
+PHRASE	
+	:	
+	DQUOTE (ESC_CHAR|~('\"'|'\\'|'?'|'*'))+ DQUOTE
+	;
+
+PHRASE_ANYTHING	:	
+	DQUOTE (ESC_CHAR|~('\"'|'\\'))+ DQUOTE
+	;
+
Index: lucene/queryparser/grammars/StandardLuceneGrammar.xls
===================================================================
--- lucene/queryparser/grammars/StandardLuceneGrammar.xls	(revision 0)
+++ lucene/queryparser/grammars/StandardLuceneGrammar.xls	(revision 0)
@@ -0,0 +1,1921 @@
+��ࡱ�;��	�
�

���������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������	
+
 !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~�Root Entry����������������������������������������������������������������	�
�����\pCalc                                                                                                         B�a
�
=

��
�
=@ 8
I
@�"
�
�1���

Arial1���

Arial1���

Arial1���

Arial�GENERAL���� � �
�� �� �
�� �� ��� �� ��� �� ��� �� ��� �� ��� �� ��� �� ��� �� ��� �� ��� �� ��� �� ��� �� ��� �� ��
 � �
+�� �� �
)�� �� �
,�� �� �
*�� �� �
	�� �� ��
 �� ������������������`

��DSheet1��hSheet2�

�


�
�
T�
�b�Z� 


3���
	�
@@�
��  o
<
mainQ:0"title:\"X x\" AND text:go title:\"x y\" AND A" �(DEFOP (AND (MODIFIER (TMODIFIER (FIELD title (QPHRASE \"X x\")))) (MODIFIER (TMODIFIER (FIELD text (QNORMAL go))))) (AND (MODIFIER (TMODIFIER (FIELD title (QPHRASE \"x y\")))) (MODIFIER (TMODIFIER (FIELD (QNORMAL A))))))"title:X Y Z" �(DEFOP (MODIFIER (TMODIFIER (FIELD title (QNORMAL X)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL Y)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL Z)))))"jakarta^4 apache" y(DEFOP (MODIFIER (TMODIFIER (BOOST ^4) FUZZY (FIELD (QNORMAL jakarta)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL apache))))))"\"jakarta apache\"^4 \"Apache Lucene\"" �(DEFOP (MODIFIER (TMODIFIER (BOOST ^4) FUZZY (FIELD (QPHRASE \"jakarta apache\")))) (MODIFIER (TMODIFIER (FIELD (QPHRASE \"Apache Lucene\"))))) "\"jakarta apache\" OR jakarta" y(DEFOP (OR (MODIFIER (TMODIFIER (FIELD (QPHRASE \"jakarta apache\")))) (MODIFIER (TMODIFIER (FIELD (QNORMAL jakarta))))))+"\"jakarta apache\" AND \"Apache Lucene\"" �(DEFOP (AND (MODIFIER (TMODIFIER (FIELD (QPHRASE \"jakarta apache\")))) (MODIFIER (TMODIFIER (FIELD (QPHRASE \"Apache Lucene\"))))))"+jakarta lucene" j(DEFOP (MODIFIER + (TMODIFIER (FIELD (QNORMAL jakarta)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL lucene)))))+"\"jakarta apache\" NOT \"Apache Lucene\"" �(DEFOP (NOT (MODIFIER (TMODIFIER (FIELD (QPHRASE \"jakarta apache\")))) (MODIFIER (TMODIFIER (FIELD (QPHRASE \"Apache Lucene\"))))))""(jakarta OR apache) AND website" �(DEFOP (AND (OR (MODIFIER (TMODIFIER (FIELD (QNORMAL jakarta)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL apache))))) (MODIFIER (TMODIFIER (FIELD (QNORMAL website))))))"this (that)" c(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))"this ((that))" "(this) ((((((that))))))" "(this) (that)" "this +(that)" �(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))"this ((((+(that)))))" "this (+(((+(that)))))" �(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))))))"this +((((+(that)))))" "this +(+((((that)))))" "this (+(that)^7)" �(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (BOOST ^7) FUZZY (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))"this (+(((+(that))))"FAIL"this (++(((+(that)))))""this +(that thus)^7" �(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (BOOST ^7) FUZZY (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL thus)))))))))
 atom:"te?t" 0(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te?t))))"test*" 1(MODIFIER (TMODIFIER (FIELD (QTRUNCATED test*))))"te*t" 0(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te*t))))"*te*t" 1(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *te*t))))	"*te*t*" 2(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *te*t*))))	"?te*t?" 2(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?te*t?))))"te??t" 1(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te??t))))"te*?t"OK"\"text\"" 1(MODIFIER (TMODIFIER (FIELD (QPHRASE \"text\"))))"\"te*t\"" 6(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te*t\"))))"\"test*\"" 7(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"test*\"))))"\"*te*t\"" 7(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"*te*t\"))))
"\"*te*t*\"" 8(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"*te*t*\"))))
"\"?te*t?\"" 8(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"?te*t?\"))))"\"te?t\"" 6(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te?t\"))))"\"te??t\"" 7(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te??t\"))))"\"te*?t\"" 7(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te*?t\"))))"roam~" =(MODIFIER (TMODIFIER BOOST (FUZZY ~) (FIELD (QNORMAL roam))))"roam~0.8" @(MODIFIER (TMODIFIER BOOST (FUZZY ~0.8) (FIELD (QNORMAL roam))))"roam~0.899999999" H(MODIFIER (TMODIFIER BOOST (FUZZY ~0.899999999) (FIELD (QNORMAL roam))))	"roam~8" >(MODIFIER (TMODIFIER BOOST (FUZZY ~8) (FIELD (QNORMAL roam))))"roam^" =(MODIFIER (TMODIFIER (BOOST ^) FUZZY (FIELD (QNORMAL roam))))"roam^0.8" @(MODIFIER (TMODIFIER (BOOST ^0.8) FUZZY (FIELD (QNORMAL roam))))"roam^0.899999999" H(MODIFIER (TMODIFIER (BOOST ^0.899999999) FUZZY (FIELD (QNORMAL roam))))	"roam^8" >(MODIFIER (TMODIFIER (BOOST ^8) FUZZY (FIELD (QNORMAL roam))))	"roam^~" A(MODIFIER (TMODIFIER (BOOST ^) (FUZZY ~) (FIELD (QNORMAL roam))))"roam^0.8~" D(MODIFIER (TMODIFIER (BOOST ^0.8) (FUZZY ~) (FIELD (QNORMAL roam))))"roam^0.899999999~0.5" O(MODIFIER (TMODIFIER (BOOST ^0.899999999) (FUZZY ~0.5) (FIELD (QNORMAL roam))))	"roam~^" "roam~0.8^" D(MODIFIER (TMODIFIER (BOOST ^) (FUZZY ~0.8) (FIELD (QNORMAL roam))))"roam~0.899999999^0.5" O(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~0.899999999) (FIELD (QNORMAL roam))))
+"this^ 5" =(MODIFIER (TMODIFIER (BOOST ^) FUZZY (FIELD (QNORMAL this))))"this^5~ 9" B(MODIFIER (TMODIFIER (BOOST ^5) (FUZZY ~) (FIELD (QNORMAL this))))"9999" -(MODIFIER (TMODIFIER (FIELD (QNORMAL 9999))))	"9999.1" /(MODIFIER (TMODIFIER (FIELD (QNORMAL 9999.1))))	"0.9999" /(MODIFIER (TMODIFIER (FIELD (QNORMAL 0.9999))))"00000000.9999" 6(MODIFIER (TMODIFIER (FIELD (QNORMAL 00000000.9999))))"\"jakarta apache\"~10" M(MODIFIER (TMODIFIER BOOST (FUZZY ~10) (FIELD (QPHRASE \"jakarta apache\"))))"\"jakarta apache\"^10" M(MODIFIER (TMODIFIER (BOOST ^10) FUZZY (FIELD (QPHRASE \"jakarta apache\"))))"\"jakarta apache\"~10^" Q(MODIFIER (TMODIFIER (BOOST ^) (FUZZY ~10) (FIELD (QPHRASE \"jakarta apache\"))))"\"jakarta apache\"^10~" Q(MODIFIER (TMODIFIER (BOOST ^10) (FUZZY ~) (FIELD (QPHRASE \"jakarta apache\"))))"\"jakarta apache\"~10^0.6" T(MODIFIER (TMODIFIER (BOOST ^0.6) (FUZZY ~10) (FIELD (QPHRASE \"jakarta apache\"))))"\"jakarta apache\"^10~0.6" T(MODIFIER (TMODIFIER (BOOST ^10) (FUZZY ~0.6) (FIELD (QPHRASE \"jakarta apache\"))))"[20020101 TO 20030101]" O(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"[20020101 TO 20030101]^0.5" b(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"[20020101 TO 20030101]^0.5~" f(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"title:[20020101 TO 20030101]" U(MODIFIER (TMODIFIER (FIELD title (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))#"title:[20020101 TO 20030101]^0.5" h(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD title (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))$"title:[20020101 TO 20030101]^0.5~" l(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD title (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"[* TO 20030101]" J(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QANYTHING *) (QNORMAL 20030101)))))"[20020101 TO *]^0.5" ](MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD (QRANGEIN (QNORMAL 20020101) (QANYTHING *)))))"[* 20030101]^0.5~" a(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEIN (QANYTHING *) (QNORMAL 20030101)))))"[20020101 *]^0.5~" a(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEIN (QNORMAL 20020101) (QANYTHING *)))))"{20020101 TO 20030101}" O(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"{20020101 TO 20030101}^0.5" b(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"{20020101 TO 20030101}^0.5~" f(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"title:{20020101 TO 20030101}" U(MODIFIER (TMODIFIER (FIELD title (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))#"title:{20020101 TO 20030101}^0.5" h(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD title (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))$"title:{20020101 TO 20030101}^0.5~" l(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD title (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"title:{Aida TO Carmen}" O(MODIFIER (TMODIFIER <�(FIELD title (QRANGEEX (QNORMAL Aida) (QNORMAL Carmen)))))"{20020101 TO *}" J(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL 20020101) (QANYTHING *)))))"{* TO 20030101}^0.5" ](MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD (QRANGEEX (QANYTHING *) (QNORMAL 20030101)))))"{20020101 *}^0.5~" a(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEEX (QNORMAL 20020101) (QANYTHING *)))))"{* 20030101}^0.5~" a(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEEX (QANYTHING *) (QNORMAL 20030101)))))"[this TO that]" G(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL this) (QNORMAL that)))))"[this that]" "[this TO *]" F(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL this) (QANYTHING *)))))	"[this]" "[* this]" F(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QANYTHING *) (QNORMAL this)))))"[* TO this]" "[\"this\" TO \"that*\"]" U(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QPHRASE \"this\") (QPHRASETRUNC \"that*\")))))"[\"#$%^&\" TO \"&*()\"]" U(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QPHRASE \"#$%^&\") (QPHRASETRUNC \"&*()\")))))"{this TO that}" G(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL this) (QNORMAL that)))))"{this that}" "{this TO *}" F(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL this) (QANYTHING *)))))"{* this}" F(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QANYTHING *) (QNORMAL this)))))"{* TO this}" "{\"this\" TO \"that*\"}" U(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QPHRASE \"this\") (QPHRASETRUNC \"that*\")))))"{\"#$%^&\" TO \"&*()\"}" U(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QPHRASE \"#$%^&\") (QPHRASETRUNC \"&*()\")))))"{}""[]""\(1\+1\)\:2" 8(MODIFIER (TMODIFIER (FIELD (QNORMAL \\(1\\+1\\)\\:2))))3"escape:(\+\-\&\&\|\|\!\(\)\{\}\[\]\^\"\~\*\?\:\\)""\"jakarta apache\"";(MODIFIER (TMODIFIER (FIELD (QPHRASE \"jakarta apache\"))))$"title:(+return +\"pink panther\")" �(CLAUSE (MODIFIER (TMODIFIER (FIELD title (DEFOP (MODIFIER + (TMODIFIER (FIELD (QNORMAL return)))) (MODIFIER + (TMODIFIER (FIELD (QPHRASE \"pink panther\")))))))))"field:(one two three)" �(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL two)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL three)))))))))"field:(one +two -three)"�(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))) (MODIFIER + (TMODIFIER (FIELD (QNORMAL two)))) (MODIFIER - (TMODIFIER (FIELD (QNORMAL three)))))))))"+field:(-one +two three)"�(CLAUSE (MODIFIER + (TMODIFIER (FIELD field (DEFOP (MODIFIER - (TMODIFIER (FIELD (QNORMAL one)))) (MODIFIER + (TMODIFIER (FIELD (QNORMAL two)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL three)))))))))"-field:(-one +two three)"�(CLAUSE (MODIFIER - (TMODIFIER (FIELD field (DEFOP (MODIFIER - (TMODIFIER (FIELD (QNORMAL one)))) (MODIFIER + (TMODIFIER (FIELD (QNORMAL two)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL three)))))))))"field:(one)" b(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))))))))"field: (one)" "field:( one )" 	"+value" 0(MODIFIER + (TMODIFIER (FIELD (QNORMAL value))))"-value"0(MODIFIER - (TMODIFIER (FIELD (QNORMAL value))))	"+field:""+field:[this TO that]" O(MODIFIER + (TMODIFIER (FIELD field (QRANGEIN (QNORMAL this) (QNORMAL that)))))"+field:[   this TO that   ]" "+field:{this TO that}" O(MODIFIER + (TMODIFIER (FIELD field (QRANGEEX (QNORMAL this) (QNORMAL that)))))"+field: {this TO that}" "m:(a b c)" �(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))
"+m:(a b c)" �(CLAUSE (MODIFIER + (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))
"m:(+a b c)" �(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER + (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))"m:(-a +b c)^0.6"�(CLAUSE (MODIFIER (TMODIFIER (BOOST ^0.6) FUZZY (FIELD m (DEFOP (MODIFIER - (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER + (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))"m:(a b c or d)" �(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (OR (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL d))))))))))"m:(a b c OR d)" "m:(a b c OR d NOT e)" 
(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (OR (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))) (NOT (MODIFIER (TMODIFIER (FIELD (QNORMAL d)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL e)))))))))))"m:(a b NEAR c)" �(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL NEAR)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))"m:(a b NEAR c d AND e)" <
(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL NEAR)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))) (AND (MODIFIER (TMODIFIER (FIELD (QNORMAL d)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL e))))))))))"-m:(a b NEAR c d AND e)">
(CLAUSE (MODIFIER - (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL NEAR)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))) (AND (MODIFIER (TMODIFIER (FIELD (QNORMAL d)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL e))))))))))"*" -(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *))))"*:*" ,(MODIFIER (TMODIFIER (FIELD (QANYTHING *))))"this"-(MODIFIER (TMODIFIER (FIELD (QNORMAL this))))	"th\*is" 0(MODIFIER (TMODIFIER (FIELD (QNORMAL th\\*is))))
+"this999" 0(MODIFIER (TMODIFIER (FIELD (QNORMAL this999))))
+"this0.9" 0(MODIFIER (TMODIFIER (FIELD (QNORMAL this0.9))))"\"this\"" 1(MODIFIER (TMODIFIER (FIELD (QPHRASE \"this\"))))
"\"this  \"" 3(MODIFIER (TMODIFIER (FIELD (QPHRASE \"this  \"))))"\"this  \"   " "\"  this  \"" 5(MODIFIER (TMODIFIER (FIELD (QPHRASE \"  this  \"))))"\"a \\\"b c\\\" d\"" <(MODIFIER (TMODIFIER (FIELD (QPHRASE \"a \\\"b c\\\" d\"))))"a\\\\\\+b" 2(MODIFIER (TMODIFIER (FIELD (QNORMAL a\\\\\\+b))))"\"a \\+b c d\"" 7(MODIFIER (TMODIFIER (FIELD (QPHRASE \"a \\+b c d\"))))"a\\u0062c" 2(MODIFIER (TMODIFIER (FIELD (QNORMAL a\\u0062c))))"\"+() AND that\"" 9(MODIFIER (TMODIFIER (FIELD (QPHRASE \"+() AND that\"))))"\"func(*) AND that\"" B(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"func(*) AND that\"))))"*t" .(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t))))"*t*" /(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*))))"*t?" /(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t?))))"?t?" /(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?t?))))"?t*" /(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?t*))))"?t" .(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?t))))"*t*a" 0(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*a))))"*t?a" 0(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t?a))))"*t*a*" 1(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*a*))))"t*a" /(MODIFIER (TMODIFIER (FIELD (QTRUNCATED t*a))))"t*a?" 0(MODIFIER (TMODIFIER (FIELD (QTRUNCATED t*a?))))"t*a?a" 1(MODIFIER (TMODIFIER (FIELD (QTRUNCATED t*a?a))))"?" -(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?))))	"*t\\*a" 2(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t\\*a))))"\\*t" -(MODIFIER (TMODIFIER (FIELD (QNORMAL \\*t))))
+"*t*a\\*" 3(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*a\\*))))
+"*t*a\\?" 3(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*a\\?))))	"*t*\\a" 2(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*\\a))))"foo:*" 1(MODIFIER (TMODIFIER (FIELD foo (QTRUNCATED *))))gunit StandardLuceneGrammar;	@header {:package org.apache.lucene.queryparser.flexible.aqp.parser;
}����$ cc
+	�
�d
����MbP?_
�%���*+�
$!&C&"Times New Roman,Regular"&12&A)&&C&"Times New Roman,Regular"&12Page &P��&333333�?'333333�?(�-؂-��?)�-؂-��?�"
d

,
,
333333�?333333�?
U}
��








	



+


































































�
+�
+

�
+�
+
�
+�
+	
�
+	�
+
+
�
+
+�
+
	�
+
+�
+
�
+�
+


�
+
�
+
�
+�
+
�
+�
+
�
+�
+
�
+�
+
�
+�
+
�
+�
+
�
+�
+
�
+�
+
�
+�
+
�
+�
+
�
+�
+
�
+ �
+
!�
+"�
+
#�
+"�
+
$�
+%�
+
!�
+"�
+
#�
+"

�
+&&


'


(


)


*


+


,


-


.


/


0


1


2


3


4


5


6


7


8


9


:


;


<


=


>


?


�
+&'�
+'
(�
+')�
+(
*�
+(+�
+)
,�
+)-�
+*
,�
+*-�
++
.�
++/�
+,
0�
+,1�
+-
2�
+-3�
+.
(�
+.)�
+/
4�
+/5�
+0
6�
+07�
+1
8�
+19�
+2
:�
+2;�
+3
<�
+3=�
+4
:�
+4;�
+5
:�
+5;�
+6
>�
+6?�
+7
@�
+7A�
+8
B�
+8C�
+9
D�
+9E�
+:
F�
+:G�
+;
H�
+;I�
+<
J�
+<K�
+=
L�
+=M�
+>
N�
+>O�
+?
P�
+?Q@


A


B


C


D


E


F


G


H


I


J


K


L


M


N


O


P


Q


R


S


T


U


V


W


X


Y


Z


[


\


]


^


_


�
+@
R�
+@S�
+A
T�
+AU�
+B
V�
+BW�
+C
X�
+CY�
+D
Z�
+D[�
+E
\�
+E]�
+F
^�
+F_�
+G
`�
+G[�
+H
a�
+Hb�
+I
c�
+Id�
+J
e�
+Jf�
+K
g�
+Kh�
+L
i�
+Lj�
+M
k�
+Ml�
+N
m�
+Nn�
+O
o�
+Op�
+P
q�
+Pr�
+Q
s�
+Qt�
+R
u�
+Rv�
+S
w�
+Sx�
+T
y�
+Tz�
+U
{�
+U|�
+V
}�
+V~�
+W
�
+W��
+X
��
+X��
+Y
��
+Y��
+Z
��
+Z��
+[
��
+[��
+\
��
+\��
+]
��
+]��
+^
��
+^��
+_
��
+_�`


a


b


c


d


e


f


g


h


i


j


k


l


m


n


o


p


q


r


s


t


u


v


w


x


y


z


{


|


}


~





�
+`
��
+`��
+a
��
+a��
+b
��
+b��
+c
��
+c��
+d
��
+d��
+e
��
+e��
+f
��
+f��
+g
��
+g��
+h
��
+h��
+i
��
+i��
+j
��
+j��
+k
��
+k��
+l
��
+l��
+m
��
+m��
+n
��
+n��
+o
��
+o��
+p
��
+p��
+q
��
+q��
+r
��
+r��
+s
��
+s��
+t
��
+t��
+u
��
+u��
+v
��
+v��
+w
��
+w��
+x
��
+x��
+y
��
+y��
+z
��
+z��
+{
��
+{��
+|
��
+|��
+}
��
+}��
+~
��
+~"�
+
��
+"�


�


�

@
�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�
+�
��
+���
+�
��
+�"�
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+�"�
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���
+�
��
+���


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�
+�
��
+���
+�
��
+���
+�
��
+�
�
+�


�
+�
�
+�

�
+�
�
+�

�
+�
�
+�

�
+�
�
+�

�
+�	
�
+�

�
+�
�
+�

�
+�
�
+�

+
�
+�
�
+�

�
+�

�
+�

�
+�
�
+�

�
+�
�
+�

�
+�
�
+�

�
+�
�
+�

�
+�
�
+�

�
+�
�
+�

�
+�
�
+�

�
+�
�
+�

�
+�
�
+�

�
+�
�
+�

�
+�
�
+�
 
�
+�!
�
+�
"
�
+�#
�
+�
$
�
+�%
�
+�
&
�
+�'
�
+�
(
�
+�)
�
+�
*
�
+�+
�
+�
,
�
+�-
�
+�
.
�
+�/
�
+�
0
�
+�1
�


�


�


�
+�
2
�
+�3
�
+�
4
�
+�5
�
+�
6
�
+�7
�P�H�
�0�(
	�
+�>��@
+�
��gg
����
+	�
�d
����MbP?_
�%���*+�
$!&C&"Times New Roman,Regular"&12&A)&&C&"Times New Roman,Regular"&12Page &P��&333333�?'333333�?(�-؂-��?)�-؂-��?�"
d

,
,
333333�?333333�?
U}Z0}

s}
��

















	


+












































�
+8
�
+
9
?

)D�
Bt
:->B
;
%Z�:�
+B
;
%Z�:�
+B
�
+:
�
+;
;%Z�:�
+B
;%Z�:�
+B
]��GZ�:�,Z
�:
�
+"
B
	mainQ:�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]	GZ	�:	�,Z	
�:	
�
+"
B
�	
xD	�`Z	�FAILZ	�OKB%0D	�
Bt
:->"
"

+B
�	�D	�
Bt
:{Z	�FAILZ	�OKB%:	�DD	�
Bs"Ao"AoZ	�"AoBP

+"
"
B
]
+GZ
+�:
+�,Z
+
�:
+
�
+"
B
�
+
xD
+�`Z
+�FAILZ
+�OKB%0D
+�
Bt
:->"
"

+B
�
+�D
+�
Bt
:{Z
+�FAILZ
+�OKB%:
+�DD
+�
Bs"Ao"AoZ
+�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
 

!

"

#

$

%

&

'

(

)

*

+

,

-

.

/

0

1

2

3

4

5

6

7

8

9

:

;

<

=

>

?

] GZ �: �,Z 
�: 
�
+"
B
� 
xD �`Z �FAILZ �OKB%0D �
Bt
:->"
"

+B
� �D �
Bt
:{Z �FAILZ �OKB%: �DD �
Bs"Ao"AoZ �"AoBP

+"
"
B
]!GZ!�:!�,Z!
�:!
�
+"
B
�!
xD!�`Z!�FAILZ!�OKB%0D!�
Bt
:->"
"

+B
�!�D!�
Bt
:{Z!�FAILZ!�OKB%:!�DD!�
Bs"Ao"AoZ!�"AoBP

+"
"
B
]"GZ"�:"�,Z"
�:"
�
+"
B
�"
xD"�`Z"�FAILZ"�OKB%0D"�
Bt
:->"
"

+B
�"�D"�
Bt
:{Z"�FAILZ"�OKB%:"�DD"�
Bs"Ao"AoZ"�"AoBP

+"
"
B
]#GZ#�:#�,Z#
�:#
�
+"
B
�#
xD#�`Z#�FAILZ#�OKB%0D#�
Bt
:->"
"

+B
�#�D#�
Bt
:{Z#�FAILZ#�OKB%:#�DD#�
Bs"Ao"AoZ#�"AoBP

+"
"
B
]$GZ$�:$�,Z$
�:$
�
+"
B
�$
xD$�`Z$�FAILZ$�OKB%0D$�
Bt
:->"
"

+B
�$�D$�
Bt
:{Z$�FAILZ$�OKB%:$�DD$�
Bs"Ao"AoZ$�"AoBP

+"
"
B
]%GZ%�:%�,Z%
�:%
�
+"
B
�%
xD%�`Z%�FAILZ%�OKB%0D%�
Bt
:->"
"

+B
�%�D%�
Bt
:{Z%�FAILZ%�OKB%:%�DD%�
Bs"Ao"AoZ%�"AoBP

+"
"
B
]&GZ&�:&�,Z&
�:&
�
+"
B
�&
xD&�`Z&�FAILZ&�OKB%0D&�
Bt
:->"
"

+B
�&�D&�
Bt
:{Z&�FAILZ&�OKB%:&�DD&�
Bs"Ao"AoZ&�"AoBP

+"
"
B
]'GZ'�:'�,Z'
�:'
�
+"
B
�'
xD'�`Z'�FAILZ'�OKB%0D'�
Bt
:->"
"

+B
�'�D'�
Bt
:{Z'�FAILZ'�OKB%:'�DD'�
Bs"Ao"AoZ'�"AoBP

+"
"
B
](GZ(�:(�,Z(
�:(
�
+"
B
�(
xD(�`Z(�FAILZ(�OKB%0D(�
Bt
:->"
"

+B
�(�D(�
Bt
:{Z(�FAILZ(�OKB%:(�DD(�
Bs"Ao"AoZ(�"AoBP

+"
"
B
])GZ)�:)�,Z)
�:)
�
+"
B
�)
xD)�`Z)�FAILZ)�OKB%0D)�
Bt
:->"
"

+B
�)�D)�
Bt
:{Z)�FAILZ)�OKB%:)�DD)�
Bs"Ao"AoZ)�"AoBP

+"
"
B
]*GZ*�:*�,Z*
�:*
�
+"
B
�*
xD*�`Z*�FAILZ*�OKB%0D*�
Bt
:->"
"

+B
�*�D*�
Bt
:{Z*�FAILZ*�OKB%:*�DD*�
Bs"Ao"AoZ*�"AoBP

+"
"
B
]+GZ+�:+�,Z+
�:+
�
+"
B
�+
xD+�`Z+�FAILZ+�OKB%0D+�
Bt
:->"
"

+B
�+�D+�
Bt
:{Z+�FAILZ+�OKB%:+�DD+�
Bs"Ao"AoZ+�"AoBP

+"
"
B
],GZ,�:,�,Z,
�:,
�
+"
B
�,
xD,�`Z,�FAILZ,�OKB%0D,�
Bt
:->"
"

+B
�,�D,�
Bt
:{Z,�FAILZ,�OKB%:,�DD,�
Bs"Ao"AoZ,�"AoBP

+"
"
B
]-GZ-�:-�,Z-
�:-
�
+"
B
�-
xD-�`Z-�FAILZ-�OKB%0D-�
Bt
:->"
"

+B
�-�D-�
Bt
:{Z-�FAILZ-�OKB%:-�DD-�
Bs"Ao"AoZ-�"AoBP

+"
"
B
].GZ.�:.�,Z.
�:.
�
+"
B
�.
xD.�`Z.�FAILZ.�OKB%0D.�
Bt
:->"
"

+B
�.�D.�
Bt
:{Z.�FAILZ.�OKB%:.�DD.�
Bs"Ao"AoZ.�"AoBP

+"
"
B
]/GZ/�:/�,Z/
�:/
�
+"
B
�/
xD/�`Z/�FAILZ/�OKB%0D/�
Bt
:->"
"

+B
�/�D/�
Bt
:{Z/�FAILZ/�OKB%:/�DD/�
Bs"Ao"AoZ/�"AoBP

+"
"
B
]0GZ0�:0�,Z0
�:0
�
+"
B
�0
xD0�`Z0�FAILZ0�OKB%0D0�
Bt
:->"
"

+B
�0�D0�
Bt
:{Z0�FAILZ0�OKB%:0�DD0�
Bs"Ao"AoZ0�"AoBP

+"
"
B
]1GZ1�:1�,Z1
�:1
�
+"
B
�1
xD1�`Z1�FAILZ1�OKB%0D1�
Bt
:->"
"

+B
�1�D1�
Bt
:{Z1�FAILZ1�OKB%:1�DD1�
Bs"Ao"AoZ1�"AoBP

+"
"
B
]2GZ2�:2�,Z2
�:2
�
+"
B
�2
xD2�`Z2�FAILZ2�OKB%0D2�
Bt
:->"
"

+B
�2�D2�
Bt
:{Z2�FAILZ2�OKB%:2�DD2�
Bs"Ao"AoZ2�"AoBP

+"
"
B
]3GZ3�:3�,Z3
�:3
�
+"
B
�3
xD3�`Z3�FAILZ3�OKB%0D3�
Bt
:->"
"

+B
�3�D3�
Bt
:{Z3�FAILZ3�OKB%:3�DD3�
Bs"Ao"AoZ3�"AoBP

+"
"
B
]4GZ4�:4�,Z4
�:4
�
+"
B
�4
xD4�`Z4�FAILZ4�OKB%0D4�
Bt
:->"
"

+B
�4�D4�
Bt
:{Z4�FAILZ4�OKB%:4�DD4�
Bs"Ao"AoZ4�"AoBP

+"
"
B
]5GZ5�:5�,Z5
�:5
�
+"
B
�5
xD5�`Z5�FAILZ5�OKB%0D5�
Bt
:->"
"

+B
�5�D5�
Bt
:{Z5�FAILZ5�OKB%:5�DD5�
Bs"Ao"AoZ5�"AoBP

+"
"
B
]6GZ6�:6�,Z6
�:6
�
+"
B
�6
xD6�`Z6�FAILZ6�OKB%0D6�
Bt
:->"
"

+B
�6�D6�
Bt
:{Z6�FAILZ6�OKB%:6�DD6�
Bs"Ao"AoZ6�"AoBP

+"
"
B
]7GZ7�:7�,Z7
�:7
�
+"
B
�7
xD7�`Z7�FAILZ7�OKB%0D7�
Bt
:->"
"

+B
�7�D7�
Bt
:{Z7�FAILZ7�OKB%:7�DD7�
Bs"Ao"AoZ7�"AoBP

+"
"
B
]8GZ8�:8�,Z8
�:8
�
+"
B
�8
xD8�`Z8�FAILZ8�OKB%0D8�
Bt
:->"
"

+B
�8�D8�
Bt
:{Z8�FAILZ8�OKB%:8�DD8�
Bs"Ao"AoZ8�"AoBP

+"
"
B
]9GZ9�:9�,Z9
�:9
�
+"
B
�9
xD9�`Z9�FAILZ9�OKB%0D9�
Bt
:->"
"

+B
�9�D9�
Bt
:{Z9�FAILZ9�OKB%:9�DD9�
Bs"Ao"AoZ9�"AoBP

+"
"
B
]:GZ:�::�,Z:
�::
�
+"
B
�:
xD:�`Z:�FAILZ:�OKB%0D:�
Bt
:->"
"

+B
�:�D:�
Bt
:{Z:�FAILZ:�OKB%::�DD:�
Bs"Ao"AoZ:�"AoBP

+"
"
B
];GZ;�:;�,Z;
�:;
�
+"
B
�;
xD;�`Z;�FAILZ;�OKB%0D;�
Bt
:->"
"

+B
�;�D;�
Bt
:{Z;�FAILZ;�OKB%:;�DD;�
Bs"Ao"AoZ;�"AoBP

+"
"
B
]<GZ<�:<�,Z<
�:<
�
+"
B
�<
xD<�`Z<�FAILZ<�OKB%0D<�
Bt
:->"
"

+B
�<�D<�
Bt
:{Z<�FAILZ<�OKB%:<�DD<�
Bs"Ao"AoZ<�"AoBP

+"
"
B
]=GZ=�:=�,Z=
�:=
�
+"
B
�=
xD=�`Z=�FAILZ=�OKB%0D=�
Bt
:->"
"

+B
�=�D=�
Bt
:{Z=�FAILZ=�OKB%:=�DD=�
Bs"Ao"AoZ=�"AoBP

+"
"
B
]>GZ>�:>�,Z>
�:>
�
+"
B
�>
xD>�`Z>�FAILZ>�OKB%0D>�
Bt
:->"
"

+B
�>�D>�
Bt
:{Z>�FAILZ>�OKB%:>�DD>�
Bs"Ao"AoZ>�"AoBP

+"
"
B
]?GZ?�:?�,Z?
�:?
�
+"
B
�?
xD?�`Z?�FAILZ?�OKB%0D?�
Bt
:->"
"

+B
�?�D?�
Bt
:{Z?�FAILZ?�OKB%:?�DD?�
Bs"Ao"AoZ?�"AoBP

+"
"
B
@

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

[

\

]

^

_

]@GZ@�:@�,Z@
�:@
�
+"
B
�@
xD@�`Z@�FAILZ@�OKB%0D@�
Bt
:->"
"

+B
�@�D@�
Bt
:{Z@�FAILZ@�OKB%:@�DD@�
Bs"Ao"AoZ@�"AoBP

+"
"
B
]AGZA�:A�,ZA
�:A
�
+"
B
�A
xDA�`ZA�FAILZA�OKB%0DA�
Bt
:->"
"

+B
�A�DA�
Bt
:{ZA�FAILZA�OKB%:A�DDA�
Bs"Ao"AoZA�"AoBP

+"
"
B
]BGZB�:B�,ZB
�:B
�
+"
B
�B
xDB�`ZB�FAILZB�OKB%0DB�
Bt
:->"
"

+B
�B�DB�
Bt
:{ZB�FAILZB�OKB%:B�DDB�
Bs"Ao"AoZB�"AoBP

+"
"
B
]CGZC�:C�,ZC
�:C
�
+"
B
�C
xDC�`ZC�FAILZC�OKB%0DC�
Bt
:->"
"

+B
�C�DC�
Bt
:{ZC�FAILZC�OKB%:C�DDC�
Bs"Ao"AoZC�"AoBP

+"
"
B
]DGZD�:D�,ZD
�:D
�
+"
B
�D
xDD�`ZD�FAILZD�OKB%0DD�
Bt
:->"
"

+B
�D�DD�
Bt
:{ZD�FAILZD�OKB%:D�DDD�
Bs"Ao"AoZD�"AoBP

+"
"
B
]EGZE�:E�,ZE
�:E
�
+"
B
�E
xDE�`ZE�FAILZE�OKB%0DE�
Bt
:->"
"

+B
�E�DE�
Bt
:{ZE�FAILZE�OKB%:E�DDE�
Bs"Ao"AoZE�"AoBP

+"
"
B
]FGZF�:F�,ZF
�:F
�
+"
B
�F
xDF�`ZF�FAILZF�OKB%0DF�
Bt
:->"
"

+B
�F�DF�
Bt
:{ZF�FAILZF�OKB%:F�DDF�
Bs"Ao"AoZF�"AoBP

+"
"
B
]GGZG�:G�,ZG
�:G
�
+"
B
�G
xDG�`ZG�FAILZG�OKB%0DG�
Bt
:->"
"

+B
�G�DG�
Bt
:{ZG�FAILZG�OKB%:G�DDG�
Bs"Ao"AoZG�"AoBP

+"
"
B
]HGZH�:H�,ZH
�:H
�
+"
B
�H
xDH�`ZH�FAILZH�OKB%0DH�
Bt
:->"
"

+B
�H�DH�
Bt
:{ZH�FAILZH�OKB%:H�DDH�
Bs"Ao"AoZH�"AoBP

+"
"
B
]IGZI�:I�,ZI
�:I
�
+"
B
�I
xDI�`ZI�FAILZI�OKB%0DI�
Bt
:->"
"

+B
�I�DI�
Bt
:{ZI�FAILZI�OKB%:I�DDI�
Bs"Ao"AoZI�"AoBP

+"
"
B
]JGZJ�:J�,ZJ
�:J
�
+"
B
�J
xDJ�`ZJ�FAILZJ�OKB%0DJ�
Bt
:->"
"

+B
�J�DJ�
Bt
:{ZJ�FAILZJ�OKB%:J�DDJ�
Bs"Ao"AoZJ�"AoBP

+"
"
B
]KGZK�:K�,ZK
�:K
�
+"
B
�K
xDK�`ZK�FAILZK�OKB%0DK�
Bt
:->"
"

+B
�K�DK�
Bt
:{ZK�FAILZK�OKB%:K�DDK�
Bs"Ao"AoZK�"AoBP

+"
"
B
]LGZL�:L�,ZL
�:L
�
+"
B
�L
xDL�`ZL�FAILZL�OKB%0DL�
Bt
:->"
"

+B
�L�DL�
Bt
:{ZL�FAILZL�OKB%:L�DDL�
Bs"Ao"AoZL�"AoBP

+"
"
B
]MGZM�:M�,ZM
�:M
�
+"
B
�M
xDM�`ZM�FAILZM�OKB%0DM�
Bt
:->"
"

+B
�M�DM�
Bt
:{ZM�FAILZM�OKB%:M�DDM�
Bs"Ao"AoZM�"AoBP

+"
"
B
]NGZN�:N�,ZN
�:N
�
+"
B
�N
xDN�`ZN�FAILZN�OKB%0DN�
Bt
:->"
"

+B
�N�DN�
Bt
:{ZN�FAILZN�OKB%:N�DDN�
Bs"Ao"AoZN�"AoBP

+"
"
B
]OGZO�:O�,ZO
�:O
�
+"
B
�O
xDO�`ZO�FAILZO�OKB%0DO�
Bt
:->"
"

+B
�O�DO�
Bt
:{ZO�FAILZO�OKB%:O�DDO�
Bs"Ao"AoZO�"AoBP

+"
"
B
]PGZP�:P�,ZP
�:P
�
+"
B
�P
xDP�`ZP�FAILZP�OKB%0DP�
Bt
:->"
"

+B
�P�DP�
Bt
:{ZP�FAILZP�OKB%:P�DDP�
Bs"Ao"AoZP�"AoBP

+"
"
B
]QGZQ�:Q�,ZQ
�:Q
�
+"
B
�Q
xDQ�`ZQ�FAILZQ�OKB%0DQ�
Bt
:->"
"

+B
�Q�DQ�
Bt
:{ZQ�FAILZQ�OKB%:Q�DDQ�
Bs"Ao"AoZQ�"AoBP

+"
"
B
]RGZR�:R�,ZR
�:R
�
+"
B
�R
xDR�`ZR�FAILZR�OKB%0DR�
Bt
:->"
"

+B
�R�DR�
Bt
:{ZR�FAILZR�OKB%:R�DDR�
Bs"Ao"AoZR�"AoBP

+"
"
B
]SGZS�:S�,ZS
�:S
�
+"
B
�S
xDS�`ZS�FAILZS�OKB%0DS�
Bt
:->"
"

+B
�S�DS�
Bt
:{ZS�FAILZS�OKB%:S�DDS�
Bs"Ao"AoZS�"AoBP

+"
"
B
]TGZT�:T�,ZT
�:T
�
+"
B
�T
xDT�`ZT�FAILZT�OKB%0DT�
Bt
:->"
"

+B
�T�DT�
Bt
:{ZT�FAILZT�OKB%:T�DDT�
Bs"Ao"AoZT�"AoBP

+"
"
B
]UGZU�:U�,ZU
�:U
�
+"
B
�U
xDU�`ZU�FAILZU�OKB%0DU�
Bt
:->"
"

+B
�U�DU�
Bt
:{ZU�FAILZU�OKB%:U�DDU�
Bs"Ao"AoZU�"AoBP

+"
"
B
]VGZV�:V�,ZV
�:V
�
+"
B
�V
xDV�`ZV�FAILZV�OKB%0DV�
Bt
:->"
"

+B
�V�DV�
Bt
:{ZV�FAILZV�OKB%:V�DDV�
Bs"Ao"AoZV�"AoBP

+"
"
B
]WGZW�:W�,ZW
�:W
�
+"
B
�W
xDW�`ZW�FAILZW�OKB%0DW�
Bt
:->"
"

+B
�W�DW�
Bt
:{ZW�FAILZW�OKB%:W�DDW�
Bs"Ao"AoZW�"AoBP

+"
"
B
]XGZX�:X�,ZX
�:X
�
+"
B
�X
xDX�`ZX�FAILZX�OKB%0DX�
Bt
:->"
"

+B
�X�DX�
Bt
:{ZX�FAILZX�OKB%:X�DDX�
Bs"Ao"AoZX�"AoBP

+"
"
B
]YGZY�:Y�,ZY
�:Y
�
+"
B
����������������������������������������������������������������������������������������������������������������������������������������









	

+






















 
!
"
#
$
%
&
'
(
)
*
+
,
-
.
/
0
1
2
3
4
5
6
7
8
9
:
;
<
=
>
?
@
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
[
\
]
^
_
`
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
z
{
|
}
~

�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
�
���������
�����
���������������������������������������������������������������������������������Y
xDY�`ZY�FAILZY�OKB%0DY�
Bt
:->"
"

+B
�Y�DY�
Bt
:{ZY�FAILZY�OKB%:Y�DDY�
Bs"Ao"AoZY�"AoBP

+"
"
B
]ZGZZ�:Z�,ZZ
�:Z
�
+"
B
�Z
xDZ�`ZZ�FAILZZ�OKB%0DZ�
Bt
:->"
"

+B
�Z�DZ�
Bt
:{ZZ�FAILZZ�OKB%:Z�DDZ�
Bs"Ao"AoZZ�"AoBP

+"
"
B
][GZ[�:[�,Z[
�:[
�
+"
B
�[
xD[�`Z[�FAILZ[�OKB%0D[�
Bt
:->"
"

+B
�[�D[�
Bt
:{Z[�FAILZ[�OKB%:[�DD[�
Bs"Ao"AoZ[�"AoBP

+"
"
B
]\GZ\�:\�,Z\
�:\
�
+"
B
�\
xD\�`Z\�FAILZ\�OKB%0D\�
Bt
:->"
"

+B
�\�D\�
Bt
:{Z\�FAILZ\�OKB%:\�DD\�
Bs"Ao"AoZ\�"AoBP

+"
"
B
]]GZ]�:]�,Z]
�:]
�
+"
B
�]
xD]�`Z]�FAILZ]�OKB%0D]�
Bt
:->"
"

+B
�]�D]�
Bt
:{Z]�FAILZ]�OKB%:]�DD]�
Bs"Ao"AoZ]�"AoBP

+"
"
B
]^GZ^�:^�,Z^
�:^
�
+"
B
�^
xD^�`Z^�FAILZ^�OKB%0D^�
Bt
:->"
"

+B
�^�D^�
Bt
:{Z^�FAILZ^�OKB%:^�DD^�
Bs"Ao"AoZ^�"AoBP

+"
"
B
]_GZ_�:_�,Z_
�:_
�
+"
B
�_
xD_�`Z_�FAILZ_�OKB%0D_�
Bt
:->"
"

+B
�_�D_�
Bt
:{Z_�FAILZ_�OKB%:_�DD_�
Bs"Ao"AoZ_�"AoBP

+"
"
B
`

a

b

c

d

e

f

g

h

i

j

k

l

m

n

o

p

q

r

s

t

u

v

w

x

y

z

{

|

}

~



]`GZ`�:`�,Z`
�:`
�
+"
B
�`
xD`�`Z`�FAILZ`�OKB%0D`�
Bt
:->"
"

+B
�`�D`�
Bt
:{Z`�FAILZ`�OKB%:`�DD`�
Bs"Ao"AoZ`�"AoBP

+"
"
B
]aGZa�:a�,Za
�:a
�
+"
B
�a
xDa�`Za�FAILZa�OKB%0Da�
Bt
:->"
"

+B
�a�Da�
Bt
:{Za�FAILZa�OKB%:a�DDa�
Bs"Ao"AoZa�"AoBP

+"
"
B
]bGZb�:b�,Zb
�:b
�
+"
B
�b
xDb�`Zb�FAILZb�OKB%0Db�
Bt
:->"
"

+B
�b�Db�
Bt
:{Zb�FAILZb�OKB%:b�DDb�
Bs"Ao"AoZb�"AoBP

+"
"
B
]cGZc�:c�,Zc
�:c
�
+"
B
�c
xDc�`Zc�FAILZc�OKB%0Dc�
Bt
:->"
"

+B
�c�Dc�
Bt
:{Zc�FAILZc�OKB%:c�DDc�
Bs"Ao"AoZc�"AoBP

+"
"
B
]dGZd�:d�,Zd
�:d
�
+"
B
�d
xDd�`Zd�FAILZd�OKB%0Dd�
Bt
:->"
"

+B
�d�Dd�
Bt
:{Zd�FAILZd�OKB%:d�DDd�
Bs"Ao"AoZd�"AoBP

+"
"
B
]eGZe�:e�,Ze
�:e
�
+"
B
�e
xDe�`Ze�FAILZe�OKB%0De�
Bt
:->"
"

+B
�e�De�
Bt
:{Ze�FAILZe�OKB%:e�DDe�
Bs"Ao"AoZe�"AoBP

+"
"
B
]fGZf�:f�,Zf
�:f
�
+"
B
�f
xDf�`Zf�FAILZf�OKB%0Df�
Bt
:->"
"

+B
�f�Df�
Bt
:{Zf�FAILZf�OKB%:f�DDf�
Bs"Ao"AoZf�"AoBP

+"
"
B
]gGZg�:g�,Zg
�:g
�
+"
B
�g
xDg�`Zg�FAILZg�OKB%0Dg�
Bt
:->"
"

+B
�g�Dg�
Bt
:{Zg�FAILZg�OKB%:g�DDg�
Bs"Ao"AoZg�"AoBP

+"
"
B
]hGZh�:h�,Zh
�:h
�
+"
B
�h
xDh�`Zh�FAILZh�OKB%0Dh�
Bt
:->"
"

+B
�h�Dh�
Bt
:{Zh�FAILZh�OKB%:h�DDh�
Bs"Ao"AoZh�"AoBP

+"
"
B
]iGZi�:i�,Zi
�:i
�
+"
B
�i
xDi�`Zi�FAILZi�OKB%0Di�
Bt
:->"
"

+B
�i�Di�
Bt
:{Zi�FAILZi�OKB%:i�DDi�
Bs"Ao"AoZi�"AoBP

+"
"
B
]jGZj�:j�,Zj
�:j
�
+"
B
�j
xDj�`Zj�FAILZj�OKB%0Dj�
Bt
:->"
"

+B
�j�Dj�
Bt
:{Zj�FAILZj�OKB%:j�DDj�
Bs"Ao"AoZj�"AoBP

+"
"
B
]kGZk�:k�,Zk
�:k
�
+"
B
�k
xDk�`Zk�FAILZk�OKB%0Dk�
Bt
:->"
"

+B
�k�Dk�
Bt
:{Zk�FAILZk�OKB%:k�DDk�
Bs"Ao"AoZk�"AoBP

+"
"
B
]lGZl�:l�,Zl
�:l
�
+"
B
�l
xDl�`Zl�FAILZl�OKB%0Dl�
Bt
:->"
"

+B
�l�Dl�
Bt
:{Zl�FAILZl�OKB%:l�DDl�
Bs"Ao"AoZl�"AoBP

+"
"
B
]mGZm�:m�,Zm
�:m
�
+"
B
�m
xDm�`Zm�FAILZm�OKB%0Dm�
Bt
:->"
"

+B
�m�Dm�
Bt
:{Zm�FAILZm�OKB%:m�DDm�
Bs"Ao"AoZm�"AoBP

+"
"
B
]nGZn�:n�,Zn
�:n
�
+"
B
�n
xDn�`Zn�FAILZn�OKB%0Dn�
Bt
:->"
"

+B
�n�Dn�
Bt
:{Zn�FAILZn�OKB%:n�DDn�
Bs"Ao"AoZn�"AoBP

+"
"
B
]oGZo�:o�,Zo
�:o
�
+"
B
�o
xDo�`Zo�FAILZo�OKB%0Do�
Bt
:->"
"

+B
�o�Do�
Bt
:{Zo�FAILZo�OKB%:o�DDo�
Bs"Ao"AoZo�"AoBP

+"
"
B
]pGZp�:p�,Zp
�:p
�
+"
B
�p
xDp�`Zp�FAILZp�OKB%0Dp�
Bt
:->"
"

+B
�p�Dp�
Bt
:{Zp�FAILZp�OKB%:p�DDp�
Bs"Ao"AoZp�"AoBP

+"
"
B
]qGZq�:q�,Zq
�:q
�
+"
B
�q
xDq�`Zq�FAILZq�OKB%0Dq�
Bt
:->"
"

+B
�q�Dq�
Bt
:{Zq�FAILZq�OKB%:q�DDq�
Bs"Ao"AoZq�"AoBP

+"
"
B
]rGZr�:r�,Zr
�:r
�
+"
B
�r
xDr�`Zr�FAILZr�OKB%0Dr�
Bt
:->"
"

+B
�r�Dr�
Bt
:{Zr�FAILZr�OKB%:r�DDr�
Bs"Ao"AoZr�"AoBP

+"
"
B
]sGZs�:s�,Zs
�:s
�
+"
B
�s
xDs�`Zs�FAILZs�OKB%0Ds�
Bt
:->"
"

+B
�s�Ds�
Bt
:{Zs�FAILZs�OKB%:s�DDs�
Bs"Ao"AoZs�"AoBP

+"
"
B
]tGZt�:t�,Zt
�:t
�
+"
B
�t
xDt�`Zt�FAILZt�OKB%0Dt�
Bt
:->"
"

+B
�t�Dt�
Bt
:{Zt�FAILZt�OKB%:t�DDt�
Bs"Ao"AoZt�"AoBP

+"
"
B
]uGZu�:u�,Zu
�:u
�
+"
B
�u
xDu�`Zu�FAILZu�OKB%0Du�
Bt
:->"
"

+B
�u�Du�
Bt
:{Zu�FAILZu�OKB%:u�DDu�
Bs"Ao"AoZu�"AoBP

+"
"
B
]vGZv�:v�,Zv
�:v
�
+"
B
�v
xDv�`Zv�FAILZv�OKB%0Dv�
Bt
:->"
"

+B
�v�Dv�
Bt
:{Zv�FAILZv�OKB%:v�DDv�
Bs"Ao"AoZv�"AoBP

+"
"
B
]wGZw�:w�,Zw
�:w
�
+"
B
�w
xDw�`Zw�FAILZw�OKB%0Dw�
Bt
:->"
"

+B
�w�Dw�
Bt
:{Zw�FAILZw�OKB%:w�DDw�
Bs"Ao"AoZw�"AoBP

+"
"
B
]xGZx�:x�,Zx
�:x
�
+"
B
�x
xDx�`Zx�FAILZx�OKB%0Dx�
Bt
:->"
"

+B
�x�Dx�
Bt
:{Zx�FAILZx�OKB%:x�DDx�
Bs"Ao"AoZx�"AoBP

+"
"
B
]yGZy�:y�,Zy
�:y
�
+"
B
�y
xDy�`Zy�FAILZy�OKB%0Dy�
Bt
:->"
"

+B
�y�Dy�
Bt
:{Zy�FAILZy�OKB%:y�DDy�
Bs"Ao"AoZy�"AoBP

+"
"
B
]zGZz�:z�,Zz
�:z
�
+"
B
�z
xDz�`Zz�FAILZz�OKB%0Dz�
Bt
:->"
"

+B
�z�Dz�
Bt
:{Zz�FAILZz�OKB%:z�DDz�
Bs"Ao"AoZz�"AoBP

+"
"
B
]{GZ{�:{�,Z{
�:{
�
+"
B
�{
xD{�`Z{�FAILZ{�OKB%0D{�
Bt
:->"
"

+B
�{�D{�
Bt
:{Z{�FAILZ{�OKB%:{�DD{�
Bs"Ao"AoZ{�"AoBP

+"
"
B
]|GZ|�:|�,Z|
�:|
�
+"
B
�|
xD|�`Z|�FAILZ|�OKB%0D|�
Bt
:->"
"

+B
�|�D|�
Bt
:{Z|�FAILZ|�OKB%:|�DD|�
Bs"Ao"AoZ|�"AoBP

+"
"
B
]}GZ}�:}�,Z}
�:}
�
+"
B
�}
xD}�`Z}�FAILZ}�OKB%0D}�
Bt
:->"
"

+B
�}�D}�
Bt
:{Z}�FAILZ}�OKB%:}�DD}�
Bs"Ao"AoZ}�"AoBP

+"
"
B
]~GZ~�:~�,Z~
�:~
�
+"
B
�~
xD~�`Z~�FAILZ~�OKB%0D~�
Bt
:->"
"

+B
�~�D~�
Bt
:{Z~�FAILZ~�OKB%:~�DD~�
Bs"Ao"AoZ~�"AoBP

+"
"
B
]GZ�:�,Z
�:
�
+"
B
�
xD�`Z�FAILZ�OKB%0D�
Bt
:->"
"

+B
��D�
Bt
:{Z�FAILZ�OKB%:�DD�
Bs"Ao"AoZ�"AoBP

+"
"
B
�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

�

]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B
]�GZ��:��,Z�
�:�
�
+"
B
��
xD��`Z��FAILZ��OKB%0D��
Bt
:->"
"

+B
���D��
Bt
:{Z��FAILZ��OKB%:��DD��
Bs"Ao"AoZ��"AoBP

+"
"
B




























	



+


































































]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]

GZ

�:

�,Z


�:


�
+"
B
�


xD

�`Z

�FAILZ

�OKB%0D

�
Bt
:->"
"

+B
�

�D

�
Bt
:{Z

�FAILZ

�OKB%:

�DD

�
Bs"Ao"AoZ

�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]	
GZ	
�:	
�,Z	

�:	

�
+"
B
�	

xD	
�`Z	
�FAILZ	
�OKB%0D	
�
Bt
:->"
"

+B
�	
�D	
�
Bt
:{Z	
�FAILZ	
�OKB%:	
�DD	
�
Bs"Ao"AoZ	
�"AoBP

+"
"
B
]
+
GZ
+
�:
+
�,Z
+

�:
+

�
+"
B
�
+

xD
+
�`Z
+
�FAILZ
+
�OKB%0D
+
�
Bt
:->"
"

+B
�
+
�D
+
�
Bt
:{Z
+
�FAILZ
+
�OKB%:
+
�DD
+
�
Bs"Ao"AoZ
+
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]

GZ

�:

�,Z


�:


�
+"
B
�


xD

�`Z

�FAILZ

�OKB%0D

�
Bt
:->"
"

+B
�

�D

�
Bt
:{Z

�FAILZ

�OKB%:

�DD

�
Bs"Ao"AoZ

�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
 


!


"


#


$


%


&


'


(


)


*


+


,


-


.


/


0


1


2


3


4


5


6


7


8


9


:


;


<


=


>


?


] 
GZ 
�: 
�,Z 

�: 

�
+"
B
� 

xD 
�`Z 
�FAILZ 
�OKB%0D 
�
Bt
:->"
"

+B
� 
�D 
�
Bt
:{Z 
�FAILZ 
�OKB%: 
�DD 
�
Bs"Ao"AoZ 
�"AoBP

+"
"
B
]!
GZ!
�:!
�,Z!

�:!

�
+"
B
�!

xD!
�`Z!
�FAILZ!
�OKB%0D!
�
Bt
:->"
"

+B
�!
�D!
�
Bt
:{Z!
�FAILZ!
�OKB%:!
�DD!
�
Bs"Ao"AoZ!
�"AoBP

+"
"
B
]"
GZ"
�:"
�,Z"

�:"

�
+"
B
�"

xD"
�`Z"
�FAILZ"
�OKB%0D"
�
Bt
:->"
"

+B
�"
�D"
�
Bt
:{Z"
�FAILZ"
�OKB%:"
�DD"
�
Bs"Ao"AoZ"
�"AoBP

+"
"
B
]#
GZ#
�:#
�,Z#

�:#

�
+"
B
�#

xD#
�`Z#
�FAILZ#
�OKB%0D#
�
Bt
:->"
"

+B
�#
�D#
�
Bt
:{Z#
�FAILZ#
�OKB%:#
�DD#
�
Bs"Ao"AoZ#
�"AoBP

+"
"
B
]$
GZ$
�:$
�,Z$

�:$

�
+"
B
�$

xD$
�`Z$
�FAILZ$
�OKB%0D$
�
Bt
:->"
"

+B
�$
�D$
�
Bt
:{Z$
�FAILZ$
�OKB%:$
�DD$
�
Bs"Ao"AoZ$
�"AoBP

+"
"
B
]%
GZ%
�:%
�,Z%

�:%

�
+"
B
�%

xD%
�`Z%
�FAILZ%
�OKB%0D%
�
Bt
:->"
"

+B
�%
�D%
�
Bt
:{Z%
�FAILZ%
�OKB%:%
�DD%
�
Bs"Ao"AoZ%
�"AoBP

+"
"
B
]&
GZ&
�:&
�,Z&

�:&

�
+"
B
�&

xD&
�`Z&
�FAILZ&
�OKB%0D&
�
Bt
:->"
"

+B
�&
�D&
�
Bt
:{Z&
�FAILZ&
�OKB%:&
�DD&
�
Bs"Ao"AoZ&
�"AoBP

+"
"
B
]'
GZ'
�:'
�,Z'

�:'

�
+"
B
�'

xD'
�`Z'
�FAILZ'
�OKB%0D'
�
Bt
:->"
"

+B
�'
�D'
�
Bt
:{Z'
�FAILZ'
�OKB%:'
�DD'
�
Bs"Ao"AoZ'
�"AoBP

+"
"
B
](
GZ(
�:(
�,Z(

�:(

�
+"
B
�(

xD(
�`Z(
�FAILZ(
�OKB%0D(
�
Bt
:->"
"

+B
�(
�D(
�
Bt
:{Z(
�FAILZ(
�OKB%:(
�DD(
�
Bs"Ao"AoZ(
�"AoBP

+"
"
B
])
GZ)
�:)
�,Z)

�:)

�
+"
B
�)

xD)
�`Z)
�FAILZ)
�OKB%0D)
�
Bt
:->"
"

+B
�)
�D)
�
Bt
:{Z)
�FAILZ)
�OKB%:)
�DD)
�
Bs"Ao"AoZ)
�"AoBP

+"
"
B
]*
GZ*
�:*
�,Z*

�:*

�
+"
B
�*

xD*
�`Z*
�FAILZ*
�OKB%0D*
�
Bt
:->"
"

+B
�*
�D*
�
Bt
:{Z*
�FAILZ*
�OKB%:*
�DD*
�
Bs"Ao"AoZ*
�"AoBP

+"
"
B
]+
GZ+
�:+
�,Z+

�:+

�
+"
B
�+

xD+
�`Z+
�FAILZ+
�OKB%0D+
�
Bt
:->"
"

+B
�+
�D+
�
Bt
:{Z+
�FAILZ+
�OKB%:+
�DD+
�
Bs"Ao"AoZ+
�"AoBP

+"
"
B
],
GZ,
�:,
�,Z,

�:,

�
+"
B
�,

xD,
�`Z,
�FAILZ,
�OKB%0D,
�
Bt
:->"
"

+B
�,
�D,
�
Bt
:{Z,
�FAILZ,
�OKB%:,
�DD,
�
Bs"Ao"AoZ,
�"AoBP

+"
"
B
]-
GZ-
�:-
�,Z-

�:-

�
+"
B
�-

xD-
�`Z-
�FAILZ-
�OKB%0D-
�
Bt
:->"
"

+B
�-
�D-
�
Bt
:{Z-
�FAILZ-
�OKB%:-
�DD-
�
Bs"Ao"AoZ-
�"AoBP

+"
"
B
].
GZ.
�:.
�,Z.

�:.

�
+"
B
�.

xD.
�`Z.
�FAILZ.
�OKB%0D.
�
Bt
:->"
"

+B
�.
�D.
�
Bt
:{Z.
�FAILZ.
�OKB%:.
�DD.
�
Bs"Ao"AoZ.
�"AoBP

+"
"
B
]/
GZ/
�:/
�,Z/

�:/

�
+"
B
�/

xD/
�`Z/
�FAILZ/
�OKB%0D/
�
Bt
:->"
"

+B
�/
�D/
�
Bt
:{Z/
�FAILZ/
�OKB%:/
�DD/
�
Bs"Ao"AoZ/
�"AoBP

+"
"
B
]0
GZ0
�:0
�,Z0

�:0

�
+"
B
�0

xD0
�`Z0
�FAILZ0
�OKB%0D0
�
Bt
:->"
"

+B
�0
�D0
�
Bt
:{Z0
�FAILZ0
�OKB%:0
�DD0
�
Bs"Ao"AoZ0
�"AoBP

+"
"
B
]1
GZ1
�:1
�,Z1

�:1

�
+"
B
�1

xD1
�`Z1
�FAILZ1
�OKB%0D1
�
Bt
:->"
"

+B
�1
�D1
�
Bt
:{Z1
�FAILZ1
�OKB%:1
�DD1
�
Bs"Ao"AoZ1
�"AoBP

+"
"
B
]2
GZ2
�:2
�,Z2

�:2

�
+"
B
�2

xD2
�`Z2
�FAILZ2
�OKB%0D2
�
Bt
:->"
"

+B
�2
�D2
�
Bt
:{Z2
�FAILZ2
�OKB%:2
�DD2
�
Bs"Ao"AoZ2
�"AoBP

+"
"
B
]3
GZ3
�:3
�,Z3

�:3

�
+"
B
�3

xD3
�`Z3
�FAILZ3
�OKB%0D3
�
Bt
:->"
"

+B
�3
�D3
�
Bt
:{Z3
�FAILZ3
�OKB%:3
�DD3
�
Bs"Ao"AoZ3
�"AoBP

+"
"
B
]4
GZ4
�:4
�,Z4

�:4

�
+"
B
�4

xD4
�`Z4
�FAILZ4
�OKB%0D4
�
Bt
:->"
"

+B
�4
�D4
�
Bt
:{Z4
�FAILZ4
�OKB%:4
�DD4
�
Bs"Ao"AoZ4
�"AoBP

+"
"
B
]5
GZ5
�:5
�,Z5

�:5

�
+"
B
�5

xD5
�`Z5
�FAILZ5
�OKB%0D5
�
Bt
:->"
"

+B
�5
�D5
�
Bt
:{Z5
�FAILZ5
�OKB%:5
�DD5
�
Bs"Ao"AoZ5
�"AoBP

+"
"
B
]6
GZ6
�:6
�,Z6

�:6

�
+"
B
�6

xD6
�`Z6
�FAILZ6
�OKB%0D6
�
Bt
:->"
"

+B
�6
�D6
�
Bt
:{Z6
�FAILZ6
�OKB%:6
�DD6
�
Bs"Ao"AoZ6
�"AoBP

+"
"
B
]7
GZ7
�:7
�,Z7

�:7

�
+"
B
�7

xD7
�`Z7
�FAILZ7
�OKB%0D7
�
Bt
:->"
"

+B
�7
�D7
�
Bt
:{Z7
�FAILZ7
�OKB%:7
�DD7
�
Bs"Ao"AoZ7
�"AoBP

+"
"
B
]8
GZ8
�:8
�,Z8

�:8

�
+"
B
�8

xD8
�`Z8
�FAILZ8
�OKB%0D8
�
Bt
:->"
"

+B
�8
�D8
�
Bt
:{Z8
�FAILZ8
�OKB%:8
�DD8
�
Bs"Ao"AoZ8
�"AoBP

+"
"
B
]9
GZ9
�:9
�,Z9

�:9

�
+"
B
�9

xD9
�`Z9
�FAILZ9
�OKB%0D9
�
Bt
:->"
"

+B
�9
�D9
�
Bt
:{Z9
�FAILZ9
�OKB%:9
�DD9
�
Bs"Ao"AoZ9
�"AoBP

+"
"
B
]:
GZ:
�::
�,Z:

�::

�
+"
B
�:

xD:
�`Z:
�FAILZ:
�OKB%0D:
�
Bt
:->"
"

+B
�:
�D:
�
Bt
:{Z:
�FAILZ:
�OKB%::
�DD:
�
Bs"Ao"AoZ:
�"AoBP

+"
"
B
];
GZ;
�:;
�,Z;

�:;

�
+"
B
�;

xD;
�`Z;
�FAILZ;
�OKB%0D;
�
Bt
:->"
"

+B
�;
�D;
�
Bt
:{Z;
�FAILZ;
�OKB%:;
�DD;
�
Bs"Ao"AoZ;
�"AoBP

+"
"
B
]<
GZ<
�:<
�,Z<

�:<

�
+"
B
�<

xD<
�`Z<
�FAILZ<
�OKB%0D<
�
Bt
:->"
"

+B
�<
�D<
�
Bt
:{Z<
�FAILZ<
�OKB%:<
�DD<
�
Bs"Ao"AoZ<
�"AoBP

+"
"
B
]=
GZ=
�:=
�,Z=

�:=

�
+"
B
�=

xD=
�`Z=
�FAILZ=
�OKB%0D=
�
Bt
:->"
"

+B
�=
�D=
�
Bt
:{Z=
�FAILZ=
�OKB%:=
�DD=
�
Bs"Ao"AoZ=
�"AoBP

+"
"
B
]>
GZ>
�:>
�,Z>

�:>

�
+"
B
�>

xD>
�`Z>
�FAILZ>
�OKB%0D>
�
Bt
:->"
"

+B
�>
�D>
�
Bt
:{Z>
�FAILZ>
�OKB%:>
�DD>
�
Bs"Ao"AoZ>
�"AoBP

+"
"
B
]?
GZ?
�:?
�,Z?

�:?

�
+"
B
�?

xD?
�`Z?
�FAILZ?
�OKB%0D?
�
Bt
:->"
"

+B
�?
�D?
�
Bt
:{Z?
�FAILZ?
�OKB%:?
�DD?
�
Bs"Ao"AoZ?
�"AoBP

+"
"
B
@


A


B


C


D


E


F


G


H


I


J


K


L


M


N


O


P


Q


R


S


T


U


V


W


X


Y


Z


[


\


]


^


_


]@
GZ@
�:@
�,Z@

�:@

�
+"
B
�@

xD@
�`Z@
�FAILZ@
�OKB%0D@
�
Bt
:->"
"

+B
�@
�D@
�
Bt
:{Z@
�FAILZ@
�OKB%:@
�DD@
�
Bs"Ao"AoZ@
�"AoBP

+"
"
B
]A
GZA
�:A
�,ZA

�:A

�
+"
B
�A

xDA
�`ZA
�FAILZA
�OKB%0DA
�
Bt
:->"
"

+B
�A
�DA
�
Bt
:{ZA
�FAILZA
�OKB%:A
�DDA
�
Bs"Ao"AoZA
�"AoBP

+"
"
B
]B
GZB
�:B
�,ZB

�:B

�
+"
B
�B

xDB
�`ZB
�FAILZB
�OKB%0DB
�
Bt
:->"
"

+B
�B
�DB
�
Bt
:{ZB
�FAILZB
�OKB%:B
�DDB
�
Bs"Ao"AoZB
�"AoBP

+"
"
B
]C
GZC
�:C
�,ZC

�:C

�
+"
B
�C

xDC
�`ZC
�FAILZC
�OKB%0DC
�
Bt
:->"
"

+B
�C
�DC
�
Bt
:{ZC
�FAILZC
�OKB%:C
�DDC
�
Bs"Ao"AoZC
�"AoBP

+"
"
B
]D
GZD
�:D
�,ZD

�:D

�
+"
B
�D

xDD
�`ZD
�FAILZD
�OKB%0DD
�
Bt
:->"
"

+B
�D
�DD
�
Bt
:{ZD
�FAILZD
�OKB%:D
�DDD
�
Bs"Ao"AoZD
�"AoBP

+"
"
B
]E
GZE
�:E
�,ZE

�:E

�
+"
B
�E

xDE
�`ZE
�FAILZE
�OKB%0DE
�
Bt
:->"
"

+B
�E
�DE
�
Bt
:{ZE
�FAILZE
�OKB%:E
�DDE
�
Bs"Ao"AoZE
�"AoBP

+"
"
B
]F
GZF
�:F
�,ZF

�:F

�
+"
B
�F

xDF
�`ZF
�FAILZF
�OKB%0DF
�
Bt
:->"
"

+B
�F
�DF
�
Bt
:{ZF
�FAILZF
�OKB%:F
�DDF
�
Bs"Ao"AoZF
�"AoBP

+"
"
B
]G
GZG
�:G
�,ZG

�:G

�
+"
B
�G

xDG
�`ZG
�FAILZG
�OKB%0DG
�
Bt
:->"
"

+B
�G
�DG
�
Bt
:{ZG
�FAILZG
�OKB%:G
�DDG
�
Bs"Ao"AoZG
�"AoBP

+"
"
B
]H
GZH
�:H
�,ZH

�:H

�
+"
B
�H

xDH
�`ZH
�FAILZH
�OKB%0DH
�
Bt
:->"
"

+B
�H
�DH
�
Bt
:{ZH
�FAILZH
�OKB%:H
�DDH
�
Bs"Ao"AoZH
�"AoBP

+"
"
B
]I
GZI
�:I
�,ZI

�:I

�
+"
B
�I

xDI
�`ZI
�FAILZI
�OKB%0DI
�
Bt
:->"
"

+B
�I
�DI
�
Bt
:{ZI
�FAILZI
�OKB%:I
�DDI
�
Bs"Ao"AoZI
�"AoBP

+"
"
B
]J
GZJ
�:J
�,ZJ

�:J

�
+"
B
�J

xDJ
�`ZJ
�FAILZJ
�OKB%0DJ
�
Bt
:->"
"

+B
�J
�DJ
�
Bt
:{ZJ
�FAILZJ
�OKB%:J
�DDJ
�
Bs"Ao"AoZJ
�"AoBP

+"
"
B
]K
GZK
�:K
�,ZK

�:K

�
+"
B
�K

xDK
�`ZK
�FAILZK
�OKB%0DK
�
Bt
:->"
"

+B
�K
�DK
�
Bt
:{ZK
�FAILZK
�OKB%:K
�DDK
�
Bs"Ao"AoZK
�"AoBP

+"
"
B
]L
GZL
�:L
�,ZL

�:L

�
+"
B
�L

xDL
�`ZL
�FAILZL
�OKB%0DL
�
Bt
:->"
"

+B
�L
�DL
�
Bt
:{ZL
�FAILZL
�OKB%:L
�DDL
�
Bs"Ao"AoZL
�"AoBP

+"
"
B
]M
GZM
�:M
�,ZM

�:M

�
+"
B
�M

xDM
�`ZM
�FAILZM
�OKB%0DM
�
Bt
:->"
"

+B
�M
�DM
�
Bt
:{ZM
�FAILZM
�OKB%:M
�DDM
�
Bs"Ao"AoZM
�"AoBP

+"
"
B
]N
GZN
�:N
�,ZN

�:N

�
+"
B
�N

xDN
�`ZN
�FAILZN
�OKB%0DN
�
Bt
:->"
"

+B
�N
�DN
�
Bt
:{ZN
�FAILZN
�OKB%:N
�DDN
�
Bs"Ao"AoZN
�"AoBP

+"
"
B
]O
GZO
�:O
�,ZO

�:O

�
+"
B
�O

xDO
�`ZO
�FAILZO
�OKB%0DO
�
Bt
:->"
"

+B
�O
�DO
�
Bt
:{ZO
�FAILZO
�OKB%:O
�DDO
�
Bs"Ao"AoZO
�"AoBP

+"
"
B
]P
GZP
�:P
�,ZP

�:P

�
+"
B
�P

xDP
�`ZP
�FAILZP
�OKB%0DP
�
Bt
:->"
"

+B
�P
�DP
�
Bt
:{ZP
�FAILZP
�OKB%:P
�DDP
�
Bs"Ao"AoZP
�"AoBP

+"
"
B
]Q
GZQ
�:Q
�,ZQ

�:Q

�
+"
B
�Q

xDQ
�`ZQ
�FAILZQ
�OKB%0DQ
�
Bt
:->"
"

+B
�Q
�DQ
�
Bt
:{ZQ
�FAILZQ
�OKB%:Q
�DDQ
�
Bs"Ao"AoZQ
�"AoBP

+"
"
B
]R
GZR
�:R
�,ZR

�:R

�
+"
B
�R

xDR
�`ZR
�FAILZR
�OKB%0DR
�
Bt
:->"
"

+B
�R
�DR
�
Bt
:{ZR
�FAILZR
�OKB%:R
�DDR
�
Bs"Ao"AoZR
�"AoBP

+"
"
B
]S
GZS
�:S
�,ZS

�:S

�
+"
B
�S

xDS
�`ZS
�FAILZS
�OKB%0DS
�
Bt
:->"
"

+B
�S
�DS
�
Bt
:{ZS
�FAILZS
�OKB%:S
�DDS
�
Bs"Ao"AoZS
�"AoBP

+"
"
B
]T
GZT
�:T
�,ZT

�:T

�
+"
B
�T

xDT
�`ZT
�FAILZT
�OKB%0DT
�
Bt
:->"
"

+B
�T
�DT
�
Bt
:{ZT
�FAILZT
�OKB%:T
�DDT
�
Bs"Ao"AoZT
�"AoBP

+"
"
B
]U
GZU
�:U
�,ZU

�:U

�
+"
B
�U

xDU
�`ZU
�FAILZU
�OKB%0DU
�
Bt
:->"
"

+B
�U
�DU
�
Bt
:{ZU
�FAILZU
�OKB%:U
�DDU
�
Bs"Ao"AoZU
�"AoBP

+"
"
B
]V
GZV
�:V
�,ZV

�:V

�
+"
B
�V

xDV
�`ZV
�FAILZV
�OKB%0DV
�
Bt
:->"
"

+B
�V
�DV
�
Bt
:{ZV
�FAILZV
�OKB%:V
�DDV
�
Bs"Ao"AoZV
�"AoBP

+"
"
B
]W
GZW
�:W
�,ZW

�:W

�
+"
B
�W

xDW
�`ZW
�FAILZW
�OKB%0DW
�
Bt
:->"
"

+B
�W
�DW
�
Bt
:{ZW
�FAILZW
�OKB%:W
�DDW
�
Bs"Ao"AoZW
�"AoBP

+"
"
B
]X
GZX
�:X
�,ZX

�:X

�
+"
B
�X

xDX
�`ZX
�FAILZX
�OKB%0DX
�
Bt
:->"
"

+B
�X
�DX
�
Bt
:{ZX
�FAILZX
�OKB%:X
�DDX
�
Bs"Ao"AoZX
�"AoBP

+"
"
B
]Y
GZY
�:Y
�,ZY

�:Y

�
+"
B
�Y

xDY
�`ZY
�FAILZY
�OKB%0DY
�
Bt
:->"
"

+B
�Y
�DY
�
Bt
:{ZY
�FAILZY
�OKB%:Y
�DDY
�
Bs"Ao"AoZY
�"AoBP

+"
"
B
]Z
GZZ
�:Z
�,ZZ

�:Z

�
+"
B
�Z

xDZ
�`ZZ
�FAILZZ
�OKB%0DZ
�
Bt
:->"
"

+B
�Z
�DZ
�
Bt
:{ZZ
�FAILZZ
�OKB%:Z
�DDZ
�
Bs"Ao"AoZZ
�"AoBP

+"
"
B
][
GZ[
�:[
�,Z[

�:[

�
+"
B
�[

xD[
�`Z[
�FAILZ[
�OKB%0D[
�
Bt
:->"
"

+B
�[
�D[
�
Bt
:{Z[
�FAILZ[
�OKB%:[
�DD[
�
Bs"Ao"AoZ[
�"AoBP

+"
"
B
]\
GZ\
�:\
�,Z\

�:\

�
+"
B
�\

xD\
�`Z\
�FAILZ\
�OKB%0D\
�
Bt
:->"
"

+B
�\
�D\
�
Bt
:{Z\
�FAILZ\
�OKB%:\
�DD\
�
Bs"Ao"AoZ\
�"AoBP

+"
"
B
]]
GZ]
�:]
�,Z]

�:]

�
+"
B
�]

xD]
�`Z]
�FAILZ]
�OKB%0D]
�
Bt
:->"
"

+B
�]
�D]
�
Bt
:{Z]
�FAILZ]
�OKB%:]
�DD]
�
Bs"Ao"AoZ]
�"AoBP

+"
"
B
]^
GZ^
�:^
�,Z^

�:^

�
+"
B
�^

xD^
�`Z^
�FAILZ^
�OKB%0D^
�
Bt
:->"
"

+B
�^
�D^
�
Bt
:{Z^
�FAILZ^
�OKB%:^
�DD^
�
Bs"Ao"AoZ^
�"AoBP

+"
"
B
]_
GZ_
�:_
�,Z_

�:_

�
+"
B
�_

xD_
�`Z_
�FAILZ_
�OKB%0D_
�
Bt
:->"
"

+B
�_
�D_
�
Bt
:{Z_
�FAILZ_
�OKB%:_
�DD_
�
Bs"Ao"AoZ_
�"AoBP

+"
"
B
`


a


b


c


d


e


f


g


h


i


j


k


l


m


n


o


p


q


r


s


t


u


v


w


x


y


z


{


|


}


~





]`
GZ`
�:`
�,Z`

�:`

�
+"
B
�`

xD`
�`Z`
�FAILZ`
�OKB%0D`
�
Bt
:->"
"

+B
�`
�D`
�
Bt
:{Z`
�FAILZ`
�OKB%:`
�DD`
�
Bs"Ao"AoZ`
�"AoBP

+"
"
B
]a
GZa
�:a
�,Za

�:a

�
+"
B
�a

xDa
�`Za
�FAILZa
�OKB%0Da
�
Bt
:->"
"

+B
�a
�Da
�
Bt
:{Za
�FAILZa
�OKB%:a
�DDa
�
Bs"Ao"AoZa
�"AoBP

+"
"
B
]b
GZb
�:b
�,Zb

�:b

�
+"
B
�b

xDb
�`Zb
�FAILZb
�OKB%0Db
�
Bt
:->"
"

+B
�b
�Db
�
Bt
:{Zb
�FAILZb
�OKB%:b
�DDb
�
Bs"Ao"AoZb
�"AoBP

+"
"
B
]c
GZc
�:c
�,Zc

�:c

�
+"
B
�c

xDc
�`Zc
�FAILZc
�OKB%0Dc
�
Bt
:->"
"

+B
�c
�Dc
�
Bt
:{Zc
�FAILZc
�OKB%:c
�DDc
�
Bs"Ao"AoZc
�"AoBP

+"
"
B
]d
GZd
�:d
�,Zd

�:d

�
+"
B
�d

xDd
�`Zd
�FAILZd
�OKB%0Dd
�
Bt
:->"
"

+B
�d
�Dd
�
Bt
:{Zd
�FAILZd
�OKB%:d
�DDd
�
Bs"Ao"AoZd
�"AoBP

+"
"
B
]e
GZe
�:e
�,Ze

�:e

�
+"
B
�e

xDe
�`Ze
�FAILZe
�OKB%0De
�
Bt
:->"
"

+B
�e
�De
�
Bt
:{Ze
�FAILZe
�OKB%:e
�DDe
�
Bs"Ao"AoZe
�"AoBP

+"
"
B
]f
GZf
�:f
�,Zf

�:f

�
+"
B
�f

xDf
�`Zf
�FAILZf
�OKB%0Df
�
Bt
:->"
"

+B
�f
�Df
�
Bt
:{Zf
�FAILZf
�OKB%:f
�DDf
�
Bs"Ao"AoZf
�"AoBP

+"
"
B
]g
GZg
�:g
�,Zg

�:g

�
+"
B
�g

xDg
�`Zg
�FAILZg
�OKB%0Dg
�
Bt
:->"
"

+B
�g
�Dg
�
Bt
:{Zg
�FAILZg
�OKB%:g
�DDg
�
Bs"Ao"AoZg
�"AoBP

+"
"
B
]h
GZh
�:h
�,Zh

�:h

�
+"
B
�h

xDh
�`Zh
�FAILZh
�OKB%0Dh
�
Bt
:->"
"

+B
�h
�Dh
�
Bt
:{Zh
�FAILZh
�OKB%:h
�DDh
�
Bs"Ao"AoZh
�"AoBP

+"
"
B
]i
GZi
�:i
�,Zi

�:i

�
+"
B
�i

xDi
�`Zi
�FAILZi
�OKB%0Di
�
Bt
:->"
"

+B
�i
�Di
�
Bt
:{Zi
�FAILZi
�OKB%:i
�DDi
�
Bs"Ao"AoZi
�"AoBP

+"
"
B
]j
GZj
�:j
�,Zj

�:j

�
+"
B
�j

xDj
�`Zj
�FAILZj
�OKB%0Dj
�
Bt
:->"
"

+B
�j
�Dj
�
Bt
:{Zj
�FAILZj
�OKB%:j
�DDj
�
Bs"Ao"AoZj
�"AoBP

+"
"
B
]k
GZk
�:k
�,Zk

�:k

�
+"
B
�k

xDk
�`Zk
�FAILZk
�OKB%0Dk
�
Bt
:->"
"

+B
�k
�Dk
�
Bt
:{Zk
�FAILZk
�OKB%:k
�DDk
�
Bs"Ao"AoZk
�"AoBP

+"
"
B
]l
GZl
�:l
�,Zl

�:l

�
+"
B
�l

xDl
�`Zl
�FAILZl
�OKB%0Dl
�
Bt
:->"
"

+B
�l
�Dl
�
Bt
:{Zl
�FAILZl
�OKB%:l
�DDl
�
Bs"Ao"AoZl
�"AoBP

+"
"
B
]m
GZm
�:m
�,Zm

�:m

�
+"
B
�m

xDm
�`Zm
�FAILZm
�OKB%0Dm
�
Bt
:->"
"

+B
�m
�Dm
�
Bt
:{Zm
�FAILZm
�OKB%:m
�DDm
�
Bs"Ao"AoZm
�"AoBP

+"
"
B
]n
GZn
�:n
�,Zn

�:n

�
+"
B
�n

xDn
�`Zn
�FAILZn
�OKB%0Dn
�
Bt
:->"
"

+B
�n
�Dn
�
Bt
:{Zn
�FAILZn
�OKB%:n
�DDn
�
Bs"Ao"AoZn
�"AoBP

+"
"
B
]o
GZo
�:o
�,Zo

�:o

�
+"
B
�o

xDo
�`Zo
�FAILZo
�OKB%0Do
�
Bt
:->"
"

+B
�o
�Do
�
Bt
:{Zo
�FAILZo
�OKB%:o
�DDo
�
Bs"Ao"AoZo
�"AoBP

+"
"
B
]p
GZp
�:p
�,Zp

�:p

�
+"
B
�p

xDp
�`Zp
�FAILZp
�OKB%0Dp
�
Bt
:->"
"

+B
�p
�Dp
�
Bt
:{Zp
�FAILZp
�OKB%:p
�DDp
�
Bs"Ao"AoZp
�"AoBP

+"
"
B
]q
GZq
�:q
�,Zq

�:q

�
+"
B
�q

xDq
�`Zq
�FAILZq
�OKB%0Dq
�
Bt
:->"
"

+B
�q
�Dq
�
Bt
:{Zq
�FAILZq
�OKB%:q
�DDq
�
Bs"Ao"AoZq
�"AoBP

+"
"
B
]r
GZr
�:r
�,Zr

�:r

�
+"
B
�r

xDr
�`Zr
�FAILZr
�OKB%0Dr
�
Bt
:->"
"

+B
�r
�Dr
�
Bt
:{Zr
�FAILZr
�OKB%:r
�DDr
�
Bs"Ao"AoZr
�"AoBP

+"
"
B
]s
GZs
�:s
�,Zs

�:s

�
+"
B
�s

xDs
�`Zs
�FAILZs
�OKB%0Ds
�
Bt
:->"
"

+B
�s
�Ds
�
Bt
:{Zs
�FAILZs
�OKB%:s
�DDs
�
Bs"Ao"AoZs
�"AoBP

+"
"
B
]t
GZt
�:t
�,Zt

�:t

�
+"
B
�t

xDt
�`Zt
�FAILZt
�OKB%0Dt
�
Bt
:->"
"

+B
�t
�Dt
�
Bt
:{Zt
�FAILZt
�OKB%:t
�DDt
�
Bs"Ao"AoZt
�"AoBP

+"
"
B
]u
GZu
�:u
�,Zu

�:u

�
+"
B
�u

xDu
�`Zu
�FAILZu
�OKB%0Du
�
Bt
:->"
"

+B
�u
�Du
�
Bt
:{Zu
�FAILZu
�OKB%:u
�DDu
�
Bs"Ao"AoZu
�"AoBP

+"
"
B
]v
GZv
�:v
�,Zv

�:v

�
+"
B
�v

xDv
�`Zv
�FAILZv
�OKB%0Dv
�
Bt
:->"
"

+B
�v
�Dv
�
Bt
:{Zv
�FAILZv
�OKB%:v
�DDv
�
Bs"Ao"AoZv
�"AoBP

+"
"
B
]w
GZw
�:w
�,Zw

�:w

�
+"
B
�w

xDw
�`Zw
�FAILZw
�OKB%0Dw
�
Bt
:->"
"

+B
�w
�Dw
�
Bt
:{Zw
�FAILZw
�OKB%:w
�DDw
�
Bs"Ao"AoZw
�"AoBP

+"
"
B
]x
GZx
�:x
�,Zx

�:x

�
+"
B
�x

xDx
�`Zx
�FAILZx
�OKB%0Dx
�
Bt
:->"
"

+B
�x
�Dx
�
Bt
:{Zx
�FAILZx
�OKB%:x
�DDx
�
Bs"Ao"AoZx
�"AoBP

+"
"
B
]y
GZy
�:y
�,Zy

�:y

�
+"
B
�y

xDy
�`Zy
�FAILZy
�OKB%0Dy
�
Bt
:->"
"

+B
�y
�Dy
�
Bt
:{Zy
�FAILZy
�OKB%:y
�DDy
�
Bs"Ao"AoZy
�"AoBP

+"
"
B
]z
GZz
�:z
�,Zz

�:z

�
+"
B
�z

xDz
�`Zz
�FAILZz
�OKB%0Dz
�
Bt
:->"
"

+B
�z
�Dz
�
Bt
:{Zz
�FAILZz
�OKB%:z
�DDz
�
Bs"Ao"AoZz
�"AoBP

+"
"
B
]{
GZ{
�:{
�,Z{

�:{

�
+"
B
�{

xD{
�`Z{
�FAILZ{
�OKB%0D{
�
Bt
:->"
"

+B
�{
�D{
�
Bt
:{Z{
�FAILZ{
�OKB%:{
�DD{
�
Bs"Ao"AoZ{
�"AoBP

+"
"
B
]|
GZ|
�:|
�,Z|

�:|

�
+"
B
�|

xD|
�`Z|
�FAILZ|
�OKB%0D|
�
Bt
:->"
"

+B
�|
�D|
�
Bt
:{Z|
�FAILZ|
�OKB%:|
�DD|
�
Bs"Ao"AoZ|
�"AoBP

+"
"
B
]}
GZ}
�:}
�,Z}

�:}

�
+"
B
�}

xD}
�`Z}
�FAILZ}
�OKB%0D}
�
Bt
:->"
"

+B
�}
�D}
�
Bt
:{Z}
�FAILZ}
�OKB%:}
�DD}
�
Bs"Ao"AoZ}
�"AoBP

+"
"
B
]~
GZ~
�:~
�,Z~

�:~

�
+"
B
�~

xD~
�`Z~
�FAILZ~
�OKB%0D~
�
Bt
:->"
"

+B
�~
�D~
�
Bt
:{Z~
�FAILZ~
�OKB%:~
�DD~
�
Bs"Ao"AoZ~
�"AoBP

+"
"
B
]
GZ
�:
�,Z

�:

�
+"
B
�

xD
�`Z
�FAILZ
�OKB%0D
�
Bt
:->"
"

+B
�
�D
�
Bt
:{Z
�FAILZ
�OKB%:
�DD
�
Bs"Ao"AoZ
�"AoBP

+"
"
B
�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


�


]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
]�
GZ�
�:�
�,Z�

�:�

�
+"
B
��

xD�
�`Z�
�FAILZ�
�OKB%0D�
�
Bt
:->"
"

+B
��
�D�
�
Bt
:{Z�
�FAILZ�
�OKB%:�
�DD�
�
Bs"Ao"AoZ�
�"AoBP

+"
"
B
�P�H �
�0�(
	�
+�>�@
+
gg
����
+
������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������������
��
+�����FMicrosoft Excel 97-TabelleBiff8
��

�����Oh��+'��0�
@H	X
+dp|
���rca 18@���@���
@����
@��9)s�
��
��՜.��+,��D��՜.��+,��\

��

��Root Entry��������
�F�
@Workbook������
CompObj��������I
Ole
+������������SummaryInformation(���������DocumentSummaryInformation8������������t��������������������������������
\ No newline at end of file

Property changes on: lucene/queryparser/grammars/StandardLuceneGrammar.xls
___________________________________________________________________
Added: svn:mime-type
   + application/octet-stream

Index: lucene/queryparser/grammars/StandardLuceneGrammar.gunit
===================================================================
--- lucene/queryparser/grammars/StandardLuceneGrammar.gunit	(revision 0)
+++ lucene/queryparser/grammars/StandardLuceneGrammar.gunit	(revision 0)
@@ -0,0 +1,503 @@
+gunit StandardLuceneGrammar;        
+@header {       
+package org.apache.lucene.queryparser.flexible.aqp.parser;        
+}       
+        
+        
+mainQ:        
+"title:\"X x\" AND text:go title:\"x y\" AND A"   ->  "(DEFOP (AND (MODIFIER (TMODIFIER (FIELD title (QPHRASE \"X x\")))) (MODIFIER (TMODIFIER (FIELD text (QNORMAL go))))) (AND (MODIFIER (TMODIFIER (FIELD title (QPHRASE \"x y\")))) (MODIFIER (TMODIFIER (FIELD (QNORMAL A))))))"   
+"title:X Y Z"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD title (QNORMAL X)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL Y)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL Z)))))"    
+"jakarta^4 apache"  ->  "(DEFOP (MODIFIER (TMODIFIER (BOOST ^4) FUZZY (FIELD (QNORMAL jakarta)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL apache)))))"   
+"\"jakarta apache\"^4 \"Apache Lucene\""  ->  "(DEFOP (MODIFIER (TMODIFIER (BOOST ^4) FUZZY (FIELD (QPHRASE \"jakarta apache\")))) (MODIFIER (TMODIFIER (FIELD (QPHRASE \"Apache Lucene\")))))"   
+"\"jakarta apache\" OR jakarta"   ->  "(DEFOP (OR (MODIFIER (TMODIFIER (FIELD (QPHRASE \"jakarta apache\")))) (MODIFIER (TMODIFIER (FIELD (QNORMAL jakarta))))))"   
+"\"jakarta apache\" AND \"Apache Lucene\""  ->  "(DEFOP (AND (MODIFIER (TMODIFIER (FIELD (QPHRASE \"jakarta apache\")))) (MODIFIER (TMODIFIER (FIELD (QPHRASE \"Apache Lucene\"))))))"    
+"+jakarta lucene"   ->  "(DEFOP (MODIFIER + (TMODIFIER (FIELD (QNORMAL jakarta)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL lucene)))))"    
+"\"jakarta apache\" NOT \"Apache Lucene\""  ->  "(DEFOP (NOT (MODIFIER (TMODIFIER (FIELD (QPHRASE \"jakarta apache\")))) (MODIFIER (TMODIFIER (FIELD (QPHRASE \"Apache Lucene\"))))))"    
+"(jakarta OR apache) AND website"   ->  "(DEFOP (AND (OR (MODIFIER (TMODIFIER (FIELD (QNORMAL jakarta)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL apache))))) (MODIFIER (TMODIFIER (FIELD (QNORMAL website))))))"    
+"this (that)"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))"   
+"this ((that))"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))"   
+"(this) ((((((that))))))"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))"   
+"(this) (that)"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))"   
+"this +(that)"  ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))"   
+"this ((((+(that)))))"  ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))"   
+"this (+(((+(that)))))"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))))))"   
+"this +((((+(that)))))"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))))))"   
+"this +(+((((that)))))"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))))))"   
+"this (+(that)^7)"  ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (BOOST ^7) FUZZY (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))"    
+"this (+(((+(that))))"    FAIL    
+"this (++(((+(that)))))"    FAIL    
+"this +(that thus)^7"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (BOOST ^7) FUZZY (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL thus)))))))))"    
+"this (+(((+(that))))"    FAIL    
+"this (++(((+(that)))))"    FAIL    
+        
+        
+        
+        
+        
+        
+        
+atom:       
+"te?t"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te?t))))"    
+"test*"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED test*))))"   
+"te*t"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te*t))))"    
+"te*t"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te*t))))"    
+"*te*t"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *te*t))))"   
+"*te*t*"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *te*t*))))"    
+"?te*t?"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?te*t?))))"    
+"te?t"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te?t))))"    
+"te??t"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te??t))))"   
+"te*?t"   OK    
+"\"text\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"text\"))))"   
+"\"te*t\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te*t\"))))"    
+"\"test*\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"test*\"))))"   
+"\"te*t\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te*t\"))))"    
+"\"te*t\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te*t\"))))"    
+"\"*te*t\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"*te*t\"))))"   
+"\"*te*t*\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"*te*t*\"))))"    
+"\"?te*t?\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"?te*t?\"))))"    
+"\"te?t\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te?t\"))))"    
+"\"te??t\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te??t\"))))"   
+"\"te*?t\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te*?t\"))))"   
+"roam~"   ->  "(MODIFIER (TMODIFIER BOOST (FUZZY ~) (FIELD (QNORMAL roam))))"   
+"roam~0.8"  ->  "(MODIFIER (TMODIFIER BOOST (FUZZY ~0.8) (FIELD (QNORMAL roam))))"    
+"roam~0.899999999"  ->  "(MODIFIER (TMODIFIER BOOST (FUZZY ~0.899999999) (FIELD (QNORMAL roam))))"    
+"roam~8"  ->  "(MODIFIER (TMODIFIER BOOST (FUZZY ~8) (FIELD (QNORMAL roam))))"    
+"roam^"   ->  "(MODIFIER (TMODIFIER (BOOST ^) FUZZY (FIELD (QNORMAL roam))))"   
+"roam^0.8"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.8) FUZZY (FIELD (QNORMAL roam))))"    
+"roam^0.899999999"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.899999999) FUZZY (FIELD (QNORMAL roam))))"    
+"roam^8"  ->  "(MODIFIER (TMODIFIER (BOOST ^8) FUZZY (FIELD (QNORMAL roam))))"    
+"roam^~"  ->  "(MODIFIER (TMODIFIER (BOOST ^) (FUZZY ~) (FIELD (QNORMAL roam))))"   
+"roam^0.8~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.8) (FUZZY ~) (FIELD (QNORMAL roam))))"    
+"roam^0.899999999~0.5"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.899999999) (FUZZY ~0.5) (FIELD (QNORMAL roam))))"   
+"roam~^"  ->  "(MODIFIER (TMODIFIER (BOOST ^) (FUZZY ~) (FIELD (QNORMAL roam))))"   
+"roam~0.8^"   ->  "(MODIFIER (TMODIFIER (BOOST ^) (FUZZY ~0.8) (FIELD (QNORMAL roam))))"    
+"roam~0.899999999^0.5"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~0.899999999) (FIELD (QNORMAL roam))))"   
+"this^ 5"   ->  "(MODIFIER (TMODIFIER (BOOST ^) FUZZY (FIELD (QNORMAL this))))"   
+"this^5~ 9"   ->  "(MODIFIER (TMODIFIER (BOOST ^5) (FUZZY ~) (FIELD (QNORMAL this))))"    
+"9999"  ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL 9999))))"   
+"9999.1"  ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL 9999.1))))"   
+"0.9999"  ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL 0.9999))))"   
+"00000000.9999"   ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL 00000000.9999))))"    
+"\"jakarta apache\"~10"   ->  "(MODIFIER (TMODIFIER BOOST (FUZZY ~10) (FIELD (QPHRASE \"jakarta apache\"))))"   
+"\"jakarta apache\"^10"   ->  "(MODIFIER (TMODIFIER (BOOST ^10) FUZZY (FIELD (QPHRASE \"jakarta apache\"))))"   
+"\"jakarta apache\"~10^"  ->  "(MODIFIER (TMODIFIER (BOOST ^) (FUZZY ~10) (FIELD (QPHRASE \"jakarta apache\"))))"   
+"\"jakarta apache\"^10~"  ->  "(MODIFIER (TMODIFIER (BOOST ^10) (FUZZY ~) (FIELD (QPHRASE \"jakarta apache\"))))"   
+"\"jakarta apache\"~10^0.6"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.6) (FUZZY ~10) (FIELD (QPHRASE \"jakarta apache\"))))"    
+"\"jakarta apache\"^10~0.6"   ->  "(MODIFIER (TMODIFIER (BOOST ^10) (FUZZY ~0.6) (FIELD (QPHRASE \"jakarta apache\"))))"    
+"[20020101 TO 20030101]"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"   
+"[20020101 TO 20030101]^0.5"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"[20020101 TO 20030101]^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"[20020101 TO 20030101]^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:[20020101 TO 20030101]"  ->  "(MODIFIER (TMODIFIER (FIELD title (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"   
+"title:[20020101 TO 20030101]^0.5"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD title (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:[20020101 TO 20030101]^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD title (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:[20020101 TO 20030101]^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD title (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"[* TO 20030101]"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QANYTHING *) (QNORMAL 20030101)))))"    
+"[20020101 TO *]^0.5"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD (QRANGEIN (QNORMAL 20020101) (QANYTHING *)))))"   
+"[* 20030101]^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEIN (QANYTHING *) (QNORMAL 20030101)))))"   
+"[20020101 *]^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEIN (QNORMAL 20020101) (QANYTHING *)))))"   
+"{20020101 TO 20030101}"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"   
+"{20020101 TO 20030101}^0.5"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"{20020101 TO 20030101}^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"{20020101 TO 20030101}^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:{20020101 TO 20030101}"  ->  "(MODIFIER (TMODIFIER (FIELD title (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"   
+"title:{20020101 TO 20030101}^0.5"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD title (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:{20020101 TO 20030101}^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD title (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:{20020101 TO 20030101}^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD title (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:{Aida TO Carmen}"  ->  "(MODIFIER (TMODIFIER (FIELD title (QRANGEEX (QNORMAL Aida) (QNORMAL Carmen)))))"   
+"{20020101 TO *}"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL 20020101) (QANYTHING *)))))"    
+"{* TO 20030101}^0.5"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD (QRANGEEX (QANYTHING *) (QNORMAL 20030101)))))"   
+"{20020101 *}^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEEX (QNORMAL 20020101) (QANYTHING *)))))"   
+"{* 20030101}^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEEX (QANYTHING *) (QNORMAL 20030101)))))"   
+"[this TO that]"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL this) (QNORMAL that)))))"   
+"[this that]"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL this) (QNORMAL that)))))"   
+"[this TO *]"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL this) (QANYTHING *)))))"    
+"[this]"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL this) (QANYTHING *)))))"    
+"[* this]"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QANYTHING *) (QNORMAL this)))))"    
+"[* TO this]"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QANYTHING *) (QNORMAL this)))))"    
+"[\"this\" TO \"that*\"]"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QPHRASE \"this\") (QPHRASETRUNC \"that*\")))))"   
+"[\"#$%^&\" TO \"&*()\"]"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QPHRASE \"#$%^&\") (QPHRASETRUNC \"&*()\")))))"   
+"{this TO that}"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL this) (QNORMAL that)))))"   
+"{this that}"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL this) (QNORMAL that)))))"   
+"{this TO *}"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL this) (QANYTHING *)))))"    
+"{* this}"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QANYTHING *) (QNORMAL this)))))"    
+"{* TO this}"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QANYTHING *) (QNORMAL this)))))"    
+"{\"this\" TO \"that*\"}"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QPHRASE \"this\") (QPHRASETRUNC \"that*\")))))"   
+"{\"#$%^&\" TO \"&*()\"}"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QPHRASE \"#$%^&\") (QPHRASETRUNC \"&*()\")))))"   
+"{}"    FAIL    
+"[]"    FAIL    
+"\(1\+1\)\:2"   ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL \\(1\\+1\\)\\:2))))"    
+"escape:(\+\-\&\&\|\|\!\(\)\{\}\[\]\^\"\~\*\?\:\\)"   FAIL    
+"\"jakarta apache\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"jakarta apache\"))))"   
+"title:(+return +\"pink panther\")"   ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD title (DEFOP (MODIFIER + (TMODIFIER (FIELD (QNORMAL return)))) (MODIFIER + (TMODIFIER (FIELD (QPHRASE \"pink panther\")))))))))"   
+"field:(one two three)"   ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL two)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL three)))))))))"    
+"field:(one +two -three)" ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))) (MODIFIER + (TMODIFIER (FIELD (QNORMAL two)))) (MODIFIER - (TMODIFIER (FIELD (QNORMAL three)))))))))"    
+"+field:(-one +two three)"  ->  "(CLAUSE (MODIFIER + (TMODIFIER (FIELD field (DEFOP (MODIFIER - (TMODIFIER (FIELD (QNORMAL one)))) (MODIFIER + (TMODIFIER (FIELD (QNORMAL two)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL three)))))))))"    
+"-field:(-one +two three)"  ->  "(CLAUSE (MODIFIER - (TMODIFIER (FIELD field (DEFOP (MODIFIER - (TMODIFIER (FIELD (QNORMAL one)))) (MODIFIER + (TMODIFIER (FIELD (QNORMAL two)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL three)))))))))"    
+"field:(one)"   ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))))))))"    
+"field: (one)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))))))))"    
+"field:( one )"   ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))))))))"    
+"+value"  ->  "(MODIFIER + (TMODIFIER (FIELD (QNORMAL value))))"    
+"-value"  ->  "(MODIFIER - (TMODIFIER (FIELD (QNORMAL value))))"    
+"+field:"   FAIL    
+"+field:[this TO that]"   ->  "(MODIFIER + (TMODIFIER (FIELD field (QRANGEIN (QNORMAL this) (QNORMAL that)))))"   
+"+field:[   this TO that   ]"   ->  "(MODIFIER + (TMODIFIER (FIELD field (QRANGEIN (QNORMAL this) (QNORMAL that)))))"   
+"+field:{this TO that}"   ->  "(MODIFIER + (TMODIFIER (FIELD field (QRANGEEX (QNORMAL this) (QNORMAL that)))))"   
+"+field: {this TO that}"  ->  "(MODIFIER + (TMODIFIER (FIELD field (QRANGEEX (QNORMAL this) (QNORMAL that)))))"   
+"m:(a b c)"   ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))"    
+"+m:(a b c)"  ->  "(CLAUSE (MODIFIER + (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))"    
+"m:(+a b c)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER + (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))"    
+"m:(-a +b c)^0.6" ->  "(CLAUSE (MODIFIER (TMODIFIER (BOOST ^0.6) FUZZY (FIELD m (DEFOP (MODIFIER - (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER + (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))"   
+"m:(a b c or d)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (OR (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL d))))))))))"    
+"m:(a b c OR d)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (OR (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL d))))))))))"    
+"m:(a b c OR d NOT e)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (OR (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))) (NOT (MODIFIER (TMODIFIER (FIELD (QNORMAL d)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL e)))))))))))"   
+"m:(a b NEAR c)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL NEAR)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))"    
+"m:(a b NEAR c d AND e)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL NEAR)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))) (AND (MODIFIER (TMODIFIER (FIELD (QNORMAL d)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL e))))))))))"    
+"-m:(a b NEAR c d AND e)" ->  "(CLAUSE (MODIFIER - (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL NEAR)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))) (AND (MODIFIER (TMODIFIER (FIELD (QNORMAL d)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL e))))))))))"    
+"*"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *))))"   
+"*:*"   ->  "(MODIFIER (TMODIFIER (FIELD (QANYTHING *))))"    
+"this"  ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL this))))"   
+"th\*is"  ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL th\\*is))))"    
+"this999"   ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL this999))))"    
+"this0.9"   ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL this0.9))))"    
+"\"this\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"this\"))))"   
+"\"this  \""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"this  \"))))"   
+"\"this  \"   "   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"this  \"))))"   
+"\"  this  \""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"  this  \"))))"   
+"\"a \\\"b c\\\" d\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"a \\\"b c\\\" d\"))))"    
+"a\\\\\\+b"   ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL a\\\\\\+b))))"    
+"\"a \\\"b c\\\" d\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"a \\\"b c\\\" d\"))))"    
+"\"a \\\"b c\\\" d\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"a \\\"b c\\\" d\"))))"    
+"\"a \\+b c d\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"a \\+b c d\"))))"   
+"a\\u0062c"   ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL a\\u0062c))))"    
+"\"+() AND that\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"+() AND that\"))))"   
+"\"func(*) AND that\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"func(*) AND that\"))))"    
+"\"+() AND that\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"+() AND that\"))))"   
+"\"func(*) AND that\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"func(*) AND that\"))))"    
+"*t"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t))))"    
+"*t*"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*))))"   
+"*t?"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t?))))"   
+"?t?"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?t?))))"   
+"?t*"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?t*))))"   
+"?t"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?t))))"    
+"*t*a"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*a))))"    
+"*t?a"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t?a))))"    
+"*t*a*"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*a*))))"   
+"t*a"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED t*a))))"   
+"t*a?"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED t*a?))))"    
+"t*a?a"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED t*a?a))))"   
+"?"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?))))"   
+"*t\\*a"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t\\*a))))"    
+"\\*t"  ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL \\*t))))"   
+"*t*a\\*"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*a\\*))))"   
+"*t*a\\?"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*a\\?))))"   
+"*t*\\a"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*\\a))))"    
+"foo:*"   ->  "(MODIFIER (TMODIFIER (FIELD foo (QTRUNCATED *))))"   
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
Index: lucene/queryparser/grammars/ExtendedLuceneGrammar.gunit
===================================================================
--- lucene/queryparser/grammars/ExtendedLuceneGrammar.gunit	(revision 0)
+++ lucene/queryparser/grammars/ExtendedLuceneGrammar.gunit	(revision 0)
@@ -0,0 +1,506 @@
+gunit ExtendedLuceneGrammar;        
+@header {       
+package org.apache.lucene.queryparser.flexible.aqp.parser;        
+}       
+        
+        
+mainQ:        
+"title:\"X x\" AND text:go title:\"x y\" AND A"   ->  "(DEFOP (AND (MODIFIER (TMODIFIER (FIELD title (QPHRASE \"X x\")))) (MODIFIER (TMODIFIER (FIELD text (QNORMAL go))))) (AND (MODIFIER (TMODIFIER (FIELD title (QPHRASE \"x y\")))) (MODIFIER (TMODIFIER (FIELD (QNORMAL A))))))"   
+"title:X Y Z"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD title (QNORMAL X)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL Y)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL Z)))))"    
+"jakarta^4 apache"  ->  "(DEFOP (MODIFIER (TMODIFIER (BOOST ^4) FUZZY (FIELD (QNORMAL jakarta)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL apache)))))"   
+"\"jakarta apache\"^4 \"Apache Lucene\""  ->  "(DEFOP (MODIFIER (TMODIFIER (BOOST ^4) FUZZY (FIELD (QPHRASE \"jakarta apache\")))) (MODIFIER (TMODIFIER (FIELD (QPHRASE \"Apache Lucene\")))))"   
+"\"jakarta apache\" OR jakarta"   ->  "(DEFOP (OR (MODIFIER (TMODIFIER (FIELD (QPHRASE \"jakarta apache\")))) (MODIFIER (TMODIFIER (FIELD (QNORMAL jakarta))))))"   
+"\"jakarta apache\" AND \"Apache Lucene\""  ->  "(DEFOP (AND (MODIFIER (TMODIFIER (FIELD (QPHRASE \"jakarta apache\")))) (MODIFIER (TMODIFIER (FIELD (QPHRASE \"Apache Lucene\"))))))"    
+"+jakarta lucene"   ->  "(DEFOP (MODIFIER + (TMODIFIER (FIELD (QNORMAL jakarta)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL lucene)))))"    
+"\"jakarta apache\" NOT \"Apache Lucene\""  ->  "(DEFOP (NOT (MODIFIER (TMODIFIER (FIELD (QPHRASE \"jakarta apache\")))) (MODIFIER (TMODIFIER (FIELD (QPHRASE \"Apache Lucene\"))))))"    
+"(jakarta OR apache) AND website"   ->  "(DEFOP (AND (OR (MODIFIER (TMODIFIER (FIELD (QNORMAL jakarta)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL apache))))) (MODIFIER (TMODIFIER (FIELD (QNORMAL website))))))"    
+"this (that)"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))"   
+"this ((that))"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))"   
+"(this) ((((((that))))))"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))"   
+"(this) (that)"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))"   
+"this +(that)"  ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))"   
+"this ((((+(that)))))"  ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))"   
+"this (+(((+(that)))))"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))))))"   
+"this +((((+(that)))))"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))))))"   
+"this +(+((((that)))))"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (CLAUSE (MODIFIER + (TMODIFIER (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))))))"   
+"this (+(that)^7)"  ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (BOOST ^7) FUZZY (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))))))))"    
+"this (+(((+(that))))"    FAIL    
+"this (++(((+(that)))))"    FAIL    
+"this +(that thus)^7"   ->  "(DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (CLAUSE (MODIFIER + (TMODIFIER (BOOST ^7) FUZZY (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL thus)))))))))"    
+"this (+(((+(that))))"    FAIL    
+"this (++(((+(that)))))"    FAIL    
+"this NEAR that"  -> "(DEFOP (NEAR (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL that))))))"
+"this NEAR5 that"  -> "(DEFOP (NEAR5 (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL that))))))"
+"this NEAR (that OR bar)"  -> "(DEFOP (NEAR (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (OR (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL bar)))))))"
+"(this foo) NEAR (that bar)"  -> "(DEFOP (NEAR (MODIFIER (TMODIFIER (FIELD (QNORMAL this)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL foo)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL that)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL bar))))))"        
+        
+        
+        
+        
+        
+        
+atom:       
+"te?t"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te?t))))"    
+"test*"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED test*))))"   
+"te*t"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te*t))))"    
+"te*t"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te*t))))"    
+"*te*t"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *te*t))))"   
+"*te*t*"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *te*t*))))"    
+"?te*t?"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?te*t?))))"    
+"te?t"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te?t))))"    
+"te??t"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED te??t))))"   
+"te*?t"   OK    
+"\"text\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"text\"))))"   
+"\"te*t\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te*t\"))))"    
+"\"test*\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"test*\"))))"   
+"\"te*t\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te*t\"))))"    
+"\"te*t\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te*t\"))))"    
+"\"*te*t\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"*te*t\"))))"   
+"\"*te*t*\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"*te*t*\"))))"    
+"\"?te*t?\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"?te*t?\"))))"    
+"\"te?t\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te?t\"))))"    
+"\"te??t\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te??t\"))))"   
+"\"te*?t\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"te*?t\"))))"   
+"roam~"   ->  "(MODIFIER (TMODIFIER BOOST (FUZZY ~) (FIELD (QNORMAL roam))))"   
+"roam~0.8"  ->  "(MODIFIER (TMODIFIER BOOST (FUZZY ~0.8) (FIELD (QNORMAL roam))))"    
+"roam~0.899999999"  ->  "(MODIFIER (TMODIFIER BOOST (FUZZY ~0.899999999) (FIELD (QNORMAL roam))))"    
+"roam~8"  ->  "(MODIFIER (TMODIFIER BOOST (FUZZY ~8) (FIELD (QNORMAL roam))))"    
+"roam^"   ->  "(MODIFIER (TMODIFIER (BOOST ^) FUZZY (FIELD (QNORMAL roam))))"   
+"roam^0.8"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.8) FUZZY (FIELD (QNORMAL roam))))"    
+"roam^0.899999999"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.899999999) FUZZY (FIELD (QNORMAL roam))))"    
+"roam^8"  ->  "(MODIFIER (TMODIFIER (BOOST ^8) FUZZY (FIELD (QNORMAL roam))))"    
+"roam^~"  ->  "(MODIFIER (TMODIFIER (BOOST ^) (FUZZY ~) (FIELD (QNORMAL roam))))"   
+"roam^0.8~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.8) (FUZZY ~) (FIELD (QNORMAL roam))))"    
+"roam^0.899999999~0.5"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.899999999) (FUZZY ~0.5) (FIELD (QNORMAL roam))))"   
+"roam~^"  ->  "(MODIFIER (TMODIFIER (BOOST ^) (FUZZY ~) (FIELD (QNORMAL roam))))"   
+"roam~0.8^"   ->  "(MODIFIER (TMODIFIER (BOOST ^) (FUZZY ~0.8) (FIELD (QNORMAL roam))))"    
+"roam~0.899999999^0.5"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~0.899999999) (FIELD (QNORMAL roam))))"   
+"this^ 5"   ->  "(MODIFIER (TMODIFIER (BOOST ^) FUZZY (FIELD (QNORMAL this))))"   
+"this^5~ 9"   ->  "(MODIFIER (TMODIFIER (BOOST ^5) (FUZZY ~) (FIELD (QNORMAL this))))"    
+"9999"  ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL 9999))))"   
+"9999.1"  ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL 9999.1))))"   
+"0.9999"  ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL 0.9999))))"   
+"00000000.9999"   ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL 00000000.9999))))"    
+"\"jakarta apache\"~10"   ->  "(MODIFIER (TMODIFIER BOOST (FUZZY ~10) (FIELD (QPHRASE \"jakarta apache\"))))"   
+"\"jakarta apache\"^10"   ->  "(MODIFIER (TMODIFIER (BOOST ^10) FUZZY (FIELD (QPHRASE \"jakarta apache\"))))"   
+"\"jakarta apache\"~10^"  ->  "(MODIFIER (TMODIFIER (BOOST ^) (FUZZY ~10) (FIELD (QPHRASE \"jakarta apache\"))))"   
+"\"jakarta apache\"^10~"  ->  "(MODIFIER (TMODIFIER (BOOST ^10) (FUZZY ~) (FIELD (QPHRASE \"jakarta apache\"))))"   
+"\"jakarta apache\"~10^0.6"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.6) (FUZZY ~10) (FIELD (QPHRASE \"jakarta apache\"))))"    
+"\"jakarta apache\"^10~0.6"   ->  "(MODIFIER (TMODIFIER (BOOST ^10) (FUZZY ~0.6) (FIELD (QPHRASE \"jakarta apache\"))))"    
+"[20020101 TO 20030101]"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"   
+"[20020101 TO 20030101]^0.5"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"[20020101 TO 20030101]^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"[20020101 TO 20030101]^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:[20020101 TO 20030101]"  ->  "(MODIFIER (TMODIFIER (FIELD title (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"   
+"title:[20020101 TO 20030101]^0.5"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD title (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:[20020101 TO 20030101]^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD title (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:[20020101 TO 20030101]^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD title (QRANGEIN (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"[* TO 20030101]"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QANYTHING *) (QNORMAL 20030101)))))"    
+"[20020101 TO *]^0.5"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD (QRANGEIN (QNORMAL 20020101) (QANYTHING *)))))"   
+"[* 20030101]^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEIN (QANYTHING *) (QNORMAL 20030101)))))"   
+"[20020101 *]^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEIN (QNORMAL 20020101) (QANYTHING *)))))"   
+"{20020101 TO 20030101}"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"   
+"{20020101 TO 20030101}^0.5"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"{20020101 TO 20030101}^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"{20020101 TO 20030101}^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:{20020101 TO 20030101}"  ->  "(MODIFIER (TMODIFIER (FIELD title (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"   
+"title:{20020101 TO 20030101}^0.5"  ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD title (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:{20020101 TO 20030101}^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD title (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:{20020101 TO 20030101}^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD title (QRANGEEX (QNORMAL 20020101) (QNORMAL 20030101)))))"    
+"title:{Aida TO Carmen}"  ->  "(MODIFIER (TMODIFIER (FIELD title (QRANGEEX (QNORMAL Aida) (QNORMAL Carmen)))))"   
+"{20020101 TO *}"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL 20020101) (QANYTHING *)))))"    
+"{* TO 20030101}^0.5"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) FUZZY (FIELD (QRANGEEX (QANYTHING *) (QNORMAL 20030101)))))"   
+"{20020101 *}^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEEX (QNORMAL 20020101) (QANYTHING *)))))"   
+"{* 20030101}^0.5~"   ->  "(MODIFIER (TMODIFIER (BOOST ^0.5) (FUZZY ~) (FIELD (QRANGEEX (QANYTHING *) (QNORMAL 20030101)))))"   
+"[this TO that]"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL this) (QNORMAL that)))))"   
+"[this that]"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL this) (QNORMAL that)))))"   
+"[this TO *]"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL this) (QANYTHING *)))))"    
+"[this]"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QNORMAL this) (QANYTHING *)))))"    
+"[* this]"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QANYTHING *) (QNORMAL this)))))"    
+"[* TO this]"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QANYTHING *) (QNORMAL this)))))"    
+"[\"this\" TO \"that*\"]"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QPHRASE \"this\") (QPHRASETRUNC \"that*\")))))"   
+"[\"#$%^&\" TO \"&*()\"]"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEIN (QPHRASE \"#$%^&\") (QPHRASETRUNC \"&*()\")))))"   
+"{this TO that}"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL this) (QNORMAL that)))))"   
+"{this that}"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL this) (QNORMAL that)))))"   
+"{this TO *}"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QNORMAL this) (QANYTHING *)))))"    
+"{* this}"  ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QANYTHING *) (QNORMAL this)))))"    
+"{* TO this}"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QANYTHING *) (QNORMAL this)))))"    
+"{\"this\" TO \"that*\"}"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QPHRASE \"this\") (QPHRASETRUNC \"that*\")))))"   
+"{\"#$%^&\" TO \"&*()\"}"   ->  "(MODIFIER (TMODIFIER (FIELD (QRANGEEX (QPHRASE \"#$%^&\") (QPHRASETRUNC \"&*()\")))))"   
+"{}"    FAIL    
+"[]"    FAIL    
+"\(1\+1\)\:2"   ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL \\(1\\+1\\)\\:2))))"    
+"escape:(\+\-\&\&\|\|\!\(\)\{\}\[\]\^\"\~\*\?\:\\)"   FAIL    
+"\"jakarta apache\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"jakarta apache\"))))"   
+"title:(+return +\"pink panther\")"   ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD title (DEFOP (MODIFIER + (TMODIFIER (FIELD (QNORMAL return)))) (MODIFIER + (TMODIFIER (FIELD (QPHRASE \"pink panther\")))))))))"   
+"field:(one two three)"   ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL two)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL three)))))))))"    
+"field:(one +two -three)" ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))) (MODIFIER + (TMODIFIER (FIELD (QNORMAL two)))) (MODIFIER - (TMODIFIER (FIELD (QNORMAL three)))))))))"    
+"+field:(-one +two three)"  ->  "(CLAUSE (MODIFIER + (TMODIFIER (FIELD field (DEFOP (MODIFIER - (TMODIFIER (FIELD (QNORMAL one)))) (MODIFIER + (TMODIFIER (FIELD (QNORMAL two)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL three)))))))))"    
+"-field:(-one +two three)"  ->  "(CLAUSE (MODIFIER - (TMODIFIER (FIELD field (DEFOP (MODIFIER - (TMODIFIER (FIELD (QNORMAL one)))) (MODIFIER + (TMODIFIER (FIELD (QNORMAL two)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL three)))))))))"    
+"field:(one)"   ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))))))))"    
+"field: (one)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))))))))"    
+"field:( one )"   ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD field (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL one)))))))))"    
+"+value"  ->  "(MODIFIER + (TMODIFIER (FIELD (QNORMAL value))))"    
+"-value"  ->  "(MODIFIER - (TMODIFIER (FIELD (QNORMAL value))))"    
+"+field:"   FAIL    
+"+field:[this TO that]"   ->  "(MODIFIER + (TMODIFIER (FIELD field (QRANGEIN (QNORMAL this) (QNORMAL that)))))"   
+"+field:[   this TO that   ]"   ->  "(MODIFIER + (TMODIFIER (FIELD field (QRANGEIN (QNORMAL this) (QNORMAL that)))))"   
+"+field:{this TO that}"   ->  "(MODIFIER + (TMODIFIER (FIELD field (QRANGEEX (QNORMAL this) (QNORMAL that)))))"   
+"+field: {this TO that}"  ->  "(MODIFIER + (TMODIFIER (FIELD field (QRANGEEX (QNORMAL this) (QNORMAL that)))))"   
+"m:(a b c)"   ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))"    
+"+m:(a b c)"  ->  "(CLAUSE (MODIFIER + (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))"    
+"m:(+a b c)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER + (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))"    
+"m:(-a +b c)^0.6" ->  "(CLAUSE (MODIFIER (TMODIFIER (BOOST ^0.6) FUZZY (FIELD m (DEFOP (MODIFIER - (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER + (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))))))))"   
+"m:(a b c or d)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (OR (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL d))))))))))"    
+"m:(a b c OR d)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (OR (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL d))))))))))"    
+"m:(a b c OR d NOT e)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (OR (MODIFIER (TMODIFIER (FIELD (QNORMAL c)))) (NOT (MODIFIER (TMODIFIER (FIELD (QNORMAL d)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL e)))))))))))"   
+"m:(a b NEAR c)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (NEAR (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c))))))))))"   
+"m:(a b NEAR c d AND e)"  ->  "(CLAUSE (MODIFIER (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (NEAR (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c))))) (AND (MODIFIER (TMODIFIER (FIELD (QNORMAL d)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL e))))))))))"   
+"-m:(a b NEAR c d AND e)" ->  "(CLAUSE (MODIFIER - (TMODIFIER (FIELD m (DEFOP (MODIFIER (TMODIFIER (FIELD (QNORMAL a)))) (NEAR (MODIFIER (TMODIFIER (FIELD (QNORMAL b)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL c))))) (AND (MODIFIER (TMODIFIER (FIELD (QNORMAL d)))) (MODIFIER (TMODIFIER (FIELD (QNORMAL e))))))))))"   
+"*"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *))))"   
+"*:*"   ->  "(MODIFIER (TMODIFIER (FIELD (QANYTHING *))))"    
+"this"  ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL this))))"   
+"th\*is"  ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL th\\*is))))"    
+"this999"   ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL this999))))"    
+"this0.9"   ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL this0.9))))"    
+"\"this\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"this\"))))"   
+"\"this  \""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"this  \"))))"   
+"\"this  \"   "   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"this  \"))))"   
+"\"  this  \""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"  this  \"))))"   
+"\"a \\\"b c\\\" d\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"a \\\"b c\\\" d\"))))"    
+"a\\\\\\+b"   ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL a\\\\\\+b))))"    
+"\"a \\\"b c\\\" d\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"a \\\"b c\\\" d\"))))"    
+"\"a \\\"b c\\\" d\""   ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"a \\\"b c\\\" d\"))))"    
+"\"a \\+b c d\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"a \\+b c d\"))))"   
+"a\\u0062c"   ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL a\\u0062c))))"    
+"\"+() AND that\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"+() AND that\"))))"   
+"\"func(*) AND that\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"func(*) AND that\"))))"    
+"\"+() AND that\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASE \"+() AND that\"))))"   
+"\"func(*) AND that\""  ->  "(MODIFIER (TMODIFIER (FIELD (QPHRASETRUNC \"func(*) AND that\"))))"    
+"*t"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t))))"    
+"*t*"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*))))"   
+"*t?"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t?))))"   
+"?t?"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?t?))))"   
+"?t*"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?t*))))"   
+"?t"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?t))))"    
+"*t*a"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*a))))"    
+"*t?a"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t?a))))"    
+"*t*a*"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*a*))))"   
+"t*a"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED t*a))))"   
+"t*a?"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED t*a?))))"    
+"t*a?a"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED t*a?a))))"   
+"?"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED ?))))"   
+"*t\\*a"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t\\*a))))"    
+"\\*t"  ->  "(MODIFIER (TMODIFIER (FIELD (QNORMAL \\*t))))"   
+"*t*a\\*"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*a\\*))))"   
+"*t*a\\?"   ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*a\\?))))"   
+"*t*\\a"  ->  "(MODIFIER (TMODIFIER (FIELD (QTRUNCATED *t*\\a))))"    
+"foo:*"   ->  "(MODIFIER (TMODIFIER (FIELD foo (QTRUNCATED *))))"   
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
+        
Index: lucene/queryparser/grammars/ExtendedLuceneGrammar.g
===================================================================
--- lucene/queryparser/grammars/ExtendedLuceneGrammar.g	(revision 0)
+++ lucene/queryparser/grammars/ExtendedLuceneGrammar.g	(revision 0)
@@ -0,0 +1,486 @@
+grammar ExtendedLuceneGrammar;
+
+//
+//  This is a re-implementation of the standard lucene syntax with ANTLR3
+//   http://lucene.apache.org/core/4_3_0/queryparser/index.html
+//   
+//   The query syntax is complete and supports the same features as the  
+//   original parser written in JCC. The advantage of this grammar is that it
+//   is 'pluggable' into Lucene's modern flexible parser, so that you can 
+//   add custom logic on top of the 'rigid' query syntax. Besides...the grammar
+//   is not that 'rigid' - you can modify the grammar and easily recompile.
+//   
+//   # run this commad inside antlrqueryparser
+//   
+//      $ ant generate-antlr -Dgrammar=MyNewGrammar
+//   
+//   # or if you want to test things, do:
+//   
+//      $ ant try-view -Dgrammar=MyNewGrammar -Dquery="foo AND bar"
+//   
+//   
+//   Implementation note: I have tried hard to avoid putting language specific details
+//   into the grammar, unfortunately this was not always possible. But it is kept
+//   at minimum. You can generate parser code in your language of choice
+//   if you change the following:
+//   
+//   options  : 
+//     language=<your-target-language-supported-by-antlr3>
+//     superClass= the default is to subclass 'UnforgivingParser', this java class
+//                         lives in the package oal.queryparser.flixible.aqp.parser
+//                         and its purpose is to bark everytime when an exception
+//                         happens (otherwise, ANTLR tries to recover from some situations
+//                         -- you may want to remove this definition, or add your own
+//                         error recovery logic there)
+//
+//   @header:  this adds the java declaration to the generated parser file,
+//                    feel free to remove (if you want to test the grammar using
+//                    ANTLRWorks, you want to remove it)
+//   @lexer::header: dtto but for lexer
+//   @lexer::members: again, necessary for being strict and prevent error 
+//                                recovery, but this applies only to lexer errors.
+//
+//  One last note - if you want to implement your own error recovery, have a look
+//  at the generated java class 
+//       
+//      oal.queryparser.flixible.aqp.parser.<GrammarName>SyntaxParser.java
+//
+//  There we are raising parse exception as well
+//
+
+
+options {
+  language = Java;
+  output = AST;
+  superClass = UnforgivingParser;
+}
+
+tokens {
+  OPERATOR;
+  ATOM;
+  MODIFIER;
+  TMODIFIER;
+  CLAUSE;
+  FIELD;
+  FUZZY;
+  BOOST;
+  QNORMAL;
+  QPHRASE;
+  QPHRASETRUNC;
+  QTRUNCATED;
+  QRANGEIN;
+  QRANGEEX;
+  QANYTHING;
+  QDATE;
+}
+
+
+// java-specific and error recovery-unfriendly details.... 
+
+@header{
+  package org.apache.lucene.queryparser.flexible.aqp.parser;
+}
+@lexer::header {
+  package org.apache.lucene.queryparser.flexible.aqp.parser;
+}
+
+// this is for exceptions on lexer level - we are preventing error 
+// recovery (ANTLRv3 does not seem to have a better way to modify
+// the default behaviour - eg. from a parent abstract class)
+@lexer::members {
+	public void recover(RecognitionException re) {
+		// throw unchecked exception
+	  throw new RuntimeException(re);
+	}
+}
+
+// ...below this point, language agnostic EBNF grammar lives.
+
+
+
+
+
+mainQ : 
+	clauseOr+ EOF -> ^(OPERATOR["DEFOP"] clauseOr+)
+	;
+  
+clauseOr
+  : (first=clauseAnd -> $first) (or others=clauseAnd -> ^(OPERATOR["OR"] clauseAnd+ ))*
+  ;
+
+clauseAnd
+  : (first=clauseNot  -> $first) (and others=clauseNot -> ^(OPERATOR["AND"] clauseNot+ ))*
+  ;
+  
+clauseNot
+  : (first=clauseNear -> $first) (not others=clauseNear -> ^(OPERATOR["NOT"] clauseNear+ ))*
+  ;
+  
+clauseNear
+  : (first=clauseBasic -> $first) (near others=clauseBasic -> ^(near clauseBasic+) )* 
+  ;
+  
+clauseBasic
+	:
+	(modifier LPAREN clauseOr+ RPAREN )=> modifier? LPAREN clauseOr+ RPAREN term_modifier? 
+	 -> ^(CLAUSE ^(MODIFIER modifier? ^(TMODIFIER term_modifier? ^(OPERATOR["DEFOP"] clauseOr+)))) // Default operator
+	| (LPAREN clauseOr+ RPAREN term_modifier)=> modifier? LPAREN clauseOr+ RPAREN term_modifier? 
+	 -> ^(CLAUSE ^(MODIFIER modifier? ^(TMODIFIER term_modifier? ^(OPERATOR["DEFOP"] clauseOr+)))) // Default operator
+	| (LPAREN  )=> LPAREN clauseOr+ RPAREN
+	 -> clauseOr+
+	| atom
+	;
+    
+
+atom   
+	: 
+	modifier? field multi_value term_modifier?
+	 -> ^(CLAUSE ^(MODIFIER modifier? ^(TMODIFIER term_modifier? ^(FIELD field multi_value))))
+	| modifier? field? value term_modifier? 
+	 -> ^(MODIFIER modifier? ^(TMODIFIER term_modifier? ^(FIELD field? value)))
+	;
+   
+
+field	
+	:	
+	TERM_NORMAL COLON -> TERM_NORMAL
+	;
+
+value  
+	: 
+	range_term_in -> ^(QRANGEIN range_term_in)
+	| range_term_ex -> ^(QRANGEEX range_term_ex) 
+	| normal -> ^(QNORMAL normal)	
+	| truncated -> ^(QTRUNCATED truncated)	
+	| quoted -> ^(QPHRASE quoted)
+	| quoted_truncated -> ^(QPHRASETRUNC quoted_truncated)
+	| QMARK -> ^(QTRUNCATED QMARK)
+	| STAR COLON b=STAR -> ^(QANYTHING $b)
+  | STAR -> ^(QTRUNCATED STAR)
+  ;
+
+	
+
+range_term_in
+	:	
+       LBRACK
+       (a=range_value -> range_value ^(QANYTHING QANYTHING["*"]))
+       ( TO? b=range_value -> $a $b? )?
+       RBRACK
+	;
+
+
+range_term_ex
+	:	
+       LCURLY
+       ( a=range_value -> range_value ^(QANYTHING QANYTHING["*"]))
+       ( TO? b=range_value -> $a $b? )?
+       RCURLY
+	;	
+
+range_value
+	:	
+	truncated -> ^(QTRUNCATED truncated)
+	| quoted -> ^(QPHRASE quoted)
+	| quoted_truncated -> ^(QPHRASETRUNC quoted_truncated)
+	| date -> ^(QNORMAL date)
+	| normal -> ^(QNORMAL normal)	
+	| STAR -> ^(QANYTHING STAR)
+	;
+
+multi_value
+	: 
+	LPAREN multiClause RPAREN -> multiClause
+	;
+
+
+
+multiClause	
+	:
+	
+	//m:(a b NEAR c OR d OR e)
+	
+	// without duplicating the rules (but it allows recursion)
+	clauseOr+ -> ^(OPERATOR["DEFOP"] clauseOr+)
+	
+	// allows only limited set of operations
+	//multiDefault
+	
+	// this is also working, but i want operator precedence
+	//multiClause:
+	//(mterm+ -> mterm+)
+	//(op=operator rhs=fclause -> ^(OPERATOR ^(OPERATOR["DEFOP"] $mclause) $rhs))?
+	//;
+	//flause:mclause;
+	;
+
+multiDefault
+	:	
+	multiOr+ -> ^(OPERATOR["DEFOP"] multiOr+)
+	;
+
+multiOr	
+	:	
+	(first=multiAnd  -> $first) (or others=multiAnd-> ^(OPERATOR["OR"] multiAnd+ ))*
+	;	
+		
+multiAnd
+	:	
+	(first=multiNot  -> $first) (and others=multiNot -> ^(OPERATOR["AND"] multiNot+ ))*
+	;	
+
+multiNot	
+	:	
+	(first=multiNear  -> $first) (not others=multiNear-> ^(OPERATOR["NOT"] multiNear+ ))*
+	;	
+
+multiNear	
+	:	
+	(first=multiBasic  -> $first) (near others=multiBasic-> ^(near multiBasic+ ))*
+	;	
+
+
+multiBasic
+	:	
+	mterm
+	;
+		
+mterm	
+	:	
+	modifier? value -> ^(MODIFIER modifier? value)
+	;
+	
+
+normal	
+	:	
+	TERM_NORMAL
+	| NUMBER
+	;	
+
+	
+
+			
+truncated
+	:	
+	TERM_TRUNCATED
+	; 
+
+
+quoted_truncated
+	:	
+	PHRASE_ANYTHING
+	;
+
+quoted	:	
+	PHRASE
+	;
+
+
+
+	
+operator: (
+	AND -> OPERATOR["AND"]
+	| OR -> OPERATOR["OR"]
+	| NOT -> OPERATOR["NOT"]
+	| NEAR -> OPERATOR["NEAR"]
+	);
+
+modifier: 
+	PLUS -> PLUS["+"]
+	| MINUS -> MINUS["-"];
+
+
+/*
+This terribly convoluted grammar is here because of weird AST rewrite rules
+and because we need to allow for default value when TILDE is not followed by
+anything
+
+This grammar has problem with following
+	:	term^4~ 9999
+	where 999 is another term, not a fuzzy value
+*/
+term_modifier	:	
+	TILDE CARAT? -> ^(BOOST CARAT?) ^(FUZZY TILDE) 
+	| CARAT TILDE? -> ^(BOOST CARAT) ^(FUZZY TILDE?)
+/*
+	// first alternative
+	(
+	  (CARAT b=NUMBER -> ^(BOOST $b) ^(FUZZY )
+	 ) 
+	( //syntactic predicate
+	 (TILDE NUMBER )=>TILDE f=NUMBER -> ^(BOOST $b) ^(FUZZY $f)
+	 | TILDE -> ^(BOOST $b) ^(FUZZY NUMBER["0.5"])
+	 )* // set the default value
+	
+	)
+	// second alternative [only ~ | ~NUMBER]
+	| 
+	  (TILDE -> ^(BOOST) ^(FUZZY NUMBER["0.5"])) // set the default value
+	  ((~(WS|TILDE|CARAT))=>f=NUMBER -> ^(BOOST) ^(FUZZY $f?) )* //replace the default but '~' must not be followed by WS
+*/	
+	;
+
+
+boost	:
+	(CARAT -> ^(BOOST NUMBER["DEF"])) // set the default value
+	(NUMBER -> ^(BOOST NUMBER))? //replace the default with user input
+	;
+
+fuzzy	:
+	(TILDE -> ^(FUZZY NUMBER["DEF"])) // set the default value
+	(NUMBER -> ^(FUZZY NUMBER))? //replace the default with user input
+	;
+
+not	:	
+	(AND NOT)=> AND NOT
+	| NOT
+	;
+	
+and 	:	
+	AND
+	;
+	
+or 	:	
+	OR
+	;		
+
+near  : 
+  (NEAR -> ^(OPERATOR[$NEAR]) )
+  ;
+
+date	:	
+	//a=NUMBER '/' b=NUMBER '/' c=NUMBER -> ^(QDATE $a $b $c)
+	DATE_TOKEN
+	;
+
+/* ================================================================
+ * =                     LEXER                                    =
+ * ================================================================
+ */
+
+
+
+LPAREN  : '(';
+
+RPAREN  : ')';
+
+LBRACK  : '[';
+
+RBRACK  : ']';
+
+COLON   : ':' ;  //this must NOT be fragment
+
+PLUS  : '+' ;
+
+MINUS : ('-'|'\!');
+
+STAR  : '*' ;
+
+QMARK  : '?'+ ;
+
+fragment VBAR  : '|' ;
+
+fragment AMPER : '&' ;
+
+LCURLY  : '{' ;
+
+RCURLY  : '}' ;
+
+CARAT : '^' (INT+ ('.' INT+)?)?;
+
+TILDE : '~' (INT+ ('.' INT+)?)?;
+
+DQUOTE	
+	:	'\"';
+
+SQUOTE
+	:	'\'';
+
+
+
+
+TO	:	'TO';
+
+/* We want to be case insensitive */
+AND   : (('a' | 'A') ('n' | 'N') ('d' | 'D') | (AMPER AMPER?)) ;
+OR  : (('o' | 'O') ('r' | 'R') | (VBAR VBAR?));
+NOT   : ('n' | 'N') ('o' | 'O') ('t' | 'T');
+NEAR  : ('n' | 'N') ('e' | 'E') ('a' | 'A') ('r' | 'R') ('0'..'9')*;
+
+
+WS  :   ( ' '
+        | '\t'
+        | '\r'
+        | '\n'
+        | '\u3000'
+        ) 
+        {$channel=HIDDEN;}
+    ;
+
+      
+/*	
+fragment TERM_CHAR  : 
+     ~(' ' | '\t' | '\n' | '\r' | '\u3000'
+      | '\\' | '\'' | '\"' 
+      | '(' | ')' | '[' | ']' | '{' | '}'
+      | '+' | '-' | '!' | ':' | '~' | '^' 
+      | '*' | '|' | '&' | '?' | '\\\"' | '/'  //this line is not present in lucene StandardParser.jj
+      );  	
+*/
+
+
+fragment INT: '0' .. '9';
+
+
+fragment ESC_CHAR:  '\\' .; 
+
+
+fragment TERM_START_CHAR
+	:
+	(~(' ' | '\t' | '\n' | '\r' | '\u3000'
+	      | '\'' | '\"' 
+	      | '(' | ')' | '[' | ']' | '{' | '}'
+	      | '+' | '-' | '!' | ':' | '~' | '^' 
+	      | '?' | '*' | '\\'
+	      )
+	 | ESC_CHAR );  	
+
+
+fragment TERM_CHAR
+	:	
+	(TERM_START_CHAR | '-' | '+')
+	;
+
+
+NUMBER  
+	: 
+	INT+ ('.' INT+)?
+	;
+
+DATE_TOKEN
+	:	
+	INT INT? ('/'|'-'|'.') INT INT? ('/'|'-'|'.') INT INT (INT INT)?
+	;
+
+TERM_NORMAL
+	: 
+	TERM_START_CHAR ( TERM_CHAR )*
+	;
+
+
+TERM_TRUNCATED: 
+	(STAR|QMARK) (TERM_CHAR+ (QMARK|STAR))+ (TERM_CHAR)*
+	| TERM_START_CHAR (TERM_CHAR* (QMARK|STAR))+ (TERM_CHAR)*
+	| (STAR|QMARK) TERM_CHAR+
+	;
+
+
+PHRASE	
+	:	
+	DQUOTE (ESC_CHAR|~('\"'|'\\'|'?'|'*'))+ DQUOTE
+	;
+
+PHRASE_ANYTHING	:	
+	DQUOTE (ESC_CHAR|~('\"'|'\\'))+ DQUOTE
+	;
+
Index: lucene/queryparser/grammars/build.properties
===================================================================
--- lucene/queryparser/grammars/build.properties	(revision 0)
+++ lucene/queryparser/grammars/build.properties	(revision 0)
@@ -0,0 +1,16 @@
+
+# Adjust these if you are building grammars using AQP
+# they are used only for generating the nice html charts
+# of parse trees for a grammar
+
+# command for the dot viewer
+# on mac, this might be "open -a graphviz"
+# or on linux /usr/bin/xdot
+
+dot_viewer=xdot
+
+svg_generator=dot
+
+java_executable=java
+
+python=python
\ No newline at end of file
Index: lucene/queryparser/grammars/generate_asts.py
===================================================================
--- lucene/queryparser/grammars/generate_asts.py	(revision 0)
+++ lucene/queryparser/grammars/generate_asts.py	(revision 0)
@@ -0,0 +1,201 @@
+
+import sys
+import subprocess as sub
+import os
+
+"""
+Simple utility script to generate HTML charts of how ANTLR parses
+every query and what is the resulting AST. 
+"""
+
+def run(grammar_name, basedir='', 
+        cp='.:../lib/antlr-3.4-complete.jar',
+        grammardir='',
+        java_executable='java',
+        dot_executable='dot'
+        ):
+    
+    
+    if not basedir:
+        basedir = os.path.abspath('../../build/queryparser')
+
+    old_dir = os.getcwd()
+    
+    thisdir = grammardir
+    if not thisdir:        
+        thisdir = os.path.dirname(os.path.abspath(__file__))
+    os.chdir(thisdir)
+    
+    cp += os.pathsep + basedir
+
+    print "We'll generate ANTLR graphs\ngramar: %s\nbasedir: %s\nclasspath: %s\nparserdir: %s" % (grammar_name, basedir, cp, thisdir)
+    
+    grammar_file = os.path.join(thisdir, grammar_name + '.g')
+    
+    if not os.path.exists(grammar_file):
+        raise Exception('Grammar %s does not exist in classpath: %s' % (grammar_file, cp))
+    
+    tmp_file = os.path.join(basedir, 'ast-tree.dot')
+    index_file = os.path.join(basedir, '%s.html' % grammar_name)
+    gunit_file = os.path.join(thisdir, grammar_name + '.gunit')
+    generate_ast_command = '%s -cp %s org.apache.lucene.queryparser.flexible.aqp.parser.BuildAST %s "%%s"' % (java_executable, cp, grammar_name)
+    
+    
+    generate_svg_command = '%s -Tsvg %s' % (dot_executable, tmp_file)
+    
+    test_cases = load_gunit_file(gunit_file)
+    
+    index_fo = open(index_file, 'w')
+    index_fo.write('<h1>Test cases generated from grammar: %s</h1>\n' % grammar_name)
+    
+    out_lines = []
+    i = 0
+    cmds = generate_ast_command.split()
+    cmds_svg = generate_svg_command.split()
+    
+    total = sum(map(lambda x: len(x), test_cases.values()))
+    
+    toc = []
+    data = []
+    
+    toc.append('<a name="toc" />')
+    
+    for section,values in test_cases.items():
+        output = tree = svg = ''
+        
+        toc.append('The rule: <a href="#anchor%s"><pre>%s</pre></a><br/>' % (section, section))
+        
+        # generate AST tree
+        for query in values:
+            i += 1
+            cmds[-1] = query
+            
+            #tmp_dot = os.path.join(basedir, 'tmp-%s.dot' % i)
+            
+            tmp_dot = tmp_file
+            
+            if os.path.exists(tmp_dot):
+                os.remove(tmp_dot)
+            
+            toc.append('%s. <a href="#anchor%s"><pre>%s</pre></a><br/>' % (i, i, query))
+            
+            print '//  %s/%s :: %s' % (i, total, query)
+            
+            
+            #generate graph
+            p = sub.Popen(cmds,stdout=sub.PIPE,stderr=sub.PIPE)
+            
+            output, errors = p.communicate()
+            if output:
+                fo = open(tmp_dot, 'w')
+                fo.write(output)
+                fo.close()
+            else:
+                print 'Error generating AST for: ' + query
+                print errors
+                if 'java.lang.ClassNotFoundException' in errors:
+                    raise Exception('Please fix your classpath')
+                continue
+
+            #generate tree
+            cmds.append(section)
+            cmds.append("tree")
+            p = sub.Popen(cmds,stdout=sub.PIPE,stderr=sub.PIPE)
+            
+            tree, errors = p.communicate()
+            if tree:
+                q = query.replace('\\', '\\\\').replace('"', '\\"').replace('\'', '\\\'')
+                t = tree.strip().replace('\\', '\\\\').replace('"', '\\"').replace("'", "\\'")
+                print "\"%s\" -> \"%s\"" % (q, t)
+            else:
+                print 'Error generating AST for: ' + query
+                print errors
+                tree = errors
+                
+            cmds.pop()
+            cmds.pop()
+                        
+            cmds_svg[-1] = tmp_dot
+            
+            try:
+                p = sub.Popen(cmds_svg,stdout=sub.PIPE,stderr=sub.PIPE)
+            except Exception, e:
+                print "The following command failed:"
+                print ' '.join(cmds_svg)
+                raise e
+            
+            output, errors = p.communicate()
+            
+            data.append(' <a name="anchor%s"/><h3>%s. <pre">%s</pre>&nbsp;&nbsp; <a href="#toc">^</a> </h3>' % (i, i, query))
+            data.append(output)
+            data.append('<br/><pre>' + tree + '</pre>')
+            data.append('<br/>')
+    
+    index_fo.write('''
+    <html>
+<head>
+<meta http-equiv="Content-Type" content="text/html;charset=utf-8" />
+<style type="text/css">
+    pre {display:inline;}
+</style>
+</head>
+</body>    
+    ''')
+    index_fo.write('\n'.join(toc))
+    index_fo.write('\n'.join(data))
+    
+    index_fo.write('''
+</body>
+</html>    
+    ''')    
+    index_fo.close()
+        
+    print 'HTML charts generated into:', index_fo.name        
+    os.chdir(old_dir)
+        
+
+def load_gunit_file(gunit_file):
+    fi = open(gunit_file, 'r')
+    test_cases = {}
+    section = None
+    for line in fi:
+        l = line.strip()
+        if not l or l[:2] == '//':
+            continue
+        parts = split_line(l)
+        if len(parts) == 1 and parts[0][-1] == ':':
+            section = parts[0][:-1]
+            test_cases.setdefault(section, [])
+        elif len(parts) > 1 and parts[1].lower() != 'fails':
+            query = parts[0]
+            query = query.replace('\\\"', '"').replace('\\\'', '\'').replace('\\\\', '\\')
+            test_cases[section].append(query)
+    fi.close()
+    return test_cases
+            
+        
+def split_line(line):
+    line = line.replace('->', '')
+    start = 0
+    last_pos = None
+    parts = []
+    while line.find('"', start) > -1:
+        p = line.index('"', start)
+        start = p+1
+        if line[p-1] != '\\':
+            if last_pos is None:
+                last_pos = p
+            else:
+                parts.append(line[last_pos+1:p])
+                parts.append(line[p+1:].strip())
+                last_pos = None
+                break
+    if not parts:
+        parts.append(line.strip())
+    return parts
+
+
+if __name__ == '__main__':
+    if len(sys.argv) == 1:
+        sys.argv.insert(1, "StandardLuceneGrammar")
+    run(*sys.argv[1:])
Index: lucene/queryparser/grammars/demo.sh
===================================================================
--- lucene/queryparser/grammars/demo.sh	(revision 0)
+++ lucene/queryparser/grammars/demo.sh	(revision 0)
@@ -0,0 +1,67 @@
+#!/bin/bash
+set +e
+
+# this is just a helper utility to test complex queries (when some escape chars are involved
+# and which are screwed by ant). The grammar must be built by ant first!
+
+QUERY=$1
+
+GRAMMAR=${2:-StandardLuceneGrammar}
+
+RULE=${3:-mainQ}
+
+BINDIR=../../build/queryparser
+
+CP=.:/../lib/antlr-3.4-complete.jar:../../build/queryparser/lib/antlr-3.4-complete.jar:$BINDIR:$BINDIR/classes/test:$BINDIR/classes/java
+
+echo $BINDIR
+echo $CP
+
+TGTDIR=$BINDIR/org/apache/lucene/queryparser/flexible/aqp/parser
+
+TGTFILE=$BINDIR/ast-tree.dot
+
+
+
+echo 'Input:' $QUERY
+
+
+rm -fR $TGTDIR
+mkdir -p $TGTDIR
+rm $TGTFILE
+
+#echo "Regenerating grammar $GRAMMAR..."
+
+#java -cp $CP org.antlr.Tool -o $TGTDIR $GRAMMAR.g
+#java -cp $CP org.antlr.Tool $GRAMMAR.g
+#cp BuildAST.java $TGTDIR
+#javac -cp $CP $TGTDIR/*.java
+
+
+
+#if [ "$1" = "build-only" ];
+#then
+#    echo "finished..."
+#    exit 0
+#fi
+
+java -cp $CP org.apache.lucene.queryparser.flexible.aqp.parser.BuildAST $GRAMMAR "$QUERY" $RULE tree
+java -cp $CP org.apache.lucene.queryparser.flexible.aqp.parser.BuildAST $GRAMMAR "$QUERY" $RULE > $TGTFILE
+    
+if ! grep -q "digraph" $TGTFILE ;
+then
+    echo "No DOT file generated!"
+    exit 1
+fi
+
+
+
+XDOT=`which xdot`
+if [ $XDOT ];
+then
+  echo "executing: $XDOT $TGTFILE"
+  $XDOT $TGTFILE
+else
+  echo "executing: open -a graphviz $TGTFILE"
+  open -a graphviz $TGTFILE
+fi
Index: lucene/queryparser/grammars/gunit.sh
===================================================================
--- lucene/queryparser/grammars/gunit.sh	(revision 0)
+++ lucene/queryparser/grammars/gunit.sh	(revision 0)
@@ -0,0 +1,13 @@
+#!/bin/bash
+
+GRAMMAR=${1:-StandardLuceneGrammar}
+
+BINDIR=../../build/queryparser
+
+CP=.:/../lib/antlr-3.4-complete.jar:../../build/queryparser/lib/antlr-3.4-complete.jar:$BINDIR:$BINDIR/classes/test:$BINDIR/classes/java
+
+./demo.sh build-only $GRAMMAR
+
+
+java -cp $CP org.antlr.gunit.Interp $GRAMMAR.gunit 
+
Index: lucene/queryparser/aqp-build.xml
===================================================================
--- lucene/queryparser/aqp-build.xml	(revision 0)
+++ lucene/queryparser/aqp-build.xml	(revision 0)
@@ -0,0 +1,224 @@
+<?xml version="1.0"?>
+
+<!--
+    Licensed to the Apache Software Foundation (ASF) under one or more
+    contributor license agreements.  See the NOTICE file distributed with
+    this work for additional information regarding copyright ownership.
+    The ASF licenses this file to You under the Apache License, Version 2.0
+    the "License"); you may not use this file except in compliance with
+    the License.  You may obtain a copy of the License at
+ 
+        http://www.apache.org/licenses/LICENSE-2.0
+ 
+    Unless required by applicable law or agreed to in writing, software
+    distributed under the License is distributed on an "AS IS" BASIS,
+    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+    See the License for the specific language governing permissions and
+    limitations under the License.
+ -->
+
+<project name="queryparser" default="default">
+
+	<description>
+    ANTLR Flexible Query Parser
+  </description>
+
+	<import file="../module-build.xml"/>
+	<property file="${common.dir}/queryparser/grammars/build.properties" prefix="dotprop"/>
+
+	<!-- parameters for the build, many of these have default values -->
+	<condition property="aqp.grammardir" value="./grammars">
+        <not>
+            <isset property="grammardir"/>
+        </not>
+  </condition>
+  
+  <property name="aqp.ant.version" value="3.4"/>
+  <property name="aqp.grammardir" value="${grammardir}"/>
+	<property name="aqp.grammars.dir" location="${aqp.grammardir}" />
+	<property name="aqp.parser.dir" location="src/java/org/apache/lucene/queryparser/flexible/aqp/parser" />
+	<property name="aqp.classes.dir" location="${build.dir}/classes/java" />
+	<property name="aqp.classes.parser.dir" location="${aqp.classes.dir}/org/apache/lucene/queryparser/flexible/aqp/parser" />
+	<property name="aqp.dotfile" location="${build.dir}/graph.dot" />
+	<property name="aqp.generate.py" location="${aqp.grammars.dir}/generate_asts.py" />
+
+
+	<condition property="aqp.grammar" value="StandardLuceneGrammar">
+		<not>
+			<isset property="grammar"/>
+		</not>
+	</condition>
+	<property name="aqp.grammar" value="${grammar}"/>
+
+	
+	<condition property="aqp.rule" value="mainQ">
+		<not>
+			<isset property="rule"/>
+		</not>
+	</condition>
+	<property name="aqp.rule" value="${rule}"/>
+
+
+	<condition property="aqp.query" value="test query">
+		<not>
+			<isset property="query"/>
+		</not>
+	</condition>
+	<property name="aqp.query" value="${query}" />
+	
+
+  <!-- even if this seems unused, please keep it - this build file is 
+         designed to be imported from other projects -->
+  <path id="additional.classpath" />
+	
+	<mkdir dir="${build.dir}/classes/test"/>
+	<path id="classpath">
+	  <path refid="additional.classpath"/>
+	  <pathelement location="${build.dir}/classes/java"/>
+	  <pathelement path="${queries.jar}"/>
+	  <pathelement path="${sandbox.jar}"/>
+	  <pathelement path="${analyzers-common.jar}"/>
+    <path refid="base.classpath"/>
+	  
+		<fileset dir="lib">
+			<include name="**/antlr-runtime-${aqp.ant.version}.jar"/>
+		</fileset>
+	</path>
+
+  <path id="compile.classpath">
+    <path refid="classpath"/>
+    <fileset dir="lib">
+      <include name="**/*.jar"/>
+    </fileset>
+  </path>
+        	
+	<path id="test.classpath">
+	  <pathelement location="${build.dir}/classes/test"/>
+		<path refid="test.base.classpath"/>
+		<path refid="classpath"/>
+	  <path refid="compile.classpath"/>
+	</path>
+  
+  
+  
+  <target name="compile-core" depends="compile-test-framework,jar-analyzers-common, common.compile-core" />
+
+
+	<target name="clean" depends="common.clean">
+		<clean-parser grammar-name="${aqp.grammar}" parser-dir="${aqp.parser.dir}"/>
+	</target>
+
+	
+	<target name="generate-antlr" depends="antlr-generate" 
+		description="Regenerates grammar; usage -Dgrammar=&lt;name&gt;"/>
+
+	
+	<target name="antlr-generate" >
+		<generate-grammar grammar-name="${aqp.grammar}"
+			 grammar-dir="${aqp.grammars.dir}"
+			 parser-dir="${aqp.parser.dir}"
+			 build-dir="${aqp.classes.dir}"
+			 classpathref="compile.classpath"
+			   />
+	</target>
+
+
+	<!-- compiles both grammar and the test classes -->
+	<target name="recompile-all" depends="generate-antlr,compile,compile-ast" />
+		
+    
+	<target name="compile-ast">
+		<mkdir dir="${build.dir}/classes/test"/>
+    <compile srcdir="${common.dir}/queryparser/src/test" 
+        destdir="${build.dir}/classes/test">
+        <classpath refid="compile.classpath"/>
+        <include name="**/BuildAST.java"/>
+    </compile>
+	</target>
+	
+  
+	
+  <target name="compile-prerequisites" depends="jar-queries,jar-sandbox,jar-test-framework">
+      
+  </target>
+
+
+	<target name="dot" depends="">
+		<generate-dot grammar-name="${aqp.grammar}"
+		            query="${aqp.query}"
+		            rule="${aqp.rule}"
+		            classpathref="test.classpath"
+			        output-file="${aqp.dotfile}"
+		        />
+	</target>
+
+	
+	<target name="tree" depends="">
+		<generate-tree grammar-name="${aqp.grammar}"
+			query="${aqp.query}"
+			rule="${aqp.rule}"
+			classpathref="test.classpath"/>
+	</target>
+
+	
+	<target name="display" depends="dot" >
+		<echo>${dotprop.dot_viewer} ${aqp.dotfile}</echo>
+		<exec executable="${dotprop.dot_viewer}" failifexecutionfails="true">
+			<arg line="${aqp.dotfile}"/>
+		</exec>
+	</target>
+
+	
+	<target name="view" description="Test the string, usage: ant -Dquery=string" depends="dot,tree,display">
+	</target>
+
+	<target name="try-dot" description="Like view, but regenerates the grammar first" depends="recompile-all,dot" />
+	<target name="try-tree" description="Like view, but regenerates the grammar first" depends="recompile-all,tree" />
+	<target name="try-view" description="Like view, but regenerates the grammar first" depends="recompile-all,view" />
+
+	<target name="gunit" description="Run the gunit test suite, usage: ant -Dgrammar=name" 
+		depends="generate-antlr">
+		 
+		<run-gunit grammar-name="${aqp.grammar}" 
+			grammar-dir="${aqp.grammars.dir}" 
+			classpathref="compile.classpath"/>
+
+	</target>
+
+	
+  <target name="test" depends="default,compile-prerequisites" >
+      <antcall target="common.test" inheritRefs="true"/>
+  </target>
+
+	
+	<target name="generate-html" description="Generates a html page for the grammar X (from X.gunit file)" 
+		depends="" >
+	    
+		<echo>
+		      Generating graphs for the grammar ${aqp.grammar}
+			    Note: the ${dotprop.svg_generator} must exist and be executable
+			    You can fix the path in ${common.dir}/queryparser/grammars/build.properties
+		</echo>
+		<generate-html python-executable="${dotprop.python}"
+			  python-generator="${aqp.generate.py}"
+			  grammar-name="${aqp.grammar}"
+			  build-dir="${build.dir}"
+			  classpath="${toString:test.classpath}"
+			  grammar-dir="${aqp.grammars.dir}"
+			  java-executable="${dotprop.java_executable}"
+			  dot-executable="${dotprop.svg_generator}"
+			  />
+	</target>
+
+	<target name="build-all"  depends="clean,default,recompile-all,jar" />
+	
+
+	<!--
+	============================================================================================
+	                                           MACROS
+  ============================================================================================
+	//-->
+    
+	<import file="./aqp-macros.xml" />
+
+</project>
Index: lucene/queryparser/build.xml
===================================================================
--- lucene/queryparser/build.xml	(revision 1484512)
+++ lucene/queryparser/build.xml	(working copy)
@@ -25,7 +25,19 @@
   <path id="classpath">
     <pathelement path="${queries.jar}"/>
     <pathelement path="${sandbox.jar}"/>
+    <pathelement path="${analyzers-common.jar}"/>
     <path refid="base.classpath"/>
+    <fileset dir="lib">
+      <include name="**/antlr-runtime-*.jar"/>
+    </fileset>
+  </path>
+  
+  <path id="test.classpath">
+    <pathelement location="${build.dir}/classes/test"/>
+    <path refid="test.base.classpath"/>
+    <fileset dir="lib">
+      <include name="**/*.jar"/>
+    </fileset>
   </path>
 
   <target name="compile-core" depends="jar-queries,jar-sandbox,common.compile-core"/>
Index: solr/core/ivy.xml
===================================================================
--- solr/core/ivy.xml	(revision 1484512)
+++ solr/core/ivy.xml	(working copy)
@@ -32,6 +32,7 @@
       <dependency org="javax.servlet" name="javax.servlet-api" rev="3.0.1" transitive="false"/>
       <dependency org="org.restlet.jee" name="org.restlet" rev="2.1.1" transitive="false"/>
       <dependency org="org.restlet.jee" name="org.restlet.ext.servlet" rev="2.1.1" transitive="false"/>
+      <dependency org="org.antlr" name="antlr-runtime" rev="3.4" transitive="false"/>
       <exclude org="*" ext="*" matcher="regexp" type="${ivy.exclude.types}"/>
     </dependencies>
 </ivy-module>
Index: solr/core/src/test/org/apache/solr/search/TestAqpLuceneQParserPlugin.java
===================================================================
--- solr/core/src/test/org/apache/solr/search/TestAqpLuceneQParserPlugin.java	(revision 0)
+++ solr/core/src/test/org/apache/solr/search/TestAqpLuceneQParserPlugin.java	(revision 0)
@@ -0,0 +1,95 @@
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements.  See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You under the Apache License, Version 2.0
+ * (the "License"); you may not use this file except in compliance with
+ * the License.  You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+package org.apache.solr.search;
+
+import java.io.IOException;
+
+import org.apache.lucene.search.Query;
+import org.apache.solr.SolrTestCaseJ4;
+import org.apache.solr.common.SolrException;
+import org.apache.solr.common.params.CommonParams;
+import org.apache.solr.request.SolrQueryRequest;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+public class TestAqpLuceneQParserPlugin extends SolrTestCaseJ4 {
+	
+  @BeforeClass
+  public static void beforeClass() throws Exception {
+    initCore("solrconfig-extended-lucene-qparser.xml","schema.xml");
+  }
+
+	public void createIndex() {
+		assertU(adoc("id","1", "text", "who"));
+		assertU(adoc("id","2", "text", "is stopword"));
+		assertU(adoc("id","3", "text", "able"));
+		assertU(adoc("id","4", "text", "to stopword"));
+		assertU(adoc("id","5", "text", "exchange"));
+		assertU(adoc("id","16", "text", "liberty"));
+		assertU(adoc("id","17", "text", "for stopword"));
+		assertU(adoc("id","18", "text", "safety"));
+		assertU(adoc("id","19", "text", "deserves"));
+		assertU(adoc("id","20", "text", "neither"));
+		assertU(adoc("id","21", "text", "Benjamin Franklin must not be a hero to NSA officers!"));
+		assertU(commit());
+	}
+
+	@Override
+	public void setUp() throws Exception {
+		super.setUp();
+		createIndex();
+	}
+
+	
+	@Test
+	public void test() throws IOException, Exception {
+		
+		AqpLuceneQParserPlugin a = new AqpLuceneQParserPlugin();
+		SolrQueryRequest r = req(CommonParams.Q, "franklin NEAR hero", CommonParams.DF, "text");
+		QParser parser = a.createParser("franklin NEAR hero", r.getParams(), r.getParams(), r);
+		Query query = parser.parse();
+		assertEquals("spanNear([text:franklin, text:hero], 5, true)", query.toString());
+		r.close();
+		
+		QParserPlugin qp = h.getCore().getQueryPlugin("lucene2");
+		assertTrue("parserPlugin is not an instanceof " + AqpLuceneQParserPlugin.class, qp instanceof AqpLuceneQParserPlugin);
+		
+		
+		assertQ(req("q", "{!lucene2} franklin NEAR hero"),
+				"//*[@numFound='1']",
+				"//doc/int[@name='id'][.='21']"
+		);
+		
+		assertQEx("Configuration for proximity search not heeded", 
+				req("q", "{!lucene2} franklin NEAR10 officers"),
+				SolrException.ErrorCode.BAD_REQUEST);
+				
+		
+		assertQ(req("q", "{!lucene2} benjamin NEAR2 nsa"),
+				"//*[@numFound='0']"
+		);
+		
+		assertQ(req("q", "{!lucene2} benjamin NEAR1 franklin"),
+				"//*[@numFound='1']",
+				"//doc/int[@name='id'][.='21']"
+		);
+
+	}
+
+}
+
+
Index: solr/core/src/test-files/solr/collection1/conf/solrconfig-extended-lucene-qparser.xml
===================================================================
--- solr/core/src/test-files/solr/collection1/conf/solrconfig-extended-lucene-qparser.xml	(revision 0)
+++ solr/core/src/test-files/solr/collection1/conf/solrconfig-extended-lucene-qparser.xml	(revision 0)
@@ -0,0 +1,32 @@
+<?xml version="1.0" ?>
+
+<!--
+ Licensed to the Apache Software Foundation (ASF) under one or more
+ contributor license agreements.  See the NOTICE file distributed with
+ this work for additional information regarding copyright ownership.
+ The ASF licenses this file to You under the Apache License, Version 2.0
+ (the "License"); you may not use this file except in compliance with
+ the License.  You may obtain a copy of the License at
+
+     http://www.apache.org/licenses/LICENSE-2.0
+
+ Unless required by applicable law or agreed to in writing, software
+ distributed under the License is distributed on an "AS IS" BASIS,
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ See the License for the specific language governing permissions and
+ limitations under the License.
+-->
+
+
+<config>
+  <luceneMatchVersion>${tests.luceneMatchVersion:LUCENE_CURRENT}</luceneMatchVersion>
+  <directoryFactory name="DirectoryFactory" class="${solr.directoryFactory:solr.RAMDirectoryFactory}"/>
+  <queryParser name="lucene2" class="AqpLuceneQParserPlugin">
+    <lst name="defaults">
+       <str name="defaultField">text</str>
+    </lst>
+  </queryParser>
+  <requestHandler name="/select" class="solr.SearchHandler">
+  </requestHandler>
+  
+</config>
Index: solr/core/src/java/org/apache/solr/search/AqpLuceneQParser.java
===================================================================
--- solr/core/src/java/org/apache/solr/search/AqpLuceneQParser.java	(revision 0)
+++ solr/core/src/java/org/apache/solr/search/AqpLuceneQParser.java	(revision 0)
@@ -0,0 +1,128 @@
+package org.apache.solr.search;
+
+import org.apache.lucene.queryparser.classic.ParseException;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeException;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeParseException;
+import org.apache.lucene.queryparser.flexible.core.config.QueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler.ConfigurationKeys;
+import org.apache.lucene.queryparser.flexible.standard.config.StandardQueryConfigHandler.Operator;
+import org.apache.lucene.queryparser.flexible.aqp.AqpQueryParser;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardLuceneParser;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardQueryConfigHandler;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardQueryNodeProcessorPipeline;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpStandardQueryTreeBuilder;
+import org.apache.lucene.search.Query;
+import org.apache.solr.common.SolrException;
+import org.apache.solr.common.params.CommonParams;
+import org.apache.solr.common.params.SolrParams;
+import org.apache.solr.request.SolrQueryRequest;
+import org.apache.solr.schema.IndexSchema;
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
+
+/**
+ * This is the MAIN solr entry point - this instantiates a query 
+ * parser - it sets some default parameters from the config and prepares 
+ * ulr parameters.
+ * 
+ * <p>
+ * 
+ * TODO: the parser needs to know configuration of data/numeric fields
+ *       so that the analysis is done correctly. It is not done here
+ *       for the moment (as this is SOLR-specific and needs more 
+ *       components)
+ * <p>      
+ *       In principle, it is configured like this:
+ * <p>      
+ * 
+ * <pre>
+ *      HashMap<String, NumericConfig> ncm = new HashMap<String, NumericConfig>();
+ *   		config.set(StandardQueryConfigHandler.ConfigurationKeys.NUMERIC_CONFIG_MAP, ncm);
+ *      ncm.put(field_name, new NumericConfig(4, NumberFormat.getNumberInstance(Locale.US), NumericType.INT));
+ * </pre>
+ * 
+ * @see AqpLuceneQParserPlugin
+ * @see AqpStandardLuceneParser
+ * @see AqpStandardQueryConfigHandler
+ * @see AqpStandardQueryNodeProcessorPipeline
+ * @see AqpStandardQueryTreeBuilder
+ *
+ */
+public class AqpLuceneQParser extends QParser {
+
+	public static final Logger log = LoggerFactory
+			.getLogger(AqpLuceneQParser.class);
+
+	private AqpQueryParser qParser;
+
+	public AqpLuceneQParser(AqpQueryParser parser, String qstr, SolrParams localParams,
+			SolrParams params, SolrQueryRequest req)
+			throws QueryNodeParseException {
+		
+		super(qstr, localParams, params, req);
+		qParser = parser;
+
+		if (getString() == null) {
+			throw new SolrException(SolrException.ErrorCode.BAD_REQUEST,
+					"The query is empty");
+		}
+
+
+		IndexSchema schema = req.getSchema();
+
+		
+		// now configure the parser using the request params, likely incomplete (yet)
+		QueryConfigHandler config = qParser.getQueryConfigHandler();
+		qParser.setAnalyzer(schema.getAnalyzer());
+		qParser.setDefaultField(params.get(CommonParams.DF, qParser.getDefaultField()));
+		
+		String opParam = getParam(QueryParsing.OP);
+		if (opParam != null) {
+			// other operators could also become default, eg. NEAR
+			qParser.setDefaultOperator("AND".equals(opParam.toUpperCase()) ? Operator.AND
+					: Operator.OR);
+		}
+		else {
+			qParser.setDefaultOperator(Operator.OR);
+		}
+		
+		
+		// this is not useful in solr world (?) - but must be available
+		config.set(ConfigurationKeys.MULTI_FIELDS, new CharSequence[0]);
+		
+		if (params.getBool("debugQuery", false) != false) {
+			try {
+				qParser.setDebug(true);
+			} catch (Exception e) {
+        e.printStackTrace();
+      }
+		}
+		
+  	// your components may need access to solr, if there is some 'semantic analysis'
+		// involved, eg. multi-step parsing of a query. I do it this way (the component
+		// may be committed to solr in other tickets)
+		// AqpRequestParams reqAttr = config.get(AqpAdsabsQueryConfigHandler.ConfigurationKeys.SOLR_REQUEST);
+		// reqAttr.setQueryString(getString());
+		// reqAttr.setRequest(req);
+		// reqAttr.setLocalParams(localParams);
+		// reqAttr.setParams(params);
+		
+	}
+	
+
+	public Query parse() throws ParseException {
+		try {
+			return qParser.parse(getString(), null);
+		} catch (QueryNodeException e) {
+			throw new ParseException(e.getMessage());
+		}
+		catch (SolrException e1) {
+			throw new ParseException(e1.getMessage());
+		}
+	}
+
+	public AqpQueryParser getParser() {
+		return qParser;
+	}
+}
Index: solr/core/src/java/org/apache/solr/search/AqpLuceneQParserPlugin.java
===================================================================
--- solr/core/src/java/org/apache/solr/search/AqpLuceneQParserPlugin.java	(revision 0)
+++ solr/core/src/java/org/apache/solr/search/AqpLuceneQParserPlugin.java	(revision 0)
@@ -0,0 +1,47 @@
+package org.apache.solr.search;
+
+import org.apache.lucene.queryparser.flexible.aqp.AqpQueryParser;
+import org.apache.lucene.queryparser.flexible.aqp.parser.AqpExtendedLuceneParser;
+import org.apache.lucene.queryparser.flexible.core.QueryNodeParseException;
+import org.apache.solr.common.SolrException;
+import org.apache.solr.common.params.SolrParams;
+import org.apache.solr.common.util.NamedList;
+import org.apache.solr.request.SolrQueryRequest;
+
+/**
+ * An instance of ANTLR query parser. Implements the 
+ * standard lucene grammar together with support for 
+ * span queries.
+ */
+
+public class AqpLuceneQParserPlugin extends QParserPlugin {
+	public static String NAME = "lucene2";
+	
+	private String defaultField = "all";
+	
+	@SuppressWarnings("rawtypes")
+  public void init(NamedList args) {
+		NamedList defaults = (NamedList) args.get("defaults");
+		if (defaults != null) {
+			if (defaults.get("defaultField") != null) {
+				defaultField = (String) defaults.get("defaultField"); 
+			}
+		}
+	}
+
+	
+	public QParser createParser(String qstr, SolrParams localParams,
+			SolrParams params, SolrQueryRequest req) {
+		try {
+			AqpQueryParser parser = AqpExtendedLuceneParser.init();
+			
+			parser.setDefaultField(defaultField);
+			
+			return new AqpLuceneQParser(parser, qstr, localParams, params, req);
+		} catch (QueryNodeParseException e) {
+			throw new SolrException(SolrException.ErrorCode.SERVICE_UNAVAILABLE, e.getLocalizedMessage());
+		} catch (Exception e) {
+			throw new SolrException(SolrException.ErrorCode.SERVICE_UNAVAILABLE, e.getLocalizedMessage());
+		}
+	}
+}