300 views
0 votes
0 votes
L= a*b*

Grammar associated with this language is a Type 3

S---> aS/A

A--->bA/€

Now we know that Type 1 Grammar is Non Contracting Grammar

Here A---> € is a Contracting production

And only S---> € is allowed in Type 1

 

And if a grammar is not type 1 how it can be type 3 ?

 

Please help

1 Answer

0 votes
0 votes
grammar when not cleaned ( i.e removing null production, unit production , non usefull symbol-(symbols that can not be reached by start symbol and sybol that do not generate any terminal symbol) is deceiving in a sense that if the grammar generates a language that accepts Empty string than it can be written as

S->S/E

here S is language except from epsilon. but when null production is in between grammar it generates cofusion and its not easy to deduce the language generated by that grammar.

coming to the point of type 1 and type 3. not all type 1 grammar are type 3(beacuse if it were then all the REL were regular , so its better to say some type 1 are type 3) but all type 3 are type 1( as all regualr are REL )

Related questions

0 votes
0 votes
0 answers
3
eyeamgj asked Aug 27, 2018
201 views
https://gateoverflow.in/80586/gate1987-2fIS THERE NEED TO KNOW POOF ?IF YES THEN GIVE ANY EASY PROOF...
0 votes
0 votes
0 answers
4
eyeamgj asked Aug 25, 2018
140 views
https://gateoverflow.in/957/gate2003-70CAN THIS CASE GIVEN IN THIS EXAMPLE CAN BE SIMULATE IN 3-4 MINUTES IN EXAM .....??