| dc.contributor.advisor | Karger, David R. | |
| dc.contributor.author | Janicki, Adam | |
| dc.date.accessioned | 2024-09-16T13:50:09Z | |
| dc.date.available | 2024-09-16T13:50:09Z | |
| dc.date.issued | 2024-05 | |
| dc.date.submitted | 2024-07-11T14:37:24.760Z | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/156802 | |
| dc.description.abstract | Tree-like data structures are very commonly used data types found in the wild in a wide array of projects JavaScript projects. A specific example of one of these structures is an abstract syntax tree (AST). However, the lack of good libraries to handle trees has led to many developers and large-scale code bases having to implement their utility functions over and over again. To address these concerns within the JavaScript developer community, we propose Treecle and Vastly: two free open-source libraries that provide utility functions and operations to help developers work with trees and ASTs respectively. | |
| dc.publisher | Massachusetts Institute of Technology | |
| dc.rights | In Copyright - Educational Use Permitted | |
| dc.rights | Copyright retained by author(s) | |
| dc.rights.uri | https://rightsstatements.org/page/InC-EDU/1.0/ | |
| dc.title | Utility Libraries for Traversing and Manipulating Tree-like Data Structures with Varying Schemas | |
| dc.type | Thesis | |
| dc.description.degree | M.Eng. | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| mit.thesis.degree | Master | |
| thesis.degree.name | Master of Engineering in Electrical Engineering and Computer Science | |
