|Bison version of the LALR(1) algorithm email@example.com (2001-11-29)|
|Re: Bison version of the LALR(1) algorithm firstname.lastname@example.org (Pete Jinks) (2001-12-07)|
|Re: Bison version of the LALR(1) algorithm email@example.com (2001-12-07)|
|Re: Bison version of the LALR(1) algorithm firstname.lastname@example.org (2001-12-15)|
|Re: Bison version of the LALR(1) algorithm email@example.com (2001-12-20)|
|From:||firstname.lastname@example.org (Hans Aberg)|
|Date:||29 Nov 2001 23:05:49 -0500|
|Keywords:||parse, yacc, question|
|Posted-Date:||29 Nov 2001 23:05:49 EST|
Can somebody give a reference to a description of the LALR(1)
algorithm that Bison uses?
The file state.h of the Bison sources says that first, a
non-deterministic finite state machine that parses the specified
grammar is created; it is then converted into a deterministic finite
This seems to differ from the description in say Aho et al
"Compilers", which creates the deterministic machine directly. (The
book has hints to the effect that this corresponds to the NFA -> DFA
translation, but does not describe this explicitly in detail.)
Hans Aberg * Anti-spam: remove "remove." from email address.
* Email: Hans Aberg <email@example.com>
* Home Page: <http://www.matematik.su.se/~haberg/>
* AMS member listing: <http://www.ams.org/cml/>
Return to the
Search the comp.compilers archives again.