Q. Consider the following grammar G.
S → F ⎪ H

F → p ⎪ c

H → d ⎪ c

Which one is true?

S1: All strings generated by G can be parsed with help of LL (1).

S2: All strings generated by G can be parsed with help of LR (1).

View solution

Q. What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production to parse a string with n tokens?

View solution

Q. Consider the following two sets of LR (1) items of an LR (1) grammar.
X -> c.X, c/d

X -> .cX, c/d

X -> .d, c/d

X -> c.X, $

X -> .cX, $

X -> .d, $

Which one is false?

1. Cannot be merged since look ahead’s are different.

2. Can be merged but will result in S-R conflict.

3. Can be merged but will result in R-R conflict.

4. Cannot be merged since goto on c will lead to two different sets.

View solution

Q. What is the binary equivalent of the decimal number 368

View solution

Q. AB+(A+B)’ is equivalent to

View solution

Q. Which of the following is the fastest logic ?

View solution

Q. A latch is constructed using two cross coupled

View solution

Q. DAG representation of a basic block allows

View solution

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

View solution

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

View solution

Q. A optimizing compiler

View solution

Q. Input to code generator

View solution

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

View solution

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

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. _____________ is a graph representation of a derivation

View solution

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

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 these is also known as look-head LR parser?

View solution

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

View solution