How do lexical tie-ins work?

I'm curious on how Bison's algorithm works wrt lexical tie-ins[1]. The situation appears to me as a bit of a catch-22. The parser checks the lookahead token to decide when to reduce (right?) but the semantic action may alter the scanner so that the next token shifted is actually different than what

Re: How do lexical tie-ins work?

On Fri, 23 Apr 2010, Zachary Carter wrote: > I'm curious on how Bison's algorithm works wrt lexical tie-ins[1]. The > situation appears to me as a bit of a catch-22. The parser checks the > lookahead token to decide when to reduce (right?) Not always. If the parser doesn't need a lookahead becau

Re: How do lexical tie-ins work?

Hi Zach, please correct me if I am wrong, but I think that a parser generated by bison does not use the look-ahead symbol to decide when to reduce. I suppose, that when the right-hand side of a production has been pushed onto the stack, the parser recognizes this and reduces. (If there would be a

Re: How do lexical tie-ins work?

I forgot to reply to the list, but Joel explained well what I was missing. On Fri, Apr 23, 2010 at 3:28 PM, Martin Alexander David Neumann < madneum...@gmail.com> wrote: > Hi Zach, > > please correct me if I am wrong, but I think that a parser generated by > bison does not use the look-ahead symb