Discussion
What is the Chomsky hierarchy ?
Answer: B
The Chomsky hierarchy is a classification of formal grammars and languages.
Noam Chomsky (1956) arranged grammars in four nested types by how restricted their production rules are: Type 0 unrestricted (recursively enumerable), Type 1 context-sensitive, Type 2 context-free, and Type 3 regular. Each type matches a class of automaton, from Turing machines down to finite automata.
It does not classify programming languages, although they are usually specified with context-free grammars. Nor does it classify algorithms or data structures.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development