code: def _handle_ast_list(self, ast_list):
          
          for index, node in enumerate(ast_list):
              if isinstance(node, (ast.Break, ast.Continue, ast.Raise,
                                   ast.Return)):
                  try:
                      first_unreachable_node = ast_list[index + 1]
                  except IndexError:
                      continue
                  class_name = node.__class__.__name__.lower()
                  self._define(
                      self.unreachable_code,
                      class_name,
                      first_unreachable_node,
                      last_node=ast_list[-1],
                      message="unreachable code after '{class_name}'".format(
                          **locals()),
                      confidence=100)
                  return
docs: Find unreachable nodes in the given sequence of ast nodes.