Register

Recent questions tagged ll-parser

0 votes
2 answers
61
Compiler_design_LL(1)
Given answer is 3. I am getting Two entries.Check it once.
Given answer is 3. I am getting Two entries.Check it once.
User Avatar
2 votes
2 answers
63
Please solve my doubt
Q if any Grammar is LL(1) definitely LALR(1) ? It is true or false Please ans explain in detail.
Q if any Grammar is LL(1) definitely LALR(1) ?It is true or falsePlease ans explain in detail.
User Avatar
7 votes
6 answers
65
LL(1) Grammar
Which of the following statements is true? Every LL(1) grammar is LALR(1). Every LL(1) grammar is CLR(1). AS I think 2nd is True and 1st is False if I am wrong please let me correct.
Which of the following statements is true?Every LL(1) grammar is LALR(1).Every LL(1) grammar is CLR(1). AS I think 2nd is True and 1st is False if I am wrong please let ...
User Avatar
1 votes
1 answer
66
LL one
Given answer is yes but i think should not be LL(1)
Given answer is yes but i think should not be LL(1)
User Avatar
1 votes
1 answer
68
Compiler parser
is this given diagram correct or incorrect if incorrect then please correct it .
is this given diagram correct or incorrect if incorrect then please correct it .
User Avatar
1 votes
0 answers
70
LL grammar and DCFL
True or False , 1) Is every LL grammar have one to one correspondance with DCFL? Please explain with examples.
True or False ,1) Is every LL grammar have one to one correspondance with DCFL?Please explain with examples.
User Avatar
4 votes
2 answers
71
LL(1) Grammer
S -> (L) | a L -> L . S | S Question: Make necessary changes to make it suitable for LL(1) parsing and Construct FIRST and FOLLOW sets.
S - (L) | aL - L . S | SQuestion: Make necessary changes to make it suitable for LL(1) parsing and Construct FIRST and FOLLOW sets.
User Avatar
1 votes
2 answers
74
PARSING
ARE NUMBER OF SHIFT ENTRIES / ACTIONS IN PARSING TABLE OF SLR(1) AND LALR(1) SAME ALWAYS??
ARE NUMBER OF SHIFT ENTRIES / ACTIONS IN PARSING TABLE OF SLR(1) AND LALR(1) SAME ALWAYS??
User Avatar
0 votes
1 answer
76
MadeEasy Subject Test: Compiler Design - Parsing
First(P) = {+, *, t, epsilon, id} AND Follow(P) = {dollar,id} according to me. In that case M[P, DOLLAR] should have P -> QR
First(P) = {+, *, t, epsilon, id} AND Follow(P) = {dollar,id} according to me. In that case M[P, DOLLAR] should have P - QR
User Avatar
1 votes
1 answer
77
COMPILERS DOUBT
IS EVERY LL(1) GRAMMAR LALR(1)?? I DONT KNOW WHETHER ITS TRUE OR NOT? CAN SOMEONE EXPLAIN??
IS EVERY LL(1) GRAMMAR LALR(1)?? I DONT KNOW WHETHER ITS TRUE OR NOT?CAN SOMEONE EXPLAIN??
User Avatar
13 votes
2 answers
78
LL(k) grammars
1. LL(k) grammars have one to one correspondance with DCFL's 2. LR(k) grammars have one to one correspondance with CFL's Which of them is True and explain it bit clearly?
1. LL(k) grammars have one to one correspondance with DCFL's2. LR(k) grammars have one to one correspondance with CFL'sWhich of them is True and explain it bit clearly?
User Avatar
4 votes
1 answer
80
Draw the LL(1) parsing table of the given grammar ?
Consider a Grammar G as follows : $S\rightarrow W$ $W \rightarrow ZXY / XY$ $Y\rightarrow c/\epsilon$ $Z\rightarrow a/d$ $X\rightarrow Xb/\epsilon$ Draw the LL(1) parsing table for the given grammar ? NOTE :- The above grammar is NOT LL(1) .
Consider a Grammar G as follows :$S\rightarrow W$$W \rightarrow ZXY / XY$$Y\rightarrow c/\epsilon$$Z\rightarrow a/d$$X\rightarrow Xb/\epsilon$Draw the LL(1) parsing table...
User Avatar
0 votes
1 answer
81
compiler grammar
Give a grammar which is LL(1) but not LALR(1) .
Give a grammar which is LL(1) but not LALR(1) .
User Avatar
0 votes
1 answer
82
Is this grammar LL1, LR0, SLR1, LALR1, CLR1?
$S\rightarrow (x$ $\text{ }| E]$ $\text{ }| F)$ $X\rightarrow E)$ $\text{ }| F]$ $E\rightarrow A$ $F\rightarrow A$ $A\rightarrow \lambda$
$S\rightarrow (x$$\text{ }| E]$$\text{ }| F)$$X\rightarrow E)$$\text{ }| F]$$E\rightarrow A$$F\rightarrow A$$A\rightarrow \lambda$
User Avatar
3 votes
1 answer
83
Test by Bikram | Compiler Design | Test 1 | Question: 24
Consider the following grammar: $E \rightarrow E + T \mid T$ $T \rightarrow T ^* F \mid F$ $F \rightarrow (E) \mid id$ ... $E \rightarrow TE' , \ \ T \rightarrow FT' , \ \ F \rightarrow (E) \mid id$
Consider the following grammar:$E \rightarrow E + T \mid T$$T \rightarrow T ^* F \mid F$$F \rightarrow (E) \mid id$What are the productions for E, T and F after convertin...
User Avatar
0 votes
1 answer
85
Compiler Design
Consider a CFG contains ‘n’ tokens. What is the best case time complexity of LL(1) parsing n tokens?
Consider a CFG contains ‘n’ tokens. What is the best case time complexity of LL(1) parsing n tokens?
User Avatar
1 votes
1 answer
86
Compiler
User Avatar
1 votes
3 answers
89
Compiler Design
Consider the following grammar , and test whether the grammar is LL(1) or not. S → 1AB | ∈ A → 1AC | 0C B → OS C → 1
Consider the following grammar , and test whether the grammar is LL(1) or not.S → 1AB | ∈A → 1AC | 0CB → OSC → 1
User Avatar
Page: