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?

View solution

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

View solution

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

View solution

Q. When there is a reduce/reduce conflict?

View solution

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

View solution

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

View solution

Q. Which of these is true about LR parsing?

View solution

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

View solution

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

View solution

Q. Which of these is also known as look-head LR parser?

View solution

Q. Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. Hence which one is true?

View solution

Q. Which of the following symbols table implementation is based on the property of locality of reference?

View solution

Q. _____________ is a graph representation of a derivation

View solution

Q. _________ or scanning is the process where the stream of characters making up the source program is read from left to right and grouped into tokens.

View solution

Q. In a bottom up evaluation of a syntax direction definition ,inherited attributes can

View solution

Q. A synthesized attribute is an attribute whose value at a parse tree node depends on

View solution

Q. Input to code generator

View solution

Q. A optimizing compiler

View solution

Q. Which of the following is used for grouping of characters into tokens?

View solution

Q. Which of the following actions an operator precedence parser may take to recover from an error?

View solution