.. _Grammars2:

.. raw:: html

   <script>ODSA.SETTINGS.DISP_MOD_COMP = true;ODSA.SETTINGS.MODULE_NAME = "Grammars2";ODSA.SETTINGS.MODULE_LONG_NAME = "Introduction to BNF grammars - Part 2";ODSA.SETTINGS.MODULE_CHAPTER = "Grammars"; ODSA.SETTINGS.BUILD_DATE = "2017-01-02 10:14:38"; ODSA.SETTINGS.BUILD_CMAP = false;JSAV_OPTIONS['lang']='en';</script>


.. |--| unicode:: U+2013   .. en dash
.. |---| unicode:: U+2014  .. em dash, trimming surrounding whitespace
   :trim:


.. This file is part of the OpenDSA eTextbook project. See
.. http://algoviz.org/OpenDSA for more details.
.. Copyright (c) 2012-13 by the OpenDSA Project Contributors, and
.. distributed under an MIT open source license.

.. avmetadata:: 
   :author: David Furcy and Tom Naps


============================
Grammars - Part 2 (W 2/3/16)
============================

RP 2 part 1
-----------

Topics of the day:

  1. Infinite languages and recursion
  2. Ambiguous grammars
  3. Operator associativity


The review problem set for today contains four review problems, the
first three of which refer to the same grammar.

This problem is about determining how many parse trees a given string
has in a given grammar.

.. avembed:: Exercises/PL/RP2part1.html ka
   :module: Grammars2
   :long_name: RP set #2, question #1
   :points: 1.0
   :required: True
   :threshold: 1.0
   :exer_opts: JXOP-debug=true&amp;JOP-lang=en

RP 2 part 2
-----------

This problem is again about determining how many parse trees a given string
has in a given grammar.

.. avembed:: Exercises/PL/RP2part2.html ka
   :module: Grammars2
   :long_name: RP set #2, question #2
   :points: 1.0
   :required: True
   :threshold: 1.0
   :exer_opts: JXOP-debug=true&amp;JOP-lang=en

RP 2 part 3
-----------

This problem is once more about determining how many parse trees a
given string has in a given grammar.

.. avembed:: Exercises/PL/RP2part3.html ka
   :module: Grammars2
   :long_name: RP set #2, question #3
   :points: 1.0
   :required: True
   :threshold: 1.0
   :exer_opts: JXOP-debug=true&amp;JOP-lang=en

RP 2 part 4
-----------

This problem will help you discover ambiguities in grammars as well as
convince yourself that a grammar is not ambiguous.

.. avembed:: Exercises/PL/RP2part4.html ka
   :module: Grammars2
   :long_name: RP set #2, question #4
   :points: 1.0
   :required: True
   :threshold: 1.0
   :exer_opts: JXOP-debug=true&amp;JOP-lang=en