Utility Libraries for Traversing and Manipulating Tree-like Data Structures with Varying Schemas
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-scal...
Main Author: | Janicki, Adam |
---|---|
Other Authors: | Karger, David R. |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2024
|
Online Access: | https://hdl.handle.net/1721.1/156802 |
Similar Items
-
Traversable Schwarzschild-like wormholes
by: Mauricio Cataldo, et al.
Published: (2017-11-01) -
pinktoe: Semi-automatic Traversal of Trees
by: Guy Nason
Published: (2005-01-01) -
Performance Analysis Of Star Schema Data Modeling On Library Data
by: Dini Nurmalasari, et al.
Published: (2020-11-01) -
Parallelizing Tree Traversals for Binomial Option Pricing
by: Brunelle, Terryn
Published: (2022) -
Complete Traversals and their Implementation Using the Standard Template Library
by: Eric Gamess, et al.
Published: (1998-12-01)