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.

parse.c 7.3KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292
  1. #include "parse/parse.h"
  2. #include "gen/gen.h"
  3. static int is_end_tok(struct l2_token *tok) {
  4. return
  5. tok->kind == L2_TOK_CLOSE_PAREN || tok->kind == L2_TOK_CLOSE_BRACE ||
  6. tok->kind == L2_TOK_CLOSE_BRACKET || tok->kind == L2_TOK_EOL ||
  7. tok->kind == L2_TOK_EOF;
  8. }
  9. static int parse_expression(
  10. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err);
  11. static int parse_object(
  12. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  13. // { and EOL are already skipped
  14. l2_gen_namespace(gen);
  15. while (1) {
  16. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  17. if (tok->kind == L2_TOK_EOF) {
  18. l2_parse_err(err, tok, "In object literal: Unexpected EOF");
  19. return -1;
  20. } else if (tok->kind == L2_TOK_CLOSE_BRACE) {
  21. l2_lexer_consume(lexer); // }
  22. break;
  23. }
  24. if (tok->kind != L2_TOK_IDENT) {
  25. l2_parse_err(err, tok, "In object literal: Expected identifier, got %s\n",
  26. l2_token_kind_name(tok->kind));
  27. }
  28. char *key = l2_token_extract_str(tok);
  29. l2_lexer_consume(lexer); // ident
  30. tok = l2_lexer_peek(lexer, 1);
  31. if (tok->kind != L2_TOK_COLON) {
  32. l2_parse_err(err, tok, "In object literal: Expected colon, got %s\n",
  33. l2_token_kind_name(tok->kind));
  34. }
  35. l2_lexer_consume(lexer); // :
  36. if (parse_expression(lexer, gen, err) < 0) {
  37. return -1;
  38. }
  39. l2_gen_namespace_set(gen, &key);
  40. l2_gen_pop(gen);
  41. tok = l2_lexer_peek(lexer, 1);
  42. if (tok->kind != L2_TOK_EOL) {
  43. l2_parse_err(err, tok, "In object literal: Expected EOL, got %s\n",
  44. l2_token_kind_name(tok->kind));
  45. return -1;
  46. }
  47. l2_lexer_consume(lexer); // EOL
  48. }
  49. return 0;
  50. }
  51. static int parse_function_impl(
  52. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  53. // { and EOL are already skipped
  54. int first = 1;
  55. while (1) {
  56. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  57. if (tok->kind == L2_TOK_EOF) {
  58. l2_parse_err(err, tok, "In function: Unexpected EOF");
  59. return -1;
  60. } else if (tok->kind == L2_TOK_CLOSE_BRACE) {
  61. l2_lexer_consume(lexer); // }
  62. break;
  63. }
  64. // The previous expr left a value on the stack which we have to pop
  65. if (!first) {
  66. l2_gen_pop(gen);
  67. }
  68. if (parse_expression(lexer, gen, err) < 0) {
  69. return -1;
  70. }
  71. l2_lexer_skip_opt(lexer, L2_TOK_EOL);
  72. first = 0;
  73. }
  74. // Empty function bodies must still return something; just return 0 (none)
  75. if (first) {
  76. l2_gen_push(gen, 0);
  77. }
  78. l2_gen_ret(gen);
  79. return 0;
  80. }
  81. static int parse_function(
  82. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  83. l2_gen_flush(gen);
  84. struct l2_io_writer *prev_writer = gen->writer.w;
  85. // Generate the function to a buffer in memory
  86. struct l2_io_mem_writer w = {0};
  87. w.w.write = l2_io_mem_write;
  88. gen->writer.w = &w.w;
  89. // Generates three words; PUSH, 0, RJMP
  90. l2_gen_rjmp(gen, 0);
  91. l2_word pos = gen->pos;
  92. // Generate the function body itself
  93. int ret = parse_function_impl(lexer, gen, err);
  94. l2_gen_flush(gen);
  95. gen->writer.w = prev_writer;
  96. if (ret < 0) {
  97. free(w.mem);
  98. return -1;
  99. }
  100. l2_word *ops = (l2_word *)w.mem;
  101. l2_word opcount = w.len / sizeof(l2_word);
  102. // Due to the earlier gen_rjmp, the second word will be the argument to RJMP.
  103. // Need to set it properly to skip the function body.
  104. // The '- 3' is because we don't skip the PUSH, <count>, RJMP sequence.
  105. ops[1] = opcount - 3;
  106. l2_bufio_put_n(&gen->writer, ops, opcount * sizeof(l2_word));
  107. free(w.mem);
  108. l2_gen_function(gen, pos);
  109. return 0;
  110. }
  111. static int parse_function_or_object(
  112. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  113. l2_lexer_consume(lexer); // {
  114. l2_lexer_skip_opt(lexer, L2_TOK_EOL);
  115. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  116. struct l2_token *tok2 = l2_lexer_peek(lexer, 2);
  117. if (tok->kind == L2_TOK_CLOSE_BRACE) {
  118. l2_lexer_consume(lexer); // }
  119. l2_gen_namespace(gen);
  120. return 0;
  121. } else if (tok->kind == L2_TOK_IDENT && tok2->kind == L2_TOK_COLON) {
  122. return parse_object(lexer, gen, err);
  123. } else {
  124. return parse_function(lexer, gen, err);
  125. }
  126. }
  127. static int parse_sub_expression(
  128. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  129. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  130. struct l2_token *tok2 = l2_lexer_peek(lexer, 2);
  131. if (tok->kind == L2_TOK_OPEN_PAREN) {
  132. l2_lexer_consume(lexer); // (
  133. tok = l2_lexer_peek(lexer, 1);
  134. tok2 = l2_lexer_peek(lexer, 2);
  135. // Special case: (foo) should be interpreted as a function call
  136. if (tok->kind == L2_TOK_IDENT && tok2->kind == L2_TOK_CLOSE_PAREN) {
  137. char *ident = l2_token_extract_str(tok);
  138. l2_lexer_consume(lexer); // ident
  139. l2_lexer_consume(lexer); // )
  140. l2_gen_push(gen, 0); // Arg count
  141. l2_gen_stack_frame_lookup(gen, &ident);
  142. l2_gen_func_call(gen);
  143. return 0;
  144. }
  145. if (parse_expression(lexer, gen, err) < 0) {
  146. return -1;
  147. }
  148. if (tok->kind != L2_TOK_CLOSE_PAREN) {
  149. l2_parse_err(err, tok, "In paren expression: Expected close paren, got %s",
  150. l2_token_kind_name(tok->kind));
  151. return -1;
  152. }
  153. l2_lexer_consume(lexer); // )
  154. return 0;
  155. } else if (tok->kind == L2_TOK_NUMBER) {
  156. l2_gen_number(gen, tok->v.num);
  157. l2_lexer_consume(lexer); // number
  158. return 0;
  159. } else if (tok->kind == L2_TOK_IDENT) {
  160. char *ident = l2_token_extract_str(tok);
  161. l2_lexer_consume(lexer); // ident
  162. l2_gen_stack_frame_lookup(gen, &ident);
  163. return 0;
  164. } else if (tok->kind == L2_TOK_QUOT && tok2->kind == L2_TOK_IDENT) {
  165. char *str = l2_token_extract_str(tok2);
  166. l2_lexer_consume(lexer); // '
  167. l2_lexer_consume(lexer); // ident
  168. l2_gen_atom(gen, &str);
  169. return 0;
  170. } else if (tok->kind == L2_TOK_STRING) {
  171. char *str = l2_token_extract_str(tok);
  172. l2_lexer_consume(lexer); // string
  173. l2_gen_string(gen, &str);
  174. return 0;
  175. } else if (tok->kind == L2_TOK_OPEN_BRACE) {
  176. return parse_function_or_object(lexer, gen, err);
  177. }
  178. l2_parse_err(err, tok, "In expression: Unexpected token %s",
  179. l2_token_kind_name(tok->kind));
  180. return -1;
  181. }
  182. static int parse_expression(
  183. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  184. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  185. struct l2_token *tok2 = l2_lexer_peek(lexer, 2);
  186. if (tok->kind == L2_TOK_IDENT && tok2->kind == L2_TOK_COLON_EQ) {
  187. char *ident = l2_token_extract_str(tok);
  188. l2_lexer_consume(lexer); // ident
  189. l2_lexer_consume(lexer); // :=
  190. if (parse_expression(lexer, gen, err) < 0) {
  191. free(ident);
  192. return -1;
  193. }
  194. l2_gen_assignment(gen, &ident);
  195. return 0;
  196. } else if (tok->kind == L2_TOK_IDENT && !is_end_tok(tok2)) {
  197. char *ident = l2_token_extract_str(tok);
  198. l2_lexer_consume(lexer);
  199. l2_word count = 0;
  200. while (!is_end_tok(l2_lexer_peek(lexer, 1))) {
  201. count += 1;
  202. if (parse_sub_expression(lexer, gen, err) < 0) {
  203. return -1;
  204. }
  205. }
  206. l2_gen_push(gen, count);
  207. l2_gen_stack_frame_lookup(gen, &ident);
  208. l2_gen_func_call(gen);
  209. return 0;
  210. }
  211. return parse_sub_expression(lexer, gen, err);
  212. }
  213. int l2_parse_program(
  214. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  215. l2_lexer_skip_opt(lexer, L2_TOK_EOL);
  216. int first = 1;
  217. while (1) {
  218. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  219. if (tok->kind == L2_TOK_EOF) {
  220. break;
  221. }
  222. // The previous expr left a value on the stack which we have to pop
  223. if (!first) {
  224. l2_gen_pop(gen);
  225. }
  226. if (parse_expression(lexer, gen, err) < 0) {
  227. l2_gen_halt(gen);
  228. l2_gen_flush(gen);
  229. return -1;
  230. }
  231. l2_lexer_skip_opt(lexer, L2_TOK_EOL);
  232. first = 0;
  233. }
  234. l2_gen_halt(gen);
  235. l2_gen_flush(gen);
  236. return 0;
  237. }