Download to read offline
- 1 / 15
- 2 / 15
- 3 / 15Most read
- 4 / 15
- 5 / 15Most read
- 6 / 15
- 7 / 15
- 8 / 15
- 9 / 15
- 10 / 15
- 11 / 15
- 12 / 15
- 13 / 15
- 14 / 15
- 15 / 15








![Copy:
– Simple: x := y
– Indexed: x := y[i] or x[i] := y
– Address and pointer manipulation:
• x := &y](/proxy?url=https%3A%2F%2Fimage.slidesharecdn.com%2Fcdc-190905122701%2F85%2FCOMPILER-DESIGN-AND-CONSTRUCTION-9-320.jpg)
![Jump:
– Unconditional: goto L
– Conditional: if x relop y goto L1
[else goto L2
], where relop is
<,=, >, , or ≠. ≧ ≦](/proxy?url=https%3A%2F%2Fimage.slidesharecdn.com%2Fcdc-190905122701%2F85%2FCOMPILER-DESIGN-AND-CONSTRUCTION-10-320.jpg)





The document discusses intermediate code generation in compiler design. It introduces intermediate code, features like retargeting and optimization. It describes three address code statements like a = b op c and quadruples which consist of four fields - op, arg1, arg2, and result to represent instructions. The conclusion states that intermediate code acts as an interface between the front-end and back-end of a compiler.








![Copy:
– Simple: x := y
– Indexed: x := y[i] or x[i] := y
– Address and pointer manipulation:
• x := &y](/proxy?url=https%3A%2F%2Fimage.slidesharecdn.com%2Fcdc-190905122701%2F85%2FCOMPILER-DESIGN-AND-CONSTRUCTION-9-320.jpg)
![Jump:
– Unconditional: goto L
– Conditional: if x relop y goto L1
[else goto L2
], where relop is
<,=, >, , or ≠. ≧ ≦](/proxy?url=https%3A%2F%2Fimage.slidesharecdn.com%2Fcdc-190905122701%2F85%2FCOMPILER-DESIGN-AND-CONSTRUCTION-10-320.jpg)




