#include "runtime/parser.h"
#include <assert.h>
#include <stdio.h>
#include <stdbool.h>
#include "tree_sitter/runtime.h"
#include "tree_sitter/parser.h"
#include "runtime/tree.h"
#include "runtime/lexer.h"
#include "runtime/length.h"
#include "runtime/array.h"
#include "runtime/language.h"
#include "runtime/alloc.h"

#define LOG(...)                                                               \
  if (self->lexer.debugger.debug_fn) {                                         \
    snprintf(self->lexer.debug_buffer, TS_DEBUG_BUFFER_SIZE, __VA_ARGS__);     \
    self->lexer.debugger.debug_fn(self->lexer.debugger.payload,                \
                                  TSDebugTypeParse, self->lexer.debug_buffer); \
  }

#define LOG_ACTION(...)                   \
  LOG(__VA_ARGS__);                       \
  if (self->print_debugging_graphs) {     \
    fprintf(stderr, "graph {\nlabel=\""); \
    fprintf(stderr, __VA_ARGS__);         \
    fprintf(stderr, "\"\n}\n\n");         \
  }

#define LOG_STACK()                                                     \
  if (self->print_debugging_graphs) {                                   \
    ts_stack_print_dot_graph(self->stack, self->language->symbol_names, \
                             stderr);                                   \
    fputs("\n\n", stderr);                                              \
  }

#define SYM_NAME(symbol) ts_language_symbol_name(self->language, symbol)

#define BOOL_STRING(value) (value ? "true" : "false")

#define CHECK(expr) \
  if (!(expr)) {    \
    goto error;     \
  }

static const TSParseAction ERROR_ACTION = {.type = TSParseActionTypeError };

static const size_t NO_ERROR_DEPTH = (size_t)(-1);

typedef struct {
  TSTree *tree;
  size_t char_index;
} ReusableNode;

struct ErrorRepair {
  TSSymbol symbol;
  size_t in_progress_state_count;
  size_t count_below_error;
};

typedef struct {
  TSParser *parser;
  TSSymbol lookahead_symbol;
  ErrorRepairArray *repairs;
  bool found_repair;
  ErrorRepair best_repair;
  TSStateId best_repair_state;
  TSStateId best_repair_next_state;
  size_t best_repair_skip_count;
} ErrorRepairSession;

typedef enum {
  ParseActionFailed,
  ParseActionUpdated,
  ParseActionRemoved,
} ParseActionResult;

typedef struct {
  enum {
    ReduceFailed,
    ReduceSucceeded,
    ReduceStoppedAtError,
  } status;

  StackSlice slice;
} ReduceResult;

typedef enum {
  RepairFailed,
  RepairSucceeded,
  RepairNoneFound,
} RepairResult;

typedef enum {
  BreakdownFailed,
  BreakdownPerformed,
  BreakdownAborted,
} BreakdownResult;

static BreakdownResult ts_parser__breakdown_top_of_stack(TSParser *self,
                                                         StackVersion version) {
  TSTree *last_child = NULL;
  bool did_break_down = false;
  bool is_still_pending = false;

  do {
    StackPopResult pop = ts_stack_pop_pending(self->stack, version);
    if (!pop.status)
      goto error;
    if (!pop.slices.size)
      break;

    did_break_down = true;
    is_still_pending = false;
    for (size_t i = 0; i < pop.slices.size; i++) {
      StackSlice slice = pop.slices.contents[i];
      TreeArray removed_trees = slice.trees;
      TSTree *parent = *array_front(&removed_trees);
      LOG("breakdown_pop sym:%s, size:%lu", SYM_NAME(parent->symbol),
          ts_tree_total_size(parent).chars);

      TSStateId state = ts_stack_top_state(self->stack, slice.version);
      for (size_t j = 0; j < parent->child_count; j++) {
        last_child = parent->children[j];
        is_still_pending = last_child->child_count > 0;

        if (last_child->symbol == ts_builtin_sym_error) {
          state = ts_parse_state_error;
        } else if (!last_child->extra) {
          TSParseAction action =
            ts_language_last_action(self->language, state, last_child->symbol);
          assert(action.type == TSParseActionTypeShift);
          state = action.data.to_state;
        }

        LOG("breakdown_push sym:%s, size:%lu", SYM_NAME(last_child->symbol),
            ts_tree_total_size(last_child).chars);
        if (!ts_stack_push(self->stack, slice.version, last_child,
                           is_still_pending, state))
          goto error;
      }

      for (size_t j = 1, count = slice.trees.size; j < count; j++) {
        TSTree *tree = slice.trees.contents[j];
        if (!ts_stack_push(self->stack, slice.version, tree, false, state))
          goto error;
      }

      for (size_t j = 0, count = removed_trees.size; j < count; j++)
        ts_tree_release(removed_trees.contents[j]);
      array_delete(&removed_trees);
    }
  } while (last_child && is_still_pending);

  return did_break_down ? BreakdownPerformed : BreakdownAborted;

error:
  return BreakdownFailed;
}

