3 package com
.google
.appengine
.api
.search
.query
;
5 import org
.antlr
.runtime
.*;
7 import org
.antlr
.runtime
.tree
.*;
9 public class ExpressionParser
extends Parser
{
10 public static final String
[] tokenNames
= new String
[] {
11 "<invalid>", "<EOR>", "<DOWN>", "<UP>", "NEG", "INDEX", "COND", "AND", "OR", "XOR", "NOT", "LT", "LE", "GT", "GE", "EQ", "NE", "PLUS", "MINUS", "TIMES", "DIV", "LPAREN", "RPAREN", "LSQUARE", "INT", "RSQUARE", "NAME", "TEXT", "HTML", "ATOM", "DATE", "NUMBER", "GEO", "GEOPOINT", "FLOAT", "PHRASE", "COMMA", "ABS", "COUNT", "DISTANCE", "LOG", "MAX", "MIN", "POW", "SNIPPET", "SWITCH", "DIGIT", "QUOTE", "ESC_SEQ", "EXPONENT", "NAME_START", "WS", "ASCII_LETTER", "UNDERSCORE", "DOLLAR", "HEX_DIGIT", "UNICODE_ESC", "OCTAL_ESC", "'.'"
13 public static final int DOLLAR
=54;
14 public static final int EXPONENT
=49;
15 public static final int LT
=11;
16 public static final int LSQUARE
=23;
17 public static final int ASCII_LETTER
=52;
18 public static final int LOG
=40;
19 public static final int SNIPPET
=44;
20 public static final int OCTAL_ESC
=57;
21 public static final int MAX
=41;
22 public static final int FLOAT
=34;
23 public static final int COUNT
=38;
24 public static final int NAME_START
=50;
25 public static final int NOT
=10;
26 public static final int HTML
=28;
27 public static final int ATOM
=29;
28 public static final int AND
=7;
29 public static final int EOF
=-1;
30 public static final int LPAREN
=21;
31 public static final int INDEX
=5;
32 public static final int QUOTE
=47;
33 public static final int RPAREN
=22;
34 public static final int DISTANCE
=39;
35 public static final int T__58
=58;
36 public static final int NAME
=26;
37 public static final int ESC_SEQ
=48;
38 public static final int POW
=43;
39 public static final int COMMA
=36;
40 public static final int PLUS
=17;
41 public static final int GEO
=32;
42 public static final int DIGIT
=46;
43 public static final int EQ
=15;
44 public static final int NE
=16;
45 public static final int GE
=14;
46 public static final int XOR
=9;
47 public static final int SWITCH
=45;
48 public static final int UNICODE_ESC
=56;
49 public static final int NUMBER
=31;
50 public static final int HEX_DIGIT
=55;
51 public static final int UNDERSCORE
=53;
52 public static final int INT
=24;
53 public static final int MIN
=42;
54 public static final int MINUS
=18;
55 public static final int RSQUARE
=25;
56 public static final int TEXT
=27;
57 public static final int GEOPOINT
=33;
58 public static final int PHRASE
=35;
59 public static final int ABS
=37;
60 public static final int WS
=51;
61 public static final int OR
=8;
62 public static final int NEG
=4;
63 public static final int GT
=13;
64 public static final int DIV
=20;
65 public static final int TIMES
=19;
66 public static final int DATE
=30;
67 public static final int COND
=6;
68 public static final int LE
=12;
70 public ExpressionParser(TokenStream input
) {
71 this(input
, new RecognizerSharedState());
73 public ExpressionParser(TokenStream input
, RecognizerSharedState state
) {
78 protected TreeAdaptor adaptor
= new CommonTreeAdaptor();
80 public void setTreeAdaptor(TreeAdaptor adaptor
) {
81 this.adaptor
= adaptor
;
83 public TreeAdaptor
getTreeAdaptor() {
87 public String
[] getTokenNames() { return ExpressionParser
.tokenNames
; }
88 public String
getGrammarFileName() { return ""; }
91 public Object
recoverFromMismatchedSet(IntStream input
,
92 RecognitionException e
, BitSet follow
) throws RecognitionException
{
97 protected Object
recoverFromMismatchedToken(
98 IntStream input
, int ttype
, BitSet follow
) throws RecognitionException
{
99 throw new MismatchedTokenException(ttype
, input
);
102 public static class expression_return
extends ParserRuleReturnScope
{
104 public Object
getTree() { return tree
; }
107 public final ExpressionParser
.expression_return
expression() throws RecognitionException
{
108 ExpressionParser
.expression_return retval
= new ExpressionParser
.expression_return();
109 retval
.start
= input
.LT(1);
111 CommonTree root_0
= null;
114 ExpressionParser
.conjunction_return conjunction1
= null;
116 CommonTree EOF2_tree
=null;
120 root_0
= (CommonTree
)adaptor
.nil();
122 pushFollow(FOLLOW_conjunction_in_expression84
);
123 conjunction1
=conjunction();
127 adaptor
.addChild(root_0
, conjunction1
.getTree());
128 EOF2
=(Token
)match(input
,EOF
,FOLLOW_EOF_in_expression86
);
129 EOF2_tree
= (CommonTree
)adaptor
.create(EOF2
);
130 adaptor
.addChild(root_0
, EOF2_tree
);
134 retval
.stop
= input
.LT(-1);
136 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
137 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
141 catch (RecognitionException e
) {
150 public static class condExpr_return
extends ParserRuleReturnScope
{
152 public Object
getTree() { return tree
; }
155 public final ExpressionParser
.condExpr_return
condExpr() throws RecognitionException
{
156 ExpressionParser
.condExpr_return retval
= new ExpressionParser
.condExpr_return();
157 retval
.start
= input
.LT(1);
159 CommonTree root_0
= null;
162 ExpressionParser
.conjunction_return conjunction3
= null;
164 ExpressionParser
.addExpr_return addExpr5
= null;
166 CommonTree COND4_tree
=null;
170 root_0
= (CommonTree
)adaptor
.nil();
172 pushFollow(FOLLOW_conjunction_in_condExpr99
);
173 conjunction3
=conjunction();
177 adaptor
.addChild(root_0
, conjunction3
.getTree());
179 int LA1_0
= input
.LA(1);
181 if ( (LA1_0
==COND
) ) {
187 COND4
=(Token
)match(input
,COND
,FOLLOW_COND_in_condExpr102
);
188 COND4_tree
= (CommonTree
)adaptor
.create(COND4
);
189 root_0
= (CommonTree
)adaptor
.becomeRoot(COND4_tree
, root_0
);
191 pushFollow(FOLLOW_addExpr_in_condExpr105
);
196 adaptor
.addChild(root_0
, addExpr5
.getTree());
205 retval
.stop
= input
.LT(-1);
207 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
208 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
212 catch (RecognitionException e
) {
221 public static class conjunction_return
extends ParserRuleReturnScope
{
223 public Object
getTree() { return tree
; }
226 public final ExpressionParser
.conjunction_return
conjunction() throws RecognitionException
{
227 ExpressionParser
.conjunction_return retval
= new ExpressionParser
.conjunction_return();
228 retval
.start
= input
.LT(1);
230 CommonTree root_0
= null;
233 ExpressionParser
.disjunction_return disjunction6
= null;
235 ExpressionParser
.disjunction_return disjunction8
= null;
237 CommonTree AND7_tree
=null;
241 root_0
= (CommonTree
)adaptor
.nil();
243 pushFollow(FOLLOW_disjunction_in_conjunction120
);
244 disjunction6
=disjunction();
248 adaptor
.addChild(root_0
, disjunction6
.getTree());
252 int LA2_0
= input
.LA(1);
254 if ( (LA2_0
==AND
) ) {
261 AND7
=(Token
)match(input
,AND
,FOLLOW_AND_in_conjunction123
);
262 AND7_tree
= (CommonTree
)adaptor
.create(AND7
);
263 root_0
= (CommonTree
)adaptor
.becomeRoot(AND7_tree
, root_0
);
265 pushFollow(FOLLOW_disjunction_in_conjunction126
);
266 disjunction8
=disjunction();
270 adaptor
.addChild(root_0
, disjunction8
.getTree());
282 retval
.stop
= input
.LT(-1);
284 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
285 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
289 catch (RecognitionException e
) {
298 public static class disjunction_return
extends ParserRuleReturnScope
{
300 public Object
getTree() { return tree
; }
303 public final ExpressionParser
.disjunction_return
disjunction() throws RecognitionException
{
304 ExpressionParser
.disjunction_return retval
= new ExpressionParser
.disjunction_return();
305 retval
.start
= input
.LT(1);
307 CommonTree root_0
= null;
310 ExpressionParser
.negation_return negation9
= null;
312 ExpressionParser
.negation_return negation11
= null;
314 CommonTree set10_tree
=null;
318 root_0
= (CommonTree
)adaptor
.nil();
320 pushFollow(FOLLOW_negation_in_disjunction141
);
321 negation9
=negation();
325 adaptor
.addChild(root_0
, negation9
.getTree());
329 int LA3_0
= input
.LA(1);
331 if ( ((LA3_0
>=OR
&& LA3_0
<=XOR
)) ) {
338 set10
=(Token
)input
.LT(1);
339 set10
=(Token
)input
.LT(1);
340 if ( (input
.LA(1)>=OR
&& input
.LA(1)<=XOR
) ) {
342 root_0
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(set10
), root_0
);
343 state
.errorRecovery
=false;
346 MismatchedSetException mse
= new MismatchedSetException(null,input
);
350 pushFollow(FOLLOW_negation_in_disjunction153
);
351 negation11
=negation();
355 adaptor
.addChild(root_0
, negation11
.getTree());
367 retval
.stop
= input
.LT(-1);
369 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
370 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
374 catch (RecognitionException e
) {
383 public static class negation_return
extends ParserRuleReturnScope
{
385 public Object
getTree() { return tree
; }
388 public final ExpressionParser
.negation_return
negation() throws RecognitionException
{
389 ExpressionParser
.negation_return retval
= new ExpressionParser
.negation_return();
390 retval
.start
= input
.LT(1);
392 CommonTree root_0
= null;
395 ExpressionParser
.cmpExpr_return cmpExpr12
= null;
397 ExpressionParser
.cmpExpr_return cmpExpr14
= null;
399 CommonTree NOT13_tree
=null;
403 int LA4_0
= input
.LA(1);
405 if ( (LA4_0
==MINUS
||LA4_0
==LPAREN
||LA4_0
==INT
||(LA4_0
>=NAME
&& LA4_0
<=PHRASE
)||(LA4_0
>=ABS
&& LA4_0
<=SWITCH
)) ) {
408 else if ( (LA4_0
==NOT
) ) {
412 NoViableAltException nvae
=
413 new NoViableAltException("", 4, 0, input
);
420 root_0
= (CommonTree
)adaptor
.nil();
422 pushFollow(FOLLOW_cmpExpr_in_negation168
);
427 adaptor
.addChild(root_0
, cmpExpr12
.getTree());
433 root_0
= (CommonTree
)adaptor
.nil();
435 NOT13
=(Token
)match(input
,NOT
,FOLLOW_NOT_in_negation174
);
436 NOT13_tree
= (CommonTree
)adaptor
.create(NOT13
);
437 root_0
= (CommonTree
)adaptor
.becomeRoot(NOT13_tree
, root_0
);
439 pushFollow(FOLLOW_cmpExpr_in_negation177
);
444 adaptor
.addChild(root_0
, cmpExpr14
.getTree());
450 retval
.stop
= input
.LT(-1);
452 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
453 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
457 catch (RecognitionException e
) {
466 public static class cmpExpr_return
extends ParserRuleReturnScope
{
468 public Object
getTree() { return tree
; }
471 public final ExpressionParser
.cmpExpr_return
cmpExpr() throws RecognitionException
{
472 ExpressionParser
.cmpExpr_return retval
= new ExpressionParser
.cmpExpr_return();
473 retval
.start
= input
.LT(1);
475 CommonTree root_0
= null;
477 ExpressionParser
.addExpr_return addExpr15
= null;
479 ExpressionParser
.cmpOp_return cmpOp16
= null;
481 ExpressionParser
.addExpr_return addExpr17
= null;
485 root_0
= (CommonTree
)adaptor
.nil();
487 pushFollow(FOLLOW_addExpr_in_cmpExpr190
);
492 adaptor
.addChild(root_0
, addExpr15
.getTree());
494 int LA5_0
= input
.LA(1);
496 if ( ((LA5_0
>=LT
&& LA5_0
<=NE
)) ) {
502 pushFollow(FOLLOW_cmpOp_in_cmpExpr193
);
507 root_0
= (CommonTree
)adaptor
.becomeRoot(cmpOp16
.getTree(), root_0
);
508 pushFollow(FOLLOW_addExpr_in_cmpExpr196
);
513 adaptor
.addChild(root_0
, addExpr17
.getTree());
522 retval
.stop
= input
.LT(-1);
524 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
525 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
529 catch (RecognitionException e
) {
538 public static class cmpOp_return
extends ParserRuleReturnScope
{
540 public Object
getTree() { return tree
; }
543 public final ExpressionParser
.cmpOp_return
cmpOp() throws RecognitionException
{
544 ExpressionParser
.cmpOp_return retval
= new ExpressionParser
.cmpOp_return();
545 retval
.start
= input
.LT(1);
547 CommonTree root_0
= null;
551 CommonTree set18_tree
=null;
555 root_0
= (CommonTree
)adaptor
.nil();
557 set18
=(Token
)input
.LT(1);
558 if ( (input
.LA(1)>=LT
&& input
.LA(1)<=NE
) ) {
560 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(set18
));
561 state
.errorRecovery
=false;
564 MismatchedSetException mse
= new MismatchedSetException(null,input
);
570 retval
.stop
= input
.LT(-1);
572 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
573 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
577 catch (RecognitionException e
) {
586 public static class addExpr_return
extends ParserRuleReturnScope
{
588 public Object
getTree() { return tree
; }
591 public final ExpressionParser
.addExpr_return
addExpr() throws RecognitionException
{
592 ExpressionParser
.addExpr_return retval
= new ExpressionParser
.addExpr_return();
593 retval
.start
= input
.LT(1);
595 CommonTree root_0
= null;
597 ExpressionParser
.multExpr_return multExpr19
= null;
599 ExpressionParser
.addOp_return addOp20
= null;
601 ExpressionParser
.multExpr_return multExpr21
= null;
605 root_0
= (CommonTree
)adaptor
.nil();
607 pushFollow(FOLLOW_multExpr_in_addExpr254
);
608 multExpr19
=multExpr();
612 adaptor
.addChild(root_0
, multExpr19
.getTree());
616 int LA6_0
= input
.LA(1);
618 if ( ((LA6_0
>=PLUS
&& LA6_0
<=MINUS
)) ) {
625 pushFollow(FOLLOW_addOp_in_addExpr257
);
630 root_0
= (CommonTree
)adaptor
.becomeRoot(addOp20
.getTree(), root_0
);
631 pushFollow(FOLLOW_multExpr_in_addExpr260
);
632 multExpr21
=multExpr();
636 adaptor
.addChild(root_0
, multExpr21
.getTree());
648 retval
.stop
= input
.LT(-1);
650 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
651 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
655 catch (RecognitionException e
) {
664 public static class addOp_return
extends ParserRuleReturnScope
{
666 public Object
getTree() { return tree
; }
669 public final ExpressionParser
.addOp_return
addOp() throws RecognitionException
{
670 ExpressionParser
.addOp_return retval
= new ExpressionParser
.addOp_return();
671 retval
.start
= input
.LT(1);
673 CommonTree root_0
= null;
677 CommonTree set22_tree
=null;
681 root_0
= (CommonTree
)adaptor
.nil();
683 set22
=(Token
)input
.LT(1);
684 if ( (input
.LA(1)>=PLUS
&& input
.LA(1)<=MINUS
) ) {
686 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(set22
));
687 state
.errorRecovery
=false;
690 MismatchedSetException mse
= new MismatchedSetException(null,input
);
696 retval
.stop
= input
.LT(-1);
698 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
699 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
703 catch (RecognitionException e
) {
712 public static class multExpr_return
extends ParserRuleReturnScope
{
714 public Object
getTree() { return tree
; }
717 public final ExpressionParser
.multExpr_return
multExpr() throws RecognitionException
{
718 ExpressionParser
.multExpr_return retval
= new ExpressionParser
.multExpr_return();
719 retval
.start
= input
.LT(1);
721 CommonTree root_0
= null;
723 ExpressionParser
.unary_return unary23
= null;
725 ExpressionParser
.multOp_return multOp24
= null;
727 ExpressionParser
.unary_return unary25
= null;
731 root_0
= (CommonTree
)adaptor
.nil();
733 pushFollow(FOLLOW_unary_in_multExpr294
);
738 adaptor
.addChild(root_0
, unary23
.getTree());
742 int LA7_0
= input
.LA(1);
744 if ( ((LA7_0
>=TIMES
&& LA7_0
<=DIV
)) ) {
751 pushFollow(FOLLOW_multOp_in_multExpr297
);
756 root_0
= (CommonTree
)adaptor
.becomeRoot(multOp24
.getTree(), root_0
);
757 pushFollow(FOLLOW_unary_in_multExpr300
);
762 adaptor
.addChild(root_0
, unary25
.getTree());
774 retval
.stop
= input
.LT(-1);
776 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
777 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
781 catch (RecognitionException e
) {
790 public static class multOp_return
extends ParserRuleReturnScope
{
792 public Object
getTree() { return tree
; }
795 public final ExpressionParser
.multOp_return
multOp() throws RecognitionException
{
796 ExpressionParser
.multOp_return retval
= new ExpressionParser
.multOp_return();
797 retval
.start
= input
.LT(1);
799 CommonTree root_0
= null;
803 CommonTree set26_tree
=null;
807 root_0
= (CommonTree
)adaptor
.nil();
809 set26
=(Token
)input
.LT(1);
810 if ( (input
.LA(1)>=TIMES
&& input
.LA(1)<=DIV
) ) {
812 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(set26
));
813 state
.errorRecovery
=false;
816 MismatchedSetException mse
= new MismatchedSetException(null,input
);
822 retval
.stop
= input
.LT(-1);
824 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
825 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
829 catch (RecognitionException e
) {
838 public static class unary_return
extends ParserRuleReturnScope
{
840 public Object
getTree() { return tree
; }
843 public final ExpressionParser
.unary_return
unary() throws RecognitionException
{
844 ExpressionParser
.unary_return retval
= new ExpressionParser
.unary_return();
845 retval
.start
= input
.LT(1);
847 CommonTree root_0
= null;
850 ExpressionParser
.atom_return atom28
= null;
852 ExpressionParser
.atom_return atom29
= null;
854 CommonTree MINUS27_tree
=null;
855 RewriteRuleTokenStream stream_MINUS
=new RewriteRuleTokenStream(adaptor
,"token MINUS");
856 RewriteRuleSubtreeStream stream_atom
=new RewriteRuleSubtreeStream(adaptor
,"rule atom");
859 int LA8_0
= input
.LA(1);
861 if ( (LA8_0
==MINUS
) ) {
864 else if ( (LA8_0
==LPAREN
||LA8_0
==INT
||(LA8_0
>=NAME
&& LA8_0
<=PHRASE
)||(LA8_0
>=ABS
&& LA8_0
<=SWITCH
)) ) {
868 NoViableAltException nvae
=
869 new NoViableAltException("", 8, 0, input
);
876 MINUS27
=(Token
)match(input
,MINUS
,FOLLOW_MINUS_in_unary334
);
877 stream_MINUS
.add(MINUS27
);
879 pushFollow(FOLLOW_atom_in_unary336
);
884 stream_atom
.add(atom28
.getTree());
886 retval
.tree
= root_0
;
887 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
889 root_0
= (CommonTree
)adaptor
.nil();
892 CommonTree root_1
= (CommonTree
)adaptor
.nil();
893 root_1
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(NEG
, "-"), root_1
);
895 adaptor
.addChild(root_1
, stream_atom
.nextTree());
897 adaptor
.addChild(root_0
, root_1
);
902 retval
.tree
= root_0
;
907 root_0
= (CommonTree
)adaptor
.nil();
909 pushFollow(FOLLOW_atom_in_unary351
);
914 adaptor
.addChild(root_0
, atom29
.getTree());
920 retval
.stop
= input
.LT(-1);
922 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
923 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
927 catch (RecognitionException e
) {
936 public static class atom_return
extends ParserRuleReturnScope
{
938 public Object
getTree() { return tree
; }
941 public final ExpressionParser
.atom_return
atom() throws RecognitionException
{
942 ExpressionParser
.atom_return retval
= new ExpressionParser
.atom_return();
943 retval
.start
= input
.LT(1);
945 CommonTree root_0
= null;
949 ExpressionParser
.var_return var30
= null;
951 ExpressionParser
.num_return num31
= null;
953 ExpressionParser
.str_return str32
= null;
955 ExpressionParser
.fn_return fn33
= null;
957 ExpressionParser
.conjunction_return conjunction35
= null;
959 CommonTree LPAREN34_tree
=null;
960 CommonTree RPAREN36_tree
=null;
961 RewriteRuleTokenStream stream_RPAREN
=new RewriteRuleTokenStream(adaptor
,"token RPAREN");
962 RewriteRuleTokenStream stream_LPAREN
=new RewriteRuleTokenStream(adaptor
,"token LPAREN");
963 RewriteRuleSubtreeStream stream_conjunction
=new RewriteRuleSubtreeStream(adaptor
,"rule conjunction");
966 alt9
= dfa9
.predict(input
);
970 root_0
= (CommonTree
)adaptor
.nil();
972 pushFollow(FOLLOW_var_in_atom364
);
977 adaptor
.addChild(root_0
, var30
.getTree());
983 root_0
= (CommonTree
)adaptor
.nil();
985 pushFollow(FOLLOW_num_in_atom370
);
990 adaptor
.addChild(root_0
, num31
.getTree());
996 root_0
= (CommonTree
)adaptor
.nil();
998 pushFollow(FOLLOW_str_in_atom376
);
1003 adaptor
.addChild(root_0
, str32
.getTree());
1009 root_0
= (CommonTree
)adaptor
.nil();
1011 pushFollow(FOLLOW_fn_in_atom382
);
1016 adaptor
.addChild(root_0
, fn33
.getTree());
1022 LPAREN34
=(Token
)match(input
,LPAREN
,FOLLOW_LPAREN_in_atom388
);
1023 stream_LPAREN
.add(LPAREN34
);
1025 pushFollow(FOLLOW_conjunction_in_atom390
);
1026 conjunction35
=conjunction();
1030 stream_conjunction
.add(conjunction35
.getTree());
1031 RPAREN36
=(Token
)match(input
,RPAREN
,FOLLOW_RPAREN_in_atom392
);
1032 stream_RPAREN
.add(RPAREN36
);
1034 retval
.tree
= root_0
;
1035 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1037 root_0
= (CommonTree
)adaptor
.nil();
1039 adaptor
.addChild(root_0
, stream_conjunction
.nextTree());
1043 retval
.tree
= root_0
;
1048 retval
.stop
= input
.LT(-1);
1050 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1051 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1055 catch (RecognitionException e
) {
1064 public static class var_return
extends ParserRuleReturnScope
{
1066 public Object
getTree() { return tree
; }
1069 public final ExpressionParser
.var_return
var() throws RecognitionException
{
1070 ExpressionParser
.var_return retval
= new ExpressionParser
.var_return();
1071 retval
.start
= input
.LT(1);
1073 CommonTree root_0
= null;
1075 ExpressionParser
.name_return name37
= null;
1077 ExpressionParser
.name_return name38
= null;
1079 ExpressionParser
.index_return index39
= null;
1081 RewriteRuleSubtreeStream stream_index
=new RewriteRuleSubtreeStream(adaptor
,"rule index");
1082 RewriteRuleSubtreeStream stream_name
=new RewriteRuleSubtreeStream(adaptor
,"rule name");
1085 alt10
= dfa10
.predict(input
);
1089 root_0
= (CommonTree
)adaptor
.nil();
1091 pushFollow(FOLLOW_name_in_var409
);
1096 adaptor
.addChild(root_0
, name37
.getTree());
1102 pushFollow(FOLLOW_name_in_var415
);
1107 stream_name
.add(name38
.getTree());
1108 pushFollow(FOLLOW_index_in_var417
);
1113 stream_index
.add(index39
.getTree());
1115 retval
.tree
= root_0
;
1116 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1118 root_0
= (CommonTree
)adaptor
.nil();
1121 CommonTree root_1
= (CommonTree
)adaptor
.nil();
1122 root_1
= (CommonTree
)adaptor
.becomeRoot((CommonTree
)adaptor
.create(INDEX
, (index39
!=null?input
.toString(index39
.start
,index39
.stop
):null)), root_1
);
1124 adaptor
.addChild(root_1
, stream_name
.nextTree());
1126 adaptor
.addChild(root_0
, root_1
);
1131 retval
.tree
= root_0
;
1136 retval
.stop
= input
.LT(-1);
1138 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1139 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1143 catch (RecognitionException e
) {
1152 public static class index_return
extends ParserRuleReturnScope
{
1154 public Object
getTree() { return tree
; }
1157 public final ExpressionParser
.index_return
index() throws RecognitionException
{
1158 ExpressionParser
.index_return retval
= new ExpressionParser
.index_return();
1159 retval
.start
= input
.LT(1);
1161 CommonTree root_0
= null;
1164 Token LSQUARE40
=null;
1165 Token RSQUARE41
=null;
1167 CommonTree x_tree
=null;
1168 CommonTree LSQUARE40_tree
=null;
1169 CommonTree RSQUARE41_tree
=null;
1170 RewriteRuleTokenStream stream_INT
=new RewriteRuleTokenStream(adaptor
,"token INT");
1171 RewriteRuleTokenStream stream_LSQUARE
=new RewriteRuleTokenStream(adaptor
,"token LSQUARE");
1172 RewriteRuleTokenStream stream_RSQUARE
=new RewriteRuleTokenStream(adaptor
,"token RSQUARE");
1176 LSQUARE40
=(Token
)match(input
,LSQUARE
,FOLLOW_LSQUARE_in_index439
);
1177 stream_LSQUARE
.add(LSQUARE40
);
1179 x
=(Token
)match(input
,INT
,FOLLOW_INT_in_index443
);
1182 RSQUARE41
=(Token
)match(input
,RSQUARE
,FOLLOW_RSQUARE_in_index445
);
1183 stream_RSQUARE
.add(RSQUARE41
);
1185 retval
.tree
= root_0
;
1186 RewriteRuleTokenStream stream_x
=new RewriteRuleTokenStream(adaptor
,"token x",x
);
1187 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1189 root_0
= (CommonTree
)adaptor
.nil();
1191 adaptor
.addChild(root_0
, stream_x
.nextNode());
1195 retval
.tree
= root_0
;
1198 retval
.stop
= input
.LT(-1);
1200 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1201 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1205 catch (RecognitionException e
) {
1214 public static class name_return
extends ParserRuleReturnScope
{
1216 public Object
getTree() { return tree
; }
1219 public final ExpressionParser
.name_return
name() throws RecognitionException
{
1220 ExpressionParser
.name_return retval
= new ExpressionParser
.name_return();
1221 retval
.start
= input
.LT(1);
1223 CommonTree root_0
= null;
1227 Token char_literal43
=null;
1230 CommonTree t_tree
=null;
1231 CommonTree NAME42_tree
=null;
1232 CommonTree char_literal43_tree
=null;
1233 CommonTree NAME44_tree
=null;
1234 RewriteRuleTokenStream stream_GEO
=new RewriteRuleTokenStream(adaptor
,"token GEO");
1235 RewriteRuleTokenStream stream_HTML
=new RewriteRuleTokenStream(adaptor
,"token HTML");
1236 RewriteRuleTokenStream stream_ATOM
=new RewriteRuleTokenStream(adaptor
,"token ATOM");
1237 RewriteRuleTokenStream stream_TEXT
=new RewriteRuleTokenStream(adaptor
,"token TEXT");
1238 RewriteRuleTokenStream stream_DATE
=new RewriteRuleTokenStream(adaptor
,"token DATE");
1239 RewriteRuleTokenStream stream_GEOPOINT
=new RewriteRuleTokenStream(adaptor
,"token GEOPOINT");
1240 RewriteRuleTokenStream stream_NUMBER
=new RewriteRuleTokenStream(adaptor
,"token NUMBER");
1244 switch ( input
.LA(1) ) {
1286 NoViableAltException nvae
=
1287 new NoViableAltException("", 12, 0, input
);
1295 root_0
= (CommonTree
)adaptor
.nil();
1297 NAME42
=(Token
)match(input
,NAME
,FOLLOW_NAME_in_name463
);
1298 NAME42_tree
= (CommonTree
)adaptor
.create(NAME42
);
1299 adaptor
.addChild(root_0
, NAME42_tree
);
1304 int LA11_0
= input
.LA(1);
1306 if ( (LA11_0
==58) ) {
1313 char_literal43
=(Token
)match(input
,58,FOLLOW_58_in_name466
);
1314 char_literal43_tree
= (CommonTree
)adaptor
.create(char_literal43
);
1315 root_0
= (CommonTree
)adaptor
.becomeRoot(char_literal43_tree
, root_0
);
1317 NAME44
=(Token
)match(input
,NAME
,FOLLOW_NAME_in_name469
);
1318 NAME44_tree
= (CommonTree
)adaptor
.create(NAME44
);
1319 adaptor
.addChild(root_0
, NAME44_tree
);
1333 t
=(Token
)match(input
,TEXT
,FOLLOW_TEXT_in_name485
);
1336 retval
.tree
= root_0
;
1337 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1339 root_0
= (CommonTree
)adaptor
.nil();
1341 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(NAME
, t
));
1345 retval
.tree
= root_0
;
1350 t
=(Token
)match(input
,HTML
,FOLLOW_HTML_in_name498
);
1353 retval
.tree
= root_0
;
1354 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1356 root_0
= (CommonTree
)adaptor
.nil();
1358 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(NAME
, t
));
1362 retval
.tree
= root_0
;
1367 t
=(Token
)match(input
,ATOM
,FOLLOW_ATOM_in_name511
);
1370 retval
.tree
= root_0
;
1371 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1373 root_0
= (CommonTree
)adaptor
.nil();
1375 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(NAME
, t
));
1379 retval
.tree
= root_0
;
1384 t
=(Token
)match(input
,DATE
,FOLLOW_DATE_in_name524
);
1387 retval
.tree
= root_0
;
1388 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1390 root_0
= (CommonTree
)adaptor
.nil();
1392 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(NAME
, t
));
1396 retval
.tree
= root_0
;
1401 t
=(Token
)match(input
,NUMBER
,FOLLOW_NUMBER_in_name537
);
1402 stream_NUMBER
.add(t
);
1404 retval
.tree
= root_0
;
1405 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1407 root_0
= (CommonTree
)adaptor
.nil();
1409 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(NAME
, t
));
1413 retval
.tree
= root_0
;
1418 t
=(Token
)match(input
,GEO
,FOLLOW_GEO_in_name550
);
1421 retval
.tree
= root_0
;
1422 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1424 root_0
= (CommonTree
)adaptor
.nil();
1426 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(NAME
, t
));
1430 retval
.tree
= root_0
;
1435 t
=(Token
)match(input
,GEOPOINT
,FOLLOW_GEOPOINT_in_name563
);
1436 stream_GEOPOINT
.add(t
);
1438 retval
.tree
= root_0
;
1439 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1441 root_0
= (CommonTree
)adaptor
.nil();
1443 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(NAME
, t
));
1447 retval
.tree
= root_0
;
1452 retval
.stop
= input
.LT(-1);
1454 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1455 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1459 catch (RecognitionException e
) {
1468 public static class num_return
extends ParserRuleReturnScope
{
1470 public Object
getTree() { return tree
; }
1473 public final ExpressionParser
.num_return
num() throws RecognitionException
{
1474 ExpressionParser
.num_return retval
= new ExpressionParser
.num_return();
1475 retval
.start
= input
.LT(1);
1477 CommonTree root_0
= null;
1481 CommonTree set45_tree
=null;
1485 root_0
= (CommonTree
)adaptor
.nil();
1487 set45
=(Token
)input
.LT(1);
1488 if ( input
.LA(1)==INT
||input
.LA(1)==FLOAT
) {
1490 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(set45
));
1491 state
.errorRecovery
=false;
1494 MismatchedSetException mse
= new MismatchedSetException(null,input
);
1500 retval
.stop
= input
.LT(-1);
1502 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1503 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1507 catch (RecognitionException e
) {
1516 public static class str_return
extends ParserRuleReturnScope
{
1518 public Object
getTree() { return tree
; }
1521 public final ExpressionParser
.str_return
str() throws RecognitionException
{
1522 ExpressionParser
.str_return retval
= new ExpressionParser
.str_return();
1523 retval
.start
= input
.LT(1);
1525 CommonTree root_0
= null;
1527 Token PHRASE46
=null;
1529 CommonTree PHRASE46_tree
=null;
1533 root_0
= (CommonTree
)adaptor
.nil();
1535 PHRASE46
=(Token
)match(input
,PHRASE
,FOLLOW_PHRASE_in_str600
);
1536 PHRASE46_tree
= (CommonTree
)adaptor
.create(PHRASE46
);
1537 adaptor
.addChild(root_0
, PHRASE46_tree
);
1541 retval
.stop
= input
.LT(-1);
1543 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1544 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1548 catch (RecognitionException e
) {
1557 public static class fn_return
extends ParserRuleReturnScope
{
1559 public Object
getTree() { return tree
; }
1562 public final ExpressionParser
.fn_return
fn() throws RecognitionException
{
1563 ExpressionParser
.fn_return retval
= new ExpressionParser
.fn_return();
1564 retval
.start
= input
.LT(1);
1566 CommonTree root_0
= null;
1568 Token LPAREN48
=null;
1570 Token RPAREN52
=null;
1571 ExpressionParser
.fnName_return fnName47
= null;
1573 ExpressionParser
.condExpr_return condExpr49
= null;
1575 ExpressionParser
.condExpr_return condExpr51
= null;
1577 CommonTree LPAREN48_tree
=null;
1578 CommonTree COMMA50_tree
=null;
1579 CommonTree RPAREN52_tree
=null;
1580 RewriteRuleTokenStream stream_RPAREN
=new RewriteRuleTokenStream(adaptor
,"token RPAREN");
1581 RewriteRuleTokenStream stream_COMMA
=new RewriteRuleTokenStream(adaptor
,"token COMMA");
1582 RewriteRuleTokenStream stream_LPAREN
=new RewriteRuleTokenStream(adaptor
,"token LPAREN");
1583 RewriteRuleSubtreeStream stream_fnName
=new RewriteRuleSubtreeStream(adaptor
,"rule fnName");
1584 RewriteRuleSubtreeStream stream_condExpr
=new RewriteRuleSubtreeStream(adaptor
,"rule condExpr");
1587 pushFollow(FOLLOW_fnName_in_fn613
);
1592 stream_fnName
.add(fnName47
.getTree());
1593 LPAREN48
=(Token
)match(input
,LPAREN
,FOLLOW_LPAREN_in_fn615
);
1594 stream_LPAREN
.add(LPAREN48
);
1596 pushFollow(FOLLOW_condExpr_in_fn617
);
1597 condExpr49
=condExpr();
1601 stream_condExpr
.add(condExpr49
.getTree());
1605 int LA13_0
= input
.LA(1);
1607 if ( (LA13_0
==COMMA
) ) {
1614 COMMA50
=(Token
)match(input
,COMMA
,FOLLOW_COMMA_in_fn620
);
1615 stream_COMMA
.add(COMMA50
);
1617 pushFollow(FOLLOW_condExpr_in_fn622
);
1618 condExpr51
=condExpr();
1622 stream_condExpr
.add(condExpr51
.getTree());
1632 RPAREN52
=(Token
)match(input
,RPAREN
,FOLLOW_RPAREN_in_fn626
);
1633 stream_RPAREN
.add(RPAREN52
);
1635 retval
.tree
= root_0
;
1636 RewriteRuleSubtreeStream stream_retval
=new RewriteRuleSubtreeStream(adaptor
,"rule retval",retval
!=null?retval
.tree
:null);
1638 root_0
= (CommonTree
)adaptor
.nil();
1641 CommonTree root_1
= (CommonTree
)adaptor
.nil();
1642 root_1
= (CommonTree
)adaptor
.becomeRoot(stream_fnName
.nextNode(), root_1
);
1644 if ( !(stream_condExpr
.hasNext()) ) {
1645 throw new RewriteEarlyExitException();
1647 while ( stream_condExpr
.hasNext() ) {
1648 adaptor
.addChild(root_1
, stream_condExpr
.nextTree());
1651 stream_condExpr
.reset();
1653 adaptor
.addChild(root_0
, root_1
);
1658 retval
.tree
= root_0
;
1661 retval
.stop
= input
.LT(-1);
1663 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1664 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1668 catch (RecognitionException e
) {
1677 public static class fnName_return
extends ParserRuleReturnScope
{
1679 public Object
getTree() { return tree
; }
1682 public final ExpressionParser
.fnName_return
fnName() throws RecognitionException
{
1683 ExpressionParser
.fnName_return retval
= new ExpressionParser
.fnName_return();
1684 retval
.start
= input
.LT(1);
1686 CommonTree root_0
= null;
1690 CommonTree set53_tree
=null;
1694 root_0
= (CommonTree
)adaptor
.nil();
1696 set53
=(Token
)input
.LT(1);
1697 if ( (input
.LA(1)>=TEXT
&& input
.LA(1)<=GEOPOINT
)||(input
.LA(1)>=ABS
&& input
.LA(1)<=SWITCH
) ) {
1699 adaptor
.addChild(root_0
, (CommonTree
)adaptor
.create(set53
));
1700 state
.errorRecovery
=false;
1703 MismatchedSetException mse
= new MismatchedSetException(null,input
);
1709 retval
.stop
= input
.LT(-1);
1711 retval
.tree
= (CommonTree
)adaptor
.rulePostProcessing(root_0
);
1712 adaptor
.setTokenBoundaries(retval
.tree
, retval
.start
, retval
.stop
);
1716 catch (RecognitionException e
) {
1725 protected DFA9 dfa9
= new DFA9(this);
1726 protected DFA10 dfa10
= new DFA10(this);
1727 static final String DFA9_eotS
=
1729 static final String DFA9_eofS
=
1730 "\2\uffff\7\1\4\uffff";
1731 static final String DFA9_minS
=
1732 "\1\25\1\uffff\7\6\4\uffff";
1733 static final String DFA9_maxS
=
1734 "\1\55\1\uffff\7\44\4\uffff";
1735 static final String DFA9_acceptS
=
1736 "\1\uffff\1\1\7\uffff\1\2\1\3\1\4\1\5";
1737 static final String DFA9_specialS
=
1739 static final String
[] DFA9_transitionS
= {
1740 "\1\14\2\uffff\1\11\1\uffff\1\1\1\2\1\3\1\4\1\5\1\6\1\7\1\10"+
1741 "\1\11\1\12\1\uffff\11\13",
1743 "\4\1\1\uffff\12\1\1\13\2\1\14\uffff\1\1",
1744 "\4\1\1\uffff\12\1\1\13\2\1\14\uffff\1\1",
1745 "\4\1\1\uffff\12\1\1\13\2\1\14\uffff\1\1",
1746 "\4\1\1\uffff\12\1\1\13\2\1\14\uffff\1\1",
1747 "\4\1\1\uffff\12\1\1\13\2\1\14\uffff\1\1",
1748 "\4\1\1\uffff\12\1\1\13\2\1\14\uffff\1\1",
1749 "\4\1\1\uffff\12\1\1\13\2\1\14\uffff\1\1",
1756 static final short[] DFA9_eot
= DFA
.unpackEncodedString(DFA9_eotS
);
1757 static final short[] DFA9_eof
= DFA
.unpackEncodedString(DFA9_eofS
);
1758 static final char[] DFA9_min
= DFA
.unpackEncodedStringToUnsignedChars(DFA9_minS
);
1759 static final char[] DFA9_max
= DFA
.unpackEncodedStringToUnsignedChars(DFA9_maxS
);
1760 static final short[] DFA9_accept
= DFA
.unpackEncodedString(DFA9_acceptS
);
1761 static final short[] DFA9_special
= DFA
.unpackEncodedString(DFA9_specialS
);
1762 static final short[][] DFA9_transition
;
1765 int numStates
= DFA9_transitionS
.length
;
1766 DFA9_transition
= new short[numStates
][];
1767 for (int i
=0; i
<numStates
; i
++) {
1768 DFA9_transition
[i
] = DFA
.unpackEncodedString(DFA9_transitionS
[i
]);
1772 class DFA9
extends DFA
{
1774 public DFA9(BaseRecognizer recognizer
) {
1775 this.recognizer
= recognizer
;
1776 this.decisionNumber
= 9;
1777 this.eot
= DFA9_eot
;
1778 this.eof
= DFA9_eof
;
1779 this.min
= DFA9_min
;
1780 this.max
= DFA9_max
;
1781 this.accept
= DFA9_accept
;
1782 this.special
= DFA9_special
;
1783 this.transition
= DFA9_transition
;
1785 public String
getDescription() {
1786 return "110:1: atom : ( var | num | str | fn | LPAREN conjunction RPAREN -> conjunction );";
1789 static final String DFA10_eotS
=
1791 static final String DFA10_eofS
=
1792 "\1\uffff\10\12\3\uffff\1\12";
1793 static final String DFA10_minS
=
1794 "\1\32\10\6\1\32\2\uffff\1\6";
1795 static final String DFA10_maxS
=
1796 "\1\41\1\72\7\44\1\32\2\uffff\1\72";
1797 static final String DFA10_acceptS
=
1798 "\12\uffff\1\1\1\2\1\uffff";
1799 static final String DFA10_specialS
=
1801 static final String
[] DFA10_transitionS
= {
1802 "\1\1\1\2\1\3\1\4\1\5\1\6\1\7\1\10",
1803 "\4\12\1\uffff\12\12\1\uffff\1\12\1\13\14\uffff\1\12\25\uffff"+
1805 "\4\12\1\uffff\12\12\1\uffff\1\12\1\13\14\uffff\1\12",
1806 "\4\12\1\uffff\12\12\1\uffff\1\12\1\13\14\uffff\1\12",
1807 "\4\12\1\uffff\12\12\1\uffff\1\12\1\13\14\uffff\1\12",
1808 "\4\12\1\uffff\12\12\1\uffff\1\12\1\13\14\uffff\1\12",
1809 "\4\12\1\uffff\12\12\1\uffff\1\12\1\13\14\uffff\1\12",
1810 "\4\12\1\uffff\12\12\1\uffff\1\12\1\13\14\uffff\1\12",
1811 "\4\12\1\uffff\12\12\1\uffff\1\12\1\13\14\uffff\1\12",
1815 "\4\12\1\uffff\12\12\1\uffff\1\12\1\13\14\uffff\1\12\25\uffff"+
1819 static final short[] DFA10_eot
= DFA
.unpackEncodedString(DFA10_eotS
);
1820 static final short[] DFA10_eof
= DFA
.unpackEncodedString(DFA10_eofS
);
1821 static final char[] DFA10_min
= DFA
.unpackEncodedStringToUnsignedChars(DFA10_minS
);
1822 static final char[] DFA10_max
= DFA
.unpackEncodedStringToUnsignedChars(DFA10_maxS
);
1823 static final short[] DFA10_accept
= DFA
.unpackEncodedString(DFA10_acceptS
);
1824 static final short[] DFA10_special
= DFA
.unpackEncodedString(DFA10_specialS
);
1825 static final short[][] DFA10_transition
;
1828 int numStates
= DFA10_transitionS
.length
;
1829 DFA10_transition
= new short[numStates
][];
1830 for (int i
=0; i
<numStates
; i
++) {
1831 DFA10_transition
[i
] = DFA
.unpackEncodedString(DFA10_transitionS
[i
]);
1835 class DFA10
extends DFA
{
1837 public DFA10(BaseRecognizer recognizer
) {
1838 this.recognizer
= recognizer
;
1839 this.decisionNumber
= 10;
1840 this.eot
= DFA10_eot
;
1841 this.eof
= DFA10_eof
;
1842 this.min
= DFA10_min
;
1843 this.max
= DFA10_max
;
1844 this.accept
= DFA10_accept
;
1845 this.special
= DFA10_special
;
1846 this.transition
= DFA10_transition
;
1848 public String
getDescription() {
1849 return "118:1: var : ( name | name index -> ^( INDEX[$index.text] name ) );";
1853 public static final BitSet FOLLOW_conjunction_in_expression84
= new BitSet(new long[]{0x0000000000000000L
});
1854 public static final BitSet FOLLOW_EOF_in_expression86
= new BitSet(new long[]{0x0000000000000002L
});
1855 public static final BitSet FOLLOW_conjunction_in_condExpr99
= new BitSet(new long[]{0x0000000000000042L
});
1856 public static final BitSet FOLLOW_COND_in_condExpr102
= new BitSet(new long[]{0x00003FEFFD240000L
});
1857 public static final BitSet FOLLOW_addExpr_in_condExpr105
= new BitSet(new long[]{0x0000000000000002L
});
1858 public static final BitSet FOLLOW_disjunction_in_conjunction120
= new BitSet(new long[]{0x0000000000000082L
});
1859 public static final BitSet FOLLOW_AND_in_conjunction123
= new BitSet(new long[]{0x00003FEFFD240400L
});
1860 public static final BitSet FOLLOW_disjunction_in_conjunction126
= new BitSet(new long[]{0x0000000000000082L
});
1861 public static final BitSet FOLLOW_negation_in_disjunction141
= new BitSet(new long[]{0x0000000000000302L
});
1862 public static final BitSet FOLLOW_set_in_disjunction144
= new BitSet(new long[]{0x00003FEFFD240400L
});
1863 public static final BitSet FOLLOW_negation_in_disjunction153
= new BitSet(new long[]{0x0000000000000302L
});
1864 public static final BitSet FOLLOW_cmpExpr_in_negation168
= new BitSet(new long[]{0x0000000000000002L
});
1865 public static final BitSet FOLLOW_NOT_in_negation174
= new BitSet(new long[]{0x00003FEFFD240000L
});
1866 public static final BitSet FOLLOW_cmpExpr_in_negation177
= new BitSet(new long[]{0x0000000000000002L
});
1867 public static final BitSet FOLLOW_addExpr_in_cmpExpr190
= new BitSet(new long[]{0x000000000001F802L
});
1868 public static final BitSet FOLLOW_cmpOp_in_cmpExpr193
= new BitSet(new long[]{0x00003FEFFD240000L
});
1869 public static final BitSet FOLLOW_addExpr_in_cmpExpr196
= new BitSet(new long[]{0x0000000000000002L
});
1870 public static final BitSet FOLLOW_set_in_cmpOp0
= new BitSet(new long[]{0x0000000000000002L
});
1871 public static final BitSet FOLLOW_multExpr_in_addExpr254
= new BitSet(new long[]{0x0000000000060002L
});
1872 public static final BitSet FOLLOW_addOp_in_addExpr257
= new BitSet(new long[]{0x00003FEFFD240000L
});
1873 public static final BitSet FOLLOW_multExpr_in_addExpr260
= new BitSet(new long[]{0x0000000000060002L
});
1874 public static final BitSet FOLLOW_set_in_addOp0
= new BitSet(new long[]{0x0000000000000002L
});
1875 public static final BitSet FOLLOW_unary_in_multExpr294
= new BitSet(new long[]{0x0000000000180002L
});
1876 public static final BitSet FOLLOW_multOp_in_multExpr297
= new BitSet(new long[]{0x00003FEFFD240000L
});
1877 public static final BitSet FOLLOW_unary_in_multExpr300
= new BitSet(new long[]{0x0000000000180002L
});
1878 public static final BitSet FOLLOW_set_in_multOp0
= new BitSet(new long[]{0x0000000000000002L
});
1879 public static final BitSet FOLLOW_MINUS_in_unary334
= new BitSet(new long[]{0x00003FEFFD240000L
});
1880 public static final BitSet FOLLOW_atom_in_unary336
= new BitSet(new long[]{0x0000000000000002L
});
1881 public static final BitSet FOLLOW_atom_in_unary351
= new BitSet(new long[]{0x0000000000000002L
});
1882 public static final BitSet FOLLOW_var_in_atom364
= new BitSet(new long[]{0x0000000000000002L
});
1883 public static final BitSet FOLLOW_num_in_atom370
= new BitSet(new long[]{0x0000000000000002L
});
1884 public static final BitSet FOLLOW_str_in_atom376
= new BitSet(new long[]{0x0000000000000002L
});
1885 public static final BitSet FOLLOW_fn_in_atom382
= new BitSet(new long[]{0x0000000000000002L
});
1886 public static final BitSet FOLLOW_LPAREN_in_atom388
= new BitSet(new long[]{0x00003FEFFD240400L
});
1887 public static final BitSet FOLLOW_conjunction_in_atom390
= new BitSet(new long[]{0x0000000000400000L
});
1888 public static final BitSet FOLLOW_RPAREN_in_atom392
= new BitSet(new long[]{0x0000000000000002L
});
1889 public static final BitSet FOLLOW_name_in_var409
= new BitSet(new long[]{0x0000000000000002L
});
1890 public static final BitSet FOLLOW_name_in_var415
= new BitSet(new long[]{0x0000000000800000L
});
1891 public static final BitSet FOLLOW_index_in_var417
= new BitSet(new long[]{0x0000000000000002L
});
1892 public static final BitSet FOLLOW_LSQUARE_in_index439
= new BitSet(new long[]{0x0000000001000000L
});
1893 public static final BitSet FOLLOW_INT_in_index443
= new BitSet(new long[]{0x0000000002000000L
});
1894 public static final BitSet FOLLOW_RSQUARE_in_index445
= new BitSet(new long[]{0x0000000000000002L
});
1895 public static final BitSet FOLLOW_NAME_in_name463
= new BitSet(new long[]{0x0400000000000002L
});
1896 public static final BitSet FOLLOW_58_in_name466
= new BitSet(new long[]{0x0000000004000000L
});
1897 public static final BitSet FOLLOW_NAME_in_name469
= new BitSet(new long[]{0x0400000000000002L
});
1898 public static final BitSet FOLLOW_TEXT_in_name485
= new BitSet(new long[]{0x0000000000000002L
});
1899 public static final BitSet FOLLOW_HTML_in_name498
= new BitSet(new long[]{0x0000000000000002L
});
1900 public static final BitSet FOLLOW_ATOM_in_name511
= new BitSet(new long[]{0x0000000000000002L
});
1901 public static final BitSet FOLLOW_DATE_in_name524
= new BitSet(new long[]{0x0000000000000002L
});
1902 public static final BitSet FOLLOW_NUMBER_in_name537
= new BitSet(new long[]{0x0000000000000002L
});
1903 public static final BitSet FOLLOW_GEO_in_name550
= new BitSet(new long[]{0x0000000000000002L
});
1904 public static final BitSet FOLLOW_GEOPOINT_in_name563
= new BitSet(new long[]{0x0000000000000002L
});
1905 public static final BitSet FOLLOW_set_in_num0
= new BitSet(new long[]{0x0000000000000002L
});
1906 public static final BitSet FOLLOW_PHRASE_in_str600
= new BitSet(new long[]{0x0000000000000002L
});
1907 public static final BitSet FOLLOW_fnName_in_fn613
= new BitSet(new long[]{0x0000000000200000L
});
1908 public static final BitSet FOLLOW_LPAREN_in_fn615
= new BitSet(new long[]{0x00003FEFFD240400L
});
1909 public static final BitSet FOLLOW_condExpr_in_fn617
= new BitSet(new long[]{0x0000001000400000L
});
1910 public static final BitSet FOLLOW_COMMA_in_fn620
= new BitSet(new long[]{0x00003FEFFD240400L
});
1911 public static final BitSet FOLLOW_condExpr_in_fn622
= new BitSet(new long[]{0x0000001000400000L
});
1912 public static final BitSet FOLLOW_RPAREN_in_fn626
= new BitSet(new long[]{0x0000000000000002L
});
1913 public static final BitSet FOLLOW_set_in_fnName0
= new BitSet(new long[]{0x0000000000000002L
});