Module Pxp_dfa


module Pxp_dfa: sig .. end
A directed graph whose edges are marked with strings (= element types) and with the constraint that for a given vertex and a given element type the edge must be unique.

module Graph: sig .. end
module VertexSet: Set.S  with type elt = Graph.vertex

type dfa_definition = {
   dfa_graph : Graph.graph;
   dfa_start : Graph.vertex;
   dfa_stops : VertexSet.t;
   dfa_null : bool;
}
val dfa_of_regexp_content_model : Pxp_core_types.regexp_spec -> dfa_definition
Computes the DFA or raises Not_found if it does not exist