search
Log In
1 vote
1.3k views

Which of the following is true ?

  1. Canonical $LR$ parser is $LR (1)$ parser with single look ahead terminal
  2. All $LR(K)$ parsers with $K > 1$ can be transformed into $LR(1)$ parsers. 
  3. Both $(A)$ and $(B)$
  4. None of the above 
in Compiler Design
recategorized by
1.3k views

1 Answer

1 vote

Answer : C

A canonical LR parser or LR(1) parser is an LR(k) parser for k=1, i.e. with a single look-ahead terminal. The special attribute of this parser is that all LR(k) parser's with k>1 can be transformed into a LR(1) parser.

Reference : Canonical LR parser

0
Lookahead terminal and lookahead symbols both are different things?
Answer:

Related questions

2 votes
1 answer
1
1.9k views
In a two-pass assembler, symbol table is Generated in first pass Generated in second pass Not generated at all Generated and used only in second pass
asked Jul 22, 2016 in Compiler Design makhdoom ghaya 1.9k views
2 votes
1 answer
2
990 views
Shift-Reduce parsers perform the following : Shift step that advances in the input stream by $K(K > 1)$ symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. Shift step ... . Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.
asked Jul 22, 2016 in Compiler Design makhdoom ghaya 990 views
0 votes
1 answer
3
168 views
The ‘K’ in LR (K) cannot be : $0$ $1$ $2$ None of these
asked Mar 27, 2020 in Compiler Design jothee 168 views
1 vote
1 answer
4
937 views
Match the following : ... : a-iii, b-iv, c-i, d-ii a-iii, b-i, c-iv, d-ii a-i, b-ii, c-iii, d-iv a-iv, b-iii, c-ii, d-i
asked Jul 24, 2016 in Computer Networks makhdoom ghaya 937 views
...