This is the mail archive of the gcc@gcc.gnu.org mailing list for the GCC project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: Question on tree-walking and mutually-recursive types

From: "Joseph S. Myers" <jsm at polyomino dot org dot uk>
To: Michael Matz <matz at suse dot de>
Cc: Zack Weinberg <zack at codesourcery dot com>, Richard Kenner <kenner at vlsi1 dot ultra dot nyu dot edu>, gcc at gcc dot gnu dot org
Date: Tue, 29 Jun 2004 09:22:26 +0000 (UTC)
Subject: Re: Question on tree-walking and mutually-recursive types
References: <10406290338.AA05436@vlsi1.ultra.nyu.edu> <87vfhbyqha.fsf@taltos.codesourcery.com><Pine.LNX.4.58.0406291104330.14966@wotan.suse.de>

On Tue, 29 Jun 2004, Michael Matz wrote:

> ???  This tests if list_{2j+1} or list_{2j+2} equals list_j.  Hence it 
> doesn't detect cycles.  Cf list == {1,2,3,1}

Take j=n-1 for for a cycle of period n.

-- 
Joseph S. Myers               http://www.srcf.ucam.org/~jsm28/gcc/
    jsm@polyomino.org.uk (personal mail)
    jsm28@gcc.gnu.org (Bugzilla assignments and CCs)

Follow-Ups:
- Re: Question on tree-walking and mutually-recursive types
  - From: Michael Matz

References:
- Re: Question on tree-walking and mutually-recursive types
  - From: Richard Kenner
- Re: Question on tree-walking and mutually-recursive types
  - From: Zack Weinberg
- Re: Question on tree-walking and mutually-recursive types
  - From: Michael Matz

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]