01whole.pdf (12.48 MB)
Download file

Implementing tree structures via compile-time string interpolation

Download (12.48 MB)
posted on 28.03.2022, 01:42 authored by Sean Gillies
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.


Table of Contents

1. Introduction -- 2. Background and related work -- 3. sbt-Rats! -- 4. Extending sbt-Rats! -- 5. Implementing interpolation -- 6. Discussion -- 7. Conclusions -- 8. Future work -- 9. Abbreviations -- Appendices -- Bibliography.


Bibliography: pages 67-68 Empirical thesis.

Awarding Institution

Macquarie University

Degree Type

Thesis bachelor honours


BSc (Hons), Macquarie University, Faculty of Science and Engineering, School of Engineering

Department, Centre or School

School of Engineering

Year of Award


Principal Supervisor

Anthony Sloane


Copyright Sean Gillies 2016. Copyright disclaimer: http://mq.edu.au/library/copyright




1 online resource (xv, 68 pages diagrams)

Former Identifiers

mq:70369 http://hdl.handle.net/1959.14/1263072

Usage metrics