Sneha Pardeshi, Author at All About Education

Forum Replies Created

Viewing 6 posts - 1 through 6 (of 6 total)

1. Sneha Pardeshi
  Member
  
  Ritesh Das
  
  i got my scorecard
  
  Apr 04, 2012 at 11:32 am
1. Sneha Pardeshi
  Member
  
  we can consider that the grammar creats empty language
  
  Apr 02, 2012 at 3:59 pm
1. Sneha Pardeshi
  Member
  
  Nishant Vijayvergiya
  
  thanks
  
  Apr 02, 2012 at 3:53 pm
1. Sneha Pardeshi
  Member
  
  Manisha Pandey
  no need of parse tree
  just check whether it has any recursive production rule as suggested by Lorin Ahmed
  or just draw finite automata of that grammar n if it contains any loop or self loop then the language generated by grammar is infinite
  
  Apr 02, 2012 at 8:48 am
1. Sneha Pardeshi
  Member
  
  Abhishek Vijayvargia :
  there are following two possibilities
  
  1)
  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/e
  
  2)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
1. Sneha Pardeshi
  Member
  
  sir
  myself sneha pardeshi from pune
  I am form open categery
  i have cleared both the gate exam 2011 and 2012.
  and my result is as follows….
  
  GATE 2011:
  marks :46
  AIR :2487
  Score : 583
  
  GATE 2012:
  marks :50
  AIR :2445
  Score : 561
  
  so plz tell me
  1) where i can get admission ?
  2) and which result i should consider to apply for admission?
  
  Apr 02, 2012 at 8:13 am

Viewing 6 posts - 1 through 6 (of 6 total)

InI India

Sneha Pardeshi

Forum Replies Created

Follow For All Updates