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

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319
  1. #include "parse/lex.h"
  2. #include <stdlib.h>
  3. static int parse_number(const char *str, double *num) {
  4. // TODO: Floats
  5. size_t len = strlen(str);
  6. *num = 0;
  7. int power = 1;
  8. for (int i = (int)len - 1; i >= 0; --i) {
  9. char ch = str[i];
  10. if (ch >= '0' && ch <= '9') {
  11. *num += (ch - '0') * power;
  12. power *= 10;
  13. } else {
  14. return -1;
  15. }
  16. }
  17. return 0;
  18. }
  19. const char *l2_token_kind_name(enum l2_token_kind kind) {
  20. switch (kind) {
  21. case L2_TOK_OPEN_PAREN:
  22. return "open-paren";
  23. case L2_TOK_CLOSE_PAREN:
  24. return "close-paren";
  25. case L2_TOK_OPEN_BRACE:
  26. return "open-brace";
  27. case L2_TOK_CLOSE_BRACE:
  28. return "close-brace";
  29. case L2_TOK_OPEN_BRACKET:
  30. return "open-bracket";
  31. case L2_TOK_CLOSE_BRACKET:
  32. return "close-bracket";
  33. case L2_TOK_COMMA:
  34. return "comma";
  35. case L2_TOK_PERIOD:
  36. return "period";
  37. case L2_TOK_COLON_EQ:
  38. return "period";
  39. case L2_TOK_EOF:
  40. return "end-of-file";
  41. case L2_TOK_NUMBER:
  42. return "number";
  43. case L2_TOK_STRING:
  44. return "string";
  45. case L2_TOK_IDENT:
  46. return "ident";
  47. case L2_TOK_ERROR:
  48. return "error";
  49. }
  50. }
  51. void l2_token_free(struct l2_token *tok) {
  52. if (tok->kind == L2_TOK_STRING || tok->kind == L2_TOK_IDENT) {
  53. free(tok->v.str);
  54. }
  55. }
  56. char *l2_token_extract_str(struct l2_token *tok) {
  57. char *str = tok->v.str;
  58. tok->v.str = NULL;
  59. return str;
  60. }
  61. void l2_lexer_init(struct l2_lexer *lexer, struct l2_io_reader *r) {
  62. lexer->toks[0].kind = L2_TOK_EOF,
  63. lexer->tokidx = 0;
  64. lexer->line = 1;
  65. lexer->ch = 1;
  66. l2_bufio_reader_init(&lexer->reader, r);
  67. }
  68. static int peek_ch(struct l2_lexer *lexer) {
  69. int ch = l2_bufio_peek(&lexer->reader, 1);
  70. return ch;
  71. }
  72. static int read_ch(struct l2_lexer *lexer) {
  73. int ch = l2_bufio_get(&lexer->reader);
  74. lexer->ch += 1;
  75. if (ch == '\n') {
  76. lexer->ch = 1;
  77. lexer->line += 1;
  78. }
  79. return ch;
  80. }
  81. static int is_whitespace(int ch) {
  82. return ch == ' ' || ch == '\r' || ch == '\n' || ch == '\t';
  83. }
  84. static void skip_whitespace(struct l2_lexer *lexer) {
  85. while (is_whitespace(l2_bufio_peek(&lexer->reader, 1))) read_ch(lexer);
  86. }
  87. static void read_string(struct l2_lexer *lexer, struct l2_token *tok) {
  88. tok->kind = L2_TOK_STRING;
  89. tok->v.str = malloc(16);
  90. if (tok->v.str == NULL) {
  91. tok->kind = L2_TOK_ERROR;
  92. tok->v.str = "Allocaton failure";
  93. return;
  94. }
  95. size_t size = 16;
  96. size_t idx = 0;
  97. while (1) {
  98. int ch = read_ch(lexer);
  99. if (ch == '"') {
  100. return;
  101. } else if (ch == EOF) {
  102. tok->kind = L2_TOK_EOF;
  103. free(tok->v.str);
  104. tok->v.str = "Unexpected EOF";
  105. return;
  106. } else if (ch == '\\') {
  107. int ch2 = read_ch(lexer);
  108. switch (ch2) {
  109. case 'n':
  110. ch = '\n';
  111. break;
  112. case 'r':
  113. ch = '\r';
  114. break;
  115. case 't':
  116. ch = '\t';
  117. break;
  118. case EOF:
  119. tok->kind = L2_TOK_EOF;
  120. free(tok->v.str);
  121. tok->v.str = "Unexpected EOF";
  122. return;
  123. default:
  124. ch = ch2;
  125. break;
  126. }
  127. }
  128. tok->v.str[idx++] = (char)ch;
  129. if (idx >= size) {
  130. size *= 2;
  131. char *newbuf = realloc(tok->v.str, size);
  132. if (newbuf == NULL) {
  133. free(tok->v.str);
  134. tok->kind = L2_TOK_ERROR;
  135. tok->v.str = "Allocation failure";
  136. return;
  137. }
  138. tok->v.str = newbuf;
  139. }
  140. }
  141. }
  142. static void read_ident(struct l2_lexer *lexer, struct l2_token *tok) {
  143. tok->kind = L2_TOK_IDENT;
  144. tok->v.str = malloc(16);
  145. if (tok->v.str == NULL) {
  146. tok->kind = L2_TOK_ERROR;
  147. tok->v.str = "Allocaton failure";
  148. return;
  149. }
  150. size_t size = 16;
  151. size_t idx = 0;
  152. while (1) {
  153. int ch = peek_ch(lexer);
  154. if (is_whitespace(ch)) {
  155. tok->v.str[idx] = '\0';
  156. return;
  157. }
  158. switch (ch) {
  159. case '(':
  160. case ')':
  161. case '{':
  162. case '}':
  163. case '[':
  164. case ']':
  165. case ',':
  166. case '.':
  167. case ':':
  168. case EOF:
  169. tok->v.str[idx] = '\0';
  170. return;
  171. }
  172. tok->v.str[idx++] = (char)read_ch(lexer);
  173. if (idx + 1 >= size) {
  174. size *= 2;
  175. char *newbuf = realloc(tok->v.str, size);
  176. if (newbuf == NULL) {
  177. free(tok->v.str);
  178. tok->kind = L2_TOK_ERROR;
  179. tok->v.str = "Allocation failure";
  180. return;
  181. }
  182. tok->v.str = newbuf;
  183. }
  184. }
  185. }
  186. static void read_tok(struct l2_lexer *lexer, struct l2_token *tok) {
  187. skip_whitespace(lexer);
  188. tok->line = lexer->line;
  189. tok->ch = lexer->ch;
  190. int ch = peek_ch(lexer);
  191. switch (ch) {
  192. case '(':
  193. read_ch(lexer);
  194. tok->kind = L2_TOK_OPEN_PAREN;
  195. break;
  196. case ')':
  197. read_ch(lexer);
  198. tok->kind = L2_TOK_CLOSE_PAREN;
  199. break;
  200. case '{':
  201. read_ch(lexer);
  202. tok->kind = L2_TOK_OPEN_BRACE;
  203. break;
  204. case '}':
  205. read_ch(lexer);
  206. tok->kind = L2_TOK_CLOSE_BRACE;
  207. break;
  208. case '[':
  209. read_ch(lexer);
  210. tok->kind = L2_TOK_OPEN_BRACKET;
  211. break;
  212. case ']':
  213. read_ch(lexer);
  214. tok->kind = L2_TOK_CLOSE_BRACKET;
  215. break;
  216. case ',':
  217. read_ch(lexer);
  218. tok->kind = L2_TOK_COMMA;
  219. break;
  220. case '.':
  221. read_ch(lexer);
  222. tok->kind = L2_TOK_PERIOD;
  223. break;
  224. case ':':
  225. read_ch(lexer);
  226. {
  227. ch = read_ch(lexer);
  228. switch (ch) {
  229. case '=':
  230. tok->kind = L2_TOK_COLON_EQ;
  231. break;
  232. default:
  233. tok->kind = L2_TOK_ERROR;
  234. tok->v.str = "Unexpected character";
  235. break;
  236. }
  237. }
  238. break;
  239. case EOF:
  240. tok->kind = L2_TOK_EOF;
  241. break;
  242. case '"':
  243. read_ch(lexer);
  244. read_string(lexer, tok);
  245. break;
  246. default:
  247. read_ident(lexer, tok);
  248. if (tok->kind != L2_TOK_IDENT) {
  249. break;
  250. }
  251. double num;
  252. if (parse_number(tok->v.str, &num) >= 0) {
  253. free(tok->v.str);
  254. tok->kind = L2_TOK_NUMBER;
  255. tok->v.num = num;
  256. }
  257. break;
  258. }
  259. }
  260. struct l2_token *l2_lexer_peek(struct l2_lexer *lexer, int count) {
  261. int offset = count - 1;
  262. while (offset >= lexer->tokidx) {
  263. read_tok(lexer, &lexer->toks[lexer->tokidx++]);
  264. }
  265. return &lexer->toks[offset];
  266. }
  267. void l2_lexer_consume(struct l2_lexer *lexer) {
  268. l2_token_free(&lexer->toks[0]);
  269. lexer->tokidx -= 1;
  270. memmove(lexer->toks, lexer->toks + 1, lexer->tokidx * sizeof(*lexer->toks));
  271. }