Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
type(tree_t), | intent(in) | :: | tree | |||
integer(kind=int32), | intent(in) | :: | idx | |||
type(nfa_graph_t), | intent(inout) | :: | nfa | |||
integer(kind=int32), | intent(in) | :: | entry_i | |||
integer(kind=int32), | intent(in) | :: | exit_i |
pure recursive subroutine generate_nfa_concatenate(tree, idx, nfa, entry_i, exit_i) implicit none type(tree_t), intent(in) :: tree type(nfa_graph_t), intent(inout) :: nfa integer(int32), intent(in) :: idx integer(int32), intent(in) :: entry_i, exit_i integer(int32) :: node1 call nfa%new_nfa_node() if (nfa%is_exceeded()) call nfa%reallocate() node1 = nfa%top call generate_nfa(tree, tree%nodes(idx)%left_i, nfa, entry_i, node1) call generate_nfa(tree, tree%nodes(idx)%right_i, nfa, node1, exit_i) end subroutine generate_nfa_concatenate