Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Re: Attribute Grammars used in compi compilers@ima.UUCP (1986-01-07) |
| Re: Attribute Grammars used in compi compilers@ima.UUCP (1986-01-09) |
| Re: Attribute Grammars used in compi compilers@ima.UUCP (1986-01-15) |
| Relay-Version: | version B 2.10.2 9/12/84; site mit-hermes.ARPA |
| Posting-Version: | Notesfiles $Revision: 1.6.2.16 $; site ima.UUCP |
| From: | compilers@ima.UUCP |
| Newsgroups: | mod.compilers |
| Date: | 9 Jan 86 01:33:00 GMT |
| Article-I.D.: | ima.136300036 |
| Posted: | Wed Jan 8 20:33:00 1986 |
| Date-Received: | 10 Jan 86 11:22:29 GMT |
| Nf-ID: | #N:ima:136300036:000:894 |
| Nf-From: | ima!compilers Jan 8 20:33:00 1986 |
[from harvard!enmasse!dave]
Organization: EnMasse Computer Corp., Acton, MA
I understand that Microsoft's latest compilers are based on an
attribute grammar system. That's their "C-Merge" system; frontends
are attribute grammar based parsers (e.g., for C, Fortran, Pascal)
generating code for a very low level psuedo-machine, which is then
mapped to the instruction set for a specific machine (e.g., 8088/8086,
80286, 68000). Sounded a lot like Tanenbaum's system, except commercial
and the psuedo-machine was less block-structured.
At least, this was the story a while ago; it's certainly changed
to get the products out commercially. Do notice, however, that at
least one of their current compilers is quite good (for IBM PCs and
clones such as the AT). They have some good folk working on their
compilers.
David Brownell
EnMasse Computer Corp
...!{harvard,talcott,genrad}!enmasse!dave
Return to the
comp.compilers page.
Search the
comp.compilers archives again.