cs6612-compiler-design-lab-manualdoc.doc

1. IMPLEMENTATION OF SYMBOL TABLE AIM:

To write a C program to implement a symbol table. ALGORITHM:

1) Start the program. 2) Get the input from the user with the terminating symbol ‘$’. ) !llo"ate memory for the #ariable by ynami" memory allo"ation fun"tion. %) &f the ne't "hara"ter of the symbol is an operator then only the memory is allo"ate. () hile reaing* the input symbol is inserte into symbol table along with its memory aress. +) The steps are repeate till ‘$’ is rea"he. ,) To rea"h a #ariable* enter the #ariable to the sear"he an symbol table has been "he"-e for "orresponing #ariable* the #ariable along with its aress is isplaye as result. ) Stop the program. PROGRAM:

/in"lue 0stio.h /in"lue0"onio.h /in"lue0"type.h /in"lue0allo".h /in"lue0string.h /in"lue0math.h #oi main) 3 int i45*645*'45*n*flag457 #oi 8p*8a9(7 "har "h*sr"h*b91(*91(*"7 "lrs"r)7 printf;<'pression terminate by $ : ;)7 while"4get"har))=4>$>)3 b9i4"7i??7@n4iA17 printf;Gi#en <'pression : ;)7 i457 whilei04n) 3 printf;B";*b9i)7 i??7 @ printf;n Symbol Tablen;)7 printf;Symboltarttype;)7 while604n) 3 "4b967 ifisalphatoas"ii"))) 1

3 if644n) 3 p4mallo"")7 a9'4p7 9'4"7 printf;B"tBtientifier;*"*p)7 @ else 3 "h4b96?17 if"h44>?>DD"h44>A>DD"h44>8>DD"h44>4>) 3 p4mallo"")7 a9'4p7 9'4"7 printf;nB"tBtientifiern;*"*p)7 '??7 @@@ 6??7 @ printf;nThe symbol is to be sear"he;)7 sr"h4get"h)7 fori457i04'7i??) 3 ifsr"h449i) 3 printf;nSymbol Eoun;)7 printf;nB"BsBn;*sr"h*; Faress ;*a9i)7 flag417 @ @ ifflag445) printf;nSymbol ot Eoun;)7 get"h)7 @ OUTPUT: <'pression terminate by $ : "4a?b$ Gi#en <'pression : "4a?b Symbol Table Symbol !r Type " 1H55 ientifier a 255% ientifier b 215+ ientifier The symbol is to be sear"he Symbol Eoun b Faress 215+

RESULT: Thus the C program for symbol table is implemente an e'e"ute su""essfully. 2

2. DEVELOP A LEXICAL ANALYZER TO RECOGNIZE A FEW PATTERNS IN C AIM:

To write an e'e"ute a C program to implement the le'i"al analyIer. ALGORITHM:

1. Start the program. 2. Je"lare the file pointer an ne"essary #ariables. . Kpen the input file in the rea moe. %. Lse the analyIe fun"tion to analyIe the input program an store the ientifiers* -eywors an operator on ih* -eyh* oph respe"ti#ely. (. Stores the to-ens in ata stru"ture lin-e lists. +. &n"rement the line number of ea"h to-en an its o""urren"es. ,. Lsing the show fun"tion print the lin-e lists in a tabular format. . Stop the program.

PROGRAM:

