adplus-dvertising
frame-decoration

Question

What is the similarity between LR, LALR and SLR?

a.

Use same algorithm, but different parsing table.

b.

Same parsing table, but different algorithm.

c.

Their Parsing tables and algorithm are similar but uses top down approach.

d.

Both Parsing tables and algorithm are different.

Posted under Compiler Design

Answer: (a).Use same algorithm, but different parsing table.

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the similarity between LR, LALR and SLR?

Similar Questions

Discover Related MCQs

Q. An LR-parser can detect a syntactic error as soon as

Q. Which of these is true about LR parsing?

Q. Which of the following is incorrect for the actions of A LR-Parser ?
I) shift s
ii) reduce A->ß
iii) Accept
iv) reject?

Q. If a state does not know whether it will make a shift operation or reduction for a terminal is called

Q. When there is a reduce/reduce conflict?

Q. When ß ( in the LR(1) item A -> ß.a,a ) is not empty, the look-head

Q. When ß is empty (A -> ß.,a ), the reduction by A-> a is done

Q. The construction of the canonical collection of the sets of LR (1) items are similar to the construction of the canonical collection of the sets of LR (0) items. Which is an exception?

Q. Which of the following is a phase of a compilation process?

Q. A simple two-pass assembler does which of the following in the first pass.

Q. A programmer by mistake writes multiplication instead of division, such error can be detected by a/an

Q. A shift reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of grammar S—-> xxW ( PRINT “1”) S—-> y { print ” 2 ” } S—-> Sz { print ” 3 ” ) What is the translation of xxxxyzz using the syntax directed translation scheme described by the above rules ?

Q. In operator precedence parsing whose precedence relations are defined

Q. ( Z,* ) be a structure, and * is defined by n * m =maximum ( n , m ) Which of the following statements is true for ( Z, * ) ?

Q. The address code involves