Creating a tree/deeply nested dict from an indented text file in python

by

Here is an object oriented approach based on a composite structure of nested Node objects.

Input:

indented_text = \
"""
apple
    colours
        red
        yellow
        green
    type
        granny smith
    price
        0.10
"""

a Node class

class Node:
    def __init__(self, indented_line):
        self.children = []
        self.level = len(indented_line) - len(indented_line.lstrip())
        self.text = indented_line.strip()

    def add_children(self, nodes):
        childlevel = nodes[0].level
        while nodes:
            node = nodes.pop(0)
            if node.level == childlevel: # add node as a child
                self.children.append(node)
            elif node.level > childlevel: # add nodes as grandchildren of the last child
                nodes.insert(0,node)
                self.children[-1].add_children(nodes)
            elif node.level <= self.level: # this node is a sibling, no more children
                nodes.insert(0,node)
                return

    def as_dict(self):
        if len(self.children) > 1:
            return {self.text: [node.as_dict() for node in self.children]}
        elif len(self.children) == 1:
            return {self.text: self.children[0].as_dict()}
        else:
            return self.text

To parse the text, first create a root node.
Then, remove empty lines from the text, and create a Node instance for every line, pass this to the add_children method of the root node.

root = Node('root')
root.add_children([Node(line) for line in indented_text.splitlines() if line.strip()])
d = root.as_dict()['root']
print(d)

result:

{'apple': [
  {'colours': ['red', 'yellow', 'green']},
  {'type': 'granny smith'},
  {'price': '0.10'}]
}

I think that it should be possible to do it in one step, where you simply call the constructor of Node once, with the indented text as an argument.

More Related Contents:

  1. Create a list of names whose height is higher than 160 – Explanation on nested dicts cycling [closed]
  2. How do I sort a list of dictionaries by a value of the dictionary?
  3. What is the best way to implement nested dictionaries?
  4. How are Python’s Built In Dictionaries Implemented?
  5. How to use a dot “.” to access members of dictionary?
  6. What would a “frozen dict” be?
  7. In Python, when to use a Dictionary, List or Set?
  8. How do you create nested dict in Python?
  9. merging Python dictionaries
  10. Multiple levels of ‘collection.defaultdict’ in Python
  11. Search for a key in a nested Python dictionary
  12. How to use dot notation for dict in python?
  13. What is the purpose of collections.ChainMap?
  14. Get all keys of a nested dictionary [duplicate]
  15. How to create a dictionary from a line of text?
  16. Key-ordered dict in Python
  17. Object-like attribute access for nested dictionary
  18. Using a Python Dictionary as a Key (Non-nested)
  19. Change values in dict of nested dicts using items in a list?
  20. scipy.io.loadmat nested structures (i.e. dictionaries)
  21. How to parse a string and return a nested array?
  22. Is there a recursive version of the dict.get() built-in?
  23. Recursive diff of two dictionaries (keys and values)?
  24. Checking a nested dictionary using a dot notation string “a.b.c.d.e”, automatically create missing levels
  25. How to make a dictionary that returns key for keys missing from the dictionary instead of raising KeyError?
  26. Why does updating one dictionary object affect other?
  27. Accessing values nested within dictionaries
  28. How expensive are Python dictionaries to handle?
  29. Adding counters deletes keys
  30. How to sort a list of dictionaries by a value of the dictionary in Python?

Leave a Comment