simplify | pigeon-hole principle | sudoku | logic puzzles | normalizer

Simplification Algorithm for CL-Expressions

simplify a CL-expression by the method of Elimination

BEWARE: put spaces between letters, as 'a b', for example.
'ab' (with no space) will be interpreted as the name of a single token, ab.

Given string:

Parsed...

Simplified:

Test for Equivalence

If the two expressions are A, B, the expression (A(B))((A)B) is simplified and tested for void-equivalence

Equivalence-expression:

Parsed...

Answer: