Flatten a dictionary tree into a list of paths

flattendict.py

def gen(d, pfx=()):
    return (
        x for k, v in d.iteritems()
        for x in (
            gen(v, pfx+(k,)) if isinstance(v, dict) else ((pfx+(k,), v),)
        )
    )

def flattendict(tree):
    paths = []
    for k, v in dict(gen(tree)).iteritems():
        if not isinstance(v, list):
            paths.append(('/'.join(k), v))
    paths.sort()
    return paths


def test():
    test = {
        'mayo': 'chicken',
        'tomato': {
            'bacon' : 'cheese',
            'garlic' : 'basil',
        },
    }

    for r in flattendict(test):
        print '/%s = %s' % r