What is the highest type number that can be assigned to this following grammar: S→Aa, A→Ba, B→abc
What is the highest type number that can be assigned to this following grammar: S→Aa, A→Ba, B→abc Correct Answer Type 3
Above grammar generates string abcaa.
Type-3 or a regular grammar is a formal grammar that is right-regular or left-regular, given grammar is left-linear regular grammar hence it's a type-3 grammar.
মোঃ আরিফুল ইসলাম
Feb 20, 2025