TC Module 4
TC Module 4
Sß wET*
Eummating ¬- podluehors:
langag LL has CFG, Aen L- {ey has a
CF wrthout e-produehbrs.
Uoit
tss Produehrs.
Eumnabng
A wnit produ etion e a, prod ctbbn e
uhere bott A and B e variabus.
A’B
Steps:
Consider qramnay:
’ FT* F
T Cah be in poduchon
erpand1d in produchn ETi
doo pogsib k wy
Repleeeng it by
This hong shu does notelnnat nt pnducbvw
A’atAaAla
B’ B|hbC
C’ be/bbc.
na B an d C produs Same' bodes, and C-g.
se can wi
B b8/bbB.
: The ampufed qramma ia
SSaAlaB8|a
AaAALaAla
B b8]b8.
A’ a as/a
B sbs| P{bb.
Sol?: Step-l: Ebminate S-e
S’ ASB AB
A’ aAsla laA
8’ Sbs/njbb /sb]bs| b.
Bp-2: Eminat BA.
B’ SbslaAs |a lak|bb) sb| bs< b.
The rammar
S’ Ae[AB
A ’ aAS alaA
B SbS) abga [a Al bbJsb|s|b
Chomsky Noxmal Fm (CNf)
CFG uin wich al pradnd
Pro blems:
Covet he tolboing CFG t cNF:
S’QACa
A ’Bla
B->cles
emove trerm
we must st
8 Remonng CE
B’
fele S’ aACaaAa
AB.
Panong we gut.
B
A
-ela
Rermong
A> a
we get
RauecttaThe qramar
S’.aACalata
Aa
Bc
C’cclc
Podutns hat are CNF arei
ando
Aa, B>c
Prouchu not in NP:
S’ aACala Aa Congider a= Ao(Ao
C’cl. nd c G
S’AACA, and
AaAslaa
|AB ASB S’
S-E Remonhg
E-praubbu
the in
wni ore There
BSbs)A}
bb.
aAs)ai A
Symbol Ss,Staat
Cecle
Aa
P{
T:{a,
CNE innow abo a
DoC=
A%
SAAGA./AAA,
Result.
Aetion
Naw, the modijd CPG ia
A’ aAs|a laA
Produetons in cNE
S ASB
A aAS/aA
Produebbn Aebon
S’ AsB
A’a AS]aA
a= Ao
b
Produebbry that
Poduchy thot ae now
S-’ ASB
B8sl Ao As
Corutcer As=
AS A, ohele A, B, ev
SBo B)
B8,s|Ao A
sB B
Now
G- (v, T, , )
V:{S A, B, Ao, Bo, A), Bg
P
S
StatSynol
8Ao
S.
rei CNE yous
h are hoduesong
Hhat
'B'BB8]
AoJ.
BAoAAB AonA|is
BB A
Ao S
Aebon
etbs Produ ymen
Result
V. ¬B,Ao, whre bA Consid
B|BBloS.
A0AA1s
SOA|]B A
Produetos
not CNF Products
E-productay.
contain not doA CGqiren The dol"
2’|Belolo.
A>oAA
1s
OA|18. S3.
Peoduchry Not ih cUF aei
B BoB8.
A, B, f V
Now al produchong
S’ A, A|B, B
A’1Bo s] AbAy
B’ oAo S|Bo Bi
S: Start symbol
Pracbie
(a|Ac D-G
2. salaf|6 AaBele B’ Aalb.
Grecbach Normal Fom (GNe)
nnon tmpty languag
CFG whgte prducbr and
termal
A ad whue
p mole Sueh a
zeuo mde vaabls.
Btnhg Grebach Nmal Fim.
Normal oum tallhd qinitbach
Problems
Convest t e to lomg CFG to 6NF.
AS/b.
n te . above
SI. There ae no wit 7 E-produtmas
grammar,
to GNE, Fst, we
To convest gn gramay
CNC
it to
Aeed to Con vet
A,= A
Ao A, A
!
A, b.
wotn a
4 (6) tan be
Aj aAo
can be wotn ay
Ao ’ bA
Now, both
Ai bA a
A>aAo lb
S: Stat Ab (stast)
A’ OAA1s
B’ )Be |os D
So(?.
topic ta.coneihrg he above
9rammar to NF
Considen
A Do , D3 : Ao Dy B
D A DuDy : Bo
De B
Now, roie e moduehbrs wth modiNd vatake
Do >
Ds = DDI
(t D-Dy Dy
Da ’0D, (:3o), Do |D( Dy=)
D Dy D,
D, ’0D D|De
D
D ’I D,
Do 0D,1D
Dg D, D
Ds
Ds 6To|1D.) D
o D, D iD,D,
The Grammar GNF.
6: T, P. s)
V:Do D, Da
Du|
Ds ’ DDED1D, D
D 0D, D ! 1D, D
Practia:
I. A BC
C’ CAla
A’A8|b
f
emma foe lomtt Free Langia:
Statement:
Let 1 be a CfL Hhen hire ekizb
eKIsts a constant n
Bueh that 2 any sinng L Hen wt ca)
wote
2: uvo
Provided that the joloohg Cond'tors
onditors ave
are isabued:
) Ivwzl n (mtddle portin kong)
Proef
grammar h CNE ach
that
m yaablus Jntesmal
nodes
nody C
Any parSe tree
tre whose longut path q Lengs m
(us dos no 2 ecar Z b to long
/A k- ng q longut pat,
Ak
uAy when î 0
uwy
suty when i>o
uvALxy >uvway
N
to no. 1
bs and no. bs ohould Se
Prerous iondit
Nouw,
L3(: L L
conattratb
CEL ae closed wndir
3. kleen Closre (star):
Context el,
Now
fhuony , we haue