Path: csiph.com!weretis.net!feeder6.news.weretis.net!feeder.usenetexpress.com!feeder1.iad1.usenetexpress.com!216.166.98.84.MISMATCH!border1.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: "SLK Mail" Newsgroups: comp.compilers Subject: Re: some guideline to lexer or parser Date: Wed, 01 Mar 2017 09:27:32 -0800 Organization: SLK Systems Lines: 10 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <17-03-003@comp.compilers> References: <17-02-005@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-15; format=flowed; delsp=yes Content-Transfer-Encoding: 8bit Injection-Info: miucha.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="18198"; mail-complaints-to="abuse@iecc.com" Keywords: lex Posted-Date: 01 Mar 2017 20:23:13 EST X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:1824 Lexing is not hard. If simple enough, you might even use the C library strtok() to tokenize. Re2c is another C possibility. If the grammar is recursive, then recursive descent might be fairly easy to learn. For simple grammars, I still think a parser generator like SLK is the quickest way to get it done in C, C++, C#, Java, or Javascript. The SLK Parser Generator - http://www.slkpg.com