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

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