Recent questions tagged parsing

+1 vote

4 answers

1

Find First and Follow
How to find FIrst and Follow in following case? S -> aAbB | bAaB | epsilon A -> S B -> S I am little confused because of the production A->S, does it say that Follow(A) is subset of Follow(S) or Follow(S) is subset of Follow(A) or both are equal?

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

+1 vote

4 answers

2

Find if grammar is SLR(1)
Consider the grammar: S -> (XSS) | (XS) | a X -> b Which one of the following is true? (A) The grammar is in LL(1) but not in SLR(1) (B) The grammar is in SLR(1) but not in LL(!) (C) The grammar is in both SLR(1) and LL(!) (D) The grammar is neither in SLR(1) nor in LL(!)

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

+2 votes

4 answers

3

Find if the grammar is LL(1)
Consider the grammar: S -> ab | ac Is this grammar LL(1)? My try : I tried doing the left-factoring and create the LL(1) table and found that the grammar is LL(1), but the answer is given to be not LL(1).

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

+2 votes

2 answers

4

Precedence of operator in Parse tree
Consider the following parse tree: string / | \ string + string / | \ | string - string 2 | | 9 5 Which of the following statement is true? (A) Both + and - are having equal precendence (B) + is having higher precedence (C) - is having higher precedence (D) None of these

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

+2 votes

2 answers

5

parsing technique
Consider an SLR(1) & LALR(1) tables which of the following is true?? 1. shift entries are same. 2 Reduce entries are same. 3. goto entries are different. 4.error entries are different.

asked Oct 8, 2016 in Compiler Design by Aman Jha (491 points) | 709 views

0 votes

1 answer

6

parsing
S1)Stack contains only viable prefixes S2) handle is always on top of the stack options: a) only S1 is true b)only S2 is true c)both S1 and S2 d)neither is true

asked Sep 27, 2016 in Compiler Design by Anusha Motamarri Boss (12k points) | 223 views

+10 votes

2 answers

7

Bottom-Up Parsing
Consider the folllowing grammar $ S\rightarrow AaS \ |\ b$ $ A\rightarrow c \ |\ d \ |B$ $ B\rightarrow AgC \ |\ AhC \ | \ DgC | \ DhC$ $C\rightarrow c \ |\ d \ | \ D$ $ D\rightarrow eBf$ Which of the following are viable prefix ? $ \left ( 1 \right )Aab$ $ \left ( 2 \right )ca$ $ \left ( 3 \right )cab$ $\left ( 4 \right )AgCS$

asked Sep 20, 2016 in Compiler Design by ManojK Boss (38.7k points) | 1.1k views

+1 vote

0 answers

8

Parsing
Consider the Grammer S -> (S) | SS | () In the goto graph of LR(0) item, the number of inadequate states are (A). 1 (B). 2 (C). 3 (D). 4

asked Aug 17, 2016 in Compiler Design by anonymous | 264 views

+4 votes

2 answers

9

UGCNET-June2016-II-35
Which of the following is false? The grammar $S \rightarrow a \: Sb \mid bSa \mid SS \mid \in$, where $S$ is the only non-terminal symbol and $\in$ is the null string, is ambiguous SLR is powerful than LALR An LL(1) parser is a top-down parser YACC tool is an LALR(1) parser generator

asked Aug 16, 2016 in Compiler Design by jothee Veteran (105k points) | 773 views

+2 votes

1 answer

10

First and follow
S-> AB / Ɛ A-> AC / 0C B->0S C->1 What is the first (A)..??

asked Aug 13, 2016 in Compiler Design by dhairya Active (1.2k points) | 355 views

+1 vote

2 answers

11

UGCNET-Dec2015-II-43
Which of the following statements is false? Top-down parsers are LL parsers where first L stands for left-to-right scan and second L stands for a leftmost derivation (000)* is a regular expression that matches only strings containing an odd number of zeroes, including the ... if L is any context-free language, then the language $L^R =\{w^R: w \varepsilon L\}$ is context-free

asked Aug 8, 2016 in Compiler Design by jothee Veteran (105k points) | 777 views

+1 vote

2 answers

12

UGCNET-June2015-II-34
Which one of the following is false? LALR parser is Bottom-Up parser A parsing algorithm which performs a left to right scanning and a right most deviation is RL(1) LR parser is Bottom-Up parser In LL(1), the 1 indicates that there is a one symbol look-ahead

asked Jul 31, 2016 in Compiler Design by jothee Veteran (105k points) | 678 views

+1 vote

2 answers

13

UGCNET-Dec2012-II-27
Which of the following is true while converting CFG to an LL(1) grammar? Removing left recursion alone Factoring the grammar alone Removing left recursion and factoring the grammar None of the above

asked Jul 10, 2016 in Compiler Design by Arjun Veteran (431k points) | 968 views

+2 votes

3 answers

14

UGCNET-Dec2012-II-18
Given the following expressions of a grammar $E \rightarrow E * F / F + E / F$ $F \rightarrow F – F / id$ Which of the following is true? $*$ has the higher precedence than + - has the higher precedence than $*$ + and – have same precedence + has the higher precedence than $*$

