|[4 earlier articles]|
|Re: Back End Generators firstname.lastname@example.org (1994-10-16)|
|Re: Back End Generators email@example.com (1994-10-21)|
|Re: Back End Generators firstname.lastname@example.org (1994-10-21)|
|Re: Back End Generators email@example.com (1994-10-21)|
|Re: Back End Generators firstname.lastname@example.org (1994-10-21)|
|Re: Back End Generators Peter.Damron@Eng.Sun.COM (1994-10-18)|
|Re: Back End Generators email@example.com (1994-10-28)|
|Re: Back End Generators firstname.lastname@example.org (1994-10-24)|
|Re: Back End Generators davidm@Rational.COM (1994-10-25)|
|From:||email@example.com (Henry G. Baker)|
|Date:||Fri, 28 Oct 1994 06:44:04 GMT|
Peter.Damron@Eng.Sun.COM (Peter C. Damron) writes:
>Graham & Glanville did the first (tree) parser for code generation.
>They did not do dynamic programming for parse selection.
>The LR parsing technology they used could not accommodate this.
>The first tree pattern matching (really tree parsing) based code
>generators that used dynamic programming were done by Aho, Ganapathi, &
>Tjiang at Stanford/Bell Labs, by Henry & myself at Univ. of Washington,
>and by Hatcher & Christopher at ??? (see bibliography below). Also, Chase
>and Pelegri-Llopart were doing work in this area at about that time
Vaughan Pratt's 'Lingol' system for natural language used a
combination top-down, bottom-up strategy, and used inherently
ambiguous context free grammars and a sort of 'dynamic programming'
for English. I realize that it isn't 'code generation' for computer
instructions, although Vaughan did use this for parsing commands for a
Winograd-shrdlu-type robot, and this work was done in 1971-75. I will
be making a Common Lisp version of Lingol available on my ftp
directory in a few weeks (I worked on Lingol for a while as a graduate
Read ftp.netcom.com:/pub/hbaker/README for info on ftp-able papers.
Return to the
Search the comp.compilers archives again.