Re: IR Representation

=?UTF-8?B?Q8Opc2Fy?= <divcesar@gmail.com>
Fri, 11 Sep 2015 17:01:52 -0300

          From comp.compilers
Related articles
IR Representation divcesar@gmail.com (=?UTF-8?B?Q8Opc2Fy?=) (2015-09-04)
Re: IR Representation anton@mips.complang.tuwien.ac.at (2015-09-05)
Re: IR Representation divcesar@gmail.com (=?UTF-8?B?Q8Opc2Fy?=) (2015-09-07)
Re: IR Representation anton@mips.complang.tuwien.ac.at (2015-09-08)
Re: IR Representation gneuner2@comcast.net (George Neuner) (2015-09-08)
Re: IR Representation divcesar@gmail.com (=?UTF-8?B?Q8Opc2Fy?=) (2015-09-11)
Re: IR Representation DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2015-09-12)
| List of all articles for this month |
From: =?UTF-8?B?Q8Opc2Fy?= <divcesar@gmail.com>
Newsgroups: comp.compilers
Date: Fri, 11 Sep 2015 17:01:52 -0300
Organization: Compilers Central
References: 15-09-005 15-09-006 15-09-010 15-09-011
Keywords: optimize, design
Posted-Date: 12 Sep 2015 12:27:05 EDT

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. ...

Post a followup to this message

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