Lec 15.pdf

Non

determinism

At

level At level

leftmost

in

of

of

derivation

CFG

rules variables In

desirable

sentence'al form

a

the always refleee at every step

Not needed

X most

left

variable

Parsetrees DEI

Representation

pictorially

kty

E E

parse trees

I

I n

E

l

I

l

y frontier

E

eild

E

T

t

I

Ext E

E

f

relyIZ

E I

Et E

I

l

2

uty

z

is the trees of Hanse derivation whose

expression we

z

I

E

1

derivations

of

did

I

I

did

Expression is obtained by Conatinabing leaves from left to

right

A tree Pansetree

tree

rooted al A S tree

A

TE

of disgeild tree

A

A

A

an

in

a

q

proofs

yeild isof of height A 5 R

is

Tete

I

for

k

an

A

tree

2

1

A

ftp.F.am So

every A

A

Up xp

nite

nine seem

an

MEP

7

em

K D

for for

assurfeii

ons

k

weight

is true

A

mean iy

niet

xp 2

igniEV X he

Alise

M

tree 7

a

ki he

if i part of

a

j hqttfkTeeniFee from nj

ffmiume.ee

on induction derivation

may

EAT

length

Z

E

E E

xp

E

ME

the

z

of

I

l

l

t

Et

I

n

l

I

l

I

l

l

l

z

TT y

2 I 7

A

ambiguous if 2

CFG G is

LCG

WE

parse Find

I

I

n

I

y Beef

E

l

l

E

E

a

7

G

EKE

I

w

7

G

ETE

IE II

risk

KE lI E LIKED

ET ET

E E

Ei I

is

f't

something Thet

cant be derided

further

My

HEY I

unambiguous

Ifield'faFons

Hyle E

diff

two

for

trees

CFG

E

7

I

I

z

I

l

s

n

2

y

anbmcmdmlm.mx If

L

U

ambmcmdnlm.my

Sik

S

A B

S

A B

a

eBay Srs

Sz

BSE I

Sz ambiguity

q

is

byhege

ambiguous which

property

Cd

asad

Sz

This

Ab lab

is

i

e

beg

inherently

If

grammar

II

btw

Psk

Any RL

is

a

and CFG G a

bTYe

EFG

unambiguous

of

Relation

property of 6

for every

Pnef

we

step

can

derivation

define so that

grammar minute

we

coerced

to

theft

of gnaumer RL original REG of

set all R

of

E

CFL

9

feet

All

of

Lefty

single

a

the

got

tho

ioill

Also

in DFA

transition

DFA

prove we got

Chomsky heiranchy