Author: Michael Park Date: 2024-08-23T10:29:33-07:00 New Revision: 1821cb38995796e1b8d46357c2b26eff4ca0f88c
URL: https://github.com/llvm/llvm-project/commit/1821cb38995796e1b8d46357c2b26eff4ca0f88c DIFF: https://github.com/llvm/llvm-project/commit/1821cb38995796e1b8d46357c2b26eff4ca0f88c.diff LOG: [NFC] Fix an incorrect comment about operator precedence. (#105784) The comment talks about left-associative operators twice, when the latter mention is actually describing right-associative operators. Added: Modified: clang/lib/Parse/ParseExpr.cpp Removed: ################################################################################ diff --git a/clang/lib/Parse/ParseExpr.cpp b/clang/lib/Parse/ParseExpr.cpp index 1405aef700bec5..64f284d78b24db 100644 --- a/clang/lib/Parse/ParseExpr.cpp +++ b/clang/lib/Parse/ParseExpr.cpp @@ -607,7 +607,7 @@ Parser::ParseRHSOfBinaryExpression(ExprResult LHS, prec::Level MinPrec) { RHS = ExprError(); } // If this is left-associative, only parse things on the RHS that bind - // more tightly than the current operator. If it is left-associative, it + // more tightly than the current operator. If it is right-associative, it // is okay, to bind exactly as tightly. For example, compile A=B=C=D as // A=(B=(C=D)), where each paren is a level of recursion here. // The function takes ownership of the RHS. _______________________________________________ cfe-commits mailing list cfe-commits@lists.llvm.org https://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-commits