static void ts_parser__pop_reusable_node(ReusableNode *reusable_node) {
  reusable_node->char_index += ts_tree_total_chars(reusable_node->tree);
  while (reusable_node->tree) {
    TSTree *parent = reusable_node->tree->context.parent;
    size_t next_index = reusable_node->tree->context.index + 1;
    if (parent && parent->child_count > next_index) {
      reusable_node->tree = parent->children[next_index];
      return;
    }
    reusable_node->tree = parent;
  }
}

static void ts_parser__breakdown_reusable_node(ReusableNode *reusable_node) {
  do {
    if (reusable_node->tree->symbol == ts_builtin_sym_error) {
      ts_parser__pop_reusable_node(reusable_node);
      return;
    }

    if (reusable_node->tree->child_count == 0) {
      ts_parser__pop_reusable_node(reusable_node);
      return;
    }

    reusable_node->tree = reusable_node->tree->children[0];
  } while (ts_tree_is_fragile(reusable_node->tree));
}

static bool ts_parser__can_reuse(TSParser *self, StackVersion version,
                                 TSTree *tree) {
  if (tree->symbol == ts_builtin_sym_error)
    return false;

  if (ts_tree_is_fragile(tree) &&
      tree->parse_state != ts_stack_top_state(self->stack, version))
    return false;

  TSStateId top_state = ts_stack_top_state(self->stack, version);

  if (tree->lex_state != TS_TREE_STATE_INDEPENDENT &&
      tree->lex_state != self->language->lex_states[top_state])
    return false;

  const TSParseAction action =
    ts_language_last_action(self->language, top_state, tree->symbol);
  if (action.type == TSParseActionTypeError || action.can_hide_split)
    return false;

  if (tree->extra && !action.extra)
    return false;

  return true;
}

static TSTree *ts_parser__get_lookahead(TSParser *self, StackVersion version,
                                        ReusableNode *reusable_node) {
  TSLength position = ts_stack_top_position(self->stack, version);

  while (reusable_node->tree) {
    if (reusable_node->char_index > position.chars) {
      break;
    }

    if (reusable_node->char_index < position.chars) {
      LOG("past_reusable sym:%s", SYM_NAME(reusable_node->tree->symbol));
      ts_parser__pop_reusable_node(reusable_node);
      continue;
    }

    if (reusable_node->tree->has_changes) {
      if (reusable_node->tree->child_count == 0)
        ts_parser__breakdown_top_of_stack(self, version);

      LOG("breakdown_changed sym:%s", SYM_NAME(reusable_node->tree->symbol));
      ts_parser__breakdown_reusable_node(reusable_node);
      continue;
    }

    if (!ts_parser__can_reuse(self, version, reusable_node->tree)) {
      LOG("breakdown_unreusable sym:%s", SYM_NAME(reusable_node->tree->symbol));
      ts_parser__breakdown_reusable_node(reusable_node);
      continue;
    }

    TSTree *result = reusable_node->tree;
    TSLength size = ts_tree_total_size(result);
    LOG("reuse sym:%s size:%lu extra:%d", SYM_NAME(result->symbol), size.chars,
        result->extra);
    ts_parser__pop_reusable_node(reusable_node);
    ts_tree_retain(result);
    return result;
  }

  ts_lexer_reset(&self->lexer, position);
  TSStateId parse_state = ts_stack_top_state(self->stack, version);
  TSStateId lex_state = self->language->lex_states[parse_state];
  LOG("lex state:%d", lex_state);
  return self->language->lex_fn(&self->lexer, lex_state, false);
}

