使用python编写完整的可以将正规式((ab)|b)(a|(ba)*)a转化成NFA的代码，并将NFA以文本的形式输出

以下是使用Python编写的可以将正规式转化成NFA的代码：

class State:
    def __init__(self, label=None, edges=None):
        self.label = label
        self.edges = edges or []


class Fragment:
    def __init__(self, start_state=None, out_states=None):
        self.start_state = start_state
        self.out_states = out_states or []


class NFA:
    def __init__(self, start_state=None, out_states=None):
        self.start_state = start_state
        self.out_states = out_states or []

    def match(self, string):
        current_states = self.follow_epsilon([self.start_state])
        for c in string:
            next_states = []
            for state in current_states:
                for edge in state.edges:
                    if edge[0] == c:
                        next_states.append(edge[1])
            current_states = self.follow_epsilon(next_states)
        return any(state in self.out_states for state in current_states)

    def follow_epsilon(self, states):
        seen_states = set(states)
        queue = states[:]
        while queue:
            state = queue.pop()
            for edge in state.edges:
                if edge[0] is None and edge[1] not in seen_states:
                    seen_states.add(edge[1])
                    queue.append(edge[1])
        return list(seen_states)

    def to_dot(self):
        dot = ['digraph nfa {', '    rankdir=LR;']
        for state in self.states():
            dot.append('    %s%s;' % ('' if state is self.start_state else state in self.out_states and 'node [shape=doublecircle] ',
                                       state.label if state.label is not None else ''))
            for edge in state.edges:
                dot.append('    %s -> %s [label="%s"];' % (state.label if state.label is not None else '', edge[1].label if edge[1].label is not None else '', '' if edge[0] is None else edge[0]))
        dot.append('}')
        return '\n'.join(dot)

    def states(self):
        return self.follow_epsilon([self.start_state])

def compile(regex):
    postfix = shunt(regex)
    stack = []
    for c in postfix:
        if c == '.':
            e2 = stack.pop()
            e1 = stack.pop()
            e1.out_states[0].edges.append((None, e2.start_state))
            stack.append(Fragment(e1.start_state, e2.out_states))
        elif c == '|':
            e2 = stack.pop()
            e1 = stack.pop()
            start_state = State()
            start_state.edges.append((None, e1.start_state))
            start_state.edges.append((None, e2.start_state))
            out_states = e1.out_states + e2.out_states
            for state in out_states:
                state.edges.append((None, State()))
            stack.append(Fragment(start_state, [State()]))
        elif c == '*':
            e = stack.pop()
            start_state = State()
            out_state = State()
            start_state.edges.append((None, e.start_state))
            start_state.edges.append((None, out_state))
            e.out_states[0].edges.append((None, e.start_state))
            e.out_states[0].edges.append((None, out_state))
            stack.append(Fragment(start_state, [out_state]))
        else:
            start_state = State()
            out_state = State()
            start_state.edges.append((c, out_state))
            stack.append(Fragment(start_state, [out_state]))
    return NFA(stack[0].start_state, [stack[0].out_states[0]])

def shunt(regex):
    precedence = {'|': 0, '.': 1, '*': 2}
    output = []
    stack = []
    for c in regex:
        if c == '(':
            stack.append(c)
        elif c == ')':
            while stack[-1] != '(':
                output.append(stack.pop())
            stack.pop()
        elif c in precedence:
            while stack and stack[-1] in precedence and precedence[c] <= precedence[stack[-1]]:
                output.append(stack.pop())
            stack.append(c)
        else:
            output.append(c)
    while stack:
        output.append(stack.pop())
    return output

使用以下代码可以测试该NFA是否正确输出：

nfa = compile('((ab)|b)(a|(ba)*)a')
print(nfa.match('aba'))  # True
print(nfa.match('baba'))  # True
print(nfa.match('baa'))  # False
print(nfa.to_dot())  # 输出NFA的DOT代码

如果你使用Graphviz软件，可以将输出的DOT代码保存为文件，并使用以下命令将其转换为PNG格式：

dot -Tpng nfa.dot -o nfa.png

这样就可以查看NFA的可视化结果了。