Recent questions tagged parsing

+2 votes

1 answer

1

MadeEasy Subject Test: Compiler Design - Parsing

asked Dec 26, 2016 in Compiler Design by Hradesh patel Loyal (6.5k points) | 176 views

+3 votes

1 answer

2

MadeEasy Subject Test: Compiler Design - Parsing
A non left recursive and left facotred grammar in which all non-empty rules defining the same non terminal have disjoint first sets, such grammar is called _____________ a) LL(1) b) LR(0) c) LR(1) d) None asnwer given LL(1). but i think bcoz of follow there can be conflict hence none of these should be the answer. Is it right??

asked Dec 26, 2016 in Compiler Design by Rahul Jain25 Boss (11.1k points) | 239 views

+2 votes

1 answer

3

Parsing doubt
$\begin{align*} &\color{blue}{\text{Top down predictive parsers detect errors earlier than bottom up parsers (true/false)}} \\ &\color{maroon}{\text{Justify your answer}} \\ \end{align*}$

asked Dec 19, 2016 in Compiler Design by Anusha Motamarri Boss (12k points) | 563 views

0 votes

2 answers

4

GATE1988-10ib
Consider the following grammar: $S \rightarrow S$ $S \rightarrow SS \mid a \mid \epsilon$ Indicate the shift-reduce and reduce-reduce conflict (if any) in the various states of the LR(0) parser.

asked Dec 19, 2016 in Compiler Design by jothee Veteran (105k points) | 344 views

+3 votes

2 answers

5

GATE1988-10ia
Consider the following grammar: $S \rightarrow S$ $S \rightarrow SS \mid a \mid \epsilon$ Construct the collection of sets of LR (0) items for this grammar and draw its goto graph.

asked Dec 19, 2016 in Compiler Design by jothee Veteran (105k points) | 423 views

+1 vote

2 answers

6

Compiler
Consider the grammar given below. It is E -> T+E | T T -> a a. SLR(1) but not LL(1) b. Not an operator grammar c. Ambiguous d. None of these

asked Dec 16, 2016 in Compiler Design by umang_16 Active (1.1k points) | 143 views

0 votes

0 answers

7

Grammar ambiguity and parsing
$\begin{align*} \text {stmt} &\rightarrow \text{if expr then stmt else stmt} \\ & \;\; \;\; | \text{ if expr then stmt} \\ & \;\; \;\; | \text{ other} \end{align*}$ Which of the following statement/s is ... and the ambiguity cannot be resolved. B. The grammar is unambiguous C. The grammar is ambiguous and the ambiguity can be resolved D. None of these

asked Dec 15, 2016 in Compiler Design by dd Veteran (57.2k points) | 264 views

+1 vote

1 answer

8

LR parsing transitions
Consider the following statements: S1: Whenever we apply transition on any symbol the lookahead does not change S2: The lookahead has effect on items of the form [$A\rightarrow \alpha \bullet \beta , a$] where β ≠ ∈ and [$A\rightarrow \alpha \bullet , a$] Which of the above statements are true wrt LR(1) items?

asked Dec 15, 2016 in Compiler Design by dd Veteran (57.2k points) | 209 views

0 votes

2 answers

9

Parsing
why does recursive descent parser not use left recursive grammar?

asked Dec 14, 2016 in Compiler Design by gautamcse27 (135 points) | 328 views

+1 vote

0 answers

10

MadeEasy Test Series: Compiler Design - Parsing

asked Dec 10, 2016 in Compiler Design by Vineeta Garg (159 points) | 80 views

0 votes

1 answer

11

LL1 parsing
Find first and follow of given grammer E --> E+T / T T --> T*F / F F --> (E) / id

asked Dec 9, 2016 in Compiler Design by sudhirnayak (7 points) | 365 views

+2 votes

1 answer

12

Parse tree evaluation

asked Dec 6, 2016 in Compiler Design by Rakesh K Active (1.8k points) | 223 views

+1 vote

0 answers

13

LR(1) parser
Consider the following two statements: P: Every regular grammar is LL(1) Q: Every regular set has a LR(1) grammar Which of the following is TRUE? Both P and Q are true P is true and Q is false P is false and Q is true Both P and Q are false

asked Dec 2, 2016 in Compiler Design by indrajeet Active (1.7k points) | 258 views

+11 votes

2 answers

14

GATE1989-1-iii
Merging states with a common core may produce __________ conflicts and does not produce ___________ conflicts in an LALR purser.

asked Nov 27, 2016 in Compiler Design by makhdoom ghaya Boss (30.8k points) | 780 views

+22 votes

2 answers

15

GATE2005-83b
Consider the following expression grammar. The semantic rules for expression evaluation are stated next to each grammar production. ... $7$ Precedence of $+$' is higher than that of $\times$', and both operators are left associative; expression is evaluated to $9$

asked Nov 27, 2016 in Compiler Design by jothee Veteran (105k points) | 3.3k views

+1 vote

3 answers

16

MadeEasy Test Series: Compiler Design - Parsing
Let 'x', 'y', 'z' and 'u' represents the number of entries in rows of Non-terminals 'S', 'A', 'B' and 'C' respectively. The value of x + y + z + u is ______ .

asked Nov 23, 2016 in Compiler Design by vaishali jhalani Active (4.8k points) | 715 views

+1 vote

2 answers

17

MadeEasy Test Series: Compiler Design - Parsing
How many conflicts are present in LR(0) parser..i am getting 3.

asked Nov 23, 2016 in Compiler Design by vaishali jhalani Active (4.8k points) | 146 views

0 votes

2 answers

18

Ace Test Series: Compiler Design - Parsing

asked Nov 22, 2016 in Compiler Design by vaishali jhalani Active (4.8k points) | 68 views

0 votes

3 answers

19

Operator precedence parsing

asked Nov 17, 2016 in Compiler Design by thor Loyal (6.8k points) | 760 views

+3 votes

3 answers

20

Is there SR conflict in SLR(1) ?

asked Nov 15, 2016 in Compiler Design by thor Loyal (6.8k points) | 475 views

+2 votes

2 answers

21

ME - CD

asked Nov 15, 2016 in Compiler Design by thor Loyal (6.8k points) | 158 views

+1 vote

2 answers

22

Compiler
E -> E+T/T T -> T*F/F F -> id is it LR(1).?

asked Nov 15, 2016 in Compiler Design by Ravi_1511 Active (2k points) | 380 views

+2 votes

3 answers

23

Remove Left Recursion from given grammar, if any?

asked Nov 14, 2016 in Compiler Design by smartmeet Active (4.9k points) | 821 views

+2 votes

1 answer

24

Compiler Viable Prefix

asked Nov 12, 2016 in Compiler Design by KISHALAY DAS Active (4.9k points) | 1.2k views

+2 votes

1 answer

25

Testbook :
$S_1 :$ Recursive decent parser takes more time and less space. $S_2 :$ LL(1) Parser takes more time and more space. $S_3 :$ LL(1) Parser takes less time and less space. $S_4 :$ Recursive descent Parser takes more time and more space. a). (1) and (2) is ... and (3) is correct. Ques2: Consider $2^{nd}$ production as $\tt A \rightarrow Bc|dA|\epsilon$ (I think answer given is wrong)

asked Nov 10, 2016 in Compiler Design by mcjoshi Boss (28.7k points) | 238 views

+11 votes

4 answers

26

GATE1987-1-xiv
An operator precedence parser is a Bottom-up parser. Top-down parser. Back tracking parser. None of the above.

asked Nov 8, 2016 in Compiler Design by makhdoom ghaya Boss (30.8k points) | 757 views

+3 votes

0 answers

27

Which parser can parse following grammar ?
Which of the Parsers from LL(1), LR(0), SLR(1), LALR(1) and CLR(1) can Parse the following grammar ? $\tt E \rightarrow ET | a$ $\tt T \rightarrow TE | b$

asked Nov 1, 2016 in Compiler Design by santhoshdevulapally Boss (12.8k points) | 228 views

+3 votes

1 answer

28

Predictive parse table ?
Predictive parse table for following grammars: 1.S->FR R->*S/∈ F->id and 2.S->iEtSS' | a S'->eS | ∈ E->b

asked Oct 29, 2016 in Compiler Design by Karthik Akula (447 points) | 1.3k views

+1 vote

3 answers

29

Translation scheme
Consider the following translation scheme. S→ER R→∗E{print(′∗′);}R∣ε E→F+E{print(′+′);}∣F F→S∣id{print(id.value);} Here id is a token that represents an integer and id.value represents the corresponding integer value. For an input '2 * 3 + 4', this translation scheme ... following tree and found the answer to be (C) i.e. 23*4+. But the given answer in (D). Am I missing something?

asked Oct 14, 2016 in Compiler Design by Rakesh K Active (1.8k points) | 435 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged parsing

Recent Posts

Recent Blog Comments