Method deprecated or moved
This method is deprecated or moved on the latest stable version.
The last existing version (v4.2.9) is shown here.
generalized_table()
public
Returns a generalized transition graph with reduced states.
The states
are reduced like a DFA, but the table must be simulated like an NFA.
Edges of the GTG are regular expressions.
# File actionpack/lib/action_dispatch/journey/nfa/transition_table.rb, line 52
def generalized_table
gt = GTG::TransitionTable.new
marked = {}
state_id = Hash.new { |h,k| h[k] = h.length }
alphabet = self.alphabet
stack = [eclosure(0)]
until stack.empty?
state = stack.pop
next if marked[state] || state.empty?
marked[state] = true
alphabet.each do |alpha|
next_state = eclosure(following_states(state, alpha))
next if next_state.empty?
gt[state_id[state], state_id[next_state]] = alpha
stack << next_state
end
end
final_groups = state_id.keys.find_all { |s|
s.sort.last == accepting
}
final_groups.each do |states|
id = state_id[states]
gt.add_accepting(id)
save = states.find { |s|
@memos.key?(s) && eclosure(s).sort.last == accepting
}
gt.add_memo(id, memo(save))
end
gt
end
