Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.

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