Dark Mode

Recent questions tagged go-cd-1

6 votes

2 answers

1

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 1
If we merge states in LR(1) parser to form a LALR(1) parser, we may introduce shift-reduce conflict reduce-reduce conflict no extra conflict both shift-reduce as well as reduce-reduce

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

1.7k views

4 votes

2 answers

2

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 2
Suppose we have a rightmost derivation which proceeds as follows: $\begin{array}{ccc}S &\rightarrow & Aabw \\ & \rightarrow &ABw \end{array}$ ... $\begin{array}{ccc} B &\rightarrow & ab \end{array}$

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

849 views

5 votes

3 answers

3

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 3
Which of the following statements is FALSE? Any DCFL has an equivalent grammar that can be parsed by a SLR(1) parser with end string delimiter Languages of grammars parsed by LR(2) parsers is a strict super set of the languages of ... LL(1) parsers There is no DCFL which is not having a grammar that can be parsed by a LR(1) parser

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

3.2k views

3 votes

1 answer

4

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 4
Which of the following statements is FALSE? In a SLR(1) parser, it is allowable for both shift and reduce items to be in the same state In a SLR(1) parser, it is allowable for multiple reduce items to be in the same state All SLR(1) grammars are LR(0) All LR(0) grammars are SLR(1)

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

3.4k views

3 votes

3 answers

5

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 5
Which of the following statements regarding $LR(0)$ parser is FALSE? A $LR(0)$ configurating set cannot have multiple reduce items A $LR(0)$ configurating set cannot have both shift as well as reduce items If a reduce item is ... a $LR(0)$ configurating set it cannot have any other item A $LR(0)$ parser can parse any regular grammar

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

3.1k views

4 votes

1 answer

6

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 6
Which of the following sentences is CORRECT? A top-down parse produces a leftmost derivation of a sentence A bottom-up parse produces a rightmost derivation of a sentence A top-down parse produces a rightmost derivation of a sentence A bottom-up parse produces a leftmost derivation of a sentence

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

771 views

2 votes

1 answer

7

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 7
Which of the following is a requirement for an LL(1) grammar? Unambiguity No left recursion If $A \to \alpha \mid \beta$ are two productions, then $FIRST(\alpha)$ and $FIRST(\beta)$ are disjoint (i) and (ii) (iii) (i), (ii) and (iii) (ii) and (iii)

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

4.0k views

4 votes

2 answers

8

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 8
Which of the following sentences regarding Viable prefixes is/are CORRECT? Viable prefixes is the set of prefixes of right-sentential forms that can appear on the stack of a shift-reduce parser Viable prefixes is the set of prefixes of right-sentential forms ... using a DFA Only (i) Only (ii) Only (i) and (ii) (i), (ii) and (iii)

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

1.6k views

5 votes

1 answer

9

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 9
For which of the following languages a LL(1) grammar does not exist? $\{a^n o b^n \mid n \geq 1\} \cup \{ a^n b^{n} \mid n \geq 1 \}$ $\{ a^n b^m \mid m,n \geq 0 \}$ $\{a^ib^j\mid i\geq j\}$ $\{a^ib^j\mid i= j\}$

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

1.9k views

5 votes

1 answer

10

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 10
Which of the following is TRUE regarding LL(0) grammar? We can have a LL(0) grammar for any regular language We can have a LL(0) grammar for a regular language only if it does not contain empty string We can have a ... regular language if and only if it has prefix property We can have a LL(0) grammar for only single string languages

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

2.3k views

4 votes

0 answers

11

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 11
Which of the following is TRUE regarding the running time of a LR(1) parser? It runs in linear time for all inputs It runs in polynomial time but not necessarily $O(n^3)$ for all inputs For some inputs it may take exponential time It runs in $O(n^3)$ but not always $O(n^2)$

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

2.0k views

3 votes

0 answers

12

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 12
Which of the following statements regarding LR parsers is WRONG? LR(1) does no guess work LR parsers can handle a large range of grammars than predictive parsers LR parsers can handle a large range of languages than predictive parsers LR ... at error reporting compared to LL ones Only (i) (i) and (iv) Only (iv) All are CORRECT

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

1.4k views

4 votes

2 answers

13

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 13
Match the following: ... ; iv-d i-d; ii-a; iii-c; iv-d i-c; ii-b; iii-d; iv-a i-a; ii-c; iii-b; iv-d

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

1.2k views

7 votes

1 answer

14

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 14
Which of the below relations does hold TRUE regarding GRAMMARS? $LL(1) \subset SLR(1) \subset LR(1)$ $SLR(1) \subset \epsilon-\text{free}\; LL(1) \subset LR(1)$ $\epsilon-\text{free}\;LL(1) \subset SLR(1) \subset LR(1)$ $LL(1) \subset SLR(1) = LR(1)$

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

1.1k views

To see more, click for the full list of questions or popular tags.

Recent questions tagged go-cd-1