static int ts_parser__select_tree(void *data, TSTree *left, TSTree *right) {
  if (!left || left->symbol == ts_builtin_sym_error)
    return 1;
  if (!right || right->symbol == ts_builtin_sym_error)
    return -1;

  TSParser *self = data;
  int comparison = ts_tree_compare(left, right);
  switch (comparison) {
    case -1:
      LOG_ACTION("select tree:%s, over_tree:%s", SYM_NAME(left->symbol),
                 SYM_NAME(right->symbol));
      break;
    case 1:
      LOG_ACTION("select tree:%s, over_tree:%s", SYM_NAME(right->symbol),
                 SYM_NAME(left->symbol));
      break;
  }

  return comparison;
}

static bool ts_parser__push(TSParser *self, StackVersion version, TSTree *tree,
                            TSStateId state) {
  bool result = ts_stack_push(self->stack, version, tree, false, state);
  ts_tree_release(tree);
  return result;
}

static bool ts_parser__shift(TSParser *self, StackVersion version,
                             TSStateId state, TSTree *lookahead) {
  bool is_pending = lookahead->child_count > 0;
  if (!ts_stack_push(self->stack, version, lookahead, is_pending, state))
    return false;
  return true;
}

static bool ts_parser__shift_extra(TSParser *self, StackVersion version,
                                   TSStateId state, TSTree *lookahead) {
  TSSymbolMetadata metadata = self->language->symbol_metadata[lookahead->symbol];
  if (metadata.structural && ts_stack_version_count(self->stack) > 1) {
    TSTree *copy = ts_tree_make_copy(lookahead);
    if (!copy)
      return false;
    copy->extra = true;
    ParseActionResult result = ts_parser__shift(self, version, state, copy);
    ts_tree_release(copy);
    return result;
  } else {
    lookahead->extra = true;
    return ts_parser__shift(self, version, state, lookahead);
  }
}

static ReduceResult ts_parser__reduce(TSParser *self, StackVersion version,
                                      TSSymbol symbol, int child_count,
                                      bool extra, bool fragile) {
  ReduceResult result = {.status = ReduceSucceeded };
  StackPopResult pop = ts_stack_pop_count(self->stack, version, child_count);
  switch (pop.status) {
    case StackPopFailed:
      goto error;
    case StackPopStoppedAtError:
      result.status = ReduceStoppedAtError;
      result.slice = pop.slices.contents[0];
      return result;
    default:
      break;
  }

  TSSymbolMetadata metadata =
    ts_language_symbol_metadata(self->language, symbol);

  for (size_t i = 0; i < pop.slices.size; i++) {
    StackSlice slice = pop.slices.contents[i];

    size_t child_count = slice.trees.size;
    while (child_count > 0 && slice.trees.contents[child_count - 1]->extra)
      child_count--;

    TSTree *parent =
      ts_tree_make_node(symbol, child_count, slice.trees.contents, metadata);
    if (!parent) {
      ts_tree_array_delete(&slice.trees);
      goto error;
    }

    TSStateId top_state = ts_stack_top_state(self->stack, slice.version);
    if (fragile || self->is_split || ts_stack_version_count(self->stack) > 1) {
      parent->fragile_left = true;
      parent->fragile_right = true;
      parent->parse_state = TS_TREE_STATE_ERROR;
    } else {
      parent->parse_state = top_state;
    }

    TSStateId new_state;
    if (extra) {
      parent->extra = true;
      new_state = top_state;
    } else {
      TSParseAction action =
        ts_language_last_action(self->language, top_state, symbol);
      assert(action.type == TSParseActionTypeShift);
      new_state = action.data.to_state;
    }

    CHECK(ts_parser__push(self, slice.version, parent, new_state));
    for (size_t j = child_count; j < slice.trees.size; j++) {
      TSTree *tree = slice.trees.contents[j];
      CHECK(ts_parser__push(self, slice.version, tree, new_state));
    }
  }

  result.slice = pop.slices.contents[0];
  return result;

error:
  return (ReduceResult){.status = ReduceFailed };
}

