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

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143
  1. #include "parse/parse.h"
  2. #include <stdbool.h>
  3. #include "gen/gen.h"
  4. static int parse_expression(
  5. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err);
  6. static int parse_function_impl(
  7. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  8. l2_gen_stack_frame(gen);
  9. l2_lexer_consume(lexer); // {
  10. while (1) {
  11. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  12. if (tok->kind == L2_TOK_EOF) {
  13. l2_parse_err(err, tok, "In function: Unexpected EOF");
  14. return -1;
  15. } else if (tok->kind == L2_TOK_CLOSE_BRACE) {
  16. l2_lexer_consume(lexer); // }
  17. break;
  18. }
  19. if (parse_expression(lexer, gen, err) < 0) {
  20. return -1;
  21. }
  22. }
  23. l2_gen_ret(gen);
  24. return 0;
  25. }
  26. static int parse_function(
  27. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  28. l2_gen_flush(gen);
  29. struct l2_io_writer *prev_writer = gen->writer.w;
  30. // Generate the function to a buffer in memory
  31. struct l2_io_mem_writer w = {0};
  32. w.w.write = l2_io_mem_write;
  33. gen->writer.w = &w.w;
  34. // Generates three words; PUSH, 0, RJMP
  35. l2_gen_rjmp(gen, 0);
  36. l2_word pos = gen->pos;
  37. // Generate the function body itself
  38. int ret = parse_function_impl(lexer, gen, err);
  39. l2_gen_flush(gen);
  40. gen->writer.w = prev_writer;
  41. if (ret < 0) {
  42. free(w.mem);
  43. return -1;
  44. }
  45. l2_word *ops = (l2_word *)w.mem;
  46. l2_word opcount = w.len / sizeof(l2_word);
  47. // Due to the earlier gen_rjmp, the second word will be the argument to RJMP.
  48. // Need to set it properly to skip the function body.
  49. // The '- 3' is because we don't skip the PUSH, <count>, RJMP sequence.
  50. ops[1] = opcount - 3;
  51. l2_bufio_put_n(&gen->writer, ops, opcount * sizeof(l2_word));
  52. free(w.mem);
  53. l2_gen_function(gen, pos);
  54. return 0;
  55. }
  56. static int parse_expression(
  57. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  58. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  59. struct l2_token *tok2 = l2_lexer_peek(lexer, 2);
  60. if (tok->kind == L2_TOK_IDENT && tok2->kind == L2_TOK_COLON_EQ) {
  61. char *ident = l2_token_extract_str(tok);
  62. l2_lexer_consume(lexer); // ident
  63. l2_lexer_consume(lexer); // :=
  64. if (parse_expression(lexer, gen, err) < 0) {
  65. free(ident);
  66. return -1;
  67. }
  68. l2_gen_assignment(gen, &ident);
  69. return 0;
  70. } else if (tok->kind == L2_TOK_NUMBER) {
  71. l2_gen_number(gen, tok->v.num);
  72. l2_lexer_consume(lexer); // number
  73. return 0;
  74. } else if (tok->kind == L2_TOK_IDENT) {
  75. char *ident = l2_token_extract_str(tok);
  76. l2_lexer_consume(lexer); // ident
  77. l2_gen_namespace_lookup(gen, &ident);
  78. return 0;
  79. } else if (tok->kind == L2_TOK_STRING) {
  80. char *str = l2_token_extract_str(tok);
  81. l2_lexer_consume(lexer); // string
  82. l2_gen_string(gen, &str);
  83. return 0;
  84. } else if (tok->kind == L2_TOK_OPEN_BRACE) {
  85. return parse_function(lexer, gen, err);
  86. }
  87. l2_parse_err(err, tok, "In expression: Unexpected tokens %s, %s",
  88. l2_token_kind_name(tok->kind), l2_token_kind_name(tok2->kind));
  89. return -1;
  90. }
  91. int l2_parse_program(
  92. struct l2_lexer *lexer, struct l2_generator *gen, struct l2_parse_error *err) {
  93. l2_gen_stack_frame(gen);
  94. bool first = true;
  95. while (1) {
  96. struct l2_token *tok = l2_lexer_peek(lexer, 1);
  97. if (tok->kind == L2_TOK_EOF) {
  98. break;
  99. }
  100. // The previous expr left a value on the stack which we have to pop
  101. if (!first) {
  102. l2_gen_pop(gen);
  103. }
  104. if (parse_expression(lexer, gen, err) < 0) {
  105. l2_gen_halt(gen);
  106. l2_gen_flush(gen);
  107. return -1;
  108. }
  109. first = false;
  110. }
  111. l2_gen_halt(gen);
  112. l2_gen_flush(gen);
  113. return 0;
  114. }