Tombstone diagram: Difference between revisions

Content deleted Content added

Inline

Revision as of 00:32, 3 July 2011

Tombstone diagram representing an Ada compiler written in C that produces machine code.

Representation of the process of bootstrapping a C compiler written in C, by compiling it using another compiler written in machine code.

Tombstone diagrams (or T-diagrams) consist of a set of “puzzle pieces” representing languages of language processors and programs. They are used to illustrate and reason about transformations from a source language A to a target language B realised in an implementation language I. They are most commonly found^[where?] describing complicated processes for bootstrapping^[1], porting, and self-compiling of compilers, interpreters, and macro-processors.

References

^ T diagrams were first introduced for describing bootstrapping and cross-compiling compilers in McKeeman et al. A Compiler Generator (1971). Conway described the broader concept before that with his UNCOL in 1958, to which Bratman added in 1961: H. Bratman, “An alternate form of the ´UNCOL diagram´“, Comm. ACM 4 (March 1961) 3, p. 142. Later on, others, including P.D. Terry, gave an explanation and usage of T-diagrams in their textbooks on the topic of compiler construction. Cf. Terry, 1997, Chapter 3. T-diagrams are also now used to describe client-server interconnectivity on the World Wide Web: cf. 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.

[1] T diagrams were first introduced for describing bootstrapping and cross-compiling compilers in McKeeman et al. A Compiler Generator (1971). Conway described the broader concept before that with his UNCOL in 1958, to which Bratman added in 1961: H. Bratman, “An alternate form of the ´UNCOL diagram´“, Comm. ACM 4 (March 1961) 3, p. 142. Later on, others, including P.D. Terry, gave an explanation and usage of T-diagrams in their textbooks on the topic of compiler construction. Cf. Terry, 1997, Chapter 3. T-diagrams are also now used to describe client-server interconnectivity on the World Wide Web: cf. Patrick Closhen, et al. 1997: T-Diagrams as Visual Language to Illustrate WWW Technology, Darmstadt University of Technology, Darmstadt, Germany

[1]

@@ Line 3: / Line 3: @@
 [[File:Bootstrapping-t-diagram.png|thumb|Representation of the process of [[bootstrapping (compilers)|bootstrapping]] a C compiler written in C, by compiling it using another compiler written in machine code.]]
-'''Tombstone diagrams''' (or T-diagrams) consist of a set of “puzzle pieces” representing languages of language processors and programs. They are used to illustrate and reason about  transformations from a source language ''A'' to a target language ''B'' realised in an implementation language ''I''. They are most commonly found{{where}} describing complicated processes for [[Bootstrapping (compilers)|bootstrapping]]<ref>
+'''Tombstone diagrams''' (or T-diagrams) consist of a set of “puzzle pieces” representing languages of language processors and programs. They are used to illustrate and reason about  transformations from a source language ''A'' to a target language ''B'' realised in an implementation language ''I''. They are most commonly found{{Where|date=July 2011}} describing complicated processes for [[Bootstrapping (compilers)|bootstrapping]]<ref>
 T diagrams were first introduced for describing bootstrapping and cross-compiling compilers in McKeeman et al. ''A Compiler Generator'' (1971). Conway described the broader concept before that with his [[UNCOL]] in 1958, to which Bratman added in 1961: H. Bratman, “An alternate form of the ´UNCOL diagram´“, Comm. ACM 4 (March 1961) 3, p. 142. Later on, others, including P.D. Terry, gave an explanation and usage of T-diagrams in their textbooks on the topic of compiler construction. Cf. Terry, 1997, [http://scifac.ru.ac.za/compilers/cha03g.htm Chapter 3]. T-diagrams are also now used to describe client-server interconnectivity on the World Wide Web: cf. Patrick Closhen, et al. 1997: [http://www.pu.informatik.tu-darmstadt.de/docs/HJH-19990217-etal-T-diagrams.doc ''T-Diagrams as Visual Language to Illustrate WWW Technology''], Darmstadt University of Technology, Darmstadt, Germany
 </ref>, [[porting]], and [[Self-hosting|self-compiling]] of compilers, interpreters, and [[General purpose macro processor|macro-processors]].

Revision as of 00:32, 3 July 2011

See also

References