Bonjour Hans, Le dimanche 31 juillet 2005 à 18:43:20, vous écriviez :
HA> On 31 Jul 2005, at 18:03, Baldurien (club internet) wrote: >> Now, I'm asking myself about how bison store the grammar in the >> produced parser : >> >> In class I've seen how to construct the LL(1) table, and the >> transition table for the automata, but since I've seen it only on >> paper, I don't know how I could efficently store this like Bison does >> ? HA> Bison is currently only supporting LALR(1), which is essentially a HA> cut down and compacted form of LR(1). This is described in standard HA> books on compliers, for example, the one by Aho et al. HA> "Compiler..." (the "dragon book"). You might look into the book by HA> Dick Grune, available online (see the FAQ of the newsgroup HA> comp.compilers, published there monthly). In short, the grammar isn't HA> stored at all in the parser, only the states one sees in the HA> ".output" file. HA> Hans Aberg Thank you for the Dick Grune (and Jacob)'s book. I will try to investigate, translate (since I prefer french book :o), and use it. -- Cordialement, Baldurien Courriel : [EMAIL PROTECTED] _______________________________________________ Help-bison@gnu.org http://lists.gnu.org/mailman/listinfo/help-bison
