edited by
8,705 views
29 votes
29 votes

Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order?

  1. SLR, LALR
  2. Canonical LR, LALR
  3. SLR, canonical LR
  4. LALR, canonical LR
edited by

2 Answers

Best answer
44 votes
44 votes

Answer is C.

SLR is the simplest to implement and Canonical LR is the most powerful.

http://en.wikipedia.org/wiki/LALR_parser_generator

edited by
–4 votes
–4 votes
Answer:B according to ace academy solutions

Anyone with the explanation why its not A?
Answer:

Related questions

15.5k
views
5 answers
45 votes
go_editor asked Feb 15, 2015
15,505 views
Consider the following grammar G$S \rightarrow F \mid H$$F \rightarrow p \mid c$$H \rightarrow d \mid c$ Where $S$, $F$, and $H$ are non-terminal symbols, $p, d$, and $c...
19.4k
views
2 answers
53 votes
makhdoom ghaya asked Feb 12, 2015
19,366 views
Which one of the following is TRUE at any valid state in shift-reduce parsing?Viable prefixes appear only at the bottom of the stack and not insideViable prefixes appear ...
25.7k
views
7 answers
44 votes
go_editor asked Sep 26, 2014
25,650 views
A canonical set of items is given below$S \to L . R $$Q \to R.$On input symbol $<$ the set hasa shift-reduce conflict and a reduce-reduce conflict.a shift-reduce conflict...
12.9k
views
2 answers
24 votes
Kathleen asked Sep 25, 2014
12,945 views
Which of the following statements is true?SLR parser is more powerful than LALRLALR parser is more powerful than Canonical LR parserCanonical LR parser is more powerful t...