1 (* Copyright (C) 2000, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://cs.unibo.it/helm/.
27 * implementazione del'interprete MathQL
41 open Mathql_semantics;;
43 let prop_pool = ref None;;
57 "/" ^ (string_of_int j)
62 let see_prop_pool () =
63 let _ = print_endline "eccomi" in
65 (fun elem -> print_endline (fst elem ^ ": " ^ snd elem))
66 (match !prop_pool with Some l -> l | _ -> print_endline "ciao"; assert false)
70 * inizializzazione della connessione al database
73 let _ = Dbconn.init () in
76 c#exec "select name,id from property where ns_id in (select id from namespace where url='http://www.cs.unibo.it/helm/schemas/mattone.rdf#')"
83 | _ -> print_endline "no"; assert false
89 let get_prop_id prop =
90 if prop="refObj" then "F"
91 else if prop="backPointer" then "B"
92 else List.assoc prop (match !prop_pool with Some l -> l | _ -> assert false)
95 (* automatically performes the union of a given list of patterns *)
96 let rec pattern_list_ex = function
98 | [(apreamble, apattern, afragid)] -> pattern_ex (apreamble, apattern, afragid)
99 | (apreamble, apattern, afragid) :: tail ->
100 union_ex (pattern_ex (apreamble, apattern, afragid)) (pattern_list_ex tail)
102 (* execute_ex env q *)
103 (* [env] is the attributed uri environment in which the query [q] *)
104 (* must be evaluated *)
105 (* [q] is the query to evaluate *)
106 (* It returns a [Mathql_semantics.result] *)
107 let rec execute_ex env =
109 MQSelect (apvar, alist, abool) ->
110 select_ex env apvar (execute_ex env alist) abool
111 | MQUsedBy (alist, asvar) ->
112 use_ex (execute_ex env alist) asvar (get_prop_id "refObj") (* "F" (*"refObj"*) *)
113 | MQUse (alist, asvar) ->
114 use_ex (execute_ex env alist) asvar (get_prop_id "backPointer") (* "B" (*"backPointer"*) *)
117 | MQUnion (l1, l2) ->
118 union_ex (execute_ex env l1) (execute_ex env l2)
120 diff_ex (execute_ex env l1) (execute_ex env l2)
121 | MQSortedBy (l, o, f) ->
122 sortedby_ex (execute_ex env l) o f
123 | MQIntersect (l1, l2) ->
124 intersect_ex (execute_ex env l1) (execute_ex env l2)
125 | MQListRVar rvar -> [List.assoc rvar env]
126 | MQLetIn (lvar, l1, l2) ->
127 let t = Unix.time () in
129 (*CSC: The interesting code *)
130 let _ = letin_ex lvar (execute_ex env l1) in
132 (*CSC: end of the interesting code *)
135 print_string ("LETIN = " ^ string_of_int (List.length res) ^ ": ") ;
136 print_endline (string_of_float (Unix.time () -. t) ^ "s") ;
141 | MQReference l -> (* FG: *)
142 let rec build_result = function
145 {uri = s ; attributes = [] ; extra = ""} :: build_result tail
147 | MQMinimize l -> (* FG: sostituire con l'implementazione vera *)
151 (* Let's initialize the execute in Select, creating a cyclical recursion *)
152 Select.execute := execute_ex;;
155 * converte il risultato interno di una query (uri + contesto)
156 * in un risultato di sole uri
159 * l: string list list;
164 * il tipo del risultato mantenuto internamente e' diverso dal tipo di risultato
165 * restituito in output poiche', mentre chi effettua le query vuole come risultato
166 * solo le eventuali uri che soddisfano le query stesse, internamente ad una uri
167 * sono associati anche i valori delle variabili che ancora non sono state valutate
168 * perche', ad esempio, si trovano in altri rami dell'albero.
171 * SELECT x IN USE PATTERN "cic:/**.con" POSITION $a WHERE $a IS MainConclusion
172 * L'albero corrispondente a questa query e':
178 * PATTERN $a $a MainConclusion
180 * Nel momento in cui si esegue il ramo USE non sono noti i vincoli sullla variabile $a
181 * percui e' necessario considerare, oltre alle uri, i valori della variabile per i quali
182 * la uri puo' far parte del risultato.
185 MQRefs (List.map (function {Mathql_semantics.uri = uri} -> uri) l)
187 let tmp = List.map (function {Mathql_semantics.uri = uri} -> uri) l in
191 (*let _ = print_endline ("DEBUG: (mqint.ml: xres_to_res)" ^ l) in*)
192 match Str.split (Str.regexp ":\|#\|/\|(\|)") l with
194 match List.rev tl with
195 n::"1"::"xpointer"::tail ->
202 | _ -> (MQBC t) :: MQBD :: par
206 [MQFC (int_of_string n)]
208 | n::m::"1"::"xpointer"::tail ->
215 | _ -> (MQBC t) :: MQBD :: par
219 [MQFC (int_of_string m); MQFC (int_of_string n)]
228 | _ -> (MQBC t) :: MQBD :: par
248 MQList qq -> xres_to_res (execute_ex [] qq)
252 * chiusura della connessione al database
254 let close () = Dbconn.close ();;