|Lexical Analyzer for F77 firstname.lastname@example.org (1993-04-20)|
|Re: Lexical Analyzer for F77 email@example.com (1993-04-21)|
|From:||firstname.lastname@example.org (John W. Eaton)|
|Organization:||The University of Texas at Austin, Austin, Texas|
|Date:||Wed, 21 Apr 1993 00:25:39 GMT|
email@example.com (Andre Boivert) writes:
> I am looking for a lexical analyzer for Fortran 77 (!!!).
J. K. Slape and P. J. L. Wallis, A Modification of Sale's Algorithm
to Accomodate Fortran 77, The Computer Journal, Volume 34 Number 4,
describes a technique for classifying Fortran statements and includes code
(about 350 lines of of Fortran) to do it.
Unfortunately, it isn't complete -- it classifies statement functions as
assignments, and there are several restrictions, such as requiring that
simple goto's must have at least the first digit of the label on the
initial line, and that a logical if statement which has an executable
statement part that begins with the letters `then' must have at least one
more non-blank character on the initial line.
Depending on what you need to do, these restrictions may be acceptable,
and you might be able to use this technique to greatly simplify your
Another possibility might be to use the GNU Fortran front end. It's in
alpha test now and isn't generally available yet -- ask
firstname.lastname@example.org for more information.
John W. Eaton, email@example.com
Return to the
Search the comp.compilers archives again.