<p>Is there really an order of precedence for like boolean conditions?
When its like:
Condition || condition && condition || condition</p>
<p>or do you just go from left to right?</p>
<p>a || b && c || d</p>
<p>is the same as</p>
<p>((a || b) && c) || d</p>
<p>There’s no order of precedence unless you add parenthesis. It occurs left-to-right. Once the result of the boolean expression is known, the condition short circuits and does not execute any remaining expressions.</p>
<p>Barrons say:</p>
<p>highest precedence
- !, ++, –
- *, /, %
- +, -
- <, >, <=, >=
- ==, !=
- &&
- ||
- =, +=, -=, *=, /=, %=
lowest precedence</p>
<p>so a || b && c || d should be </p>
<p>a || (b &&c) || d</p>
<p>even though that feels weird to do it like that … >_<</p>
<p>I don’t know anything about the Com Sci AP so this is not relevant to the test, however, in most real computer languages, the AND and OR logical operators have equal precendence. The PASCAL language was an exception with AND higher, etc. Note APL expressions are evaluated right to left. Anyway, when in doubt use parentheses.</p>
<p>is lucidity right?</p>
<p>Yes. && is evaluated before ||.</p>
<p>Yes, I cheked it in my barrons book and on a compiler. What Lucidity said was true.</p>
<p>do we have to memorize all the preferences?</p>
<p>Precedences? No, you don’t have to. They try to trick you on important stuff, not operator precedence! Learn DeMorgan’s law though, it’s dead useful.</p>
<p>sorry…what’sdeMorgan’s law?
(I’m taking A only btw)</p>
<p>Wikipedia is very useful.</p>