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