viewcvs.cgi/types/sequence.ml

let nil_atom = Types.mk_atom "nil"
let nil_type = Types.atom (Atoms.atom nil_atom)

let decompose t =
  (Types.Atom.has_atom t nil_atom,
   Types.Product.get t)

module V = Types.Positive
module H = Types.DescrHash

let mapping f t queue =
  let memo = H.create 13 in
  let rec aux t =
    try H.find memo t
    with Not_found ->
      let v = V.forward () in
      H.add memo t v;
      let (has_nil,rect) = decompose t in
      let l = List.map (fun (t1,t2) -> f t1 (aux t2)) rect in
      let l = if has_nil then queue :: l else l in
      V.define v (V.cup l);
      v
  in
  aux t
  

let aux_concat = mapping (fun t v -> V.times (V.ty t) v)
let aux_flatten t = mapping aux_concat t (V.ty nil_type)
let aux_map f t = mapping (fun t v -> V.times (V.ty (f t)) v) t (V.ty nil_type)

let solve x = Types.descr (V.solve x)

let concat t1 t2 = solve (aux_concat t1 (V.ty t2))
let flatten t = solve (aux_flatten t)
let map f t = solve (aux_map f t)

let recurs f =
  let n = Types.make () in
  Types.define n (f n);
  Types.internalize n

let star_node t = recurs (fun n -> Types.cup nil_type (Types.times t n ))

let any_node = star_node (Types.cons Types.any)
let any = Types.descr any_node
let seqseq = Types.descr (star_node any_node)

let star t = Types.descr (star_node (Types.cons t))
let string = star (Types.Char.any)  

let approx t =
  let memo = H.create 13 in
  let res = ref Types.empty in
  let rec aux t =
    try H.find memo t
    with Not_found ->
      H.add memo t ();
      let rect = Types.Product.get t in
      List.iter (fun (t1,t2) -> res := Types.cup t1 !res; aux t2) rect;
  in
  aux t;
  !res

  
1	let nil_atom = Types.mk_atom "nil"
2	let nil_type = Types.atom (Atoms.atom nil_atom)
3
4	let decompose t =
5	(Types.Atom.has_atom t nil_atom,
6	Types.Product.get t)
7
8	module V = Types.Positive
9	module H = Types.DescrHash
10
11	let mapping f t queue =
12	let memo = H.create 13 in
13	let rec aux t =
14	try H.find memo t
15	with Not_found ->
16	let v = V.forward () in
17	H.add memo t v;
18	let (has_nil,rect) = decompose t in
19	let l = List.map (fun (t1,t2) -> f t1 (aux t2)) rect in
20	let l = if has_nil then queue :: l else l in
21	V.define v (V.cup l);
22	v
23	in
24	aux t
25
26
27	let aux_concat = mapping (fun t v -> V.times (V.ty t) v)
28	let aux_flatten t = mapping aux_concat t (V.ty nil_type)
29	let aux_map f t = mapping (fun t v -> V.times (V.ty (f t)) v) t (V.ty nil_type)
30
31	let solve x = Types.descr (V.solve x)
32
33	let concat t1 t2 = solve (aux_concat t1 (V.ty t2))
34	let flatten t = solve (aux_flatten t)
35	let map f t = solve (aux_map f t)
36
37	let recurs f =
38	let n = Types.make () in
39	Types.define n (f n);
40	Types.internalize n
41
42	let star_node t = recurs (fun n -> Types.cup nil_type (Types.times t n ))
43
44	let any_node = star_node (Types.cons Types.any)
45	let any = Types.descr any_node
46	let seqseq = Types.descr (star_node any_node)
47
48	let star t = Types.descr (star_node (Types.cons t))
49	let string = star (Types.Char.any)
50
51	let approx t =
52	let memo = H.create 13 in
53	let res = ref Types.empty in
54	let rec aux t =
55	try H.find memo t
56	with Not_found ->
57	H.add memo t ();
58	let rect = Types.Product.get t in
59	List.iter (fun (t1,t2) -> res := Types.cup t1 !res; aux t2) rect;
60	in
61	aux t;
62	!res
63
64