How to evaluate a Kleene's Closure through CFG and attribute grammars
Any &quot;interesting&quot; regular expression (i.e., one that includes Kleene star) represents an infinite set. Thus to &quot;calculate the set of all strings&quot; won't work so well. In a sense, the regular expression is a compact description of the language. What other kind of description do you expect to construct?
It is rather easy to construct regular expressions that represent very complex languages, that the reader needs to descypher to make sense of it.