Question

For each of the following, construct context-free grammars that generate the given set of strings. If your grammar has more than one variable, we will ask you to write a sentence describing what sets of strings you expect each variable in your grammar to generate. For example, if your grammar were: S → EO E → EE CC 0+ EC C+01 We would expect you to say “E generates (non-empty) even length binary strings; O generates odd length binary strings; C generates binary strings of length one." (a) [4 points) The same set of strings as in 5c—the set of all binary strings that contain at least one 1 and at most two O's. (b) [4 points] {1m0n1m+n: m, n >0} (c) [4 points) Binary strings with an odd number of Os.

Answer 1

a set all binary strings that contain at least One 1 and at most A BABIA S -> 1 ABABAL ABIA IBIA BA > 1ALE ole A B > E b on (im のたり min 7,0) s- ISI | Ail OAI D C o dd numbel of o's s → IS IOA A → IA IOS) *2;