| accept(ParseTreeVisitor) |  | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| expr(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| compOp() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| string() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| subSelect() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| K_LIKE() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| K_NOT() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| K_ESCAPE() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| K_BETWEEN() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| K_AND() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| K_IS() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| K_NULL() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| K_ALL() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| K_SOME() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| K_ANY() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| K_EXISTS() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| expr() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getRuleIndex() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| enterRule(ParseTreeListener) |  | 100% | | 50% | 1 | 2 | 0 | 2 | 0 | 1 |
| exitRule(ParseTreeListener) | | 100% | | 50% | 1 | 2 | 0 | 2 | 0 | 1 |
| parenList() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| K_IN() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| SeQueryParser.CriterionContext(ParserRuleContext, int) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |