First draft of Parser.problem_of_string

[fireball-separation.git] / ocaml / parser.ml

diff --git a/ocaml/parser.ml b/ocaml/parser.ml
index d7a1b36d31d3dd30d0f8d63f8f2182ff93f22a0d..61dbf832d6d75c95123eef63f71aeafb2bf5e82d 100644 (file)
--- a/ocaml/parser.ml
+++ b/ocaml/parser.ml
@@ -170,4 +170,73 @@ let _ = prerr_endline (">>>" ^ string_of_term (parse "(\\x. x y z z1 k) z1 z j")
  List.map (aux 0) (tms :> Num.nf list), free\r
 ;;\r
 \r
-let parse_problem s = failwith "TODO";\r
+let problem_of_string s =\r
+ let lines = Str.split (Str.regexp "[\n\r\x0c\t;]+") s in\r
+ let lines = List.filter ((<>) "") lines in\r
+ prerr_endline("number of lines" ^ string_of_int (List.length lines));\r
+ let aux (name, div, conv, ps) line =\r
+  let chr = String.sub line 0 1 in\r
+  let line = String.sub line 1 (String.length line - 1) in\r
+  if chr = ":"\r
+   then line, div, conv, ps\r
+  else if chr = "D"\r
+   then name, line, conv, ps\r
+  else if chr = "C"\r
+   then name, div, line::conv, ps\r
+  else if chr = "N"\r
+   then name, div, conv, line::ps\r
+  else raise (ParsingError ("Unexpected at beginning of line: " ^ chr)) in\r
+ let name, div, conv, ps = List.fold_left aux ("?", "", [], []) lines in\r
+ let div_provided = div <> "" in\r
+ let div = if div_provided then div else "BOT" in\r
+ let strs = [div] @ ps @ conv in\r
+\r
+ (* parse' *)\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 `Bottom\r
+   else if v = lev + n_pac then `Pacman\r
+    else if v = lev + n_bomb then `Lam(true, `Bottom)\r
+     else `Var(v,1) in (* 1 by default when variable not applied *)\r
+ (* Fix arity *)\r
+ let open Num in\r
+ let exclude_bottom = function\r
+ | #nf_nob as t -> t\r
+ | `Bottom -> raise (ParsingError "Input term not in normal form") in\r
+ let rec aux_nob lev : nf_nob -> nf = function\r
+ | `I((n,_), args) -> `I((n,1 + Listx.length args), Listx.map (fun t -> exclude_bottom (aux_nob lev t)) args)\r
+ | `Var(n,_) -> fix lev n\r
+ | `Lam(_,t) -> `Lam (true, aux (lev+1) t)\r
+ | `Match _ | `N _ -> assert false\r
+ | `Pacman -> `Pacman\r
+ and aux lev : Num.nf -> Num.nf = function\r
+  | #nf_nob as t -> aux_nob lev t\r
+  | `Bottom -> 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 || div = `Bottom\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
+  | _ -> raise (ParsingError "A term in num is not i_n_var")\r
+ ) ps in\r
+\r
+ name, div, conv, ps, free\r
+;;\r