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.5KB

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