Arrange the following parsers in increasing order of their power of handling grammars i.e. from the least powerful parser to the most powerful parser.

A. LR (0)

B. LR (1)

C. LALR(1)

D. LL (0)

E. SLR

1. ALL(0) → LR(0) → SLR → LR(1) → LALR(1)
2. BSLR → LR(0) → LL(0) → LR(1) → LALR(1)
3. CLL(0) → LR(0) → SLR → LALR(1) → LR(1)
4. DLR(0) → LL(0) → SLR → LR(1) → LALR(1)

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: C. LL(0) → LR(0) → SLR → LALR(1) → LR(1)

Explanation

Power increases from LL(0) to LR(0), SLR(1), LALR(1) and finally canonical LR(1), which is the most powerful of these.