seeking graph/path expressions algorithms

rod@minster.york.ac.uk
Thu, 25 Nov 1993 21:57:30 GMT

          From comp.compilers
Related articles
seeking graph/path expressions algorithms usha_solanki@pune.tcs.co.in (Usha) (2004-03-11)
seeking graph/path expressions algorithms rod@minster.york.ac.uk (1993-11-25)
| List of all articles for this month |
Newsgroups: comp.compilers,comp.theory,comp.software-eng
From: rod@minster.york.ac.uk
Keywords: theory, question
Organization: Department of Computer Science, University of York, England
Date: Thu, 25 Nov 1993 21:57:30 GMT

Hi there,
    I wonder if anyone out there could point me in the right
direction...I'm seeking an implementation of the single-source
path expression algorithms described by Tarjan (Journal of the
ACM 38(3) July 1981 - "Fast algorithms for solving path problems")


I need such an algorithm to generate relular expressions describing
all the possible flows in a reducible flow graph. Tarjan's paper
clearly states that a "simple" implementation is possible, but if
anyone out there knows of one that already exists, I'd be very
pleased to hear about it!


Thanks in advance,
    Rod Chapman
    email: rod@minster.york.ac.uk
--

Post a followup to this message

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