Storage organization and stack allocation of space

Storage organization and stack allocation of space
Compiler Construction
Compiler Design

1. Gore © RaAetizarion lor commer.)
——err_——

> In perspechve of compiler, the erecting
legal Plagio vans In is owe Logical adeless
Space

> FR waged ad once dy ths Leal

showed beten the Compiler,

addsess space is

opesiting em ad target trachine

> Te operating spe maps the Logical eddies ih
pied address,

2 Re tune tone men Subdinsen 18 shown below

Code
Shade
Weap

J
fe Monet
1

Stack

2. > The amount of Storage needed Fr a prego,

depends tapon he Types H have

inl mais CY

1

a Pp
Sand b= 241 —o 468 Total =12. Byles
Sloat C2 arb; — ME
Count Lees

Code : Te sine of the geresaled target code is fred
at compiletine and placed in Code’ section
Stabe: Re sre $ Gobel constants, state variable ek.
ase <tosed im ths section
These ese two olher sechms d0 aCcommodale wem
Stack: Stack grows fcom bottom An top (Stack Beraviow )

Tr shores Funcion calls which ase sol
use stack

HenP.: Heap gutus fire ho + bottom ad it stores djmnilf

in Ger

weted objeds (wih wed peste) hich ave deleted
fon nop memory (with delete perd in ctr)

3. Function all and rel behanout
Using Staek.( STHK muoémon or Sima

int main( )
int = HO;
y

it AO
Uso;

j
int #20)

{
ide RO;

Hf
int #30
{
int d= FUL);

I

int MO
{
E y ARDON
Cat «Finis mine
’ Lectin (CS RIT) UOin Lahore

j
Wratten, val nai um