I know that each regular language can be generated by a CFG.This makes, in one sense at least: context-free languages more general than regular languages.Are there known results about the 'complexity' of regular languages in the CFG context? For example, is it true that every regular language can be generated by an unambiguous LL(1) grammar?  Or is something similar true?The general question above comes from the attempts I made to build a 'simple' grammar generating $L=\{(ab)^i|(ba)^i : i\geq 0\}$.None of the grammars I could build were 'simple'.
Complexity of CFG grammar for a regular language
formal languages;regular languages;context free