Assume the following rules of associativity and precedence for expressions: Prec

Question

Assume the following rules of associativity and precedence for expressions: Precedence Highest *, /, not +, -, &, mod - (unary) =, /=, and Lowest or, xor Associativity Left to right Show the order of evaluation of the following expressions by paremhesizing all subexpressions and placing a superscript on the right parenthesis to indicate order. For example, for the expression a + b * c + d the order of evaluation would be represented as ((a + (b * c)^1)^2 + d)^3 a * b - l + c a * (b - 1)/c mod d (a - b)/c & (d * e/a - 3) -a or c = d and e a > b xor c or d

Explanation / Answer

9) a) a * b – 1 + c => ( (a * b) 1 – (1 + c) 2 ) 3

b) a * (b - 1) / c mod d => (((a * (b - 1) 1 ) 2 / c) 3 mod d) 4

c) (a - b) / c & (d * e / a - 3) => (((a - b) 3 / c ) 4 & (((d * e) 1 / a) 2 - 3) 5 ) 6

d) -a or c = d and e => ((-a) 1 or ((c = d) 2 and e) 3 ) 4

e) a > b xor c or d <= 17 => (((a > b) 1 xor c) 2 or (d <= 17) 2) 4

f) –a + b = > (-(a + b) 1) 2

10) a) a * b – 1 + c => (a * (b – (1 + c) 1 ) 2 ) 3

b) a * (b - 1) / c mod d => ( a * ( (b - 1) 2 / (c mod d) 1 ) 3 ) 5

c) (a - b) / c & (d * e / a - 3) => ((a - b) 5 / (c & (d * (e / (a – 3) 1 ) 2 ) 3 ) 4 ) 6

d) -a or c = d and e => (-a or (c = (d and e) 1 ) 2) 3

e) a > b xor c or d <= 17 => (a > (b xor (c or (d <= 17) 1) 2) 3) 4

f) –a + b = > (-(a + b) 1) 2

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.