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,9f7c0fce90769654
X-Google-Attributes: gid103376,public
From: jdveale@world.std.com (James D. Veale)
Subject: Re: Ada Code Formatting
Date: 1996/08/13
Message-ID: <Dw3A46.EHL@world.std.com>#1/1
X-Deja-AN: 173955830
references: <4ug0pq$q64@zeus.orl.mmc.com> <4ui14m$m0l@mulga.cs.mu.OZ.AU>
 <dewar.839723478@schonberg> <Dw1y15.L2u@thomsoft.com>
organization: The World Public Access UNIX, Brookline, MA
newsgroups: comp.lang.ada
Date: 1996-08-13T00:00:00+00:00
List-Id: <comp.lang.ada>


kst@thomsoft.com (Keith Thompson) writes:
>A simpler, and nearly as useful, utility would translate its Ada input
>into individual tokens and print them one per line.  So, for example,
>this input:

>    with Text_IO;
>    procedure Hello is -- a comment
>    begin
>	Text_IO.Put_Line("Hello");
>    end Hello;

>would yield this output:

>    with
>    text_io
>    ;
>    procedure
>    hello
>    is
>    begin
>    text_io
>    .
>    put_line
>    (
>    "Hello"
>    )
>    ;
>    end
>    hello
>    ;

>You could then run two versions of an Ada source through this relatively
>simple filter and compare the outputs.  If they compare equal, there is
>no semantically significant difference between the original sources.
>If they don't, finding where in the original sources the differences
>occur is left as an exercise.

That's essentially what Complite does,  and what I mean by a word-by-word
comparison where words are separated by common programming language 
delimiters as well as blanks.  The results of the comparison are then
re-integrated into their original line-oriented form with changed words 
highlighted,  correlated scrolling between the two files etc. 

    Jim Veale