Lines Matching full:binop
371 // Make sure it's a declared binop.
408 a sequence of [binop,primaryexpr] pairs:
444 // If this is a binop, find its precedence.
448 // If this is a binop that binds at least as tightly as the current binop,
462 // Okay, we know this is a binop.
463 int BinOp = CurTok;
464 getNextToken(); // eat binop
477 In particular, we could have "(a+b) binop unparsed" or "a + (b binop
478 unparsed)". To determine this, we look ahead at "binop" to determine its
479 precedence and compare it to BinOp's precedence (which is '+' in this
484 // If BinOp binds less tightly with RHS than the operator after RHS, let
489 If the precedence of the binop to the right of "RHS" is lower or equal
491 parentheses associate as "(a+b) binop ...". In our example, the current
502 LHS = llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS),
511 the 'if' conditional above with "\*" as the binop to the right of the
523 // If BinOp binds less tightly with RHS than the operator after RHS, let
532 LHS = llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS),
538 primary has higher precedence than the binop we are currently parsing.
