Consider the following CFG grammar, where the terminals are {x,y,z, w} and the non- terminals are...

 

Transcribed Image Text:

Consider the following CFG grammar, where the terminals are {x,y,z, w} and the non- terminals are {S, X, Y, Z, W) and s is the starting symbol. S X X Y Y' Z YZ | WYZ y' I E y' | E ZE W X W a- Is this grammar suitable to be parsed using the recursive parsing method? Justify your answer. b- Compute the FIRST and FOLLOW set of all non-terminals. Is this grammar LL(1)? Why? Explain. c- Construct the correspondent parsing table using LL(1) method. d- Show the stack and the input when parsing wyy$ Consider the following CFG grammar, where the terminals are {x,y,z, w} and the non- terminals are {S, X, Y, Z, W) and s is the starting symbol. S X X Y Y' Z YZ | WYZ y' I E y' | E ZE W X W a- Is this grammar suitable to be parsed using the recursive parsing method? Justify your answer. b- Compute the FIRST and FOLLOW set of all non-terminals. Is this grammar LL(1)? Why? Explain. c- Construct the correspondent parsing table using LL(1) method. d- Show the stack and the input when parsing wyy$