.. _Grammars1:

.. raw:: html

   <script>ODSA.SETTINGS.DISP_MOD_COMP = true;ODSA.SETTINGS.MODULE_NAME = "Grammars1";ODSA.SETTINGS.MODULE_LONG_NAME = "Introduction to BNF grammars - Part 1";ODSA.SETTINGS.MODULE_CHAPTER = "Grammars"; ODSA.SETTINGS.BUILD_DATE = "2016-09-25 20:47:43"; 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 1 (M 2/1/16)
============================

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

Topics of the day:

  1. Syntax versus semantics
  2. Terminology of grammars
  3. Derivations and parse trees
  4. Lexical structure versus phrase structure

The review problem set for today contains four review problems.

This problem is about building a parse tree given a grammar and a string.

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

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

This problem is about determining whether a given string can be
generated by a given grammar.

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

RP 1 part 3
-----------

This problem is about identifying properties of all of the strings in
a language defined by a given grammar.

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

RP 1 part 4
-----------

This problem is about precisely characterizing the whole language
generated by a given grammar.

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