-(* Copyright (C) 2000, HELM Team.
- *
- * This file is part of HELM, an Hypertextual, Electronic
- * Library of Mathematics, developed at the Computer Science
- * Department, University of Bologna, Italy.
- *
- * HELM 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.
- *
- * HELM 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 HELM; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
- * MA 02111-1307, USA.
- *
- * For details, see the HELM World-Wide-Web page,
- * http://cs.unibo.it/helm/.
- *)
-
-module AO = AutOutput
-module MA = MetaAut
-module MO = MetaOutput
+(*
+ ||M|| This file is part of HELM, an Hypertextual, Electronic
+ ||A|| Library of Mathematics, developed at the Computer Science
+ ||T|| Department, University of Bologna, Italy.
+ ||I||
+ ||T|| HELM is free software; you can redistribute it and/or
+ ||A|| modify it under the terms of the GNU General Public License
+ \ / version 2 or (at your option) any later version.
+ \ / This software is distributed as is, NO WARRANTY.
+ V_______________________________________________________________ *)
+
+module P = Printf
+module U = NUri
+module C = Cps
+module L = Log
+module T = Time
+module H = Hierarchy
+module O = Output
+module Y = Entity
+module X = Library
+module AP = AutProcess
+module AO = AutOutput
+module DA = DrgAut
+module MA = MetaAut
+module MO = MetaOutput
+module ML = MetaLibrary
+module DO = DrgOutput
+module DBrg = DrgBrg
+module MBrg = MetaBrg
+module BrgO = BrgOutput
+module BrgR = BrgReduction
+module BrgU = BrgUntrusted
+module MBag = MetaBag
+module BagO = BagOutput
+module BagT = BagType
+module BagU = BagUntrusted
+
+type status = {
+ ast : AP.status;
+ dst : DA.status;
+ mst : MA.status;
+ ac : AO.counters;
+ mc : MO.counters;
+ brgc: BrgO.counters;
+ bagc: BagO.counters
+}
+
+let initial_status mk_uri cover = {
+ ac = AO.initial_counters;
+ mc = MO.initial_counters;
+ brgc = BrgO.initial_counters;
+ bagc = BagO.initial_counters;
+ mst = MA.initial_status ~cover ();
+ dst = DA.initial_status (mk_uri cover);
+ ast = AP.initial_status
+}
+
+let count count_fun c entity =
+ if !L.level > 2 then count_fun C.start c entity else c
+
+let flush_all () = L.flush 0; L.flush_err ()
+
+let bag_error s msg =
+ L.error BagO.specs (L.Warn s :: L.Loc :: msg); flush_all ()
+
+let brg_error s msg =
+ L.error BrgR.specs (L.Warn s :: L.Loc :: msg); flush_all ()
+
+let process_entity f st =
+ let f ast = f {st with ast = ast} in
+ AP.process_entity f st.ast
+
+(* kernel related ***********************************************************)
+
+type kernel = Brg | Bag
+
+type kernel_entity = BrgEntity of Brg.entity
+ | BagEntity of Bag.entity
+ | DrgEntity of Drg.entity
+ | MetaEntity of Meta.entity
+
+let kernel = ref Brg
+
+let print_counters st = match !kernel with
+ | Brg -> BrgO.print_counters C.start st.brgc
+ | Bag -> BagO.print_counters C.start st.bagc
+
+let xlate f st entity = match !kernel, entity with
+ | Brg, DrgEntity e ->
+ let f e = f st (BrgEntity e) in Y.xlate f DBrg.brg_of_drg e
+ | Brg, MetaEntity e ->
+ let f e = f st (BrgEntity e) in Y.xlate f MBrg.brg_of_meta e
+ | Bag, MetaEntity e ->
+ let f e = f st (BagEntity e) in Y.xlate f MBag.bag_of_meta e
+ | _, entity -> f st entity
+
+let pp_progress e =
+ let f a u =
+ let s = U.string_of_uri u in
+ let err () = L.warn (P.sprintf "%s" s) in
+ let f i = L.warn (P.sprintf "[%u] %s" i s) in
+ Y.mark err f a
+ in
+ match e with
+ | DrgEntity e -> Y.common f e
+ | BrgEntity e -> Y.common f e
+ | BagEntity e -> Y.common f e
+ | MetaEntity e -> Y.common f e
+
+let count_entity st = function
+ | MetaEntity e -> {st with mc = count MO.count_entity st.mc e}
+ | BrgEntity e -> {st with brgc = count BrgO.count_entity st.brgc e}
+ | BagEntity e -> {st with bagc = count BagO.count_entity st.bagc e}
+ | _ -> st
+
+let export_entity si g moch = function
+ | DrgEntity e -> X.export_entity DO.export_term si g e
+ | BrgEntity e -> X.old_export_entity BrgO.export_term si g e
+ | MetaEntity e ->
+ begin match moch with
+ | None -> ()
+ | Some och -> ML.write_entity C.start och e
+ end
+ | BagEntity _ -> ()
+
+let type_check f st si g k =
+ let brg_err msg = brg_error "Type Error" msg; failwith "Interrupted" in
+ let ok _ (a, u, _) = f st a u in
+ match k with
+ | BrgEntity entity -> BrgU.type_check brg_err ok ~si g entity
+ | BagEntity entity -> BagU.type_check ok ~si g entity
+ | DrgEntity (a, u, _)
+ | MetaEntity (a, u, _) -> f st a u
+
+(****************************************************************************)
+
+let stage = ref 3
+let moch = ref None
+let meta = ref false
+let progress = ref false
+let preprocess = ref false
+let use_cover = ref true
+let si = ref false
+let cc = ref false
+let export = ref false
+let graph = ref (H.graph_of_string C.err C.start "Z2")
+let old = ref false
+
+let process_3 f st a u =
+ f st
+
+let process_2 f st entity =
+ let st = count_entity st entity in
+ if !export then export_entity !si !graph !moch entity;
+ if !stage > 2 then type_check (process_3 f) st !si !graph entity else f st
+
+let process_1 f st entity =
+ if !progress then pp_progress entity;
+ let st = count_entity st entity in
+ if !export && !stage = 1 then export_entity !si !graph !moch entity;
+ if !stage > 1 then xlate (process_2 f) st entity else f st
+
+let process_0 f st entity =
+ let f st entity =
+ if !stage = 0 then f st else
+ let frr mst = f {st with mst = mst} in
+ let h mst e = process_1 f {st with mst = mst} (MetaEntity e) in
+ let err dst = f {st with dst = dst} in
+ let g dst e = process_1 f {st with dst = dst} (DrgEntity e) in
+ if !old then MA.meta_of_aut frr h st.mst entity else
+ DA.drg_of_aut err g st.dst entity
+ in
+ let st = {st with ac = count AO.count_entity st.ac entity} in
+ if !preprocess then process_entity f st entity else f st entity
+
+let rec process f book st = match book with
+ | [] -> f st
+ | entity :: tl ->
+(* we exploit tail recursion rather than CPS *)
+ process f tl (process_0 C.start st entity)
+
+(****************************************************************************)
let main =
- let version_string = "Helena Checker 0.8.0 M (June 2008)" in
- let summary = ref 0 in
- let stage = ref 1 in
- let set_summary i = summary := i in
- let print_version () = print_endline version_string; exit 0 in
+try
+ let version_string = "Helena 0.8.1 M - October 2009" in
+ let set_hierarchy s =
+ let err () = L.warn (P.sprintf "Unknown type hierarchy: %s" s) in
+ let f g = graph := g in
+ H.graph_of_string err f s
+ in
+ let set_kernel = function
+ | "brg" -> kernel := Brg
+ | "bag" -> kernel := Bag
+ | s -> L.warn (P.sprintf "Unknown kernel version: %s" s)
+ in
+ let set_summary i = L.level := i in
+ let print_version () = L.warn (version_string ^ "\n"); exit 0 in
let set_stage i = stage := i in
+ let set_meta_file name =
+ let f och = moch := Some och in
+ ML.open_out f name
+ in
+ let close = function
+ | None -> ()
+ | Some och -> ML.close_out C.start och
+ in
let read_file name =
- if !summary > 0 then
- Printf.printf "Processing file: %s\n" name; flush stdout;
+ if !L.level > 0 then T.gmtime version_string;
+ if !L.level > 1 then
+ L.warn (P.sprintf "Processing file: %s" name);
+ if !L.level > 0 then T.utime_stamp "started";
+ let base_name = Filename.chop_extension (Filename.basename name) in
+ if !meta then set_meta_file base_name;
let ich = open_in name in
let lexbuf = Lexing.from_channel ich in
let book = AutParser.book AutLexer.token lexbuf in
close_in ich;
- if !summary > 1 then
- AO.count (AO.print_counters Cps.id) AO.initial_counters book;
- let f env =
- if !summary > 1 then
- MO.count (MO.print_counters Cps.id) MO.initial_counters env;
- let frm = Format.err_formatter in
- Format.pp_set_margin frm max_int;
- MO.pp_environment Cps.id frm (List.rev env)
+ if !L.level > 0 then T.utime_stamp "parsed";
+ O.clear_reductions ();
+ let mk_uri =
+ if !stage < 2 then Drg.mk_uri else
+ match !kernel with
+ | Brg -> Brg.mk_uri
+ | Bag -> Bag.mk_uri
in
- if !stage > 0 then MA.meta_of_aut f book
+ let cover = if !use_cover then base_name else "" in
+ let f st =
+ if !L.level > 0 then T.utime_stamp "processed";
+ if !L.level > 2 then AO.print_counters C.start st.ac;
+ if !L.level > 2 && !preprocess then AO.print_process_counters C.start st.ast;
+ if !L.level > 2 && !stage > 0 then MO.print_counters C.start st.mc;
+ if !L.level > 2 && !stage > 1 then print_counters st;
+ if !L.level > 2 && !stage > 1 then O.print_reductions ()
+ in
+ process f book (initial_status mk_uri cover)
+ in
+ let exit () =
+ close !moch;
+ if !L.level > 0 then T.utime_stamp "at exit";
+ flush_all ()
in
- let help = "Usage: helena [ -V | -Ss <number> ] <file> ..." in
- let help_S = "<number> Set summary level" in
- let help_V = " Show version information" in
- let help_s = "<number> Set translation stage" in
+ let help =
+ "Usage: helena [ -Vcijmopux | -Ss <number> | -hk <string> ] <file> ...\n\n" ^
+ "Summary levels: 0 just errors (default), 1 time stamps, 2 processed file names, \
+ 3 data information, 4 typing information, 5 reduction information\n\n" ^
+ "Stages: 0 parsing, 1 to intermediate, 2 to untrusted, 3 to trusted (default)\n"
+ in
+ let help_S = "<number> set summary level (see above)" in
+ let help_V = " show version information" in
+
+ let help_c = " output conversion constraints" in
+ let help_h = "<string> set type hierarchy (default: Z2)" in
+ let help_i = " show local references by index" in
+ let help_j = " show URI of processed kernel objects" in
+ let help_k = "<string> set kernel version (default: brg)" in
+ let help_m = " output intermediate representation (HAL)" in
+ let help_o = " use old abstract language instead of drg" in
+ let help_p = " preprocess Automath source" in
+ let help_r = " disable initial segment of URI hierarchy" in
+ let help_s = "<number> set translation stage (see above)" in
+ let help_u = " activate sort inclusion" in
+ let help_x = " export kernel entities (XML)" in
+ L.box 0; L.box_err ();
+ H.set_sorts ignore ["Set"; "Prop"] 0;
+ at_exit exit;
Arg.parse [
("-S", Arg.Int set_summary, help_S);
("-V", Arg.Unit print_version, help_V);
+ ("-c", Arg.Set cc, help_c);
+ ("-h", Arg.String set_hierarchy, help_h);
+ ("-i", Arg.Set O.indexes, help_i);
+ ("-j", Arg.Set progress, help_j);
+ ("-k", Arg.String set_kernel, help_k);
+ ("-m", Arg.Set meta, help_m);
+ ("-o", Arg.Set old, help_o);
+ ("-p", Arg.Set preprocess, help_p);
+ ("-r", Arg.Clear use_cover, help_r);
("-s", Arg.Int set_stage, help_s);
- ] read_file help
+ ("-u", Arg.Set si, help_u);
+ ("-x", Arg.Set export, help_x)
+ ] read_file help;
+with BagT.TypeError msg -> bag_error "Type Error" msg
projects / helm.git / blobdiff