https://gcc.gnu.org/bugzilla/show_bug.cgi?id=66056
--- Comment #3 from Gerhard Steinmetz <gerhard.steinmetz.fort...@t-online.de> --- The following test file generates an endless compilation for every subroutine. It's worth looking deeper. $ cat type_with_lonely_numbers.f90 program p call s1 call s2 call s3 call s4 call s5 call s6 contains subroutine s1 type t integer :: n = 1 1 ! 1 ! end type type(t) :: a print *, a end subroutine s2 type t integer :: n = 1 ; 1 ; ; 1 ; end type type(t) :: a print *, a end subroutine s3 type t integer :: n = 1 1.2 ! 1.2 ! end type type(t) :: a print *, a end subroutine s4 type t integer :: n = 1 ; 1.2 ; ; 1.2 ; end type type(t) :: a print *, a end subroutine s5 type t integer :: n = 1 1=2 ! 1=2 ! end type type(t) :: a print *, a end subroutine s6 type t integer :: n = 1 1-2 ! 1-2 ! end type type(t) :: a print *, a end end