編譯原理實(shí)驗(yàn)nfa確定化為dfa(已改無錯(cuò)字)
2022-07-27 16:57:54 本頁(yè)面
【正文】 9。: (f[j][2]) if len(s) == 0: break else: for i in s: (i) a = s return sorted(b) move 算法def move(a, e, f): a為列表 e為一個(gè)符號(hào) s = [] for i in a: for j in range(len(f)): if i == f[j][0] and f[j][1] == e: (f[j][2]) return sorted(s) 算出最終子集C1 = [] C1為最終子集C2 = [](closure(S, f))(0)while (len(C2)1) == 0: (0) for i in range(len(C1)): if C2[i] == 0: C2[i] = 1 for j in E: A = move(C1[i], j, f) if A == []: break B = closure(A, f) if B == []: break k = 0 for m in C1: if B == m: k = k+1 if k == 0: (B) (0)print(39。
數(shù)學(xué)相關(guān)推薦
鄂ICP備17016276號(hào)-1