grammar_ttl.y 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238
  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 "lsup/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 (P, N);
  49. free (P);
  50. free (N);
  51. }
  52. base ::= BASE WS IRIREF(D) PERIOD . {
  53. LSUP_term_free (state->base);
  54. state->base = LSUP_iriref_new (D);
  55. free (D);
  56. }
  57. triples ::= subject(S) ows predObjList(L) PERIOD . {
  58. size_t ct = LSUP_graph_add_link_map (state->it, L);
  59. state->ct += ct;
  60. state->rc = LSUP_OK;
  61. LOG_TRACE("Added %lu triples.", ct);
  62. LSUP_term_free (S);
  63. LSUP_link_map_free (L);
  64. }
  65. triples ::= subject(S) ows predObjList(L) SEMICOLON PERIOD . [PERIOD] {
  66. size_t ct = LSUP_graph_add_link_map (state->it, L);
  67. state->ct += ct;
  68. state->rc = LSUP_OK;
  69. LOG_TRACE("Added %lu triples.", ct);
  70. LSUP_term_free (S);
  71. LSUP_link_map_free (L);
  72. }
  73. %type predObjList { LSUP_LinkMap * }
  74. %destructor predObjList { LSUP_link_map_free ($$); }
  75. predObjList(A) ::= predicate(P) ows objectList(O) . [SEMICOLON] {
  76. A = LSUP_link_map_new (state->lms, LSUP_LINK_OUTBOUND);
  77. LSUP_link_map_add (A, P, O);
  78. }
  79. predObjList(A) ::= predObjList(L) SEMICOLON predicate(P) ows objectList(O) . {
  80. LSUP_link_map_add (L, P, O);
  81. A = L;
  82. }
  83. %type objectList { LSUP_TermSet * }
  84. %destructor objectList { LSUP_term_set_free ($$); }
  85. objectList(A) ::= objectList(L) COMMA object(O) . {
  86. if (LSUP_term_set_add (L, O, NULL) == LSUP_NOACTION)
  87. LSUP_term_free (O);
  88. A = L;
  89. }
  90. objectList(A) ::= object(O) . [IRIREF] {
  91. A = LSUP_term_set_new();
  92. LSUP_term_set_add (A, O, NULL);
  93. }
  94. %type subject { LSUP_Term * }
  95. %destructor subject { LSUP_term_free ($$); }
  96. subject ::= resource(D) . { state->lms = D; }
  97. subject ::= blank(D) . { state->lms = D; }
  98. %type predicate { LSUP_Term * }
  99. %destructor predicate { LSUP_term_free ($$); }
  100. predicate ::= resource .
  101. predicate(A)::= RDF_TYPE . { A = LSUP_iriref_new_ns ("rdf:type"); }
  102. %type object { LSUP_Term * }
  103. %destructor object { LSUP_term_free ($$); }
  104. object ::= resource .
  105. object ::= blank .
  106. object ::= literal .
  107. %type literal { LSUP_Term * }
  108. %destructor literal { LSUP_term_free ($$); }
  109. literal(A) ::= STRING(D) . {
  110. A = LSUP_literal_new (D, NULL);
  111. LOG_TRACE("Created plain literal: \"%s\"", A->data);
  112. free (D);
  113. }
  114. literal(A) ::= STRING(D) LANGTAG(L) . {
  115. A = LSUP_lt_literal_new (D, L);
  116. LOG_TRACE("Created LT-literal: \"%s\"@%s", A->data, A->lang);
  117. free (D);
  118. free (L);
  119. }
  120. literal(A) ::= STRING(D) DTYPE_MARKER resource(M) . {
  121. A = LSUP_literal_new (D, M);
  122. LOG_TRACE(
  123. "Created DT-literal: \"%s\"^^%s",
  124. A->data, A->datatype);
  125. free (D);
  126. }
  127. literal(A) ::= INTEGER(D) . {
  128. A = LSUP_literal_new (D, LSUP_iriref_new_ns ("xsd:integer"));
  129. free (D);
  130. }
  131. literal(A) ::= DOUBLE(D) . {
  132. A = LSUP_literal_new (D, LSUP_iriref_new_ns ("xsd:double"));
  133. free (D);
  134. }
  135. literal(A) ::= DECIMAL(D) . {
  136. A = LSUP_literal_new (D, LSUP_iriref_new_ns ("xsd:decimal"));
  137. free (D);
  138. }
  139. literal(A) ::= BOOLEAN(D) . {
  140. A = LSUP_literal_new (D, LSUP_iriref_new_ns ("xsd:boolean"));
  141. free (D);
  142. }
  143. %type blank { LSUP_Term * }
  144. %destructor blank { LSUP_term_free ($$); }
  145. blank(A) ::= BNODE_ID(D) . {
  146. A = LSUP_bnode_new (D);
  147. LOG_TRACE("Created blank node: _:%s", A->data);
  148. free (D);
  149. }
  150. blank(A) ::= LBRACKET RBRACKET . [BNODE_ID] {
  151. A = LSUP_bnode_new (NULL);
  152. LOG_TRACE("Created empty list BN: _:%s", A->data);
  153. }
  154. blank(A) ::= LBRACKET predObjList(L) RBRACKET . [BNODE_ID] {
  155. A = LSUP_bnode_new (NULL);
  156. state->lms = A;
  157. state->ct += LSUP_graph_add_link_map (state->it, L);
  158. LOG_TRACE("Created list BN: _:%s", A->data);
  159. LSUP_link_map_free (L);
  160. }
  161. blank ::= collection . [BNODE_ID]
  162. blank(A) ::= LPAREN RPAREN . [BNODE_ID] {
  163. A = LSUP_iriref_new_ns ("rdf:nil");
  164. LOG_TRACE("Created list terminator: %s", A->data);
  165. }
  166. // "collection" is the subject of the first collection item.
  167. %type collection { LSUP_Term * }
  168. %destructor collection { LSUP_term_free ($$); }
  169. // Collection triples are added here to the graph.
  170. collection(A) ::= LPAREN itemList(L) RPAREN . {
  171. A = LSUP_bnode_add_collection (state->it, L);
  172. LSUP_term_set_free (L);
  173. }
  174. %type itemList { LSUP_TermSet * }
  175. %destructor itemList { LSUP_term_set_free ($$); }
  176. itemList(A) ::= itemList(L) ows object(O) . {
  177. if (LSUP_term_set_add (L, O, NULL) == LSUP_NOACTION)
  178. LSUP_term_free (O);
  179. A = L;
  180. }
  181. itemList(A) ::= object(O) . {
  182. A = LSUP_term_set_new ();
  183. LSUP_term_set_add (A, O, NULL);
  184. }
  185. %type resource { LSUP_Term * }
  186. %destructor resource { LSUP_term_free ($$); }
  187. resource(A) ::= IRIREF(D) . {
  188. LSUP_Term *rel_iri = LSUP_iriref_new (D);
  189. free (D);
  190. if (state->base) {
  191. A = LSUP_iriref_new_abs (rel_iri, state->base);
  192. LSUP_term_free (rel_iri);
  193. } else {
  194. A = rel_iri;
  195. }
  196. LOG_TRACE("Created IRI: <%s>", A->data);
  197. }
  198. resource(A) ::= QNAME(D) . {
  199. A = LSUP_iriref_new_ns (D);
  200. LOG_TRACE("Created IRI: %s", A->data);
  201. free (D);
  202. }
  203. ows ::= WS .
  204. ows ::= .