Purpose
This homework provides practice in working with different aspects of context free languages: their generators and their recognizers. It also overs the pumping lemma for regular languages.
Background
For this assignment, you should - design a grammar for a given language - design a pushdown automaton for a given language - infer the language of a given grammar - construct a parse tree for a string under a given grammar - argue about the ambiguity of a grammar - use the pumping lemma to argue about the regularity of a language
The Problem Set
The problems are in hw2.tex which is to be compiled using a LaTeX compiler.
Submission
There are 2 parts to this assignment.
2.1 Solving the Problem Set
This is a team submission on GitHub and contributes to your Submission Score.
2.2 Feedback
Grading
Your submission will be graded for correctness of your solutions. Files that do no compile cannot be graded.
Your individual score in this homework is the product of your Submission Score and Team Factor.
Discussion
Please use the following avenues:
discuss with your buddy, the discussion forum on LMS, discuss with your peers, consult with course staff.
