201 views
0 votes
0 votes
I read somewhere that " If any grammer follows prefix property than it will be LL(k) , otherwise it will be LR(k)".

Now my ques is  ... although that grammer follows prefix property than also it can have Left recursion ... so is above statement correct (that generalised statement)?

Please log in or register to answer this question.

Related questions

810
views
0 answers
0 votes
MiNiPanda asked Jan 15, 2019
810 views
Let L be the language of all strings on [0,1] ending with 1.Let X be the language generated by the grammar G.$S \rightarrow 0S/1A/ \epsilon $A \rightarrow 1S ... end with 1. But is it so?Can't we generate 11 from the grammar?Please verify.
633
views
1 answers
0 votes
Rahul_Rathod_ asked Dec 24, 2018
633 views
consider following grammerS → aSb / aSbb / aSbbb / …..is language generated by above grammer is DCFL?
535
views
0 answers
0 votes
Shivshankar asked Dec 8, 2018
535 views
Which of the following problem is undecidable?A) membership problem for CFLB) membership problem for regular languageC)membership problem for cslD)membership problem for type O language
375
views
0 answers
0 votes
soura1819 asked Sep 20, 2018
375 views
What is the CFG of the language?L = {anbmckdl | where n+m = k+l and n, m, k, l ≥ 1}