bitwise and x | y bitwise or x y bitwise xor (exclusive or) x >>> y logical shi� right x >> y arithme�c shi� right x << y logical/arithme�c shi� le� Here are some examples with bitwise operators: disambiguate them from the operator ++, etc. Other composi�ons of unary operators are parsed with right-associa�vity, e. g., √√-a as √(√(-a)). 2The operators +, ++ and * are non-associa�ve. a + b + c is Le� Exponen�a�on ^ Right Unary + - √ Right1 Bitshi�s << >> >>> Le� Frac�ons // Le� Mul�plica�on * / % & \ ÷ Le�2 Addi�on + - | Le�2 Syntax : .. Le� Syntax |> Le� Syntax <| Right Comparisons > <

bitwise and x | y bitwise or x y bitwise xor (exclusive or) x >>> y logical shi� right x >> y arithme�c shi� right x << y logical/arithme�c shi� le� Here are some examples with bitwise operators: disambiguate them from the operator ++, etc. Other composi�ons of unary operators are parsed with right-associa�vity, e. g., √√-a as √(√(-a)). 2The operators +, ++ and * are non-associa�ve. a + b + c is Le� Exponen�a�on ^ Right Unary + - √ Right1 Bitshi�s << >> >>> Le� Frac�ons // Le� Mul�plica�on * / % & \ ÷ Le�2 Addi�on + - | Le�2 Syntax : .. Le� Syntax |> Le� Syntax <| Right Comparisons > <

bitwise and x | y bitwise or x y bitwise xor (exclusive or) x >>> y logical shi� right x >> y arithme�c shi� right x << y logical/arithme�c shi� le� Here are some examples with bitwise operators: disambiguate them from the operator ++, etc. Other composi�ons of unary operators are parsed with right-associa�vity, e. g., √√-a as √(√(-a)). 2The operators +, ++ and * are non-associa�ve. a + b + c is Le� Exponen�a�on ^ Right Unary + - √ Right1 Bitshi�s << >> >>> Le� Frac�ons // Le� Mul�plica�on * / % & \ ÷ Le�2 Addi�on + - | Le�2 Syntax : .. Le� Syntax |> Le� Syntax <| Right Comparisons > <

bitwise and x | y bitwise or x y bitwise xor (exclusive or) x >>> y logical shi� right x >> y arithme�c shi� right x << y logical/arithme�c shi� le� Here are some examples with bitwise operators: disambiguate them from the operator ++, etc. Other composi�ons of unary operators are parsed with right-associa�vity, e. g., √√-a as √(√(-a)). 2The operators +, ++ and * are non-associa�ve. a + b + c is Le� Exponen�a�on ^ Right Unary + - √ Right1 Bitshi�s << >> >>> Le� Frac�ons // Le� Mul�plica�on * / % & \ ÷ Le�2 Addi�on + - | Le�2 Syntax : .. Le� Syntax |> Le� Syntax <| Right Comparisons > <

bitwise and x | y bitwise or x ⊻ y bitwise xor (exclusive or) x >>> y logical shift right x >> y arithmetic shift right x << y logical/arithmetic shift left Here are some examples with bitwise operators: Exponentiation ^ Right Unary + - √ Right1 Bitshifts << >> >>> Left Fractions // Left Multiplication * / % & \ ÷ Left2 Addition + - | ⊻ Left2 Syntax : .. Left Syntax |> Left Syntax <| Right Comparisons Non-associative Control flow && followed by || followed by ? Right Pair => Right Assignments = += -= *= /= //= \= ^= ÷= %= |= &= ⊻= <<= >>= >>>= Right 1The unary operators + and - require explicit parentheses

bitwise and x | y bitwise or x ⊻ y bitwise xor (exclusive or) x >>> y logical shift right x >> y arithmetic shift right x << y logical/arithmetic shift left Here are some examples with bitwise operators: Exponentiation ^ Right Unary + - √ Right1 Bitshifts << >> >>> Left Fractions // Left Multiplication * / % & \ ÷ Left2 Addition + - | ⊻ Left2 Syntax : .. Left Syntax |> Left Syntax <| Right Comparisons Non-associative Control flow && followed by || followed by ? Right Pair => Right Assignments = += -= *= /= //= \= ^= ÷= %= |= &= ⊻= <<= >>= >>>= Right 1The unary operators + and - require explicit parentheses

bitwise and x | y bitwise or x ⊻ y bitwise xor (exclusive or) x >>> y logical shift right x >> y arithmetic shift right x << y logical/arithmetic shift left Here are some examples with bitwise operators: Exponentiation ^ Right Unary + - √ Right1 Bitshifts << >> >>> Left Fractions // Left Multiplication * / % & \ ÷ Left2 Addition + - | ⊻ Left2 Syntax : .. Left Syntax |> Left Syntax <| Right Comparisons Non-associative Control flow && followed by || followed by ? Right Pair => Right Assignments = += -= *= /= //= \= ^= ÷= %= |= &= ⊻= <<= >>= >>>= Right 1The unary operators + and - require explicit parentheses

bitwise and x | y bitwise or x ⊻ y bitwise xor (exclusive or) x >>> y logical shift right x >> y arithmetic shift right x << y logical/arithmetic shift left Here are some examples with bitwise operators: Exponentiation ^ Right Unary + - √ Right1 Bitshifts << >> >>> Left Fractions // Left Multiplication * / % & \ ÷ Left2 Addition + - | ⊻ Left2 Syntax : .. Left Syntax |> Left Syntax <| Right Comparisons Non-associative Control flow && followed by || followed by ? Right Pair => Right Assignments = += -= *= /= //= \= ^= ÷= %= |= &= ⊻= <<= >>= >>>= Right 1The unary operators + and - require explicit parentheses

bitwise and x | y bitwise or x ⊻ y bitwise xor (exclusive or) x >>> y logical shift right x >> y arithmetic shift right x << y logical/arithmetic shift left Here are some examples with bitwise operators: Exponentiation ^ Right Unary + - √ Right1 Bitshifts << >> >>> Left Fractions // Left Multiplication * / % & \ ÷ Left2 Addition + - | ⊻ Left2 Syntax : .. Left Syntax |> Left Syntax <| Right Comparisons Non-associative Control flow && followed by || followed by ? Right Pair => Right Assignments = += -= *= /= //= \= ^= ÷= %= |= &= ⊻= <<= >>= >>>= Right 1The unary operators + and - require explicit parentheses

bitwise and x | y bitwise or x ⊻ y bitwise xor (exclusive or) x >>> y logical shift right x >> y arithmetic shift right x << y logical/arithmetic shift left Here are some examples with bitwise operators: Exponentiation ^ Right Unary + - √ Right1 Bitshifts << >> >>> Left Fractions // Left Multiplication * / % & \ ÷ Left2 Addition + - | ⊻ Left2 Syntax : .. Left Syntax |> Left Syntax <| Right Comparisons Non-associative Control flow && followed by || followed by ? Right Pair => Right Assignments = += -= *= /= //= \= ^= ÷= %= |= &= ⊻= <<= >>= >>>= Right 1The unary operators + and - require explicit parentheses