I'd consider an accurate description of the precedence for the boolean operators. They're treated as equivalent to their arithmetic cognates (~ == not, * == and

I'd consider an accurate description of the precedence for the boolean operators. They're treated as equivalent to their arithmetic cognates (~ == not, * == and, + == or) forcing you to use excessive parentheses to separate terms. Notably, this is something that Wirthian styled Ada didn't copy.