Theory of Computation and Compilers MCQ - Syntax Analysis

26 Consider the grammar
S → (S) | a
Let the number of states in SLR (1), LR (1) and LALR(l) parsers for the grammar be n₁ n₂ and n₃ respectively. The following relationship holds good

Always the case SLR and LALR have same number of states.
While LR have more states than these two.
Because for any Bottom-up paring number of ‘CORES’ is always same while for LR() only other thing is lookahead is different.

27 Consider the following grammar.
S → S × E
S → E
E → F + E
E → F
F → id
Consider the following LR(0) items corresponding to the grammar above.
(i) S → S ×.E
(ii) E → F.+ E
(iii) E → F + .E
Given the items above, which two of them will appear in the same set in the canonical sets-of items for the grammar?

Go to Graph is:-

So all are in different set.

28 Consider the following grammar
S → FR
R → S*|ε
F → id
In the predictive parser table, M, of the grammar the entries M[S, id] and M[R, $] respectively

	First	Follow
S	id	$
R	id, E	$
F	id	id, $

So table Entries are as follows
M [S, id] = {S → FR}
M[R, $] = {R → ε}

29 Which one of the following grammars generates the language L = {aⁱ b^j | i ≠ j}?

The grammar is
S → AC/CB
C → aCb/null
A → aA/a
B → Bb/b
it generate set of all strings generated by above grammar

30 Which of the following describes a handle (as applicable to LR-parsing) appropriately?

According to definition, handle is a production rule A → β and a position in the sentential form where string β may be found and replaced to produce the previous right sentential form in a rightmost derivation of sentential form.