Recent questions tagged parsing / GATE Overflow for GATE CSE

Which of the Statements are True :S1: LR(1) grammar can be LR(0) but not LL(1).S2 : Every regular language is LL(1)S3 : Three address code is linear representation of Syn...

Na462

793 views

Na462 asked Jan 16, 2019

2 votes

2 answers

155

UPPCL AE 2018:70
Consider the following grammar $\text{G:}$ $\text{P} \rightarrow \text{Q + R} \mid \text{Q - R} \mid \text{Q} \mid \text{R}$ $\text{Q} \rightarrow q \mid r$ $\text{R} \rightarrow r \mid s$ where $\text{P, Q,}$ and $\text{R}$ ... grammar $\text{G}$ Neither $\text{S1}$ nor $\text{S2}$ Only $\text{S1}$ Only $\text{S2}$ Both $\text{S1}$ and $\text{S2}$

Consider the following grammar $\text{G:}$$\text{P} \rightarrow \text{Q + R} \mid \text{Q – R} \mid \text{Q} \mid \text{R}$$\text{Q} \rightarrow q \mid r$$\text{R} \rig...

gate_forum

824 views

gate_forum asked Jan 13, 2019

0 votes

0 answers

156

Length of production
A Grammer is said to be in 4-Standard form if all productions of the grammer are of type A → BCDE|a. If a grammer is in 4-Standard form how many steps in derivation of w will require if length of string w is 256 ?

A Grammer is said to be in 4-Standard form if all productions of the grammer are of type A → BCDE|a. If a grammer is in 4-Standard form how many steps in derivation of ...

Na462

700 views

Na462 asked Jan 12, 2019

1 votes

0 answers

157

MadeEasy Full Length Test 2019: Compiler Design - Parsing

Sambhrant Maurya

651 views

Sambhrant Maurya asked Jan 11, 2019

3 votes

1 answer

158

MadeEasy Subject Test 2019: Compiler Design - Parsing
Consider the following grammar: S-->XX X-->b X-->aX Which of the following can be the viable prefixes? baab aab aaabab bbbaX

Consider the following grammar:S >XXX >bX >aXWhich of the following can be the viable prefixes?baabaabaaababbbbaX

Sambhrant Maurya

2.4k views

Sambhrant Maurya asked Jan 11, 2019

1 votes

1 answer

159

Gateforum Test Series: Compiler Design - Parsing
Which of the following is FALSE? (A) LL(k) grammars are context free grammar (B) LL(k) grammars are unambiguous (C) There are LL(k) grammars which are not context free (D) LL(k) grammars cannot have left recursion i marked a answer is given c)

Which of the following is FALSE?(A) LL(k) grammars are context free grammar(B) LL(k) grammars are unambiguous(C) There are LL(k) grammars which are not context free(D) LL...

Prince Sindhiya

751 views

Prince Sindhiya asked Jan 11, 2019

0 votes

0 answers

160

#parser
S$\rightarrow aS|Sa|a$ find number of conflict state in DFA with LR(1) items

S$\rightarrow aS|Sa|a$ find number of conflict state in DFA with LR(1) items

amit166

613 views

amit166 asked Jan 9, 2019

1 votes

2 answers

161

UPPCL AE 2018:17
Which of the following statements are $\text{TRUE}$? Top-down parsers are equipped to handle left recursive grammar. $\text{LALR}$ parser is more powerful than an $\text{SLR}$ parser Recursive descent parsing is an example of top-down parsing. $\text{III}$ only $\text{I}$ only $\text{II}$ only $\text{II}$ and $\text{III}$

