Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!usc!snorkelwacker!spdcc!ima!esegue!compilers-sender
From: moss@cs.umass.edu
Newsgroups: comp.compilers
Subject: Re: Recognizing complicated patterns
Keywords: code, optimize
Message-ID: <1990Aug06.184834.1627@esegue.segue.boston.ma.us>
Date: 6 Aug 90 18:48:34 GMT
References: <1990Aug01.130605.10204@esegue.segue.boston.ma.us>
Sender: compilers-sender@esegue.segue.boston.ma.us
Reply-To: moss@cs.umass.edu
Organization: Dept of Comp and Info Sci, Univ of Mass (Amherst)
Lines: 19
Approved: compilers@esegue.segue.boston.ma.us
In-Reply-To: johnson@cs.uiuc.edu's message of 1 Aug 90 13:06:05 GMT

I'm jumping into this thread without having seen what went before, and I'm
also at home so I can't use my bookshelf to double check my memory, but I seem
to recall that someone did a PhD thesis in the last ten years that indeed
could match patterns for rather complex instructions, though I am not sure
about loops (I do think it tried for block moves and such, so maybe loops are
included?). My recollection comes up with Rick Cattell's thesis, but I could
be wrong about that. Further comments? (And maybe I'll try to find his thesis
among my books when I'm next in my office ....)			Eliot
--

		J. Eliot B. Moss, Assistant Professor
		Department of Computer and Information Science
		Lederle Graduate Research Center
		University of Massachusetts
		Amherst, MA  01003
		(413) 545-4206; Moss@cs.umass.edu
-- 
Send compilers articles to compilers@esegue.segue.boston.ma.us
{spdcc | ima | lotus| world}!esegue.  Meta-mail to compilers-request@esegue.