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.6KB

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