lexer_ttl.re 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504
  1. #include "volksdata/codec/parser_ttl.h"
  2. #include "volksdata/codec/tokens_ttl.h"
  3. //#include "volksdata/codec/parser_common.h"
  4. /** BEGIN duplicate section
  5. * This section is bit-by-bit identical in NT and TTL lexers. The copy in
  6. * include/volksdata/codec/parser_common.h should be used, but some re2c tags
  7. * are not being parsed in that location.
  8. */
  9. /** @brief TTL is UTF-8 encoded.
  10. *
  11. * @sa https://www.w3.org/TeamSubmission/turtle/#sec-grammar
  12. *
  13. * `char` should be considered to be UTF-8 throughout this library, however,
  14. * setting YYCTYPE to char generates case labels outside of the char range.
  15. */
  16. #define YYCTYPE uint8_t
  17. #define YYCURSOR it->cur
  18. #define YYMARKER it->mar
  19. #define YYLIMIT it->lim
  20. #define YYFILL fill(it) == 0
  21. typedef struct {
  22. FILE * fh; ///< Input file handle.
  23. const char * sh; ///< Input string. Exclusive with fh.
  24. size_t buf_size; ///< Initial allocation for buffer.
  25. YYCTYPE * buf, ///< Start of buffer.
  26. * lim, ///< Position after the last available
  27. ///< input character (YYLIMIT).
  28. * cur, ///< Next input character to be read (YYCURSOR)
  29. * mar, ///< Most recent match (YYMARKER)
  30. * tok, ///< Start of current token.
  31. * bol; ///< Address of the beginning of the
  32. ///< current line (for debugging).
  33. unsigned line; ///< Current line no. (for debugging).
  34. unsigned ct; ///< Number of statements parsed.
  35. bool eof; ///< if we have reached EOF.
  36. /*!stags:re2c format = "YYCTYPE *@@;"; */
  37. } ParseIterator;
  38. static int fill(ParseIterator *it)
  39. {
  40. if (it->eof) {
  41. return 1;
  42. }
  43. size_t shift = it->tok - it->buf;
  44. // If buffer is too small for the lexeme, double the capacity.
  45. while (shift < 1) {
  46. it->buf_size = 2 * it->buf_size;
  47. it->buf = realloc (it->buf, it->buf_size);
  48. if (!it->buf) {
  49. log_error ("Memory allocation error.");
  50. return -1;
  51. }
  52. shift = it->tok - it->buf;
  53. }
  54. LOG_DEBUG("Shifting bytes: %lu", shift);
  55. memmove (it->buf, it->tok, it->lim - it->tok);
  56. it->lim -= shift;
  57. it->cur -= shift;
  58. it->mar -= shift;
  59. it->tok -= shift;
  60. it->lim += fread (it->lim, 1, shift, it->fh);
  61. /*!stags:re2c format = "if (it->@@) it->@@ -= shift; "; */
  62. it->lim[0] = 0;
  63. it->eof |= it->lim < it->buf + CHUNK_SIZE - 1;
  64. return 0;
  65. }
  66. /** @brief Initialize parser.
  67. *
  68. * @param[in] it iterator handle to be initialized.
  69. *
  70. * @param[in] fh Open file handle to read from. This is exclusive with sh. If
  71. * both fh and sh are provided, fh has precedence.
  72. *
  73. * @param[in] sh String to read from. This is exclusive with fh.
  74. */
  75. static void parse_init (ParseIterator *it, FILE *fh, const char *sh)
  76. {
  77. if(fh) {
  78. // Stream handling. It engages YYFILL and reads by chunks.
  79. /*!re2c
  80. re2c:yyfill:enable = 1;
  81. */
  82. it->fh = fh;
  83. it->sh = NULL;
  84. it->buf_size = CHUNK_SIZE;
  85. it->buf = malloc(it->buf_size);
  86. if (!it->buf) log_error ("Error allocating lexer buffer.");
  87. it->cur = it->mar = it->tok = it->lim = it->buf + it->buf_size - 1;
  88. it->bol = it->buf;
  89. it->eof = 0;
  90. } else {
  91. // String handling. Uses the provided string as the buffer.
  92. /*!re2c
  93. re2c:yyfill:enable = 0;
  94. */
  95. it->fh = NULL;
  96. it->sh = sh;
  97. it->buf_size = strlen(sh) + 1;
  98. it->buf = NULL;
  99. it->cur = it->tok = (YYCTYPE*)it->sh;
  100. it->lim = it->mar = it->cur + it->buf_size - 1;
  101. it->bol = it->cur;
  102. it->eof = 1;
  103. }
  104. it->line = 1;
  105. it->ct = 0;
  106. /*!stags:re2c format = "it->@@ = NULL; "; */
  107. if (it->fh) fill (it);
  108. }
  109. /** END duplicate section */
  110. typedef struct {
  111. YYCTYPE * data;
  112. size_t size;
  113. } ParserToken;
  114. // Parser interface. Required here to silence linters.
  115. void *TTLParseAlloc();
  116. void TTLParse();
  117. void TTLParseFree();
  118. #ifdef DEBUG
  119. void TTLParseTrace();
  120. #endif
  121. static inline void newline (ParseIterator *it) {
  122. it->line ++;
  123. it->bol = YYCURSOR;
  124. LOG_TRACE("New line: #%u.", it->line);
  125. }
  126. // Lexer.
  127. static int lex (ParseIterator *it, YYCTYPE **token_p)
  128. {
  129. const YYCTYPE *pfx;
  130. /*!re2c
  131. re2c:eof = 0;
  132. re2c:flags:8 = 1;
  133. re2c:flags:tags = 1;
  134. re2c:tags:expression = "it->@@";
  135. re2c:api:style = functions;
  136. re2c:define:YYFILL:naked = 1;
  137. // Character classes.
  138. EOL = [\n\r];
  139. DIG = [0-9];
  140. HEX = [\x30-\x39\x41-\x46];
  141. CHAR_BASE = "\\u" HEX{4} | "\\U" HEX{8} | '\\'
  142. | [\U0000005D-\U0010FFFF];
  143. CHARACTER = CHAR_BASE | [\x20-\x5B];
  144. // Prefix start character.
  145. PSTART_CHAR = [a-zA-Z] | [\u00C0-\u00D6] | [\u00D8-\u00F6]
  146. | [\u00F8-\u02FF] | [\u0370-\u037D] | [\u037F-\u1FFF]
  147. | [\u200C-\u200D] | [\u2070-\u218F] | [\u2C00-\u2FEF]
  148. | [\u3001-\uD7FF] | [\uF900-\uFDCF] | [\uFDF0-\uFFFD]
  149. | [\U00010000-\U000EFFFF];
  150. // Name start character.
  151. NSTART_CHAR = PSTART_CHAR | '_';
  152. NAME_CHAR = NSTART_CHAR | [0-9\-\u00B7\u0300-\u036F\u203F-\u2040];
  153. ECHAR = CHARACTER | ([\\] [tnr]);
  154. UCHAR = (CHAR_BASE | ([\x20-\x5B] \ [>])) | ([\\] [>]);
  155. SCHAR = (CHAR_BASE | ([\x20-\x5B] \ ["])) | ([\\] ["]);
  156. LCHAR = ECHAR | ([\\] ["]) | [\t\n\r];
  157. // Constructs.
  158. COMMENT = '#' [^\n\r]*;
  159. WS = ([\t\x20] | EOL | COMMENT)+;
  160. INTEGER = [-+]? DIG+;
  161. EXPONENT = [eE] INTEGER;
  162. DOUBLE = [-+]? (DIG+ '.' DIG* EXPONENT | '.'? DIG+ EXPONENT);
  163. DECIMAL = [-+]? (DIG+ '.' DIG* | '.'? DIG+);
  164. */
  165. loop: // Start new token.
  166. it->tok = it->cur;
  167. *token_p = NULL;
  168. /*!re2c
  169. * {
  170. log_warn (
  171. "Invalid token @ %lu: %s (\\x%x)",
  172. YYCURSOR - it->buf - 1, it->tok, *it->tok);
  173. return -1;
  174. }
  175. $ {
  176. LOG_TRACE("End of document.");
  177. return T_EOF;
  178. }
  179. EOL {
  180. newline (it);
  181. goto loop;
  182. }
  183. [\x22]{3} { goto lchar; }
  184. [\x22] { goto schar; }
  185. "true" | "false" {
  186. *token_p = uint8_ndup (it->tok, YYCURSOR - it->tok);
  187. LOG_TRACE("Boolean: %s", *token_p);
  188. return T_BOOLEAN;
  189. }
  190. '<' UCHAR* '>' {
  191. *token_p = uint8_ndup (it->tok + 1, YYCURSOR - it->tok - 2);
  192. LOG_TRACE("URI data: %s", *token_p);
  193. return T_IRIREF;
  194. }
  195. '[' WS? ']' { return T_EMPTY_BNODE; }
  196. '@prefix' WS @pfx (PSTART_CHAR NAME_CHAR*)? ":" {
  197. *token_p = uint8_ndup (pfx, YYCURSOR - pfx - 1);
  198. LOG_TRACE("Prefix declaration: '%s'", *token_p);
  199. return T_PREFIX;
  200. }
  201. '@base' {
  202. LOG_TRACE("'@base' keyword.");
  203. return T_BASE;
  204. }
  205. (PSTART_CHAR NAME_CHAR*)? ":" (NSTART_CHAR NAME_CHAR*)? {
  206. *token_p = uint8_ndup (it->tok, YYCURSOR - it->tok);
  207. LOG_TRACE("ID name: %s", *token_p);
  208. return T_QNAME;
  209. }
  210. '_:' NSTART_CHAR NAME_CHAR* {
  211. *token_p = uint8_ndup (it->tok + 2, YYCURSOR - it->tok - 2);
  212. LOG_TRACE("BNode name: %s", *token_p);
  213. return T_BNODE_ID;
  214. }
  215. COMMENT {
  216. LOG_TRACE("Comment: `%s`", it->tok);
  217. goto loop;
  218. }
  219. WS {
  220. uint8_t *ws = uint8_ndup (it->tok, YYCURSOR - it->tok);
  221. LOG_TRACE("Whitespace: '%s'", ws);
  222. // Count newlines in mixed whitespace.
  223. // That's not great because it scans through the whole whitespace again
  224. // but it's the simplest and safest.
  225. for (size_t i = 0; i < strlen ((char *)ws); i++)
  226. if (ws[i] == '\n' || ws[i] == '\r') newline (it);
  227. free (ws);
  228. return T_WS;
  229. }
  230. '@' [a-z]+ ('-' [a-zA-Z0-9]+)* {
  231. *token_p = uint8_ndup (it->tok + 1, YYCURSOR - it->tok - 1);
  232. LOG_TRACE("Lang tag: '%s'", *token_p);
  233. return T_LANGTAG;
  234. }
  235. INTEGER {
  236. // Normalize sign.
  237. size_t offset = *it->tok == '+' ? 1 : 0;
  238. *token_p = uint8_ndup (it->tok + offset, YYCURSOR - it->tok - offset);
  239. LOG_TRACE("Integer: %s", *token_p);
  240. return T_INTEGER;
  241. }
  242. DOUBLE {
  243. // Normalize sign.
  244. size_t offset = *it->tok == '+' ? 1 : 0;
  245. *token_p = uint8_ndup (it->tok + offset, YYCURSOR - it->tok - offset);
  246. LOG_TRACE("Integer: %s", *token_p);
  247. return T_DOUBLE;
  248. }
  249. DECIMAL {
  250. // Normalize sign.
  251. YYCTYPE offset = *it->tok == '+' ? 1 : 0;
  252. // Normalize trailing zeros in fractional part.
  253. size_t size = YYCURSOR - it->tok - offset;
  254. if (strchr ((char *)it->tok, '.'))
  255. for (YYCTYPE *i = YYCURSOR; *i == '0'; i--) size--;
  256. *token_p = uint8_ndup (it->tok + offset, size);
  257. LOG_TRACE("Integer: %s", *token_p);
  258. return T_DECIMAL;
  259. }
  260. '(' WS? { return T_LPAREN; }
  261. WS? ')' { return T_RPAREN; }
  262. '[' WS? { return T_LBRACKET; }
  263. WS? ']' { return T_RBRACKET; }
  264. ':' { return T_COLON; }
  265. WS? ';' WS? {
  266. LOG_TRACE("End of object list.");
  267. return T_SEMICOLON;
  268. }
  269. WS? ',' WS? { return T_COMMA; }
  270. WS? '.' {
  271. LOG_TRACE("End of statement #%u.", it->ct);
  272. it->ct++;
  273. return T_PERIOD;
  274. }
  275. '^^' { return T_DTYPE_MARKER; }
  276. "a" {
  277. LOG_TRACE("RDF type shorthand 'a'.");
  278. return T_RDF_TYPE;
  279. }
  280. */
  281. schar:
  282. /*!re2c
  283. * {
  284. log_warn (
  285. "Invalid token in string @ %lu: %s (\\x%x)",
  286. YYCURSOR - it->buf - 1, it->tok, *it->tok);
  287. return -1;
  288. }
  289. $ {
  290. log_warn ("Unterminated string!");
  291. return -1;
  292. }
  293. SCHAR { goto schar; }
  294. [\x22] {
  295. *token_p = unescape_unicode (it->tok + 1, YYCURSOR - it->tok - 2);
  296. LOG_TRACE("String: %s", *token_p);
  297. return T_STRING;
  298. }
  299. */
  300. lchar:
  301. /*!re2c
  302. $ {
  303. log_warn ("Unterminated long string!");
  304. return -1;
  305. }
  306. LCHAR { goto lchar; }
  307. [\x22]{3} {
  308. *token_p = unescape_unicode (it->tok + 3, YYCURSOR - it->tok - 6);
  309. LOG_TRACE("Long string: %s", it->tok);
  310. return T_STRING;
  311. }
  312. * {
  313. log_warn (
  314. "Invalid token in long string @ %lu: %s (\\x%x)",
  315. YYCURSOR - it->buf - 1, it->tok, *it->tok);
  316. return -1;
  317. }
  318. */
  319. }
  320. VOLK_rc
  321. VOLK_ttl_parse_doc (
  322. FILE *fh, const char *sh, VOLK_Graph **gr_p, size_t *ct, char **err_p)
  323. {
  324. *err_p = NULL;
  325. *gr_p = NULL;
  326. if (!fh && !sh) {
  327. log_error ("Neither file handle nor string input provided.");
  328. return VOLK_VALUE_ERR;
  329. }
  330. VOLK_TTLParserState *state = malloc (sizeof (*state));
  331. if (UNLIKELY (!state)) return VOLK_MEM_ERR;
  332. state->base = NULL;
  333. state->ct = 0;
  334. state->rc = VOLK_NORESULT;
  335. ParseIterator parse_it;
  336. parse_init (&parse_it, fh, sh);
  337. void *parser = TTLParseAlloc (malloc);
  338. // TODO add basic NS, critically xsd: and rdf:
  339. VOLK_Graph *gr = VOLK_graph_new (NULL, NULL);
  340. if (UNLIKELY (!gr)) return VOLK_MEM_ERR;
  341. state->it = VOLK_graph_add_init (gr);
  342. if (UNLIKELY (!state->it)) {
  343. VOLK_graph_free (gr);
  344. return VOLK_MEM_ERR;
  345. }
  346. YYCTYPE *token;
  347. #ifdef DEBUG
  348. TTLParseTrace (stdout, "TTL Parser > ");
  349. #endif
  350. for (;;) {
  351. int ttype = lex (&parse_it, &token);
  352. if (ttype == -1) {
  353. char err_token[16] = {'\0'};
  354. strncpy (err_token, (const char *)parse_it.tok, 15);
  355. char *err_start = "Lexer error near token `";
  356. char err_info [64];
  357. sprintf(
  358. err_info, "[...]' at line %u, character %ld.\n",
  359. parse_it.line, parse_it.cur - parse_it.bol);
  360. size_t err_size = strlen (err_start) + 16 + strlen(err_info);
  361. char *err_str = malloc (err_size);
  362. sprintf (err_str, "%s%s%s", err_start, err_token, err_info);
  363. log_error (err_str);
  364. state->rc = VOLK_PARSE_ERR;
  365. *err_p = err_str;
  366. goto finally;
  367. }
  368. TTLParse (parser, ttype, token, state);
  369. if (ttype == T_EOF) break;
  370. };
  371. if (ct) *ct = state->ct;
  372. log_info ("Parsed %u triples.", state->ct);
  373. LOG_DEBUG("Graph size: %lu", VOLK_graph_size (gr));
  374. *gr_p = gr;
  375. finally: ;
  376. VOLK_rc rc = state->rc;
  377. LOG_TRACE("rc is %d", rc);
  378. TTLParseFree (parser, free);
  379. VOLK_graph_add_done (state->it);
  380. VOLK_term_free (state->base);
  381. free (state);
  382. if (rc < 0) VOLK_graph_free (gr);
  383. return rc;
  384. }