Tombstone diagram: Difference between revisions
Content deleted Content added
Peter Flass (talk | contribs) wl: mckeeman (red link) |
Fixed link to reference. |
||
| Line 5: | Line 5: | ||
[[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.]] |
[[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|date=July 2011}} describing complicated processes for [[Bootstrapping (compilers)|bootstrapping]], [[porting]], and [[Self-hosting|self-compiling]] of compilers, interpreters, and [[General purpose macro processor|macro-processors]].<ref name="Terry">Terry, 1997, [http://scifac.ru.ac.za/compilers/ |
'''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]], [[porting]], and [[Self-hosting|self-compiling]] of compilers, interpreters, and [[General purpose macro processor|macro-processors]].<ref name="Terry">Terry, 1997, [http://scifac.ru.ac.za/compilers/cha02g.htm Chapter 2] and [http://scifac.ru.ac.za/compilers/cha03g.htm Chapter 3]</ref> |
||
T diagrams were first introduced for describing bootstrapping and cross-compiling compilers by [[McKeeman]] et al. in 1971.<ref name="McKeeman">McKeeman et al., ''A Compiler Generator'' (1971)</ref> Conway described the broader concept before that with his [[UNCOL]] in 1958, to which Bratman added in 1961.<ref name="Bratman">H. Bratman, “An alternate form of the ´UNCOL diagram´“, Comm. ACM 4 (March 1961) 3, p. 142</ref> Later on, others, including P.D. Terry, gave an explanation and usage of T-diagrams in their textbooks on the topic of compiler construction.<ref name="Terry"/> T-diagrams are also now used to describe client-server interconnectivity on the World Wide Web.<ref name="Closhen">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> |
T diagrams were first introduced for describing bootstrapping and cross-compiling compilers by [[McKeeman]] et al. in 1971.<ref name="McKeeman">McKeeman et al., ''A Compiler Generator'' (1971)</ref> Conway described the broader concept before that with his [[UNCOL]] in 1958, to which Bratman added in 1961.<ref name="Bratman">H. Bratman, “An alternate form of the ´UNCOL diagram´“, Comm. ACM 4 (March 1961) 3, p. 142</ref> Later on, others, including P.D. Terry, gave an explanation and usage of T-diagrams in their textbooks on the topic of compiler construction.<ref name="Terry"/> T-diagrams are also now used to describe client-server interconnectivity on the World Wide Web.<ref name="Closhen">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> |
||
Revision as of 19:03, 22 May 2012
 | This article has an unclear citation style. (April 2012) |
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, porting, and self-compiling of compilers, interpreters, and macro-processors.[1]
T diagrams were first introduced for describing bootstrapping and cross-compiling compilers by McKeeman et al. in 1971.[2] Conway described the broader concept before that with his UNCOL in 1958, to which Bratman added in 1961.[3] Later on, others, including P.D. Terry, gave an explanation and usage of T-diagrams in their textbooks on the topic of compiler construction.[1] T-diagrams are also now used to describe client-server interconnectivity on the World Wide Web.[4]
See also
References
- ^ a b 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. |