class Kleene::NFA

• Kleene::NFA
• Reference
• Object

Defined in:

nfa.cr

Constructors

• .new(start_state : Kleene::State, alphabet : Set(Char) = DEFAULT_ALPHABET, transitions : Hash(Kleene::State, Hash(Char, Set(Kleene::NFATransition))) = Hash(State, Hash(Char, Set(NFATransition))).new, initial_states = nil)

Instance Method Summary

• #accept?
• #add_state(new_state)
• #add_states(states)
• #add_transition(token : Char, from_state, to_state)
• #all_transitions : Array(NFATransition)
• #alphabet : Set(Char)
• #alphabet=(alphabet : Set(Char))
• #current_states : Set(State)
• #current_states=(current_states : Set(State))
• #deep_clone
• #epsilon_closure(state_set : Set(State)) : Set(State)
• #epsilon_closure(state : State) : Set(State)

  Determine the epsilon closure of the given state set That is, determine what states are reachable on an epsilon transition from the current state set (@current_states).

• #error_states
• #final_states : Set(State)
• #final_states=(final_states : Set(State))
• #graphviz
• #handle_token!(input_token : Char)

  process another input token

• #match?(input : String) : MatchRef | Nil
• #matches(input)

  Returns an array of matches found anywhere in the input string

• #matches_at_offset(input, input_start_offset)

  Returns an array of matches found in the input string, each of which begins at the offset input_start_offset

• #next_states(state_set, input_token)
• #reachable_states(start_state)

  Returns a set of State objects which are reachable through any transition path from the NFA's start_state.

• #regex_pattern
• #remove_state(state)
• #reset_current_states
• #set_regex_pattern(pattern : Nil | String)
• #start_state : State
• #start_state=(start_state : State)
• #states : Set(State)
• #states=(states : Set(State))
• #to_dfa

  This implements the subset construction algorithm presented on page 118 of the first edition of the dragon book.

• #to_s(verbose = false)

  Returns a nicely readable and concise string representation of this object, typically intended for users.

• #transitions : Hash(State, Hash(Char, Set(NFATransition)))
• #transitions=(transitions : Hash(State, Hash(Char, Set(NFATransition))))
• #transitions_from(state_set : Set(State)) : Set(NFATransition)
• #transitions_from(state : State) : Set(NFATransition)
• #update_final_states

Constructor Detail

Instance Method Detail