什么是运算符的结合性以及为什么它很重要?
对于运算符来说什么是结合性以及为什么它很重要?
What is associativity for an operator and why is it important?
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
对于运算符来说什么是结合性以及为什么它很重要?
What is associativity for an operator and why is it important?
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
接受
或继续使用网站,即表示您同意使用 Cookies 和您的相关数据。
发布评论
评论(10)
简单!!
我们知道 *、/ 和 % 具有相同的优先级,但根据结合性,答案可能会改变:
例如:我们有表达式:4 * 8 / 2 % 5
Simple!!
We know *, /, and % have same precedence, but as per associativity, answer may change:
For eg: We have expression: 4 * 8 / 2 % 5
它是相同优先级的运算符的求值顺序。 从左到右或从右到左的顺序很重要。 因为
如果它是从左到右,那么它是
并且是0。如果它是从右到左,那么它是
并且它是2。在大多数语言中,我们说减号运算符具有从左到右的结合性。
2020 年更新:
如果声明是“当然我们是从左到右做的”,那么关于
3 - 2 - 1
的情况可能看起来微不足道。 但在其他情况下,例如在 Ruby 或 NodeJS 中完成:**
是“to the power of”运算符。 结合性是从右到左。 它是
2 ** 9
,即512
,而不是8 ** 2
,即64
。it is the order of evaluate for operators of the same precedence. The LEFT TO RIGHT or RIGHT TO LEFT order matters. For
if it is LEFT to RIGHT, then it is
and is 0. If it is RIGHT to LEFT, then it is
and it is 2. In most languages, we say that the minus operator has a LEFT TO RIGHT associativity.
Update 2020:
The situation about
3 - 2 - 1
might seem trivial, if the claim is, "of course we do it from left to right". But in other cases, such as if done in Ruby or in NodeJS:The
**
is "to the power of" operator. The associativity is from right to left. And it iswhich is
2 ** 9
, i.e.,512
, instead ofwhich is
8 ** 2
, i.e.,64
.如果您指的是“运算符关联性” - 它是一种语言如何确定在没有括号的情况下如何对相同优先级的运算符进行分组。
例如,基于 C 的语言中的 + 和 - 运算符具有相同的优先级。 当您编写同时使用它们(不带括号)的表达式时,编译器必须确定计算它们的顺序。
如果您编写 12 - 5 + 3,则可能的计算包括:
根据计算表达式的顺序,您可以获得不同的结果。 在基于 C 的语言中,+ 和 - 具有左结合性,这意味着上面的表达式将作为第一种情况进行计算。
所有语言都有严格定义的优先级和结合性规则。 您可以在此处详细了解 C# 的规则。 运算符结合性和优先级在维基百科上有很好的介绍。
If you are referring to "operator associativity" - it is how a language determines how operators of the same precedence are grouped in the absence of parentheses.
For example, the + and - operators in C-based languages have the same precedence. When you write an expression that uses both of them (without parentheses) the compiler must determine what order to evaluate them in.
If you write 12 - 5 + 3, the possible evaluations include:
Depending on the order you evaluate the expression in, you can get different results. In C-based languages, + and - have left associativity, which means that the expression above would evaluate as the first case.
All language have strongly-defined rules for both precedence and associativity. You can learn more about the rules for C# here. The general concepts of operator associativity and precedence are well covered on wikipedia.
这是操作数与运算符的绑定顺序。 基本上:
a - b + c
可能被评估为(假设 - 和 + 具有相同的优先级):
((a - b) + c) 或,
(a - (b + c))
如果运算符是左关联的(立即绑定到左操作数),它将被评估为第一个。 如果它们是右结合的,则将其计算为第二个。
It's the order of binding of operands to an operator. Basically:
a - b + c
might be evaluated as (assuming - and + have the same precedence):
((a - b) + c) or,
(a - (b + c))
If operators are left associative (bind immediately to the left operand), it'll be evaluated as the first. If they are right associative, it'll be evaluated as the second.
如果您指的是运算符结合性:
它定义了解析表达式的方式。 它给出了一个标准,因此每个表达式都以相同的方式进行解析。
这对于具有相同优先级的操作来说非常重要,因为这可能会产生副作用。
If you mean operator associativity:
It defines the way expressions are parsed. It gives a standard, so every expression is parsed the same way.
It's mostly important for operations which have the same precedense, when there could be side effects.
前面的大多数示例都使用了常量。 如果参数碰巧是函数调用,则调用的顺序可能由关联规则确定,当然取决于您的编译器。 如果这些功能有副作用..
Most of the previous examples have used constants. If the arguments happen to be function calls, the order that the calls are made in may be determined by the association rules, depending of course on your compiler. And if those functions have side effects ..
我们都知道优先级很重要,但解释表达式含义时的关联性也很重要。 如需真正简单的介绍,请尝试操作员的力量。
We all know that precedence is important but so is associativity in interpreting the meaning of an expression. For a really simple intro try Power of Operators.
关联性属于编程语言概念中的计算顺序。 计算的顺序决定了表达式的含义。 它有两个主要规则,
优先级规则定义不同类型的“相邻”运算符的计算顺序。 每种编程语言都有自己的关于其运算符的运算符优先级表。
回到结合性,
它定义了具有相同优先级的相邻操作的执行顺序。
它有3种口味,
如果一个运算符是左结合的,那么它会从左到右进行计算,同样,如果它是右结合的,它会从右到左进行计算。
Associativity comes under the order of computation in the programming language concepts. The order of computation determines the meaning of the expression. It has two main rules,
precedence rules define the order in which "adjacent" operators of different types are evaluated. Every programming language has its own operator precedence table regarding its operators.
Coming back to the associativity,
It defines the order of execution of adjacent operations with the same precedence.
It has 3 flavors,
If an operator is left-associative it evaluates from left to right likewise if it is right-associative it evaluates from right to left.
对于运算符来说,关联性意味着当同一运算符出现在一行中时,我们首先应用哪个运算符出现。 在下面,让
Q
为运算符如果
Q
是左结合的,那么它的计算结果为如果它是右结合的,那么它的计算结果为
这很重要,因为它会改变表达式的含义。 考虑带有整数算术的除法运算符,它是左关联的
如果它是右关联的,它将计算为未定义的表达式,因为您将除以零
For operators, associativity means that when the same operator appears in a row, then which operator occurence we apply first. In the following, let
Q
be the operatorIf
Q
is left associative, then it evaluates asAnd if it is right associative, then it evaluates as
It's important, since it changes the meaning of an expression. Consider the division operator with integer arithmetic, which is left associative
If it were right associative, it would evaluate to an undefined expression, since you would divide by zero
结合律分为三种:
数学中的结合律
编程语言中的运算顺序
CPU 缓存中的关联性。
数学中的关联性是加法 (+) 等运算符的属性。 此属性允许您在不更改语句值的情况下重新排列括号,即:
在编程语言中,运算符的结合性(或固定性)是确定相同优先级的运算符如何在缺席中分组的属性。 /em> 括号; 即每个运算符的计算顺序。 这在编程语言之间可能有所不同。
在 CPU 缓存中,关联性是一种优化性能的方法。
There are three kinds of associativity:
The Associative property in mathematics
Order of Operations in programming languages
Associativity in CPU caches.
The Associative property in mathematics is a property of operators such as addition (+). This property allows you to rearrange parentheses without changing the value of a statement, i.e.:
In programming languages, the associativity (or fixity) of an operator is a property that determines how operators of the same precedence are grouped in the absence of parentheses; i.e. in what order each operator is evaluated. This can differ between programming languages.
In CPU caches, associativity is a method of optimizing performance.