| Method Summary |
| |
__init__(self,
start)
|
| |
error(self,
token)
|
| |
p_comma_separated_1(self,
args)
comma_separated ::= term |
| |
p_comma_separated_2(self,
args)
comma_separated ::= comma_separated comma term |
| |
p_comp_op(self,
args)
comp_op ::= +
comp_op ::= *
comp_op ::= <
comp_op ::= >
comp_op ::= ==
comp_op ::= >=
comp_op ::= <=
comp_op ::= !=
comp_op ::= like
comp_op ::= caseInsensitiveLike
comp_op ::= ilike |
| |
p_comp_op2(self,
args)
comp_op2 ::= in |
| |
p_expr_1(self,
args)
expr ::= expr comp_op expr |
| |
p_expr_2(self,
args)
expr ::= paren_open expr paren_close |
| |
p_expr_3(self,
args)
expr ::= term |
| |
p_expr_4(self,
args)
expr ::= not_expr |
| |
p_expr_in(self,
args)
expr ::= expr comp_op2 square_bracket_open comma_separated square_bracket_close |
| |
p_expr_not_in(self,
args)
expr ::= expr not_in square_bracket_open comma_separated square_bracket_close |
| |
p_not_expr(self,
args)
not_expr ::= not_operator qual |
| |
p_not_in(self,
args)
not_in ::= not_operator comp_op2 |
| |
p_not_operator(self,
args)
not_operator ::= NOT |
| |
p_operator(self,
args)
operator ::= AND
operator ::= OR |
| |
p_qual_1(self,
args)
qual ::= qual operator qual |
| |
p_qual_2(self,
args)
qual ::= paren_open qual paren_close |
| |
p_qual_3(self,
args)
qual ::= expr |
| |
p_term_1(self,
args)
term ::= number |
| |
p_term_2(self,
args)
term ::= float |
| |
p_term_3(self,
args)
term ::= string |
| |
p_term_4(self,
args)
term ::= keypath |
| |
p_term_5(self,
args)
term ::= nullValue |
| Inherited from GenericParser |
| |
addRule(self,
doc,
func) |
| |
ambiguity(self,
children) |
| |
augment(self,
start) |
| |
buildState(self,
token,
states,
i,
tree) |
| |
buildTree(self,
tokens,
tree,
root) |
| |
buildTree_r(self,
stack,
tokens,
tokpos,
tree,
root) |
| |
collectRules(self) |
| |
makeFIRST(self) |
| |
parse(self,
tokens) |
| |
preprocess(self,
rule,
func) |
| |
resolve(self,
list) |
| |
typestring(self,
token) |