Mathematicians and engineers often use plus (+) for OR and a product sign (.) for AND. OR and AND are somewhat analogous to addition and multiplication in other algebraic structures, and this notation makes it very easy to get sum of products form for normal algebra. NOT may be represented by a line drawn above the expression being negated. It also commonly leads to . giving a higher precedence than +, removing the need for parenthesis in some cases.

From the Boolean logic page on Wikipedia:


So, would it be:
(a AND b) or (c AND d)

The expression is true if both a and b are true, OR if c and d are true.

Easiest way is to use parenthesis as there is no penalty on excessive parenthesis usage (as it's stripped out during compilation anyway) and it aids in readability

(((That)(')(s)) (my) (usual) (approach)(.))



But just came across a bit that didn't have any and wondered how it would work. I wrote a bit of code to try some values but just thought I'd ask aswell

I agree!

(.)(.) <-- For JJ

</Totally pointless post>

(.)(.) <-- For JJ

(.)(.) <-- For JJ

Was trying to think of another one and discovered this version of Yoshi peering through a letter box...

( .Y. )

I prefer

( , )( , ) <-- tassels/pasties

Leaking...?