1. Engineering
  2. Computer Science
  3. 2 let ta b c define contextfree grammars for the...

Question: 2 let ta b c define contextfree grammars for the...

Question details

2. Let T-{a, b, c]. Define context-free grammars for the following sets of strings over T as the set of terminals a) all strings that contain abc as a substring; (b) all strings with at least one a and at least one c such that the first a is before the last c (so that e.g. abbc and bcabc are derivable but be and cbcba are not); (c) all strings of the form (ab)c+2 (so e.g. abababeccce is derivable).

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution