Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| language independent intermediate representation amir@cs.washington.edu (1997-05-08) |
| Re: language independent intermediate representation chase@world.std.com (David Chase) (1997-05-12) |
| language independent intermediate representation Dave@occl-cam.demon.co.uk (Dave Lloyd) (1997-05-12) |
| Re: language independent intermediate representation mark@omnifest.uwm.edu (1997-05-13) |
| From: | mark@omnifest.uwm.edu (Mark Hopkins) |
| Newsgroups: | comp.compilers |
| Date: | 13 May 1997 22:45:12 -0400 |
| Organization: | Omnifest |
| References: | 97-05-126 |
| Keywords: | analysis |
Ideally, what you want to translate the code into is an "unrolled"
dataflow graph. Unrolled, here, means that all the loops and
procedure calls have been expanded out, leading to an infinite graph.
Optimizations can then be applied on the unrolled graph, even the
generation of target language. Then the graph has to be rolled back
up, and this is where the structures (if any) of the target language
-- the procedure calls, definitions, the loops and jumps -- are
generated. In assembly, you only have procedure calls & definitions,
and jumps. Loops might exist as part of the definition of a single
operator (a block move), but that's it.
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.