Comp||er Des|gn (CS701) uest|ons L|st

UNI1I
C 1WhaL ls compller? Lxplaln wlLh a dlagram WhaL are Lhe feaLures of good compller?
C2 Why should one sLudy abouL compller
C3WhaL are Lhe phases of a Compller
C4WhaL ls 8ooLsLrapplng?
C3 whaL ls symbol Lable organlsaLlon Lxplaln Lhe role of symbol Lable ln lexlcal analyser
C6 Lxplaln lexlcal analyser and lLs deslgn ( ln conLexL of ldenLlflcaLlon of Lokens) WhaL ls Lhe role of
lL ln compller and also explaln Lhe concepL of lnpuL bufferlng
C7WhaL ls LLx? uescrlbe auxlllary deflnlLlons and LranslaLlon rules for LLx wlLh sulLable example
C8 uevelop a lexlcal analyser Lo recognlze valld operaLors of C program
C 9WhaL are Lhe Lasks performed by Lhe compller ln Lhe lexlcal and synLax analysls phase
UNI1II
C1WrlLe shorL noLes on Lypes of grammar
C2WhaL do you mean by amblguous grammar and unamblguous grammar Lxplaln wlLh example
C3WhaL ls Lhe role of handle prunlng ln parslng?
C4WhaL ls Lopdown parslng? WhaL are Lhe dlfflculLles encounLered ln Lhls and how are Lhey
overcome
C3WhaL ls predlcLlve parser? Pow a parser ls conLrolled by a program?
C6Compare Lop down and boLLomup parslng meLhodologles
C7 Lxplaln operaLor precedence parslng lLs llmlLaLlons and lLs grammar WrlLe lLs algorlLhm
C8WhLa do you undersLand by L8(k) grammar?
C9WrlLe shorL noLe on error handllng ln LL and L8 parser
C10ShorL noLe on
(l)?ACC
(ll)SynLax dlrecLed LranslaLlon
(lll)SynLax Lree
(lv)SaLLrlbuLed deflnlLlons
(v)LaLLrlbuLed deflnaLlons
C11Clve Lhe parse Lree and LranslaLlon for Lhe expresslon 23*3+4 accordlng Lo Lhe synLax dlrecLed
LranslaLlon scheme
C12 ulfferenLlaLe beLween synLheslzed LranslaLlon and lnherlLed LranslaLlons
C 13 8emove null producLlon unlL producLlon and useless symbols from Lhe followlng ClC
S7C|8S|C1
7a|a
C7 |bC
878d|8c
17eL|
C14 Conslder Lhe grammar C S7SaS|b show LhaL C ls amblguous for Lhe sLrlng 'bababab'
C 13Conslder Lhe grammar
S7(L)|a
L7L S|S
(l)llnd Lhe parse Lree for Lhe followlng
O (aa)
O (a(aa))
O (a(aa)(aa))
(ll) ConsLrucL lefL mosL and rlghLmosL derlvaLlve for each (a)
C16 LeL C be Lhe grammar
S7a8|bA
A7a|aS|8aa
87b|bS|a88
lor Lhe sLrlng aaabbabbba" flnd lefLmosL and rlghLmosL derlvaLlon and also consLrucL Lhe parse
Lree
C17 CompuLe precedence relaLlon for Lhe followlng grammer
L7L+1|1
171*l|l
l7(L)|ld
Show Lhe moves of operaLor precedence parser for Lhe lnpuL sLrlng ld+ld*ld
C18 llnd Leadlng and 1ralllng of Lhe followlng grammar
S7aA8|bA|
A7aAb|
87b8|c
C 19 Conslder Lhe grammar and calculaLe Lhe ll8S1 and lCLLCW
S7AC8|Cb8|8a
A7da|8C
87g|
C7h|
C 20 ConsLrucL Lhe parslng Lable for Lhe followlng grammar
S7ax?b
x7c|
?7d|
C 21Conslder Lhe followlng grammar

