Path: csiph.com!x330-a1.tempe.blueboxinc.net!newsfeed.hal-mli.net!feeder1.hal-mli.net!news.linkpendium.com!news.linkpendium.com!news.iecc.com!nerds-end From: "Armel" Newsgroups: comp.compilers Subject: coupling LALR with a scanner? Date: Tue, 5 Jul 2011 01:02:22 +0200 Organization: les newsgroups par Orange Lines: 16 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <11-07-013@comp.compilers> NNTP-Posting-Host: news.iecc.com X-Trace: gal.iecc.com 1310011406 20880 64.57.183.58 (7 Jul 2011 04:03:26 GMT) X-Complaints-To: abuse@iecc.com NNTP-Posting-Date: Thu, 7 Jul 2011 04:03:26 +0000 (UTC) Keywords: parse, lex, question Posted-Date: 07 Jul 2011 00:03:26 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: x330-a1.tempe.blueboxinc.net comp.compilers:189 Hi, I am exploring the possibility of choosing between several lexers depending on the current state of an LALR parser (i.e. if a state can accept productions such as A => A . 'a' b, B => . 'c', then the selected lexer will accept (at least) 'a' and 'c', for rightmost positions the lookahead symbols would be acceptable as well) Is there any literature about this? or example? I searched around for scannerless/lexerless parsing but could not make my mind. Regards Armel Asselin [The usual approach is to set flex start states in your yacc or bison parser. -John]