Which of the following statements are $\text{TRUE}$?Top-down parsers are equipped to handle left recursive grammar.$\text{LALR}$ parser is more powerful than an $\text{SL...

admin

629 views

admin asked Jan 5, 2019

0 votes

1 answer

162

Compiler Design #Made_Easy_Test_Series
Let G be any grammar with the following productions: X → X + Y | Y Y → Y * Z | Z Z → (X) Z → id If LR(!) parser is used to parse the above grammar, then total how many look-a-heads are present for the item X → >Y and Z → .id in the initial state _____________. Please explain your answer.

Let G be any grammar with the following productions:X → X + Y | YY → Y * Z | ZZ → (X)Z → idIf LR(!) parser is used to parse the above grammar, then total how many...

`JEET

2.2k views

`JEET asked Jan 3, 2019

0 votes

2 answers

163

UGC NET CSE | December 2018 | Part 2 | Question: 39
Consider the following grammar $G$: $S \rightarrow A \mid B$ $A \rightarrow a \mid c$ $B \rightarrow b \mid c$ where $\{ S, A, B\}$ is the set of non-terminals, $\{ a, b, c, \}$ is the set of terminals. Which of the ... $G$. Choose the correct answer from the code given below: Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ nor $S_2$

Consider the following grammar $G$:$S \rightarrow A \mid B$$A \rightarrow a \mid c$$B \rightarrow b \mid c$where $\{ S, A, B\}$ is the set of non-terminals, $\{ a, b, c, ...

Arjun

2.0k views

Arjun asked Jan 2, 2019

1 votes

1 answer

164

Non-Left recursive grammar of the below grammar.
Grammar. S → Aa | B A → Ac | Aad | bd | epsilon . .

Grammar. S → Aa | B A → Ac | Aad | bd | epsilon . .

susgir2

961 views

susgir2 asked Jan 2, 2019

0 votes

0 answers

165

compiler conceptual doubt
WHAT IS A VALID ITEM FOR A VIABLE PREFIX? CAM SOMEONE EXPLAIN IN EASY WAY.

WHAT IS A VALID ITEM FOR A VIABLE PREFIX?CAM SOMEONE EXPLAIN IN EASY WAY.

sushmita

406 views

sushmita asked Dec 31, 2018

0 votes

2 answers

166

self doubt
S → aA / CB A → BaA / epsilon B → bB / Abc / epsilon C → B what is follow of C , FOLLOW(C)? I think answer is FOLLOW (C) = First(B) = { b, first (A), (dollar for epsilon) } = {b, a, $} Am i right? Because i found some where FOLLOW(C) = FOLLOW(B) . Is this statement correct? (But I think this is wrong) PLZ confirm the solution of above doubt………………..!!!!!!!!!!!

S → aA / CBA → BaA / epsilonB → bB / Abc / epsilonC → Bwhat is follow of C , FOLLOW(C)?I think answer is FOLLOW (C) = First(B) = { b, first (A), (dollar for ep...

Raj Kumar 7

395 views

Raj Kumar 7 asked Dec 30, 2018

4 votes

1 answer

167

GATE Overflow | Mock GATE | Test 1 | Question: 57
Which of the following statements on Viable Prefixes is incorrect? A viable prefix does not extend past the right end of the handle For any context-free grammar, the set of viable prefixes is a regular language A viable prefix by default is a suffix of the handle As long as a parser has viable prefixes on the stack no parsing error has been detected

Which of the following statements on Viable Prefixes is incorrect?A viable prefix does not extend past the right end of the handleFor any context-free grammar, the set of...

Ruturaj Mohanty

1.6k views

Ruturaj Mohanty asked Dec 27, 2018

0 votes

0 answers

168

Zeal Test Series 2019: Compiler Design - Parsing

Prince Sindhiya

343 views

Prince Sindhiya asked Dec 21, 2018

1 votes

0 answers

169

PARSER
An $\epsilon$ free LL(1) grammar is also a SLR(1) and hence LALR(1) and LR(1) too. Is this statement true ?

An $\epsilon$ free LL(1) grammar is also a SLR(1) and hence LALR(1) and LR(1) too.Is this statement true ?

junaid ahmad

628 views

junaid ahmad asked Dec 20, 2018

0 votes

1 answer

170

Self doubt
Predictive parser and non recursive parser are same or non recursive parser is a type of predictive parser. If sure then answer.

Predictive parser and non recursive parser are same or non recursive parser is a type of predictive parser. If sure then answer.

Nivedita Singh

1.8k views

Nivedita Singh asked Dec 9, 2018

0 votes

2 answers

171

ME test series
Consider the following CFG, with S as start symbol: S -> aA l CB A -> BaA I e B-> bB l Abc l e C -> B (HERE ‘e’ IS EPSILON OR NULL PRODUCTION) FIRST(B)? FOLLOW(C)?

Consider the following CFG, with S as start symbol:S - aA l CBA - BaA I eB- bB l Abc l eC - B (HERE ‘e’ IS EPSILON OR NULL PRODUCTION)FIRST(B)?FOLLOW(C)?

newdreamz a1-z0

1.0k views

newdreamz a1-z0 asked Dec 8, 2018

0 votes

0 answers

172

Self Doubt
what is sequence order of solving LR(K) grammar, if the question is asking about SLR, CLR, LALR? what is sequence after solving SLR(1) (assume till now grammar is not SLR(1)), then proceed for LALR/CLR DFA???

what is sequence order of solving LR(K) grammar, if the question is asking about SLR, CLR, LALR? what is sequence after solving SLR(1) (assume till now grammar is not SLR...

Hira Thakur

241 views

Hira Thakur asked Dec 3, 2018

0 votes

0 answers

173

GATE 2019
I want to know if there is topological sort for the syntax directed translations. Does LMD or Bottom up parsing have an order. Is there an order in which the result of SDT is calculated?

I want to know if there is topological sort for the syntax directed translations.Does LMD or Bottom up parsing have an order. Is there an order in which the result of SDT...

ShruteeP

425 views

ShruteeP asked Dec 3, 2018

0 votes

2 answers

174

parser doubt
Consider the statements: (i) Every regular grammar is LL(1) (ii) Every LL(1) grammar is LALR(1) (iii) All LR(0) grammars are LL(k) (iv) A context-free grammar without left factoring and left recursion can be ambiguous Which of the above statement/s is/are TRUE? (i) only (i) and (iii) only (ii) and (iv) only (iv) only

Consider the statements: (i) Every regular grammar is LL(1) (ii) Every LL(1) grammar is LALR(1) (iii) All LR(0) grammars are LL(k) (iv) A context-free grammar without lef...

Pavan Shetty

1.4k views

Pavan Shetty asked Dec 1, 2018

0 votes

1 answer

175

compiler1

Deepesh Pai

390 views

Deepesh Pai asked Nov 28, 2018

0 votes

0 answers

176

MadeEasy Workbook: Compiler Design - Parsing

Deepesh Pai

445 views

Deepesh Pai asked Nov 28, 2018

1 votes

0 answers

177

MadeEasy Test Series: Compiler Design - Parsing
Why ε is not shown in First(S). First(s) does contain ε . And please help me figure out which grammar is this? According to me it is NOT LL(1) (since it is left factored), NOT LR(0) (Since the Item 0 has a R-R conflict), NOT SLR(1) (The item 0 has a RR conflict since Follow(X) = Follow(Y) = {a,b} correct me If i'm wrong

Why ε is not shown in First(S). First(s) does contain ε . And please help me figure out which grammar is this?According to me it is NOT LL(1) (since it is left factore...

Hopealways

1.4k views

Hopealways asked Nov 23, 2018

0 votes

0 answers

178

test series brilliant classes what approach we have use to solve these kind of questions
Q- the Grammer S-> aSb | bSa |SS |Ɛ a) unambiguous CFG b) ambiguous CFG c) not a CFG d) deterministic CFG

Q- the Grammer S- aSb | bSa |SS |Ɛa) unambiguous CFGb) ambiguous CFGc) not a CFGd) deterministic CFG

shashank joshi

417 views

shashank joshi asked Nov 18, 2018

0 votes

1 answer

179

MadeEasy Workbook: Compiler Design - Parsing
WHICH OF THE FOLLOWING STATEMENTS ARE TRUE? a) S1 & S3 b) S2 & S4 c) S2 & S3 d) None of these Answer is option a. can anyone tell me how option a is correct?

WHICH OF THE FOLLOWING STATEMENTS ARE TRUE?a) S1 & S3b) S2 & S4c) S2 & S3d) None of theseAnswer is option a.can anyone tell me how option a is correct?

Jyoti Kumari97

350 views

Jyoti Kumari97 asked Nov 18, 2018

0 votes

0 answers

180

MadeEasy Workbook: Compiler Design - Parsing
answer is option d can anyone tell me how option d is the correct answer?

answer is option dcan anyone tell me how option d is the correct answer?

Jyoti Kumari97

243 views

Jyoti Kumari97 asked Nov 18, 2018

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