| _, _, _ -> raise (ParsingError "???")\r
;;\r
\r
-let var_zero = "ω";; (* w is an invalid variable name *)\r
-\r
let parse_many strs =\r
let f (x, y) z = match read_smt y (explode z) with\r
| Some[tm], [], vars -> (tm :: x, vars)\r
| _, _, _ -> raise (ParsingError "???")\r
- in let aux = List.fold_left f ([], ([], [var_zero])) (* index zero is reserved *)\r
+ in let aux = List.fold_left f ([], ([], [])) (* index zero is reserved *)\r
in let (tms, (_, free)) = aux strs\r
in (List.rev tms, free)\r
;;\r
\r
-(**********************************************************************\r
-\r
-let rec string_of_term = function\r
- | Tvar n -> string_of_int n\r
- | Tapp(t1, t2) -> "(" ^ string_of_term t1 ^ " " ^ string_of_term t2 ^ ")"\r
- | Tlam(t1) -> "(\\" ^ string_of_term t1 ^ ")"\r
+let problem_of_string s =\r
+ let lines = Str.split (Str.regexp "[\n\r\x0c\t;]+") s in\r
+ let head, lines = List.hd lines, List.tl lines in\r
+ let name = String.trim (String.sub head 1 (String.length head - 1)) in\r
+ let lines = List.filter ((<>) "") lines in\r
+ let aux (last, div, conv, ps) line =\r
+ let chr = String.sub line 0 1 in\r
+ let line = String.trim (String.sub line 1 (String.length line - 1)) in\r
+ if line = "" then chr, div, conv, ps else\r
+ let rec aux' chr line =\r
+ if chr = "#"\r
+ then chr, div, conv, ps\r
+ else if chr = "D"\r
+ then chr, line, conv, ps\r
+ else if chr = "C"\r
+ then chr, div, line::conv, ps\r
+ else if chr = "N"\r
+ then chr, div, conv, line::ps\r
+ else if chr = " "\r
+ then aux' last line\r
+ else raise (ParsingError\r
+ ("Unexpected at beginning of problem: `" ^ chr ^ "` " ^ line)) in\r
+ aux' chr line in\r
+ let _, div, conv, ps = List.fold_left aux ("#", "", [], []) lines in\r
+ let div_provided = div <> "" in\r
+ let div = if div_provided then div else "xxxxxx" in\r
+ let strs = [div] @ ps @ conv in\r
+\r
+ if List.length ps = 0 && List.length conv = 0\r
+ then raise (ParsingError "empty problem");\r
+\r
+ (* parse' *)\r
+ let (tms, free) = parse_many strs in\r
+ let n_bot = try Util.index_of "BOT" free with Not_found -> min_int in\r
+ let n_pac = try Util.index_of "PAC" free with Not_found -> min_int in\r
+ let n_bomb = try Util.index_of "BOMB" free with Not_found -> min_int in\r
+ let fix lev v =\r
+ if v = lev + n_bot then failwith "Example with `Bottom"\r
+ else if v = lev + n_pac then failwith "Example with `Pacman"\r
+ else if v = lev + n_bomb then failwith "Example with `Bomb"\r
+ else if v = lev then `Var(v, min_int) (* zero *)\r
+ else `Var(v,1) in (* 1 by default when variable not applied *)\r
+ (* Fix arity *)\r
+ let open Num in\r
+ let rec aux lev : nf -> nf = function\r
+ | `I((n,_), args) -> `I((n,1 + Listx.length args), Listx.map (fun t -> aux lev t) args)\r
+ | `Var(n,_) -> fix lev n\r
+ | `Lam(_,t) -> `Lam (true, aux (lev+1) t)\r
+ | `Match _ | `N _ -> assert false in\r
+let all_tms = List.map (aux 0) (tms :> Num.nf list) in\r
+\r
+(* problem_of *)\r
+let div, (ps, conv) = List.hd all_tms, Util.list_cut (List.length ps, List.tl all_tms) in\r
+\r
+let div = if not div_provided\r
+ then None\r
+ else match div with\r
+ | `I _ as t -> Some t\r
+ | _ -> raise (ParsingError "div is not an inert or BOT in the initial problem") in\r
+let conv = Util.filter_map (\r
+ function\r
+ | #i_n_var as t -> Some t\r
+ | `Lam _ -> None\r
+ | _ -> raise (ParsingError "A term in conv is not i_n_var")\r
+ ) conv in\r
+let ps = List.map (\r
+ function\r
+ | #i_n_var as y -> y\r
+ | _ as y -> raise (ParsingError ("A term in num is not i_n_var" ^ Num.string_of_nf y))\r
+ ) ps in\r
+ name, div, conv, ps, free\r
;;\r
\r
-let _ = prerr_endline (">>>" ^ string_of_term (parse "(\\x. x y z z1 k) z1 z j"));;\r
-\r
-\r
-**********************************************************************)\r
-\r
- let parse' strs =\r
- let (tms, free) = parse_many strs in\r
- (* Replace pacmans and bottoms *)\r
- let n_bot = try Util.index_of "BOT" free with Not_found -> min_int in\r
- let n_pac = try Util.index_of "PAC" free with Not_found -> min_int in\r
- let n_bomb = try Util.index_of "BOMB" free with Not_found -> min_int in\r
- let fix lev v =\r
- if v = lev + n_bot then failwith "Example with `Bottom"\r
- else if v = lev + n_pac then failwith "Example with `Pacman"\r
- else if v = lev + n_bomb then failwith "Example with `Bomb"\r
- else `Var(v,1) in (* 1 by default when variable not applied *)\r
- (* Fix arity *)\r
- let open Num in\r
- let rec aux lev : nf -> nf = function\r
- | `I((n,_), args) -> `I((n,1 + Listx.length args), Listx.map (fun t -> aux lev t) args)\r
- | `Var(n,_) -> fix lev n\r
- | `Lam(_,t) -> `Lam (true, aux (lev+1) t)\r
- | `Match _ | `N _ -> assert false in\r
- List.map (aux 0) (tms :> Num.nf list), free\r
-;;\r
\r
-let parse_problem s = failwith "TODO";\r
+let from_file path =\r
+ let lines = ref ["#"] in\r
+ let chan = open_in path in\r
+ let _ = try\r
+ while true; do\r
+ lines := input_line chan :: !lines\r
+ done\r
+ with End_of_file ->\r
+ close_in chan in\r
+ let txt = String.concat "\n" (List.rev !lines) in\r
+ let problems = Str.split (Str.regexp "[\n\r]+\\$") txt in\r
+ List.map problem_of_string (List.tl (List.map ((^) "$") problems))\r
+;;\r
projects / fireball-separation.git / blobdiff