Compiler Design...

Which of the following statement is true?

Consider the following grammar in which start symbol = {S}, Non Terminal symbol = {A, B, C, D} and Terminal symbol = {a, p, q, r, s, ϵ}. 

S → A B | p r C | C q 

A → a S | C

B → q | ϵ

C → r | ϵ

D → B s | ϵ  

Find the number of terminals in the FIRST(S)?

Input taken by semantic analyzer and output produces by semantic analyzer are

Which of the following statements is/are true about the parser?

A. Leftmost derivation is used for Bottom-up parser.

B. Rightmost in reverse derivation is used by LL parser.

Consider the below given augmented grammar:

A' → A

A → a B b | num

B → B c A | A | @

Consider the following grammar:

S → aS'

S' → aS' | ϵ 

Above grammar is

I. not left recursive

II. not ambiguous

III. LL(1) 

Which of the following is/are true?

Consider the grammar given below:

X → Px

P → RQ | R

Q → y | w | ε

R → z | ε

Let x, y, z, w, and $ be indexed as follows:

Compute the FOLLOW set of the non-terminal R and write the index values for the symbols in the FOLLOW set in the ascending order. (For example, if the FOLLOW set is {x, y, z, w, $}, then the answer should be 12345)