0% found this document useful (0 votes)
37 viewsCompiler Design Unit 1 Notes
compiler design notes on basic parts such as what is compiler design , phases of compiler design all that stuff knowledge
Uploaded by
tilakbhusare555Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
37 viewsCompiler Design Unit 1 Notes
compiler design notes on basic parts such as what is compiler design , phases of compiler design all that stuff knowledge
Uploaded by
tilakbhusare555Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
/ 49
Uait-
_ Compiler Design sylt a
Ip product 6n i140 Com Ping befini :
Phas @S_. camneilee Los,
Phases of compiler, Grouping _of_t ae
(Tools, boucel Analysis: the %2°* yole -2f_leaisol anaes,
_—__—_inpuk _buffeving specliicah er aR agen Hen
Se ya siseiay. Gist atari from wegulah,
____expresseo to finite
inaHen
_
on of Comeile, 2
abus ——
PA compiler is & Program that
and translate into
lang. the tarqel- lang,
| Der of Compilex:—
ns
I Can read Psrdgram in one lang.
equivalent program in anothey
fn Impostant role OF He compiler “is +o +ePovl—
ony enexs in he Source Ps0gya mm that ik detects |
dung the teanslahon Pwcess.
-Sourte Program —>| compiler | > Target Program
HLL Leu
In addition +o a Compiley Several other
programs may be veduiyed +e Create an
eyecutoble jargel Proqxvam. + oo
——_Pn910m_moy be divided jnlo Modules Sfored —
Ce ee dL
_ Source program js & een
Program Called Prcprocesson, ‘the, prepsncessox May —
algo expand shorkhands ,called macros inte souxe —
language Slaloements.
@ scanned with OKEN Scanner 1
\ Compile ¥ \
NT
Target assembly Progyam
eee
Vv
Retoca Fable Machine code
—z—
| inicey / Jo adex|e— librery Piles
Yelocatable objec files
(angie pica SaStorn)
“the -moclifies! souxce proyyam js then fed to o Compile:
The Compiley may produce an assembly language
Progvam as [ts puteut agsembly language is easier +o
Produce ag ouput Aad Js easiex fo debug, the ossemb/y
language is +nen processed by a progzem Called an
assemble~ that produces relocatable machine code 96 its
output large Programs axe offen compiled iP Piece,
Se the relocatable machine Code May have to be linked
together with-ofher velocatable object #i'les- ane
library files into the code =that actually ZUNS on the
machine. The linker resolves extexnal Memory address
where tne code in one file may refer fo a location jn
Another file. The loader then puts fogether alt of tn:
exreateble object files Into memory fer execs:
@ scanned with OKEN Scanner ——commpiter_and 21 eae ee
prog rare papnal reads 4 Prose,
crate co eigs ee eat ae
Source pangage= Langu in
inte an tow evel 4, oo
5 Had
target language-+
Phases of COMP. delrscee
Phase is logical interelated operation Fhe fe
cee eae gra a ope representation
2 prduce puteut in another rEpr Dhekion -
There are two major phases of comprley
up pe this Poink we have
box’ that map.
‘i ZL ep program LF w
d2reaF: a Compiler
oso pale Qa source Prwgyram fnte
offen up th ox a _littie - pve See that thers
2. wo parks +0 this mapping 1
Qa Analysis (machine Lndlependent/ language
cdlependent)
b. Synthesis (Machine dependent / Language 4
Lndependent J
frecreeceeecereecceeeteep
Source program compiler ee Farget-
Program
|
Compiles
@ scanned with OKEN Scanner i
p_them
the Analysis part breaks up tieetca ene soot 4
constituenk pieces and 1m pose. grammatical
PIS
fructure po
T+ then Uses
the dlesfred targel program
part constructs
information
structure
create an_indermediaté vepresensation Of source program
s
fromthe intermediafe vepresentation an
The Analysis pork o£ Of fen
in the Symbol table
allied the front ehd of the compiler, the sypthegs
“partis the back end.
Atypical decomposiHen of compiler into phases 15 chu
Source Program / Character Stream
VL
lesaical” Analyser k
t
Tekes Stream
Syntarc Analyzer
t rc
Switae Free Eyvor
somonte Analyzer |+———_ J Handley
Table v eae
L verified Syntax Free |
Snyevmediare /
Code’ generator /
LV
Intermed ate REPYE ee
av
f
Code ophmrRation
OPphmizedt coke
Code JeneratoT
wv
@ scanned with OKEN Scanner Targek Assembly cod
_ dl
[-me__Dependenk |
b code oplimizatio? }
Target machine Code
Fig tt Crhases Yof compiler)
_—
Lexical Analyze |
Syntax Analyze’
: [Semantic Analyzer]
Analysis Park CFronk End) —
——_—
Intesmeclette Code
C—stenerectox—
Cole generator |
at
| 2/2 —alepen ane —
+ fecle Opt mire xy 4
—— S90 thes;s Part ( Boek tnd
= ch
Ag ler Analysis € Synthesis pas.
>
@ scanned with OKEN Scanner
Code optimizer ct (PAGE
DATE: 1
4. Lererccul Analysis. § =
first Phase of a cornpiler 1s called ferscot analysis
scanning: The feruceth Analyser yeads the Stream of
characters Making UP fhe Source Program and groups
the characters info meantng Fab SETUENCES Catied lexemex
For each lexeme, the fexrcal analyrer Produces ag
a token. of the -xrm
output
4oken—name +ybute ~ Vvaluo
that '§ passes Op +0 the Subsequent Phase, Syntare
Analysis
2g
a= b+e x60
the Characters in this G*gem assignment Could be
__ Grouped inte following jexeroet and Compared wit
pattern Stored) cofth lexical Anag)y2er. pattern +s
Caled as get of wule for Programming language
Soltlouing axe js tne svepresenfatwn of ‘the @Ssjgnme
fapement after “/extcced analysis 9S the Sequen
f tokens
§ Zid) <=> CdD Gy Giday Gy O07
2
En this vepresentusion = +t, and # ave abs
symbols for the assignment, addition and Mult
Operator: neppecki vely.
y
@ scanned with OKEN Scanner syntax
o compiler js SY Araby <>
fpne firs Components 4,
phe__(erical anolya-
(Tar parsing Th produced by phe [cxscol— One lie,
the oe aaa produced OY 6 pres entedon ~—
= te ee —___ eo pete. ~
jnjerme
E 7 Coo pitch occa AOA —
_Becto: Woents A —
jee ser 1 grammaweal Struthie
——Vepresens thet aepicts tne S
= joll
ido & - : -
id Co
, Syntax tree parse free
This__ordering of operation /S consistent Gith
“tne _uguep Conventions of arithmetic which fel tut
th ; jon ha. ps xe Cesene
(HON bi fon is tobe perform
belsre adelshon-
8* SemanHt Analy sise—
“The__Sementit Analgiler Uses tne Syntax free and
the jn formation In the Symbol fable to heck HO
Seurvle PsograM foxy Cemmanhic Cons/stency with he
language debiniton, L4+ algo Juthers ty pe Infor mati
@ scanned with OKEN Scanner (PAGE
DATE:
=
~ qnd saves rt
— for Subse uenk use uring jnjermediate ~ Code generation
in ether she sypfax tree or the symbo) Sable
Anime reank pa of emanhe analysis [S tYyPe Checlen —
where compiles Checks that each operates hag matching
pperands fe excample Many Programming’ languag € =
epinissc0 preS An array jnchere be 2n integer =
—— mpilex ust 7eporh eyror if a floating Pornt number
jg used fe inde _ao_array.
fen 1 Specificalio May permit Cope ty pe z
TT ponvencions “called Ceercions. Ifthe operstey is applied §
4qo_a floating Point number and an integer, the compiler
__may convert tne
tg also
jnteqes (nto froafing- Point Number
hecks number OF opening & Closing Cony
brackets
Tal t
aa +
ity int to yea)
\
|
Go
Outpuk OF Semantic — Anatysi.
@ scanned with OKEN Scanner 3 Inlermediale Code GenerabeDS=——
.
iz pounce Pregra™ ie Rat
trans, as inter
a termey
J one or More
: In process 0
rt
Code, a compiler may on sd rach ONE ey
eer - i
represen talon, wrhich Can have variety of Forms.
~ z oo
“Sndax dree qrewrform ef jatermedsabe YEP TESeHIay,~
Frey Commonly used Suring Serhax aod Semone
"analysis -
-_. Are Suntan de analysis OF ne Source
wi Program, many Compiler generdel an exPNGE low NT
~~ tevel or maebune lilce inter meclrake YEPEACN Fekion >
this interrmectiot® yep resenlahim Shouts have two ¢
=] Important. ProperHes ! Tt should be easy to .
Produce and ft Should be Casy to tronslate
into Farqgeh machine. Anintermelte form Calis
Fin ec. oddlress Code Which Consisk of @ Seuvence
ike inghruchioe w/t three Operandy
gad seman
ef assembl
per _instxuchor +
: £1 = ink Jo prest (60)
4 t = jid3g # t)
tg = ida tbo
joj > +3 |
Gubpub oF interm edlrete Cocle generator
» 5+ Code optimizasyron :— >
The machine jncdependen'-_codle-°PHi mie abton Phase
cittemps to improve the Jniermecbat ode go pyaf-
Better fargek code will vesat- - Usually peHey
@ scanned with OKEN Scanner (PAGE:
ae
ans fasier bub ofher Objectives nay he “clesived Sunt
SE
as Shooter Code, or 40°92 code thak Consumes Jece power
he _Opfimirer Can oleduce that Conversien of Go lrem
jn teres fo Floating peink Can be cone once and Loy
the compile ime
following —wutl be tne oulput of code ophmirer
————f, = jda # ial foveal Césy
Tdl =id2 +t1
oe Generahon .—
bcs
The, code generator takes QS inpw- an jnfeymeocbale
yesentatim Of the Source P20JramM and Maps Il into
tne _ target languge. ‘=f phe jferget language /S Machi
codé , vegisterS Or memory locations are sefeched fer cack
of tne _vanables Used by tne Program. Then the | pjexmed
inshuchons are translated jnto Sequences 0f macdine
josteuchons that pesferms the same stage
MovF RI, id3
MULF Ry , +60.0
MovF Ry ide
ADOF R Ry
Movf idl, Ro
The first operand of cach iNStush'on specifies
al destination ~The F In each (nShuch fells us Pho
i+ cleals with Picating point numbers.
@ scanned with OKEN Scanner © symbel— Table _management-t=———-——_
or) SS
An exenial Lunch —0f a —compiles—!s4 J
__ the variable names 6 4s eol_[a pro SOULE POG Me
Saad Gace rofarmation abpouk various — Atte butey \—2
—__2f each Name th ad mea rOerde —— \~——
informalzen about Ine Storage atlolehen Foy p~~—€
its tape J/s scopes, and in pre_case OF Procedsy.
Mames Such thing as the Numb COP of heey
of its Arguments 2S |
and fne type retuyn =a
Th. mab. fable SS @ dated Sfruchure
Contesrning record of each vanakle name ae
frekdS for the attvbuses of the Name
date Structure Should he olesigned fo allow ne a
compiler fo find the record for each M4MEe Fuivegy —
and te stese or rebyeye alate from that elon —
asvtely 5 _—_
a =
@ scanned with OKEN Scanner PAGE:
BS acess pare:
Escamples 0? Compiler Phases %
egyeeic #11 R +32.
T] lexical Analyzer —> reads / scan
OuUrCe Program
peates tekens .
Lidi> <=>
oJ Syntax Analyzer
idl a
3
+ i
Ido Ve
3] emanht PA nalyrey i> Verification OF syntax tree,
+4Pp]e Checta ng & conversion
we assume tnak Deqree_F & Deqree_c are veal (Ve
1S Weal Convexting 92 INhe ~eal
Ta
Id} +
* int fo xeos
|
ido Ve a2
@ scanned with OKEN Scanner __4]__tnler mediate code__genexadee—— ~~
ts tis We arg :
ind je real C32)
5) Mechine Independent code ophmpahen ~~
- 4d._tis ida *pg 9 5
go: idy = tIl+ 32-0 yeduced line of Code 7
a Cede genercitor a
MovF RI, tda :
MOLE RI dig
Aedf Ri, 32.0 i
MovF idl, Ry
Tree_F—Ficht)
fier coh -
]
@ scanned with OKEN Scanner fr: |
Aree OC Abe ese
Bae Degree Ff =
= _ a
| eeteetetra ete a
gid £29 Sida LAS ed Kt GN
a J
~ [ stnteax “Analyzer |
rr ey ed
SS NS
jd) 2 i
ee *. -
itz—_*8
\_ Semanyre BnaWaey]
|
L
jd)
+
ah
m+ fee yeas
7 t
hoo lee a2
|
WV
Thtermediate Coole
Se ge nerarove
4. tra jdoa Ale
2. toa int-qo veal (32)
3, t3> t3ch) +t2
nlaT —hg
@ scanned with OKEN Scanner | 4 ye ida +
jdy_a tp $320 — TN
: aS
[eet Tenerat om | a
Move Ri, far ~
moLlF Ri , #/'8
ADOF RI H32°0
MovF tdi, Rp
Heme work r= atb#oa__ =
More examples 2:— i -
G@) Convert the following " Source Program inte
arget program by using Phases oF Compiler
ard akso how the -eptnes jn the syumso!/
t+eble.
For (int fal + JK 5, f4+4)
= 2+! eal
(J Jexical Araly vey
fox c> ay f.\ &)
<5> g++ QQy Zi a
@ scanned with OKEN Scanner 2 Paaresse Aine lege Ses 1
ae — Shapemes ormed/
es deci" initabsahen Cond” te becccasey een
|
cee | y 1
int ja = | = ~
1
7: ist
a ios .
1 1 ey
Semantic Analyzer
T+ venfies Syntax 4vee and do type Checking
and Conversion , No. oF opening And closing brackets
__ Tn this €2ample_ no need PF type Conversion Phe af
ak _o, an
untax Analyzer.
4 Intermediate code YJenerator
4. idl =4
2. If idis.5 then goto step eat @ is
+ ida = jd2 + 1
4. idi= id +] !
go +0 step (OY
Enc t
Same as of
syn
@ scanned with OKEN Scanner es @ code ops
—
oo. pe ore ee
aa Phase no mee: a
ex there fre O/P og
| ~~ clone by ape Fok
jrey JE Same A8 o¢
mic independent’ Cocle oPfim
—__Bndermediate Code generatoy -
~ @ Code generator (Ale coke)
a Mov tdi, +]
L. Mov_ Ri, jel
= Mov Ro, ida
po ania © eat .< 9 als ee
¥- TQE Lo
4 Ine pf2
a Inc Rl
2 IMP. LI
“ fg A eiddc\Rh
: s td2,Ro
ywabol Table
Token name) Al mbaye
valve
dt te Sk ; 4
See
oo
——
@ scanned with OKEN Scanner \
Rte j
nvert the following Source preg.am into Jarqe} progeag
using Pheses of compiler. _ i
_ net plete vib
a exical_Anolvect
idl
if <6
mi niax Analyzer
If else statement -
[
C \
cond? _) cidtements Sse
|
-
ia Ye dct Se yet dz
Tal yaa
Ey SemanHe Analyer *
There /s no MWPpe conversiM wedutrecd here o/P
os
of semantic analyzer 16 Same as syntax Anal?
@ scanned with OKEN Scanner = Ge Tavs td
5 exit
5S code optimization + —
No rveduthon jc possible Im his Cxames
therefore pyrpub of code optimizaton /S Came
2¢_intermecbiate cede generator.
67 ode generator (Alp Code)
Mov RI, jal bm
Mov R2, jd2
cmp Ri Ro 7
INE LI
ADP Ri R
ymMP 12
Lis mov Ry po
12° mov fdj" pg) ‘
SYMbo/ Table
Toker nome 7
vel]
T
V
@ scanned with OKEN Scanner Grouping of | = Phase. = 7 =
I sementte
Te 2d tay = = A
-—f 5 i —__
ees Wralyzey Parsee Anaiyeey
Se ee eee
es
code
achine _dependes
Bact End 6 Synthesis ene
\
Code eae
Generator OPH
Advantage of Grouping of Phases in Compiler
» By Keeping Same front end and attaching differen!
pack. ends, mhe can produce Compiler for same Source
language indifferent mnachines.
+s And similoaly , by Iceeping different frontends And sum
back ends_one can compile Several different languages
on he same machine
©9 for fix cose
compiler
J
[oompile Te]
windews jos UY
ot Dh pane ends
@ scanned with OKEN Scanner e €-4. fer_cecond CS : .
compite-¢ Compile Java compile -P \
j compile 1c + . =<
Le, 7
A 1 4 .
= :
a : - =
n Pass Shuchure im Compiler
nes 7 —
one complete Scan of ‘Source’ language’ is called
=
pass which includes yeading aninput file ane
toning to oudpub file. +
: ! fe]
2 It is Aifficulp +e compile the source PrGvam imo
in pass as Program may have forward eference,
8> IF JS deseuabie Jo have few Passes in te
Program a3 jt yukes time to read and write
intermediate file-
AD A_+ypicet arrangement for ophmizing tomPpiley
es one pase fe Scanning 4 Parsing another pats
= women analysis Gnd third pase for tole.
Jere and code Oph mization.
TD Fathers affecing number of Passes
1] forward reference
> Oph mization.
1D Compiler an
2? Sora9e_j'm/Jalion
Ne
es __
@ scanned with OKEN Scanner L Ovex the souxe
_ THA Serr
rg One W1e tustee While Second
ao
8 00 er Cnet 08 Fir
s Pass ena
asc ith oo
yy gn see Pass 11 tts be Z)_ Zn fiesr pass j7 soa
2. qaskS Such as fne fr jas u «
efor oon Forward veFe rene a ef definition , nen
labels ing achual Compilation £m IP The symbol tebe
an
Fn Second Pass 44 oes
_— Wore en Parse tre =
i a ee ae see
- OPHMIAHON proces¢
oy pesle than _,mulk-Pass 8] Slower than ingle,
compller Pass Compiler
TI has limited Scope 4] Two pass Compiler
fox _CreahHng varreky of have wide scope fer
ompllers » Creating vanety Of
co pascap campiler- eg Java
@ scanned with OKEN Scanner __ Compiler constructian_Teols___———~ atta
\
_ Specravzed S/u fools used +0 implemenk Varican
Phases of compiler ~~
1] Scanner Generator
2]. Parser Generator
7. yatax- Directed Transtato7 Aaa
3 Automatic Engine Cocle Generator
5] Data Low Eng ne:
1 Scanner Generasory / Parser Genera/er
| SOUE Pa,
CPpeet fication —s| Scanne”” lexical
Of Regular expreBion | Generate Analyzev
Ww
Token streams
2) parser Generalor
Totten strear
Con bem Passer Syntax
Free Grammar Generakr Analyaev
od
V
Passe Tree
Syotex Directed feanslation Engine
Annotated
Done ied > Lntermidiate
Tree engre—s it
Ca-Addsess farm)
@ scanned with OKEN Scanner Seo EEE CPTI
5] Aupomad® Code Jeneratoy -—___
ees eee ree a ee
————pplimized 5] Automate -
code Code Genesatay facing. _codl
E (Peer Taryey mie”
compiler Consisuchor olkits —fhis foolx? Provides
a collection of tools thak are Used 40. generale vane
phases of Cormel/ler.
@ scanned with OKEN Scanner — ere ee
ours al To Semantic ™
lee
= gerne] _
= es Tokent?
—~
— symbol
— | Table a
t
e Fig. Inlerackon Of lextco) Analuzer with Parser
~~ @._whal sin lewear Analyzer 2 Explain’ Role of LA?
: why LA is implemened 23 Seperate phase?
4 :
FE The lerical Anaiyzer iS the first phase of &
Compiler, T4 4 4 iS. av of compiles.
It takes Modified Source Code from languaye
watten In ne form of
sentences. Ty reacl# / scans Source program breaker
ato smatt meaningful pieces called lTexemes.
lexemes are Compalred with pattern 4& generate
Sees of fokens . This Complete process (ss called
Tokenizahon. Th the lexicat analyrer £jnds &
toler invalid jt generate? an error. phe /esuted
analyzer works ClOSY With Syntax analy2er,
Tr reads Character Stream 22M source Cod@, Chew
Preprocesso,s -hat Qre
@ scanned with OKEN Scanner a
e Keng, and Passes yo
le fegel JOE MS SOF OSH Ire yay
7 a>" Gueens a te sy
(Le demands _S $1948 Pralaser aes
wr ca fo demand nex Faia
Analy
es iin
IS Del Nese Zokenty ~
so oamed by
é.
er ie,
| I -
ott ery HERE Ine
See eee
rd the w
ca AIF SPace, Tne Toss
Or oF iblenk
ne, Fabs and newline char fer,
a
ce Fabs and newiing haracterg
Lo also cliscards Comments
i ee Sumbo] lA entities in tre Symbel Jab
ju]_Amebner 1s Co¥rclating oer m fe
7 _copneilen With erdcal Anatyrer may Kee? yoack
pe new fine Character seen, $0 that aline numb
essagea From ge
of Number
- er Can
be assodated With an evroy message,
why, lexical Analyzer js Seperate Phase» _
There are several reasons for Separating fhe analysis
Phase of Compiling jnte texical Analysis and parsing
4. Simple Design 4 The ceparaton of lescal analusis Pom
Syntax offen allows ut to simplify one ox he other
of these Phases. @. 9 & Parser embodying the conven bons tr
Comments and whife spaces-|S Sig nificantly More complex
+Hwn one than can assume comments and wlute sPaccs
F ; ~ co Analy re.
Move complexity imcrease if syntax analyzer & 16 Yee
\s merqed together:
@ scanned with OKEN Scanner @ Efficiency (g jmproved: throvghput increases
"A Separate [exical analyze? atlours fo construsf
a Specialized and PofernHally rnore Shrueal Prt cesso~ Sey
tne task. A large amount Of Hime fs sperk FeAhng Ing
Source pegram and partitioning /t Inlo tokens . sptudb2ed
buttering techniques for reacling jnpub Characters and Proteus
to leer Can cignivicantly speed up the Performance Of a Comp,
Portability ia chanced +
lesdcal qnalyrey
LL ean
jf we masee any changes tu;
modification jy clone in lexical Qnaly28
2-4 Kkeyuorell dre added if toi) not QL ech- 2
design of Syntax analyrer, Ft cof prourdles
Portability when dJexical Analyrey will be Seperat
Phase
Se
ee ee
2 ee
@ scanned with OKEN Scanner quis Pace
<= === Date:
ne folowing for
- ee
: Paes ee ac
a qenntel Analyzer phys ype :
i gd Phase scang Fz >——___
Ho Ue Spreams : © Sjeen
-
a Oe Sheen fable’ 7uped inks fe ne eee eee
bgt LED SOS Ktovs SS Gnd cae
ee
sat TET eTER cide SY GY
+
Ss Te
Agente Analysis * — Statements
Initializes
j@t_° for 3
YX jd
ide | id ES Gagnesy
Zw
jk
Synkaxt Dralgrey cyeahet Fhe PI7Se free from curr
Of the Jeru'cad analy 2er
bh
@ scanned with OKEN Scanner Phage Cheeks jhe Source
P prog ram for Semantic & byrne and gapnbig’ type
rhe Semantic Analys’S
1Ofermation for Ssubsequen! Phas jors__ercamp |
Le cod of type Conversion and other Mods ficaions So
| these jc no action Performed by this Phase.
e : tote Code generatiow
_ _——zntermedsapve Cad penczaloe he an crbStrack machine .
This representation has two ropeshes 2h ft Should
be easy fo produce and It chould 6¢ easy fo
F runsiate into fargek program Fatrowing 1S
F she seguence of code For inlermeol’ le cocls geneeati
fe 4. id) =o
E 2 jdt. <)
[. IL {do de then Jor step
[. 4 idl= id/+ |
f jd2 = id2 +)
I: b Joto strep 3
' Qi Exit
“sy tode opiimizahion §
J
3 Thig§ Phase attempts to improve the inter medrate
: Code, ¢o reguilanh Code will faster yaunning malin
Coda. Here code js apready Ophimired pherefere
catput of Code gerer optimiza Ww/l) be Lame
at Cocle ey generahon,
@ scanned with OKEN Scanner mov id |
A 5 Zensish*Y Normally >
ot _———————_—__—_—_—_——_—-~
assembly Code
i Mov Ro
i CMP Ri
eee gs 7
Ea we Rj
| Ro
Impl)
lz2 Mov idl Ry
Moy jd2 Ro
@ scanned with OKEN Scanner Gnd__lexe mes
Tokens patterns
f * Asewe Token i- A foken is a paix consisting oF
atta bute valk -
& token nama and an oPhonal di
The teen name is an abstrach symbol wepresenhin
a ktad of lexical until: €-9 Park cusar Keyusord 5 :
r Oy asequence of inpub Characker$ clenoting 97 Identifier.
the Joleen names are the inpuk symbols thak the
& Parser processes,
2 Pattern :_ Tt is _qdesertplion of th
-lexemes oF token may teke, Dn Case of Keyword Ab a
token, the pattern js Jusk te sequence of Characters
that form the keyword -
« & Lexeme:- lexeme ['s a sequence Of chactess In te
Courte Program that matthey the pattem for @ token
2 Form that the
{and is_Jelentified by he fesu'cal Qnolyrer a8 an
i Instance Of tha- token.
!
[ Token | Saisie ai peed pee ee aobe era
\f if characters i £ if
L alee Charackers @,1, S¢ ee
Comparison or DoY C= ory= or== =)-
[ en
4 pi O.
ca
letter folvewed by letters
Ov Digits cmap —ounnerdé
Constant
7 u
Zilog 0, 6.02023
number ‘any numeric Consian
liberal Ung thing bub , Suvvounded
pS 2 Cove jumped”
+ AdoliFrn opereche
4 Speaal Smbe]
@ scanned with OKEN Scanner pe is usp
“gore _puffering 18 used to cpeedup the jemc
cess. we fish Menton og 4wG0-Bulfey
10 aw
b eee
Seay wher Jo0k-~ahead on tue
ae inpul scheme. that
(MPU 1g neces
ap we Jou eo
is. lexical anal ay Ft idenhp,
E “Fits Hes alae 7
— ye Kens ‘per weads fre Character ny
>. This 4a. j
L onan ate Sk 7S made lifticust £y the Tad nw,
oe
a offer have Fe 10ele one oY More Charaches beyond hb
e
mp [eeer7e before we con
ne
be sure we hove fue 27 Gh I
we Cane} be sure +e looje at feash one
charac? ahead. Single operators like _ S, Ewltoaad
qlio be ine beginning of a two Characker Operator
- o¥
