predictive parsing and non-recursive predictive parsing

unix.sh@gmail.com
Mon, 23 Jun 2008 18:56:10 -0700 (PDT)

          From comp.compilers
Related articles
predictive parsing and non-recursive predictive parsing unix.sh@gmail.com (2008-06-23)
Re: predictive parsing and non-recursive predictive parsing kamalpr@hp.com (kamal) (2008-06-24)
Re: predictive parsing and non-recursive predictive parsing torbenm@pc-003.diku.dk (2008-06-24)
Re: predictive parsing and non-recursive predictive parsing max@gustavus.edu (Max Hailperin) (2008-06-24)
Re: predictive parsing and non-recursive predictive parsing james.harris.1@googlemail.com (James Harris) (2008-06-24)
Re: predictive parsing and non-recursive predictive parsing max@gustavus.edu (2008-06-24)
Re: predictive parsing and non-recursive predictive parsing gene.ressler@gmail.com (Gene) (2008-06-25)
[10 later articles]
| List of all articles for this month |
From: unix.sh@gmail.com
Newsgroups: comp.compilers
Date: Mon, 23 Jun 2008 18:56:10 -0700 (PDT)
Organization: Compilers Central
Keywords: parse, question
Posted-Date: 23 Jun 2008 21:58:40 EDT

Hi,


I have one question regarding the difference between those two:


I can use recursive predictive parsing, which is very straightforward.
So what's the advantage of non-recursive predictive parsing. To
perform non-recursive parsing, I need to construct FIRST, FOLLOW sets
and use explicit stack. On the other hand, recursive predictive
parsing is very easy to understand. I understand non-recursive calls
have a better performance than recursive one. Is this the only reason?


Thanks,
Michael


Post a followup to this message

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