Daniel@0
|
1 /* Part of DML (Digital Music Laboratory)
|
Daniel@0
|
2 Copyright 2014-2015 Samer Abdallah, University of London
|
Daniel@0
|
3
|
Daniel@0
|
4 This program is free software; you can redistribute it and/or
|
Daniel@0
|
5 modify it under the terms of the GNU General Public License
|
Daniel@0
|
6 as published by the Free Software Foundation; either version 2
|
Daniel@0
|
7 of the License, or (at your option) any later version.
|
Daniel@0
|
8
|
Daniel@0
|
9 This program is distributed in the hope that it will be useful,
|
Daniel@0
|
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
|
Daniel@0
|
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
Daniel@0
|
12 GNU General Public License for more details.
|
Daniel@0
|
13
|
Daniel@0
|
14 You should have received a copy of the GNU General Public
|
Daniel@0
|
15 License along with this library; if not, write to the Free Software
|
Daniel@0
|
16 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
Daniel@0
|
17 */
|
Daniel@0
|
18
|
Daniel@0
|
19 :- module(uripattern, [
|
Daniel@0
|
20 simplify/2
|
Daniel@0
|
21 , pattern_uri/2
|
Daniel@0
|
22 ]).
|
Daniel@0
|
23
|
Daniel@0
|
24 :- use_module(library(semweb/rdf_db), [ rdf_global_id/2 ]).
|
Daniel@0
|
25 :- use_module(library(uri), [ uri_encoded/3 ]).
|
Daniel@0
|
26 :- use_module(library(dcg/basics)).
|
Daniel@0
|
27
|
Daniel@0
|
28 :- multifile uripattern:def/2.
|
Daniel@0
|
29
|
Daniel@0
|
30 %% pattern_uri(+P:uripattern,-X:uri) is det.
|
Daniel@0
|
31 %% pattern_uri(-P:uripattern,+X:uri) is det.
|
Daniel@0
|
32 pattern_uri(P,URI) :-
|
Daniel@0
|
33 ( var(URI) -> uri(P,Codes,[]), atom_codes(URI,Codes)
|
Daniel@0
|
34 ; atomic(URI) -> atom_codes(URI,Codes), uri(P,Codes,[])
|
Daniel@0
|
35 ).
|
Daniel@0
|
36
|
Daniel@0
|
37 uri(P:A) --> !, {rdf_global_id(P:'',Q)}, atom(Q), uri(A).
|
Daniel@0
|
38 uri(\(M)) --> !, {def(M,A)}, uri(A).
|
Daniel@0
|
39 uri(num(N)) --> !, number(N).
|
Daniel@0
|
40 uri(num(Len,N)) -->
|
Daniel@0
|
41 { length(Codes,Len) },
|
Daniel@0
|
42 phrase(Codes),
|
Daniel@0
|
43 { var(N)
|
Daniel@0
|
44 -> number_codes(N,Codes)
|
Daniel@0
|
45 ; format(codes(Codes),'~`0t~d~*+',[N,Len])
|
Daniel@0
|
46 }.
|
Daniel@0
|
47 uri(tail(A)) --> !,
|
Daniel@0
|
48 ( {nonvar(A)} -> atom(A), eos
|
Daniel@0
|
49 ; string_without("",C), eos, {atom_codes(A,C)}
|
Daniel@0
|
50 ).
|
Daniel@0
|
51 uri(enc(A)) --> !,
|
Daniel@0
|
52 ( {nonvar(A)} -> {uri_encoded(path,A,B)}, atom(B)
|
Daniel@0
|
53 ; string_without("/",C), {atom_codes(B,C), uri_encoded(path,A,B)}
|
Daniel@0
|
54 ).
|
Daniel@0
|
55 uri(A1/A2) --> !, uri(A1), "/", uri(A2).
|
Daniel@0
|
56 uri(A) --> {atomic(A)}, atom(A).
|
Daniel@0
|
57
|
Daniel@0
|
58 %% simplify(+P1:uri_pattern, -P2:uri_pattern) is nondet.
|
Daniel@0
|
59 % Non-deterministic maximal reduction of URI pattern.
|
Daniel@0
|
60 simplify(E1,E3) :-
|
Daniel@0
|
61 reduce(E1,E2) *-> simplify(E2,E3); E1=E3.
|
Daniel@0
|
62
|
Daniel@0
|
63 % simplify resource if possible, fails otherwise
|
Daniel@0
|
64 % The pattern must be nonvar.
|
Daniel@0
|
65 reduce(A,B) :- must_be(nonvar,A), reduce1(A,B).
|
Daniel@0
|
66
|
Daniel@0
|
67 reduce1(num(N),A) :- number(N), atom_number(A,N).
|
Daniel@0
|
68 reduce1(num(L,N),A) :- number(N), format(atom(A),'~`0t~d~*+',[N,L]). % zero padded number
|
Daniel@0
|
69 reduce1(\(A),B) :- must_be(nonvar,A), def(A,B).
|
Daniel@0
|
70 reduce1(enc(A),B) :- atomic(A), uri_encoded(path,A,B).
|
Daniel@0
|
71 reduce1(tail(A),A) :- atomic(A).
|
Daniel@0
|
72 reduce1(P:A,P:B) :- reduce(A,B).
|
Daniel@0
|
73 reduce1(P:A,PB) :- atomic(A), rdf_global_id(P:A,PB).
|
Daniel@0
|
74 reduce1(P:(A/B),PA/B) :- reduce(P:A,PA).
|
Daniel@0
|
75 reduce1(A/B,A1/B) :- reduce(A,A1).
|
Daniel@0
|
76 reduce1(A/B,A/B1) :- reduce(B,B1). % nb to get past these, A and B must be nonvar
|
Daniel@0
|
77 reduce1(A/B,AB) :- atom(A), atom(B), atomic_list_concat([A,B],'/',AB).
|
Daniel@0
|
78 reduce1((A/B)/C,A/BC) :- reduce1(B/C,BC).
|
Daniel@0
|
79 reduce1(A/(B/C),AB/C) :- reduce1(A/B,AB).
|
Daniel@0
|
80 reduce1((A/B)/C,A/(B/C)).
|
Daniel@0
|
81
|