static StackIterateAction ts_parser__error_repair_callback(void *payload,
                                                           TSStateId state,
                                                           size_t tree_count,
                                                           bool is_done,
                                                           bool is_pending) {
  ErrorRepairSession *session = (ErrorRepairSession *)payload;
  const TSParser *self = session->parser;
  const TSLanguage *language = self->language;
  TSSymbol lookahead_symbol = session->lookahead_symbol;
  StackIterateAction result = StackIterateNone;

  for (size_t i = 0; i < session->repairs->size; i++) {
    ErrorRepair *repair = &session->repairs->contents[i];
    TSSymbol symbol = repair->symbol;

    if (tree_count >= repair->count_below_error) {
      size_t skip_count = tree_count - repair->count_below_error;

      if (session->found_repair && skip_count > session->best_repair_skip_count) {
        array_erase(session->repairs, i--);
        continue;
      }

      if (repair->in_progress_state_count > 0) {
        TSParseAction action = ts_language_last_action(language, state, symbol);
        if (action.type == TSParseActionTypeShift) {
          TSStateId next_state = action.data.to_state;
          if (ts_language_has_action(language, next_state, lookahead_symbol) &&
              (!session->found_repair ||
               repair->in_progress_state_count >
                 session->best_repair.in_progress_state_count)) {
            result |= StackIteratePop;
            session->found_repair = true;
            session->best_repair = *repair;
            session->best_repair_state = state;
            session->best_repair_skip_count = skip_count;
            session->best_repair_next_state = next_state;
            array_erase(session->repairs, i--);
            continue;
          }
        }
      }
    }

    if (ts_language_symbol_is_in_progress(self->language, state, symbol))
      repair->in_progress_state_count++;
    else
      repair->in_progress_state_count = 0;
  }

  if (session->repairs->size == 0)
    result |= StackIterateStop;

  return result;
}

static RepairResult ts_parser__repair_error(TSParser *self, StackSlice slice,
                                            TSTree *lookahead,
                                            const TSParseAction *actions,
                                            size_t action_count) {
  size_t count_above_error = ts_tree_array_essential_count(&slice.trees);
  ErrorRepairSession session = {
    .parser = self,
    .lookahead_symbol = lookahead->symbol,
    .repairs = &self->error_repairs,
    .found_repair = false,
  };

  array_clear(&self->error_repairs);
  for (size_t i = 0; i < action_count; i++)
    if (actions[i].type == TSParseActionTypeReduce &&
        actions[i].data.child_count > count_above_error)
      CHECK(array_push(
        &self->error_repairs,
        ((ErrorRepair){
          .symbol = actions[i].data.symbol,
          .count_below_error = actions[i].data.child_count - count_above_error,
          .in_progress_state_count = 0,
        })));

  StackPopResult pop = ts_stack_iterate(
    self->stack, slice.version, ts_parser__error_repair_callback, &session);
  CHECK(pop.status);
  if (!session.found_repair) {
    ts_tree_array_delete(&slice.trees);
    return RepairNoneFound;
  }

  ErrorRepair repair = session.best_repair;
  TSStateId next_state = session.best_repair_next_state;
  size_t skip_count = session.best_repair_skip_count;
  TSSymbol symbol = repair.symbol;

  StackSlice new_slice = array_pop(&pop.slices);
  TreeArray children_below = new_slice.trees;
  ts_stack_renumber_version(self->stack, new_slice.version, slice.version);

  while (pop.slices.size) {
    StackSlice other_slice = array_pop(&pop.slices);
    ts_tree_array_delete(&other_slice.trees);
    ts_stack_remove_version(self->stack, other_slice.version);
  }

  LOG_ACTION(
    "repair_found sym:%s, child_count:%lu, match_count:%lu, skipped:%lu",
    SYM_NAME(symbol), repair.count_below_error, repair.in_progress_state_count,
    skip_count);

  if (skip_count > 0) {
    TreeArray skipped_children = array_new();
    CHECK(array_grow(&skipped_children, skip_count));
    for (size_t i = repair.count_below_error; i < children_below.size; i++)
      array_push(&skipped_children, children_below.contents[i]);

    TSTree *error = ts_tree_make_error_node(&skipped_children);
    CHECK(error);
    children_below.size = repair.count_below_error;
    array_push(&children_below, error);
  }

  for (size_t i = 0; i < slice.trees.size; i++)
    array_push(&children_below, slice.trees.contents[i]);
  array_delete(&slice.trees);

  TSTree *parent =
    ts_tree_make_node(symbol, children_below.size, children_below.contents,
                      ts_language_symbol_metadata(self->language, symbol));
  CHECK(parent);
  CHECK(ts_parser__push(self, slice.version, parent, next_state));
  return RepairSucceeded;

error:
  return RepairFailed;
}

