Compiler design

Question

G : Grammar

S1 : Every LALR(1) G is LR(1).

S2 : Every LR(1) G is LALR(1).

S3: Some LL(1) is Regular.

A. TFF B.TFT  C. TTF D. FTT E. NONE

Answer 1

Option B)

A) LALR(1) parsing table is obtained by combining similar items with different look ahead. So LALR(1) is a subset of LR(1),

B) Every LR(1) grammer is not LALR as conflicts may arise when combining states.

C) S-> aS|b is a right linear regular grammer and is also LL(1).