content_image/683424.jpg content_image/683422.jpg content_image/683423.jpg
<img src='content_image/683424.jpg'>

Examples: 

<img src='content_image/683422.jpg'>

We recommend that you refer to the table below whenever in doubt of the exact rules of operator precedence. 

<img src='content_image/683423.jpg'>

See Appendix B for a full description of operators. 

Boolean expressions have the property that their value may be known before the entire expression has been evaluated. Assume for example, that x = o. Then the value of the expression 

(X > 0) and (X < 10) 

is already known to be false after computation of the first factor, and the second need not be evaluated. Whether or not the second factor is evaluated is implementation-dependent. This means that you must assure that the second factor is well defined, independent of the value of the first factor. Hence, if we assume that the array A has an index ranging from I to 10, then the following example is in error! (Arrays are discussed in Chapter 6.) 

I ; = 0; 

repeat I ;= I + 1 until (I > 10) or (A[I] = 0) (Note that if no A [I] = 0, a reference to A [11] will occur.) 

