MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -Type 3 Grammar is known as Regular Grammar. Regular languages are those languages which can be described using regular expressions. These languages can be modeled by NFA or DFA .

Detailed explanation-2: -Finite automata generate or model regular languages. This means that regular languages can be described by a simple state machine diagram. A finite state machine, M, M, M, describes a given language, L L L.

Detailed explanation-3: -Context free grammar is called Type 2 grammar because of hierarchy. Explanation: Chomsky hierarchy decide four type of language :Type 3-Regular Language, Type 2-Context free language, Type 1-Context Sensitive Language, Type 0-Unrestricted or Recursively Ennumerable language.

Detailed explanation-4: -(1) Regular grammars (type 3-languages). (2) Context-free grammars (type 2-languages). (3) The recursively enumerable languages or r.e. sets (type 0-languages). (4) If time permit, context-sensitive languages (type 1-languages).