// programming language compilation

//compiler

//use the pictures to answeer

Q: Consider the following grammar:

SaS|Ab

AXYZ|

XcS|

YdS| ZeS

a) Find the first and followset for each terminal and non-terminal symbol in the above grammar.

//answeer in the table (same of the picture )

b) Construct the LL(1) parsing table to the above grammar.

//answeer in the table (same of the picture )

c) Is the grammar LL(1) ? Why ?

Consider the following grammar: SaSAbAXYZXcSYdSZeS a) Find the first and follow set for each terminal and non-terminal symbol in the above grammar. Your Solution: b) Construct the LL(1) parsing table to the above grammar. c) Is the grammar LL(1)? Why