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 6.8KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385
  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 int parse_number(const char *str, double *num) {
  22. // TODO: Floats
  23. size_t len = strlen(str);
  24. *num = 0;
  25. int power = 1;
  26. for (int i = (int)len - 1; i >= 0; --i) {
  27. char ch = str[i];
  28. if (ch >= '0' && ch <= '9') {
  29. *num += (ch - '0') * power;
  30. power *= 10;
  31. } else {
  32. return -1;
  33. }
  34. }
  35. return 0;
  36. }
  37. const char *l2_token_kind_name(enum l2_token_kind kind) {
  38. switch (kind) {
  39. case L2_TOK_OPEN_PAREN:
  40. return "open-paren";
  41. case L2_TOK_CLOSE_PAREN:
  42. return "close-paren";
  43. case L2_TOK_OPEN_BRACE:
  44. return "open-brace";
  45. case L2_TOK_CLOSE_BRACE:
  46. return "close-brace";
  47. case L2_TOK_OPEN_BRACKET:
  48. return "open-bracket";
  49. case L2_TOK_CLOSE_BRACKET:
  50. return "close-bracket";
  51. case L2_TOK_QUOT:
  52. return "single-quote";
  53. case L2_TOK_COMMA:
  54. return "comma";
  55. case L2_TOK_PERIOD:
  56. return "period";
  57. case L2_TOK_COLON:
  58. return "colon";
  59. case L2_TOK_COLON_EQ:
  60. return "colon-equals";
  61. case L2_TOK_EOL:
  62. return "end-of-line";
  63. case L2_TOK_EOF:
  64. return "end-of-file";
  65. case L2_TOK_NUMBER:
  66. return "number";
  67. case L2_TOK_STRING:
  68. return "string";
  69. case L2_TOK_IDENT:
  70. return "ident";
  71. case L2_TOK_ERROR:
  72. return "error";
  73. }
  74. }
  75. void l2_token_free(struct l2_token *tok) {
  76. if (tok->kind == L2_TOK_STRING || tok->kind == L2_TOK_IDENT) {
  77. free(tok->v.str);
  78. }
  79. }
  80. char *l2_token_extract_str(struct l2_token *tok) {
  81. char *str = tok->v.str;
  82. tok->v.str = NULL;
  83. return str;
  84. }
  85. void l2_lexer_init(struct l2_lexer *lexer, struct l2_io_reader *r) {
  86. lexer->toks[0].kind = L2_TOK_EOF,
  87. lexer->tokidx = 0;
  88. lexer->line = 1;
  89. lexer->ch = 1;
  90. lexer->parens = 0;
  91. lexer->do_log_tokens = 0;
  92. l2_bufio_reader_init(&lexer->reader, r);
  93. }
  94. static int peek_ch(struct l2_lexer *lexer) {
  95. int ch = l2_bufio_peek(&lexer->reader, 1);
  96. return ch;
  97. }
  98. static int read_ch(struct l2_lexer *lexer) {
  99. int ch = l2_bufio_get(&lexer->reader);
  100. lexer->ch += 1;
  101. if (ch == '\n') {
  102. lexer->ch = 1;
  103. lexer->line += 1;
  104. }
  105. return ch;
  106. }
  107. static int is_whitespace(int ch) {
  108. return ch == ' ' || ch == '\r' || ch == '\n' || ch == '\t';
  109. }
  110. static int skip_whitespace(struct l2_lexer *lexer) {
  111. int nl = 0;
  112. while (is_whitespace(l2_bufio_peek(&lexer->reader, 1))) {
  113. int ch = read_ch(lexer);
  114. if (ch == '\n') {
  115. nl = 1;
  116. }
  117. }
  118. return nl;
  119. }
  120. static void read_string(struct l2_lexer *lexer, struct l2_token *tok) {
  121. tok->kind = L2_TOK_STRING;
  122. tok->v.str = malloc(16);
  123. if (tok->v.str == NULL) {
  124. tok->kind = L2_TOK_ERROR;
  125. tok->v.str = "Allocaton failure";
  126. return;
  127. }
  128. size_t size = 16;
  129. size_t idx = 0;
  130. while (1) {
  131. int ch = read_ch(lexer);
  132. if (ch == '"') {
  133. tok->v.str[idx] = '\0';
  134. return;
  135. } else if (ch == EOF) {
  136. tok->kind = L2_TOK_EOF;
  137. free(tok->v.str);
  138. tok->v.str = "Unexpected EOF";
  139. return;
  140. } else if (ch == '\\') {
  141. int ch2 = read_ch(lexer);
  142. switch (ch2) {
  143. case 'n':
  144. ch = '\n';
  145. break;
  146. case 'r':
  147. ch = '\r';
  148. break;
  149. case 't':
  150. ch = '\t';
  151. break;
  152. case EOF:
  153. tok->kind = L2_TOK_EOF;
  154. free(tok->v.str);
  155. tok->v.str = "Unexpected EOF";
  156. return;
  157. default:
  158. ch = ch2;
  159. break;
  160. }
  161. }
  162. tok->v.str[idx++] = (char)ch;
  163. if (idx >= size) {
  164. size *= 2;
  165. char *newbuf = realloc(tok->v.str, size);
  166. if (newbuf == NULL) {
  167. free(tok->v.str);
  168. tok->kind = L2_TOK_ERROR;
  169. tok->v.str = "Allocation failure";
  170. return;
  171. }
  172. tok->v.str = newbuf;
  173. }
  174. }
  175. }
  176. static void read_ident(struct l2_lexer *lexer, struct l2_token *tok) {
  177. tok->kind = L2_TOK_IDENT;
  178. tok->v.str = malloc(16);
  179. if (tok->v.str == NULL) {
  180. tok->kind = L2_TOK_ERROR;
  181. tok->v.str = "Allocaton failure";
  182. return;
  183. }
  184. size_t size = 16;
  185. size_t idx = 0;
  186. while (1) {
  187. int ch = peek_ch(lexer);
  188. if (is_whitespace(ch)) {
  189. tok->v.str[idx] = '\0';
  190. return;
  191. }
  192. switch (ch) {
  193. case '(':
  194. case ')':
  195. case '{':
  196. case '}':
  197. case '[':
  198. case ']':
  199. case '\'':
  200. case ',':
  201. case '.':
  202. case ':':
  203. case ';':
  204. case EOF:
  205. tok->v.str[idx] = '\0';
  206. return;
  207. }
  208. tok->v.str[idx++] = (char)read_ch(lexer);
  209. if (idx + 1 >= size) {
  210. size *= 2;
  211. char *newbuf = realloc(tok->v.str, size);
  212. if (newbuf == NULL) {
  213. free(tok->v.str);
  214. tok->kind = L2_TOK_ERROR;
  215. tok->v.str = "Allocation failure";
  216. return;
  217. }
  218. tok->v.str = newbuf;
  219. }
  220. }
  221. }
  222. static void read_tok(struct l2_lexer *lexer, struct l2_token *tok) {
  223. tok->line = lexer->line;
  224. tok->ch = lexer->ch;
  225. int nl = skip_whitespace(lexer);
  226. if (nl && lexer->parens == 0) {
  227. tok->kind = L2_TOK_EOL;
  228. return;
  229. }
  230. int ch = peek_ch(lexer);
  231. switch (ch) {
  232. case '(':
  233. read_ch(lexer);
  234. tok->kind = L2_TOK_OPEN_PAREN;
  235. lexer->parens += 1;
  236. break;
  237. case ')':
  238. read_ch(lexer);
  239. tok->kind = L2_TOK_CLOSE_PAREN;
  240. lexer->parens -= 1;
  241. break;
  242. case '{':
  243. read_ch(lexer);
  244. tok->kind = L2_TOK_OPEN_BRACE;
  245. break;
  246. case '}':
  247. read_ch(lexer);
  248. tok->kind = L2_TOK_CLOSE_BRACE;
  249. break;
  250. case '[':
  251. read_ch(lexer);
  252. tok->kind = L2_TOK_OPEN_BRACKET;
  253. break;
  254. case ']':
  255. read_ch(lexer);
  256. tok->kind = L2_TOK_CLOSE_BRACKET;
  257. break;
  258. case ';':
  259. tok->kind = L2_TOK_EOL;
  260. do {
  261. read_ch(lexer);
  262. skip_whitespace(lexer);
  263. } while (peek_ch(lexer) == ';');
  264. break;
  265. case '\'':
  266. read_ch(lexer);
  267. tok->kind = L2_TOK_QUOT;
  268. break;
  269. case ',':
  270. read_ch(lexer);
  271. tok->kind = L2_TOK_COMMA;
  272. break;
  273. case '.':
  274. read_ch(lexer);
  275. tok->kind = L2_TOK_PERIOD;
  276. break;
  277. case ':':
  278. read_ch(lexer);
  279. ch = peek_ch(lexer);
  280. switch (ch) {
  281. case '=':
  282. read_ch(lexer);
  283. tok->kind = L2_TOK_COLON_EQ;
  284. break;
  285. default:
  286. tok->kind = L2_TOK_COLON;
  287. break;
  288. }
  289. break;
  290. case EOF:
  291. tok->kind = L2_TOK_EOF;
  292. break;
  293. case '"':
  294. read_ch(lexer);
  295. read_string(lexer, tok);
  296. break;
  297. default:
  298. read_ident(lexer, tok);
  299. if (tok->kind != L2_TOK_IDENT) {
  300. break;
  301. }
  302. double num;
  303. if (parse_number(tok->v.str, &num) >= 0) {
  304. free(tok->v.str);
  305. tok->kind = L2_TOK_NUMBER;
  306. tok->v.num = num;
  307. }
  308. break;
  309. }
  310. }
  311. struct l2_token *l2_lexer_peek(struct l2_lexer *lexer, int count) {
  312. int offset = count - 1;
  313. while (offset >= lexer->tokidx) {
  314. read_tok(lexer, &lexer->toks[lexer->tokidx++]);
  315. if (lexer->do_log_tokens) {
  316. log_token(&lexer->toks[lexer->tokidx - 1]);
  317. }
  318. }
  319. return &lexer->toks[offset];
  320. }
  321. void l2_lexer_consume(struct l2_lexer *lexer) {
  322. l2_token_free(&lexer->toks[0]);
  323. lexer->tokidx -= 1;
  324. memmove(lexer->toks, lexer->toks + 1, lexer->tokidx * sizeof(*lexer->toks));
  325. }
  326. void l2_lexer_skip_opt(struct l2_lexer *lexer, enum l2_token_kind kind) {
  327. if (l2_lexer_peek(lexer, 1)->kind == kind) {
  328. l2_lexer_consume(lexer);
  329. }
  330. }