Next:
Exercise 4.
Up:
Final-2003
Previous:
Exercise 2.
Exercise 3.
We consider the alphabet
= {
a
,
b
} and the grammar
G
below. Let
L
be the language generated by
G
over
.
G
Give a grammar
G'
generating
L
{
} and with
no
-productions, that is
no
rules of the form
X
, where
denotes the empty word.
If
L
is regular then give a regular expression for
L
otherwise tell whether
G'
is anbiguous or not.
Answer 3
Next:
Exercise 4.
Up:
Final-2003
Previous:
Exercise 2.
Marc Moreno Maza
2004-12-02