code: func TryResolve(n ast.Node, c *Context) bool {
  	switch node := n.(type) {
  	case *ast.BasicLit:
  		return true
  
  	case *ast.CompositeLit:
  		return resolveCompLit(node, c)
  
  	case *ast.Ident:
  		return resolveIdent(node, c)
  
  	case *ast.AssignStmt:
  		return resolveAssign(node, c)
  
  	case *ast.CallExpr:
  		return resolveCallExpr(node, c)
  
  	case *ast.BinaryExpr:
  		return resolveBinExpr(node, c)
  	}
  
  	return false
  }
docs: // TryResolve will attempt, given a subtree starting at some ATS node, to resolve
  // all values contained within to a known constant. It is used to check for any
  // unknown values in compound expressions.