static void ts_parser__start(TSParser *self, TSInput input,
                             TSTree *previous_tree) {
  if (previous_tree) {
    LOG("parse_after_edit");
  } else {
    LOG("new_parse");
  }

  ts_lexer_set_input(&self->lexer, input);
  ts_stack_clear(self->stack);
  ts_stack_set_tree_selection_callback(self->stack, self,
                                       ts_parser__select_tree);

  self->finished_tree = NULL;
}

static bool ts_parser__accept(TSParser *self, StackVersion version) {
  TreeArray trees = ts_stack_pop_all(self->stack, version);
  CHECK(trees.contents);

  for (size_t i = trees.size - 1; i + 1 > 0; i--) {
    if (!trees.contents[i]->extra) {
      TSTree *root = trees.contents[i];
      CHECK(array_splice(&trees, i, 1, root->child_count, root->children));

      ts_tree_set_children(root, trees.size, trees.contents);
      if (!trees.size)
        array_delete(&trees);

      ts_stack_remove_version(self->stack, version);
      int comparison = ts_parser__select_tree(self, self->finished_tree, root);
      if (comparison > 0) {
        ts_tree_release(self->finished_tree);
        self->finished_tree = root;
      } else {
        ts_tree_release(root);
      }

      break;
    }
  }

  return true;

error:
  ts_tree_array_delete(&trees);
  return false;
}

static ParseActionResult ts_parser__handle_error(TSParser *self,
                                                 StackVersion version,
                                                 TSTree *invalid_tree) {
  const TSLanguage *language = self->language;
  TreeArray invalid_trees = array_new();
  TSTree *next_token = self->language->lex_fn(&self->lexer, 0, true);
  ts_tree_retain(invalid_tree);
  CHECK(array_push(&invalid_trees, invalid_tree));

  for (;;) {
    if (next_token->symbol == ts_builtin_sym_end) {
      LOG_ACTION("fail_to_recover");

      ts_tree_release(next_token);
      TSTree *error = ts_tree_make_error_node(&invalid_trees);
      CHECK(error);
      CHECK(ts_parser__push(self, version, error, 0));

      TreeArray trees = ts_stack_pop_all(self->stack, version);
      CHECK(trees.contents);
      TSTree *parent = ts_tree_make_node(
        ts_builtin_sym_start, trees.size, trees.contents,
        ts_language_symbol_metadata(language, ts_builtin_sym_start));
      CHECK(parent);
      CHECK(ts_parser__push(self, version, parent, 0));
      CHECK(ts_parser__accept(self, version));
      return ParseActionRemoved;
    }

    TSLength position = self->lexer.current_position;
    TSTree *following_token = language->lex_fn(&self->lexer, 0, true);
    CHECK(following_token);

    if (!ts_language_symbol_metadata(language, next_token->symbol).extra) {
      TSParseAction action = ts_language_last_action(
        language, ts_parse_state_error, next_token->symbol);
      assert(action.type == TSParseActionTypeShift);
      TSStateId next_state = action.data.to_state;

      if (ts_language_has_action(language, next_state, following_token->symbol) &&
          !ts_language_symbol_metadata(language, following_token->symbol).extra) {
        LOG_ACTION("resume_without_context state:%d", next_state);

        ts_tree_release(following_token);
        ts_lexer_reset(&self->lexer, position);
        ts_tree_steal_padding(*array_back(&invalid_trees), next_token);
        TSTree *error = ts_tree_make_error_node(&invalid_trees);
        CHECK(error);
        CHECK(ts_parser__push(self, version, error, ts_parse_state_error));
        CHECK(ts_parser__push(self, version, next_token, next_state));
        return ParseActionUpdated;
      }
    }

    CHECK(array_push(&invalid_trees, next_token));
    next_token = following_token;
  }

error:
  return false;
}

