GATE CSE 2013 | Parsing Question 19 | Compiler Design

GATE CSE 2013

MCQ (Single Correct Answer)

-0.3

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 ( i.e., of type $$A \to \varepsilon $$ and $$A \to a$$ ) to parse a string with n tokens?

$${n \over 2}$$

$$n - 1$$

$$2n - 1$$

$${2^n}$$

GATE CSE 2012

MCQ (Single Correct Answer)

-0.3

Given the language L= { ab, aa, baa }, which of the following strings are in L* ?

1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa

1,2 and 3

2,3 and 4

1,2 and 4

1,3 and 4

GATE CSE 2008

MCQ (Single Correct Answer)

-0.3

Which of the following describes a handle (as applicable to LR-parsing) appropriately?

It is the position in a sentential form where the next shift or reduce operation will occur

It is non-terminal whose production will be used for reduction in the next step

It is a production that may be used for reduction in a future step along with a position in the sentential form where the next shift or reduce operation will occur

It is the production p that will be used for reduction in the next step along with a position in the sentential form where the right hand side of the production may be found

GATE CSE 2007

MCQ (Single Correct Answer)

-0.3

Which one of the following is a top-down parser?

Recursive descent parser.

Operator precedence parser.

An LR(k) parser.

An LALR(k) parser.

PREVIOUS NEXT