Function cbm_parse

src/cypher/cypher.c:1999–2060

}

int cbm_parse(const cbm_token_t *tokens, int token_count, // NOLINT(misc-no-recursion)
              cbm_parse_result_t *out) {
    memset(out, 0, sizeof(*out));
    parser_t p = {.tokens = tokens, .count = token_count, .pos = 0};

    /* Check for unsupported leading keywords */
    const char *unsup = unsupported_clause_error(peek(&p)->type);
    if (unsup) {
        out->error = heap_strdup(unsup);
        return CBM_NOT_FOUND;
    }

    cbm_query_t *q = calloc(CBM_ALLOC_ONE, sizeof(cbm_query_t));

    if (check(&p, TOK_UNWIND)) {
        parse_unwind_clause(&p, q);
    }

    bool first_optional = false;
    if (check(&p, TOK_OPTIONAL)) {
        advance(&p);
        first_optional = true;
    }
    if (!expect(&p, TOK_MATCH)) {
        out->error = heap_strdup(p.error[0] ? p.error : "expected MATCH");
        cbm_query_free(q);
        return CBM_NOT_FOUND;
    }

    int pat_cap = CYP_INIT_CAP4;
    q->patterns = malloc(pat_cap * sizeof(cbm_pattern_t));
    q->pattern_optional = malloc(pat_cap * sizeof(bool));

    if (parse_match_pattern(&p, &q->patterns[0]) < 0) {
        out->error = heap_strdup(p.error[0] ? p.error : "failed to parse pattern");
        cbm_query_free(q);
        return CBM_NOT_FOUND;
    }
    q->pattern_optional[0] = first_optional;
    q->pattern_count = SKIP_ONE;

    if (parse_match_chain(&p, q, &pat_cap) < 0) {
        out->error = heap_strdup(p.error[0] ? p.error : "failed to parse additional pattern");
        cbm_query_free(q);
        return CBM_NOT_FOUND;
    }

    if (parse_where(&p, &q->where) < 0) {
        out->error = heap_strdup(p.error[0] ? p.error : "failed to parse WHERE");
        cbm_query_free(q);
        return CBM_NOT_FOUND;
    }

    if (parse_post_where(&p, q, &pat_cap) < 0) {
        out->error = heap_strdup(p.error[0] ? p.error : "failed to parse query");
        cbm_query_free(q);
        return CBM_NOT_FOUND;
    }