/in"lue0string.h /in"lue0"type.h /in"lue0stio.h #oi -eywor"har str915) 3 ifstr"mp;for;*str)445DDstr"mp;while;*str)445DDstr"mp;o;*str)445DD str"mp;int;*str)445DDstr"mp;float;*str)445DDstr"mp;"har;*str)445DD str"mp;ouble;*str)445DDstr"mp;stati";*str)445DDstr"mp;swit"h;*str)445DD str"mp;"ase;*str)445) printf;nBs is a -eywor;*str)7 else printf;nBs is an ientifier;*str)7 @ main) 3 E&M< 8f1*8f2*8f7 "har "*str915*st19157 int num9155*lineno45*to-en#alue45*i45*645*-457 printf;n
while"4get"f1))=45>7 "4get"f1)7 whileisigit")) 3 to-en#alue8415?"A>5>7 "4get"f1)7 @ num9i??4to-en#alue7 unget""*f1)7 @ else ifisalpha")) 3 put""*f2)7 "4get"f1)7 whileisigit")DDisalpha")DD"44>O>DD"44>$>) 3 put""*f2)7 "4get"f1)7 @ put"> >*f2)7 unget""*f1)7 @ else if"44> >DD"44>t>) printf; ;)7 else if"44>n>) lineno??7 else put""*f)7 @ f"losef2)7 f"losef)7 f"losef1)7 printf;nThe no>s in the program are;)7 for645760i76??) printf;B;*num96)7 printf;n;)7 f24fopen;ientifier;*;r;)7 -457 printf;The -eywors an ientifiersare:;)7 while"4get"f2))=4 >) else

str9-??4"7 4

3 str9-4>5>7 -eyworstr)7 -457 @ @ f"losef2)7 f4fopen;spe"ial"har;*;r;)7 printf;nSpe"ial "hara"ters are;)7 while"4get"f))=4
s in the program are1525 The -eywors an ientifiersare: in"lue is an ientifier stio is an ientifier h is an ientifier main is an ientifier int is a -eywor a is an ientifier b is an ientifier " is an ientifier " is an ientifier a is an ientifier b is an ientifier printf is an ientifier  is an ientifier " is an ientifier Spe"ial "hara"ters are/0.)34*4*74?7;B;*)7@ Total no. of lines are:

RESULT:

Thus the C program for le'i"al analyIer to re"ogniIe few patterns is implemente an e'e"ute su""essfully. 

3. IMPLEMENTATION OF LEXICAL ANALYZER USING LEX TOOL AIM:

To implement the le'i"al analyIer using le' tool for a subset of C language. ALGORITHM:

1.

Start the program.

2.

Je"lare ne"essary #ariables an "reates to-en representation using Regular.

.

rint the pre pro"essor or ire"ti#es* -eywors by analysis of the input program.

%.

&n the program "he"- whether there are arguments.

(.

Je"lare a file an open it as rea moe.

+. Rea the file an if any ta-en in sour"e program mat"hes with R< that all returne as integer #alue. ,.

rint the to-en ientifie using e') fun"tion.

.

Stop the program

PROGRAM:

B3 B@ ientifier9aAI!AQ9aAI!AQ5AH8 BB /.8 3printf;nBs is a prepro"essor ire"ti#e;*yyte't)7@ int D float D "har D ouble D while D o D if D brea- D "ontinue D #oi D swit"h D return D else D goto 3printf;nBs is a -eywor;*yyte't)7@ 3ientifier@ 3printf;n fun"tion Bs;*yyte't)7@ 3 3printf;nblo"- begins;)7@ @ 3printf;nblo"- ens;)7@  3printf;n;)7
04 D 4 D 0 D  D 44 3printf;n Bs is a relational operator;*yyte't)7@ 4 D ? D A D N D V D B 3printf;n Bs is a operator;*yyte't)7@ .D n7 BB int mainint arg"*"har 88arg#) 3 E&M< 8file7 file4fopen;inp.";*;r;)7 if=file) 3 printf;"oul not open the file===;)7 e'it5)7 @ yyin4file7 yyle')7 printf;nn;)7 return5)7 @ int yywrap) 3 return 17 @

"

OUTPUT:

C:Jo"uments an SettingsaminJes-topfle' ale'.l C:Jo"uments an SettingsaminJes-topg"" le'.yy." C:Jo"uments an SettingsaminJes-topa.e'e /in"lue0stio.h is a prepro"essor ire"ti#e #oi is a -eywor fun"tion main blo"- begins int is a -eywor a is an ientifier b is an ientifier " is an ientifier fun"tion printf ;enter the #alue for a*b; is a string fun"tion s"anf ;BB; is a string V is a operator a is an ientifier V is a operator b is an ientifier " is an ientifier 4 is a operator a is an ientifier ? is a operator b is an ientifier fun"tion printf ;the #alue of ":B; is a string V is a operator " is an ientifier blo"- ens

RESULT: Thus the program to implement le'i"al analyIer using le' tool is e'e"ute an implemente

su""essfully. #

4. GENERATE CATEGORIES

YACC

SPECIFICATION

FOR

A

FEW

SYNTACTIC

A$ PROGRAM TO RECOGNIZE A VALID ARITHMETIC EXPRESSION THAT USES OPERATOR % '  ( AND ). ALGORITHM:

1. !""ept the to-en generate in le' part as input 2. Spe"ify orer of pro"eure . Jefine rules with en point %. arse input string from stanar input by "alling yyparse) by main fun"tion (. rint the result of any rules mat"hes +. &f none of results efine mat"hes print Win#ali e'pressionX COMPILATION STEPS:

$ le' e'p.l $ ya"" Y e'p.y $ "" le'.yy." y.tab." Yll Yly $ .Na.out PROGRAM: Y*++,E-./0

Bto-en LZ[?> >A> Bleft >8> >N> BB stmt : e'p M 3 printfW\ali <'pressionX)7 e'it5)7@ 7 e'p : e'p >?> e'p D e'p >A> e'p D e'p >8> e'p D e'p >N> e'p D >> e'p >)> D &J D LZ[
main ) 3 printfW
L-,E-.L0

B3 /in"lue Wy.tab.hX B@ BB 95AH? 3 return LZ[
RESULT: Thus the program for #aliating arithmeti" e'pressions using a"" is implemente an e'e"ute su""essfully.

1

B$ PROGRAM TO RECOGNIZE A VALID VARIABLE WHICH STARTS WITH A LETTER FOLLOWED BY ANY NUMBER OF LETTERS OR DIGITS. PROGRAM: Y*++,L.Y0

Bto-en J&G&T M
B3 /in"lue Wy.tab.hX B@ BB 9aAI!AQ 3 return M
RESULT: Thus the program is e'e"ute su""essfully. 11

C$ IMPLEMENTATION OF CALCULATOR USING LEX AND YACC PROGRAM: L-,C*5.L0

B3 /in"lue;y.tab.h; /in"lue0math.h B@ BB 95AH?D95AH8.95AH?)9e<9A?]95AH?)]) 3yyl#al.#al4atofyyte't)7return LZ[
B3 ouble mem#ar7 B@ Bunion 3 ouble #al7 @ Bto-en0#alLZ[A> >?> Bleft >8> >N> Bright >P> Bleft MKG S&< nMKG CKS T! Bnonasso" LZ&LS Btype0#ale'pression BB start:statement>n> Dstart statement>n> 7 12

statement:Z4>e'pression 3mem#ar4$7@ D e'pression3printf;!nswer4Bgn;*$1)7@ 7 e'pression:e'pression>?>e'pression 3$$4$1?$7@ D e'pression >A> e'pression 3$$4$1A$7@ D e'pression >8> e'pression 3$$4$18$7@ D e'pression >N> e'pression 3 if$445) yyerror;i#ie by Iero;)7 else $$4$1N$7 @ De'pression>P>e'pression 3$$4pow$1*$)7@ 7 e'pression:>A>e'pression Bpre" LZ&LS3$$4A$27@ D>>e'pression>)>3$$4$27@ DMKG e'pression 3$$4log$2)Nlog15)7@ DnMKG e'pression 3$$4log$2)7@ DS&< e'pression 3$$4sin$28.1%N15)7@ DCKS e'pression 3$$4"os$28.1%N15)7@ DT! e'pression 3$$4tan$28.1%N15)7@ DLZ[
9linu'pertFfosslab ^$ #i "al.l 9linu'pertFfosslab ^$ le' "al.l 9linu'pertFfosslab ^$ ya"" A "al.y 9linu'pertFfosslab ^$ "" le'.yy." y.tab." All Alm 9linu'pertFfosslab ^$ .Na.out
RESULT:

