Você não pode selecionar mais de 25 tópicos Os tópicos devem começar com uma letra ou um número, podem incluir traços ('-') e podem ter até 35 caracteres.

lex.c 8.5KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463
  1. #include "parse/lex.h"
  2. #include <stdlib.h>
  3. static void log_token(struct l2_token *tok) {
  4. switch (tok->kind) {
  5. case L2_TOK_STRING:
  6. case L2_TOK_IDENT:
  7. case L2_TOK_ERROR:
  8. printf("%i:%i\t%s '%s'\n", tok->line, tok->ch,
  9. l2_token_kind_name(tok->kind), tok->v.str);
  10. break;
  11. case L2_TOK_NUMBER:
  12. printf("%i:%i\t%s '%g'\n", tok->line, tok->ch,
  13. l2_token_kind_name(tok->kind), tok->v.num);
  14. break;
  15. default:
  16. printf("%i:%i\t%s\n", tok->line, tok->ch,
  17. l2_token_kind_name(tok->kind));
  18. break;
  19. }
  20. }
  21. static long long parse_integer(const char *str, size_t len) {
  22. long long num = 0;
  23. long long power = 1;
  24. for (ssize_t i = len - 1; (ssize_t)i >= 0; --i) {
  25. char ch = str[i];
  26. num += (ch - '0') * power;
  27. power *= 10;
  28. }
  29. return num;
  30. }
  31. const char *l2_token_kind_name(enum l2_token_kind kind) {
  32. switch (kind) {
  33. case L2_TOK_OPEN_PAREN:
  34. return "open-paren";
  35. case L2_TOK_CLOSE_PAREN:
  36. return "close-paren";
  37. case L2_TOK_OPEN_BRACE:
  38. return "open-brace";
  39. case L2_TOK_CLOSE_BRACE:
  40. return "close-brace";
  41. case L2_TOK_OPEN_BRACKET:
  42. return "open-bracket";
  43. case L2_TOK_CLOSE_BRACKET:
  44. return "close-bracket";
  45. case L2_TOK_QUOT:
  46. return "single-quote";
  47. case L2_TOK_COMMA:
  48. return "comma";
  49. case L2_TOK_PERIOD:
  50. return "period";
  51. case L2_TOK_DOT_NUMBER:
  52. return "dot-number";
  53. case L2_TOK_COLON:
  54. return "colon";
  55. case L2_TOK_COLON_EQ:
  56. return "colon-equals";
  57. case L2_TOK_EQUALS:
  58. return "equals";
  59. case L2_TOK_EOL:
  60. return "end-of-line";
  61. case L2_TOK_EOF:
  62. return "end-of-file";
  63. case L2_TOK_NUMBER:
  64. return "number";
  65. case L2_TOK_STRING:
  66. return "string";
  67. case L2_TOK_IDENT:
  68. return "ident";
  69. case L2_TOK_ERROR:
  70. return "error";
  71. }
  72. return "(unknown)";
  73. }
  74. void l2_token_free(struct l2_token *tok) {
  75. if (tok->kind == L2_TOK_STRING || tok->kind == L2_TOK_IDENT) {
  76. free(tok->v.str);
  77. }
  78. }
  79. char *l2_token_extract_str(struct l2_token *tok) {
  80. char *str = tok->v.str;
  81. tok->v.str = NULL;
  82. return str;
  83. }
  84. void l2_lexer_init(struct l2_lexer *lexer, struct l2_io_reader *r) {
  85. lexer->toks[0].kind = L2_TOK_EOF,
  86. lexer->tokidx = 0;
  87. lexer->line = 1;
  88. lexer->ch = 1;
  89. lexer->parens = 0;
  90. lexer->do_log_tokens = 0;
  91. l2_bufio_reader_init(&lexer->reader, r);
  92. }
  93. static int peek_ch(struct l2_lexer *lexer) {
  94. int ch = l2_bufio_peek(&lexer->reader, 1);
  95. return ch;
  96. }
  97. static int read_ch(struct l2_lexer *lexer) {
  98. int ch = l2_bufio_get(&lexer->reader);
  99. lexer->ch += 1;
  100. if (ch == '\n') {
  101. lexer->ch = 1;
  102. lexer->line += 1;
  103. }
  104. return ch;
  105. }
  106. static int is_whitespace(int ch) {
  107. return ch == ' ' || ch == '\r' || ch == '\n' || ch == '\t';
  108. }
  109. static int is_numeric(int ch) {
  110. return ch >= '0' && ch <= '9';
  111. }
  112. static int skip_whitespace(struct l2_lexer *lexer) {
  113. int nl = 0;
  114. while (1) {
  115. while (is_whitespace(peek_ch(lexer))) {
  116. int ch = read_ch(lexer);
  117. if (ch == '\n') {
  118. nl = 1;
  119. }
  120. }
  121. if (peek_ch(lexer) == '#') {
  122. nl = 1;
  123. while (read_ch(lexer) != '\n');
  124. } else {
  125. break;
  126. }
  127. }
  128. return nl;
  129. }
  130. static long long read_integer(struct l2_lexer *lexer) {
  131. char buffer[32]; // Should be enough
  132. size_t len = 0;
  133. while (len < sizeof(buffer) && is_numeric(peek_ch(lexer))) {
  134. buffer[len++] = read_ch(lexer);
  135. }
  136. return parse_integer(buffer, len);
  137. }
  138. static void read_number(struct l2_lexer *lexer, struct l2_token *tok) {
  139. tok->kind = L2_TOK_NUMBER;
  140. float sign = 1;
  141. if (peek_ch(lexer) == '-') {
  142. sign = -1;
  143. read_ch(lexer);
  144. }
  145. if (!is_numeric(peek_ch(lexer))) {
  146. tok->kind = L2_TOK_ERROR;
  147. tok->v.str = "No number in number literal";
  148. return;
  149. }
  150. long long integral = read_integer(lexer);
  151. if (peek_ch(lexer) != '.') {
  152. tok->v.num = (double)integral * sign;
  153. return;
  154. }
  155. read_ch(lexer); // '.'
  156. if (!is_numeric(peek_ch(lexer))) {
  157. tok->kind = L2_TOK_ERROR;
  158. tok->v.str = "Trailing dot in number literal";
  159. return;
  160. }
  161. char buffer[32];
  162. size_t fraction_len = 0;
  163. while (fraction_len < sizeof(buffer) && is_numeric(peek_ch(lexer))) {
  164. buffer[fraction_len++] = read_ch(lexer);
  165. }
  166. long long fraction = 0;
  167. long long fraction_power = 1;
  168. for (ssize_t i = fraction_len - 1; (ssize_t)i >= 0; --i) {
  169. fraction += (buffer[i] - '0') * fraction_power;
  170. fraction_power *= 10;
  171. }
  172. double num = (double)integral + ((double)fraction / (double)fraction_power);
  173. tok->v.num = num * sign;
  174. }
  175. static void read_string(struct l2_lexer *lexer, struct l2_token *tok) {
  176. tok->kind = L2_TOK_STRING;
  177. tok->v.str = malloc(16);
  178. if (tok->v.str == NULL) {
  179. tok->kind = L2_TOK_ERROR;
  180. tok->v.str = "Allocaton failure";
  181. return;
  182. }
  183. size_t size = 16;
  184. size_t idx = 0;
  185. while (1) {
  186. int ch = read_ch(lexer);
  187. if (ch == '"') {
  188. tok->v.str[idx] = '\0';
  189. return;
  190. } else if (ch == EOF) {
  191. tok->kind = L2_TOK_EOF;
  192. free(tok->v.str);
  193. tok->v.str = "Unexpected EOF";
  194. return;
  195. } else if (ch == '\\') {
  196. int ch2 = read_ch(lexer);
  197. switch (ch2) {
  198. case 'n':
  199. ch = '\n';
  200. break;
  201. case 'r':
  202. ch = '\r';
  203. break;
  204. case 't':
  205. ch = '\t';
  206. break;
  207. case EOF:
  208. tok->kind = L2_TOK_EOF;
  209. free(tok->v.str);
  210. tok->v.str = "Unexpected EOF";
  211. return;
  212. default:
  213. ch = ch2;
  214. break;
  215. }
  216. }
  217. tok->v.str[idx++] = (char)ch;
  218. if (idx >= size) {
  219. size *= 2;
  220. char *newbuf = realloc(tok->v.str, size);
  221. if (newbuf == NULL) {
  222. free(tok->v.str);
  223. tok->kind = L2_TOK_ERROR;
  224. tok->v.str = "Allocation failure";
  225. return;
  226. }
  227. tok->v.str = newbuf;
  228. }
  229. }
  230. }
  231. static void read_ident(struct l2_lexer *lexer, struct l2_token *tok) {
  232. tok->kind = L2_TOK_IDENT;
  233. tok->v.str = malloc(16);
  234. if (tok->v.str == NULL) {
  235. tok->kind = L2_TOK_ERROR;
  236. tok->v.str = "Allocaton failure";
  237. return;
  238. }
  239. size_t size = 16;
  240. size_t idx = 0;
  241. while (1) {
  242. int ch = peek_ch(lexer);
  243. if (is_whitespace(ch)) {
  244. tok->v.str[idx] = '\0';
  245. return;
  246. }
  247. switch (ch) {
  248. case '(':
  249. case ')':
  250. case '{':
  251. case '}':
  252. case '[':
  253. case ']':
  254. case '\'':
  255. case ',':
  256. case '.':
  257. case ':':
  258. case '=':
  259. case ';':
  260. case EOF:
  261. tok->v.str[idx] = '\0';
  262. return;
  263. }
  264. tok->v.str[idx++] = (char)read_ch(lexer);
  265. if (idx + 1 >= size) {
  266. size *= 2;
  267. char *newbuf = realloc(tok->v.str, size);
  268. if (newbuf == NULL) {
  269. free(tok->v.str);
  270. tok->kind = L2_TOK_ERROR;
  271. tok->v.str = "Allocation failure";
  272. return;
  273. }
  274. tok->v.str = newbuf;
  275. }
  276. }
  277. }
  278. static void read_tok(struct l2_lexer *lexer, struct l2_token *tok) {
  279. tok->line = lexer->line;
  280. tok->ch = lexer->ch;
  281. int nl = skip_whitespace(lexer);
  282. if (nl && lexer->parens == 0) {
  283. tok->kind = L2_TOK_EOL;
  284. return;
  285. }
  286. int ch = peek_ch(lexer);
  287. switch (ch) {
  288. case '(':
  289. read_ch(lexer);
  290. tok->kind = L2_TOK_OPEN_PAREN;
  291. lexer->parens += 1;
  292. break;
  293. case ')':
  294. read_ch(lexer);
  295. tok->kind = L2_TOK_CLOSE_PAREN;
  296. lexer->parens -= 1;
  297. break;
  298. case '{':
  299. read_ch(lexer);
  300. tok->kind = L2_TOK_OPEN_BRACE;
  301. break;
  302. case '}':
  303. read_ch(lexer);
  304. tok->kind = L2_TOK_CLOSE_BRACE;
  305. break;
  306. case '[':
  307. read_ch(lexer);
  308. tok->kind = L2_TOK_OPEN_BRACKET;
  309. break;
  310. case ']':
  311. read_ch(lexer);
  312. tok->kind = L2_TOK_CLOSE_BRACKET;
  313. break;
  314. case ';':
  315. tok->kind = L2_TOK_EOL;
  316. do {
  317. read_ch(lexer);
  318. skip_whitespace(lexer);
  319. } while (peek_ch(lexer) == ';');
  320. break;
  321. case '\'':
  322. read_ch(lexer);
  323. tok->kind = L2_TOK_QUOT;
  324. break;
  325. case ',':
  326. read_ch(lexer);
  327. tok->kind = L2_TOK_COMMA;
  328. break;
  329. case '.':
  330. read_ch(lexer);
  331. if (is_numeric(peek_ch(lexer))) {
  332. tok->kind = L2_TOK_DOT_NUMBER;
  333. tok->v.integer = read_integer(lexer);
  334. } else {
  335. tok->kind = L2_TOK_PERIOD;
  336. }
  337. break;
  338. case ':':
  339. read_ch(lexer);
  340. ch = peek_ch(lexer);
  341. switch (ch) {
  342. case '=':
  343. read_ch(lexer);
  344. tok->kind = L2_TOK_COLON_EQ;
  345. break;
  346. default:
  347. tok->kind = L2_TOK_COLON;
  348. break;
  349. }
  350. break;
  351. case '=':
  352. read_ch(lexer);
  353. tok->kind = L2_TOK_EQUALS;
  354. break;
  355. case EOF:
  356. tok->kind = L2_TOK_EOF;
  357. break;
  358. case '"':
  359. read_ch(lexer);
  360. read_string(lexer, tok);
  361. break;
  362. default:
  363. if (is_numeric(ch) || ch == '-') {
  364. read_number(lexer, tok);
  365. break;
  366. }
  367. read_ident(lexer, tok);
  368. if (tok->kind != L2_TOK_IDENT) {
  369. break;
  370. }
  371. }
  372. }
  373. struct l2_token *l2_lexer_peek(struct l2_lexer *lexer, int count) {
  374. int offset = count - 1;
  375. while (offset >= lexer->tokidx) {
  376. read_tok(lexer, &lexer->toks[lexer->tokidx++]);
  377. if (lexer->do_log_tokens) {
  378. log_token(&lexer->toks[lexer->tokidx - 1]);
  379. }
  380. }
  381. return &lexer->toks[offset];
  382. }
  383. void l2_lexer_consume(struct l2_lexer *lexer) {
  384. l2_token_free(&lexer->toks[0]);
  385. lexer->tokidx -= 1;
  386. memmove(lexer->toks, lexer->toks + 1, lexer->tokidx * sizeof(*lexer->toks));
  387. }
  388. void l2_lexer_skip_opt(struct l2_lexer *lexer, enum l2_token_kind kind) {
  389. if (l2_lexer_peek(lexer, 1)->kind == kind) {
  390. l2_lexer_consume(lexer);
  391. }
  392. }