Show that the grammar satisfies the two requirements for predictive parsing (it does, you just need to prove it).

Consider the following EBNF grammar for a very simple programming language S (statmnt) assnmt | ifstmt | do | inout | progcall ident exprsn; l comprsn @ {statmnt} [% {statemt }] & D fstatemt U comprsn E iosym ident, ident\; program statemt- ifstmt do:- inout: osym- progcall:- comprsn exprsn- factor- oprnd- opratr- ident- char- int etter digit bool- C program G (oprnd opratr oprnd) factor+ factorh oprnd oprnd ) integer | ident | bool | (expr) letter (char letter | digit digit (digit) The tokens are: SI D U E ROCGWXYZO1TF.~@%&,()+"A Non-terminals are shown as lowercase words Note that the following characters are NOT tokens (they are EBNF meta-symbols) 1 ) Consider the following EBNF grammar for a very simple programming language S (statmnt) assnmt | ifstmt | do | inout | progcall ident exprsn; l comprsn @ {statmnt} [% {statemt }] & D fstatemt U comprsn E iosym ident, ident\; program statemt- ifstmt do:- inout: osym- progcall:- comprsn exprsn- factor- oprnd- opratr- ident- char- int etter digit bool- C program G (oprnd opratr oprnd) factor+ factorh oprnd oprnd ) integer | ident | bool | (expr) letter (char letter | digit digit (digit) The tokens are: SI D U E ROCGWXYZO1TF.~@%&,()+"A Non-terminals are shown as lowercase words Note that the following characters are NOT tokens (they are EBNF meta-symbols) 1 )