From: sinu.nayak2001@gmail.com   
      
   Hi All,   
      
   While going through the book, "Principles of compiler Design", I found   
   the following information in the article discussing about "Transition   
   diagram as a plan for recursive-descent parsers".   
      
   There we said that, If we get a non deterministic transition diagram   
   from the grammar, it is not possible to construct the deterministic   
   equivalent of it. The reason is, we can't just follow the subset-   
   construction method that is applied to make an NFA to DFA, because it   
   can't remember how many recursive calls are made.   
      
   I couldn't understand this fully. Do we need to remember anything such   
   while we go for subset-construction method ? Please help me   
   understanding this.   
      
   Srinu   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)