aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMichael Park <mcypark@gmail.com>2024-08-23 10:29:33 -0700
committerGitHub <noreply@github.com>2024-08-23 10:29:33 -0700
commit1821cb38995796e1b8d46357c2b26eff4ca0f88c (patch)
tree42daf9a50eb4d633b58b8e9185220f61f982f9c8
parentdf9767385701b6bb2ff0411ad6b407bcefbfe34c (diff)
downloadllvm-1821cb38995796e1b8d46357c2b26eff4ca0f88c.zip
llvm-1821cb38995796e1b8d46357c2b26eff4ca0f88c.tar.gz
llvm-1821cb38995796e1b8d46357c2b26eff4ca0f88c.tar.bz2
[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.
-rw-r--r--clang/lib/Parse/ParseExpr.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/clang/lib/Parse/ParseExpr.cpp b/clang/lib/Parse/ParseExpr.cpp
index 1405aef..64f284d 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.