Truth Table Generator
Evaluate a Boolean expression for every combination of its variables. Processing takes place locally in your browser.
Start using
Generate a truth table and optionally include canonical DNF and CNF. These forms are complete, not algebraically minimized; at most six variables are supported.
A AND NOT B 00 → 0; 01 → 0; 10 → 1; 11 → 0
Truth Table Generator
Enter a Boolean expression up to 1000 characters using ASCII variable names, parentheses, !, && and ||, or the words NOT, AND and OR. Constants true and false are also recognized.
The parser rejects unsupported characters and mismatched parentheses. At most six distinct variables are allowed, producing at most 64 assignment rows.
Rows enumerate binary assignments from all zeroes through all ones, with variables ordered by their first appearance in the expression. A && !B is true on the row A=1, B=0.
Output is tab-separated plain text with one column per variable and a final 0 or 1 result. Operator precedence is NOT, then AND, then OR.
This is a Boolean evaluator, not a circuit simulator or simplifier. It does not support XOR, implication, equality, bitwise values, multi-valued logic, don't-cares or user-selected variable order.
Processing takes place locally in your browser.