Code movement.

demos/brz/Brzozowski.ml

@@ -31,11 +31,6 @@ let exists_char (f : Char.t -> bool) : bool =
   with Exists ->
     true
 
-(* A tabulator for functions of type [char -> _] is used several times. *)
-
-module T =
-  Tabulate.ForHashedType(Char)(Char)
-
 (* -------------------------------------------------------------------------- *)
 
 (* See Scott Owens, John Reppy, Aaron Turon, "Regular-expression derivatives
@@ -308,6 +303,11 @@ let nullable : regexp -> bool =
    star.) More precisely, for every character [a], [delta a] is a function of
    type [regexp -> regexp]: we memoize every function [delta a] separately. *)
 
+(* A tabulator for functions of type [char -> _] is used for this purpose. *)
+
+module T =
+  Tabulate.ForHashedType(Char)(Char)
+
 let delta : Char.t -> regexp -> regexp =
   T.tabulate (fun a ->
     M.fix (fun delta e ->