in Theory of Computation
274 views
0 votes
0 votes
Construct an LL grammar for the language L (a*ba) ∪ L (abbb*).
in Theory of Computation
274 views

1 Answer

0 votes
0 votes
S--> ba | aA

A-->aB | bC

B-->aB | ba

C-->a | bD

D--> bD | $\epsilon$

Related questions