The Gateway to Computer Science Excellence
+1 vote

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) ?

in Compiler Design by Active (3.2k points)
edited by | 180 views

Please log in or register to answer this question.

Quick search syntax
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
50,737 questions
57,370 answers
105,275 users