Lines Matching refs:precedence

101 Note that there is no discussion about precedence of binary operators,
352 (multiplication) has higher *precedence* than "+" (addition).
357 This parsing technique uses the precedence of binary operators to guide
362     /// BinopPrecedence - This holds the precedence for each binary operator that is
366     /// GetTokPrecedence - Get the precedence of the pending binary operator token.
379       // 1 is lowest precedence.
389 reader). The ``GetTokPrecedence`` function returns the precedence for
397 expressions. The basic idea of operator precedence parsing is to break
400 Operator precedence parsing considers this as a stream of primary
424 us. It takes a precedence and a pointer to an expression for the part
431 The precedence value passed into ``ParseBinOpRHS`` indicates the
432 *minimal operator precedence* that the function is allowed to eat. For
434 passed in a precedence of 40, it will not consume any tokens (because
435 the precedence of '+' is only 20). With this in mind, ``ParseBinOpRHS``
444       // If this is a binop, find its precedence.
453 This code gets the precedence of the current token and checks to see if
454 if is too low. Because we defined invalid tokens to have a precedence of
479 precedence and compare it to BinOp's precedence (which is '+' in this
489 If the precedence of the binop to the right of "RHS" is lower or equal
490 to the precedence of our current operator, then we know that the
493 same precedence. In this case we'll create the AST node for "a+b", and
512 primary. In this case, the precedence of "\*" is higher than the
513 precedence of "+" so the if condition will be entered.
538 primary has higher precedence than the binop we are currently parsing.
540 higher precedence than "+" should be parsed together and returned as
542 specifying "TokPrec+1" as the minimum precedence required for it to