Why are LR parsers faster than using if conditions

shripal.meghani@philips.com
6 Jun 2004 15:26:40 -0400

          From comp.compilers
Related articles
Why are LR parsers faster than using if conditions shripal.meghani@philips.com (2004-06-06)
Re: Why are LR parsers faster than using if conditions torbenm@diku.dk (2004-06-09)
Re: Why are LR parsers faster than using if conditions alexc@std.com (Alex Colvin) (2004-06-11)
Re: Why are LR parsers faster than using if conditions cdc@maxnet.co.nz (Carl Cerecke) (2004-06-15)
Re: Why are LR parsers faster than using if conditions cdc@maxnet.co.nz (Carl Cerecke) (2004-06-21)
Re: Why are LR parsers faster than using if conditions t.zielonka@zodiac.mimuw.edu.pl (Tomasz Zielonka) (2004-06-25)
Re: Why are LR parsers faster than using if conditions haberg@matematik.su.se (Hans Aberg) (2004-06-26)
[7 later articles]
| List of all articles for this month |
From: shripal.meghani@philips.com
Newsgroups: comp.compilers
Date: 6 Jun 2004 15:26:40 -0400
Organization: Compilers Central
Keywords: parse, question
Posted-Date: 06 Jun 2004 15:26:40 EDT

Hi,


Well intuitively I know that LR parsers are fast, they SHOULD be
faster than using if then conditions etc. But I was hoping to get
some more solid academic reasons to convince a group of people here at
my organization...


regards,
Shripal Meghani

Post a followup to this message

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