Give a context-free grammar that generates the language
A = {a^i b^j c^k | i=j or j=k where i,j,k >= 0}
Is the grammar ambiguous? Why or why not?
Intro. to TOC Sipser 2.10 (international edition) 3.10 (US ed.)
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
0
|
|
||||||||||
|
closed as too localized by Robin Chapman, Qiaochu Yuan, José Figueroa-O'Farrill, S. Carnahan♦ Aug 2 2010 at 23:30 |
