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

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