Which of the following strings can definitely be said to be tokens without looking at the next input character while compiling a Pascal program?

I. begin
II. program
III. <>

A shift reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of grammar.

$$\eqalign{ & S \to xxW\,\left\{ {pr{\mathop{\rm int}} \,'1'} \right\} \cr & S \to y\,\left\{ {pr{\mathop{\rm int}} \,'2'} \right\} \cr & W \to Sz\,\left\{ {pr{\mathop{\rm int}} \,'3'} \right\} \cr} $$

What is the translation of xxxxyzz using the syntax directed translation scheme described by the above rules?

A linker is given object modules for a set of programs that were compiled separately. What information need to be included in an object module?

A $$ROM$$ is used to store a truth table for a binary multiplier unit that will multiply two $$4$$ bit numbers. The size of the $$ROM$$ (number of words $$ \times $$ number of bits) that is required to accommodate the truth table is $$M$$ words $$ \times $$ $$N$$ bits. Write the values of $$M$$ and $$N$$.