lexer_ttl.re 11 KB

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