For each of the three EBNF grammars below 1. Determine the Nullable, Starter, and Follow sets for the grammar nonterminals. 2. Identify all choice points in the grammar, and for each choice point determine the Predict sets. 3. Determine whether the grammar meets the LL(1) condition. In these grammars, capital letters represent nonterminals, lowercase letters represent terminals, and is the empty sequence. Write your solutions on this handout, and add your name at the top. If you need more space, staple additional paper behind this page, add your name on each sheet, and identify which question you are answering.

(a) S ::= A B c

A ::= a B |

B ::= b |

(b) S ::= A $

A ::= a A x | B

B ::= b B x | D

D ::= d D x | f

(c) S ::= A c

A ::= a A* b | b

Can someone please go through these questions ??