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,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,900edaa189af2033 X-Google-Attributes: gid103376,public From: jvl@ocsystems.com (Joel VanLaven) Subject: Re: Ada95 OOP Questions Date: 1996/08/12 Message-ID: <1996Aug12.160343.26139@ocsystems.com>#1/1 X-Deja-AN: 173745383 references: <4u4ln3$fur@mailsrv2.erno.de> <3209E295.167EB0E7@escmail.orl.mmc.com> organization: OC Systems, Inc. newsgroups: comp.lang.ada Date: 1996-08-12T00:00:00+00:00 List-Id: Theodore E. Dennison (dennison@escmail.orl.mmc.com) wrote: : Robert Dewar wrote: : > : > So grep will not be enough, even if you ban USE. Really you need decent : > tools to build Ada programs, and relying on grep for locating defining : > occurrences of subprogram references is pretty miserable (note for : > example that it fails in any case in the overloaded case). It is hard : > for me to believe that there are Ada environments with no better : > capabilities than grep for finding things. : The only environment I have ever used that had anything better than grep : was DEC's LSE/SCA combination. (I THINK it was "SCA", its been a while). : SCA was painfully slow, even on multiprocessing VAXen. I tried it for two : weeks before giving up on it.(Which made me hardier than anyone else on the : project by about a week and a half). Apparently its no easy task to chase : down references, even for a multiprocessing computer and Ada 83. The : experience gave me a whole new respect for our "no use" coding policy. : > With GNAT, you have two possibilities. For static analysis, you can use : > gnatf, and then if you like, use the emacs interface to get straight from : > applied to defining occurrences. (note that soon we will integrate gnatf : > with gnat1 making this possibility a bit more convenient). : That sounds cool. It makes sense that the compiler (or something built off : of it) could do the most efficient and accurate job of chasing down : references. But how useful is this? Is it fast enough to be more of a : help than a hinderance? Does ANYONE do this? I take it you don't, since : you don't use emacs. I have to agree that the compiler should come with tools able to do your searching for you. For our compiler we put this into the soure code "browser." The browser has access to most of the information that the compiler produces (it keeps it in a library) so it is quite fast. I find it very useful, especially when dealing with someone else's code! Without such tools at my disposal I think I might never work on large projects at all... :) -- Joel -- -- Joel VanLaven