{"ast_node_type":"other","tokens":[{"end":52,"kind":"keyword","start":0,"text":"//"}]}
        // the earlier entries require later entries
        // The stack is a vector of pairs of spans and queries; reverse it so that
        let (mut spans, queries): (Vec<_>, Vec<_>) = stack.into_iter().rev().unzip();