end
module Transition :
sig
- type node = State.t * bool * Formula.t * bool
+ type node = State.t * TagSet.t * bool * Formula.t * bool
type data = node
type t
val make : data -> t
end
module IdSet : ResultSet
+module GResult : ResultSet
val top_down_count : 'a t -> Tree.t -> int
val top_down : 'a t -> Tree.t -> IdSet.t