regarding creation of a parsing table when we construct a nonrecursive predictive parser

shobeyaar@yahoo.com (saurabh)
11 Mar 2002 02:15:43 -0500

          From comp.compilers
Related articles
regarding creation of a parsing table when we construct a nonrecursi shobeyaar@yahoo.com (2002-03-11)
| List of all articles for this month |
From: shobeyaar@yahoo.com (saurabh)
Newsgroups: comp.compilers
Date: 11 Mar 2002 02:15:43 -0500
Organization: http://groups.google.com/
Keywords: parse, question
Posted-Date: 11 Mar 2002 02:15:42 EST

The Book by Aho gives 2 fns. FIRST and FOLLOW along with ways to
compute them.


I am not able to Work out FOLLOW(A) for any nonterminal A with using
the definition of FOLLOW(A).(Not using the 3 step rule to construct
FOLLOW set but just the basic definition)


Second problem is that what is the importance of $ in FOLLOW(A)


I you find any soln. please mail me at
      shobeyaar@yahoo.com

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.