Recent questions tagged ll-parser

0 votes
1 answer
3
0 votes
1 answer
7
What is the difference between recursive descent parser and ll(1) parser, since in both no left recursion and left factoring is allowed…..then what is the advantage of ...
2 votes
0 answers
9
0 votes
1 answer
11
S → aSbS /bSaS / ϵS → aABb A→ c/ ϵ B → d/ ϵWhich of the following is LL1. Explain in details.
1 votes
1 answer
12
$L=\{x^n:n \in N\} \cup\{x^ny^n|n \in N\}$This language does not have LL(k) parser while being deterministic context free.Why?
0 votes
1 answer
13
0 votes
1 answer
14
Construct the predictive parsing table for the grammar and tell whether the grammar is LL(1) or notS (L) / aL L, S / S
2 votes
1 answer
16
0 votes
0 answers
19
LL grammar for the language:$L = \{a^mb^nC^{n+m} \mid m\geq 0, n\geq 0\}$ is a. S->aSc | S1 ; S1 - bS1c | lambdab. none
0 votes
1 answer
20
Consider the grammarS->a/ab/abcA) it is LL(1)B) it is LL(2)C) it is LL(3)
0 votes
0 answers
21
Show that no grammar that has cycles can be LL(1).Is it true ??It is saying if the grammar has cycle it can't be LL(1)But what if the cycle in grammar is due to RIGHT REC...
1 votes
5 answers
24
Every LL(1) grammar is ______A.SLR(1)B.LALR(1)C.LR(1)D.Both B & C