IR tree representation of binary operation

Posted by drozzy on Stack Overflow See other posts from Stack Overflow or by drozzy
Published on 2010-03-30T21:44:25Z Indexed on 2010/03/30 22:13 UTC
Read the original article Hit count: 447

Filed under:

compiler-theory

|

compiler

I have a simple operation like so:

k + 1

What would be a IR tree representation of it?
So far I came up with:

BINOP(+, MEM(NAME(k)), CONST(1))

but I am not sure if I need the MEM for NAME or not. Any help welcome.

© Stack Overflow or respective owner

Related posts about compiler-theory

Removing Left Recursion in ANTLR

as seen on Stack Overflow - Search for 'Stack Overflow'
As is explained in http://stackoverflow.com/questions/2652060/removing-left-recursion , there are two ways to remove the left recursion. Modify the original grammar to remove the left recursion using some procedure Write the grammar originally not to have the left recursion What people normally… >>> More
Determining the maximum stack depth

as seen on Stack Overflow - Search for 'Stack Overflow'
Imagine I have a stack-based toy language that comes with the operations Push, Pop, Jump and If. I have a program and its input is the toy language. For instance I get the sequence Push 1 Push 1 Pop Pop In that case the maximum stack would be 2. A more complicated example would use branches. Push… >>> More
Advantages of compilers for functional languages over compilers for imperative languages

as seen on Stack Overflow - Search for 'Stack Overflow'
As a follow up to this question What are the advantages of built-in immutability of F# over C#?--am I correct in assuming that the F# compiler can make certain optimizations knowing that it's dealing with largely immutable code? I mean even if a developer writes "Functional C#" the compiler wouldn't… >>> More
What are modern and old compilers written in?

as seen on Stack Overflow - Search for 'Stack Overflow'
As a compiler, other than an interpreter, only needs to translate the input and not run it the performance of itself should be not that problematic as with an interpreter. Therefore, you wouldn't write an interpreter in, let's say Ruby or PHP because it would be far too slow. However, what about… >>> More
Translate a<b to IR Trees

as seen on Stack Overflow - Search for 'Stack Overflow'
I have to translate the mini-java (java like language) statements into intermediate-representation trees. But for this question I have no idea what it is asking... a>b moves a 1 or 0 into some newly defined temporary, and whose right-hand side is a temporary Does the wording make sense to anyone… >>> More

Related posts about compiler

IDEA modular problem (jsp)

as seen on Stack Overflow - Search for 'Stack Overflow'
I have project in with 2 separate modules(frontend and backend, first depends on second). When I'm trying to access backend code from frontend code, things going fine. Things turn for the worse when I do the same from jsp. This is stacktrase for simple accessign bean <jsp:useBean id="mybean"… >>> More
Help with a compiler warning: Initialization from distinct Objective-C type when types match

as seen on Stack Overflow - Search for 'Stack Overflow'
Here is the function where I get the compiler warning, I can't seem to figure out what is causing it. Any help is appreciated. -(void)displaySelector{ //warning on the following line: InstanceSelectorViewController *controller = [[InstanceSelectorViewController alloc] initWithCreator:self]; … >>> More
Sometimes Java web app hang

as seen on Stack Overflow - Search for 'Stack Overflow'
The web app occasionally get hang for about 30 seconds when user request a web page, the server's CPU and memory usage are ok, and the jstack shows: "http-9999-3" daemon prio=6 tid=0x552f3400 nid=0xf40 runnable [0x578fc000] java.lang.Thread.State: RUNNABLE at org.eclipse.jdt.internal.compiler… >>> More
Need help regarding one LALR(1) parsing.

as seen on Stack Overflow - Search for 'Stack Overflow'
I am trying to parse a context-free language, called Context Free Art. I have created its parser in Javascript using a YACC-like JS LALR(1) parser generator JSCC. Take the example of following CFA (Context Free Art) code. This code is a valid CFA. startshape A rule A { CIRCLE { s 1} } Notice the… >>> More
Port Compiler Options (8 replies)

as seen on .NET 247 - Search for '.NET 247'
I currently own a license for Crossworks for ARM and would like to compile the port using it. With the code for the CLR now available, is it possible to compile the port with any ARM compiler or are we still restricted to the Keil ARM gcc compilers? >>> More