edited by
17,396 views
18 votes
18 votes

What is the highest type number that can be assigned to the following grammar?

$$S\to Aa,A\to Ba,B \to abc$$

  1. Type 0
  2. Type 1
  3. Type 2
  4. Type 3
edited by

8 Answers

1 votes
1 votes

D is the correct option because it preserves the form A->aB/Ba/a where A,B are set of Vertices and a is set of terminals.

0 votes
0 votes

given grammar is left linear grammar .and every left and right linear grammar is regular.and reguar  grammar is colled type 3 grammar.

0 votes
0 votes

The only Language represented by this Grammar is L = abcaa.

Hence regular, hence Type 3.

Option D

Answer:

Related questions

33 votes
33 votes
4 answers
1
10 votes
10 votes
1 answer
2
34 votes
34 votes
7 answers
4
Kathleen asked Sep 22, 2014
20,214 views
$$S \to aSa \mid bSb\mid a\mid b$$The language generated by the above grammar over the alphabet $\{a,b\}$ is the set of:all palindromesall odd length palindromesstrings t...