3 package com
.google
.appengine
.api
.search
.query
;
5 import org
.antlr
.runtime
.*;
7 import org
.antlr
.runtime
.tree
.*;
9 public class QueryParser
extends Parser
{
10 public static final String
[] tokenNames
= new String
[] {
11 "<invalid>", "<EOR>", "<DOWN>", "<UP>", "ARGS", "CONJUNCTION", "DISJUNCTION", "FUNCTION", "FUZZY", "GLOBAL", "LITERAL", "NEGATION", "STRING", "SEQUENCE", "VALUE", "WS", "LE", "LT", "GE", "GT", "NE", "EQ", "HAS", "LPAREN", "RPAREN", "AND", "OR", "NOT", "DISTANCE_FN", "GEO_POINT_FN", "FIX", "REWRITE", "TEXT", "QUOTE", "ESC", "UNICODE_ESC", "OCTAL_ESC", "CHAR_SEQ", "DIGIT", "MID_CHAR", "ESCAPED_CHAR", "START_CHAR", "HEX_DIGIT", "'-'", "','", "'\\\\'"
13 public static final int FUNCTION
=7;
14 public static final int LT
=17;
15 public static final int GEO_POINT_FN
=29;
16 public static final int FIX
=30;
17 public static final int ESC
=34;
18 public static final int FUZZY
=8;
19 public static final int OCTAL_ESC
=36;
20 public static final int NOT
=27;
21 public static final int AND
=25;
22 public static final int DISTANCE_FN
=28;
23 public static final int EOF
=-1;
24 public static final int ESCAPED_CHAR
=40;
25 public static final int LPAREN
=23;
26 public static final int HAS
=22;
27 public static final int RPAREN
=24;
28 public static final int QUOTE
=33;
29 public static final int CHAR_SEQ
=37;
30 public static final int START_CHAR
=41;
31 public static final int ARGS
=4;
32 public static final int DIGIT
=38;
33 public static final int EQ
=21;
34 public static final int NE
=20;
35 public static final int T__43
=43;
36 public static final int GE
=18;
37 public static final int T__44
=44;
38 public static final int T__45
=45;
39 public static final int CONJUNCTION
=5;
40 public static final int UNICODE_ESC
=35;
41 public static final int HEX_DIGIT
=42;
42 public static final int LITERAL
=10;
43 public static final int VALUE
=14;
44 public static final int TEXT
=32;
45 public static final int REWRITE
=31;
46 public static final int SEQUENCE
=13;
47 public static final int DISJUNCTION
=6;
48 public static final int WS
=15;
49 public static final int NEGATION
=11;
50 public static final int OR
=26;
51 public static final int GT
=19;
52 public static final int GLOBAL
=9;
53 public static final int LE
=16;
54 public static final int MID_CHAR
=39;
55 public static final int STRING
=12;
57 public QueryParser(TokenStream input
) {
58 this(input
, new RecognizerSharedState());
60 public QueryParser(TokenStream input
, RecognizerSharedState state
) {
65 protected TreeAdaptor adaptor
= new CommonTreeAdaptor();
67 public void setTreeAdaptor(TreeAdaptor adaptor
) {
68 this.adaptor
= adaptor
;
70 public TreeAdaptor
getTreeAdaptor() {
74 public String
[] getTokenNames() { return QueryParser
.tokenNames
; }
75 public String
getGrammarFileName() { return "java/com/google/appengine/api/search/query/Query.g"; }
77 public static class query_return
extends ParserRuleReturnScope
{
79 public Object
getTree() { return tree
; }
82 public final QueryParser
.query_return
query() throws RecognitionException
{
83 QueryParser
.query_return retval
= new QueryParser
.query_return();
84 retval
.start
= input
.LT(1);
86 CommonTree root_0
= null;
91 QueryParser
.expression_return expression2
= null;
93 CommonTree WS1_tree
=null;
94 CommonTree WS3_tree
=null;
95 CommonTree EOF4_tree
=null;
96 RewriteRuleTokenStream stream_WS
=new RewriteRuleTokenStream(adaptor
,"token WS");
97 RewriteRuleTokenStream stream_EOF
=new RewriteRuleTokenStream(adaptor
,"token EOF");
98 RewriteRuleSubtreeStream stream_expression
=new RewriteRuleSubtreeStream(adaptor
,"rule expression");
104 int LA1_0
= input
.LA(1);
113 WS1
=(Token
)match(input
,WS
,FOLLOW_WS_in_query121
);
124 pushFollow(FOLLOW_expression_in_query124
);
125 expression2
=expression();
129 stream_expression
.add(expression2
.getTree());
133 int LA2_0
= input
.LA(1);
142 WS3
=(Token
)match(input
,WS
,FOLLOW_WS_in_query126
);
153 EOF4
=(Token
)match(input
,EOF
,FOLLOW_EOF_in_query129
);
154 stream_EOF
.add(EOF4
);
156 retval
.tree
= root_0
;
157 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
159 root_0
= (CommonTree
)adaptor
.nil();
161 adaptor
.addChild(root_0
, stream_expression
.nextTree());
165 retval
.tree
= root_0
;
168 retval
.stop
= input
.LT(-1);
170 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
171 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
175 catch (RecognitionException e
) {
184 public static class expression_return
extends ParserRuleReturnScope
{
186 public Object
getTree() { return tree
; }
189 public final QueryParser
.expression_return
expression() throws RecognitionException
{
190 QueryParser
.expression_return retval
= new QueryParser
.expression_return();
191 retval
.start
= input
.LT(1);
193 CommonTree root_0
= null;
195 QueryParser
.sequence_return sequence5
= null;
197 QueryParser
.andOp_return andOp6
= null;
199 QueryParser
.sequence_return sequence7
= null;
201 RewriteRuleSubtreeStream stream_sequence
=new RewriteRuleSubtreeStream(adaptor
,"rule sequence");
202 RewriteRuleSubtreeStream stream_andOp
=new RewriteRuleSubtreeStream(adaptor
,"rule andOp");
205 pushFollow(FOLLOW_sequence_in_expression148
);
206 sequence5
=sequence();
210 stream_sequence
.add(sequence5
.getTree());
214 alt3
= dfa3
.predict(input
);
218 pushFollow(FOLLOW_andOp_in_expression151
);
223 stream_andOp
.add(andOp6
.getTree());
224 pushFollow(FOLLOW_sequence_in_expression153
);
225 sequence7
=sequence();
229 stream_sequence
.add(sequence7
.getTree());
239 retval
.tree
= root_0
;
240 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
242 root_0
= (CommonTree
)adaptor
.nil();
245 CommonTree root_1
= (CommonTree
)adaptor
.nil();
246 root_1
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(CONJUNCTION
, "CONJUNCTION"), root_1
);
248 if ( !(stream_sequence
.hasNext()) ) {
249 throw new RewriteEarlyExitException();
251 while ( stream_sequence
.hasNext() ) {
252 adaptor
.addChild(root_1
, stream_sequence
.nextTree());
255 stream_sequence
.reset();
257 adaptor
.addChild(root_0
, root_1
);
262 retval
.tree
= root_0
;
265 retval
.stop
= input
.LT(-1);
267 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
268 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
272 catch (RecognitionException e
) {
281 public static class sequence_return
extends ParserRuleReturnScope
{
283 public Object
getTree() { return tree
; }
286 public final QueryParser
.sequence_return
sequence() throws RecognitionException
{
287 QueryParser
.sequence_return retval
= new QueryParser
.sequence_return();
288 retval
.start
= input
.LT(1);
290 CommonTree root_0
= null;
293 QueryParser
.factor_return factor8
= null;
295 QueryParser
.factor_return factor10
= null;
297 CommonTree WS9_tree
=null;
298 RewriteRuleTokenStream stream_WS
=new RewriteRuleTokenStream(adaptor
,"token WS");
299 RewriteRuleSubtreeStream stream_factor
=new RewriteRuleSubtreeStream(adaptor
,"rule factor");
302 pushFollow(FOLLOW_factor_in_sequence179
);
307 stream_factor
.add(factor8
.getTree());
311 alt5
= dfa5
.predict(input
);
319 int LA4_0
= input
.LA(1);
328 WS9
=(Token
)match(input
,WS
,FOLLOW_WS_in_sequence182
);
335 if ( cnt4
>= 1 ) break loop4
;
336 EarlyExitException eee
=
337 new EarlyExitException(4, input
);
343 pushFollow(FOLLOW_factor_in_sequence185
);
348 stream_factor
.add(factor10
.getTree());
358 retval
.tree
= root_0
;
359 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
361 root_0
= (CommonTree
)adaptor
.nil();
364 CommonTree root_1
= (CommonTree
)adaptor
.nil();
365 root_1
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(SEQUENCE
, "SEQUENCE"), root_1
);
367 if ( !(stream_factor
.hasNext()) ) {
368 throw new RewriteEarlyExitException();
370 while ( stream_factor
.hasNext() ) {
371 adaptor
.addChild(root_1
, stream_factor
.nextTree());
374 stream_factor
.reset();
376 adaptor
.addChild(root_0
, root_1
);
381 retval
.tree
= root_0
;
384 retval
.stop
= input
.LT(-1);
386 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
387 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
391 catch (RecognitionException e
) {
400 public static class factor_return
extends ParserRuleReturnScope
{
402 public Object
getTree() { return tree
; }
405 public final QueryParser
.factor_return
factor() throws RecognitionException
{
406 QueryParser
.factor_return retval
= new QueryParser
.factor_return();
407 retval
.start
= input
.LT(1);
409 CommonTree root_0
= null;
411 QueryParser
.term_return term11
= null;
413 QueryParser
.orOp_return orOp12
= null;
415 QueryParser
.term_return term13
= null;
417 RewriteRuleSubtreeStream stream_orOp
=new RewriteRuleSubtreeStream(adaptor
,"rule orOp");
418 RewriteRuleSubtreeStream stream_term
=new RewriteRuleSubtreeStream(adaptor
,"rule term");
421 pushFollow(FOLLOW_term_in_factor211
);
426 stream_term
.add(term11
.getTree());
430 alt6
= dfa6
.predict(input
);
434 pushFollow(FOLLOW_orOp_in_factor214
);
439 stream_orOp
.add(orOp12
.getTree());
440 pushFollow(FOLLOW_term_in_factor216
);
445 stream_term
.add(term13
.getTree());
455 retval
.tree
= root_0
;
456 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
458 root_0
= (CommonTree
)adaptor
.nil();
461 CommonTree root_1
= (CommonTree
)adaptor
.nil();
462 root_1
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(DISJUNCTION
, "DISJUNCTION"), root_1
);
464 if ( !(stream_term
.hasNext()) ) {
465 throw new RewriteEarlyExitException();
467 while ( stream_term
.hasNext() ) {
468 adaptor
.addChild(root_1
, stream_term
.nextTree());
473 adaptor
.addChild(root_0
, root_1
);
478 retval
.tree
= root_0
;
481 retval
.stop
= input
.LT(-1);
483 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
484 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
488 catch (RecognitionException e
) {
497 public static class term_return
extends ParserRuleReturnScope
{
499 public Object
getTree() { return tree
; }
502 public final QueryParser
.term_return
term() throws RecognitionException
{
503 QueryParser
.term_return retval
= new QueryParser
.term_return();
504 retval
.start
= input
.LT(1);
506 CommonTree root_0
= null;
508 QueryParser
.notOp_return notOp14
= null;
510 QueryParser
.primitive_return primitive15
= null;
512 QueryParser
.primitive_return primitive16
= null;
514 RewriteRuleSubtreeStream stream_notOp
=new RewriteRuleSubtreeStream(adaptor
,"rule notOp");
515 RewriteRuleSubtreeStream stream_primitive
=new RewriteRuleSubtreeStream(adaptor
,"rule primitive");
518 int LA7_0
= input
.LA(1);
520 if ( (LA7_0
==NOT
||LA7_0
==43) ) {
523 else if ( (LA7_0
==LPAREN
||(LA7_0
>=DISTANCE_FN
&& LA7_0
<=QUOTE
)) ) {
527 NoViableAltException nvae
=
528 new NoViableAltException("", 7, 0, input
);
535 pushFollow(FOLLOW_notOp_in_term240
);
540 stream_notOp
.add(notOp14
.getTree());
541 pushFollow(FOLLOW_primitive_in_term242
);
542 primitive15
=primitive();
546 stream_primitive
.add(primitive15
.getTree());
548 retval
.tree
= root_0
;
549 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
551 root_0
= (CommonTree
)adaptor
.nil();
554 CommonTree root_1
= (CommonTree
)adaptor
.nil();
555 root_1
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(NEGATION
, "NEGATION"), root_1
);
557 adaptor
.addChild(root_1
, stream_primitive
.nextTree());
559 adaptor
.addChild(root_0
, root_1
);
564 retval
.tree
= root_0
;
569 root_0
= (CommonTree
)adaptor
.nil();
571 pushFollow(FOLLOW_primitive_in_term256
);
572 primitive16
=primitive();
576 adaptor
.addChild(root_0
, primitive16
.getTree());
582 retval
.stop
= input
.LT(-1);
584 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
585 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
589 catch (RecognitionException e
) {
598 public static class primitive_return
extends ParserRuleReturnScope
{
600 public Object
getTree() { return tree
; }
603 public final QueryParser
.primitive_return
primitive() throws RecognitionException
{
604 QueryParser
.primitive_return retval
= new QueryParser
.primitive_return();
605 retval
.start
= input
.LT(1);
607 CommonTree root_0
= null;
609 QueryParser
.restrict_return restrict17
= null;
611 QueryParser
.composite_return composite18
= null;
613 QueryParser
.item_return item19
= null;
615 RewriteRuleSubtreeStream stream_item
=new RewriteRuleSubtreeStream(adaptor
,"rule item");
618 alt8
= dfa8
.predict(input
);
622 root_0
= (CommonTree
)adaptor
.nil();
624 pushFollow(FOLLOW_restrict_in_primitive272
);
625 restrict17
=restrict();
629 adaptor
.addChild(root_0
, restrict17
.getTree());
635 root_0
= (CommonTree
)adaptor
.nil();
637 pushFollow(FOLLOW_composite_in_primitive278
);
638 composite18
=composite();
642 adaptor
.addChild(root_0
, composite18
.getTree());
648 pushFollow(FOLLOW_item_in_primitive284
);
653 stream_item
.add(item19
.getTree());
655 retval
.tree
= root_0
;
656 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
658 root_0
= (CommonTree
)adaptor
.nil();
661 CommonTree root_1
= (CommonTree
)adaptor
.nil();
662 root_1
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(HAS
, "HAS"), root_1
);
664 adaptor
.addChild(root_1
, (CommonTree
)adaptor
.create(GLOBAL
, "GLOBAL"));
665 adaptor
.addChild(root_1
, stream_item
.nextTree());
667 adaptor
.addChild(root_0
, root_1
);
672 retval
.tree
= root_0
;
677 retval
.stop
= input
.LT(-1);
679 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
680 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
684 catch (RecognitionException e
) {
693 public static class restrict_return
extends ParserRuleReturnScope
{
695 public Object
getTree() { return tree
; }
698 public final QueryParser
.restrict_return
restrict() throws RecognitionException
{
699 QueryParser
.restrict_return retval
= new QueryParser
.restrict_return();
700 retval
.start
= input
.LT(1);
702 CommonTree root_0
= null;
704 QueryParser
.comparable_return comparable20
= null;
706 QueryParser
.comparator_return comparator21
= null;
708 QueryParser
.arg_return arg22
= null;
710 RewriteRuleSubtreeStream stream_arg
=new RewriteRuleSubtreeStream(adaptor
,"rule arg");
711 RewriteRuleSubtreeStream stream_comparable
=new RewriteRuleSubtreeStream(adaptor
,"rule comparable");
712 RewriteRuleSubtreeStream stream_comparator
=new RewriteRuleSubtreeStream(adaptor
,"rule comparator");
715 pushFollow(FOLLOW_comparable_in_restrict310
);
716 comparable20
=comparable();
720 stream_comparable
.add(comparable20
.getTree());
721 pushFollow(FOLLOW_comparator_in_restrict312
);
722 comparator21
=comparator();
726 stream_comparator
.add(comparator21
.getTree());
727 pushFollow(FOLLOW_arg_in_restrict314
);
732 stream_arg
.add(arg22
.getTree());
734 retval
.tree
= root_0
;
735 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
737 root_0
= (CommonTree
)adaptor
.nil();
740 CommonTree root_1
= (CommonTree
)adaptor
.nil();
741 root_1
= (CommonTree
)adaptor
.becomeRoot(stream_comparator
.nextNode(), root_1
);
743 adaptor
.addChild(root_1
, stream_comparable
.nextTree());
744 adaptor
.addChild(root_1
, stream_arg
.nextTree());
746 adaptor
.addChild(root_0
, root_1
);
751 retval
.tree
= root_0
;
754 retval
.stop
= input
.LT(-1);
756 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
757 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
761 catch (RecognitionException e
) {
770 public static class comparator_return
extends ParserRuleReturnScope
{
772 public Object
getTree() { return tree
; }
775 public final QueryParser
.comparator_return
comparator() throws RecognitionException
{
776 QueryParser
.comparator_return retval
= new QueryParser
.comparator_return();
777 retval
.start
= input
.LT(1);
779 CommonTree root_0
= null;
785 CommonTree x_tree
=null;
786 CommonTree WS23_tree
=null;
787 CommonTree WS24_tree
=null;
788 RewriteRuleTokenStream stream_HAS
=new RewriteRuleTokenStream(adaptor
,"token HAS");
789 RewriteRuleTokenStream stream_GE
=new RewriteRuleTokenStream(adaptor
,"token GE");
790 RewriteRuleTokenStream stream_GT
=new RewriteRuleTokenStream(adaptor
,"token GT");
791 RewriteRuleTokenStream stream_LT
=new RewriteRuleTokenStream(adaptor
,"token LT");
792 RewriteRuleTokenStream stream_WS
=new RewriteRuleTokenStream(adaptor
,"token WS");
793 RewriteRuleTokenStream stream_EQ
=new RewriteRuleTokenStream(adaptor
,"token EQ");
794 RewriteRuleTokenStream stream_LE
=new RewriteRuleTokenStream(adaptor
,"token LE");
795 RewriteRuleTokenStream stream_NE
=new RewriteRuleTokenStream(adaptor
,"token NE");
802 int LA9_0
= input
.LA(1);
811 WS23
=(Token
)match(input
,WS
,FOLLOW_WS_in_comparator338
);
823 switch ( input
.LA(1) ) {
860 NoViableAltException nvae
=
861 new NoViableAltException("", 10, 0, input
);
869 x
=(Token
)match(input
,LE
,FOLLOW_LE_in_comparator344
);
876 x
=(Token
)match(input
,LT
,FOLLOW_LT_in_comparator350
);
883 x
=(Token
)match(input
,GE
,FOLLOW_GE_in_comparator356
);
890 x
=(Token
)match(input
,GT
,FOLLOW_GT_in_comparator362
);
897 x
=(Token
)match(input
,NE
,FOLLOW_NE_in_comparator368
);
904 x
=(Token
)match(input
,EQ
,FOLLOW_EQ_in_comparator374
);
911 x
=(Token
)match(input
,HAS
,FOLLOW_HAS_in_comparator380
);
922 int LA11_0
= input
.LA(1);
924 if ( (LA11_0
==WS
) ) {
931 WS24
=(Token
)match(input
,WS
,FOLLOW_WS_in_comparator383
);
942 retval
.tree
= root_0
;
943 RewriteRuleTokenStream stream_x
=new RewriteRuleTokenStream(adaptor
,"token x",x
);
944 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
946 root_0
= (CommonTree
)adaptor
.nil();
948 adaptor
.addChild(root_0
, stream_x
.nextNode());
952 retval
.tree
= root_0
;
955 retval
.stop
= input
.LT(-1);
957 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
958 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
962 catch (RecognitionException e
) {
971 public static class comparable_return
extends ParserRuleReturnScope
{
973 public Object
getTree() { return tree
; }
976 public final QueryParser
.comparable_return
comparable() throws RecognitionException
{
977 QueryParser
.comparable_return retval
= new QueryParser
.comparable_return();
978 retval
.start
= input
.LT(1);
980 CommonTree root_0
= null;
982 QueryParser
.item_return item25
= null;
984 QueryParser
.function_return function26
= null;
988 int LA12_0
= input
.LA(1);
990 if ( ((LA12_0
>=FIX
&& LA12_0
<=QUOTE
)) ) {
993 else if ( ((LA12_0
>=DISTANCE_FN
&& LA12_0
<=GEO_POINT_FN
)) ) {
994 int LA12_2
= input
.LA(2);
996 if ( ((LA12_2
>=WS
&& LA12_2
<=HAS
)) ) {
999 else if ( (LA12_2
==LPAREN
) ) {
1003 NoViableAltException nvae
=
1004 new NoViableAltException("", 12, 2, input
);
1010 NoViableAltException nvae
=
1011 new NoViableAltException("", 12, 0, input
);
1018 root_0
= (CommonTree
)adaptor
.nil();
1020 pushFollow(FOLLOW_item_in_comparable405
);
1025 adaptor
.addChild(root_0
, item25
.getTree());
1031 root_0
= (CommonTree
)adaptor
.nil();
1033 pushFollow(FOLLOW_function_in_comparable411
);
1034 function26
=function();
1038 adaptor
.addChild(root_0
, function26
.getTree());
1044 retval
.stop
= input
.LT(-1);
1046 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1047 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1051 catch (RecognitionException e
) {
1060 public static class function_return
extends ParserRuleReturnScope
{
1062 public Object
getTree() { return tree
; }
1065 public final QueryParser
.function_return
function() throws RecognitionException
{
1066 QueryParser
.function_return retval
= new QueryParser
.function_return();
1067 retval
.start
= input
.LT(1);
1069 CommonTree root_0
= null;
1071 Token LPAREN28
=null;
1072 Token RPAREN30
=null;
1073 QueryParser
.fnname_return fnname27
= null;
1075 QueryParser
.arglist_return arglist29
= null;
1077 CommonTree LPAREN28_tree
=null;
1078 CommonTree RPAREN30_tree
=null;
1079 RewriteRuleTokenStream stream_RPAREN
=new RewriteRuleTokenStream(adaptor
,"token RPAREN");
1080 RewriteRuleTokenStream stream_LPAREN
=new RewriteRuleTokenStream(adaptor
,"token LPAREN");
1081 RewriteRuleSubtreeStream stream_arglist
=new RewriteRuleSubtreeStream(adaptor
,"rule arglist");
1082 RewriteRuleSubtreeStream stream_fnname
=new RewriteRuleSubtreeStream(adaptor
,"rule fnname");
1085 pushFollow(FOLLOW_fnname_in_function426
);
1090 stream_fnname
.add(fnname27
.getTree());
1091 LPAREN28
=(Token
)match(input
,LPAREN
,FOLLOW_LPAREN_in_function428
);
1092 stream_LPAREN
.add(LPAREN28
);
1094 pushFollow(FOLLOW_arglist_in_function430
);
1095 arglist29
=arglist();
1099 stream_arglist
.add(arglist29
.getTree());
1100 RPAREN30
=(Token
)match(input
,RPAREN
,FOLLOW_RPAREN_in_function432
);
1101 stream_RPAREN
.add(RPAREN30
);
1103 retval
.tree
= root_0
;
1104 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1106 root_0
= (CommonTree
)adaptor
.nil();
1109 CommonTree root_1
= (CommonTree
)adaptor
.nil();
1110 root_1
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(FUNCTION
, "FUNCTION"), root_1
);
1112 adaptor
.addChild(root_1
, stream_fnname
.nextTree());
1114 CommonTree root_2
= (CommonTree
)adaptor
.nil();
1115 root_2
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(ARGS
, "ARGS"), root_2
);
1117 adaptor
.addChild(root_2
, stream_arglist
.nextTree());
1119 adaptor
.addChild(root_1
, root_2
);
1122 adaptor
.addChild(root_0
, root_1
);
1127 retval
.tree
= root_0
;
1130 retval
.stop
= input
.LT(-1);
1132 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1133 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1137 catch (RecognitionException e
) {
1146 public static class arglist_return
extends ParserRuleReturnScope
{
1148 public Object
getTree() { return tree
; }
1151 public final QueryParser
.arglist_return
arglist() throws RecognitionException
{
1152 QueryParser
.arglist_return retval
= new QueryParser
.arglist_return();
1153 retval
.start
= input
.LT(1);
1155 CommonTree root_0
= null;
1157 QueryParser
.arg_return arg31
= null;
1159 QueryParser
.sep_return sep32
= null;
1161 QueryParser
.arg_return arg33
= null;
1163 RewriteRuleSubtreeStream stream_arg
=new RewriteRuleSubtreeStream(adaptor
,"rule arg");
1164 RewriteRuleSubtreeStream stream_sep
=new RewriteRuleSubtreeStream(adaptor
,"rule sep");
1167 int LA14_0
= input
.LA(1);
1169 if ( (LA14_0
==LPAREN
||(LA14_0
>=DISTANCE_FN
&& LA14_0
<=QUOTE
)) ) {
1172 else if ( (LA14_0
==RPAREN
) ) {
1176 NoViableAltException nvae
=
1177 new NoViableAltException("", 14, 0, input
);
1184 pushFollow(FOLLOW_arg_in_arglist461
);
1189 stream_arg
.add(arg31
.getTree());
1193 int LA13_0
= input
.LA(1);
1195 if ( (LA13_0
==WS
||LA13_0
==44) ) {
1202 pushFollow(FOLLOW_sep_in_arglist464
);
1207 stream_sep
.add(sep32
.getTree());
1208 pushFollow(FOLLOW_arg_in_arglist466
);
1213 stream_arg
.add(arg33
.getTree());
1223 retval
.tree
= root_0
;
1224 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1226 root_0
= (CommonTree
)adaptor
.nil();
1228 while ( stream_arg
.hasNext() ) {
1229 adaptor
.addChild(root_0
, stream_arg
.nextTree());
1236 retval
.tree
= root_0
;
1241 root_0
= (CommonTree
)adaptor
.nil();
1247 retval
.stop
= input
.LT(-1);
1249 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1250 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1254 catch (RecognitionException e
) {
1263 public static class arg_return
extends ParserRuleReturnScope
{
1265 public Object
getTree() { return tree
; }
1268 public final QueryParser
.arg_return
arg() throws RecognitionException
{
1269 QueryParser
.arg_return retval
= new QueryParser
.arg_return();
1270 retval
.start
= input
.LT(1);
1272 CommonTree root_0
= null;
1274 QueryParser
.item_return item34
= null;
1276 QueryParser
.composite_return composite35
= null;
1278 QueryParser
.function_return function36
= null;
1282 switch ( input
.LA(1) ) {
1294 int LA15_2
= input
.LA(2);
1296 if ( (LA15_2
==EOF
||LA15_2
==WS
||LA15_2
==RPAREN
||LA15_2
==44) ) {
1299 else if ( (LA15_2
==LPAREN
) ) {
1303 NoViableAltException nvae
=
1304 new NoViableAltException("", 15, 2, input
);
1316 NoViableAltException nvae
=
1317 new NoViableAltException("", 15, 0, input
);
1325 root_0
= (CommonTree
)adaptor
.nil();
1327 pushFollow(FOLLOW_item_in_arg491
);
1332 adaptor
.addChild(root_0
, item34
.getTree());
1338 root_0
= (CommonTree
)adaptor
.nil();
1340 pushFollow(FOLLOW_composite_in_arg497
);
1341 composite35
=composite();
1345 adaptor
.addChild(root_0
, composite35
.getTree());
1351 root_0
= (CommonTree
)adaptor
.nil();
1353 pushFollow(FOLLOW_function_in_arg503
);
1354 function36
=function();
1358 adaptor
.addChild(root_0
, function36
.getTree());
1364 retval
.stop
= input
.LT(-1);
1366 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1367 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1371 catch (RecognitionException e
) {
1380 public static class andOp_return
extends ParserRuleReturnScope
{
1382 public Object
getTree() { return tree
; }
1385 public final QueryParser
.andOp_return
andOp() throws RecognitionException
{
1386 QueryParser
.andOp_return retval
= new QueryParser
.andOp_return();
1387 retval
.start
= input
.LT(1);
1389 CommonTree root_0
= null;
1395 CommonTree WS37_tree
=null;
1396 CommonTree AND38_tree
=null;
1397 CommonTree WS39_tree
=null;
1401 root_0
= (CommonTree
)adaptor
.nil();
1407 int LA16_0
= input
.LA(1);
1409 if ( (LA16_0
==WS
) ) {
1416 WS37
=(Token
)match(input
,WS
,FOLLOW_WS_in_andOp517
);
1417 WS37_tree
= (CommonTree
)adaptor
.create(WS37
);
1418 adaptor
.addChild(root_0
, WS37_tree
);
1424 if ( cnt16
>= 1 ) break loop16
;
1425 EarlyExitException eee
=
1426 new EarlyExitException(16, input
);
1432 AND38
=(Token
)match(input
,AND
,FOLLOW_AND_in_andOp520
);
1433 AND38_tree
= (CommonTree
)adaptor
.create(AND38
);
1434 adaptor
.addChild(root_0
, AND38_tree
);
1440 int LA17_0
= input
.LA(1);
1442 if ( (LA17_0
==WS
) ) {
1449 WS39
=(Token
)match(input
,WS
,FOLLOW_WS_in_andOp522
);
1450 WS39_tree
= (CommonTree
)adaptor
.create(WS39
);
1451 adaptor
.addChild(root_0
, WS39_tree
);
1457 if ( cnt17
>= 1 ) break loop17
;
1458 EarlyExitException eee
=
1459 new EarlyExitException(17, input
);
1467 retval
.stop
= input
.LT(-1);
1469 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1470 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1474 catch (RecognitionException e
) {
1483 public static class orOp_return
extends ParserRuleReturnScope
{
1485 public Object
getTree() { return tree
; }
1488 public final QueryParser
.orOp_return
orOp() throws RecognitionException
{
1489 QueryParser
.orOp_return retval
= new QueryParser
.orOp_return();
1490 retval
.start
= input
.LT(1);
1492 CommonTree root_0
= null;
1498 CommonTree WS40_tree
=null;
1499 CommonTree OR41_tree
=null;
1500 CommonTree WS42_tree
=null;
1504 root_0
= (CommonTree
)adaptor
.nil();
1510 int LA18_0
= input
.LA(1);
1512 if ( (LA18_0
==WS
) ) {
1519 WS40
=(Token
)match(input
,WS
,FOLLOW_WS_in_orOp537
);
1520 WS40_tree
= (CommonTree
)adaptor
.create(WS40
);
1521 adaptor
.addChild(root_0
, WS40_tree
);
1527 if ( cnt18
>= 1 ) break loop18
;
1528 EarlyExitException eee
=
1529 new EarlyExitException(18, input
);
1535 OR41
=(Token
)match(input
,OR
,FOLLOW_OR_in_orOp540
);
1536 OR41_tree
= (CommonTree
)adaptor
.create(OR41
);
1537 adaptor
.addChild(root_0
, OR41_tree
);
1543 int LA19_0
= input
.LA(1);
1545 if ( (LA19_0
==WS
) ) {
1552 WS42
=(Token
)match(input
,WS
,FOLLOW_WS_in_orOp542
);
1553 WS42_tree
= (CommonTree
)adaptor
.create(WS42
);
1554 adaptor
.addChild(root_0
, WS42_tree
);
1560 if ( cnt19
>= 1 ) break loop19
;
1561 EarlyExitException eee
=
1562 new EarlyExitException(19, input
);
1570 retval
.stop
= input
.LT(-1);
1572 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1573 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1577 catch (RecognitionException e
) {
1586 public static class notOp_return
extends ParserRuleReturnScope
{
1588 public Object
getTree() { return tree
; }
1591 public final QueryParser
.notOp_return
notOp() throws RecognitionException
{
1592 QueryParser
.notOp_return retval
= new QueryParser
.notOp_return();
1593 retval
.start
= input
.LT(1);
1595 CommonTree root_0
= null;
1597 Token char_literal43
=null;
1601 CommonTree char_literal43_tree
=null;
1602 CommonTree NOT44_tree
=null;
1603 CommonTree WS45_tree
=null;
1607 int LA21_0
= input
.LA(1);
1609 if ( (LA21_0
==43) ) {
1612 else if ( (LA21_0
==NOT
) ) {
1616 NoViableAltException nvae
=
1617 new NoViableAltException("", 21, 0, input
);
1624 root_0
= (CommonTree
)adaptor
.nil();
1626 char_literal43
=(Token
)match(input
,43,FOLLOW_43_in_notOp557
);
1627 char_literal43_tree
= (CommonTree
)adaptor
.create(char_literal43
);
1628 adaptor
.addChild(root_0
, char_literal43_tree
);
1634 root_0
= (CommonTree
)adaptor
.nil();
1636 NOT44
=(Token
)match(input
,NOT
,FOLLOW_NOT_in_notOp563
);
1637 NOT44_tree
= (CommonTree
)adaptor
.create(NOT44
);
1638 adaptor
.addChild(root_0
, NOT44_tree
);
1644 int LA20_0
= input
.LA(1);
1646 if ( (LA20_0
==WS
) ) {
1653 WS45
=(Token
)match(input
,WS
,FOLLOW_WS_in_notOp565
);
1654 WS45_tree
= (CommonTree
)adaptor
.create(WS45
);
1655 adaptor
.addChild(root_0
, WS45_tree
);
1661 if ( cnt20
>= 1 ) break loop20
;
1662 EarlyExitException eee
=
1663 new EarlyExitException(20, input
);
1673 retval
.stop
= input
.LT(-1);
1675 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1676 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1680 catch (RecognitionException e
) {
1689 public static class sep_return
extends ParserRuleReturnScope
{
1691 public Object
getTree() { return tree
; }
1694 public final QueryParser
.sep_return
sep() throws RecognitionException
{
1695 QueryParser
.sep_return retval
= new QueryParser
.sep_return();
1696 retval
.start
= input
.LT(1);
1698 CommonTree root_0
= null;
1701 Token char_literal47
=null;
1704 CommonTree WS46_tree
=null;
1705 CommonTree char_literal47_tree
=null;
1706 CommonTree WS48_tree
=null;
1710 root_0
= (CommonTree
)adaptor
.nil();
1715 int LA22_0
= input
.LA(1);
1717 if ( (LA22_0
==WS
) ) {
1724 WS46
=(Token
)match(input
,WS
,FOLLOW_WS_in_sep580
);
1725 WS46_tree
= (CommonTree
)adaptor
.create(WS46
);
1726 adaptor
.addChild(root_0
, WS46_tree
);
1736 char_literal47
=(Token
)match(input
,44,FOLLOW_44_in_sep583
);
1737 char_literal47_tree
= (CommonTree
)adaptor
.create(char_literal47
);
1738 adaptor
.addChild(root_0
, char_literal47_tree
);
1743 int LA23_0
= input
.LA(1);
1745 if ( (LA23_0
==WS
) ) {
1752 WS48
=(Token
)match(input
,WS
,FOLLOW_WS_in_sep585
);
1753 WS48_tree
= (CommonTree
)adaptor
.create(WS48
);
1754 adaptor
.addChild(root_0
, WS48_tree
);
1766 retval
.stop
= input
.LT(-1);
1768 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1769 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1773 catch (RecognitionException e
) {
1782 public static class fnname_return
extends ParserRuleReturnScope
{
1784 public Object
getTree() { return tree
; }
1787 public final QueryParser
.fnname_return
fnname() throws RecognitionException
{
1788 QueryParser
.fnname_return retval
= new QueryParser
.fnname_return();
1789 retval
.start
= input
.LT(1);
1791 CommonTree root_0
= null;
1795 CommonTree set49_tree
=null;
1799 root_0
= (CommonTree
)adaptor
.nil();
1801 set49
=(Token
)input
.LT(1);
1802 if ( (input
.LA(1)>=DISTANCE_FN
&& input
.LA(1)<=GEO_POINT_FN
) ) {
1804 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(set49
));
1805 state
.errorRecovery
=false;
1808 MismatchedSetException mse
= new MismatchedSetException(null,input
);
1814 retval
.stop
= input
.LT(-1);
1816 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1817 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1821 catch (RecognitionException e
) {
1830 public static class composite_return
extends ParserRuleReturnScope
{
1832 public Object
getTree() { return tree
; }
1835 public final QueryParser
.composite_return
composite() throws RecognitionException
{
1836 QueryParser
.composite_return retval
= new QueryParser
.composite_return();
1837 retval
.start
= input
.LT(1);
1839 CommonTree root_0
= null;
1841 Token LPAREN50
=null;
1844 Token RPAREN54
=null;
1845 QueryParser
.expression_return expression52
= null;
1847 CommonTree LPAREN50_tree
=null;
1848 CommonTree WS51_tree
=null;
1849 CommonTree WS53_tree
=null;
1850 CommonTree RPAREN54_tree
=null;
1851 RewriteRuleTokenStream stream_RPAREN
=new RewriteRuleTokenStream(adaptor
,"token RPAREN");
1852 RewriteRuleTokenStream stream_WS
=new RewriteRuleTokenStream(adaptor
,"token WS");
1853 RewriteRuleTokenStream stream_LPAREN
=new RewriteRuleTokenStream(adaptor
,"token LPAREN");
1854 RewriteRuleSubtreeStream stream_expression
=new RewriteRuleSubtreeStream(adaptor
,"rule expression");
1857 LPAREN50
=(Token
)match(input
,LPAREN
,FOLLOW_LPAREN_in_composite621
);
1858 stream_LPAREN
.add(LPAREN50
);
1863 int LA24_0
= input
.LA(1);
1865 if ( (LA24_0
==WS
) ) {
1872 WS51
=(Token
)match(input
,WS
,FOLLOW_WS_in_composite623
);
1873 stream_WS
.add(WS51
);
1883 pushFollow(FOLLOW_expression_in_composite626
);
1884 expression52
=expression();
1888 stream_expression
.add(expression52
.getTree());
1892 int LA25_0
= input
.LA(1);
1894 if ( (LA25_0
==WS
) ) {
1901 WS53
=(Token
)match(input
,WS
,FOLLOW_WS_in_composite628
);
1902 stream_WS
.add(WS53
);
1912 RPAREN54
=(Token
)match(input
,RPAREN
,FOLLOW_RPAREN_in_composite631
);
1913 stream_RPAREN
.add(RPAREN54
);
1915 retval
.tree
= root_0
;
1916 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1918 root_0
= (CommonTree
)adaptor
.nil();
1920 adaptor
.addChild(root_0
, stream_expression
.nextTree());
1924 retval
.tree
= root_0
;
1927 retval
.stop
= input
.LT(-1);
1929 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1930 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1934 catch (RecognitionException e
) {
1943 public static class item_return
extends ParserRuleReturnScope
{
1945 public Object
getTree() { return tree
; }
1948 public final QueryParser
.item_return
item() throws RecognitionException
{
1949 QueryParser
.item_return retval
= new QueryParser
.item_return();
1950 retval
.start
= input
.LT(1);
1952 CommonTree root_0
= null;
1955 Token REWRITE57
=null;
1956 QueryParser
.value_return value56
= null;
1958 QueryParser
.value_return value58
= null;
1960 QueryParser
.value_return value59
= null;
1962 CommonTree FIX55_tree
=null;
1963 CommonTree REWRITE57_tree
=null;
1964 RewriteRuleTokenStream stream_FIX
=new RewriteRuleTokenStream(adaptor
,"token FIX");
1965 RewriteRuleTokenStream stream_REWRITE
=new RewriteRuleTokenStream(adaptor
,"token REWRITE");
1966 RewriteRuleSubtreeStream stream_value
=new RewriteRuleSubtreeStream(adaptor
,"rule value");
1969 switch ( input
.LA(1) ) {
1989 NoViableAltException nvae
=
1990 new NoViableAltException("", 26, 0, input
);
1998 FIX55
=(Token
)match(input
,FIX
,FOLLOW_FIX_in_item651
);
1999 stream_FIX
.add(FIX55
);
2001 pushFollow(FOLLOW_value_in_item653
);
2006 stream_value
.add(value56
.getTree());
2008 retval
.tree
= root_0
;
2009 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
2011 root_0
= (CommonTree
)adaptor
.nil();
2014 CommonTree root_1
= (CommonTree
)adaptor
.nil();
2015 root_1
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(LITERAL
, "LITERAL"), root_1
);
2017 adaptor
.addChild(root_1
, stream_value
.nextTree());
2019 adaptor
.addChild(root_0
, root_1
);
2024 retval
.tree
= root_0
;
2029 REWRITE57
=(Token
)match(input
,REWRITE
,FOLLOW_REWRITE_in_item667
);
2030 stream_REWRITE
.add(REWRITE57
);
2032 pushFollow(FOLLOW_value_in_item669
);
2037 stream_value
.add(value58
.getTree());
2039 retval
.tree
= root_0
;
2040 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
2042 root_0
= (CommonTree
)adaptor
.nil();
2045 CommonTree root_1
= (CommonTree
)adaptor
.nil();
2046 root_1
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(FUZZY
, "FUZZY"), root_1
);
2048 adaptor
.addChild(root_1
, stream_value
.nextTree());
2050 adaptor
.addChild(root_0
, root_1
);
2055 retval
.tree
= root_0
;
2060 pushFollow(FOLLOW_value_in_item683
);
2065 stream_value
.add(value59
.getTree());
2067 retval
.tree
= root_0
;
2068 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
2070 root_0
= (CommonTree
)adaptor
.nil();
2072 adaptor
.addChild(root_0
, stream_value
.nextTree());
2076 retval
.tree
= root_0
;
2081 retval
.stop
= input
.LT(-1);
2083 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
2084 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
2088 catch (RecognitionException e
) {
2097 public static class value_return
extends ParserRuleReturnScope
{
2099 public Object
getTree() { return tree
; }
2102 public final QueryParser
.value_return
value() throws RecognitionException
{
2103 QueryParser
.value_return retval
= new QueryParser
.value_return();
2104 retval
.start
= input
.LT(1);
2106 CommonTree root_0
= null;
2108 QueryParser
.text_return text60
= null;
2110 QueryParser
.phrase_return phrase61
= null;
2112 RewriteRuleSubtreeStream stream_text
=new RewriteRuleSubtreeStream(adaptor
,"rule text");
2113 RewriteRuleSubtreeStream stream_phrase
=new RewriteRuleSubtreeStream(adaptor
,"rule phrase");
2116 int LA27_0
= input
.LA(1);
2118 if ( ((LA27_0
>=DISTANCE_FN
&& LA27_0
<=GEO_POINT_FN
)||LA27_0
==TEXT
) ) {
2121 else if ( (LA27_0
==QUOTE
) ) {
2125 NoViableAltException nvae
=
2126 new NoViableAltException("", 27, 0, input
);
2133 pushFollow(FOLLOW_text_in_value701
);
2138 stream_text
.add(text60
.getTree());
2140 retval
.tree
= root_0
;
2141 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
2143 root_0
= (CommonTree
)adaptor
.nil();
2146 CommonTree root_1
= (CommonTree
)adaptor
.nil();
2147 root_1
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(VALUE
, "VALUE"), root_1
);
2149 adaptor
.addChild(root_1
, (CommonTree
)adaptor
.create(TEXT
, "TEXT"));
2150 adaptor
.addChild(root_1
, stream_text
.nextTree());
2152 adaptor
.addChild(root_0
, root_1
);
2157 retval
.tree
= root_0
;
2162 pushFollow(FOLLOW_phrase_in_value717
);
2167 stream_phrase
.add(phrase61
.getTree());
2169 retval
.tree
= root_0
;
2170 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
2172 root_0
= (CommonTree
)adaptor
.nil();
2175 CommonTree root_1
= (CommonTree
)adaptor
.nil();
2176 root_1
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(VALUE
, "VALUE"), root_1
);
2178 adaptor
.addChild(root_1
, (CommonTree
)adaptor
.create(STRING
, "STRING"));
2179 adaptor
.addChild(root_1
, stream_phrase
.nextTree());
2181 adaptor
.addChild(root_0
, root_1
);
2186 retval
.tree
= root_0
;
2191 retval
.stop
= input
.LT(-1);
2193 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
2194 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
2198 catch (RecognitionException e
) {
2207 public static class text_return
extends ParserRuleReturnScope
{
2209 public Object
getTree() { return tree
; }
2212 public final QueryParser
.text_return
text() throws RecognitionException
{
2213 QueryParser
.text_return retval
= new QueryParser
.text_return();
2214 retval
.start
= input
.LT(1);
2216 CommonTree root_0
= null;
2220 CommonTree set62_tree
=null;
2224 root_0
= (CommonTree
)adaptor
.nil();
2226 set62
=(Token
)input
.LT(1);
2227 if ( (input
.LA(1)>=DISTANCE_FN
&& input
.LA(1)<=GEO_POINT_FN
)||input
.LA(1)==TEXT
) {
2229 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(set62
));
2230 state
.errorRecovery
=false;
2233 MismatchedSetException mse
= new MismatchedSetException(null,input
);
2239 retval
.stop
= input
.LT(-1);
2241 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
2242 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
2246 catch (RecognitionException e
) {
2255 public static class phrase_return
extends ParserRuleReturnScope
{
2257 public Object
getTree() { return tree
; }
2260 public final QueryParser
.phrase_return
phrase() throws RecognitionException
{
2261 QueryParser
.phrase_return retval
= new QueryParser
.phrase_return();
2262 retval
.start
= input
.LT(1);
2264 CommonTree root_0
= null;
2270 CommonTree QUOTE63_tree
=null;
2271 CommonTree set64_tree
=null;
2272 CommonTree QUOTE65_tree
=null;
2276 root_0
= (CommonTree
)adaptor
.nil();
2278 QUOTE63
=(Token
)match(input
,QUOTE
,FOLLOW_QUOTE_in_phrase767
);
2279 QUOTE63_tree
= (CommonTree
)adaptor
.create(QUOTE63
);
2280 adaptor
.addChild(root_0
, QUOTE63_tree
);
2285 int LA28_0
= input
.LA(1);
2287 if ( ((LA28_0
>=ARGS
&& LA28_0
<=TEXT
)||(LA28_0
>=ESC
&& LA28_0
<=44)) ) {
2294 set64
=(Token
)input
.LT(1);
2295 if ( (input
.LA(1)>=ARGS
&& input
.LA(1)<=TEXT
)||(input
.LA(1)>=ESC
&& input
.LA(1)<=44) ) {
2297 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(set64
));
2298 state
.errorRecovery
=false;
2301 MismatchedSetException mse
= new MismatchedSetException(null,input
);
2313 QUOTE65
=(Token
)match(input
,QUOTE
,FOLLOW_QUOTE_in_phrase785
);
2314 QUOTE65_tree
= (CommonTree
)adaptor
.create(QUOTE65
);
2315 adaptor
.addChild(root_0
, QUOTE65_tree
);
2319 retval
.stop
= input
.LT(-1);
2321 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
2322 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
2326 catch (RecognitionException e
) {
2335 protected DFA3 dfa3
= new DFA3(this);
2336 protected DFA5 dfa5
= new DFA5(this);
2337 protected DFA6 dfa6
= new DFA6(this);
2338 protected DFA8 dfa8
= new DFA8(this);
2339 static final String DFA3_eotS
=
2341 static final String DFA3_eofS
=
2343 static final String DFA3_minS
=
2345 static final String DFA3_maxS
=
2346 "\1\30\1\31\2\uffff";
2347 static final String DFA3_acceptS
=
2349 static final String DFA3_specialS
=
2351 static final String
[] DFA3_transitionS
= {
2352 "\1\1\10\uffff\1\2",
2353 "\1\1\10\uffff\1\2\1\3",
2358 static final short[] DFA3_eot
= DFA
.unpackEncodedString(DFA3_eotS
);
2359 static final short[] DFA3_eof
= DFA
.unpackEncodedString(DFA3_eofS
);
2360 static final char[] DFA3_min
= DFA
.unpackEncodedStringToUnsignedChars(DFA3_minS
);
2361 static final char[] DFA3_max
= DFA
.unpackEncodedStringToUnsignedChars(DFA3_maxS
);
2362 static final short[] DFA3_accept
= DFA
.unpackEncodedString(DFA3_acceptS
);
2363 static final short[] DFA3_special
= DFA
.unpackEncodedString(DFA3_specialS
);
2364 static final short[][] DFA3_transition
;
2367 int numStates
= DFA3_transitionS
.length
;
2368 DFA3_transition
= new short[numStates
][];
2369 for (int i
=0; i
<numStates
; i
++) {
2370 DFA3_transition
[i
] = DFA
.unpackEncodedString(DFA3_transitionS
[i
]);
2374 class DFA3
extends DFA
{
2376 public DFA3(BaseRecognizer recognizer
) {
2377 this.recognizer
= recognizer
;
2378 this.decisionNumber
= 3;
2379 this.eot
= DFA3_eot
;
2380 this.eof
= DFA3_eof
;
2381 this.min
= DFA3_min
;
2382 this.max
= DFA3_max
;
2383 this.accept
= DFA3_accept
;
2384 this.special
= DFA3_special
;
2385 this.transition
= DFA3_transition
;
2387 public String
getDescription() {
2388 return "()* loopback of 51:14: ( andOp sequence )*";
2391 static final String DFA5_eotS
=
2393 static final String DFA5_eofS
=
2395 static final String DFA5_minS
=
2397 static final String DFA5_maxS
=
2398 "\1\30\1\53\2\uffff";
2399 static final String DFA5_acceptS
=
2401 static final String DFA5_specialS
=
2403 static final String
[] DFA5_transitionS
= {
2404 "\1\1\10\uffff\1\2",
2405 "\1\1\7\uffff\1\3\2\2\1\uffff\7\3\11\uffff\1\3",
2410 static final short[] DFA5_eot
= DFA
.unpackEncodedString(DFA5_eotS
);
2411 static final short[] DFA5_eof
= DFA
.unpackEncodedString(DFA5_eofS
);
2412 static final char[] DFA5_min
= DFA
.unpackEncodedStringToUnsignedChars(DFA5_minS
);
2413 static final char[] DFA5_max
= DFA
.unpackEncodedStringToUnsignedChars(DFA5_maxS
);
2414 static final short[] DFA5_accept
= DFA
.unpackEncodedString(DFA5_acceptS
);
2415 static final short[] DFA5_special
= DFA
.unpackEncodedString(DFA5_specialS
);
2416 static final short[][] DFA5_transition
;
2419 int numStates
= DFA5_transitionS
.length
;
2420 DFA5_transition
= new short[numStates
][];
2421 for (int i
=0; i
<numStates
; i
++) {
2422 DFA5_transition
[i
] = DFA
.unpackEncodedString(DFA5_transitionS
[i
]);
2426 class DFA5
extends DFA
{
2428 public DFA5(BaseRecognizer recognizer
) {
2429 this.recognizer
= recognizer
;
2430 this.decisionNumber
= 5;
2431 this.eot
= DFA5_eot
;
2432 this.eof
= DFA5_eof
;
2433 this.min
= DFA5_min
;
2434 this.max
= DFA5_max
;
2435 this.accept
= DFA5_accept
;
2436 this.special
= DFA5_special
;
2437 this.transition
= DFA5_transition
;
2439 public String
getDescription() {
2440 return "()* loopback of 57:12: ( ( WS )+ factor )*";
2443 static final String DFA6_eotS
=
2445 static final String DFA6_eofS
=
2447 static final String DFA6_minS
=
2449 static final String DFA6_maxS
=
2450 "\1\30\1\53\2\uffff";
2451 static final String DFA6_acceptS
=
2453 static final String DFA6_specialS
=
2455 static final String
[] DFA6_transitionS
= {
2456 "\1\1\10\uffff\1\2",
2457 "\1\1\7\uffff\3\2\1\3\7\2\11\uffff\1\2",
2462 static final short[] DFA6_eot
= DFA
.unpackEncodedString(DFA6_eotS
);
2463 static final short[] DFA6_eof
= DFA
.unpackEncodedString(DFA6_eofS
);
2464 static final char[] DFA6_min
= DFA
.unpackEncodedStringToUnsignedChars(DFA6_minS
);
2465 static final char[] DFA6_max
= DFA
.unpackEncodedStringToUnsignedChars(DFA6_maxS
);
2466 static final short[] DFA6_accept
= DFA
.unpackEncodedString(DFA6_acceptS
);
2467 static final short[] DFA6_special
= DFA
.unpackEncodedString(DFA6_specialS
);
2468 static final short[][] DFA6_transition
;
2471 int numStates
= DFA6_transitionS
.length
;
2472 DFA6_transition
= new short[numStates
][];
2473 for (int i
=0; i
<numStates
; i
++) {
2474 DFA6_transition
[i
] = DFA
.unpackEncodedString(DFA6_transitionS
[i
]);
2478 class DFA6
extends DFA
{
2480 public DFA6(BaseRecognizer recognizer
) {
2481 this.recognizer
= recognizer
;
2482 this.decisionNumber
= 6;
2483 this.eot
= DFA6_eot
;
2484 this.eof
= DFA6_eof
;
2485 this.min
= DFA6_min
;
2486 this.max
= DFA6_max
;
2487 this.accept
= DFA6_accept
;
2488 this.special
= DFA6_special
;
2489 this.transition
= DFA6_transition
;
2491 public String
getDescription() {
2492 return "()* loopback of 63:10: ( orOp term )*";
2495 static final String DFA8_eotS
=
2497 static final String DFA8_eofS
=
2498 "\3\uffff\1\15\1\uffff\1\15\1\uffff\1\15\1\uffff\1\15\1\uffff\1\15"+
2499 "\3\uffff\1\15\1\uffff\1\15\1\uffff\1\15";
2500 static final String DFA8_minS
=
2501 "\1\27\2\34\1\17\1\4\1\17\1\uffff\1\17\1\4\1\17\1\4\1\17\2\uffff"+
2502 "\1\4\1\17\1\4\1\17\1\4\1\17";
2503 static final String DFA8_maxS
=
2504 "\3\41\1\30\1\54\1\30\1\uffff\1\30\1\54\1\30\1\54\1\53\2\uffff\1"+
2505 "\54\1\30\1\54\1\30\1\54\1\30";
2506 static final String DFA8_acceptS
=
2507 "\6\uffff\1\2\5\uffff\1\1\1\3\6\uffff";
2508 static final String DFA8_specialS
=
2510 static final String
[] DFA8_transitionS
= {
2511 "\1\6\4\uffff\2\3\1\1\1\2\1\5\1\4",
2512 "\2\7\2\uffff\1\7\1\10",
2513 "\2\11\2\uffff\1\11\1\12",
2515 "\35\16\1\17\13\16",
2516 "\1\13\7\14\1\uffff\1\15",
2518 "\1\13\7\14\1\uffff\1\15",
2519 "\35\20\1\21\13\20",
2520 "\1\13\7\14\1\uffff\1\15",
2521 "\35\22\1\23\13\22",
2522 "\1\13\7\14\13\15\11\uffff\1\15",
2525 "\35\16\1\17\13\16",
2526 "\1\13\7\14\1\uffff\1\15",
2527 "\35\20\1\21\13\20",
2528 "\1\13\7\14\1\uffff\1\15",
2529 "\35\22\1\23\13\22",
2530 "\1\13\7\14\1\uffff\1\15"
2533 static final short[] DFA8_eot
= DFA
.unpackEncodedString(DFA8_eotS
);
2534 static final short[] DFA8_eof
= DFA
.unpackEncodedString(DFA8_eofS
);
2535 static final char[] DFA8_min
= DFA
.unpackEncodedStringToUnsignedChars(DFA8_minS
);
2536 static final char[] DFA8_max
= DFA
.unpackEncodedStringToUnsignedChars(DFA8_maxS
);
2537 static final short[] DFA8_accept
= DFA
.unpackEncodedString(DFA8_acceptS
);
2538 static final short[] DFA8_special
= DFA
.unpackEncodedString(DFA8_specialS
);
2539 static final short[][] DFA8_transition
;
2542 int numStates
= DFA8_transitionS
.length
;
2543 DFA8_transition
= new short[numStates
][];
2544 for (int i
=0; i
<numStates
; i
++) {
2545 DFA8_transition
[i
] = DFA
.unpackEncodedString(DFA8_transitionS
[i
]);
2549 class DFA8
extends DFA
{
2551 public DFA8(BaseRecognizer recognizer
) {
2552 this.recognizer
= recognizer
;
2553 this.decisionNumber
= 8;
2554 this.eot
= DFA8_eot
;
2555 this.eof
= DFA8_eof
;
2556 this.min
= DFA8_min
;
2557 this.max
= DFA8_max
;
2558 this.accept
= DFA8_accept
;
2559 this.special
= DFA8_special
;
2560 this.transition
= DFA8_transition
;
2562 public String
getDescription() {
2563 return "74:1: primitive : ( restrict | composite | item -> ^( HAS GLOBAL item ) );";
2567 public static final BitSet FOLLOW_WS_in_query121
= new BitSet(new long[]{0x00000803F8808000L
});
2568 public static final BitSet FOLLOW_expression_in_query124
= new BitSet(new long[]{0x0000000000008000L
});
2569 public static final BitSet FOLLOW_WS_in_query126
= new BitSet(new long[]{0x0000000000008000L
});
2570 public static final BitSet FOLLOW_EOF_in_query129
= new BitSet(new long[]{0x0000000000000002L
});
2571 public static final BitSet FOLLOW_sequence_in_expression148
= new BitSet(new long[]{0x0000000000008002L
});
2572 public static final BitSet FOLLOW_andOp_in_expression151
= new BitSet(new long[]{0x00000803F8800000L
});
2573 public static final BitSet FOLLOW_sequence_in_expression153
= new BitSet(new long[]{0x0000000000008002L
});
2574 public static final BitSet FOLLOW_factor_in_sequence179
= new BitSet(new long[]{0x0000000000008002L
});
2575 public static final BitSet FOLLOW_WS_in_sequence182
= new BitSet(new long[]{0x00000803F8808000L
});
2576 public static final BitSet FOLLOW_factor_in_sequence185
= new BitSet(new long[]{0x0000000000008002L
});
2577 public static final BitSet FOLLOW_term_in_factor211
= new BitSet(new long[]{0x0000000000008002L
});
2578 public static final BitSet FOLLOW_orOp_in_factor214
= new BitSet(new long[]{0x00000803F8800000L
});
2579 public static final BitSet FOLLOW_term_in_factor216
= new BitSet(new long[]{0x0000000000008002L
});
2580 public static final BitSet FOLLOW_notOp_in_term240
= new BitSet(new long[]{0x00000803F8800000L
});
2581 public static final BitSet FOLLOW_primitive_in_term242
= new BitSet(new long[]{0x0000000000000002L
});
2582 public static final BitSet FOLLOW_primitive_in_term256
= new BitSet(new long[]{0x0000000000000002L
});
2583 public static final BitSet FOLLOW_restrict_in_primitive272
= new BitSet(new long[]{0x0000000000000002L
});
2584 public static final BitSet FOLLOW_composite_in_primitive278
= new BitSet(new long[]{0x0000000000000002L
});
2585 public static final BitSet FOLLOW_item_in_primitive284
= new BitSet(new long[]{0x0000000000000002L
});
2586 public static final BitSet FOLLOW_comparable_in_restrict310
= new BitSet(new long[]{0x00000000007F8000L
});
2587 public static final BitSet FOLLOW_comparator_in_restrict312
= new BitSet(new long[]{0x00000003F0800000L
});
2588 public static final BitSet FOLLOW_arg_in_restrict314
= new BitSet(new long[]{0x0000000000000002L
});
2589 public static final BitSet FOLLOW_WS_in_comparator338
= new BitSet(new long[]{0x00000000007F8000L
});
2590 public static final BitSet FOLLOW_LE_in_comparator344
= new BitSet(new long[]{0x0000000000008002L
});
2591 public static final BitSet FOLLOW_LT_in_comparator350
= new BitSet(new long[]{0x0000000000008002L
});
2592 public static final BitSet FOLLOW_GE_in_comparator356
= new BitSet(new long[]{0x0000000000008002L
});
2593 public static final BitSet FOLLOW_GT_in_comparator362
= new BitSet(new long[]{0x0000000000008002L
});
2594 public static final BitSet FOLLOW_NE_in_comparator368
= new BitSet(new long[]{0x0000000000008002L
});
2595 public static final BitSet FOLLOW_EQ_in_comparator374
= new BitSet(new long[]{0x0000000000008002L
});
2596 public static final BitSet FOLLOW_HAS_in_comparator380
= new BitSet(new long[]{0x0000000000008002L
});
2597 public static final BitSet FOLLOW_WS_in_comparator383
= new BitSet(new long[]{0x0000000000008002L
});
2598 public static final BitSet FOLLOW_item_in_comparable405
= new BitSet(new long[]{0x0000000000000002L
});
2599 public static final BitSet FOLLOW_function_in_comparable411
= new BitSet(new long[]{0x0000000000000002L
});
2600 public static final BitSet FOLLOW_fnname_in_function426
= new BitSet(new long[]{0x0000000000800000L
});
2601 public static final BitSet FOLLOW_LPAREN_in_function428
= new BitSet(new long[]{0x00000003F1800000L
});
2602 public static final BitSet FOLLOW_arglist_in_function430
= new BitSet(new long[]{0x0000000001000000L
});
2603 public static final BitSet FOLLOW_RPAREN_in_function432
= new BitSet(new long[]{0x0000000000000002L
});
2604 public static final BitSet FOLLOW_arg_in_arglist461
= new BitSet(new long[]{0x0000100000008002L
});
2605 public static final BitSet FOLLOW_sep_in_arglist464
= new BitSet(new long[]{0x00000003F0800000L
});
2606 public static final BitSet FOLLOW_arg_in_arglist466
= new BitSet(new long[]{0x0000100000008002L
});
2607 public static final BitSet FOLLOW_item_in_arg491
= new BitSet(new long[]{0x0000000000000002L
});
2608 public static final BitSet FOLLOW_composite_in_arg497
= new BitSet(new long[]{0x0000000000000002L
});
2609 public static final BitSet FOLLOW_function_in_arg503
= new BitSet(new long[]{0x0000000000000002L
});
2610 public static final BitSet FOLLOW_WS_in_andOp517
= new BitSet(new long[]{0x0000000002008000L
});
2611 public static final BitSet FOLLOW_AND_in_andOp520
= new BitSet(new long[]{0x0000000000008000L
});
2612 public static final BitSet FOLLOW_WS_in_andOp522
= new BitSet(new long[]{0x0000000000008002L
});
2613 public static final BitSet FOLLOW_WS_in_orOp537
= new BitSet(new long[]{0x0000000004008000L
});
2614 public static final BitSet FOLLOW_OR_in_orOp540
= new BitSet(new long[]{0x0000000000008000L
});
2615 public static final BitSet FOLLOW_WS_in_orOp542
= new BitSet(new long[]{0x0000000000008002L
});
2616 public static final BitSet FOLLOW_43_in_notOp557
= new BitSet(new long[]{0x0000000000000002L
});
2617 public static final BitSet FOLLOW_NOT_in_notOp563
= new BitSet(new long[]{0x0000000000008000L
});
2618 public static final BitSet FOLLOW_WS_in_notOp565
= new BitSet(new long[]{0x0000000000008002L
});
2619 public static final BitSet FOLLOW_WS_in_sep580
= new BitSet(new long[]{0x0000100000008000L
});
2620 public static final BitSet FOLLOW_44_in_sep583
= new BitSet(new long[]{0x0000000000008002L
});
2621 public static final BitSet FOLLOW_WS_in_sep585
= new BitSet(new long[]{0x0000000000008002L
});
2622 public static final BitSet FOLLOW_set_in_fnname0
= new BitSet(new long[]{0x0000000000000002L
});
2623 public static final BitSet FOLLOW_LPAREN_in_composite621
= new BitSet(new long[]{0x00000803F8808000L
});
2624 public static final BitSet FOLLOW_WS_in_composite623
= new BitSet(new long[]{0x00000803F8808000L
});
2625 public static final BitSet FOLLOW_expression_in_composite626
= new BitSet(new long[]{0x0000000001008000L
});
2626 public static final BitSet FOLLOW_WS_in_composite628
= new BitSet(new long[]{0x0000000001008000L
});
2627 public static final BitSet FOLLOW_RPAREN_in_composite631
= new BitSet(new long[]{0x0000000000000002L
});
2628 public static final BitSet FOLLOW_FIX_in_item651
= new BitSet(new long[]{0x00000003F0000000L
});
2629 public static final BitSet FOLLOW_value_in_item653
= new BitSet(new long[]{0x0000000000000002L
});
2630 public static final BitSet FOLLOW_REWRITE_in_item667
= new BitSet(new long[]{0x00000003F0000000L
});
2631 public static final BitSet FOLLOW_value_in_item669
= new BitSet(new long[]{0x0000000000000002L
});
2632 public static final BitSet FOLLOW_value_in_item683
= new BitSet(new long[]{0x0000000000000002L
});
2633 public static final BitSet FOLLOW_text_in_value701
= new BitSet(new long[]{0x0000000000000002L
});
2634 public static final BitSet FOLLOW_phrase_in_value717
= new BitSet(new long[]{0x0000000000000002L
});
2635 public static final BitSet FOLLOW_set_in_text0
= new BitSet(new long[]{0x0000000000000002L
});
2636 public static final BitSet FOLLOW_QUOTE_in_phrase767
= new BitSet(new long[]{0x00001FFFFFFFFFF0L
});
2637 public static final BitSet FOLLOW_set_in_phrase769
= new BitSet(new long[]{0x00001FFFFFFFFFF0L
});
2638 public static final BitSet FOLLOW_QUOTE_in_phrase785
= new BitSet(new long[]{0x0000000000000002L
});