Dark Mode

Recent questions tagged ll-parser

0 votes

1 answer

1

Compiler Design self Doubt
"Every Regular Grammar has a Right linear grammar and this is LL(1)" What is meaning of this statement exactly and does it hold always? My Assumptions: If a grammar is right linear grammar then it can be parser by LL(1) ->I ... right linear grammar. But this is not suffice to make grammar LL(1). Correct if I assumed anything wrong with some intutive answer.

vishnu777 asked in Compiler Design Nov 25, 2022

102 views

1 vote

1 answer

2

Test series Made easy
How to solve this ? Please help.

raja11sep asked in Compiler Design Dec 31, 2021

449 views

0 votes

1 answer

3

#self doubt
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 using recursive descent parser??

samarpita asked in Compiler Design Nov 18, 2021

126 views

0 votes

0 answers

4

Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 6 (Page No. 258)
Show that the following grammar: $S\rightarrow SA\mid A$ $A\rightarrow a$ is SLR(1) but not LL(1).

Lakshman Patel RJIT asked in Compiler Design Aug 20, 2019

by Lakshman Patel RJIT

323 views

1 vote

0 answers

5

Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 5 (Page No. 258)
Show that the following grammar: $S\rightarrow AaAb\mid BbBa$ $A\rightarrow \epsilon$ $A\rightarrow\epsilon$ is LL(1) but not SLR(1).

Lakshman Patel RJIT asked in Compiler Design Aug 20, 2019

by Lakshman Patel RJIT

216 views

2 votes

4 answers

6

COMPILER DESIGN: Dragon Book self doubt
S→ A/a A→ a LL1 or not?

Hirak asked in Compiler Design Jun 4, 2019

by Hirak

662 views

0 votes

1 answer

7

Compiler design Self doubt
S → aSbS /bSaS / ϵ S → aABb A→ c/ ϵ B → d/ ϵ Which of the following is LL1. Explain in details.

Hirak asked in Compiler Design Jun 1, 2019

by Hirak

1.1k views

1 vote

1 answer

8

Self-Doubt-Compiler
$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?

Ayush Upadhyaya asked in Compiler Design Mar 3, 2019

by Ayush Upadhyaya

440 views

0 votes

1 answer

9

Predictive parsing
Get LL(1) parsing table for the following grammar A--> aCDq / aBg C --> p /Ct / BD / rAB D--> d B-->e

Sagar Chintawar asked in Compiler Design Feb 12, 2019

by Sagar Chintawar

1.3k views

0 votes

1 answer

10

Predictive
Construct the predictive parsing table for the grammar and tell whether the grammar is LL(1) or not S --> (L) / a L --> L, S / S

Sagar Chintawar asked in Compiler Design Feb 12, 2019

by Sagar Chintawar

342 views

0 votes

1 answer

11

Self doubt
We know that a grammar is contain 1-left recursive 2-ambiguous 3-Common prefix Then grammar is not LL(1) If let I constructed M-TABLE or PARSE TABLE of grammar which is not contain left recursive and common prefixes . Let consider I am not able to find out ... not , If LL(1) parse table contains multiple choice in same row and column then Can I said that grammar is ambiguous or not?

Ashish RajAnand asked in Compiler Design Feb 5, 2019

by Ashish RajAnand

207 views

2 votes

1 answer

12

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 7
Which of the following is a requirement for an LL(1) grammar? Unambiguity No left recursion If $A \to \alpha \mid \beta$ are two productions, then $FIRST(\alpha)$ and $FIRST(\beta)$ are disjoint (i) and (ii) (iii) (i), (ii) and (iii) (ii) and (iii)

Arjun asked in Compiler Design Jan 26, 2019

by Arjun

2.3k views

2 votes

2 answers

13

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

471 views

1 vote

0 answers

14

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.0k views

0 votes

0 answers

15

LL grammar
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 | lambda b. none

gate_forum asked in Compiler Design Nov 17, 2018

400 views

0 votes

1 answer

16

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

196 views

0 votes

0 answers

17

Self doubt
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 RECURSiON which is allowed in LL(1) ???

jatin khachane 1 asked in Compiler Design Nov 16, 2018

by jatin khachane 1

151 views

2 votes

1 answer

18

If grammar is not LL(1) then it can never be CLR(1) or LALR(1)?
Can you give an example which is not LL(1) but is CLR(1)

sripo asked in Compiler Design Nov 10, 2018

by sripo

2.4k views

1 vote

1 answer

19

LL(1) Parsing
To compute FOLLOW(A) for any grammar symbol A a) We must compute FIRST of some grammar symbols. b) No need of computing FIRST of some symbols. c) Maybe compute FIRST of some symbols. d) None of the above. The answer is given as option (A) but if we take ... will definitely in FOLLOW(S) and we didn't computed FIRST of any symbol for it. So option (C) should be the answer.

garvit_vijai asked in Compiler Design Oct 10, 2018

by garvit_vijai

715 views

1 vote

5 answers

20

LL(1)
Every LL(1) grammar is ______ A.SLR(1) B.LALR(1) C.LR(1) D.Both B & C

syncronizing asked in Compiler Design Sep 22, 2018

by syncronizing

1.3k views

0 votes

0 answers

21

Self doubt
What is relation between CGF, Regular grammar, CSG, LL(1), LL(k), LR(0), SLR(1), LALR(1), CLR(1). What is the meaning of expressive power? I know that LR(0)<SLR(1)<LALR(1)<CLR(1), what is the meaning of this?

Vegeta asked in Compiler Design Sep 17, 2018

by Vegeta

413 views

1 vote

0 answers

22

Doubt
A LL(k) parser recognizes the languages generated by some ε-free LL(k) grammar. (From Wikiepedia) Why epsilon free LL(k) grammar?

soumayan bandhu asked in Compiler Design Sep 16, 2018

by soumayan bandhu

73 views

0 votes

2 answers

23

Compiler design

Deepalitrapti asked in Compiler Design Jul 19, 2018

by Deepalitrapti

157 views

0 votes

2 answers

24

Tell me the answer plsss
S-> ABA A-> Bc|dA|€ B-> eA How many entries have multiple production in LL (1) table

Deepalitrapti asked in Compiler Design Jul 16, 2018

by Deepalitrapti

132 views

1 vote

1 answer

25

LL(1)
Check whether the following grammar is $LL(1)$ or not? $S \rightarrow aAbA/Ba$ $B \rightarrow b/ \epsilon$ $A \rightarrow aBb/ \epsilon$

saumya mishra asked in Compiler Design Jun 5, 2018

by saumya mishra

650 views

Page:

1
2
3
4
next »

Recent questions tagged ll-parser