Skip to content

Latest commit

 

History

History
77 lines (69 loc) · 677 Bytes

File metadata and controls

77 lines (69 loc) · 677 Bytes

boolean-formula-parser

A stupid utility to parse boolean formulas and print thruth tables for me in university.

Examples:

¬X

X|(¬X)
0|1
1|0

Y ← X

Y|X|(Y←X)
0|0|1
1|0|1
0|1|0
1|1|1

X → Y

X|Y|(X→Y)
0|0|1
1|0|0
0|1|1
1|1|1

Z → ¬X

Z|X|(Z→¬X)
0|0|1
1|0|1
0|1|1
1|1|0

(X → Y) v (Z → ¬X)

X|Y|Z|((X→Y)v(Z→¬X))
0|0|0|1
1|0|0|1
0|1|0|1
1|1|0|1
0|0|1|1
1|0|1|0
0|1|1|1
1|1|1|1

A ^ (B v ¬C)

A|B|C|(A^(Bv¬C))
0|0|0|0
1|0|0|1
0|1|0|0
1|1|0|1
0|0|1|0
1|0|1|0
0|1|1|0
1|1|1|1

A ^ B v ¬C

A|B|C|(A^Bv¬C)
0|0|0|1
1|0|0|1
0|1|0|1
1|1|0|1
0|0|1|0
1|0|1|0
0|1|1|0
1|1|1|1