Course Content

Other Courses

Tribhuvan university > CSIT - 2065 Syllabus > Compiler Design and Construction > Old Questions > 2068

Compiler Design and Construction - Old Questions

Syllabus Notes Old Questions Unit Wise Questions Question Bank

4.  Consider the following grammar:

            

a.       Eliminate Left recursion.

b.      Compute FIRST & FOLLOW for the symbol in the grammar.

6 marks | Asked in 2068

Given grammar,

a) Removing left recursion of the given grammar;

    S → (L) | a

    L → SL'

    L' → ,SL' | ∈

b) Now, the FIRST and FOLLOW for the given symbols are:

Non-terminals

FIRST()

FOLLOW()

S

{(, a}

{$, , , )}

L

{(, a}

{)}

L’

{, , ∈}

{)}