Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Learn theory of computation
·
Module 5
Context-Free Grammars and Languages
1
Understanding CFG Components
Define the formal 4-tuple structure of a Context-Free Grammar (CFG).
2
Derivations in CFGs: Leftmost & Rightmost
Construct leftmost and rightmost derivations for strings using a given CFG.
3
Parse Trees and Ambiguity
Construct parse trees from derivations and use them to identify grammatical ambiguity.
4
Designing Context-Free Grammars
Design CFGs for key context-free languages, such as balanced parentheses and palindromes.
Useless Symbol Removal in CFGs
Apply algorithms to remove useless symbols (non-generating and unreachable) from a CFG.
6
Eliminating ε- and Unit Productions
Apply algorithms to eliminate ε-productions and unit productions from a CFG.
7
Chomsky Normal Form Conversion
Convert any CFG into an equivalent grammar in Chomsky Normal Form (CNF).
8
Regular Grammars and Finite Automata Equivalence
Define regular grammars and prove their equivalence to finite automata.
Previous module
Properties and Limitations of Regular Languages
Next module
Pushdown Automata