Thus the program to implement "al"ulator using M<_ an !CC tool is e'e"ute su""essfully an output is #erifie. 13

. CONVERT THE BNF RULES INTO YACC FORM AND WRITE CODE TO GENERATE ABSTRACT SYNTAX TREE. AIM:

To Con#ert the [E rules into a"" form an write "oe to generate !bstra"t Synta' Tree ALGORITHM:

1. 2. . %. (.

Start the program. &n"lue the heaer file.



&n int "oe.l*e"lare the #ariable lie no as integer an assign it to be e`ual to ‘1’. Start the int "oe.l with e"larati#e se"tion. &n translation rules se"tion efine -eywors *ata types an integer along with their a"tions .

+. Start the main blo"-. &n main blo"- "he"- the statement ,. 1.e"larati#e 2.assignment ."onitional %.if an else (.hile assignment. . erform the a"tions of that parti"ular blo"-. H. &n main program e"lare the parameters arg " as int en 8arg#9 as "har. &n main program open file in rea moe. 15. rint the output in a file. 11.
B3 /in"lue;y.tab.h; /in"lue0stio.h /in"lue0string.h int Mineo417 B@ ientifier 9aAI!AQ9OaAI!AQ5AH8 number 95AH?D95AH8.95AH?) BB main) return Z!&7 if return &E7 else return
04 D 44 3str"pyyyl#al.#ar*yyte't)7 return R
B3 /in"lue0string.h /in"lue0stio.h stru"t `ua 3 "har op9(7 "har arg19157 "har arg29157 "har result9157 @L!J957 stru"t sta"3 int items91557 int top7 @st-7 int &ne'45*t&ne'45*Sto*&n*t&n7 e'tern int Mineo7 B@ Bunion 3 "har #ar9157 @ Bto-en 0#ar LZ \!R RA> >?> Bleft >8> >N> BB RKGR!Z : Z!& [MKC 7 [MKC: >3> CKJ< >@> 7 CKJ<: [MKC D ST!T7> D !SS&GZ<T >7> D CKJST D U&M
7 J*> \!RM&ST D \!R 7 !SS&GZ<T: \!R >4> <_R3 str"pyL!J9&ne'.op*;4;)7 str"pyL!J9&ne'.arg1*$)7 str"pyL!J9&ne'.arg2*;;)7 str"pyL!J9&ne'.result*$1)7 str"py$$*L!J9&ne'??.result)7 @ 7 <_R: <_R >?> <_R 3!uaruple;?;*$1*$*$$)7@ D <_R >A> <_R 3!uaruple;A;*$1*$*$$)7@ D <_R >8> <_R 3!uaruple;8;*$1*$*$$)7@ D <_R >N> <_R 3!uaruple;N;*$1*$*$$)7@ D >A> <_R 3!uaruple;LZ&;*$2*;;*$$)7@ D >> <_R >)> 3str"py$$*$2)7@ D \!R D LZ 7 CKJST: &EST3 &n4pop)7 sprintfL!J9&n.result*;B;*&ne')7 &n4pop)7 sprintfL!J9&n.result*;B;*&ne')7 @ D &EST > CKJ&T&K >)> 3 str"pyL!J9&ne'.op*;44;)7 str"pyL!J9&ne'.arg1*$)7 str"pyL!J9&ne'.arg2*;E!MS<;)7 str"pyL!J9&ne'.result*;A1;)7 push&ne')7 &ne'??7 @ [MKC 3 str"pyL!J9&ne'.op*;GKTK;)7 str"pyL!J9&ne'.arg1*;;)7 str"pyL!J9&ne'.arg2*;;)7 str"pyL!J9&ne'.result*;A1;)7 push&ne')7 &ne'??7 @7
sprintfL!J9&n.result*;B;*&ne')7 @ [MKC3 &n4pop)7 sprintfL!J9&n.result*;B;*&ne')7 @7 CKJ&T&K: \!R R> CKJ&T&K >)> 3 str"pyL!J9&ne'.op*;44;)7 str"pyL!J9&ne'.arg1*$)7 str"pyL!J9&ne'.arg2*;E!MS<;)7 str"pyL!J9&ne'.result*;A1;)7 push&ne')7 &ne'??7 @ [MKC 3 str"pyL!J9&ne'.op*;GKTK;)7 str"pyL!J9&ne'.arg1*;;)7 str"pyL!J9&ne'.arg2*;;)7 str"pyL!J9&ne'.result*;A1;)7 push&ne')7 &ne'??7 @ 7 BB e'tern E&M< 8yyin7 int mainint arg"*"har 8arg#9) 3 E&M< 8fp7 int i7 ifarg"1) 3 fp4fopenarg#91*;r;)7 if=fp) 3 printf;n Eile not foun;)7 e'it5)7 @ yyin4fp7 1"

