<SYSTEM_TASK:>
Solve the following problem using Python, implementing the functions described below, one line at a time
<END_TASK>
<USER_TASK:>
Description:
 def glob(self, node, path):
 """ Return instances at `path` supporting wildcards. Behaves identical to :any:`get`, but accepts wildcards and returns a list of found nodes. * `*` matches any characters, except '/'. * `?` matches a single character, except '/'. An example module tree: A resolver using the `name` attribute: Relative paths: [Node('/top/sub0/sub0'), Node('/top/sub0/sub1')] [Node('/top/sub0'), Node('/top/sub1')] [Node('/top/sub0/sub0'), Node('/top/sub0/sub1'), Node('/top/sub1/sub0')] [Node('/top/sub0/sub0'), Node('/top/sub1/sub0')] Traceback (most recent call last):
 anytree.resolver.ChildResolverError: Node('/top/sub1') has no child sub1. Children are: 'sub0'. Non-matching wildcards are no error: [] Traceback (most recent call last):
 anytree.resolver.ChildResolverError: Node('/top') has no child sub2. Children are: 'sub0', 'sub1'. Absolute paths: [Node('/top/sub0'), Node('/top/sub1')] Traceback (most recent call last):
 anytree.resolver.ResolverError: root node missing. root is '/top'. Traceback (most recent call last):
 anytree.resolver.ResolverError: unknown root node '/bar'. root is '/top'. """

        node, parts = self.__start(node, path)
        return self.__glob(node, parts)