129 lines
4.4 KiB
Elixir
129 lines
4.4 KiB
Elixir
defmodule RDF.Turtle.Decoder do
|
|
@moduledoc false
|
|
|
|
use RDF.Serialization.Decoder
|
|
|
|
defmodule State do
|
|
defstruct base_uri: nil, namespaces: %{}, bnode_counter: 0
|
|
|
|
def add_namespace(%State{namespaces: namespaces} = state, ns, iri) do
|
|
%State{state | namespaces: Map.put(namespaces, ns, iri)}
|
|
end
|
|
|
|
def ns(%State{namespaces: namespaces}, prefix) do
|
|
namespaces[prefix]
|
|
end
|
|
|
|
def next_bnode(%State{bnode_counter: bnode_counter} = state) do
|
|
{RDF.bnode("b#{bnode_counter}"),
|
|
%State{state | bnode_counter: bnode_counter + 1}}
|
|
end
|
|
end
|
|
|
|
def decode(content, _opts \\ []) do
|
|
with {:ok, tokens, _} <- tokenize(content),
|
|
{:ok, ast} <- parse(tokens) do
|
|
{:ok, build_graph(ast)}
|
|
else
|
|
{:error, {error_line, :turtle_lexer, error_descriptor}, _error_line_again} ->
|
|
{:error, "Turtle scanner error on line #{error_line}: #{inspect error_descriptor}"}
|
|
{:error, {error_line, :turtle_parser, error_descriptor}} ->
|
|
{:error, "Turtle parser error on line #{error_line}: #{inspect error_descriptor}"}
|
|
end
|
|
end
|
|
|
|
defp tokenize(content), do: content |> to_charlist |> :turtle_lexer.string
|
|
|
|
defp parse([]), do: {:ok, []}
|
|
defp parse(tokens), do: tokens |> :turtle_parser.parse
|
|
|
|
defp build_graph(ast) do
|
|
{graph, _} =
|
|
Enum.reduce ast, {RDF.Graph.new, %State{}}, fn
|
|
{:triples, triples_ast}, {graph, state} ->
|
|
with {statements, state} = triples(triples_ast, state) do
|
|
{RDF.Graph.add(graph, statements), state}
|
|
end
|
|
|
|
{:directive, directive_ast}, {graph, state} ->
|
|
{graph, directive(directive_ast, state)}
|
|
|
|
end
|
|
graph
|
|
end
|
|
|
|
defp directive({:prefix, {:prefix_ns, _, ns}, iri}, state) do
|
|
State.add_namespace(state, ns, iri)
|
|
end
|
|
|
|
defp directive({:base, uri}, state) do
|
|
%State{state | base_uri: uri}
|
|
end
|
|
|
|
|
|
defp triples({:blankNodePropertyList, _} = ast, state) do
|
|
with {_, statements, state} = resolve_node(ast, [], state) do
|
|
{statements, state}
|
|
end
|
|
end
|
|
|
|
defp triples({subject, predications}, state) do
|
|
with {subject, statements, state} = resolve_node(subject, [], state) do
|
|
Enum.reduce predications, {statements, state}, fn {predicate, objects}, {statements, state} ->
|
|
with {predicate, statements, state} = resolve_node(predicate, statements, state) do
|
|
Enum.reduce objects, {statements, state}, fn object, {statements, state} ->
|
|
with {object, statements, state} = resolve_node(object, statements, state) do
|
|
{[{subject, predicate, object} | statements], state}
|
|
end
|
|
end
|
|
end
|
|
end
|
|
end
|
|
end
|
|
|
|
defp resolve_node({:prefix_ln, _, {prefix, name}}, statements, state) do
|
|
{RDF.uri(State.ns(state, prefix) <> name), statements, state}
|
|
end
|
|
|
|
defp resolve_node({:anon}, statements, state) do
|
|
with {node, state} = State.next_bnode(state) do
|
|
{node, statements, state}
|
|
end
|
|
end
|
|
|
|
defp resolve_node({:blankNodePropertyList, property_list}, statements, state) do
|
|
with {subject, state} = State.next_bnode(state),
|
|
{new_statements, state} = triples({subject, property_list}, state) do
|
|
{subject, statements ++ new_statements, state}
|
|
end
|
|
end
|
|
|
|
defp resolve_node({:collection, []}, statements, state) do
|
|
{RDF.nil, statements, state}
|
|
end
|
|
|
|
defp resolve_node({:collection, elements}, statements, state) do
|
|
with {first_list_node, state} = State.next_bnode(state),
|
|
[first_element | rest_elements] = elements,
|
|
{first_element_node, statements, state} =
|
|
resolve_node(first_element, statements, state),
|
|
first_statement = [{first_list_node, RDF.first, first_element_node}] do
|
|
{last_list_node, statements, state} =
|
|
Enum.reduce rest_elements, {first_list_node, statements ++ first_statement, state},
|
|
fn element, {list_node, statements, state} ->
|
|
with {element_node, statements, state} =
|
|
resolve_node(element, statements, state),
|
|
{next_list_node, state} = State.next_bnode(state) do
|
|
{next_list_node, statements ++ [
|
|
{list_node, RDF.rest, next_list_node},
|
|
{next_list_node, RDF.first, element_node},
|
|
], state}
|
|
end
|
|
end
|
|
{first_list_node, statements ++ [{last_list_node, RDF.rest, RDF.nil}], state}
|
|
end
|
|
end
|
|
|
|
defp resolve_node(node, statements, state), do: {node, statements, state}
|
|
|
|
end
|