@ yyparse)7 printf;nntt AAAAAAAAAAAAAAAAAAAAAAAAAAAAntt os Kperator !rg1 !rg2 ResultnttAAAAAAAAAAAAAAAAAAAA;)7 fori457i0&ne'7i??) 3 printf;ntt Bt Bst Bst Bst Bs;*i*L!J9i.op*L!J9i.arg1*L!J9i.arg2*L!J9i.result)7 @ printf;ntt AAAAAAAAAAAAAAAAAAAAAAA;)7 printf;nn;)7 return 57 @ #oi pushint ata) 3 st-.top??7 ifst-.top44155) 3 printf;n Sta"- o#erflown;)7 e'it5)7 @ st-.items9st-.top4ata7 @ int pop) 3 int ata7 ifst-.top44A1) 3 printf;n Sta"- unerflown;)7 e'it5)7 @ ata4st-.items9st-.topAA7 return ata7 @ #oi !uaruple"har op9(*"har arg1915*"har arg2915*"har result915) 3 str"pyL!J9&ne'.op*op)7 str"pyL!J9&ne'.arg1*arg1)7 str"pyL!J9&ne'.arg2*arg2)7 sprintfL!J9&ne'.result*;tB;*t&ne'??)7 str"pyresult*L!J9&ne'??.result)7 @ yyerror) 3 printf;n
ifa0b) 3a4a?b7@ 1#

whilea0b) 3a4a?b7@ ifa04b) 3"4aAb7@ else 3"4a?b7@ @ OUTPUT: 9linu'pertFfosslab ^$ #i bnf.y

9linu'pertFfosslab ^$ ya"" A bnf.y 9linu'pertFfosslab ^$ g"" le'.yy." y.tab." All Alm 9linu'pertFfosslab ^$ .Na.out test." AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA O<*;< A<=1 A<=2 R85 AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA 5 0 a b t5

P;

1

44

2 ?

t5

a

E!MS<

b

 4

t1

t1

%

a

