Function parse_node

src/cypher/cypher.c:572–622

Parse node: (variable:Label {props}) */

/* Parse node: (variable:Label {props}) */
static int parse_node(parser_t *p, cbm_node_pattern_t *out) {
    memset(out, 0, sizeof(*out));
    if (!expect(p, TOK_LPAREN)) {
        return CBM_NOT_FOUND;
    }

    /* Optional variable */
    if (check(p, TOK_IDENT)) {
        /* Lookahead: if next is COLON, this is a variable */
        /* Or if next is RPAREN/LBRACE, this is a variable without label */
        out->variable = heap_strdup(advance(p)->text);
    }

    /* Optional :Label, with openCypher label alternation :A|B|C (#242).
     * Stored as a single "A|B|C" string; the matcher splits on '|'. */
    if (match(p, TOK_COLON)) {
        const cbm_token_t *label = expect(p, TOK_IDENT);
        if (!label) {
            return CBM_NOT_FOUND;
        }
        char lbuf[CBM_SZ_256];
        int ll = snprintf(lbuf, sizeof(lbuf), "%s", label->text);
        while (match(p, TOK_PIPE)) {
            const cbm_token_t *alt = expect(p, TOK_IDENT);
            if (!alt) {
                return CBM_NOT_FOUND;
            }
            int w = snprintf(lbuf + ll, (ll < (int)sizeof(lbuf)) ? sizeof(lbuf) - (size_t)ll : 0,
                             "|%s", alt->text);
            if (w > 0) {
                ll += w;
            }
            if (ll >= (int)sizeof(lbuf)) {
                break; /* buffer full */
            }
        }
        out->label = heap_strdup(lbuf);
    }

    /* Optional {props} */
    if (check(p, TOK_LBRACE)) {
        if (parse_props(p, &out->props, &out->prop_count) < 0) {
            return CBM_NOT_FOUND;
        }
    }

    if (!expect(p, TOK_RPAREN)) {
        return CBM_NOT_FOUND;
    }
    return 0;
}

/* Parse *min..max hop range after the star token has been consumed */
static void parse_hop_range(parser_t *p, int *min_hops, int *max_hops) {