No. 01 stablelogic · circuitsSep 29, 2026

Expression to logic gates

Type a Boolean expression in words or symbols (∧ ∨ ¬ ⊕ → ↔) with round, square or curly brackets. You get the circuit, live inputs and a truth table.

Boolean expression

Separate several outputs with ; and name them if you like, for example Sum = A ⊕ B; Carry = A ∧ B.

Merge chains into multi-input gates Draw only AND, OR and NOT gates Read AB as A·B (runs of same-case letters)

Try an example

Flip a variable here, or click its box in the circuit.

Blue is 0. Red is 1.

Fig. 1

Wires and gates take the colour of their current value.

Drag to pan. Ctrl or ⌘ + scroll to zoom.

Table 1

Show a column for every sub-expression

Click a row to load those values into the circuit.

Ref. Accepted syntax

NOT	NOT ¬ ~ ! − Before a term. Or after it as A′ or A' or A̅.
AND	AND ∧ · . & && * Or write terms side by side: AB, A(B+C), A′B.
OR	OR ∨ + \| \|\|
XOR	XOR ⊕ ^ ⊻
NAND / NOR	NAND ⊼ ↑ NOR ⊽ ↓
XNOR	XNOR ⊙ ↔ ⇔ ≡ <-> IFF
IMPLIES	IMPLIES → ⇒ ⊃ -> => Drawn as a labelled box, since it has no standard symbol. Tick “Draw only AND, OR and NOT” to expand it.
Constants	0 1 TRUE FALSE ⊤ ⊥
Brackets	( ) [ ] { } Any mix, but each pair must match: [ (A) ] works, [ (A ] does not.
LaTeX	\land \lor \neg \oplus \to \iff Also accepted, so you can paste from a document.
Precedence	NOT, then AND / NAND, then XOR / XNOR, then OR / NOR, then →, then ↔ → groups to the right: A → B → C means A → (B → C). The “Read as” line shows exactly how your expression was grouped.