Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!rutgers!cmcl2!lanl!jlg
From: jlg@lanl.gov (Jim Giles)
Newsgroups: comp.lang.c
Subject: Re: Re^2: Oh noooooo!!
Message-ID: <14052@lanl.gov>
Date: 26 Sep 89 21:10:08 GMT
References: <1098@cernvax.UUCP>
Organization: Los Alamos National Laboratory
Lines: 29

From article <1098@cernvax.UUCP>, by hjm@cernvax.UUCP (Hubert Matthews):
> Programs that don't use GOTOs generate only reducible flow-graphs;
> programs that use GOTOs may generate irreducible flow-graphs.
> [...]        Thus, the optimiser can be simpler for languages such as
> C, PASCAL and Modula-2 compared to FORTRAN.  Take a look in the Dragon
  ^
> Book (Aho et al.) for more details.

The problem here is that C allows GOTOs in all the same contexts
that Fortran does.  More importantly, C allows GOTOs that even 
Fortran doesn't.  For example:

   C                                          Fortran

   if (a