Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ll-parser
1
votes
1
answer
91
how to convert an arbitrary CFG to an LL(1) grammar?
cse23
5.7k
views
cse23
asked
Jun 21, 2016
Compiler Design
compiler-design
context-free-grammar
ll-parser
+
–
2
votes
2
answers
92
How to convert this Grammar into LL(1) grammar ?
S → a S b S | b S a S | ε
S → a S b S | b S a S | ε
shekhar chauhan
3.5k
views
shekhar chauhan
asked
Jun 1, 2016
Compiler Design
compiler-design
parsing
ll-parser
+
–
0
votes
1
answer
93
Compiler
There may exist a grammar that is non LL(1) but generating an LL(1) language. Explain whether the above statement is true or false .
There may exist a grammar that is non LL(1) but generating an LL(1) language.Explain whether the above statement is true or false .
ManojK
358
views
ManojK
asked
Jun 1, 2016
Compiler Design
compiler-design
grammar
parsing
ll-parser
descriptive
+
–
2
votes
1
answer
94
S-> iEtSS'|a S-> eS|epsilon E->b
The LL(1) parsing table for the above grammar is Nonterminal a b e i t ... WHY we always choose S' ->eS production to remain in this parse table why not S' -> epsilon? Answer this..???
The LL(1) parsing table for the above grammar is Nonterminalabeit$SS->a S->iEtSS' S' S' ->epsilonS' ->es S'->epsilonE E->b By looking the parse table we found mult...
Ashwani Kumar 2
13.0k
views
Ashwani Kumar 2
asked
Apr 20, 2016
Compiler Design
compiler-design
parsing
ll-parser
ambiguous-grammar
+
–
2
votes
2
answers
95
S-->A|B A-->a|epsilon B-->b|epsilon Is this grammar LL(1) ??
Ashwani Kumar 2
2.2k
views
Ashwani Kumar 2
asked
Apr 18, 2016
Compiler Design
compiler-design
grammar
parsing
ll-parser
+
–
0
votes
0
answers
96
Give LL(1) parsing table. I/P ="ab*"
Deepaank Satyam Sinh
549
views
Deepaank Satyam Sinh
asked
Jan 18, 2016
Compiler Design
compiler-design
grammar
ll-parser
+
–
1
votes
1
answer
97
Is the following grammar LL1
In the explanation, it is mentioned as follows Now , my question is how First(B) is a here. Can you please explain it ?
In the explanation, it is mentioned as followsNow , my question is how First(B) is a here. Can you please explain it ?
worst_engineer
548
views
worst_engineer
asked
Jan 4, 2016
Compiler Design
compiler-design
grammar
ll-parser
test-series
+
–
1
votes
2
answers
98
Identify LL(1) or not
Himanshu1
1.5k
views
Himanshu1
asked
Jan 1, 2016
Compiler Design
compiler-design
ll-parser
test-series
+
–
0
votes
1
answer
99
Lr(k)
sourabh
207
views
sourabh
asked
Dec 29, 2015
Compiler Design
compiler-design
parsing
lr-parser
ll-parser
test-series
+
–
2
votes
2
answers
100
Compiler general query LL(1)
check whether the following grammer is ll(1) grammar or not and also find the table entry of [A,a]. S ->A, A->aB/Ab, B->bBC/d, C->d Why is this not a LL(1) grammar?
check whether the following grammer is ll(1) grammar or not and also find the table entry of [A,a].S ->A,A->aB/Ab,B->bBC/d,C->dWhy is this not a LL(1) grammar?
khushtak
1.1k
views
khushtak
asked
Dec 12, 2015
Compiler Design
compiler-design
ll-parser
+
–
1
votes
1
answer
101
what is the lookahead symbol in LL(1) grammar ?
Top down parsers parse LL(K) grammar ,Now if we talk about recursive descent parsers they just scan each input symbol and then perform their respective function calls ,or even LL(1) parsers also see the input symbol and accordingly chose the ... then push the symbols onto stack so then where do they see the look-ahead symbols, I am not getting this .
Top down parsers parse LL(K) grammar ,Now if we talk about recursive descent parsers they just scan each input symbol and then perform their respective function calls ,or...
radha gogia
4.3k
views
radha gogia
asked
Dec 6, 2015
Compiler Design
compiler-design
parsing
ll-parser
+
–
2
votes
2
answers
102
how to solve it??
Consider the following LL(1) grammar. E → TE′ E′ → + E|ε T → FT′ T′ → T|ε F → GF′ F′ → *F′|ε G → (E)|a|b|c Initially stack contains two symbols. Bottom of stack symbol is $ and top of stack (above $) symbol is E where E is start symbol of the grammar. The number of symbols on the stack after the sixth action taken by LL(1) parser to parse the input “ab*” are ______.
Consider the following LL(1) grammar.E → TE′E′ → + E|εT → FT′T′ → T|εF → GF′F′ → *F′|εG → (E)|a|b|cInitially stack contains two symbols. Bo...
Hira Thakur
4.2k
views
Hira Thakur
asked
Nov 16, 2015
Compiler Design
compiler-design
parsing
ll-parser
+
–
1
votes
2
answers
103
Which type of conflict is present ?
Hi , I am confused about this grammar . I can find there is one SR conflict , please clarify. S -> Aa | bAc | dc | bda A -> d Here , it is not LL1 as A -> bAc and S -> bda both need to placed in the same cell. Also , should I say that S -> Aa and A -> d are also SR conflicts as they both derive d ? And for that it is not LR(0) as well .
Hi , I am confused about this grammar .I can find there is one SR conflict , please clarify. S - Aa | bAc | dc | bdaA - d Here , it is not LL1 as A - bAc and S - bda both...
worst_engineer
1.9k
views
worst_engineer
asked
Sep 11, 2015
Compiler Design
compiler-design
parsing
lr-parser
ll-parser
+
–
Page:
« prev
1
2
3
4
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register