Java Python Homework Assignment 3:
COMP 455: Models and languages of Computation
DEADLINE: 11:59 P.M., Wednesday, Oct 16, 2024
Problem 1: (16 points; 4 parts) Design CFGs for the following languages. Follow the format presented in the class for specifying CFGs.
1.1 (4 points) L consists of all the strings over the alphabet {0, 1} which contain at least three 0’s or at least two 1’s.
1.2 (4 points) L = {w010w ′ | w, w′ ∈ {0, 1}*and |w| = |w ′ |}
1.3 (4 points) L is the language over the alphabet {a, b, c} given by L = {a i b j c k | i = j ri = k, and i, j, k ≥ 1}.
1.4 (4 points) The alphabet is {a, b, c, d} and L = {a nb mc md n | n, m ≥ 0}
Problem 2: (10 points; 4 parts) Let w = (())()(). Consider the grammar:
S → SS | (S) | ()
2.1 (4 points) Construct a parse tree whose yield is w.
2.2 (2 points) G