{"ast_node_type":"import","tokens":[{"end":98,"kind":"keyword","start":0,"text":"//"}]}
    // grows as we recurse into the call graph. If we use the same recursion limit here and in the
    // In code like that pointed out in #128887, the type complexity we ask the solver to deal with
    // solver, the solver hits the limit first and emits a fatal error. But if we use a reduced