src/abstract-syntax-tree.js
function processLogicalAnd(tokenizer, scope) {
  let node = processLogicalEquality(tokenizer, scope);

  while (tokenizer.token.match(types.LOGICAL_AND)) {
    node = createOperatorNode(tokenizer.token.value, [node, processLogicalEquality(tokenizer.skipToken(), scope)]);
  }

  return node;
}
function processLogicalAnd(tokenizer, scope) {
  let node = processLogicalEquality(tokenizer, scope);

  while (tokenizer.token.match(types.LOGICAL_AND)) {
    node = createOperatorNode(tokenizer.token.value, [node, processLogicalEquality(tokenizer.skipToken(), scope)]);
  }

  return node;
}
function processLogicalAnd ( tokenizer , scope ) { let node = processLogicalEquality ( tokenizer , scope ) ; while ( tokenizer . token . match ( types . LOGICAL_AND ) ) { node = createOperatorNode ( tokenizer . token . value , [ node , processLogicalEquality ( tokenizer . skipToken ( ) , scope ) ] ) ; } return node ; }
Process logical AND operator
@return {Function} compiled node
@private
Process logical AND operator