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

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