0

3.5kviews

2. Consider the following grammar G=(V,T,P,S), V={S,X}, T={a,b} and productions P are S-> aSb | aX X->Xa|Sa|a Convert this grammer in Greibach Normal Form (GNF).

written 7.3 years ago by teamques10 ★ 70k

•   modified 5.2 years ago

theory of computation

ADD COMMENT FOLLOW SHARE EDIT

1 Answer

0

414views

written 7.3 years ago by teamques10 ★ 70k

SOLUTION:

Here, S->aSb|aX

X->Xa|Sa|a

Put S->aX

X->Xa|aXa|a

Let A->a and X->x

X->xA|axA|A

Which is in G.N.F

ADD COMMENT SHARE EDIT