||This article has an unclear citation style. (April 2012)|
In computing, tombstone diagrams (or T-diagrams) consist of a set of “puzzle pieces” representing compilers and other related language processing programs. They are used to illustrate and reason about transformations from a source language (left of T) to a target language (right of T) realised in an implementation language (bottom of T). They are most commonly found[where?] describing complicated processes for bootstrapping, porting, and self-compiling of compilers, interpreters, and macro-processors.
T-diagrams were first introduced for describing bootstrapping and cross-compiling compilers by McKeeman et al. in 1971. Melvin Conway described the broader concept before that with his UNCOL in 1958, to which Bratman added in 1961. Later on, others, including P.D. Terry, gave an explanation and usage of T-diagrams in their textbooks on the topic of compiler construction. T-diagrams are also now used to describe client-server interconnectivity on the World Wide Web.
- Terry, 1997, Chapter 2 and Chapter 3
- McKeeman et al., A Compiler Generator (1971)
- H. Bratman, “An alternate form of the ´UNCOL diagram´“, Comm. ACM 4 (March 1961) 3, p. 142
- Patrick Closhen, et al. 1997: T-Diagrams as Visual Language to Illustrate WWW Technology, Darmstadt University of Technology, Darmstadt, Germany
|This computer science article is a stub. You can help Wikipedia by expanding it.|