Dark Mode

Recent questions tagged parsing

1 vote

1 answer

151

Applied Course | Mock GATE | Test 1 | Question: 16
Which phase of the compiler generates parse tree? Lexical analyzer Semantic analyzer Syntax analyzer None of them.

Applied Course asked in Compiler Design Jan 16, 2019

by Applied Course

494 views

0 votes

1 answer

152

MadeEasy Subject Test 2019: Compiler Design - Parsing
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 Syntax Tree.

Na462 asked in Compiler Design Jan 16, 2019

by Na462

786 views

2 votes

2 answers

153

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}$

gate_forum asked in Compiler Design Jan 13, 2019

801 views

0 votes

0 answers

154

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 ?

Na462 asked in Theory of Computation Jan 12, 2019

by Na462

690 views

1 vote

0 answers

155

MadeEasy Full Length Test 2019: Compiler Design - Parsing

Sambhrant Maurya asked in Compiler Design Jan 11, 2019

by Sambhrant Maurya

645 views

3 votes

1 answer

156

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

Sambhrant Maurya asked in Compiler Design Jan 11, 2019

by Sambhrant Maurya

2.4k views

1 vote

1 answer

157

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)

Prince Sindhiya asked in Compiler Design Jan 11, 2019

by Prince Sindhiya

741 views

0 votes

0 answers

158

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

amit166 asked in Compiler Design Jan 9, 2019

603 views

1 vote

2 answers

159

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}$

admin asked in Compiler Design Jan 5, 2019

by admin

599 views

0 votes

1 answer

160

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.

`JEET asked in Compiler Design Jan 3, 2019

by `JEET

2.2k views

0 votes

2 answers

161

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$

Arjun asked in Compiler Design Jan 2, 2019

by Arjun

1.9k views

1 vote

1 answer

162

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

susgir2 asked in Compiler Design Jan 2, 2019

931 views

0 votes

0 answers

163

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

sushmita asked in Compiler Design Dec 31, 2018

397 views

0 votes

2 answers

164

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………………..!!!!!!!!!!!

Raj Kumar 7 asked in Compiler Design Dec 30, 2018

393 views

4 votes

1 answer

165

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

Ruturaj Mohanty asked in Compiler Design Dec 27, 2018

by Ruturaj Mohanty

1.5k views

0 votes

0 answers

166

Zeal Test Series 2019: Compiler Design - Parsing

Prince Sindhiya asked in Compiler Design Dec 21, 2018

by Prince Sindhiya

334 views

1 vote

0 answers

167

PARSER
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 asked in Compiler Design Dec 20, 2018

by junaid ahmad

623 views

0 votes

1 answer

168

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

Nivedita Singh asked in Compiler Design Dec 9, 2018

by Nivedita Singh

1.8k views

0 votes

2 answers

169

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)?

newdreamz a1-z0 asked in Compiler Design Dec 8, 2018

by newdreamz a1-z0

980 views

0 votes

0 answers

170

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???

Hira Thakur asked in Compiler Design Dec 3, 2018

244 views

0 votes

0 answers

171

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?

ShruteeP asked in Compiler Design Dec 3, 2018

422 views

0 votes

2 answers

172

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

Pavan Shetty asked in Compiler Design Dec 1, 2018

by Pavan Shetty

1.3k views

0 votes

1 answer

173

Deepesh Pai asked in Compiler Design Nov 28, 2018

378 views

0 votes

0 answers

174

MadeEasy Workbook: Compiler Design - Parsing

Deepesh Pai asked in Compiler Design Nov 28, 2018

447 views

1 vote

0 answers

175

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

Hopealways asked in Compiler Design Nov 23, 2018

1.4k views

0 votes

0 answers

176

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

shashank joshi asked in Theory of Computation Nov 18, 2018

by shashank joshi

397 views

0 votes

1 answer

177

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?

Jyoti Kumari97 asked in Compiler Design Nov 18, 2018

by Jyoti Kumari97

341 views

0 votes

0 answers

178

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

Jyoti Kumari97 asked in Compiler Design Nov 18, 2018

by Jyoti Kumari97

238 views

0 votes

1 answer

179

MadeEasy Workbook: Compiler Design - Parsing
COMMENT(how the below statement is true) LL(k) languages are proper subset of LL(k-1) languages.

Jyoti Kumari97 asked in Compiler Design Nov 18, 2018

by Jyoti Kumari97

342 views

0 votes

1 answer

180

Parsing techniques
Consider the grammar S->a/ab/abc A) it is LL(1) B) it is LL(2) C) it is LL(3)

Prasanna Devi asked in Compiler Design Nov 17, 2018

by Prasanna Devi

356 views

Page:

« prev
1
2
3
4
5
6
7
8
9
10
11
...
23
next »

Recent questions tagged parsing