Question

4. Context-Free Grammars and Languages Consider the following context-free grammar G: G: S? 1SS1 S? U U ? 0U U? 0 (a) What language does G generate? (b) Give a rightmost and a leftmost derivation of the string 10001. (c) Draw a parse tree for the string 10001 using a leftmost derivation. (d) Give two examples of strings in \{0, 1\}* not generated by grammar G.

          4. Context-Free Grammars and Languages
Consider the following context-free grammar G:
G:
S? 1SS1
S? U
U ? 0U
U? 0
(a) What language does G generate?
(b) Give a rightmost and a leftmost derivation of the string 10001.
(c) Draw a parse tree for the string 10001 using a leftmost derivation.
(d) Give two examples of strings in \{0, 1\}* not generated by grammar G.

4. Context-Free Grammars and Languages
Consider the following context-free grammar G:
G:
S? 1SS1
S? U
U ? 0U
U? 0
(a) What language does G generate?
(b) Give a rightmost and a leftmost derivation of the string 10001.
(c) Draw a parse tree for the string 10001 using a leftmost derivation.
(d) Give two examples of strings in {0, 1}* not generated by grammar G.

Added by Scott T.

Discrete Mathematics and its Applications

Kenneth Rosen 8th Edition

Chapter 13

Instant Answer

Solved by Expert Sanchit Jain

Step 1

- The string can start with the letter 'U', followed by any string generated by G, followed by the letter 'O'. - The string can start with the letter 'o', followed by any string generated by G, followed by the letter 'n'. Show more…

Show all steps

Thanks for your feedback!

Consider the following context-free grammar G: G: S -> S1S | S1 | ns | UOU | o-n a) What language does G generate? b) Give a rightmost and a leftmost derivation of the string 10001. c) Draw a parse tree for the string 10001 using a leftmost derivation. d) Give two examples of strings in {0,1}* not generated by grammar G.