Next: Derivation Trees
Up: CONTEXT-FREE LANGUAGES
Previous: CONTEXT-FREE LANGUAGES
-
if
-
reflexive & transitive closure of
- Def. Let
be a CFG. The language generated by G is
- Def. A language L is called context free if there is a CFG G so that L=L(G).
-
is not a palindrome}
Sushil Prasad
Tue Jul 14 11:59:47 EDT 1998