Operand parsing right to left.

Hello, I have a problem with a language parsing.

I have the following grammar:

?start: expression

?expression: "(" expression ")"
| expression operator expression
| negation expression
| string

?operator: "AND" -> andt
| "OR" -> ort

negation: "NOT" -> nott

string: /[0-9a-zA-Z_]\w*/

%import common.WS
%ignore WS

And a possible string would be the following: test AND NOT test2

However, for the following case: test AND test2 OR test3 the parsing is equivalent to: test AND (test2 OR test3) however the desired behaviour is: (test AND test2) OR test3

The first case makes sense, as the first operator token is the AND, so it grabs that as the “pivot” and parses the left and right expressions individually. Is there a way to make the parsing from right to left, so that in this case, it finds the OR operator first?

[erezsh]

scratches head

[PabloMK7]

In fact, your example was exactly the opposite of what I needed, so now that I know how recursion can be defined, I changed | expression operator expression with | (expression)? operator expression

Keep in mind that for 1 AND 2 AND 3, it has to first calculate 1 AND 2 and then the result AND 3.

Thanks for the help!