What is the highest type number that can be assigned to the following grammar?
$$S\to Aa,A\to Ba,B \to abc$$
Option C Type 2 grammar
It is context Free grammer which is type 2 grammer beacuse here Non Terminal produce Terminal as well non terminals ie NT ---> T/NT.
Why not type 3 beacuse it not producing Non terminal to terminal only. (S→Aa,A→Ba,B→abc).
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.
both C and D
given grammar is left linear grammar .and every left and right linear grammar is regular.and reguar grammar is colled type 3 grammar.
The only Language represented by this Grammar is L = abcaa.
Hence regular, hence Type 3.