ContextFneeGramment

Grammer Notation for recursive

definition of language
for creating a
programming language
write context free Grammer
in BNF form
SENTENCE NOON PHRASE VERB
PHRASE
Noon PHRASE ADJECTIVE NOON PHRASE
11 NOUN
Noun boy fhouse ele
ADJECTIVE 7 little

Lpm E C 80,13 1 WR w chkiy

2PAC is
or
Regular
not
p e p OPO Mogensen
P o p sp
P I ay
faleardromes

v 41IEE.us
L T terminal

II Idf'Fgmendesey
Lamb In 03
T a b
V p S P

P apb
P E P

Derivation

for a CFG G V x.BY C GUT

it AC V
LAB Ayp Derivation in a
tinghesiety
if yep
Derivation Sequence

suppose 4 Ls xz more
Lee
o_O or
2 He seeps

reflexive transitive closure of

C
 C ex of

Lca w ETH s w

Def A language LEE eis CFL

g
F a CFG of a t L Lay
PT we a.BY aleg s w

o
p E s
b b Pa a s
p
B w
S a B at
s
s b A
A Ftw
B Sbs a sH
A
SIR A at as I BAA
Be b
bsl ABB

iy nun induction on Iwf when

we L and throne WELLED
L E hCG
own induction on deniuatin
iy wt
Steps where Lch and
WEL
prove tea EL
 I L

Topnoe for WET

weffT aCw7 sC

glDs
A w
b
iff Itaced sW 1
way
we B w aHH
too g iff yUd

induction on 101
if
if Kol a I A a B b

Assure IH E k l True

To thou
w awe 141 1 1
Iwf q w b wz w S

using induction hypothy

aw _w
S aB
s BA bw w