conjunction method
Logical and: a and b and c.
Implementation
Parser<ExpressionNode> conjunction() =>
ref0(inversion).plusSeparated(ref0(andToken)).map((seq) {
if (seq.elements.length == 1) return seq.elements.first;
return BoolOpNode(operator: 'and', values: seq.elements);
});