First-Follow-Predict-LL(k) recursive descent, parser-LL(k) parse table Problem 1) given the following LL(1) Grammar: where NT = {S, B, E, X} , T = { {' }'/ begin','end','WORD','\begin', \end, '\WORD'}...

Course Name :Compiler Construction and programming languages

Problem 1) given the following LL(1) Grammar :

Assignment in the  picture

Extracted text: First-Follow-Predict-LL(k) recursive descent, parser-LL(k) parse table Problem 1) given the following LL(1) Grammar: where NT = {S, B, E, X} , T = { {' }'/ begin','end','WORD','\begin', \end, '\WORD'} and S is the start symbol 1) S- XS 2) s- 2 3) B → \ begin{ WORD} 4) E → \ end{ WORD} 5) х —BSE 6) x → {S} 7) x → WORD 8) x - begin 9) х — еnd 10)X →\ WORD 1) Compute FIRST, FOLLOW, PREDICT sets. 2) construct the top-down predictive parser. 3) construct the LL(1) parsing table. 4) Parse the following input: "{\ begin{WORD} \end{WORD}}S" using predictive parser. 5) Parse the following input: "{\ begin{WORD} \end{WORD}}S" using LL(1) parsing table.