Sipser 2.1

Read Sipser § 2.1

  1. True or False: Any regular language can be generated using a context-free grammar
  2. True or False: Any context-free language can be generated using a finite automaton.
  3. Give a context-free grammar G that recognizes language A = {w | w in {0,1}* and w starts and ends with the same symbol}.
  4. Is the grammar you constructed in the previous problem ambiguous? Explain why or why not.
css.php
The views and opinions expressed on individual web pages are strictly those of their authors and are not official statements of Grinnell College. Copyright Statement.