I made a right-linear grammar from a regular expression:The alphabet is:$ = \{a, b, c\} $Regular expression:$r = cc^{*}(ba)^{*}bb$My solution, it seems a little too short like I'm leaving something out. Maybe someone can see where I went wrong on the right-linearity:$ S \to cA $$ A \to b a A | B | cA $$ B \to bb $
Regular Expression as basis for creating this grammar
formal languages;automata;formal grammars;regular expressions
$A \rightarrow ba \mid A \mid B \mid cA$ under this $bababaccc$ is also legal You could try something like this...$S \rightarrow cS|cA$$A \rightarrow baA|B$$B \rightarrow bb$