Q22

An identifier in a programming language consists of up to six letters and digits of which the first character must be a letter. Derive a regular expression for the identifier.

Build an $LL(1)$ parsing table for the language defined by the $LL(1)$ grammar with productions $\text{Program} \rightarrow \text{ begin } d \text{ semi } X\text{ end}$ $X \rightarrow d \text{ semi } X \mid sY$ $Y \rightarrow \text{ semi } s Y \mid \epsilon$