-
-
-
-
Kaza Visweswara Rao
Memberthis may be a typo
or
please read this http://www.cs.uky.edu/~lewis/texts/theory/languages/cfl-prop.pdf
here we can just remove T and can parse so that we can find first() and follow()
Dec 17, 2011 at 7:57 am
-
-
-
Sneha Pardeshi
MemberAbhishek Vijayvargia :
there are following two possibilities1)
there is some printing mistake
in the 2nd production rule
there should be T instead of F
means it should be like these
T->FT/*FT/e2)and if it is not the case then T becomes useless symbol n entire grammer becomes
E->e
and first(E)= e
follow(E)={$}
and grammer is LL(1)but most probably i think it may b the 1st case bcoz I am not sure about 2nd case bcoz in 2nd case there is no terminal symbol and grammer itself becomes useless
Apr 02, 2012 at 8:41 am
-
-
-
Sneha Pardeshi
Memberwe can consider that the grammar creats empty language
Apr 02, 2012 at 3:59 pm
-
-
You must be logged in to reply to this topic.
Consider the following question
********************************
show whether the following grammar is LL(1) or not
E –> TE/+TE/e
F –> FT/*FT/e
F –> (E)/id
where is is epsilon
****************************************
that ques was in our university exam.
i think the ques was wrong
because there is “T” in second production left side in the place of “F”.
and “T” production are also not given.
so we cannot find its FIRST.
rpl me is the ques is correct without any modification or cannot be solved
We will get bonus marks if it is a printing mistake