lexer_nt.re 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322
  1. #include "codec/parser_nt.h"
  2. #include "codec/tokens_nt.h"
  3. #define YYCTYPE uint8_t
  4. #define YYCURSOR it->cur
  5. #define YYMARKER it->mar
  6. #define YYLIMIT it->lim
  7. #define YYFILL fill(it) == 0
  8. typedef struct {
  9. FILE * fh; // Input file handle.
  10. YYCTYPE buf[CHUNK_SIZE], // Start of buffer.
  11. * lim, // Position after the last available
  12. // input character (YYLIMIT).
  13. * cur, // Next input character to be read
  14. // (YYCURSOR)
  15. * mar, // Most recent match (YYMARKER)
  16. * tok, // Start of current token.
  17. * bol; // Address of the beginning of the
  18. // current line (for debugging).
  19. unsigned line; // Current line no. (for debugging).
  20. unsigned ct; // Number of parsed triples.
  21. bool eof; // if we have reached EOF.
  22. /*!stags:re2c format = "YYCTYPE *@@;"; */
  23. } ParseIterator;
  24. static int fill(ParseIterator *it)
  25. {
  26. if (it->eof) {
  27. return 1;
  28. }
  29. const size_t shift = it->tok - it->buf;
  30. if (shift < 1) {
  31. return 2;
  32. }
  33. log_debug ("Shifting bytes: %lu", shift);
  34. memmove(it->buf, it->tok, it->lim - it->tok);
  35. it->lim -= shift;
  36. it->cur -= shift;
  37. it->mar -= shift;
  38. it->tok -= shift;
  39. it->lim += fread(it->lim, 1, shift, it->fh);
  40. /*!stags:re2c format = "if (it->@@) it->@@ -= shift; "; */
  41. it->lim[0] = 0;
  42. it->eof |= it->lim < it->buf + CHUNK_SIZE - 1;
  43. return 0;
  44. }
  45. static void parse_init(ParseIterator *it, FILE *fh)
  46. {
  47. it->fh = fh;
  48. it->cur = it->mar = it->tok = it->lim = it->buf + CHUNK_SIZE - 1;
  49. it->line = 1;
  50. it->bol = it->buf;
  51. it->ct = 0;
  52. it->eof = 0;
  53. /*!stags:re2c format = "it->@@ = NULL; "; */
  54. fill (it);
  55. }
  56. // Parser interface. Required because Lemon doesn't export these in the header
  57. // automatically.
  58. void *NTParseAlloc();
  59. void NTParse();
  60. void NTParseFree();
  61. // Lexer.
  62. static int lex (ParseIterator *it, LSUP_Term **term)
  63. {
  64. const YYCTYPE *lit_data_e, *dtype_s, *lang_s;
  65. loop:
  66. it->tok = it->cur;
  67. *term = NULL;
  68. /*!re2c
  69. re2c:eof = 0;
  70. re2c:flags:8 = 1;
  71. re2c:flags:tags = 1;
  72. re2c:tags:expression = "it->@@";
  73. re2c:api:style = functions;
  74. re2c:define:YYFILL:naked = 1;
  75. // For unresolved and partially resolved inconsistencies of the spec, see
  76. // https://lists.w3.org/Archives/Public/public-rdf-comments/2017Jun/0000.html
  77. _WS = [\x09\x20];
  78. WS = _WS+;
  79. EOL = [\x0D\x0A] (_WS | [\x0D\x0A])*;
  80. DOT = ".";
  81. HEX = [0-9A-Fa-f];
  82. ECHAR = [\\] [tbnrf"'\\];
  83. UCHAR = "\\u" HEX{4} | "\\U" HEX{8};
  84. PN_CHARS_BASE = [A-Za-z\u00C0-\u00D6\u00D8-\u00F6\u00F8-\u02FF\u0370-\u037D\u037F-\u1FFF\u200C-\u200D\u2070-\u218F\u2C00-\u2FEF\u3001-\uD7FF\uF900-\uFDCF\uFDF0-\uFFFD\U00010000-\U000EFFFF];
  85. PN_CHARS_U = PN_CHARS_BASE | '_' | ':';
  86. PN_CHARS = PN_CHARS_U | '-' | [0-9\u00B7\u0300-\u036F\u203F-\u2040];
  87. IRI_CHARS = ([^\x00-\x20<>"{}|^`\\] | UCHAR)*;
  88. LITERAL_QUOTE = ["] ([^\x22\x5C\x0A\x0D] | ECHAR|UCHAR)* ["];
  89. LANGTAG = [@] [a-zA-Z]+ ("-" [a-zA-Z0-9]+)*;
  90. IRIREF = [<] IRI_CHARS [>];
  91. LITERAL = LITERAL_QUOTE @lit_data_e _WS* ("^^" _WS* @dtype_s IRIREF | @lang_s LANGTAG)?;
  92. BNODE = "_:" ((PN_CHARS_U | [0-9]) ((PN_CHARS | ".")* PN_CHARS)?);
  93. COMMENT = "#" .*;
  94. EOL {
  95. it->line ++;
  96. it->bol = YYCURSOR;
  97. log_debug ("New line: #%u.", it->line);
  98. return T_EOL;
  99. }
  100. $ {
  101. log_debug ("End of buffer.");
  102. return T_EOF;
  103. }
  104. IRIREF {
  105. YYCTYPE *data = unescape_unicode (it->tok + 1);
  106. log_debug ("URI data: %s", data);
  107. *term = LSUP_iriref_new ((char*)data, NULL);
  108. free (data);
  109. return T_IRIREF;
  110. }
  111. LITERAL {
  112. // Only unescape Unicode from data.
  113. size_t size = lit_data_e - it->tok - 2;
  114. YYCTYPE *data = unescape_unicode (it->tok + 1);
  115. log_trace ("Literal data: %s", data);
  116. char *metadata = NULL;
  117. const YYCTYPE *md_marker;
  118. LSUP_TermType type = LSUP_TERM_LITERAL;
  119. if (dtype_s) {
  120. md_marker = dtype_s;
  121. size = YYCURSOR - md_marker - 1;
  122. } else if (lang_s) {
  123. type = LSUP_TERM_LT_LITERAL;
  124. md_marker = lang_s;
  125. size = YYCURSOR - md_marker;
  126. } else md_marker = NULL;
  127. if (md_marker) {
  128. metadata = malloc (size);
  129. memcpy (metadata, md_marker + 1, size);
  130. metadata [size - 1] = '\0';
  131. log_trace ("metadata: %s", metadata);
  132. }
  133. if (type == LSUP_TERM_LITERAL) {
  134. LSUP_Term *dtype;
  135. dtype = (
  136. metadata ? LSUP_iriref_new ((char *) metadata, NULL) : NULL);
  137. *term = LSUP_literal_new ((char *) data, dtype);
  138. } else *term = LSUP_lt_literal_new ((char *) data, (char *) metadata);
  139. free (data);
  140. free (metadata);
  141. return T_LITERAL;
  142. }
  143. BNODE {
  144. YYCTYPE *data = unescape_unicode (it->tok + 2);
  145. log_debug ("BNode data: %s", data);
  146. *term = LSUP_term_new (LSUP_TERM_BNODE, (char*)data, NULL);
  147. free (data);
  148. return T_BNODE;
  149. }
  150. DOT {
  151. log_debug ("End of triple.");
  152. it->ct ++;
  153. return T_DOT;
  154. }
  155. WS {
  156. log_debug ("Separator.");
  157. return T_WS;
  158. }
  159. COMMENT {
  160. size_t size = YYCURSOR - it->tok + 1;
  161. YYCTYPE *data = malloc (size);
  162. memcpy (data, it->tok, size);
  163. data [size - 1] = '\0';
  164. log_debug ("Comment: `%s`", data);
  165. free (data);
  166. goto loop;
  167. }
  168. * {
  169. log_debug (
  170. "Invalid token @ %lu: %s (\\x%x)",
  171. YYCURSOR - it->buf - 1, it->tok, *it->tok);
  172. return -1;
  173. }
  174. */
  175. }
  176. LSUP_rc
  177. LSUP_nt_parse_term (const char *rep, const LSUP_NSMap *map, LSUP_Term **term)
  178. {
  179. FILE *fh = fmemopen ((void *)rep, strlen (rep), "r");
  180. ParseIterator it;
  181. parse_init (&it, fh);
  182. int ttype = lex (&it, term);
  183. fclose (fh);
  184. switch (ttype) {
  185. case T_IRIREF:
  186. case T_LITERAL:
  187. case T_BNODE:
  188. return LSUP_OK;
  189. default:
  190. return LSUP_VALUE_ERR;
  191. }
  192. }
  193. LSUP_rc
  194. LSUP_nt_parse_doc (FILE *fh, LSUP_Graph **gr_p, size_t *ct, char **err_p)
  195. {
  196. *err_p = NULL;
  197. *gr_p = NULL;
  198. ParseIterator parse_it;
  199. parse_init (&parse_it, fh);
  200. void *parser = NTParseAlloc (malloc);
  201. LSUP_rc rc;
  202. LSUP_Graph *gr = LSUP_graph_new (
  203. LSUP_iriref_new (NULL, NULL), LSUP_STORE_HTABLE, NULL, NULL, 0);
  204. if (UNLIKELY (!gr)) return LSUP_MEM_ERR;
  205. LSUP_GraphIterator *it = LSUP_graph_add_init (gr);
  206. if (UNLIKELY (!it)) {
  207. LSUP_graph_free (gr);
  208. return LSUP_MEM_ERR;
  209. }
  210. LSUP_Term *term = NULL;
  211. for (;;) {
  212. int ttype = lex (&parse_it, &term);
  213. if (ttype == -1) {
  214. char token[16] = {'\0'};
  215. strncpy (token, (const char *)parse_it.tok, 15);
  216. char *err_start = "Parse error near token `";
  217. char err_info [64];
  218. sprintf(
  219. err_info, "[...]' at line %u, character %ld.\n",
  220. parse_it.line, parse_it.cur - parse_it.bol);
  221. size_t err_size = strlen (err_start) + 16 + strlen(err_info);
  222. char *err_str = malloc (err_size);
  223. sprintf (err_str, "%s%s%s", err_start, token, err_info);
  224. rc = LSUP_VALUE_ERR;
  225. *err_p = err_str;
  226. goto finally;
  227. }
  228. NTParse (parser, ttype, term, it);
  229. if (ttype == T_EOF) break;
  230. };
  231. if (ct) *ct = parse_it.ct;
  232. log_info ("Parsed %u triples.", parse_it.ct);
  233. log_debug ("Graph size: %lu", LSUP_graph_size (gr));
  234. rc = parse_it.ct > 0 ? LSUP_OK : LSUP_NORESULT;
  235. *gr_p = gr;
  236. finally:
  237. NTParse (parser, 0, NULL, it);
  238. NTParseFree (parser, free);
  239. LSUP_graph_add_done (it);
  240. LSUP_term_free (term);
  241. if (rc < 0) LSUP_graph_free (gr);
  242. return rc;
  243. }