Handy Orchard

Boolean truth table

Enumerate a bounded Boolean truth table using an explicit expression parser, with a downloadable CSV.

Your input

Variables A–H; NOT, AND, XOR, OR and parentheses. Precedence is NOT > AND > XOR > OR.

Outputs are cleared when the input changes.

Result

Enter your data or use the example, then run the tool.

Worked example

A AND NOT B is true only when A is true and B is false.

A OR NOT A is true for every row. An unclosed parenthesis is rejected.

Method

A tokenizer and precedence parser build the expression; every combination of the variables is evaluated.

CSV uses 0/1 and preserves the variable columns; no JavaScript eval is used.

Limits

At most 8 variables, 256 rows, 4,096 UTF-8 bytes and 64 nesting levels.

Not a general JavaScript runner, minimizer or formal proof assistant; only the documented grammar is accepted.

Sources

MDN: Boolean logical AND

Related tools

Bitwise operation labText list set operations

Your inputs stay on this device. Only optional, consented page visits are measured. Input values, files, filenames and processing logs are not sent to Analytics.

When switching languages, text, settings and selected files are temporarily kept on this device. Transfers are removed after restoring; interrupted transfers are cleaned up on a later visit. Inputs and files are never uploaded.