Theory of Computation - Old Questions

11.  Define Context Free Grammar. Given the following CFG.

S 0AS | 0, A → SIA| SS | 10

        For the string 001001100, Give the left most and right most derivation and also construct a parse tree

8 marks | Asked in 2067-II