You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

lex.c 7.4KB

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