From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,FREEMAIL_FROM, INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,34c128c452eed637 X-Google-Attributes: gid103376,public From: schizophonic@iol.it Subject: Re: How is an ADA compiler done? Date: 1996/10/29 Message-ID: <555e28$v6c@mikasa.iol.it>#1/1 X-Deja-AN: 192949509 references: <54u38v$g9o@mikasa.iol.it> organization: Italia Online newsgroups: comp.lang.ada Date: 1996-10-29T00:00:00+00:00 List-Id: dewar@merv.cs.nyu.edu (Robert Dewar) wrote: >Are atrtibute grammars used? Yes by one or two compilers, No by most. I don't >think it is a particularly helpful formalism. At least one commercial compiler, >the DDCI compiler does, as far as I know use this approach, but on the other >hand, it is much later than expected, so it is certainly not a demonstration >that this technique is specially effective (it is also not a demonstraion >to the contrary either, there are MANY things that can make compilers later >than hoped, as all of us in the business know well!) Sounds strange; in my teacher's opinion, nowadays about the 50% of commercial compilers are based on attribute grammars; in facts the formalism was developed from the state of the art in the compiler's algorithm (at least, the state of the art when Knuth started his work). Is Ada (now I wrote it exactly) an exception, or is my teacher wrong? z