Re[2]: LALR : How it work during parsing time with empty rule ? what to do to the stack?

Bonjour Hans, Le mardi 13 septembre 2005 à 00:45:16, vous écriviez : HA> On 12 Sep 2005, at 23:31, Baldurien (club internet) wrote: >> I've made a little parser in PHP based on bison output file, and I >> experiment a little problem : >> >> When I have to re

LALR : How it work during parsing time with empty rule ? what to do to the stack?

Hello, I've made a little parser in PHP based on bison output file, and I experiment a little problem : When I have to reduce, saying by rule X : Y '+' X I know I have to pop 3 times, but what happens when the rule is simply X : /* empty */ ? I can't pop at all, so what should I do? ___

Re[4]: Which one is "better" ?

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

Re[2]: Which one is "better" ?

Bonjour Hans, Le dimanche 31 juillet 2005 à 11:27:43, vous écriviez : HA> On 31 Jul 2005, at 01:07, Baldurien (club internet) wrote: >> I have a grammar to do for my self, and since this grammar add the >> same expression than the one we could have in a SQL query l

Which one is "better" ?

Hello I have a grammar to do for my self, and since this grammar add the same expression than the one we could have in a SQL query language, I'm wondering which grammar is better in term of performance. My first one is the classical "one production per precedence" : start: VARSTART e_no_p