Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #1608
| From | César <divcesar@gmail.com> |
|---|---|
| Newsgroups | comp.compilers |
| Subject | Re: IR Representation |
| Date | 2015-09-11 17:01 -0300 |
| Organization | Compilers Central |
| Message-ID | <15-09-013@comp.compilers> (permalink) |
| References | <15-09-005@comp.compilers> <15-09-006@comp.compilers> <15-09-010@comp.compilers> <15-09-011@comp.compilers> |
Thank you Anton [and John]. With the addition of an artificial node
everything made sense now.
Now I am wondering, how do you usually represent conditional nodes and
looping structures using trees?
Eg.:
c = a + b;
if c > 10 goto L1 else goto L2
L1: a = 10;
goto L3;
L2: a = 20;
L3:
CC)sar.
On Tue, Sep 8, 2015 at 4:49 AM, Anton Ertl
<anton@mips.complang.tuwien.ac.at> wrote:
>>This linear representation is really just an array of IR instructions,
>>something on these lines: vector<Instruction*>; As operands
>>instructions have pointers to entries in the symbol table.
>
> Sounds like quadruples. ...
Back to comp.compilers | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
IR Representation César <divcesar@gmail.com> - 2015-09-04 14:39 -0300
Re: IR Representation anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2015-09-05 16:51 +0000
Re: IR Representation César <divcesar@gmail.com> - 2015-09-07 23:05 -0300
Re: IR Representation anton@mips.complang.tuwien.ac.at (Anton Ertl) - 2015-09-08 07:49 +0000
Re: IR Representation César <divcesar@gmail.com> - 2015-09-11 17:01 -0300
Re: IR Representation Hans-Peter Diettrich <DrDiettrich1@netscape.net> - 2015-09-12 19:45 +0200
Re: IR Representation George Neuner <gneuner2@comcast.net> - 2015-09-08 18:45 -0400
csiph-web