$1.$ Problem

A programmer is provided with the following two grammars:

Grammar $$A$$

S$->$qABC

A$->$a $|$ bbD

B$->$ a $|\backslash$epsi

C$->$ b $|\backslash$epsi

D$->$ c $|\backslash$epsi

Grammar $$B$$

S $->$ S A $|$ A

A $->$ a

He is required to design suitable parsers for the two given grammars. Your task is to help him

design appropriate parsers.

$2.$ Deliverables

You need to answer the following. Each question has equal weightage:

i$.$ Show that the grammar $$A$$ is LL$(1)$ or not $($without constructing parsing table$).$

ii$.$ Show that the grammar $$B$$ is SLR$(1)$ but not LL$(1).$

iii. Construct parsing table for grammar $$A$.$

iv$.$ Give parsing actions for the input string $$aaaa$$ for the SLR$(1)$ parser of grammar $$B$.$