asked Jul 8, 2016 in Compiler Design by jothee Veteran (105k points) | 639 views

+10 votes

5 answers

15

ISRO2016-40
Recursive descent parsing is an example of Top-down parsers Bottom-up parsers Predictive parsers None of the above

asked Jul 6, 2016 in Compiler Design by jothee Veteran (105k points) | 6k views

+5 votes

3 answers

16

ISRO2016-41
A top-down parser generates Rightmost Derivation Rightmost derivation in reverse Leftmost derivation Leftmost derivation in reverse

asked Jul 5, 2016 in Compiler Design by habedo007 Active (2.8k points) | 6.8k views

+3 votes

3 answers

17

ambiguous grammar
An ambiguous grammar is one that produces more than one left most derivation for the same sentence. more than one right most derivation for the same sentence. more than one leftmost derivation for the different sentence. i and ii i or ii ii and iii ii or iii

asked Jun 24, 2016 by vivekpinto07 (229 points) | 1.5k views

+7 votes

2 answers

18

ISRO2015-29
Which statement is true? LALR parser is more powerful and costly as compare to other parsers All CFG's are LP and not all grammars are uniquely defined Every SLR grammar is unambiguous but not every unambiguous grammar is SLR LR(K) is the most general back tracking shift reduce parsing method

asked Jun 17, 2016 in Compiler Design by jothee Veteran (105k points) | 2.7k views

+7 votes

3 answers

19

ISRO2015-27
Which one of the following is a top-down parser? Recursive descent parser Shift left associative parser SLR(k) parser LR(k) parser

asked Jun 17, 2016 in Compiler Design by jothee Veteran (105k points) | 2.1k views

+12 votes

3 answers

20

ISRO2015-26
Which grammar rules violate the requirement of the operator grammar? A, B, C are variables and a, b, c are terminals $A \rightarrow BC$ $A \rightarrow CcBb$ $A \rightarrow BaC$ $A \rightarrow \epsilon$ (a) 1 only (b) 1 and 2 (c) 1 and 3 (d) 1 and 4

asked Jun 17, 2016 in Compiler Design by jothee Veteran (105k points) | 2.7k views

+1 vote

1 answer

21

Grammar that produce more than one Parse tree for same sentence is:
A. Ambiguous B. Unambiguous C. Complementation D. Concatenation Intersection

asked Jun 16, 2016 in Theory of Computation by im.raj Junior (563 points) | 1.5k views

+1 vote

3 answers

22

UGCNET-June2014-II-08
A shift reduce parser suffers from Shift reduce conflict only Reduce reduce conflict only Both shift reduce conflict and reduce reduce conflict Shift handle and reduce handle conflicts

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

+2 votes

1 answer

23

UGCNET-June2014-II-07
Which of the following suffices to convert an arbitrary $CFG$ to an $LL(1)$ grammar ? Removing left recursion alone Removing the grammar alone Removing left recursion and factoring the grammar None of the above

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

+2 votes

2 answers

24

UGCNET-June2014-II-06
A grammar $G$ is $LL(1)$ if and only if the following conditions hold for two distinct productions $A \rightarrow \alpha \mid \beta$ I. First $(\alpha) \cap$ First $(\beta) \neq \left\{a\right\}$ where $a$ ... $(A) = \phi$ if $\lambda \in$ First $(\beta)$ I and II I and III II and III I, II and III

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

+2 votes

1 answer

25

How to remove Left recursion from this Grammar ?
A-->AA+/AA*/a is it eligible to be used by SR parse. If we apply SR parse on this grammar then what will be the order of activation Record in Stack

asked Jun 4, 2016 in Compiler Design by shekhar chauhan Boss (45.4k points) | 321 views

+4 votes

1 answer

26

Draw a Parse Tree and verify whether this grammar is Ambiguous or Not .
X--> X(Y) / Y Y--> (X)Y / 0 / 1 / Eps

asked Jun 2, 2016 in Compiler Design by shekhar chauhan Boss (45.4k points) | 415 views

+2 votes

1 answer

27

How to eliminate indirect left recursion ?
J -> Lx K -> Ly L -> J | K | f Whoever Answers Please Explain Methods solving such Questions .

asked May 31, 2016 in Compiler Design by shekhar chauhan Boss (45.4k points) | 398 views

+5 votes

3 answers

28

Which of the following is true for the left recursive grammar

asked May 14, 2016 in Compiler Design by ShiveshRoy Active (1.1k points) | 1.4k views

+6 votes

2 answers

29

Is CLR(1) grammar and LR(1) grammar are same?
Whether LR(1) grammar is same as that of CLR(1) grammar. If yes then please explain and if not then what is the difference between them?

asked May 14, 2016 in Compiler Design by ShiveshRoy Active (1.1k points) | 4.4k views

+10 votes

2 answers

30

How to Eliminate Indirect Left recursion from this grammar?

asked May 8, 2016 in Compiler Design by ShiveshRoy Active (1.1k points) | 4k 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