Implementing tree structures via compile-time string interpolation

The tree is one of the most useful data structures in computer science, providing a hierarchical structure to data that is easy to search through and manipulate. Construction and deconstruction of tree structures, however, often require a significant amount of code to be written, using language that is often unintuitive. In large scale projects, this can translate into a laborious task, where trees must be defined, created and manipulated by hand. As a tree's complexity increases, it becomes increasingly difficult to read and understand the code within a project. In this regard, it will be examined if a well defined syntax definition will allow tree structures to be expressed in a more intuitive language, that can be easily written in place of regular code.