我是python的新手,这是我朋友发送给我的一些代码,这是Quine-McCluskey算法,提供了获得最小项的答案,代码虽然很简单,但是因为我不是Python程序员没有解决这个问题的主意
这是源代码:Quine-McCluskey (github)
def find_minimum_cost(Chart, unchecked):
P_final = []
#essential_prime = list with terms with only one 1 (Essential Prime Implicants)
essential_prime = find_prime(Chart)
essential_prime = remove_redundant_list(essential_prime)
#print out the essential primes
if len(essential_prime)>0:
s = "\nEssential Prime Implicants :\n"
for i in range(len(unchecked)):
for j in essential_prime:
if j == i:
s= s+binary_to_letter(unchecked[i])+' , '
print s[:(len(s)-3)] #ERROR <--------
#modifiy the chart to exclude the covered terms
for i in range(len(essential_prime)):
for col in range(len(Chart[0])):
if Chart[essential_prime[i]][col] == 1:
for row in range(len(Chart)):
Chart[row][col] = 0
-
File "C:\Users\Lenovo\Desktop\main.py", line 204
print s[:(len(s)-3)]
^
SyntaxError: invalid syntax
此行中有错误:print s [:( len(s)-3)]
答案 0 :(得分:0)
最初的作者打算使用python2解释器执行该程序。 他写道(大致):
print s
要使用现代python3解释器执行,您将需要:
print(s)