InterviewSolution
Saved Bookmarks
InterviewSolution
| 1. |
Find context-free grammars for the language l={anbmck :k≠n+m} (with n ≥ 0, m ≥ 0, k ≥ 0). |
|
Answer» A language is context-free if it is generated by a CFG. For compactness, we write S → 0S1 | ε where the vertical BAR means or. Let P be language of palindromes with alpha- bet {a,b}. One can determine a CFG for P by FINDING a recursive decomposition.hope it helps you |
|