[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: AST transformations

To: sablecc-list <sablecc-list@sable.mcgill.ca>
Subject: Re: AST transformations
From: Hendrik Boom <hendrik@topoi.cam.org>
Date: Sat, 26 Feb 2000 07:15:23 -0500 (EST)
In-Reply-To: <38B5B74D.CA5C533E@j-meg.com> from "Etienne M. Gagnon" at "Feb 24,2000 05:57:17 pm"
Sender: owner-sablecc-list@sable.mcgill.ca

One of the messages on this topic mentioned the possibility
of enforcing termination in the rewriting rules.

The main work I know of about this is a I think Phd thesis by
Barry K. Rosen in the late 60's/early 70's.  He defines
"subtree replacement systems".  The ones that force termination bear
a strong resemblance to finite-state transducers.

Again, specific references will have to wait until I get a chance to
search my library.

-- hendrik.

References:
- Re: AST transformations
  - From: "Etienne M. Gagnon" <egagnon@j-meg.com>

Prev by Date: Re: AST transformations
Next by Date: Re: AST transformations
Prev by thread: Re: AST transformations
Next by thread: Re: AST transformations
Index(es):
- Date
- Thread