Example #1
0
def concatenate(letter, first, second, nodes):
    if in_node_inputs(first) and in_node_inputs(second):
        N0 = Node()
        N0.set_letter(letter + second)

        N1 = Node()
        N1.set_letter(letter + first)
        N1.add_out(second, N0, True)

        N2 = Node()
        N2.set_letter(letter)
        N2.add_out(first, N1, True)

        nodes.append(N2)

    elif in_node_inputs(first):
        idx = get_idx(second, nodes)

        N0 = Node()
        N0.set_letter(letter)
        N0.add_out(first, nodes[idx], True)

        nodes.append(N0)
        nodes.pop(idx)

    elif in_node_inputs(second):
        idx = get_idx(first, nodes)

        N0 = Node()
        N0.set_letter(letter + second)

        nodes[idx].add_out(second, N0, False)
        nodes[idx].set_letter(letter)

    else:
        idx1 = get_idx(first, nodes)
        idx2 = get_idx(second, nodes)

        nodes[idx1].add_out("ε", nodes[idx2], False)
        nodes[idx1].set_letter(letter)
        nodes.pop(idx2)
Example #2
0
def oring(letter, first, second, nodes):
    # case if the two inputs are basic input 0 and/or 1
    if in_node_inputs(first) and in_node_inputs(second):
        N0 = Node()
        N0.set_letter(letter + "ε")

        N1 = Node()
        N1.set_letter(letter + first)
        N1.add_out("ε", N0, True)

        N2 = Node()
        N2.set_letter(letter + second)
        N2.add_out("ε", N0, True)

        N3 = Node()
        N3.set_letter(letter)
        N3.add_out(first, N1, True)
        N3.add_out(second, N2, True)

        nodes.append(N3)
    # case if one of the inputs is basic and the other one is complex
    # complex means that there is more than expression in the state
    elif in_node_inputs(first):
        idx = get_idx(second, nodes)

        N0 = Node()
        N0.set_letter(letter + "ε")

        N1 = Node()
        N1.set_letter(letter + first)
        N1.add_out("ε", N0, True)

        nodes[idx].add_out("ε", N0, False)

        N3 = Node()
        N3.set_letter(letter)
        N3.add_out(first, N1, True)
        N3.add_out("ε", nodes[idx], True)

        nodes.append(N3)
        nodes.pop(idx)
    # same previous case but with flipped inputs
    elif in_node_inputs(second):
        idx = get_idx(first, nodes)

        N0 = Node()
        N0.set_letter(letter + "ε")

        N1 = Node()
        N1.set_letter(letter + second)
        N1.add_out("ε", N0, True)

        nodes[idx].add_out("ε", N0, False)

        N3 = Node()
        N3.set_letter(letter)
        N3.add_out("ε", nodes[idx], True)
        N3.add_out(second, N1, True)

        nodes.append(N3)
        nodes.pop(idx)
    # case two inputs are complex
    else:
        idx1 = get_idx(first, nodes)
        idx2 = get_idx(second, nodes)

        N0 = Node()
        N0.set_letter(letter + "ε")

        nodes[idx1].add_out("ε", N0, False)
        nodes[idx2].add_out("ε", N0, False)

        N3 = Node()
        N3.set_letter(letter)
        N3.add_out("ε", nodes[idx1], True)
        N3.add_out("ε", nodes[idx2], True)

        if idx1 > idx2:
            nodes.pop(idx1)
            nodes.pop(idx2)
        else:
            nodes.pop(idx2)
            nodes.pop(idx1)
        nodes.append(N3)
Example #3
0
def asterisk(letter, first, nodes):
    if in_node_inputs(first):
        N0 = Node()
        N0.set_letter(letter + "ε")

        N1 = Node()
        N1.set_letter(letter + first)
        N1.add_out("ε", N0, True)

        N2 = Node()
        N2.set_letter(letter + first + first)
        N2.add_out(first, N1, True)

        N3 = Node()
        N3.set_letter(letter)
        N3.add_out("ε", N2, True)
        N3.add_out("ε", N0, True)

        N1.add_out("ε", N3, True)

        N3.set_start_true()

        nodes.append(N3)
    else:
        idx = get_idx(first, nodes)

        N0 = Node()
        N0.set_letter(letter + "ε")

        N1 = Node()
        N1.set_letter(letter)
        N1.add_out("ε", nodes[idx], True)
        N1.add_out("ε", N0, True)

        nodes[idx].add_out("ε", N0, False, N1)

        N1.set_start_true()

        nodes.append(N1)
        nodes.pop(idx)