📚 Operators Combined: Mastering Arithmetic, Logical, and Bitwise Operations in A-Level Programming | 运算符组合：掌握A-Level编程中的算术、逻辑与位运算
In A-Level programming, writing correct and efficient code often depends on how well you understand the behaviour of operators when they are combined in complex expressions. Whether you are calculating a final score, filtering data with multiple conditions, or manipulating binary values for hardware control, you must know exactly how arithmetic, relational, logical, and bitwise operators interact. This article explores the rules of operator combination, including precedence, associativity, short‑circuit evaluation, and common pitfalls, so that you can tackle any expression with confidence and precision.
在A-Level编程中，能否编写正确且高效的代码，往往取决于你对运算符在复杂表达式中组合行为理解得有多深。无论是计算最终得分、用多个条件筛选数据，还是为了硬件控制而操纵二进制值，你都必须精确掌握算术、关系、逻辑和位运算符如何相互作用。本文深入探讨运算符组合的规则，包括优先级、结合性、短路求值以及常见陷阱，让你能够自信而精准地处理任何表达式。
1. The Role of Operators in Programming | 运算符在编程中的作用
Operators are the building blocks of expressions. They tell the program to perform specific computations on one, two, or three operands and return a result. Without a clear understanding of how operators are evaluated together, you risk introducing logic errors that are difficult to trace, especially when different types of operators appear in the same line of code.
运算符是表达式的基本构件。它们告诉程序对单个、两个或三个操作数执行特定的计算并返回一个结果。如果不清楚运算符是如何被一起求值的，就很可能引入难以追踪的逻辑错误，尤其当同一行代码中出现不同类型的运算符时更是如此。
In the Edexcel specification, you are expected to construct and interpret expressions involving arithmetic, comparison, Boolean, and bitwise operators. You should also be able to trace the order of execution and predict the final outcome, which forms the foundation for algorithm design and debugging.
在Edexcel考纲中，你应当能够构造并解读涉及算术、比较、布尔和位运算符的表达式。你还应当能够追踪执行顺序并预测最终结果，这构成了算法设计和调试的基础。
2. Arithmetic Operators and Their Combinations | 算术运算符及其组合
Basic arithmetic operators include + (addition), − (subtraction), × (multiplication), ÷ (division), // (integer division), % (modulus), and ** (exponentiation). When they appear together, the standard mathematical hierarchy applies: exponentiation first, then multiplication, division, and modulus, and finally addition and subtraction.
基本算术运算符包括+（加）、−（减）、×（乘）、÷（除）、//（整除）、%（取模）和**（指数）。当它们一起出现时，遵循标准的数学层次：指数优先，其次是乘、除、取模，最后是加和减。
For example, the expression 10 + 3 × 2 ** 2 is evaluated as 10 + (3 × (2 ** 2)) = 10 + 12 = 22. Writing parentheses explicitly, even when they are not strictly required, improves readability and helps avoid misinterpretation during exams.
例如，表达式10 + 3 × 2 ** 2的求值过程是10 + (3 × (2 ** 2)) = 10 + 12 = 22。即使严格意义上不需要括号，显式加上括号也能提高可读性，并有助于避免考试中的误解。
Modulus and integer division share the same precedence as multiplication and division. In a % b + c × d, modulus and multiplication are performed left‑to‑right according to associativity rules before addition.
取模和整除与乘除具有相同的优先级。在a % b + c × d中，取模和乘法会根据结合性规则从左到右执行，之后才执行加法。
3. Relational and Equality Operators | 关系与相等运算符
Relational operators such as <, >, ≤, ≥, ==, and ≠ produce Boolean results (True or False). They have lower precedence than arithmetic operators, which means that arithmetic sub-expressions are evaluated before comparisons are made.
<、>、≤、≥、== 和 ≠ 等关系运算符产生布尔值（真或假）。它们的优先级低于算术运算符，这意味着算术子表达式会在比较之前先行求值。
Consider x + 3 > y × 2. The program first computes x + 3 and y × 2, then compares the two resulting values. You do not need parentheses for the arithmetic parts, but adding them can make the intent clearer in complex logical structures.
考虑x + 3 > y × 2。程序首先计算x + 3和y × 2，然后比较生成的两个值。你不需要为算术部分加括号，但在复杂逻辑结构中加上括号可以使意图更清晰。
Chaining multiple relational operators directly (e.g., a < b < c) is allowed in Python but may not work in all languages examined by Edexcel. It is safer to combine them with logical operators, such as a < b and b < c.
直接链接多个关系运算符（例如a < b < c）在Python中是允许的，但在Edexcel可能涉及的其他语言中未必有效。用逻辑运算符组合它们更为稳妥，例如a < b and b < c。
4. Logical Operators: AND, OR, NOT | 逻辑运算符：与、或、非
Logical operators and, or, and not are used to combine Boolean expressions. Their precedence is: not (highest), then and, then or (lowest). This ordering is crucial when you mix them without parentheses.
逻辑运算符and、or 和 not 用于组合布尔表达式。它们的优先级为：not（最高），然后是and，最后是or（最低）。当你不用括号混合它们时，这个顺序至关重要。
In the expression not A or B and C, the evaluation goes: not A is computed first, then B and C, and finally the or. This can lead to surprising results if you assumed left‑to‑right evaluation. Use parentheses to enforce the intended logic: (not A) or (B and C) is the default interpretation.
在表达式not A or B and C中，求值顺序为：先计算not A，再计算B and C，最后是or。如果你误以为是从左到右执行，就可能得到意外结果。使用括号来强制执行预期的逻辑：默认解释就是(not A) or (B and C)。
Truth tables can help you verify complex conditions. For example, (A ∨ B) ∧ ¬C is true only when C is false and at least one of A or B is true.
真值表可以帮助你验证复杂条件。例如，(A ∨ B) ∧ ¬C 为真的唯一情况是 C 为假并且 A 或 B 至少有一个为真。
5. Bitwise Operators: Manipulating Bits | 位运算符：操作比特位
Bitwise operators work on the binary representation of integers. The main ones are & (AND), | (OR), ~ (NOT), ^ (XOR), << (left shift), and >> (right shift). Their precedence sits between arithmetic and relational operators, with shifts having higher precedence than the bitwise logical operators.
位运算符作用于整数的二进制表示。主要的位运算符有&（与）、|（或）、~（非）、^（异或）、<<（左移）和>>（右移）。它们的优先级介于算术运算符和关系运算符之间，其中位移运算符的优先级高于位逻辑运算符。
For instance, a + b << 2 is parsed as (a + b) << 2 because addition has higher precedence than left shift. Similarly, x | y ^ z is x | (y ^ z) because XOR has higher precedence than OR.
例如，a + b << 2被解析为(a + b) << 2，因为加法的优先级高于左移。类似地，x | y ^ z等价于x | (y ^ z)，因为异或的优先级高于或。
Bitwise operations are frequently tested in low‑level programming tasks, such as setting specific bits in a status register or implementing efficient multiplication by powers of two using shifts.
在低级编程任务中经常考察位运算，例如设置状态寄存器中的特定位，或利用移位高效地实现乘以2的幂次。
6. Operator Precedence: The Order of Evaluation | 运算符优先级：求值顺序
Operator precedence determines which part of an expression is evaluated first when different operators appear without parentheses. The following table summarises the typical precedence hierarchy taught in A-Level programming, from highest to lowest.
运算符优先级决定了当不同运算符同时出现且没有括号时，表达式的哪一部分先被求值。下表总结了A-Level编程中典型的优先级层级，从最高到最低。
| Precedence | Operator | Description |
|---|---|---|
| 1 (highest) | ( ) | Parentheses – grouping |
| 2 | ** | Exponentiation |
| 3 | +x −x ~x | Unary plus, minus, bitwise NOT |
| 4 | * / // % | Multiplication, division, modulus |
| 5 | + − | Addition, subtraction |
| 6 | << >> | Bitwise shifts |
| 7 | & | Bitwise AND |
| 8 | ^ | Bitwise XOR |
| 9 | | | Bitwise OR |
| 10 | < > ≤ ≥ == ≠ | Comparisons |
| 11 | not | Logical NOT |
| 12 | and | Logical AND |
| 13 (lowest) | or | Logical OR |
This table makes it clear that not binds tighter than and, which in turn binds tighter than or. In an exam trace‑through, always apply the highest‑precedence operators first unless parentheses change the order.
此表清晰地表明not的绑定比and更紧，而and又比or更紧。在考试中进行手工追踪时，除非括号改变了顺序，否则总是先应用优先级最高的运算符。
7. Associativity: Left-to-Right or Right-to-Left | 结合性：从左到右还是从右到左
When two operators have the same precedence, associativity determines the direction of evaluation. Most operators are left‑associative, meaning they group from left to right. For instance, 100 ÷ 10 ÷ 2 is evaluated as (100 ÷ 10) ÷ 2 = 5, not 100 ÷ (10 ÷ 2).
当两个运算符具有相同的优先级时，结合性决定求值的方向。大多数运算符是左结合的，也就是从左到右分组。例如，100 ÷ 10 ÷ 2的求值顺序是(100 ÷ 10) ÷ 2 = 5，而不是100 ÷ (10 ÷ 2)。
Assignment operators and exponentiation, however, are right‑associative. In a = b = 5, the assignment is processed from right to left: b = 5 is performed first, then a = b. Similarly, 2 ** 3 ** 2 is evaluated as 2 ** (3 ** 2) = 2 ** 9 = 512.
然而，赋值运算符和指数是右结合的。在a = b = 5中，赋值从右到左处理：先执行b = 5，再执行a = b。类似地，2 ** 3 ** 2被求值为2 ** (3 ** 2) = 2 ** 9 = 512。
Understanding associativity is vital when you encounter lengthy expressions on an exam paper that omit brackets. Draw a bracket diagram according to the rules to reduce errors.
当你在试卷上遇到省略括号的长表达式时，理解结合性至关重要。按照规则画出括号示意图可以减少错误。
8. Combining Different Operator Types in Expressions | 在表达式中组合不同运算符类型
Real‑world programming problems often require mixing arithmetic, relational, and logical operators. The canonical example is a range check: x ≥ 10 and x ≤ 20. Because comparisons have higher precedence than and, the expression is (x ≥ 10) and (x ≤ 20), which is what we intend.
现实世界的编程问题常常需要混合使用算术、关系和逻辑运算符。一个典型示例是范围检查：x ≥ 10 and x ≤ 20。由于比较运算符的优先级高于and，表达式实际上就是(x ≥ 10) and (x ≤ 20)，正是我们所期望的。
However, an expression like a + b > c and d or e is dangerously ambiguous. The compiler first performs a + b, then compares it with c, evaluates the and with d, and finally the or with e. The result may be a non‑Boolean if the language allows it, causing subtle bugs.
然而，像a + b > c and d or e这样的表达式就存在危险的歧义。编译器先计算a + b，再与c比较，然后与d进行and，最后与e进行or。如果语言允许，结果可能是一个非布尔值，从而导致细微的错误。
As a discipline, always use parentheses to make mixed‑operator expressions crystal clear. It costs nothing and demonstrates safe programming practice.
作为一项纪律，请始终使用括号使混合运算符表达式清晰明了。这不仅没有额外代价，还能体现出安全的编程实践。
9. Short-Circuit Evaluation in Logical Expressions | 逻辑表达式中的短路求值
Languages such as Python use short‑circuit evaluation for and and or. In A and B, if A is False, B is never evaluated because the overall result is already False. In A or B, if A is True, B is skipped.
像Python这样的语言对and和or采用短路求值。在A and B中，如果A为假，B根本不会被求值，因为整个结果已经为假。在A or B中，如果A为真，则跳过B。
This feature can be exploited for efficiency and to guard against runtime errors. For instance, denom ≠ 0 and num ÷ denom > 0.5 safely checks division only when the denominator is non‑zero.
这一特性可以被用来提高效率并防止运行时错误。例如，denom ≠ 0 and num ÷ denom > 0.5仅在分母非零时才安全地进行除法检查。
In trace‑table exam questions, you must show that short‑circuited sub‑expressions are not evaluated. Mark schemes often award marks for correctly indicating that the second operand remains untouched.
在追踪表的考题中，你必须表明被短路的子表达式不会被求值。评分方案通常会对正确指出第二个操作数未被触及给予分数。
10. Common Pitfalls and Tips for Exam Success | 常见陷阱与考试成功技巧
Pitfall 1: Confusing bitwise & and | with logical and and or. Bitwise operators always evaluate both operands and return an integer, whereas logical operators may short‑circuit and return a Boolean (or the last evaluated operand).
陷阱1：混淆位运算符&和|与逻辑运算符and和or。位运算符总是对两个操作数求值并返回一个整数，而逻辑运算符可能短路并返回布尔值（或最后被求值的操作数）。
Pitfall 2: Assuming that == has the same precedence as =. The equality operator is a comparison, whereas = is assignment. In a condition like if x = 5, some languages will raise an error, but in others it may silently assign and return a truthy value.
陷阱2：假设==与=具有相同的优先级。相等运算符是比较运算符，而=是赋值运算符。在if x = 5这样的条件中，某些语言会报错，但在其他语言中可能会默默赋值并返回真值。
Tip: Write a small test expression whenever you are unsure about precedence. For exam preparation, memorise the top‑level categories: unary > arithmetic > shifts > bitwise > comparisons > logical. That mental model will resolve 95 % of the cases.
技巧：每当对优先级不确定时，就编写一个小的测试表达式。为了备考，请记住顶层的分类：一元运算符 > 算术运算符 > 位移运算符 > 位运算符 > 比较运算符 > 逻辑运算符。这个思维模型能够解决95 %的情况。
Pitfall 3: Forgetting that exponentiation is right‑associative. Writing 2 ** 3 ** 2 without brackets and assuming left‑to‑right evaluation gives 64, which is incorrect; the correct answer is 512.
陷阱3：忘记指数是右结合的。写出2 ** 3 ** 2而不加括号，并假设从左到右求值会得到64，这是错误的；正确答案是512。
11. Practical Examples: Building Complex Conditions | 实际示例：构建复杂条件
Suppose you need to check whether a student can receive a scholarship: the score must be at least 85, and either the attendance is above 90 % or the student is a prefect. The logical expression is (score ≥ 85) and (attendance > 90 or isPrefect). Without parentheses, the default precedence would still work correctly because and has lower precedence than or? Actually, and has higher precedence than or, so score ≥ 85 and attendance > 90 or isPrefect would be interpreted as ((score ≥ 85) and (attendance > 90)) or isPrefect, which is wrong. The parentheses around the or clause are essential.
假设你需要判断一名学生是否可以获得奖学金：分数至少85分，并且出勤率高于90 %或者是级长。逻辑表达式为(score ≥ 85) and (attendance > 90 or isPrefect)。如果不加括号，默认的优先级会导致错误，因为and的优先级高于or，所以score ≥ 85 and attendance > 90 or isPrefect会被解释为((score ≥ 85) and (attendance > 90)) or isPrefect，这就不对了。因此，围绕or子句的括号必不可少。
Another scenario involves bit masking. To clear the third bit of a register reg while preserving the others, you write reg & ~(1 << 2). Here the shift 1 << 2 happens first, then bitwise NOT, then bitwise AND. The parentheses around the shift are often added for clarity but are not required by precedence because << outranks ~ and &.
另一个场景涉及位掩码。要清除寄存器reg的第三位并保留其余位，你应当编写reg & ~(1 << 2)。这里首先执行移位1 << 2，接着是按位非，最后是按位与。尽管为了清晰常常加上括号，但按优先级规则括号并不是必需的，因为<<的优先级高于~和&。
Being able to construct such expressions accurately will serve you well in both the theoretical and practical components of your A-Level assessment.
能够准确地构造这类表达式，将在A-Level考核的理论和实践环节中助你一臂之力。
Published by TutorHao | Programming Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导