Consider the following statements.

S₁ : Every SLR(1) grammar is unambiguous but there are certain unambiguous grammars that are not SLR(1).

S₂ : For any context-free grammar, there is a parser that takes at most O(n³) time to parse a string of length n.

Which one of the following option is correct?

Consider the productions A $$ \to $$ PQ and A $$ \to $$ XY. Each of the five non-terminals A, P, Q, X, and Y has two attributes: s is a synthesized attribute, and i is an inherited attribute. Consider the following rules.

Rule 1 : P.i = A.i + 2, Q.i = P.i + A.i, and A.s = P.s + Q.s
Rule 2 : X.i = A.i + Y.s and Y.i = X.s + A.i

Which one of the following is TRUE?

Consider the augmented grammar given below :

S' → S
S → 〈L〉 | id
L → L,S | S

Let I₀ = CLOSURE ({[S' → ●S]}). The number of items in the set GOTO (I₀ , 〈 ) is: _____.

Consider the following parse tree for the expression $$a \ne b\$ c\$ d \ne e \ne f,$$ involving two binary operators $$\$ $$ and $$ \ne $$.

Which one of the following is correct for the given parse tree?