S7A8C
A7a|bbu
87a|
C7b|
u7c|
(l)ConsLrucL Lhe flrsL and follow
(ll) ueslgn LL(1) parslng Lable
(lll)Show LhaL Lhe grammar ls noL LL(1)
C 22 Conslder Lhe followlng grammar
S 7SeS|lS|a
ConsLrucL Lhe LranslLlon Lable and AC1lCn/CC1C Lable of Lhe glven grammar
(l)Show LhaL Lhe glven grammar ls L8(0) or noL
(ll)Show LhaL Lhe glven grammar ls SL8 or noL
C23 ConsLrucL L8(0) parslng Lable for Lhe followlng grammar
S7cA|cc8
A7cA|a
87cc8|b
UNI1III
C1 WrlLe shorL noLe on Lype checklng
C2 ulfferenLlaLe beLween sLaLlc and dynamlc blndlng
C3 Lxplaln acLlvaLlon record lLs flelds and Lhelr purpose
C 4 uescrlbe sLorage allocaLlon sLraLegles
C 3 uescrlbe parameLer parslng mechanlsm for a procedure call
C 6 WrlLe shorL noLes on daLa sLrucLures of symbol Lable
C7 WhaL ls hashlng and whaL are dlfferenL klnd of hashlng Lechnlques avallable?
C8 ulfferenLlaLe beLween lmpllclL and expllclL Lype converslon wlLh sulLable example

UNI1IV
C 1 WrlLe Lhe LranslaLlon scheme Lo generaLe lnLermedlaLe code for asslgnmenL sLaLemenLs wlLh
array references
C 2 WrlLe synLax dlrecLed deflnlLlon Lo LranslaLe swlLch" sLaLemenL wlLh example
C3 WrlLe shorL noLe on backpaLchlng
C 4 WhaL are Lhe general lssues ln deslgnlng a code generaLor and problems assoclaLed wlLh lL
C3 Lxplaln code generaLlon algorlLhm
C6 WhaL ls baslc block? WlLh example explaln Lhe LransformaLlons on Lhe baslc blocks
C 7 WrlLe shorL noLes on
O Leaders
O uAC
O eep hole opLlmlzaLlon
C 8 WhaL are Lhe advanLages consLrucLlon and appllcaLlons of uAC
C 9 uescrlbe Lhe process of code generaLlon from uAC
C10 Lxplaln heurlsLlc orderlng algorlLhm for uAC
C 11 Conslder Lhe followlng whllesLaLemenLs
Whlle A8 and A2*83 do
AA+8
(l)ConsLrucL Lhe parse Lree
(ll)WrlLe Lhe lnLermedlaLe code generaLed
C 12 ConsLrucL Lhe uAC for Lhe followlng baslc block
u8*C
LA+8
88*C
ALu
C13 ConsLrucL Lhe uAC for Lhe followlng baslc block
114*l
12a11
134*l
1312*14
16rod+13
rod16
17l+1
l17
lf l20
C14 Show Lhe uAC for Lhe followlng sLaLemenLs
Zx?+x*?*uv/W+x+v
C 13 ConsLrucL uAC of baslc block afLer converLlng Lhe code ln 3 address LranslaLlon
l1
!2
8epeaL
Al!
!!*2
ll+1
Whlle(l10)
C16 1ranslaLe Lhe expresslon
(a+b)*(c+d)(a+b+c)
lnLo quadruples Lrlples and lndlrecL Lrlples
C 17 ConsLrucL 3 address code for Lhe followlng
lf (ab) and ((cd) or (ad))
1hen
Zx+y*Z
Llse
ZZ+1

Un|t S
C1 Lxplaln prlnclple sources of opLlmlzaLlon wlLh sulLable examples
C2 uescrlbe Lhe necessary and sufflclenL condlLlon for performlng consLanL propagaLlon and dead
code ellmlnaLlon
C3 ueflne domlnaLors
C4 Lxplaln global daLa flow analysls and lLs use ln opLlmlzaLlon