54 lines
1.0 KiB
Python
54 lines
1.0 KiB
Python
import os
|
|
import re
|
|
import sys
|
|
|
|
|
|
def is_number(x):
|
|
try:
|
|
_ = float(x)
|
|
except ValueError:
|
|
return False
|
|
return True
|
|
|
|
|
|
def remove_numbers(seq):
|
|
return [x for x in seq if not is_number(x)]
|
|
|
|
|
|
def remove_duplicates(seq):
|
|
seen = set()
|
|
seen_add = seen.add
|
|
return [x for x in seq if x not in seen and not seen_add(x)]
|
|
|
|
|
|
def get_operands(s):
|
|
operands = re.findall("[A-z0-9_]+", s)
|
|
operands = remove_duplicates(operands)
|
|
operands = remove_numbers(operands)
|
|
return sorted(operands)
|
|
|
|
|
|
def gen_truth_table(s):
|
|
operands = get_operands(s)
|
|
width = len(operands)
|
|
stim = []
|
|
for i in range(width):
|
|
stim_op = []
|
|
for j in range(2**width):
|
|
stim_op.append((int(j/(2**i)))%2)
|
|
stim.append(stim_op)
|
|
|
|
truth_table = []
|
|
for i in range(2**width):
|
|
for j in range(width):
|
|
exec("%s = stim[j][i]" %operands[j])
|
|
truth_table.append(eval(s) != 0)
|
|
return truth_table
|
|
|
|
|
|
def main():
|
|
print(gen_truth_table("(A&B&C)|D"))
|
|
|
|
if __name__ == '__main__':
|
|
main()
|