grammar_ttl.y 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276
  1. %include {
  2. /** @brief Lemon parser grammar for Turtle.
  3. *
  4. * The `lemon' parser generator executable must be in your PATH:
  5. * https://sqlite.org/src/doc/trunk/doc/lemon.html
  6. *
  7. * TTL EBNF: https://www.w3.org/TeamSubmission/turtle/#sec-grammar-grammar
  8. */
  9. #include "codec.h"
  10. }
  11. %name TTLParse
  12. %stack_overflow {
  13. log_error ("Stack oveflow in TTL parsing.");
  14. state->rc = LSUP_MEM_ERR;
  15. }
  16. %parse_failure {
  17. log_error ("TTL parse error. Cannot continue.");
  18. state->rc = LSUP_PARSE_ERR;
  19. }
  20. %syntax_error {
  21. // Fail immediately on first error.
  22. yy_parse_failed (yypParser);
  23. }
  24. //%stack_size 1024
  25. %token_prefix "T_"
  26. %token_type { char * }
  27. %token_destructor { (void) state; free ($$); }
  28. %default_type { char * }
  29. %extra_argument { LSUP_TTLParserState *state }
  30. // Low- to high-priority.
  31. %left PERIOD .
  32. %left SEMICOLON .
  33. %left COMMA .
  34. %left STRING INTEGER DOUBLE DECIMAL BOOLEAN QNAME BNODE_ID IRIREF .
  35. %nonassoc LANGTAG PREFIX .
  36. %nonassoc COLON .
  37. /*
  38. * Rules.
  39. */
  40. turtleDoc ::= statements EOF .
  41. statements ::= statements statement .
  42. statements ::= .
  43. statement ::= prefixID .
  44. statement ::= base .
  45. statement ::= triples .
  46. statement ::= WS .
  47. prefixID ::= PREFIX(P) WS IRIREF(N) PERIOD . {
  48. LSUP_nsmap_add (
  49. LSUP_graph_namespace (
  50. LSUP_graph_iter_graph (state->it)
  51. ), P, N
  52. );
  53. free (P);
  54. free (N);
  55. }
  56. base ::= BASE WS IRIREF(D) PERIOD . {
  57. LSUP_term_free (state->base);
  58. state->base = LSUP_iriref_new (D, NULL);
  59. free (D);
  60. }
  61. triples ::= subject(S) ows predObjList(L) PERIOD . {
  62. size_t ct = LSUP_graph_add_link_map (state->it, S, L);
  63. state->ct += ct;
  64. state->rc = LSUP_OK;
  65. log_trace ("Added %lu triples.", ct);
  66. LSUP_term_free (S);
  67. LSUP_link_map_free (L);
  68. }
  69. triples ::= subject(S) ows predObjList(L) SEMICOLON PERIOD . [PERIOD] {
  70. size_t ct = LSUP_graph_add_link_map (state->it, S, L);
  71. state->ct += ct;
  72. state->rc = LSUP_OK;
  73. log_trace ("Added %lu triples.", ct);
  74. LSUP_term_free (S);
  75. LSUP_link_map_free (L);
  76. }
  77. %type predObjList { LSUP_LinkMap * }
  78. %destructor predObjList { LSUP_link_map_free ($$); }
  79. predObjList(A) ::= predicate(P) ows objectList(O) . [SEMICOLON] {
  80. A = LSUP_link_map_new (LSUP_LINK_OUTBOUND);
  81. LSUP_link_map_add (A, P, O);
  82. }
  83. predObjList(A) ::= predObjList(L) SEMICOLON predicate(P) ows objectList(O) . {
  84. LSUP_link_map_add (L, P, O);
  85. A = L;
  86. }
  87. %type objectList { LSUP_TermSet * }
  88. %destructor objectList { LSUP_term_set_free ($$); }
  89. objectList(A) ::= objectList(L) COMMA object(O) . {
  90. if (LSUP_term_set_add (L, O, NULL) == LSUP_NOACTION)
  91. LSUP_term_free (O);
  92. A = L;
  93. }
  94. objectList(A) ::= object(O) . [IRIREF] {
  95. A = LSUP_term_set_new();
  96. LSUP_term_set_add (A, O, NULL);
  97. }
  98. %type subject { LSUP_Term * }
  99. %destructor subject { LSUP_term_free ($$); }
  100. subject ::= resource .
  101. subject ::= blank .
  102. %type predicate { LSUP_Term * }
  103. %destructor predicate { LSUP_term_free ($$); }
  104. predicate ::= resource .
  105. predicate(A)::= RDF_TYPE . {
  106. A = LSUP_iriref_new (
  107. "rdf:type",
  108. LSUP_graph_namespace (LSUP_graph_iter_graph (state->it)));
  109. }
  110. %type object { LSUP_Term * }
  111. %destructor object { LSUP_term_free ($$); }
  112. object ::= resource .
  113. object ::= blank .
  114. object ::= literal .
  115. %type literal { LSUP_Term * }
  116. %destructor literal { LSUP_term_free ($$); }
  117. literal(A) ::= STRING(D) . {
  118. A = LSUP_term_new (LSUP_TERM_LITERAL, D, NULL);
  119. log_trace ("Created plain literal: \"%s\"", A->data);
  120. free (D);
  121. }
  122. literal(A) ::= STRING(D) LANGTAG(L) . {
  123. A = LSUP_term_new (LSUP_TERM_LT_LITERAL, D, L);
  124. log_trace ("Created LT-literal: \"%s\"@%s", A->data, A->lang);
  125. free (D);
  126. free (L);
  127. }
  128. literal(A) ::= STRING(D) DTYPE_MARKER resource(M) . {
  129. A = LSUP_term_new (LSUP_TERM_LITERAL, D, M);
  130. log_trace (
  131. "Created DT-literal: \"%s\"^^%s",
  132. A->data, A->datatype);
  133. free (D);
  134. }
  135. literal(A) ::= INTEGER(D) . {
  136. A = LSUP_term_new (
  137. LSUP_TERM_LITERAL, D,
  138. LSUP_iriref_new (
  139. "xsd:integer",
  140. LSUP_graph_namespace (LSUP_graph_iter_graph (state->it))
  141. )
  142. );
  143. free (D);
  144. }
  145. literal(A) ::= DOUBLE(D) . {
  146. A = LSUP_term_new (
  147. LSUP_TERM_LITERAL, D,
  148. LSUP_iriref_new (
  149. "xsd:double",
  150. LSUP_graph_namespace (LSUP_graph_iter_graph (state->it))
  151. )
  152. );
  153. free (D);
  154. }
  155. literal(A) ::= DECIMAL(D) . {
  156. A = LSUP_term_new (
  157. LSUP_TERM_LITERAL, D,
  158. LSUP_iriref_new (
  159. "xsd:decimal",
  160. LSUP_graph_namespace (LSUP_graph_iter_graph (state->it))
  161. )
  162. );
  163. free (D);
  164. }
  165. literal(A) ::= BOOLEAN(D) . {
  166. A = LSUP_term_new (
  167. LSUP_TERM_LITERAL, D,
  168. LSUP_iriref_new (
  169. "xsd:boolean",
  170. LSUP_graph_namespace (LSUP_graph_iter_graph (state->it))
  171. )
  172. );
  173. free (D);
  174. }
  175. %type blank { LSUP_Term * }
  176. %destructor blank { LSUP_term_free ($$); }
  177. blank(A) ::= BNODE_ID(D) . {
  178. A = LSUP_term_new (LSUP_TERM_BNODE, D, NULL);
  179. log_trace ("Created blank node: _:%s", A->data);
  180. free (D);
  181. }
  182. blank(A) ::= LBRACKET RBRACKET . [BNODE_ID] {
  183. A = LSUP_term_new (LSUP_TERM_BNODE, NULL, NULL);
  184. log_trace ("Created empty list BN: _:%s", A->data);
  185. }
  186. blank(A) ::= LBRACKET predObjList(L) RBRACKET . [BNODE_ID] {
  187. A = LSUP_term_new (LSUP_TERM_BNODE, NULL, NULL);
  188. state->ct += LSUP_graph_add_link_map (state->it, A, L);
  189. log_trace ("Created list BN: _:%s", A->data);
  190. LSUP_link_map_free (L);
  191. }
  192. blank ::= collection . [BNODE_ID]
  193. blank(A) ::= LPAREN RPAREN . [BNODE_ID] {
  194. A = LSUP_iriref_new (
  195. "rdf:nil",
  196. LSUP_graph_namespace (LSUP_graph_iter_graph (state->it))
  197. );
  198. log_trace ("Created list terminator: %s", A->data);
  199. }
  200. // "collection" is the subject of the first collection item.
  201. %type collection { LSUP_Term * }
  202. %destructor collection { LSUP_term_free ($$); }
  203. // Collection triples are added here to the graph.
  204. collection(A) ::= LPAREN itemList(L) RPAREN . {
  205. A = LSUP_bnode_add_collection (state->it, L);
  206. LSUP_term_set_free (L);
  207. }
  208. %type itemList { LSUP_TermSet * }
  209. %destructor itemList { LSUP_term_set_free ($$); }
  210. itemList(A) ::= itemList(L) ows object(O) . {
  211. if (LSUP_term_set_add (L, O, NULL) == LSUP_NOACTION)
  212. LSUP_term_free (O);
  213. A = L;
  214. }
  215. itemList(A) ::= object(O) . {
  216. A = LSUP_term_set_new ();
  217. LSUP_term_set_add (A, O, NULL);
  218. }
  219. %type resource { LSUP_Term * }
  220. %destructor resource { LSUP_term_free ($$); }
  221. resource(A) ::= IRIREF(D) . {
  222. LSUP_Term *rel_iri = LSUP_iriref_new (D, NULL);
  223. free (D);
  224. if (state->base) {
  225. A = LSUP_iriref_absolute (rel_iri, state->base);
  226. LSUP_term_free (rel_iri);
  227. } else {
  228. A = rel_iri;
  229. }
  230. log_trace ("Created IRI: <%s>", A->data);
  231. }
  232. resource(A) ::= QNAME(D) . {
  233. A = LSUP_iriref_new (
  234. D, LSUP_graph_namespace (LSUP_graph_iter_graph (state->it))
  235. );
  236. log_trace ("Created IRI: %s", A->data);
  237. free (D);
  238. }
  239. ows ::= WS .
  240. ows ::= .