1. Write a grammar that generates strings of 0\'s and 1\'s such that each block
ID: 3535595 • Letter: 1
Question
1. Write a grammar that generates strings of 0's and 1's such that each block of 0's is followed by as many 1's.
2. Write a grammar that generates string over{a,b,c} where each string has at least two consecutive c's in them.
0. S--> E 4. T-->F*T
1. E-->E+T 5. T-->F
2. E-->E-T 6. F--> (E)
3. E--> T 7. F-->id
What string came from this sequence of derivatives? It should be obvious whether this is a left drivation or a right derivation) 0 3 4 6 3 5 6 3 5 7 4 7 4 7 5 7 <--
Explanation / Answer
www.scribd.com/doc/43052439
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.