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

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218
  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_function_impl(
  12. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  13. l2_lexer_consume(lexer); // {
  14. l2_lexer_skip_opt(lexer, L2_TOK_EOL);
  15. int first = 1;
  16. while (1) {
  17. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  18. if (tok->kind == L2_TOK_EOF) {
  19. l2_parse_err(err, tok, "In function: Unexpected EOF");
  20. return -1;
  21. } else if (tok->kind == L2_TOK_CLOSE_BRACE) {
  22. l2_lexer_consume(lexer); // }
  23. break;
  24. }
  25. // The previous expr left a value on the stack which we have to pop
  26. if (!first) {
  27. l2_gen_pop(gen);
  28. }
  29. if (parse_expression(lexer, gen, err) < 0) {
  30. return -1;
  31. }
  32. l2_lexer_skip_opt(lexer, L2_TOK_EOL);
  33. first = 0;
  34. }
  35. l2_gen_ret(gen);
  36. return 0;
  37. }
  38. static int parse_function(
  39. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  40. l2_gen_flush(gen);
  41. struct l2_io_writer *prev_writer = gen->writer.w;
  42. // Generate the function to a buffer in memory
  43. struct l2_io_mem_writer w = {0};
  44. w.w.write = l2_io_mem_write;
  45. gen->writer.w = &w.w;
  46. // Generates three words; PUSH, 0, RJMP
  47. l2_gen_rjmp(gen, 0);
  48. l2_word pos = gen->pos;
  49. // Generate the function body itself
  50. int ret = parse_function_impl(lexer, gen, err);
  51. l2_gen_flush(gen);
  52. gen->writer.w = prev_writer;
  53. if (ret < 0) {
  54. free(w.mem);
  55. return -1;
  56. }
  57. l2_word *ops = (l2_word *)w.mem;
  58. l2_word opcount = w.len / sizeof(l2_word);
  59. // Due to the earlier gen_rjmp, the second word will be the argument to RJMP.
  60. // Need to set it properly to skip the function body.
  61. // The '- 3' is because we don't skip the PUSH, <count>, RJMP sequence.
  62. ops[1] = opcount - 3;
  63. l2_bufio_put_n(&gen->writer, ops, opcount * sizeof(l2_word));
  64. free(w.mem);
  65. l2_gen_function(gen, pos);
  66. return 0;
  67. }
  68. static int parse_sub_expression(
  69. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  70. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  71. struct l2_token *tok2 = l2_lexer_peek(lexer, 2);
  72. if (tok->kind == L2_TOK_OPEN_PAREN) {
  73. l2_lexer_consume(lexer); // (
  74. tok = l2_lexer_peek(lexer, 1);
  75. tok2 = l2_lexer_peek(lexer, 2);
  76. // Special case: (foo) should be interpreted as a function call
  77. if (tok->kind == L2_TOK_IDENT && tok2->kind == L2_TOK_CLOSE_PAREN) {
  78. char *ident = l2_token_extract_str(tok);
  79. l2_lexer_consume(lexer); // ident
  80. l2_lexer_consume(lexer); // )
  81. l2_gen_push(gen, 0); // Arg count
  82. l2_gen_namespace_lookup(gen, &ident);
  83. l2_gen_func_call(gen);
  84. return 0;
  85. }
  86. if (parse_expression(lexer, gen, err) < 0) {
  87. return -1;
  88. }
  89. if (tok->kind != L2_TOK_CLOSE_PAREN) {
  90. l2_parse_err(err, tok, "In paren expression: Expected close paren, got %s",
  91. l2_token_kind_name(tok->kind));
  92. return -1;
  93. }
  94. l2_lexer_consume(lexer); // )
  95. return 0;
  96. } else if (tok->kind == L2_TOK_NUMBER) {
  97. l2_gen_number(gen, tok->v.num);
  98. l2_lexer_consume(lexer); // number
  99. return 0;
  100. } else if (tok->kind == L2_TOK_IDENT) {
  101. char *ident = l2_token_extract_str(tok);
  102. l2_lexer_consume(lexer); // ident
  103. l2_gen_namespace_lookup(gen, &ident);
  104. return 0;
  105. } else if (tok->kind == L2_TOK_QUOT && tok2->kind == L2_TOK_IDENT) {
  106. char *str = l2_token_extract_str(tok2);
  107. l2_lexer_consume(lexer); // '
  108. l2_lexer_consume(lexer); // ident
  109. l2_gen_atom(gen, &str);
  110. return 0;
  111. } else if (tok->kind == L2_TOK_STRING) {
  112. char *str = l2_token_extract_str(tok);
  113. l2_lexer_consume(lexer); // string
  114. l2_gen_string(gen, &str);
  115. return 0;
  116. } else if (tok->kind == L2_TOK_OPEN_BRACE) {
  117. return parse_function(lexer, gen, err);
  118. }
  119. l2_parse_err(err, tok, "In expression: Unexpected token %s",
  120. l2_token_kind_name(tok->kind));
  121. return -1;
  122. }
  123. static int parse_expression(
  124. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  125. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  126. struct l2_token *tok2 = l2_lexer_peek(lexer, 2);
  127. if (tok->kind == L2_TOK_IDENT && tok2->kind == L2_TOK_COLON_EQ) {
  128. char *ident = l2_token_extract_str(tok);
  129. l2_lexer_consume(lexer); // ident
  130. l2_lexer_consume(lexer); // :=
  131. if (parse_expression(lexer, gen, err) < 0) {
  132. free(ident);
  133. return -1;
  134. }
  135. l2_gen_assignment(gen, &ident);
  136. return 0;
  137. } else if (tok->kind == L2_TOK_IDENT && !is_end_tok(tok2)) {
  138. char *ident = l2_token_extract_str(tok);
  139. l2_lexer_consume(lexer);
  140. l2_word count = 0;
  141. while (!is_end_tok(l2_lexer_peek(lexer, 1))) {
  142. count += 1;
  143. if (parse_sub_expression(lexer, gen, err) < 0) {
  144. return -1;
  145. }
  146. }
  147. l2_gen_push(gen, count);
  148. l2_gen_namespace_lookup(gen, &ident);
  149. l2_gen_func_call(gen);
  150. return 0;
  151. }
  152. return parse_sub_expression(lexer, gen, err);
  153. }
  154. int l2_parse_program(
  155. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  156. l2_lexer_skip_opt(lexer, L2_TOK_EOL);
  157. int first = 1;
  158. while (1) {
  159. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  160. if (tok->kind == L2_TOK_EOF) {
  161. break;
  162. }
  163. // The previous expr left a value on the stack which we have to pop
  164. if (!first) {
  165. l2_gen_pop(gen);
  166. }
  167. if (parse_expression(lexer, gen, err) < 0) {
  168. l2_gen_halt(gen);
  169. l2_gen_flush(gen);
  170. return -1;
  171. }
  172. l2_lexer_skip_opt(lexer, L2_TOK_EOL);
  173. first = 0;
  174. }
  175. l2_gen_halt(gen);
  176. l2_gen_flush(gen);
  177. return 0;
  178. }