Function cbm_lex

src/cypher/cypher.c:359–418

}

int cbm_lex(const char *input, cbm_lex_result_t *out) {
    memset(out, 0, sizeof(*out));
    if (!input) {
        return CBM_NOT_FOUND;
    }

    int len = (int)strlen(input);
    int i = 0;

    while (i < len) {
        if (lex_skip_whitespace_comments(input, len, &i)) {
            continue;
        }

        char c = input[i];

        /* String literals */
        if (c == '"' || c == '\'') {
            char quote = c;
            i++;
            lex_string_literal(input, len, &i, quote, out);
            continue;
        }

        /* Numbers — stop before ".." (DOTDOT operator) */
        if (lex_try_number(input, len, &i, out)) {
            continue;
        }

        /* Identifiers / keywords */
        if (lex_try_ident(input, len, &i, out)) {
            continue;
        }

        /* Two-character tokens */
        {
            bool found_two = lex_try_two_char(input, len, &i, out);
            if (found_two) {
                continue;
            }
        }

        /* Single-character tokens */
        cbm_token_type_t stype = lex_single_char(c);

        if (stype != TOK_EOF) {
            char buf[PAIR_LEN] = {c, '\0'};
            lex_push(out, stype, buf, i);
            i++;
            continue;
        }

        /* Unknown character — skip */
        i++;
    }

    /* Add EOF */
    lex_push(out, TOK_EOF, "", i);