To help visualize how this is being evaluated, maybe it'll help if we break it down in the order it's being evaluated. An equivalent statement for the strict left-to-right evaluation would be this:
W (((1=0) && 1) = 0) ; nested operations in different text color.
So, to evaluate (1=0) first, 1=0 is false, therefore the result is zero.
That now makes the full equation:
W ((0 && 1) = 0) ;
Now, let's evaluate (0 && 1) -- 0 && 1 equates to zero also.
That now makes the full equation:
W (0 = 0) ; last nested part of the equation;
So, lastly, the result of 0=0 is true, or 1.
I hope this explanation helps!