Re: some guideline to lexer or parser

"SLK Mail" <slkpg4@gmail.com>
Wed, 01 Mar 2017 09:27:32 -0800

          From comp.compilers
Related articles
some guideline to lexer or parser noemail@no.spam.com (chano) (2017-02-27)
Re: some guideline to lexer or parser gneuner2@comcast.net (George Neuner) (2017-02-27)
Re: some guideline to lexer or parser haberg-news@telia.com (Hans Aberg) (2017-02-27)
Re: some guideline to lexer or parser DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2017-02-28)
Re: some guideline to lexer or parser slkpg4@gmail.com (SLK Mail) (2017-03-01)
| List of all articles for this month |
From: "SLK Mail" <slkpg4@gmail.com>
Newsgroups: comp.compilers
Date: Wed, 01 Mar 2017 09:27:32 -0800
Organization: SLK Systems
References: 17-02-005
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

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

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.