code: def _bare_name_matches(self, nodes):
          
          count = 0
          r = {}
          done = False
          max = len(nodes)
          while not done and count < max:
              done = True
              for leaf in self.content:
                  if leaf[0].match(nodes[count], r):
                      count += 1
                      done = False
                      break
          r[self.name] = nodes[:count]
          return count, r
docs: Special optimized matcher for bare_name.