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

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351
  1. #include "parse/parse.h"
  2. #include "trace.h"
  3. #include "gen/gen.h"
  4. static int tok_is_end(struct l2_token *tok) {
  5. return
  6. tok->kind == L2_TOK_CLOSE_BRACE || tok->kind == L2_TOK_CLOSE_BRACKET ||
  7. tok->kind == L2_TOK_CLOSE_PAREN || tok->kind == L2_TOK_EOF ||
  8. tok->kind == L2_TOK_EOL;
  9. }
  10. static int parse_expression(
  11. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err);
  12. static int parse_object_literal(
  13. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  14. l2_trace_scope("object literal");
  15. // '{' and EOL already skipped by parse_object_or_function_literal
  16. l2_gen_namespace(gen);
  17. while (1) {
  18. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  19. if (tok->kind == L2_TOK_CLOSE_BRACE) {
  20. l2_lexer_consume(lexer); // '}'
  21. break;
  22. } else if (tok->kind != L2_TOK_IDENT) {
  23. l2_parse_err(err, tok, "In object literal: Expected identifier, got %s",
  24. l2_token_kind_name(tok->kind));
  25. return -1;
  26. }
  27. l2_trace("key: '%s'", tok->v.str);
  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 ':', got %s",
  33. l2_token_kind_name(tok->kind));
  34. return -1;
  35. }
  36. l2_lexer_consume(lexer); // ':'
  37. if (parse_expression(lexer, gen, err) < 0) {
  38. return -1;
  39. }
  40. l2_gen_namespace_set(gen, &key);
  41. l2_gen_pop(gen);
  42. tok = l2_lexer_peek(lexer, 1);
  43. if (tok->kind != L2_TOK_EOL && tok->kind != L2_TOK_CLOSE_BRACE) {
  44. l2_parse_err(err, tok, "In object literal: Expected EOL or '}', got %s",
  45. l2_token_kind_name(tok->kind));
  46. return -1;
  47. }
  48. if (tok->kind == L2_TOK_EOL) {
  49. l2_lexer_consume(lexer); // EOL
  50. }
  51. }
  52. return 0;
  53. }
  54. static int parse_function_literal_impl(
  55. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  56. l2_trace_scope("function literal");
  57. // '{' and EOL already skipped by parse_object_or_function_literal
  58. // The arguments array will be at the top of the stack
  59. char *ident = malloc(2);
  60. ident[0] = '$'; ident[1] = '\0';
  61. l2_gen_assignment(gen, &ident);
  62. int first = 1;
  63. while (1) {
  64. if (l2_lexer_peek(lexer, 1)->kind == L2_TOK_CLOSE_BRACE) {
  65. l2_lexer_consume(lexer); // '}'
  66. break;
  67. }
  68. if (!first) {
  69. l2_gen_pop(gen);
  70. }
  71. l2_trace_scope("function literal expression");
  72. if (parse_expression(lexer, gen, err) < 0) {
  73. return -1;
  74. }
  75. l2_lexer_skip_opt(lexer, L2_TOK_EOL);
  76. first = 0;
  77. }
  78. // All functions must put _something_ on the stack
  79. if (first) {
  80. l2_gen_push(gen, 0);
  81. }
  82. l2_gen_ret(gen);
  83. return 0;
  84. }
  85. static int parse_function_literal(
  86. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  87. l2_gen_flush(gen);
  88. struct l2_io_writer *prev_writer = gen->writer.w;
  89. // Generate the function to a buffer in memory
  90. struct l2_io_mem_writer w = {0};
  91. w.w.write = l2_io_mem_write;
  92. gen->writer.w = &w.w;
  93. // Generates three words; PUSH, 0, RJMP
  94. l2_gen_rjmp(gen, 0);
  95. l2_word pos = gen->pos;
  96. // Generate the function body itself
  97. int ret = parse_function_literal_impl(lexer, gen, err);
  98. l2_gen_flush(gen);
  99. gen->writer.w = prev_writer;
  100. if (ret < 0) {
  101. free(w.mem);
  102. return -1;
  103. }
  104. l2_word *ops = (l2_word *)w.mem;
  105. l2_word opcount = w.len / sizeof(l2_word);
  106. // Due to the earlier gen_rjmp, the second word will be the argument to RJMP.
  107. // Need to set it properly to skip the function body.
  108. // The '- 3' is because we don't skip the PUSH, <count>, RJMP sequence.
  109. ops[1] = opcount - 3;
  110. l2_bufio_put_n(&gen->writer, ops, opcount * sizeof(l2_word));
  111. free(w.mem);
  112. l2_gen_function(gen, pos);
  113. return 0;
  114. }
  115. static int parse_object_or_function_literal(
  116. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  117. l2_trace_scope("object or function literal");
  118. l2_lexer_consume(lexer); // '{'
  119. l2_lexer_skip_opt(lexer, L2_TOK_EOL);
  120. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  121. struct l2_token *tok2 = l2_lexer_peek(lexer, 2);
  122. if (tok->kind == L2_TOK_CLOSE_BRACE) {
  123. l2_trace_scope("empty object literal");
  124. l2_lexer_consume(lexer); // '}'
  125. } else if (tok->kind == L2_TOK_IDENT && tok2->kind == L2_TOK_COLON) {
  126. if (parse_object_literal(lexer, gen, err) < 0) {
  127. return -1;
  128. }
  129. } else {
  130. if (parse_function_literal(lexer, gen, err) < 0) {
  131. return -1;
  132. }
  133. }
  134. return 0;
  135. }
  136. static int parse_arg_level_expression_base(
  137. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  138. l2_trace_scope("arg level expression base");
  139. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  140. struct l2_token *tok2 = l2_lexer_peek(lexer, 2);
  141. if (tok->kind == L2_TOK_OPEN_PAREN) {
  142. l2_trace_scope("group expr");
  143. l2_lexer_consume(lexer); // '('
  144. if (parse_expression(lexer, gen, err) < 0) {
  145. return -1;
  146. }
  147. tok = l2_lexer_peek(lexer, 1);
  148. if (tok->kind != L2_TOK_CLOSE_PAREN) {
  149. l2_parse_err(err, tok, "Expected '(', got %s",
  150. l2_token_kind_name(tok->kind));
  151. return -1;
  152. }
  153. l2_lexer_consume(lexer); // ')'
  154. } else if (tok->kind == L2_TOK_IDENT) {
  155. l2_trace_scope("ident");
  156. l2_trace("ident '%s'", tok->v.str);
  157. char *ident = l2_token_extract_str(tok);
  158. l2_lexer_consume(lexer); // ident
  159. l2_gen_stack_frame_lookup(gen, &ident);
  160. } else if (tok->kind == L2_TOK_NUMBER) {
  161. l2_trace_scope("number literal");
  162. l2_trace("number %g", tok->v.num);
  163. double number = tok->v.num;
  164. l2_lexer_consume(lexer); // number
  165. l2_gen_number(gen, number);
  166. } else if (tok->kind == L2_TOK_STRING) {
  167. l2_trace_scope("string literal");
  168. l2_trace("string '%s'", tok->v.str);
  169. char *str = l2_token_extract_str(tok);
  170. l2_lexer_consume(lexer); // string
  171. l2_gen_string(gen, &str);
  172. } else if (tok->kind == L2_TOK_QUOT && tok2->kind == L2_TOK_IDENT) {
  173. l2_trace_scope("atom literal");
  174. l2_trace("atom '%s'", tok->v.str);
  175. char *ident = l2_token_extract_str(tok2);
  176. l2_lexer_consume(lexer); // "'"
  177. l2_lexer_consume(lexer); // ident
  178. l2_gen_atom(gen, &ident);
  179. } else if (tok->kind == L2_TOK_OPEN_BRACE) {
  180. if (parse_object_or_function_literal(lexer, gen, err) < 0) {
  181. return -1;
  182. }
  183. } else {
  184. l2_parse_err(err, tok, "Unexpected token %s",
  185. l2_token_kind_name(tok->kind));
  186. return -1;
  187. }
  188. return 0;
  189. }
  190. static int parse_arg_level_expression(
  191. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  192. l2_trace_scope("arg level expression");
  193. if (parse_arg_level_expression_base(lexer, gen, err) < 0) {
  194. return -1;
  195. }
  196. while (1) {
  197. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  198. struct l2_token *tok2 = l2_lexer_peek(lexer, 2);
  199. if (tok->kind == L2_TOK_OPEN_PAREN && tok2->kind == L2_TOK_CLOSE_PAREN) {
  200. l2_trace_scope("niladic func call");
  201. l2_lexer_consume(lexer); // '('
  202. l2_lexer_consume(lexer); // ')'
  203. l2_gen_push(gen, 0);
  204. l2_gen_func_call(gen);
  205. } else if (tok->kind == L2_TOK_PERIOD && tok2->kind == L2_TOK_IDENT) {
  206. l2_trace_scope("namespace lookup");
  207. l2_trace("ident '%s'", tok2->v.str);
  208. char *ident = l2_token_extract_str(tok2);
  209. l2_lexer_consume(lexer); // '.'
  210. l2_lexer_consume(lexer); // ident
  211. l2_gen_namespace_lookup(gen, &ident);
  212. } else if (tok->kind == L2_TOK_DOT_NUMBER) {
  213. l2_trace_scope("direct array lookup");
  214. int number = tok->v.integer;
  215. l2_lexer_consume(lexer); // dot-number
  216. l2_gen_direct_array_lookup(gen, number);
  217. } else {
  218. break;
  219. }
  220. }
  221. return 0;
  222. }
  223. static int parse_func_call_after_base(
  224. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  225. l2_trace_scope("func call after base");
  226. size_t argc = 0;
  227. do {
  228. argc += 1;
  229. l2_trace_scope("func call param");
  230. if (parse_arg_level_expression(lexer, gen, err) < 0) {
  231. return -1;
  232. }
  233. } while (!tok_is_end(l2_lexer_peek(lexer, 1)));
  234. // The 'argc' previous expressions were arguments, the one before that was the function
  235. l2_gen_push(gen, argc);
  236. l2_gen_func_call(gen);
  237. return 0;
  238. }
  239. static int parse_expression(
  240. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  241. l2_trace_scope("expression");
  242. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  243. struct l2_token *tok2 = l2_lexer_peek(lexer, 2);
  244. if (tok->kind == L2_TOK_IDENT && tok2->kind == L2_TOK_COLON_EQ) {
  245. l2_trace_scope("assign expression");
  246. l2_trace("ident '%s'", tok->v.str);
  247. char *ident = l2_token_extract_str(tok);
  248. l2_lexer_consume(lexer); // ident
  249. l2_lexer_consume(lexer); // :=
  250. if (parse_expression(lexer, gen, err) < 0) {
  251. return -1;
  252. }
  253. l2_gen_assignment(gen, &ident);
  254. } else {
  255. if (parse_arg_level_expression(lexer, gen, err) < 0) {
  256. return -1;
  257. }
  258. if (!tok_is_end(l2_lexer_peek(lexer, 1))) {
  259. if (parse_func_call_after_base(lexer, gen, err) < 0) {
  260. return -1;
  261. }
  262. }
  263. }
  264. return 0;
  265. }
  266. int l2_parse_program(
  267. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  268. l2_trace_scope("program");
  269. while (1) {
  270. l2_lexer_skip_opt(lexer, L2_TOK_EOL);
  271. if (l2_lexer_peek(lexer, 1)->kind == L2_TOK_EOF) {
  272. break;
  273. }
  274. if (parse_expression(lexer, gen, err) < 0) {
  275. l2_gen_halt(gen);
  276. l2_gen_flush(gen);
  277. return -1;
  278. }
  279. l2_gen_pop(gen);
  280. }
  281. l2_gen_halt(gen);
  282. l2_gen_flush(gen);
  283. return 0;
  284. }