GKTK (

(

0

a

+

b

44 , ?

t2

t2 a

b

4

E!MS<

a

GKTK 15

a

1% 1( 1+

b

44

12 A 1

(

04

11

t% a

t% E!MS<

b

4

t(

t(

"

GKTK ? 4

15

t

t

H

(

1, a

b t+

t+ " 1

1(

AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA RESULT: Thus the program to "on#ert the [E rules into a"" form is implemente an e'e"ute su""essfully.

#. IMPLEMENT ANY ONE STORAGE ALLOCATION STRATEGIES >HEAP STAC? STATIC$ AIM:

To &mplement any one storage allo"ation strategies Ueap*Sta"-*Stati") PROGRAM:

/in"lue0stio.h /in"lue0"onio.h /in"lue0stlib.h /efine TRL< 1 /efine E!MS< 5 typeef stru"t Ueap 3 int ata7 stru"t Ueap 8ne't7 @noe7 noe 8"reate)7 #oi main) 3 N8lo"al e"larations8N int "hoi"e*#al7 "har ans7 noe 8hea7 #oi isplaynoe 8)7 noe 8sear"hnoe 8*int)7 noe 8insertnoe 8)7 #oi elenoe 88)7 hea4LMM7 o 3 "lrs"r)7 printf;n rogram to perform #arious operations on heapusing ynami" memory management;)7 printf;n1.Create;)7 printf;n2.Jisplay;)7 printf;n.&nsert an element in a list;)7 printf;n%.Jelete an element from list;)7 printf;n(.uit;)7 printf;n
brea-7 "ase :hea4inserthea)7 brea-7 "ase %:eleVhea)7 brea-7 "ase (:e'it5)7 efault:"lrs"r)7 printf;&n#ali Choi"e*Try again;)7 get"h)7 @ @while"hoi"e=4()7 @ noe 8"reate) 3 noe 8temp*8new1*8hea7 int #al*flag7 "har ans4>y>7 noe 8getOnoe)7 temp4LMM7 flag4TRL<7 N8flag to ini"ate whether a new noe is "reate for the first time or not8N o 3 printf;n y>)7 printf;nThe list is "reate;)7 get"h)7 "lrs"r)7 return hea7 @ noe 8getOnoe) 21

3 noe 8temp7 temp4noe8)mallo"siIeofnoe))7 NNusing the mem. !llo"ation fun"tion tempAne't4LMM7 return temp7 @ #oi isplaynoe8hea) 3 noe 8temp7 temp4hea7 iftemp44LMM) 3 printf;n The list is emptyn;)7 get"h)7 "lrs"r)7 return7 @ whiletemp=4 LMM) 3 printf;BA;*tempA ata)7 temp4tempAne't7 @ printf;LMM;)7 get"h)7 "lrs"r)7 @ noe 8sear"hnoe 8hea*int -ey) 3 noe 8temp7 int foun7 temp4hea7 if temp44LMM) 3 printf;The lin-e list is emptyn;)7 get"h)7 "lrs"r)7 return LMM7 @ foun4E!MS<7 whiletemp=4LMM)VVfoun44E!MS<)) 3 iftempAata =4 -ey) temp 4 tempAne't7 else foun 4 TRL<7 @ iffoun 44 TRL<) 3 printf;n The
return temp7 @ else printf;n The
printf ;n
pre# 4 temp7 temp 4 tempAne't7 @ else flag 4 TRL<7 @ ifflag) N8if Elag is true8N return pre#7 else return LMM7 @ #oi elenoe 88hea) 3 int -ey7 noe 8ew*8temp* 8pre#7 temp48hea7 if temp44 LMM) 3 printf ;n The list is emptyn ;)7 get"h)7 "lrs"r)7 return7 @ "lrs"r)7 printf;n<T
2

OUTPUT:

rogram to perform #arious operations on heap using Jynami" memory management. 1.Create 2.Jisplay .&nsert an element in a list %. Jelete an element from list (. uit
rogram to perform #arious operations on Ueap using Jynami" memory management. 1. Create 2. Jisplay . &nsert an element in a list %. Jelete an element from list (. uit
RESULT: Thus the program to implement storage allo"ation for U
2!

1. IMPLEMENT THE BAC? END OF THE COMPILER WHICH TA?ES THE THREE ADDRESS CODE AND PRODUCES THE ##! ASSEMBLY LANGUAGE INSTRUCTIONS THAT CAN BE ASSEMBLED AND RUN USING A ##! ASSEMBLER. THE TARGET ASSEMBLY INSTRUCTIONS CAN BE SIMPLE MOVE ADD SUB @UMP. ALSO SIMPLE ADDRESSING MODES ARE USED. OR IMPLEMENTATION OF CODE GENERATOR AIM:

