Docs GODI Archive
Projects Blog Link DB

Search GODI:


More options
File lib/ocaml/pkg-lib/cfg/cfg_impl.cmi_pretty GODI Package godi-cfg
Library cfg
 
   cfg_impl.cmi_pretty    Sources  
module Make :
  functor (Spec_ : Cfg_intf.SPEC) ->
    sig
      module Spec :
        sig
          type t = Spec_.t
          type nt = Spec_.nt
          type prod = Spec_.prod
          type symbol = Spec_.symbol = NT of nt | T of t
          val compare_t : t -> t -> int
          val compare_nt : nt -> nt -> int
          val compare_prod : prod -> prod -> int
        end
      module TSet :
        sig
          type elt = Spec.t
          type t = Cfg_impl.Make(Spec_).TSet.t
          val empty : t
          val is_empty : t -> bool
          val mem : elt -> t -> bool
          val add : elt -> t -> t
          val singleton : elt -> t
          val remove : elt -> t -> t
          val union : t -> t -> t
          val inter : t -> t -> t
          val diff : t -> t -> t
          val compare : t -> t -> int
          val equal : t -> t -> bool
          val subset : t -> t -> bool
          val iter : (elt -> unit) -> t -> unit
          val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
          val for_all : (elt -> bool) -> t -> bool
          val exists : (elt -> bool) -> t -> bool
          val filter : (elt -> bool) -> t -> t
          val partition : (elt -> bool) -> t -> t * t
          val cardinal : t -> int
          val elements : t -> elt list
          val min_elt : t -> elt
          val max_elt : t -> elt
          val choose : t -> elt
          val split : elt -> t -> t * bool * t
        end
      module TMap :
        sig
          type key = Spec.t
          type 'a t = 'a Cfg_impl.Make(Spec_).TMap.t
          val empty : 'a t
          val is_empty : 'a t -> bool
          val add : key -> 'a -> 'a t -> 'a t
          val find : key -> 'a t -> 'a
          val remove : key -> 'a t -> 'a t
          val mem : key -> 'a t -> bool
          val iter : (key -> 'a -> unit) -> 'a t -> unit
          val map : ('a -> 'b) -> 'a t -> 'b t
          val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
          val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
          val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
          val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
        end
      module NTSet :
        sig
          type elt = Spec.nt
          type t = Cfg_impl.Make(Spec_).NTSet.t
          val empty : t
          val is_empty : t -> bool
          val mem : elt -> t -> bool
          val add : elt -> t -> t
          val singleton : elt -> t
          val remove : elt -> t -> t
          val union : t -> t -> t
          val inter : t -> t -> t
          val diff : t -> t -> t
          val compare : t -> t -> int
          val equal : t -> t -> bool
          val subset : t -> t -> bool
          val iter : (elt -> unit) -> t -> unit
          val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
          val for_all : (elt -> bool) -> t -> bool
          val exists : (elt -> bool) -> t -> bool
          val filter : (elt -> bool) -> t -> t
          val partition : (elt -> bool) -> t -> t * t
          val cardinal : t -> int
          val elements : t -> elt list
          val min_elt : t -> elt
          val max_elt : t -> elt
          val choose : t -> elt
          val split : elt -> t -> t * bool * t
        end
      module NTMap :
        sig
          type key = Spec.nt
          type 'a t = 'a Cfg_impl.Make(Spec_).NTMap.t
          val empty : 'a t
          val is_empty : 'a t -> bool
          val add : key -> 'a -> 'a t -> 'a t
          val find : key -> 'a t -> 'a
          val remove : key -> 'a t -> 'a t
          val mem : key -> 'a t -> bool
          val iter : (key -> 'a -> unit) -> 'a t -> unit
          val map : ('a -> 'b) -> 'a t -> 'b t
          val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
          val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
          val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
          val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
        end
      module ProdSet :
        sig
          type elt = Spec.prod * Spec.symbol list
          type t = Cfg_impl.Make(Spec_).ProdSet.t
          val empty : t
          val is_empty : t -> bool
          val mem : elt -> t -> bool
          val add : elt -> t -> t
          val singleton : elt -> t
          val remove : elt -> t -> t
          val union : t -> t -> t
          val inter : t -> t -> t
          val diff : t -> t -> t
          val compare : t -> t -> int
          val equal : t -> t -> bool
          val subset : t -> t -> bool
          val iter : (elt -> unit) -> t -> unit
          val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
          val for_all : (elt -> bool) -> t -> bool
          val exists : (elt -> bool) -> t -> bool
          val filter : (elt -> bool) -> t -> t
          val partition : (elt -> bool) -> t -> t * t
          val cardinal : t -> int
          val elements : t -> elt list
          val min_elt : t -> elt
          val max_elt : t -> elt
          val choose : t -> elt
          val split : elt -> t -> t * bool * t
        end
      module ProdMap :
        sig
          type key = Spec.prod * Spec.symbol list
          type 'a t = 'a Cfg_impl.Make(Spec_).ProdMap.t
          val empty : 'a t
          val is_empty : 'a t -> bool
          val add : key -> 'a -> 'a t -> 'a t
          val find : key -> 'a t -> 'a
          val remove : key -> 'a t -> 'a t
          val mem : key -> 'a t -> bool
          val iter : (key -> 'a -> unit) -> 'a t -> unit
          val map : ('a -> 'b) -> 'a t -> 'b t
          val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
          val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
          val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
          val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
        end
      type grammar = Cfg_impl.Make(Spec_).grammar
      type live_grammar = Cfg_impl.Make(Spec_).live_grammar
      val empty : grammar
      val add_prod :
        grammar -> Spec.nt -> Spec.prod -> Spec.symbol list -> grammar
      val remove_nt : grammar -> Spec.nt -> grammar
      val union : grammar -> grammar -> grammar
      val diff : grammar -> grammar -> grammar
      val inter : grammar -> grammar -> grammar
      val grammar_of_live : live_grammar -> grammar
      val prune_unproductive : grammar -> grammar
      val prune_nonlive : grammar -> live_grammar
      val prune_unreachable : grammar -> Spec.nt -> grammar
      val prune_unreachable_live : live_grammar -> Spec.nt -> live_grammar
      val make_sane : grammar -> Spec.nt -> grammar
      val make_sane_live : grammar -> Spec.nt -> live_grammar
      val grammar_contents : grammar -> ProdSet.t NTMap.t
      val deriv_depth_info : live_grammar -> (int * int ProdMap.t) NTMap.t
      val nts_in_grammar : grammar -> NTSet.t
      val ts_in_grammar : grammar -> TSet.t
      val prods_in_grammar : grammar -> ProdSet.t
      val bounded_grammar :
        grammar -> Spec.nt -> int -> (TSet.t * grammar) list
    end
This web site is published by Informatikbüro Gerd Stolpmann
Powered by Caml