|Newbie: Does an LR(k) parser compute the FIRST set? firstname.lastname@example.org (Ulrich Frank) (2006-02-12)|
|Re: Newbie: Does an LR(k) parser compute the FIRST set? email@example.com (Sylvain Schmitz) (2006-02-14)|
|Newbie: Does an LR(k) parser compute the FIRST set? firstname.lastname@example.org (Etienne Gagnon) (2006-02-14)|
|Re: Newbie: Does an LR(k) parser compute the FIRST set? email@example.com (Ulrich Frank) (2006-02-14)|
|From:||"Ulrich Frank" <firstname.lastname@example.org>|
|Date:||12 Feb 2006 11:02:34 -0500|
|Posted-Date:||12 Feb 2006 11:02:34 EST|
I'm a newbie in compiler building and have general problems.
- Does a LR-Parser also compute the FIRST and FOLLOW sets like a
- Especially in practical aspects: if so, can I get access to the FIRST
set in an (LA)LR Parser like JavaCUP or SableCC?
- What are examples for LR-Parser generators (LL-Parser generators I
found are ANTLR and JavaCC, LALR are JavaCUP and SableCC)?
So far I used ANTLR for generating a grammar. I've chosen ANTLR
because I need to analyse the FIRST set. Now I've read that LR-Parsers
are much more efficient and faster then LL-Parsers, so I want to
change but I don't know if I can access the FIRST set in an
(LA)LR-Parser like JavaCUP and I haven't read anything towards
this. So can you help me. Thanks,
[Yes, LR parsers need first and follow sets. The most popular LALR parser
generators are yacc and bison, though recent versions of bison are moving
to GLR parsing. -John]
Return to the
Search the comp.compilers archives again.