static ParseActionResult ts_parser__consume_lookahead(TSParser *self,
                                                      StackVersion version,
                                                      TSTree *lookahead) {
  for (;;) {
    TSStateId state = ts_stack_top_state(self->stack, version);

    bool error_repair_failed = false;
    size_t error_repair_depth = NO_ERROR_DEPTH;
    StackVersion last_reduction_version = STACK_VERSION_NONE;

    size_t action_count;
    const TSParseAction *actions = ts_language_actions(
      self->language, state, lookahead->symbol, &action_count);

    for (size_t i = 0; i < action_count || error_repair_failed; i++) {
      TSParseAction action;
      if (i < action_count)
        action = actions[i];
      else if (error_repair_failed)
        action = ERROR_ACTION;
      else
        break;

      if (error_repair_depth != NO_ERROR_DEPTH &&
          action.type == TSParseActionTypeReduce &&
          action.data.child_count > error_repair_depth)
        continue;

      LOG_STACK();

      switch (action.type) {
        case TSParseActionTypeError: {
          switch (ts_parser__breakdown_top_of_stack(self, version)) {
            case BreakdownFailed:
              goto error;
            case BreakdownPerformed:
              continue;
            case BreakdownAborted:
              break;
          }

          if (ts_stack_version_count(self->stack) == 1) {
            LOG_ACTION("handle_error %s", SYM_NAME(lookahead->symbol));
            return ts_parser__handle_error(self, version, lookahead);
          } else {
            LOG_ACTION("bail version:%d", version);
            ts_stack_remove_version(self->stack, version);
            return ParseActionRemoved;
          }
        }

        case TSParseActionTypeShift: {
          if (action.extra) {
            LOG_ACTION("shift_extra");
            CHECK(ts_parser__shift_extra(self, version, state, lookahead));
            return ParseActionUpdated;
          } else {
            TSStateId new_state = action.data.to_state;
            LOG_ACTION("shift state:%u", new_state);
            CHECK(ts_parser__shift(self, version, new_state, lookahead));
            return ParseActionUpdated;
          }
        }

        case TSParseActionTypeReduce: {
          if (action.extra) {
            LOG_ACTION("reduce_extra sym:%s", SYM_NAME(action.data.symbol));
            ReduceResult reduction = ts_parser__reduce(
              self, version, action.data.symbol, 1, true, false);
            CHECK(reduction.status);
            ts_stack_renumber_version(self->stack, reduction.slice.version,
                                      version);
          } else {
            LOG_ACTION("reduce sym:%s, child_count:%u, fragile:%s",
                       SYM_NAME(action.data.symbol), action.data.child_count,
                       BOOL_STRING(action.fragile));
            ReduceResult reduction =
              ts_parser__reduce(self, version, action.data.symbol,
                                action.data.child_count, false, action.fragile);
            switch (reduction.status) {
              case ReduceFailed:
                goto error;
              case ReduceSucceeded:
                last_reduction_version = reduction.slice.version;
                break;
              case ReduceStoppedAtError:
                error_repair_depth =
                  ts_tree_array_essential_count(&reduction.slice.trees);

                LOG_ACTION("repair version:%d", version);
                switch (ts_parser__repair_error(
                  self, reduction.slice, lookahead, actions, action_count)) {
                  case RepairFailed:
                    goto error;
                  case RepairNoneFound:
                    LOG_ACTION("no_repair_found");
                    ts_stack_remove_version(self->stack,
                                            reduction.slice.version);
                    error_repair_failed = true;
                    break;
                  case RepairSucceeded:
                    last_reduction_version = reduction.slice.version;
                    break;
                }
                break;
            }
          }
          break;
        }

        case TSParseActionTypeAccept: {
          LOG_ACTION("accept");
          CHECK(ts_parser__accept(self, version));
          return ParseActionRemoved;
        }
      }
    }

    if (last_reduction_version != STACK_VERSION_NONE)
      ts_stack_renumber_version(self->stack, last_reduction_version, version);
  }

error:
  return ParseActionFailed;
}

