2017/03/03 by Breck Yunits, Yunits, Breck · 1 voice
Computer Science · #FOS: Computer and information sciences #Parallel Computing and Optimization Techniques #Programming Languages (cs.PL) #Software Engineering Research #Software Testing and Debugging Techniques #cs.PL
paper · pdf · doi:10.48550/arxiv.1703.01192
openalex publication_date 2017/03/03 · arxiv published 2017/03/03 · arxiv created 2017/10/23 · arxiv updated 2017/10/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper presents Tree Notation, a new simple, universal syntax. Language designers can invent new programming languages, called Tree Languages, on top of Tree Notation. Tree Languages have a number of advantages over traditional programming languages. We include a Visual Abstract to succinctly display the problem and discovery. Then we describe the problem--the BNF to abstract syntax tree (AST) parse step--and introduce the novel solution we discovered: a new family of 2D programming languages that are written directly as geometric trees.