LL one

learner_geek asked Aug 5, 2017 • retagged Jun 19, 2022 by Lakshman Bhaiya

310 views

1 votes

Given answer is yes but i think should not be LL(1)

Compiler Design
compiler-design
grammar
ll-parser

+ –

learner_geek asked Aug 5, 2017 • retagged Jun 19, 2022 by Lakshman Bhaiya

learner_geek

310 views

See all

2 2 Comments

Surajit

commented Aug 5, 2017

what are your first and follow sets? Do you find first sets overlapping or first-follow sets overlapping? What I can see is if there is an 'a' in lookahead there might be conflict between two reductions of productions for S and A.

0 votes

learner_geek

commented Aug 5, 2017

I am getting this.

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

Best answer

1 votes

First of S intersection Follow of S = {a} So the grammar is not LL(1)

Mohitkumaraiactr answered Aug 5, 2017 • selected Aug 5, 2017 by learner_geek

Mohitkumaraiactr

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

2 votes

1 answer

sripo asked Nov 10, 2018

3,236 views

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)

Can you give an example which is not LL(1) but is CLR(1)

sripo

3.2k views

sripo asked Nov 10, 2018

Compiler Design
compiler-design
lr-parser
parsing
grammar
ll-parser

+ –

1 votes

1 answer

garvit_vijai asked Oct 10, 2018

893 views

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.

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 som...

garvit_vijai

893 views

garvit_vijai asked Oct 10, 2018

Compiler Design
compiler-design
ll-parser
grammar
parsing

+ –

1 votes

1 answer

smsubham asked Apr 4, 2018

1,038 views

LL(n)
LL(1) parser cannot accept nondeterministic grammar at we have only single lookahead and there can be no predictable parsing in this case. Suppose we have LL(n) and we are given that maximum length of non-determinism in a production is n - 1. Can we use this grammar for LL(n) predictive parsing?

LL(1) parser cannot accept nondeterministic grammar at we have only single lookahead and there can be no predictable parsing in this case. Suppose we have LL(n) and we a...

smsubham

1.0k views

smsubham asked Apr 4, 2018

Compiler Design
compiler-design
ll-parser
parsing
lr-parser
grammar

+ –

0 votes

1 answer

Rahul Ranjan 1 asked Mar 19, 2018

4,954 views

Check if grammar is LL(1) ?
Given a grammar : $E \rightarrow E + T / T$ $T \rightarrow i$ Can I directly say that grammar is not $LL(1)$ because $LL(1)$ can't parse Left Recursive Grammar, without drawing parsing table ?

Given a grammar :$E \rightarrow E + T / T$$T \rightarrow i$Can I directly say that grammar is not $LL(1)$ because $LL(1)$ can't parse Left Recursive Grammar, without dra...

Rahul Ranjan 1

5.0k views

Rahul Ranjan 1 asked Mar 19, 2018

Compiler Design
compiler-design
grammar
parsing
ll-parser
left-recursion

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

2 2 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

2 2 Comments

0