In the Dragon book (Aho, Sethi, Ullmann) there is one exercise I don't get.

Chapter 2, Exercies: 2.1
Given the context-free grammar $$S \to S S + \mid S S * \mid a$$ Task: Show how the signs aa+a* can be produced from this grammar.

I understand the grammar, $S$ can have the form $S S +$… and so on. But I don't know what I'm supposed to do in this task. Sadly I can't find any solutions on the web.


migrated from cstheory.stackexchange.com Jan 23 '13 at 15:19

This question came from our site for theoretical computer scientists and researchers in related fields.


$$\begin{align*} S \Rightarrow & SS* \\ \Rightarrow & SS+S* & \text{(leftmost derivation )} \\ \Rightarrow & aS+S* \\ \Rightarrow & aa+S* \\ \Rightarrow & aa+a* \\ \end{align*}$$


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.