Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!linus!security!genrad!decvax!harpo!floyd!clyde!ihnp4!inuxc!pur-ee!uiucdcs!uiuccsb!grunwald
From: grunwald@uiuccsb.UUCP
Newsgroups: net.lang.c
Subject: Re: Re: Structure Comparison (ADA vs C) - (nf)
Message-ID: <3564@uiucdcs.UUCP>
Date: Mon, 31-Oct-83 22:37:00 EST
Article-I.D.: uiucdcs.3564
Posted: Mon Oct 31 22:37:00 1983
Date-Received: Thu, 3-Nov-83 22:34:47 EST
Lines: 18

#R:taurus:-8000:uiuccsb:9000007:000:984
uiuccsb!grunwald    Oct 30 14:57:00 1983

bjb: Most of the nice features of Ada having little to do with code generation
at all -- most of them are features which allow you to obtain more information
about a type than in C. Additionally, the concept of allowing you to specify a
``generic type'' is very powerful and actually allows you to save code.
   For instance, in Pascal, if one has two types A and B, and wants to make
stacks of 100 elements each using these types, you need to write separate
routines for "pushA", "pushB", etc.
   In Ada, it should be possible to write a compiler which does not expressly
need to provide separate routines for each type. The code within a generic
type may be able to be made to share routines which do not reference any
specific feature of the type (e.g. size, etc).

The data type definitions of Ada are, while not exactly clean, very well done
and they would allow you to avoid most of the explicit kludges that one does
in Pascal and most of the implicit kludges that go on in C.