1,249 views

2 Answers

Best answer
12 votes
12 votes

For a given regular language , we can have both regular and non regular (CFG or CSG) grammar..On similar line , for a given CFL , we can have a CFG and a non CFG too..

Hence there is a possibility that a CFG is equivalent to  a non CFG in this context.Hence 1st statement is correct..

Now 2nd and 3rd statements we have to consider the fact that if a grammar is left and right linear , then it is not regular..So we can say since S --> ab | abc gives a regular grammar[Also if we follow the basic rule of Type 3 grammar we can arrive at the conclusion which is every production in regular langauge should be V --> T* + T*V [Right linear] or V --> T* + VT* [Left linear] but not both.Hence statement 2 is false..

But in 3rd statement in S --> aA the variable is in right side and in S --> Bb the variable is in left most side of RHS of the production.Hence it is both left and right linear and hence not regular also..It is a linear grammar..

Hence A) is the correct answer

selected by
0 votes
0 votes
I think 2 only .

1st one is wrong . for CFG equivalent non CFG is not possible
2 is correct
3 we cannot say anything as we need productions of A and B .

Related questions

1 votes
1 votes
1 answer
2
Kaluti asked Nov 9, 2017
527 views
In a hash table of size 6, currently the locations 0, 2, 4 and 5 are occupied. The probability of a new record going into location 1, with a hash function resolving colli...
3 votes
3 votes
2 answers
3
shipra tressa asked Aug 17, 2017
607 views
Standard books required for linear algebra and calculus for gate syllabus ?
1 votes
1 votes
0 answers
4
Ashish Roy asked Sep 7, 2017
367 views
What is the language accepted by the given Grammar ?S - aSa / bSb / a / b