Avoiding Boolean Overload Vermont

Reduce your boolean logic to keep you program readable. Read this article on and learn more.

Local Companies

Comprehensive Network Solutions Inc
(802) 865-2655
24 Adams Ct
Burlington, VT
Sean McCarthy - Business Technology Consultant
(802) 386-2475
Railroad Street
St. Johnsbury, VT
Remote Backup Pro
802-275-4848
195 B High Street
Brattleboro, VT
Csl Software Solutions
(802) 861-2500
7 Kilburn St
Burlington, VT
Eiv Technical Services
(802) 244-7453
93 S Main St
Waterbury, VT

I mentor the robotics team at a local high school. Recently, I was reviewing the code of a couple students when I came across what appeared to be some very complex boolean logic. The code was using the input from several sensors to determine what to do next. Following the logic when there are only a couple booleans to take into account is not that bad, but what do you do when you are evaluating 6-8 different variables? The logic can get confusing very quickly. The first step I suggest taking is to try to simplify the boolean logic. Here are some basic rules you can apply to try to reduce your boolean logic complexity:




1. !(!x) == x
2. x | x == x
3. x | !x == true
4. !x | !y == !(x & y) - DeMorgan's Theorem
5. !x & !y == !(x | y) - DeMorgan's Theorem
6. x & x == x
7. x & !x == false
8. x | y == y | x - Commutative Law
9. x & y == y & x - Commutative Law
10. (x | y) | z == x | (y | x) - Associative Law
11. (x & y) & z == x & (y & z) - Associative Law
12. x & y | x & z == x & (y | z) - Distributive Law
13. (x | y) & (x | x) == x | (y & z) - Distributive Law
14. x | x & y == x
15. x & y | x & !y == x
16. (x & y) | (!x & z) | (y & z) == (x & y) | (!x & z)
17. (x | y) & (!x | z) & (y | z) == (x | y) & (!x | z)
18. x & (x | y) == x
19. (x | y) & (x | !y) == x


This is by no means a comprehensive list. Applying these simple rules, however, could take logic that is nearly impossible to understand and make it comprehendible. In my case, what appeared to be very complex logic boiled down to four if statements, each of which only needed to evaluate two variables. Boolean logic isn't the only place this type of thinking can help. Any time you come across code that is hard to understand, see whether there is a means to simplify the logic or remove conditions. The code will be much easier to follow and the next person who has to maintain the application will thank you.



About the Author



Read the Rest of this Article at Developer.com

Featured Local Company

Remote Backup Pro

802-275-4848
195 B High Street
Brattleboro, VT

Related Articles
- Capturing CommandBar Events in VB Add-Ins Vermont
This code sample shows how to capture all the events from your command-bars in a Visual Basic Add-In using only one declared event handler.
- An Active Server Pages Tutorial, Part 2 Vermont
- Applied Microsoft .NET Framework Programming Vermont
Related Articles
- An Active Server Pages Tutorial, Part 2 Vermont
We conclude our tutorial on working with ASP by looking at Boolean functions, sessions and cookies, text files, and accessing databases.
- Applied Microsoft .NET Framework Programming Vermont
- Capturing CommandBar Events in VB Add-Ins Vermont

Topics: 
Architecture & Design Languages & Tools Project Management Web Services
Database Microsoft & .NET Security Wireless
Java Open Source Techniques XML