To write a C program to implement Simple Coe Generator. ALGORITHM:

1. 2. . %. (. +. ,. . H.

Start Get aress "oe se`uen"e. Jetermine "urrent lo"ation of  using aress for 1st operan). &f "urrent lo"ation not alreay e'ist generate mo#e [*K). Lpate aress of !for 2n operan). &f "urrent #alue of [ an ) is null*e'ist. &f they generate operator ) !* !JR. Store the mo#e instru"tion in memory Stop

PROGRAM: /in"lue0stio.h /in"lue0"onio.h /in"lue0string.h /in"lue0"type.h /in"lue0graphi"s.h typeef stru"t 3 "har #ar9157 int ali#e7 @ regist7

regist preg9157 #oi substring"har e'p9*int st*int en) 3 int i*6457 "har up9154;;7 fori4st7i0en7i??) up96??4e'p9i7 up964>5>7 str"pye'p*up)7 @ int getregister"har #ar9) 3 int i7 fori457i0157i??) 3 2"

ifpreg9i.ali#e445) 3 str"pypreg9i.#ar*#ar)7 brea-7 @ @ returni)7 @ #oi get#ar"har e'p9*"har #9) 3 int i*6457 "har #ar9154;;7 fori457e'p9i=4>5>7i??) ifisalphae'p9i)) #ar96??4e'p9i7 else brea-7 str"py#*#ar)7 @ #oi main) 3 "har basi"915915*#ar915915*fstr915*op7 int i*6*-*reg*#"*flag457 "lrs"r)7 printf;n?>: printf;n!;)7 brea-7 "ase >A>: printf;nSub;)7 brea-7 2#

"ase >8>: printf;nZul;)7 brea-7 "ase >N>: printf;nJi#;)7 brea-7 @ flag417 for-457-04reg7-??) 3 ifstr"mppreg9-.#ar*#ar9#"A1)445) 3 printf;RB* RB;*-*reg)7 preg9-.ali#e457 flag457 brea-7 @ @ ifflag) 3 printf; Bs*RB;*#ar9#"A1*reg)7 printf;nZo# Bs*RB;*fstr*reg)7 @ str"pypreg9reg.#ar*#ar9#"A)7 get"h)7 @ @

INPUT & OUTPUT:


RESULT:

Thus the program to implement simple "oe generator is e'e"ute su""essfully an the output is #erifie. 2

11. IMPLEMENTATION OF SIMPLE CODE OPTIMIZATION TECHNIUES AIM:

To write a C program to implement Coe KptimiIation Te"hni`ues. ALGORITHM:

&nput: Set of ‘M’ #alues with "orresponing ‘R’ #alues. Kutput: &ntermeiate "oe V KptimiIe "oe after eliminating "ommon e'pressions. PROGRAM:

/in"lue0stio.h /in"lue0"onio.h /in"lue0string.h stru"t op 3 "har l7 "har r9257 @ op915*pr9157 #oi main) 3 int a*i*-*6*n*I45*m*`7 "har 8p*8l7 "har temp*t7 "har 8tem7 "lrs"r)7 printf;
3 pr9I.l4op9i.l7 str"pypr9I.r*op9i.r)7 I??7 @@@ pr9I.l4op9nA1.l7 str"pypr9I.r*op9nA1.r)7 I??7 printf;n!fter Jea Coe 5>7 str"pypr9i.r*>5>)7 @ @ @ printf;KptimiIe Coen;)7 fori457i0I7i??) 3 ifpr9i.l=4>5>) 3 printf;B"4;*pr9i.l)7 printf;Bsn;*pr9i.r)7 @ 31

@ get"h)7 @ INPUT & OUTPUT:
left: r right: f &ntermeiate Coe a4H b4"? e4"? f4b?e r4f n!fter Jea Coe
RESULT:

Thus the program for "oe optimiIation is implemente an e'e"ute su""essfully* an the output is #erifie. 32