Re: papers on symbolic dependency analysis

smryan@netcom.com (Steven Ryan)
Tue, 2 Aug 1994 05:29:22 GMT

          From comp.compilers
Related articles
papers on symbolic dependency analysis gxj@dcs.ed.ac.uk (Graham Jones) (1994-07-29)
Re: papers on symbolic dependency analysis laurent.Challier@inria.fr (1994-08-01)
Re: papers on symbolic dependency analysis smryan@netcom.com (1994-08-02)
| List of all articles for this month |
Newsgroups: comp.compilers
From: smryan@netcom.com (Steven Ryan)
Keywords: tools
Organization: NETCOM On-line Communication Services (408 261-4700 guest)
References: 94-07-096
Date: Tue, 2 Aug 1994 05:29:22 GMT
Status: RO

: substitution. Does anyone know of the number of cases that still remain
: unanalysable after these optimisations have taken place ? Given that some


Most subscripts are affine and are easily analyzed symbolically. After that
you tend to run into subscripted subscripts which are not generally
analyzable.
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.