Lines Matching refs:precedence

101 Note that there is no discussion about precedence of binary operators,
354 (multiplication) has higher *precedence* than "+" (addition).
359 This parsing technique uses the precedence of binary operators to guide
364     /// BinopPrecedence - This holds the precedence for each binary operator that is
368     /// GetTokPrecedence - Get the precedence of the pending binary operator token.
381       // 1 is lowest precedence.
391 reader). The ``GetTokPrecedence`` function returns the precedence for
399 expressions. The basic idea of operator precedence parsing is to break
402 Operator precedence parsing considers this as a stream of primary
426 us. It takes a precedence and a pointer to an expression for the part
433 The precedence value passed into ``ParseBinOpRHS`` indicates the
434 *minimal operator precedence* that the function is allowed to eat. For
436 passed in a precedence of 40, it will not consume any tokens (because
437 the precedence of '+' is only 20). With this in mind, ``ParseBinOpRHS``
446       // If this is a binop, find its precedence.
455 This code gets the precedence of the current token and checks to see if
456 if is too low. Because we defined invalid tokens to have a precedence of
481 precedence and compare it to BinOp's precedence (which is '+' in this
491 If the precedence of the binop to the right of "RHS" is lower or equal
492 to the precedence of our current operator, then we know that the
495 same precedence. In this case we'll create the AST node for "a+b", and
514 primary. In this case, the precedence of "\*" is higher than the
515 precedence of "+" so the if condition will be entered.
540 primary has higher precedence than the binop we are currently parsing.
542 higher precedence than "+" should be parsed together and returned as
544 specifying "TokPrec+1" as the minimum precedence required for it to