@prefix foaf: <http://xmlns.com/foaf/0.1/> .If I want to use SPARQL to convert this information into a different schema where first, middle and last name are separate properties, it can't be done.
_:a foaf:name "Johnny Lee Outlaw" .
@prefix ns2: <http://some.other/namespace/> .This could be solved by allowing variables to bind to regexp groups. Something like this.
_:a ns2:firstname "Johnny" .
_:a ns2:middlename "Lee" .
_:a ns2:lastname "Outlaw" .
PREFIX foaf: <http://xmlns.com/foaf/0.1/>I could of course have missed something that allows me to do what I want. You are welcome to correct me in the comments.
PREFIX ns2: <http://some.other/namespace/>
?s ns2:firstname ?first .
?s ns2:middlename ?middle .
?s ns2:lastname ?last .
?s foaf:name ?fullname .
FILTER match(?fullname, "([^ ]*) ([^ ]*) ([^ ]*)", "?first ?middle ?last") .
In this case, not being Turing-complete is a major drawback for SPARQL. If it was Turing-complete, the problem would be solvable in some way or another. The Principle of Least Power is very useful for data definition languages, but I doubt a SPARQL query is useful for an interpreter not being a query engine.
The easiest way to create a Turing-complete language is to embed it in a Turing-complete host language. Then it is always possible to go beyond the embedded language and use features from the host language when necessary.