{"ast_node_type":"other","tokens":[{"end":68,"kind":"keyword","start":0,"text":"///"}]}
    /// N with depth D can reach some other node N' with lower depth
    /// if the node is not on the stack). When we find that some node
    /// D' (i.e., D' < D), we know that N, N', and all nodes in