(a)
[source]
(b)
[source] (c)
[source]
(d)
[source]
(e)
[source]
(f)
[source]
(g)
[source]
(h)
[source]
(i)
[source]
2.3.2
[source]
2.3.3

2.3.4
[source]
2.3.5 In each case an equivalent finite state automaton can be constructed. The finite state automaton will have a state corresponding to each nonterminal symbol.
The state corresponding to the start symbol is designated as an initial state.
The finite state automaton has an additional state designated as an accepting
state. For a production rule of the form A
xB the finite state automaton has
a sequence of transitions that starts at the state corresponding to A, ends at the
state corresponding to B, goes through some new intermediate states, and
consumes x.
A production rule of the form A
x is considered in a similar manner. The
only exception is that the sequence of transition rules is assumed to end at the
accepting state.
The state corresponding to the start symbol is designated as an initial state.
The finite state automaton has an additional state that is designated as a start
state. For a production rule of the form A
Bx the finite state automaton has
a sequence of transitions that starts at the state corresponding to B, ends at the
state corresponding to A, goes through some new intermediate states, and
consumes x.
A production rule of the form A
x is considered in a similar manner. The
only exception, is that the sequence of transition rules is assumed to start at the
initial state.
finite state automatonCan be shown by induction.
Ø is accepted by
[source]
{
} is accepted by
[source]
{a} is accepted by
[source]
L1(M 1)
L2(M 2) is accepted by
[source]
L1(M 1)
L2(M 2) is accepted by
[source]
(L(M ))*
[source]
regular setomitted here