1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
(***************************************************************************)
(* HLins: insert http-links into HTML documents. *)
(* See http://www.lri.fr/~treinen/hlins *)
(* *)
(* Copyright (C) 1999-2024 Ralf Treinen <treinen@irif.fr> *)
(* *)
(* This program is free software; you can redistribute it and/or modify *)
(* it under the terms of the GNU General Public License as published by *)
(* the Free Software Foundation; either version 2 of the License, or (at *)
(* your option) any later version. *)
(* *)
(* This program is distributed in the hope that it will be useful, but *)
(* WITHOUT ANY WARRANTY; without even the implied warranty of *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU *)
(* General Public License for more details. *)
(* *)
(* You should have received a copy of the GNU General Public License *)
(* along with this program; if not, write to the Free Software *)
(* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 *)
(* USA *)
(* *)
(***************************************************************************)
(*
HLins: insert http-links into HTML documents.
See http://www.lri.fr/~treinen/hlins
Copyright (C) 1999 Ralf Treinen <treinen@lri.fr>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*)
(*
(* implementation of transitions tables by lists *)
type transitions = (char*int) list;;
let empty_transitions = [];;
let get_transition t c = List.assoc c t;;
let add_transition t c p = (c,p)::t;;
let transitions_fold f = List.fold_left (fun x (c,q) -> (f x c q));;
*)
(* implementation of transition tables by finite functions *)
module OrderedChar =
struct
type t = char
(* let compare x y = (Char.code x) - (Char.code y) *)
let compare = Stdlib.compare
end;;
module M = Map.Make(OrderedChar);;
type transitions = int M.t;;
let empty_transitions = M.empty;;
let get_transition t c = M.find c t;;
let add_transition t c q = M.add c q t;;
let transitions_fold f i t = M.fold (fun c i x -> f x c i) t i;;
type automaton = {
max_path_length: int;
number_of_states: int;
tree: transitions array;
level: int array;
board: int array;
suf: int array;
found: (int list) array;
expand: (int list) array
};;
|
