0 votes 0 votes Construct an LL grammar for the language L (a*ba) ∪ L (abbb*). Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar context-free-language + – Naveen Kumar 3 asked Jun 25, 2019 Naveen Kumar 3 276 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes S--> ba | aA A-->aB | bC B-->aB | ba C-->a | bD D--> bD | $\epsilon$ sakharam answered Nov 6, 2019 sakharam comment Share Follow See all 0 reply Please log in or register to add a comment.
