Register

Is the expressive power of LeftRecursive grammar equivalent to RightRecursive Grammar?

• edited by
329 views
1 votes
1 votes

Can every left recursive grammar be converted to right recusrive grammar?

We have rules for that. So I think the ans is YES.

 Do every DCFL has LL(1) grammar??

If a language is DCFL implies it is unambiguous and deterministic. Thus we can define a grammar for it and if it is left recursive we can convert to right recrusive. So why is this statement false?

LL(1) requirements - Grammar should be unambiguous, left factored ( free from non-determinism) and free from left-recursion.

Just as DCFL has one to one correspondence with LR(1) grammar why does it not have one to one correspondence with LL(1) ?

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

11 votes
11 votes
2 answers
1
Himanshu1 asked Dec 5, 2015
3,035 views
LL(1) expressive power
Does there exist LL(1) grammar for every Regular Language ? OR For Every Regular Language there exist atleast one LL(1) Grammar . True /False
Does there exist LL(1) grammar for every Regular Language ? ORFor Every Regular Language there exist atleast one LL(1) Grammar . True /False
User Avatar
4 votes
4 votes
3 answers
2
ShiveshRoy asked May 13, 2016
6,312 views
Which of the following is true for the left recursive grammar
User Avatar
0 votes
0 votes
1 answer
3
abc1 asked Jan 26, 2019
4,029 views
how to check grammar is lr(1)?
consider the grammar G: S->A|B A->a|c B->b|c where {S,A,B} are non-terminals,{a,b,c} are terminals. Does LR(1) can parse all strings that are generated by grammar G.? Please any one help me to how to check it?
consider the grammar G: S->A|B A->a|c B->b|c where {S,A,B} are non-terminals,{a,b,c} are terminals.Does LR(1) can parse all strings that are generated by gr...
User Avatar
3 votes
3 votes
4 answers
4
Harit asked Apr 25, 2016
5,546 views
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?
Consider the following grammar. How many back tracks are required to generate the string aab from the above grammar?S → aB | aAbA → bAb | aB → aB | ε
User Avatar
Link Copied!