Unit 2: Context Free Grammars
Context Free Grammars & Parse Trees
13 min read · 0% complete
Explanation
A grammar is a set of rules that generate strings of a language.
A parse tree shows how a string was built from those rules.
Key exam points
- CFG = (V, T, P, S)
- Ambiguity is a property of the grammar
- CYK needs CNF and runs in O(n^3)
Previous year questions
Convert the given CFG into Chomsky Normal Form.
2024 · 10 marks
Practice quiz
CYK algorithm requires the grammar in: