chromatic writes:
> That's part of it
With his permission, I've put the relevant section of Stefan Kral's
master's thesis online at:
http://stud4.tuwien.ac.at/~e0225855/kral_optimizer.pdf
The chapter describes the implementation of a rule-based peep-hole
optimizer using Prolog DCGs. The rules
You've exactly got what's on my mind. But no one could know that, since
I haven't written it down yet. :)
We got several volunteers, so I'm going to spend some time talking with
them.
Allison
Adriano Ferreira wrote:
Among the features that cannot be missed in a transformation language
(and
On Wednesday 04 October 2006 07:13, Aaron Sherman wrote:
> chromatic wrote:
> > That's part of it, but mostly it's for transforming one tree-based
> > representation of a program into another. See for example Pheme's
> > lib/*.tg files.
> I'm confused. I thought that this is what TGE did. Is TG
chromatic wrote:
On Thursday 28 September 2006 14:51, Markus Triska wrote:
Allison Randal writes:
mini transformation language to use in the compiler tools.
For what purpose, roughly? I've some experience with rule-based
peep-hole optimisations. If it's in that area, I volunteer.
That's par
Among the features that cannot be missed in a transformation language
(and sorry if that's too obvious) I mention:
* a data structure pattern language
(something between patterns used in Prolog and some functional languages
and XPath)
* and rules that are selected via these patterns (with a c
On Thursday 28 September 2006 14:51, Markus Triska wrote:
> Allison Randal writes:
> > mini transformation language to use in the compiler tools.
>
> For what purpose, roughly? I've some experience with rule-based
> peep-hole optimisations. If it's in that area, I volunteer.
That's part of it, bu
Allison Randal writes:
> mini transformation language to use in the compiler tools.
For what purpose, roughly? I've some experience with rule-based
peep-hole optimisations. If it's in that area, I volunteer.
Best wishes,
Markus Triska
