Compiler Construction CS606 assignment no 2 spring 2012

[sanam]

Consider the following grammar;

S ―> XaYb
X ―> bXc | b
Y ―> dYa | d

Find the first sets for each non-terminal of the given grammar.



Question No 2: Marks 10

Consider the following grammar and construct the corresponding parse tree for string “aabbabab”.

S ―> aSSb | bSSa | ε