2,146 views
1 votes
1 votes

Consider the following right linear grammar.

S->aA/abc

A->aA/bB/a

B->bB/cC/b

C->cC/c

Find left linear grammar is equivalent to the above right
linear grammar?
 

2 Answers

0 votes
0 votes
IS it,

S->Aa

A->Aa/Bb

B->Bb/Cc

C->Cc
0 votes
0 votes
$S \rightarrow Aa \ | \ Bb \ | \ Cc \ | \ abc$

$A \rightarrow Aa \ | \ a$

$B \rightarrow Bb \ | \ Ab$

$C \rightarrow Cc \ | \ Bc$

Related questions

0 votes
0 votes
0 answers
1
VS asked Sep 5, 2017
1,066 views
Can we directly convert a given Left linear regular grammar to machine ?orFirst convert Left linear regular grammar to Right linear regular grammar and then to machine .h...
0 votes
0 votes
0 answers
2
Svvv asked Sep 14, 2017
476 views
7 votes
7 votes
2 answers
4
pC asked Jul 23, 2016
6,452 views
How to convert a Regular Expression to Left Linear Grammar ?Eg : (0+1)*00(0+1)*