Discussion
Which grammar type generates context-free languages ?
Answer: C
Context-free languages are generated by Type 2 grammars.
In a context-free grammar every production has a single non-terminal on the left, A → α, so A can be rewritten whatever surrounds it. These are Type 2 in the Chomsky hierarchy and are accepted by pushdown automata.
Type 0 grammars are unrestricted and generate recursively enumerable languages. Type 1 grammars are context-sensitive. Type 3 grammars are regular.
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