Re: elimination methods... (Chris Smith)
Fri, 30 Jun 1995 17:25:41 GMT

          From comp.compilers

Related articles
elimination methods... (V.C. SREEDHAR) (1995-05-28)
Re: elimination methods... (Michael Wolfe) (1995-06-23)
Re: elimination methods... (1995-06-30)
Re: elimination methods... (1995-07-05)
| List of all articles for this month |

Newsgroups: comp.compilers
From: (Chris Smith)
Keywords: theory, optimize
Organization: CONVEX News Network, Engineering (cnn.eng), Richardson, Tx USA
References: 95-06-035
Date: Fri, 30 Jun 1995 17:25:41 GMT

      From: Michael Wolfe <>
      Date: Fri, 23 Jun 1995 04:02:16 GMT

I ask the interval or
      syntax-based group what they do in case of irreducible graphs, and
      the answers are either fall back to iterative methods, or use node
      splitting, or give up.

      no science here.

Some science, perhaps. Elimination boils everything down to composition (ab),
alternation (a|b), and iteration (a*). There's a Tarjan paper that tells
how to parse an arbitrary directed graph and get an equivalent regexp.

Alas, I can't find the reference. It was someplace I don't read much,
perhaps JACM, something like 1980-85.


Post a followup to this message

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