Syntactic extension for languages with implicitly delimited and infix syntax

Update item information
Publication Type dissertation
School or College School of Computing
Department Computing (School of)
Author Rafkind, Jon
Title Syntactic extension for languages with implicitly delimited and infix syntax
Date 2013-05
Description I present the design of a parser that adds Scheme-style language extensibility to languages with implicitly delimited and infix syntax. A key element of my design is an enforestation parsing step, which converts a flat stream of tokens into an S-expression-like tree, in addition to the initial "read" phase of parsing and interleaved with the "macro-expand" phase. My parser uses standard lexical scoping rules to communicate syntactic extensions to the parser. In this way extensions naturally compose locally as well as through module boundaries. I argue that this style of communication is better suited towards a useful extension system than tools not directly integrated with the compiler. This dissertation explores the limits of this design in a new language called Honu. I use the extensiblity provided by Honu to develop useful language extensions such as LINQ and a parser generator. I also demonstrate the generality of the parsing techniques by applying them to Java and Python.
Type Text
Publisher University of Utah
Subject extensible; macros; programming languages
Dissertation Institution University of Utah
Dissertation Name Doctor of Philosophy
Language eng
Rights Management Copyright © Jon Rafkind 2013
Format Medium application/pdf
Format Extent 1,018,757 bytes
ARK ark:/87278/s6rr2d2j
Setname ir_etd
Date Created 2013-05-17
Date Modified 2017-12-21
ID 195874
Reference URL