bool ts_parser_init(TSParser *self) {
  ts_lexer_init(&self->lexer);
  self->finished_tree = NULL;
  self->stack = NULL;
  array_init(&self->error_repairs);

  self->stack = ts_stack_new();
  if (!self->stack)
    goto error;

  if (!array_grow(&self->error_repairs, 4))
    goto error;

  return true;

error:
  if (self->stack) {
    ts_stack_delete(self->stack);
    self->stack = NULL;
  }
  if (self->error_repairs.contents)
    array_delete(&self->error_repairs);
  return false;
}

void ts_parser_destroy(TSParser *self) {
  if (self->stack)
    ts_stack_delete(self->stack);
  if (self->error_repairs.contents)
    array_delete(&self->error_repairs);
}

TSDebugger ts_parser_debugger(const TSParser *self) {
  return self->lexer.debugger;
}

void ts_parser_set_debugger(TSParser *self, TSDebugger debugger) {
  self->lexer.debugger = debugger;
}

TSTree *ts_parser_parse(TSParser *self, TSInput input, TSTree *previous_tree) {
  ts_parser__start(self, input, previous_tree);
  size_t max_position = 0;
  ReusableNode current_reusable_node, next_reusable_node = { previous_tree, 0 };

  for (;;) {
    current_reusable_node = next_reusable_node;
    TSTree *lookahead = NULL;
    size_t last_position, position = 0;

    self->is_split = ts_stack_version_count(self->stack) > 1;

    for (StackVersion version = 0;
         version < ts_stack_version_count(self->stack);) {
      ReusableNode reusable_node = current_reusable_node;

      for (bool removed = false; !removed;) {
        last_position = position;
        size_t new_position = ts_stack_top_position(self->stack, version).chars;
        if (new_position > max_position) {
          max_position = new_position;
          next_reusable_node = reusable_node;
          version++;
          break;
        } else if (new_position == max_position && version > 0) {
          version++;
          break;
        }

        position = new_position;

        LOG_ACTION("process version:%d, version_count:%lu, state:%d, pos:%lu",
                   version, ts_stack_version_count(self->stack),
                   ts_stack_top_state(self->stack, version), position);

        if (!lookahead || (position != last_position) ||
            !ts_parser__can_reuse(self, version, lookahead)) {
          ts_tree_release(lookahead);
          lookahead = ts_parser__get_lookahead(self, version, &reusable_node);
          if (!lookahead)
            return NULL;
        }

        LOG_ACTION("lookahead sym:%s, size:%lu", SYM_NAME(lookahead->symbol),
                   ts_tree_total_chars(lookahead));

        switch (ts_parser__consume_lookahead(self, version, lookahead)) {
          case ParseActionFailed:
            ts_tree_release(lookahead);
            goto error;
          case ParseActionRemoved:
            removed = true;
            break;
          case ParseActionUpdated:
            break;
        }
      }
    }

    ts_stack_merge(self->stack);
    ts_tree_release(lookahead);

    if (ts_stack_version_count(self->stack) == 0) {
      ts_stack_clear(self->stack);
      ts_tree_assign_parents(self->finished_tree);
      return self->finished_tree;
    }
  }

error:
  return NULL;
}