lexer_ttl.re 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445
  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. #ifdef DEBUG
  77. void TTLParseTrace();
  78. #endif
  79. // Lexer.
  80. static int lex (ParseIterator *it, YYCTYPE **token_p)
  81. {
  82. const YYCTYPE *pfx;
  83. /*!re2c
  84. re2c:eof = 0;
  85. re2c:flags:8 = 1;
  86. re2c:flags:tags = 1;
  87. re2c:tags:expression = "it->@@";
  88. re2c:api:style = functions;
  89. re2c:define:YYFILL:naked = 1;
  90. // Character classes.
  91. EOL = [\n\r];
  92. DIG = [0-9];
  93. HEX = [\x30-\x39\x41-\x46];
  94. CHAR_BASE = "\\u" HEX{4} | "\\U" HEX{8} | '\\'
  95. | [\U0000005D-\U0010FFFF];
  96. CHARACTER = CHAR_BASE | [\x20-\x5B];
  97. // Prefix start character.
  98. PSTART_CHAR = [a-zA-Z] | [\u00C0-\u00D6] | [\u00D8-\u00F6]
  99. | [\u00F8-\u02FF] | [\u0370-\u037D] | [\u037F-\u1FFF]
  100. | [\u200C-\u200D] | [\u2070-\u218F] | [\u2C00-\u2FEF]
  101. | [\u3001-\uD7FF] | [\uF900-\uFDCF] | [\uFDF0-\uFFFD]
  102. | [\U00010000-\U000EFFFF];
  103. // Name start character.
  104. NSTART_CHAR = PSTART_CHAR | '_';
  105. NAME_CHAR = NSTART_CHAR | [0-9\-\u00B7\u0300-\u036F\u203F-\u2040];
  106. ECHAR = CHARACTER | ([\\] [tnr]);
  107. UCHAR = (CHAR_BASE | ([\x20-\x5B] \ [>])) | ([\\] [>]);
  108. SCHAR = (CHAR_BASE | ([\x20-\x5B] \ ["])) | ([\\] ["]);
  109. LCHAR = ECHAR | ([\\] ["]) | [\t\n\r];
  110. // Constructs.
  111. COMMENT = '#' [^\n\r]*;
  112. WS = ([\t\x20] | EOL | COMMENT)+;
  113. INTEGER = [-+]? DIG+;
  114. EXPONENT = [eE] INTEGER;
  115. DOUBLE = [-+]? (DIG+ '.' DIG* EXPONENT | '.'? DIG+ EXPONENT);
  116. DECIMAL = [-+]? (DIG+ '.' DIG* | '.'? DIG+);
  117. */
  118. loop: // Start new token.
  119. it->tok = it->cur;
  120. *token_p = NULL;
  121. /*!re2c
  122. * {
  123. log_warn (
  124. "Invalid token @ %lu: %s (\\x%x)",
  125. YYCURSOR - it->buf - 1, it->tok, *it->tok);
  126. return -1;
  127. }
  128. $ {
  129. log_trace ("End of document.");
  130. return T_EOF;
  131. }
  132. EOL {
  133. newline (it);
  134. goto loop;
  135. }
  136. [\x22]{3} { goto lchar; }
  137. [\x22] { goto schar; }
  138. "true" | "false" {
  139. *token_p = uint8_ndup (it->tok, YYCURSOR - it->tok);
  140. log_trace ("Boolean: %s", *token_p);
  141. return T_BOOLEAN;
  142. }
  143. '<' UCHAR* '>' {
  144. *token_p = uint8_ndup (it->tok + 1, YYCURSOR - it->tok - 2);
  145. log_trace ("URI data: %s", *token_p);
  146. return T_IRIREF;
  147. }
  148. '@prefix' WS @pfx (PSTART_CHAR NAME_CHAR*)? ":" {
  149. *token_p = uint8_ndup (pfx, YYCURSOR - pfx - 1);
  150. log_trace ("Prefix declaration: '%s'", *token_p);
  151. return T_PREFIX;
  152. }
  153. '@base' {
  154. log_trace ("'@base' keyword.");
  155. return T_BASE;
  156. }
  157. (PSTART_CHAR NAME_CHAR*)? ":" (NSTART_CHAR NAME_CHAR*)? {
  158. *token_p = uint8_ndup (it->tok, YYCURSOR - it->tok);
  159. log_trace ("ID name: %s", *token_p);
  160. return T_QNAME;
  161. }
  162. '_:' NSTART_CHAR NAME_CHAR* {
  163. *token_p = uint8_ndup (it->tok + 2, YYCURSOR - it->tok - 2);
  164. log_trace ("BNode name: %s", *token_p);
  165. return T_BNODE_ID;
  166. }
  167. COMMENT {
  168. log_trace ("Comment: `%s`", it->tok);
  169. goto loop;
  170. }
  171. WS {
  172. uint8_t *ws = uint8_ndup (it->tok, YYCURSOR - it->tok);
  173. log_trace ("Whitespace: '%s'", ws);
  174. // Count newlines in mixed whitespace.
  175. // That's not great because it scans through the whole whitespace again
  176. // but it's the simplest and safest.
  177. for (size_t i = 0; i < strlen ((char *)ws); i++)
  178. if (ws[i] == '\n' || ws[i] == '\r') newline (it);
  179. free (ws);
  180. return T_WS;
  181. }
  182. '@' [a-z]+ ('-' [a-zA-Z0-9]+)* {
  183. *token_p = uint8_ndup (it->tok + 1, YYCURSOR - it->tok - 1);
  184. log_trace ("Lang tag: '%s'", *token_p);
  185. return T_LANGTAG;
  186. }
  187. INTEGER {
  188. // Normalize sign.
  189. size_t offset = *it->tok == '+' ? 1 : 0;
  190. *token_p = uint8_ndup (it->tok + offset, YYCURSOR - it->tok - offset);
  191. log_trace ("Integer: %s", *token_p);
  192. return T_INTEGER;
  193. }
  194. DOUBLE {
  195. // Normalize sign.
  196. size_t offset = *it->tok == '+' ? 1 : 0;
  197. *token_p = uint8_ndup (it->tok + offset, YYCURSOR - it->tok - offset);
  198. log_trace ("Integer: %s", *token_p);
  199. return T_DOUBLE;
  200. }
  201. DECIMAL {
  202. // Normalize sign.
  203. YYCTYPE offset = *it->tok == '+' ? 1 : 0;
  204. // Normalize trailing zeros in fractional part.
  205. size_t size = YYCURSOR - it->tok - offset;
  206. if (strchr ((char *)it->tok, '.'))
  207. for (YYCTYPE *i = YYCURSOR; *i == '0'; i--) size--;
  208. *token_p = uint8_ndup (it->tok + offset, size);
  209. log_trace ("Integer: %s", *token_p);
  210. return T_DECIMAL;
  211. }
  212. '(' WS? { return T_LPAREN; }
  213. WS? ')' { return T_RPAREN; }
  214. '[' WS? { return T_LBRACKET; }
  215. WS? ']' { return T_RBRACKET; }
  216. ':' { return T_COLON; }
  217. WS? ';' WS? {
  218. log_trace ("End of object list.");
  219. return T_SEMICOLON;
  220. }
  221. WS? ',' WS? { return T_COMMA; }
  222. WS? '.' {
  223. log_trace ("End of statement #%u.", it->stmt);
  224. it->stmt++;
  225. return T_PERIOD;
  226. }
  227. '^^' { return T_DTYPE_MARKER; }
  228. "a" {
  229. log_trace ("RDF type shorthand 'a'.");
  230. return T_RDF_TYPE;
  231. }
  232. */
  233. schar:
  234. /*!re2c
  235. * {
  236. log_warn (
  237. "Invalid token in string @ %lu: %s (\\x%x)",
  238. YYCURSOR - it->buf - 1, it->tok, *it->tok);
  239. return -1;
  240. }
  241. $ {
  242. log_warn ("Unterminated string!");
  243. return -1;
  244. }
  245. SCHAR { goto schar; }
  246. [\x22] {
  247. *token_p = unescape_unicode (it->tok + 1, YYCURSOR - it->tok - 2);
  248. log_trace ("String: %s", *token_p);
  249. return T_STRING;
  250. }
  251. */
  252. lchar:
  253. /*!re2c
  254. $ {
  255. log_warn ("Unterminated long string!");
  256. return -1;
  257. }
  258. LCHAR { goto lchar; }
  259. [\x22]{3} {
  260. *token_p = unescape_unicode (it->tok + 3, YYCURSOR - it->tok - 6);
  261. log_trace ("Long string: %s", it->tok);
  262. return T_STRING;
  263. }
  264. * {
  265. log_warn (
  266. "Invalid token in long string @ %lu: %s (\\x%x)",
  267. YYCURSOR - it->buf - 1, it->tok, *it->tok);
  268. return -1;
  269. }
  270. */
  271. }
  272. LSUP_rc
  273. LSUP_ttl_parse_doc (FILE *fh, LSUP_Graph **gr_p, size_t *ct, char **err_p)
  274. {
  275. *err_p = NULL;
  276. *gr_p = NULL;
  277. LSUP_TTLParserState *state = malloc (sizeof (*state));
  278. if (UNLIKELY (!state)) return LSUP_MEM_ERR;
  279. state->base = NULL;
  280. state->ct = 0;
  281. state->rc = LSUP_NORESULT;
  282. ParseIterator parse_it;
  283. parse_init (&parse_it, fh);
  284. void *parser = TTLParseAlloc (malloc);
  285. // TODO add basic NS, critically xsd: and rdf:
  286. LSUP_Graph *gr = LSUP_graph_new (NULL, NULL, NULL);
  287. if (UNLIKELY (!gr)) return LSUP_MEM_ERR;
  288. state->it = LSUP_graph_add_init (gr);
  289. if (UNLIKELY (!state->it)) {
  290. LSUP_graph_free (gr);
  291. return LSUP_MEM_ERR;
  292. }
  293. YYCTYPE *token;
  294. #ifdef DEBUG
  295. TTLParseTrace (stdout, "TTL Parser > ");
  296. #endif
  297. for (;;) {
  298. int ttype = lex (&parse_it, &token);
  299. if (ttype == -1) {
  300. char err_token[16] = {'\0'};
  301. strncpy (err_token, (const char *)parse_it.tok, 15);
  302. char *err_start = "Lexer error near token `";
  303. char err_info [64];
  304. sprintf(
  305. err_info, "[...]' at line %u, character %ld.\n",
  306. parse_it.line, parse_it.cur - parse_it.bol);
  307. size_t err_size = strlen (err_start) + 16 + strlen(err_info);
  308. char *err_str = malloc (err_size);
  309. sprintf (err_str, "%s%s%s", err_start, err_token, err_info);
  310. log_error (err_str);
  311. state->rc = LSUP_PARSE_ERR;
  312. *err_p = err_str;
  313. goto finally;
  314. }
  315. TTLParse (parser, ttype, token, state);
  316. if (ttype == T_EOF) break;
  317. };
  318. if (ct) *ct = state->ct;
  319. log_info ("Parsed %u triples.", state->ct);
  320. log_debug ("Graph size: %lu", LSUP_graph_size (gr));
  321. *gr_p = gr;
  322. finally:
  323. LSUP_rc rc = state->rc;
  324. log_trace ("rc is %d", rc);
  325. TTLParseFree (parser, free);
  326. LSUP_graph_add_done (state->it);
  327. LSUP_term_free (state->base);
  328. free (state);
  329. if (rc < 0) LSUP_graph_free (gr);
  330. return rc;
  331. }